Abstract: A system and method is used to manage scheduling of a plurality of print jobs in a multi-site print shop environment. The multi-site environment includes a plurality of print shops each having resources and equipment to complete at least one type of print job. Also included is a multi-site scheduler configuration arranged to assign and schedule print jobs to one of a home shop and a non-home shop. The assigning and scheduling is based on a fastest completion time, wherein a completion time of a print job in a home shop is defined as the actual time taken to complete the print job and a completion time of a print job in a non-home shop is defined as the actual time taken to complete the print job and a transportation delay.

Abstract: An oral care product array includes a handle component and multiple refill components therefor. The handle component includes a power source. A first refill component includes a first light generating module which emits light in a first spectrum from the first refill component. A second refill component includes a second light generating module which emits light in a second spectrum from the second refill component. Each refill component has a coupled state, when coupled to the handle component, and a decoupled state, when decoupled from the handle component. When the first refill component is in the coupled state, the first light generating module is powered by the power source to emit light in the first spectrum. When the second refill component is in the coupled state, the second light generating module is powered by the power source to emit light in the second spectrum.

Abstract: A device and a method for electromagnetic field simulation are provided. The image processing device is to obtain, with a first resolution, a first electromagnetic field simulation result of a simulation region, and to derive a second electromagnetic field simulation result with a second resolution, according to the first electromagnetic field simulation result, using a model trained based on a deep learning method. The second resolution is higher than the first resolution.

Abstract: The present invention relates generally to the field of recombinant fatty acid synthesis, particularly in transgenic plants. The application describes genes involved in fatty acid synthesis and provides methods and vectors for the manipulation of fatty acid composition of plant oils. In particular, the invention provides constructs for achieving the integration of multiple heterologous genes involved in fatty acid synthesis into the plant genome, such that the resulting plants produce altered levels of polyunsaturated fatty acids. Also described are methods for enhancing the expression of fatty acid biosynthesis enzymes by co-expressing a silencing suppressor within the plant storage organ.

Abstract: The present invention relates to methods of synthesizing long-chain polyunsaturated fatty acids, especially eicosapentaenoic acid, docosapentaenoic acid and docosahexaenoic acid, in recombinant cells such as yeast or plant cells. Also provided are recombinant cells or plants which produce long-chain polyunsaturated fatty acids. Furthermore, the present invention relates to a group of new enzymes which possess desatorase or elongase activity that can be used in methods of synthesizing long-chain polyunsaturated fatty acids.

Abstract: A method of deep graph representation learning includes: deriving a set of base features; and automatically developing, by a processing device, a multi-layered hierarchical graph representation based on the set of base features, wherein each successive layer of the multi-layered hierarchical graph representation leverages an output from a previous layer to learn features of a higher-order.

Abstract: System and methods for relational time-series learning are provided. Unlike traditional time series forecasting techniques, which assume either complete time series independence or complete dependence, the disclosed system and method allow time series forecasting that can be performed on multivariate time series represented as vertices in graphs with arbitrary structures and predicting a future classification for data items represented by one of nodes in the graph. The system and methods also utilize non-relational, relational, temporal data for classification, and allow using fast and parallel classification techniques with linear speedups. The system and methods are well-suited for processing data in a streaming or online setting and naturally handle training data with skewed or unbalanced class labels.

Abstract: One embodiment provides a system for facilitating a graph search engine. During operation, the system receives, by a server from a client computing device, a search request which includes a user-inputted graph. The system performs a search based on a structure of the user-inputted graph for a plurality of relevant graphs. The system orders the plurality of relevant graphs from a most relevant ranking to a least relevant ranking. The system returns, to the client computing device, the ordered plurality of relevant graphs for display on a user interface of the client computing device, thereby enhancing the search for relevant graphs by allowing the graph search engine to take as an input the user-inputted graph and return as an output the relevant graphs.

Abstract: The present invention relates to enzymes which possess desaturase, conjugase, epoxidase and/or hydroxylase activity that can be used in methods of synthesizing fatty acids.

Abstract: A method of deep graph representation learning includes: calculating a plurality of base features from a graph and adding the plurality of base features to a feature matrix. The method further includes generating, by a processing device, a current feature layer from the feature matrix and a set of relational feature operators, wherein the current feature layer corresponds to a set of current features, evaluating feature pairs associated with the current feature layer, and selecting a subset of features from the set of current features based on the evaluated feature pairs. The method further includes adding the subset of features to the feature matrix to generate an updated feature matrix.

Abstract: The present invention relates to extracted lipid with high levels, for example 90% to 95% by weight, oleic acid. The present invention also provides genetically modified plants, particularly oilseeds such as safflower, which can used to produce the lipid. Furthermore, provided are methods for genotyping and selecting plants which can be used to produce the lipid.

Abstract: System and methods for relational time-series learning are provided. Unlike traditional time series forecasting techniques, which assume either complete time series independence or complete dependence, the disclosed system and method allow time series forecasting that can be performed on multivariate time series represented as vertices in graphs with arbitrary structures and predicting a future classification for data items represented by one of nodes in the graph. The system and methods also utilize non-relational, relational, temporal data for classification, and allow using fast and parallel classification techniques with linear speedups. The system and methods are well-suited for processing data in a streaming or online setting and naturally handle training data with skewed or unbalanced class labels.

Abstract: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes.

Abstract: Embodiments of the present invention provide a time- and space-efficient system for representing and searching a set of intervals to find all the intervals that overlap with a given query interval or point. A new structure called an interval hash table is introduced to significantly reduce the average search time, thereby improving computing and search technology. During operation, the system obtains data indicating a set of intervals to be hashed. The system divides a respective interval into a set of sub-intervals based on a locality-preserving hashing. The system then obtains a hash code associated with a respective sub-interval, and inserts the respective sub-interval into an interval hash table at a location corresponding to the hash code. The system may further search the interval hash table.

Abstract: A molecular network-based web search and information aggregation system and a process for creating a synthetic molecular network are disclosed. The amount of information and data available through the Internet is growing rapidly, yet current search through natural language-based keyword and page rank algorithm or directory search often cannot provide satisfactory relevant results. The process creates the synthetic molecular network according to a set of rules and chemistry knowledge. The synthetic molecular network is structured such that molecular information can be aggregated in ways that conform to contemporary graphing theory and chemistry rules. In this way, the molecular network-based web search and information aggregation system reduces reliance on natural language by leveraging strong relational associations between molecules that do not correlate to a set of natural language keywords.

Abstract: Provided is a high-performance implementation of the k-means clustering algorithm on a graphics processing unit (GPU), which leverages a set of GPU kernels with complimentary strengths for datasets of various dimensions and for different numbers of clusters. The concepts of non-dominated GPU kernels and efficient strategies to select high-throughput kernels that match the arguments of the clustering problem with the underlying GPU hardware for maximum speedup are provided.

Abstract: The present invention relates to extracted lipid with high levels, for example 90% to 95% by weight, oleic acid. The present invention also provides genetically modified plants, particularly oilseeds such as safflower, which can used to produce the lipid. Furthermore, provided are methods for genotyping and selecting plants which can be used to produce the lipid.

Abstract: A diagnostic test system includes a housing, a reader, and a data analyzer. The housing includes a port constructed and arranged to receive a test strip that includes a flow path for a fluid sample, a sample receiving zone couple to the flow path, a label that specifically binds a target analyte, a detection zone coupled to the flow path and comprising a test region exposed for optical inspection and having an immobilized test reagent that specifically binds the target analyte, and at least one reference feature. The reader is operable to obtain light intensity measurements from exposed regions of the test strip when the test strip is loaded in the port.

Abstract: A system and method for efficient sparse matrix processing are provided in one embodiment. A compressed representation of a sparse matrix, the sparse matrix including one or more non-zero entries in one or more of a plurality of portions of the matrix, is obtained by at least one server including one or more streaming multiprocessors, each of the streaming multiprocessors including one or more graphics processing unit (GPU) processor cores. Each of the portions are assigned into one of a plurality of partitions based on a number of the non-zero entries in that portion. For each of the partitions, a predefined number of the GPU processor cores are assigned for processing each of the portions assigned to that partition based on the numbers of the non-zero entries in the portions assigned to that partition. For each of the partitions, each of the portions associated with that partition are processed.

Abstract: A method for resource allocation includes: a base station determining a user equipment UE to which a resource block is to be allocated; and if the index number of any resource block among the allocated resource blocks of the UE falls within a preset first index number range, judging whether the number of the allocated resource blocks of the UE is less than the preset first parameter value.