Abstract: Disclosed are a method of device-to-device discovery and an apparatus for the same. A method of device-to-device discovery performed in a discovery terminal may include receiving a discovery identifier of the discovery terminal from a device-to-device server; performing an authorization procedure on performing the restricted discovery of an application located in the discovery terminal with the device-to-device server; and obtaining terminal information of a discoverable terminal as a counterpart terminal with which performs the restricted discovery from the device-to-device server, when the authorization is completed. Thus, the device-to-device discovery may be performed efficiently.

Abstract: Elements of a database object are stored among a plurality of different storage regions, each storage region being associated with a first value range indicating upper and lower range values for element values within that storage region. An index is generated and maintained for one or more second value ranges that include range values that comprise subsets of the first value ranges. A query is processed that includes a query value and one or more storage regions to be read is determined by using one of the index and the first value ranges based on the query value relative to a second value range.

Abstract: A device may receive information that identifies a source database and a destination database, and may receive information that identifies an entity instance included in the source database. The device may determine a base data structure, included in the source database, that is associated with the entity instance, and may generate a dependency graph that identifies a dependency between the base data structure and another data structure. The device may receive an instruction to perform an operation associated with the destination database, and may determine an evaluation order for traversing the dependency graph to generate code for performing the operation. The device may traverse the dependency graph in the evaluation order, and may generate code corresponding to respective data structures identified by the dependency graph. The device may cause execution of the code, based on the evaluation order, which may cause the operation to be performed.

Abstract: A graph database is described. The graph database includes one or more symbolic data stores and one or more key-value data stores. Each symbolic data store is configured to symbolically store sets of multiple hyper-graph nodes. Each key-value data store is configured to store attribute information for hyper-graph nodes and hyper-graph edges.

Abstract: A computing device to compute clusters using random subsets of variables is provided. Each data point of a plurality of data points is associated with a variable to define a plurality of variables. A subset of the plurality of variables is randomly selected. The subset does not include all of the plurality of variables. A number of clusters into which to segment the received data is determined. Cluster data that defines each cluster of the determined number of clusters is determined by executing a clustering algorithm with the received data using only the plurality of data points defined for each observation that are associated with the randomly selected subset of the plurality of variables. The determined cluster data is stored to cluster second data into the determined number of clusters. The second data is different from the received data.

Abstract: A computing device to select decorrelated variables using a graph based method is provided. A correlation value is computed between each pair of a plurality of variables to define a correlation matrix. A binary threshold value is compared to each correlation value to define a binary similarity matrix from the correlation matrix. An undirected graph comprising a subgraph that includes one or more connected nodes is defined based on the binary similarity matrix to store connectivity information for the plurality of variables. Each node of the subgraph is pairwise associated with a unique variable of the variables. (a) A least connected node is selected from the undirected graph based on the connectivity information. (b) The selected least connected node is removed from the undirected graph. (c) The connectivity information for the undirected graph is updated based on the removed node. (d) (a)-(c) are repeated until a stop criterion is satisfied.

Abstract: A method of operating an entertainment system includes computer-implemented steps including determining an audio/video preference profile of the user. An item of audio/video content that fits the profile but that is not available to the system is identified. The identified item is wirelessly received from a source of audio/video content. The source is external to the entertainment system. The received item is stored in memory within the system. The stored item is retrieved from memory. The retrieved item is played back to a human user of the system.

Abstract: Provided are methods and systems for knowledge discovery utilizing knowledge profiles.

Abstract: Provided is a method for installing at high speed and initializing software in a client PC using a cloud server and a client launcher, which is capable of preventing the waste of resources, such as PC storage spaces, by selectively installing only software required for a user in a client PC chiefly used in an organization, such as a school or a company. Furthermore, there is a method for installing at high speed and initializing software in a client PC using a cloud server and a client launcher, in which the system of a client PC can be stably maintained because the client PC is automatically initialized after software installed in the client PC is used.

