Abstract: Various examples are directed to systems and methods for controlling an autonomous vehicle. For example, a navigator system at an autonomous vehicle may generate a plurality of local routes beginning at a vehicle location and extending to a plurality of local route end points. The navigator system may access general route cost data, the general route cost data describing general route costs from the plurality of local route end points to a trip end point. The navigator system may select the first local route of the plurality of routes based at least in part on the general route cost data. A vehicle autonomy system at the autonomous vehicle may begin to control the autonomous vehicle along the first local route.

Abstract: A method, system, and/or computer program product adjust values of a plurality of conditions. A processor receives a user input, which is a movement across a user interface. A tendency of the movement, which describes a direction and velocity of the movement, is determined. According to the tendency of the movement, a processor adjusts a value of at least one of the plurality of conditions by using a plurality of graphs representing the plurality of conditions, where the plurality of conditions describe search criteria, and where the user input describes the search criteria.

Abstract: The present invention provides an integrated water-cooled air conditioning device, which comprises a cooling water tank device and an air conditioning system. The cooling water tank device includes a cooling water tank. A water tank region is disposed at the bottom of the cooling water tank for accommodating water. The air conditioning system includes a compressor, a condenser, a regulator, and an evaporator connected sequentially by a refrigerant piping. The condenser is formed by spirally bending the refrigerant piping to a spiral hollow tube in the water tank region. Thereby, the air conditioning system and the cooling-water circulation system can be connected integrally for miniaturization. The shortcomings of long heat dissipation loop, high pressure loss, and large size can be solved. Accordingly, the installation costs can be lowered, and the subsequent maintenance management can be convenient.

Abstract: Embodiments utilize trained query performance machine learning (QP-ML) models to predict an optimal compute node cluster size for a given in-memory workload. The QP-ML models include models that predict query task runtimes at various compute node cardinalities, and models that predict network communication time between nodes of the cluster. Embodiments also utilize an analytical model to predict overlap between predicted task runtimes and predicted network communication times. Based on this data, an optimal cluster size is selected for the workload. Embodiments further utilize trained data capacity machine learning (DC-ML) models to predict a minimum number of compute nodes needed to run a workload. The DC-ML models include models that predict the size of the workload dataset in a target data encoding, models that predict the amount of memory needed to run the queries in the workload, and models that predict the memory needed to accommodate changes to the dataset.

Abstract: Embodiments implement a prediction-driven, rather than a trial-driven, approach to automate database configuration parameter tuning for a database workload. This approach uses machine learning (ML) models to test performance metrics resulting from application of particular database parameters to a database workload, and does not require live trials on the DBMS managing the workload. Specifically, automatic configuration (AC) ML models are trained, using a training corpus that includes information from workloads being run by DBMSs, to predict performance metrics based on workload features and configuration parameter values. The trained AC-ML models predict performance metrics resulting from applying particular configuration parameter values to a given database workload being automatically tuned. Based on correlating changes to configuration parameter values with changes in predicted performance metrics, an optimization algorithm is used to converge to an optimal set of configuration parameters.

Abstract: A handle set (30) comprises an elongated handle (40) that is attached to a corresponding door (32) at two spaced apart locations. A knob (42) is disposed on the door (32) opposite the handle (40). A retractor assembly (80) is interposed between the handle (40) and the knob (42). A handle spindle (62) extends from the handle (40), and a knob spindle (60) extends from the knob (42). The handle and knob spindle overlap one another, and are configured to move axially with one another. However, the knob spindle (60) can be rotated relative to the handle spindle (62). The spindles are configured to interact with the retractor assembly (80) so that pushing the handle (40) or pulling the knob (42) actuates the retractor to withdraw the latch bolt (50), or rotating the knob (42) actuates the retractor to withdraw the latch bolt (50).

Abstract: Generating reports. Identifying user webpage interaction information and source webpage content. Determining a portion of the source code that corresponds to the user webpage interaction information. Determining interactions of the one or more interactions associated with each of a plurality of users. Determining a click path associated with each user. Determining a similarity score between a first and a second source webpage. Determining the similarity score exceeds a threshold value. Combining a portion of each click path associated with the first source webpage with a portion of each click path associated with the second source webpage. Merging a first portion of source code associated with the first source webpage with a second portion of source code associated with the second source webpage. Creating a three-dimensional representation that includes the combined portion of each click path associated with the first and the second webpage and the merged source code.

Abstract: Techniques are described herein for building a framework for declarative query compilation using both rule-based and cost-based approaches for database management. The framework involves constructing and using: a set of rule-based properties tables that contain optimization parameters for both logical and physical optimization, a recursive algorithm to form candidate physical query plans that is based on the rule based tables, and a cost model for estimating the cost of a generated physical query plan that is used with the rule based properties tables to prune inferior query plans.

