Abstract: Embodiments of the present invention provide a system for fast parallel graph compression based on identifying a set of large cliques, which is used to encode the graph. The system provides both permanently-stored and in-memory graph encoding and reduces the space needed to represent and store a graph, the I/O traffic to use the graph, and the computation needed to perform algorithms involving the graph. The system thereby improves computing technology and graph computation. During operation, the system obtains data indicating vertices and edges of a graph. The system executes a clique-finding method to identify a maximum clique in the graph. The system then removes the clique from the graph, adds the clique to a set of found cliques, and generates a compressed representation of the graph based on the set of found cliques.

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: Embodiments of the present invention provide a system for fast, accurate, and scalable unbiased graphlet estimation. The system utilizes neighborhood sampling and combinatorial relations to estimate graphlet counts, statistics, and frequency distributions in a small fraction of the computing time of existing systems. The obtained unbiased estimates are highly accurate, and have applications in the analysis, mining, and predictive modeling of massive real-world networks. During operation, the system obtains data indicating vertices and edges of a graph. The system samples a portion of the graph and counts a number of graph features in the sampled portion of the graph. The system then computes an occurrence frequency of a graphlet pattern and a total number of graphlets associated with the graphlet pattern in the graph.

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: Embodiments of the present invention provide a system for querying a graph based on applying filters to a visual representation of the graph. The system allows complicated graph query operations to be performed with ease visually. During operation, the system obtains data indicating vertices and edges of a graph. The system displays a visual representation of the graph for a user. The system receives, from the user, a command defining a local graph filter comprising a region in the visual representation. The system then filters a representation of the graph, and stores the filtered representation.

Abstract: A method and system for performing general matrix-matrix multiplication (GEMM) operations on a graphics processor unit (GPU) using Smart kernels. During operation, the system may generate a set of kernels that includes at least one of a variable-dimension variable-K GEMM kernel, a variable-dimension constant-K GEMM kernel, or a combination thereof. A constant-K GEMM kernel performs computations for matrices with a specific value of K (e.g., the number of columns in a first matrix and the number of rows in a second matrix). Variable-dimension GEMM kernels allow for flexibility in the number of rows and columns used by a thread block to perform matrix multiplication for a sub-matrix. The system may generate rules to select the best (e.g., fastest) kernel for performing computations according to the particular parameter combination of the matrices being multiplied.

Abstract: A method for resource allocation according to the embodiments of the present invention includes: a base station determine a user equipment UE to which a current allocated resource block is allocated; 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.

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 desaturase or elongase activity that can be used in methods of synthesizing long-chain polyunsaturated fatty acids. In particular, the present invention provides ?3 destaurases, ?5 elongases and ?6 desaturases with novel activities. Also provided are methods and DNA constructs for transiently and/or stably transforming cells, particularly plant cells, with multiple genes.

Abstract: A new nanoscale carrier made by one or more pH-sensitive peptides is provided for delivery of a biologically active substance. The peptides are composed of pH-sensitive hydrophilic and hydrophobic amino acids in the backbone. As the pH environment changes from physiological pH level to a weakly acidic environment such as near a tumor site (pH.about.6.5-6.9), the peptides may dissolve, releasing the biological substance. Also provided are the delivery methods and related kits.

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: 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: One embodiment of the present invention provides a system for generating a product recommendation. During operation, the system obtains data indicating vertices and edges of a graph. The vertices represent consumers and products and an edge represents an access relationship. The system may receive a query indicating an ego for determining a product recommendation. The system may then traverse the graph from a vertex representing the ego through a plurality of edges to a plurality of vertices representing products. The system may traverse the graph from the plurality of vertices representing products to a plurality of vertices representing other consumers. The system may then traverse the graph from the plurality of vertices representing other consumers to a plurality of vertices representing other products. The system may generate a recommendation that based on the plurality of vertices representing other products.

Abstract: A method and a system are provided to derive one or more observations between a plurality of parameters in customer care data. The method includes receiving customer care data from a plurality of data sources. Thereafter the customer care data is transformed to create a plurality of data structures utilizing one or more semantic web protocols. The plurality of data structures represents a relationship between one or more parameters in the customer care data. Thereafter a subset of data structures is extracted from the plurality of data structures based on a query received via a query interface. One or more graph analytics techniques are applied on the subset of data structures to determine one or more observations associated with the subset of data structures. Thereafter the one or more observations pertaining to the subset of data structures are displayed on a display screen.

Abstract: Speed with which sparse matrices are processed can be increased by using improved compressed representations of the matrices. Structured compressed representations reduce the number of cache misses experienced during matrix processing by decreasing the number of times the cache has to be accessed randomly. Further, representations of the matrix that divide and regroup rows and columns of the matrix based on their number of non-zero entries allows to assign the most appropriate kernel function for processing of these portions of a matrix, overcoming the limitations of the GPU-based hardware. As a result, the speed of processing can be increased without disturbing the original structure of the matrix.

Abstract: An assay test strip includes a flow path, a sample receiving zone, a label, a detection zone that includes a region of interest, and at least one position marker. The at least one position marker is aligned with respect to the region of interest such that location of the at least one position marker indicates a position of the region of interest. A diagnostic test system includes a reader that obtains light intensity measurement from exposed regions of the test strip, and a data analyzer that performs at least one of (a) identifying ones of the light intensity measurements obtained from the test region based on at least one measurement obtained from the at least one reference feature, and (b) generating a control signal modifying at least one operational parameter of the reader based on at least one measurement obtained from the at least one reference feature.

Abstract: A new nanoscale carrier made by one or more pH-sensitive peptides is provided for delivery of a biologically active substance. The peptides are composed of pH-sensitive hydrophilic and hydrophobic amino acids in the backbone. As the pH environment changes from physiological pH level to a weakly acidic environment such as near a tumor site (pH˜6.5-6.9), the peptides may dissolve, releasing the biological substance. Also provided are the delivery methods and related kits.

Abstract: A computer-implemented method for detecting display-controlling malware may include (1) identifying a software program that is controlling a display of the computing device, (2) detecting one or more measures taken by the software program to prevent loss of control of the computing device display, (3) performing an analysis of the software program that may include determining, based on the measure taken by the software program to prevent loss of control of the computing device display, that the software program is suspicious and possibly includes display-controlling malware, and (4) performing a security action in response to determining that the software program is suspicious and possibly includes display-controlling malware. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: One embodiment of the present invention provides a system for dynamically assigning vertices to processors to generate a recommendation for a customer. During operation, the system receives graph data with customer and product vertices and purchase edges. The system traverses the graph from a customer vertex to a set of product vertices. The system divides the set of product vertices among a set of processors. Subsequently, the system determines a set of product frontier vertices for each processor. The system traverses the graph from the set of product frontier vertices to a set of customer vertices. The system divides the set of customer vertices among a set of processors. Then, the system determines a set of customer frontier vertices for each processor. The system traverses the graph from the set of customer frontier vertices to a set of recommendable product vertices. The system generates one or more product recommendations for the customer.

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 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.