Abstract: Methods, systems and computer program products for high performance data streaming are provided. A computer-implemented method may include receiving a data mapping describing an association between one or more fields of a data storage location of a data source and one or more fields of a data storage location of a target destination, generating a data transfer execution plan from the data mapping to transfer data from the data source to the target destination where the data transfer execution plan comprises a determined degree of parallelism to use when transferring the data, and transferring the data from the storage location of the data source to the data storage location of the target destination using the generated data transfer execution plan.

Abstract: Provided are a computer program product, system, and method for allocating network bandwidth to prefetch requests to prefetch data from a remote storage to cache in a local storage. A determination is made of access rates for applications accessing a plurality of files, wherein the access rate is based on a rate of application access of the file over a period of time. A determination is made of an access rate weight for each of the files based on the access rates of the plurality of files. The determined access rate weight for each of the files is used to determine network bandwidth to assign to access the files from the remote storage to store in the local storage.

Abstract: Methods and systems for scrubbing confidential insurance account information are provided. According to embodiments, a scrubbing server can receive a request to scrub confidential insurance data that includes the contents of an insurance account information database and an indication of the category of confidential data stored in the database. The scrubbing server can scrub the valid data contained in the received database, replacing confidential information with “scrambled” data that is not confidential. The scrubbing server can transmit the contents of the scrubbed database back to the requesting party.

Abstract: The invention relates to a digital storage system, wherein the digital storage system includes one or more digital storage system elements. The digital storage system elements comprise a plurality of digital storage devices, and one or more network components to connect the digital storage elements. Execution of the machine executable instructions causes a processor to repeatedly record performance metric data descriptive of the performance of the storage system elements in the database, locate outliers in the performance metric data using a statistical algorithm, and to calculate a problem contribution probability value for at least a portion of the outliers. The problem contribution probability value is weighted using an instantiated configuration dependency tree and an instantiated performance metric dependency tree. The processor uses the problem contribution probability value to determine a sequential list of outliers.

Abstract: Embodiments of the present disclosure are directed to a database system and methods for storing and replicating data of a primary database. A method for replicating data item may include receiving replication data from a primary database system and replicating the one or more data items of the primary database system in accordance with the replication data. The replication data may include a transaction log including information on transactions processed by the primary database system and database lock data relating to at least one lock on the one or more data items of the primary database system in order to support simultaneous queries to the primary and replication database systems. The method may also include rolling-back the replication data in the at least one replication database system based on the information on transactions processed by the primary database system and the database lock data.

Abstract: A system and method can support subnet management in a network environment, such as an engineered system for middleware and application execution or a middleware machine environment. A subnet manager (SM) can retrieve information for setting up a reliable connection (RC) between a subnet administrator (SA) and a client node in a subnet. Furthermore, the system can set up one or more connection states for a port associated with the SM node to establish the RC connection between the port associated with the SM node and a port associated with said client node. Then, the SM can activate the port associated with said client node.

Abstract: The various implementations described herein include systems, methods and/or devices used to avoid false negative results in Bloom filters implemented in non-volatile data storage systems. In one aspect, if an element is added to a Bloom filter using k hash functions, instead of requiring all k bits to be set before returning a positive result (e.g., indicating that the element is most likely present in the Bloom filter), the embodiments described herein return a positive result when at least k minus x (k?x) bit positions are set in the Bloom filter, where x is an integer greater than zero and less than k. In some embodiments, additional measures to avoid false negatives include performing a read check immediately after setting the k bits in the Bloom filter and/or using a conservative reading threshold voltage.

Abstract: Embodiments relate to prioritizing the loading of a portion of a web page based on a user designation. An aspect includes providing a user interface for controlling page loading. A user selection of a portion of a web page is received at a server for priority loading. Accordingly, the loading of the portion of the web page is then prioritized based on the user selection. Embodiments further disclose measuring page loading analytics for a plurality of users. The loading of a portion of a web page may be prioritized based on the measured page loading analytics for the plurality of users. Responsive to subsequent page accesses from one of the plurality of users, the prioritized portion of the page is loaded.

Abstract: An apparatus and method for processing data stream are provided. A query execution plan for processing data stream is shared between the server and the terminal. The server builds a query execution plan and determines a part of the built query execution plan to be executed in the terminal. The terminal executes the part of the built query execution plan and transfers a result of the execution. The server executes the remaining part of the built query execution plan based on the execution result transferred by the terminal. The part of the query execution plan to be executed in the terminal is determined depending on the performance of the terminal.

Abstract: A computing device to assign observations to clusters based on a statistical probability is provided. A first cluster assignment is defined by assigning the plurality of observations to a first set of clusters. A second cluster assignment is defined by assigning the plurality of observations to a second set of clusters. A set of composite clusters is defined based on the defined first set of clusters and the defined second set of clusters. For each observation, a statistical probability value for assigning an observation to each composite cluster of the defined set of composite clusters is computed based on the first and second cluster assignments and a composite cluster assignment is defined by assigning the observation to a cluster of the set of composite clusters based on the computed statistical probability value. The defined composite cluster assignment is stored.

Abstract: A query scheduler orders queries in a queue. Each query is executed based on its position in the queue. When a new query is received, the new query is inserted in the queue. A position in the queue for inserting the new query is determined based on a stretch metric for each query in the queue.

Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.

Abstract: The delivery of content is improved from a user's perspective by encouraging the cache of user devices to maintain more current data prior to requesting web pages that would invoke the download of the more current data. A cache simulation of the cache in the user devices is maintained. When objects within the cache simulator are expected to require updating, actions are taken to encourage the user device to update the cache. The actions include modifying markup language files that are downloaded to the user device to invoke the update. For instance, artificial URL's that request the updated objects, embedded scripts, user selection objects, or the like are used to invoke an update process.

Abstract: In one aspect, a method is provided, including the following method operations: receiving a request to generate a post data item at a first location, the post data item including a reference to a content item located at a second location; accessing a notification tag associated with the content item, the notification tag identifying a destination for notification; and sending a notification to the destination, the notification identifying the post data item.

Abstract: A method for anti-virus scanning is described, including: when performing an anti-virus operation on at least one file in a disk, recording information of the at least one file and information of a disk section having a read/write operation during the anti-virus scan operation; analyzing the information of the at least one file and the information of the disk section having the read/write operation during the anti-virus scan operation, and obtaining a cache reference section; loading one or more files in the cache reference section into a memory, and reading the loaded one or more files in the memory to scan when receiving an anti-virus scan request. Further, a device for anti-virus scanning is also described. In the method and the device, the amount of disk read/write operations during the anti-virus scan can be decreased, and the efficiency of anti-virus scanning can be improved.

Abstract: A system and method for creating a user profile and for using the user profile to order search results returned by a search engine. The user profile is based on search queries submitted by a user, the user's specific interaction with the documents identified by the search engine and personal information provided by the user. Terms for the user profile may be selected from the documents accessed by the user by performing paragraph sampling or context analysis. Generic scores associated with the search results are modulated by the user profile to measure their relevance to a user's preference and interest. The search results are re-ordered accordingly so that the most relevant results appear on the top of the list. User profiles can be created and/or stored on the client side or server side of a client-server network environment.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for optimizing execution of a query that includes a JOIN against a system utilizing data relationship concepts. A computer determines whether one or more data structures in JOIN include a parent/child relationship. The one or more data structures can be one or more tables. Responsive to determining that the one or more data structures in JOIN include a parent/child relationship, the computer determines whether the query that includes the JOIN includes a filter applied on one or more data structures in the JOIN with an OR condition between filters. Responsive to determining that the query that includes the JOIN does not include the filter applied on one or more data structures in JOIN with an OR condition between filters, the computer modifies the query that includes the JOIN into a query utilizing relationship constructs.

Abstract: A system, a method, and a computer program product for public exposed objects in packaged interfaces of business process applications are provided. A service provider of a service registers a public exposed object for use by a client of the service provider by identifying the public exposed object and associating a predetermined access protocol for accessing the registered public exposed object by the client. The registered public exposed object is accessible from the service provider only. The service provider provides the registered public exposed object to the client during a transaction. The client accesses the registered public exposed object using an identifier, an attribute, an access location of the registered public exposed object, and the predetermined access protocol.

Abstract: A database system maintains table data in sorted order. The table data becomes unsorted over time due to add, delete, and update operations. These operations are performed such that the table comprises an initial sorted region followed by an unsorted region. The database system performs an incremental operation to rewrite the table in sorted order. The database system partitions the unsorted region into a plurality of partitions comprising sorted rows within each partition. The database system iteratively merges rows from the partitions to the sorted region of the table. The database system selects a set of lowest tanked rows from the partitions. The database system merges these lowest ranked rows with the sorted region while maintaining the sort order of the sorted region. The database system repeats these steps until all the partitions are processed. The database may store data in columnar fashion.

Abstract: Book information describing a plurality of books is analyzed to identify the plurality of books described in the book information and create book records for the respective ones of identified books. A given book record contains fields describing attributes of a respective one of the plurality of books derived from the book information. The book records are clustered into a plurality of clusters based on the values of the fields of the book records. One or more clusters are analyzed to identify a name of a book series based on the book records therein. The book records in a cluster may further be placed in buckets representing individual books in the series and, in turn, the buckets are described based on the book information therein and organized based their description. The identified series name, bucket descriptions and organization thereof may be stored in a repository and presented to users.

Abstract: Social media networking applications, web sites, and services creates implicit relationships between users based on their interest or participation in real-world and optionally virtual or online activities in addition to explicitly defined peer relationships. User profiles, activity entities, and expressions may be associated with metadata to assist in searching and navigation. Metadata is implicitly associated with user profiles, activity entities, expressions, or other data entities based on user behavior using metadata collector. A metadata collector is a poll, survey, list, questionnaire, census, test, game, or other type of presentation adapted to solicit user interaction. A metadata collector is associated with metadata elements. When users interact with a metadata collector, their user profiles and the data entities included in their interactions become associated with the metadata elements of the metadata collector. These metadata element associations may then be used for any purpose.

Abstract: Example methods and apparatus to manage process control data are disclosed. A disclosed example method includes receiving a request for process data associated with a field device, searching a database for a descriptor file that includes the requested process data, and accessing the descriptor file to retrieve the process data to display within an application, wherein the process data is retrieved using a schema that specifies that the process data is located at an object referenced by a file entry that is part of a section of a file body included within the file. In the example method, the object may include at least one of an expression to calculate a value using the process data in a mathematical formula or a display transformation to instruct how the process data is to be displayed.

Abstract: A method, device and system for transforming a concept-based query into SQL query statements, that includes transforming inputted concept-based queries into logic rules, checking validity of the logic rules, optimizing the valid logic rules, and translating the logic rules into SQL query statements in accordance with the optimization result.

Abstract: A data mining system receives a data set that includes a plurality of columns of data. The system determines correlations between columns of data of the data set and displays an interactive listing of a plurality of pairs of columns based on the correlations. The listing includes preview information based on the correlations for each pair. The system receives a selection of a value from the interactive listing from a user and refines the data set in response to the selection.

Abstract: A computing device to automatically cluster a dataset is provided. Data that includes a plurality of observations with a plurality of data points defined for each observation is received. Each data point of the plurality of data points is associated with a variable to define a plurality of variables. A number of clusters into which to segment the received data is repeatedly selected by repeatedly executing a clustering algorithm with the received data. A plurality of sets of clusters is defined based on the repeated execution of the clustering algorithm that resulted in the selected number of clusters. A plurality of composite clusters is defined based on the defined plurality of sets of clusters. The plurality of observations is assigned to the defined plurality of composite clusters using the plurality of data points defined for each observation.