Abstract: The disclosure proposes a method of fixed-rate line-based embedded video compression and an image processing apparatus using the same method. The method includes at least the following steps. A current encoding frame is received. Pixels in a current encoding frame are grouped on a line-by-line basis, and the grouped pixels are packed into pixel segments. Complexity information of a current pixel segment is calculated according to the pixels therein and neighboring pixels thereof. The current pixel segment is respectively encoded in a differential pulse-coding modulation (DPCM) mode and a truncation mode to generate a DPCM bitstream and a truncated bitstream according to a quantization parameter (QP). Either the DPCM bitstream or the truncated bitstream is selected and outputted according to the complexity information. An amount of bits used by the current pixel segment is feedback to calculate a new QP corresponding to a next pixel segment to be processed.

Abstract: A cellulase having improved enzymatic activity is disclosed. The cellulase has a modified amino acid sequence of SEQ ID NO: 2 or a modified amino acid sequence with at least 80% sequence identity of SEQ ID NO: 2, wherein the modification is a substitution of methionine at position 120 or a corresponding position with asparagine.

Abstract: A xylosidase having improved enzymatic activity is disclosed. The amino acid sequence of the xylosidase is a modified amino acid sequence of SEQ ID NO: 2, wherein the modification is a substitution of phenylalanine at position 35 with glutamate, and/or a substitution of glutamine at position 41 with histidine.

Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory.

Abstract: A lysozyme having improved enzymatic activity is disclosed. The amino acid sequence of the lysozyme is a modified amino acid sequence of SEQ ID NO: 2 or a modified amino acid sequence with at least 80% sequence identity of SEQ ID NO: 2, wherein the modification is a substitution of histidine at position 166 or a corresponding position with lysine.

Abstract: A lysozyme having improved enzymatic activity is disclosed. The amino acid sequence of the lysozyme is a modified amino acid sequence of SEQ ID NO: 2 or a modified amino acid sequence with at least 80% sequence identity of SEQ ID NO: 2, wherein the modification is a substitution of histidine at position 166 or a corresponding position with lysine.

Abstract: A xylosidase having improved enzymatic activity is disclosed. The amino acid sequence of the xylosidase is a modified amino acid sequence of SEQ ID NO: 2, wherein the modification is a substitution of phenylalanine at position 35 with glutamate, and/or a substitution of glutamine at position 41 with histidine.

Abstract: A lockset (10) is actuable by pivoting a lever (14,16) about a longitudinal axis of the lockset (10) by rotating the lever (14,16) and by pivoting the lever (14,16) about an axis transverse to the lockset axis, such as by pushing or pulling. The lockset (10) includes an inside lever (14) and an outside lever (16), each associated with an independent mechanism, each of which can independently actuate the lockset (10). A keyed locking cylinder (250) is disposed axially in the outside lever (16) and pivots with the outside lever (16). The keyed lock cylinder (250) has an opening that pivotably engages an actuator (260). The actuator (260) extends into a retractor assembly (33) of the lockset (10) and is configured to perform an unlocking or locking function when actuated.

Abstract: A glucose oxidase having improved thermostability is disclosed. The amino acid sequence of the glucose oxidase is a modified amino acid sequence of SEQ ID NO: 2, wherein the modification is a substitution of glutamate at position 129 with proline, and/or a substitution of glutamine at position 243 with valine.

Abstract: Generating reports. Identifying user webpage interaction information and source webpage content. Determining a portion of the source code that corresponds to the user webpage interaction information. Determining interactions of the one or more interactions associated with each of a plurality of users. Determining a click path associated with each user. Determining a similarity score between a first and a second source webpage. Determining the similarity score exceeds a threshold value. Combining a portion of each click path associated with the first source webpage with a portion of each click path associated with the second source webpage. Merging a first portion of source code associated with the first source webpage with a second portion of source code associated with the second source webpage. Creating a three-dimensional representation that includes the combined portion of each click path associated with the first and the second webpage and the merged source code.

Abstract: Generating reports. Identifying user webpage interaction information and source webpage content. Determining a portion of the source code that corresponds to the user webpage interaction information. Determining interactions of the one or more interactions associated with each of a plurality of users. Determining a click path associated with each user. Determining a similarity score between a first and a second source webpage. Determining the similarity score exceeds a threshold value. Combining a portion of each click path associated with the first source webpage with a portion of each click path associated with the second source webpage. Merging a first portion of source code associated with the first source webpage with a second portion of source code associated with the second source webpage. Creating a three-dimensional representation that includes the combined portion of each click path associated with the first and the second webpage and the merged source code.

Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory.