Abstract: An event log system and method are disclosed. The system includes a plurality of worker nodes to receive and store event log records from a plurality of log sources, and a coordinator node to maintain information about mapping from the plurality of log sources to the plurality of worker nodes. Each worker node comprises an IngestKV module to temporarily store event log records from the log sources and a TimeRangeKV module to permanently store the event log records.

Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

Abstract: Methods and apparatus for ranking uncertain data in a probabilistic database are disclosed. An example method disclosed herein comprises using a set of data tuples representing a plurality of possible data set instantiations associated with a respective plurality of instantiation probabilities to store non-deterministic data in a database, each data tuple corresponding to a set of possible data tuple instantiations, each data set instantiation realizable by selecting a respective data tuple instantiation for at least some of the data tuples, the method further comprising determining an expected rank for each data tuple included in at least a subset of the set of data tuples, the expected rank for a particular data tuple representing a combination of weighted component ranks of the particular data tuple, each component rank representing a ranking of the data tuple in a corresponding data set instantiation, each component ranking weighted by a respective instantiation probability.

Abstract: Multiquery optimization is performed in the context of RDF/SPARQL. Heuristic algorithms partition an input batch of queries into groups such that each group of queries can be optimized together. The optimization incorporates an efficient algorithm to discover the common sub-structures of multiple SPARQL queries and an effective cost model to compare candidate execution plans. No assumptions are made about the underlying SPARQL query engine. This provides portability across different RDF stores.

Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

Abstract: A system, method and computer program product creates an index based on accounting data, or a portfolio of financial objects based on the index where the portfolio is weighted according to accounting data. Indexes may be built with metrics other than market capitalization weighting, price weighting or equal weighting. Financial and non-financial metrics may be used to build indexes to create passive investment systems. A combination of financial non-market capitalization metrics may be used with non-financial metrics to create passive investment systems. Once built, the index may be used as a basis to purchase securities for a portfolio. Specifically excluded are widely-used capitalization-weighted and price-weighted indexes, in which price of a security contributes in a substantial way to calculation of weight of that security in the index or the portfolio, and equal weighting weighted indexes. The indexes may be constructed to minimize volatility.

Abstract: A system, method and computer program product creates an index based on accounting data, or a portfolio of financial objects based on the index where the portfolio is weighted according to accounting data. Indexes may be built with metrics other than market capitalization weighting, price weighting or equal weighting. Financial and non-financial metrics may be used to build indexes to create passive investment systems. A combination of financial non-market capitalization metrics may be used with non-financial metrics to create passive investment systems. Once built, the index may be used as a basis to purchase securities for a portfolio. Specifically excluded are widely-used capitalization-weighted and price-weighted indexes, in which price of a security contributes in a substantial way to calculation of weight of that security in the index or the portfolio, and equal weighting weighted indexes. The indexes may be constructed to minimize volatility.

Abstract: A system, method and computer program product creates an index based on accounting data, or a portfolio of financial objects based on the index where the portfolio is weighted according to accounting data. Indexes may be built with metrics other than market capitalization weighting, price weighting or equal weighting. Financial and non-financial metrics may be used to build indexes to create passive investment systems. A combination of financial non-market capitalization metrics may be used with non-financial metrics to create passive investment systems. Once built, the index may be used as a basis to purchase securities for a portfolio. Specifically excluded are widely-used capitalization-weighted and price-weighted indexes, in which price of a security contributes in a substantial way to calculation of weight of that security in the index or the portfolio, and equal weighting weighted indexes. The indexes may be constructed to minimize volatility.

Abstract: A system, method or computer program product for electronically constructing data indicative of an investible risk factor portfolio is disclosed.

Abstract: Embodiments disclosed herein are directed to verifying query results of an untrusted server. A data owner outsources a data stream to the untrusted server, which is configured to respond to a query from a client with the query result, which is returned to the client. The data owner can maintain a vector associated with query results returned by the server and can generate a verification synopsis using the vector and a seed. The verification synopsis includes a polynomial, where coefficients of the polynomial are determined based on the seed. The data owner outputs the verification synopsis and the seed to a client for verification of the query results.

Abstract: Disclosed is a method, information processing system, and computer readable medium for preserving privacy of nonstationary data streams. The method includes receiving at least one nonstationary data stream with time dependent data. Calculating, for a given instant of sub-space of time, A set of first-moment statistical values is calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.

Abstract: A method, information processing system, and computer readable medium are provided for preserving privacy of one-dimensional nonstationary data streams. The method includes receiving a one-dimensional nonstationary data stream. A set of first-moment statistical values are calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.

Abstract: Methods and apparatus for ranking uncertain data in a probabilistic database are disclosed. An example method disclosed herein comprises using a set of data tuples representing a plurality of possible data set instantiations associated with a respective plurality of instantiation probabilities to store non-deterministic data in a database, each data tuple corresponding to a set of possible data tuple instantiations, each data set instantiation realizable by selecting a respective data tuple instantiation for at least some of the data tuples, the method further comprising determining an expected rank for each data tuple included in at least a subset of the set of data tuples, the expected rank for a particular data tuple representing a combination of weighted component ranks of the particular data tuple, each component rank representing a ranking of the data tuple in a corresponding data set instantiation, each component ranking weighted by a respective instantiation probability.

Abstract: Embodiments disclosed herein are directed to verifying query results of an untrusted server. A data owner outsources a data stream to the untrusted server, which is configured to respond to a query from a client with the query result, which is returned to the client. The data owner can maintain a vector associated with query results returned by the server and can generate a verification synopsis using the vector and a seed. The verification synopsis includes a polynomial, where coefficients of the polynomial are determined based on the seed. The data owner outputs the verification synopsis and the seed to a client for verification of the query results.

Abstract: The present invention relates to a transistor based on resonant tunneling effect of double barrier tunneling junctions comprising: a substrate, an emitter, a base, a collector and a first and a second tunneling barrier layers; wherein the first tunneling barrier layer is located between the emitter and the base, and the second tunneling barrier layer is located between the base and the collector; furthermore, the junction areas of the tunneling junctions which are formed between the emitter and the base and between the base and collector respectively are 1 ?m2˜10000 ?m2; the thickness of the base is comparable to the electron mean free path of material in the layer; the magnetization orientation is unbounded in one and only one pole of said emitter, base and collector. Because the double-barrier structure is used, it overcomes the Schottky potential between the base and the collector.

Abstract: Disclosed is a method, information processing system, and computer readable medium for preserving privacy of nonstationary data streams. The method includes receiving at least one nonstationary data stream with time dependent data. Calculating, for a given instant of sub-space of time, A set of first-moment statistical values is calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.

Abstract: A method, information processing system, and computer readable medium are provided for preserving privacy of one-dimensional nonstationary data streams. The method includes receiving a one-dimensional nonstationary data stream. A set of first-moment statistical values are calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.