Abstract: A method for joining records from database tables is proposed. Join attributes are ordered into a sequence S0, and a scope C is initialized to empty. Tables including a join attribute A that is first in S0 are identified. A new sequence S? omits A from S0. Iteration through each identified table proceeds in join attribute A order. The iteration utilizes a tree index structure for each identified table where the index key includes all join attributes in the identified table in S0 order. For each matched value v of the join attribute located during the iterating, a new scope Cv is created by appending “A=v” to the scope C. If S? is empty, a tuple corresponding to the scope Cv is output. Otherwise, S0 is set to S? and for each scope Cv, C is set to Cv and the steps beginning with the identifying step are recursively invoked.

Abstract: Provided are techniques for processing a query. A query including constraints for at least two vertically partitioned, inverted indexes is received. The constraints in the query are separated based on the vertically partitioned, inverted indexes. A document identifier iterator is obtained for each of the constraints, wherein each document identifier iterator is associated with a posting list, and wherein each posting list is ordered by document identifier order. A run-time join of the posting lists is performed to obtain a final result set.

Abstract: Provided are techniques for processing a query. A query including constraints for at least two vertically partitioned, inverted indexes is received. The constraints in the query are separated based on the vertically partitioned, inverted indexes. A document identifier iterator is obtained for each of the constraints, wherein each document identifier iterator is associated with a posting list, and wherein each posting list is ordered by document identifier order. A run-time join of the posting lists is performed to obtain a final result set.

Abstract: The present disclosure provides a system and methods for intelligently optimizing search system resource usage and performance using multiple data store technologies. A search query optimization system may utilize multiple query processors, such as a general search engine and one or more specialized data stores, to efficiently and intelligently manage and route queries. The search query optimization system may be configured to evaluate the performance of the various query processors for various types of queries, and may use this information to intelligently route search queries to the query processors best suited to service them.

Abstract: Systems and techniques are provided for receiving an input column and a search keyword and providing one or more suggested columns with which to merge the input column. A coverage score and a refinity score are calculated for potential columns based on the input column as well as a search score based on the search keyword. The one or more suggested columns may be determined based on the coverage score, refinity score, and/or the search score. The input column and/or a potential column may be modified based on a function and the modification may result in a plurality of modified input and/or potential columns. Coverage, refinity, and search scores may be calculated based on the modified columns.

Abstract: A new query language can be embedded in a business application programming language (e.g., the ABAP language). A query language consistent with implementations of the current subject matter can be based on a graph data-model of connected business objects (BO) or other data objects and can be designed as an efficient query language embedded into the business application programming language runtime, thereby allowing expression of business logic in a declarative manner.

Abstract: In an embodiment, a computer-implemented method optimizes queries. The method includes (a) representing a filter criteria for data in a data source as a first Boolean statement with a plurality of expressions connected by a plurality of logic operators including at least one OR operator and at least one AND operator; (b) determining that an expression in the plurality of expressions is a measure expression; (c) analyzing the first Boolean statement to identify an expression in the plurality of expressions that will be ANDed with results of the determined measure expression; (d) replacing the measure expression determined in (b) with a statement ANDing the measure expression determined in (b) and the expression identified in (c) to determine a second Boolean statement that describes the filter criteria that the first Boolean statement represents; and (e) generating, based on the second Boolean statement, a sequence of queries.

Abstract: A computer system can include a database comparator configured to identify a first database object from an original system for a complete modification based on a comparison of the first database object with a plurality of target upgrade database objects, and configured to identify a second database object from the original system for a partial modification based on a comparison of the second database object with the plurality of target upgrade database objects. A complete modification module can be configured to designate, in response to the identification of the first database object, the first database object for the complete modification based on an incremental conversion process. A partial modification module can be configured to designate the second database object for the partial modification based on the incremental conversion process when an instruction to implement the partial modification satisfies at least a portion of a modification condition.

Abstract: An information retrieval system includes a query revision architecture that integrates multiple different query revisers, each implementing one or more query revision strategies. A revision server receives a user's query, and interfaces with the various query revisers, each of which generates one or more potential revised queries. The revision server evaluates the potential revised queries, and selects one or more of them to provide to the user. A session-based reviser suggests one or more revised queries, given a first query, by calculating an expected utility for the revised query. The expected utility is calculated as the product of a frequency of occurrence of the query pair and an increase in quality of the revised query over the first query.

Abstract: Creating subgroups of documents using optical character recognition data is described. A matrix is created for words included in documents. Each column-row combination in the matrix indicates whether a corresponding word that is associated with the column-row combination is included in a corresponding document that is associated with the column-row combination. Distances are identified between pairs of the words. Each distance is based on a number of the documents that differ in including a corresponding pair of the words. Word clusters are created. Each word cluster includes pairs of words associated with a corresponding distance less than a distance threshold. Sets of word clusters are created. A set of word clusters includes word clusters that are not associated with any of the documents associated with other word clusters in the set. Subgroups of the digitized documents are created based on a set of word clusters with a highest word score.

Abstract: Architecture that translates a complex dimensional hierarchy (e.g., XBRL) into an understandable member picker which removes the complexities that the user would otherwise have to face. Using a building block metaphor, the architecture provides element and dimension tagging. The building blocks can include rows, columns, and optional trees. Building blocks are selected and grouped into a report definition, which definition is utilized to retrieve and process basis data into fact data in the final reports. The reporter mechanism removes the complexities in both the XBRL standard and XML, and ensures that the user associates the information appropriately within the report definition. The architecture extends the building block metaphor to include dimension tagging. A portion of the information from each building block is used to produce a fully qualified dimension context and logical validation is performed to ensure accuracy.

Abstract: The various implementations described herein include systems, methods and/or devices used to enable multipass programming in buffers implemented in non-volatile data storage systems (e.g., using one or more flash memory devices). In one aspect, a portion of memory (e.g., a page in a block of a flash memory device) may be programmed many (e.g., 1000) times before an erase is required. Some embodiments include systems, methods and/or devices to integrate Bloom filter functionality in a non-volatile data storage system, where a portion of memory storing one or more bits of a Bloom filter array may be programmed many (e.g., 1000) times before the contents of the portion of memory need to be moved to an unused location in the memory.

Abstract: The invention provides for the connection of a plurality of remote applications with a data source, to maximize the speed and reliability of data transfer. An interface module interfaces with a remote application such as a web browser. A port module interfaces between interface module and a data source. A connection manager facilitates the interface between the interface module and the port module. The port module detects the unavailability of the data source in response to an initial request for the data source by the remote application. The port module may then dynamically detect the availability of the data source in response to a subsequent request for the data source and re-connect to the data source to the remote application in response to the subsequent request without having to reinitialize the connection manager.

Abstract: A system ranks results. The system may receive a list of links. The system may identify a source with which each of the links is associated and rank the list of links based at least in part on a quality of the identified sources.

Abstract: An electronic media distribution/play system includes a service facility that has a communications network interface and maintains a data file catalog. The catalog is sent over the network to requesting users, and the system processes payments from customers in establishing file access authorizations. Encrypted user-selected files and a player program are transmitted to each customer for metered access to received data files as limited by the authorization, and customers can make additional selections and play the encrypted files freely while the authorization remains established. The system can transmit the data files from local storage, and also provide links to encrypted files that are stored at remote vendor facilities. Authorizations can be for selected portions or class levels of the catalog, and for terms measured as calendar time, play time, and collective number of plays. Also disclosed is a method for facilitating the distribution and accessing of electronic files.

Abstract: The invention provides for the connection of a plurality of remote applications with a data source, to maximize the speed and reliability of data transfer. An interface module interfaces with a remote application such as a web browser. A port module interfaces between interface module and a data source. A connection manager facilitates the interface between the interface module and the port module. The port module detects the unavailability of the data source in response to an initial request for the data source by the remote application. The port module may then dynamically detect the availability of the data source in response to a subsequent request for the data source and reconnect to the data source to the remote application in response to the subsequent request without having to reinitialize the connection manager.