Abstract: Embodiments of the disclosure provide devices and methods for performing a top-k function. The device can include: a memory comprising a plurality of register files for storing the data elements, the plurality of register files comprising a parent register file and a first child register file associated with the parent register file, wherein the parent register file is associated with: first interface circuitry configured for reading a first parent data element from the parent register file and receiving a first child data element and a second child data element from the first child register file; and first comparison circuitry configured for updating the parent register file and the first child register file based on the first parent data element, the first child data element, and the second child data element according to a given principle.

Abstract: A resource determining method is provided. The method includes: determining a time domain position and a resource unit type of a first time domain resource unit based on first configuration information; determining a time domain position of a second time domain resource unit based on the time domain position of the first time domain resource unit, where the time domain position of the second time domain resource unit is at a time domain position which is different from the time domain position of the first time domain resource unit and is within a preset time period; and receiving second configuration information from a network-side device, and determining a resource unit type of the second time domain resource unit based on the second configuration information. Thus, subframe types of various subframes in D-TDD can be determined.

Abstract: An illustrative injection detection system receives a text statement that includes a set of text elements and implements instructions for performing an operation with respect to a data structure. The system identifies a target risk element count equal to a number of risk elements preapproved to occur within the set of text elements of the text statement. The system also determines a detected risk element count equal to a number of risk elements that occur within the set of text elements of the text statement. If the system detects a violation of a predetermined rule defining an acceptable relationship between the target and detected risk element counts for the text statement, the system triggers an exception condition indicating a risk that the text statement corresponds to an injection attack on the data structure. Corresponding methods and systems are also disclosed.

Abstract: Methods, devices, and system for generating an updated webpage. A computing device may retrieve a product webpage, generate a structural model of the retrieved product webpage, and determine whether the generated structural model matches a stored structural model of another webpage retrieved from the web address. The computing device may extract product information from the generated structural model based on a previously stored mapping of nodes in the stored structural model to the product fields, or generate a mapping and extract the product information from the generated structural model based on the generated mapping, based on whether the generated structural model matches the stored structural model of another webpage retrieved from the web address. The computing device may generate an updated webpage based on the extracted product information.

Abstract: Various embodiments set forth techniques for free space management in a block store. The techniques include receiving a request to allocate one or more blocks in a block store, accessing a sparse hierarchical data structure to identify an allocator page identifying a region of a backing store having a greatest number of free blocks, and allocating the one or more blocks.

Abstract: A method, an apparatus and a storage medium for stay point recognition and prediction model training are proposed. The method may include: for a to-be-recognized positioning point, obtaining respectively features of N predetermined dimensions for the to-be-recognized positioning point, N being a positive integer greater than one; generating a feature vector for the to-be-recognized positioning point according to the features obtained; determining whether the to-be-recognized positioning point is a stay point based on the feature vector, by using a prediction model obtained by pre-training. The technical solution may be applied to improve the accuracy and a recall rate of the stay point recognition.

Abstract: Nodes in a tree data structure are associated with respective node keys. At least some of the nodes are associated with at least one respective node rank. The structure is searched to attempt to identify a preferred prefix-matching node on the basis of attempting to find a prefix-matching node that has a prefix match with a search key and which has a preferred node rank relative to a node rank associated with a node which may have a longer prefix match. If the prefix-matching node is identified, a dependent node rank identifier associated with the prefix-matching node is used to determine that the prefix-matching node has the preferred node rank. The dependent node rank identifier indicates at least a node rank of a node which may have a longer prefix match than the prefix-matching node. The prefix-matching node is selected, if identified, as a preferred prefix-matching node.

Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.

Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.

Abstract: A hybrid object tree that interconnects individual data objects of different data types from a group of different input data sources is provided. The instantiated data objects of the hybrid object tree include an internal dynamic data area that encapsulates at least one reference to an original input data source. At least one attribute is identified that is unavailable at the referenced original input data source of a first instantiated data object of the hybrid object tree. The at least one attribute is added to the first instantiated data object of the hybrid object tree within the internal dynamic data area of the first instantiated data object.

Abstract: A request may be received that includes an indicator associated with a geographic location and scope. A database search may be initiated, based on the geographic location and scope. A list of one or more tags may be received, the tags associated with the geographic location, ordered based on relevance within the geographic scope, based on tag locale rankings associated with each of the tags included in the list of tags, the tag locale rankings based on comparisons of relative frequencies of occurrence of the tags, based on first bounded geographic areas, compared with second relative frequencies of occurrence of the tags based on second bounded geographic areas that are respectively larger than the first bounded geographic areas, the request geographic scope indicating one of a plurality of hierarchical geographic analysis levels associated with a plurality of geographic locations.

Abstract: This invention relates to determining page elements to display in response to a search. A method embodiment of this invention determines a page element based on a search result. The method includes: (1) determining a set of result classifications based on the search result, wherein each result classification includes a result category and a result score; and (2) determining the page element based on the set of result classifications. In this way, a classification is determined based on a search result and page elements are generated based on the classification. By using the search result, as opposed to just the query, page elements are generated that corresponds to a predominant interpretation of the user's query within the search results. As result, the page elements may, in most cases, accurately reflect the user's intent.

Abstract: A system and method to integrate breadth-first and depth-first strategies in a single search technique or routine is provided. It combines the complementary strengths of both strategies to achieve significantly improved speed over either strategy used alone. The new algorithm can be used to efficiently find solutions to the treewidth problem that has applications in areas such as diagnosis using probabilistic inferences.

Abstract: Various embodiments of systems and methods for dynamically weighted semantic trees are described herein. One or more software elements of a hierarchy are identified in response to user actions in a report. The user actions are related to at least one software element of the one or more software elements of the hierarchy. A local tree is constructed for each user by assigning local weights for the one or more software elements based on user visits to the one or more software elements. A group tree is constructed for each group to which the users belong by assigning group weights for the one or more software elements based on the user visits to the one or more software elements. The local tree and the global tree are stored for use in various applications.

Abstract: A method for storing XML documents a hybrid navigation/streaming format is provided to allow efficient storage and processing of queries on the XML data that provides the benefits of both navigation and streaming and ameliorates the disadvantages of each. Each XML document to be stored is independently analyzed to determine a combination of navigable and streamable storage format that optimizes the processing of the data for anticipated access patterns.

Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.

Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities.

Abstract: Techniques for organizing single or multi-column temporal data into R-tree spatial indexes are provided. Temporal data for single or multiple column data, within a database system, is converted into one or more line segments. The resulting line segments are transformed into a minimum bounding rectangle (MBR). Finally, the MBR is inserted into an R-tree spatial index.

Abstract: Data processing includes accessing a product category tree, the product category tree comprising a plurality of hierarchical levels. A leaf category level of the plurality of hierarchical levels comprises a leaf category node. The leaf category node includes product information. The product information comprises a plurality of product attribute parameters. The plurality of product attribute parameters comprises standard product information. Data processing further includes selecting, among the plurality of product attribute parameters that correspond to the leaf category node, a representative product attribute parameter that is representative of the product information; and partitioning standard product information of the leaf category node to obtain a plurality of sets using the representative product attribute parameter, wherein each of the plurality of sets includes at least some of the standard product information.

Abstract: A data sorting program that is capable of performing a data sorting process by using a small capacity of memory at a fast speed. A computer executing the data sorting program has the following functions. A concise ordered TRIE creator creates a root, sequentially reads the characters of each data, and when a prescribed number of data passed a certain node connected to the root before and a child node corresponding to a character next to a character associated with the certain node has not been created, creates the child node so that the child nodes of the certain node have a prescribed arrangement. A partition determination unit sets partitions between prescribed nodes. A data grouping unit groups the data into a plurality of data groups according to the partitions.

Abstract: A volatile memory manager of a data handling system can be configured to convert the one-to-many external reference into an external reference that references the common ancestor node of the contiguous region. Specific pathing and/or termination conditions can be contained in a Relationship_Path parameter of the external reference. The hierarchical data structure can also be loaded into volatile memory by the volatile memory manager as data structure references. The volatile memory manager can be further configured to perform various functions utilizing the external and data structure references.

Abstract: Event prediction using hierarchical event features is described. In an embodiment a search engine monitors search results presented to users and whether users click on those search results. For example, features describing the search result events are universal resource locator prefix levels which are inherently hierarchically related. In an embodiment a graphical data structure is created and stored and used to represent the hierarchical relationships between features. An online training process is used in examples which enables knowledge to be propagated through the graphical data structure according to the hierarchical relations between features. In an example, the graphical data structure is used to predict whether a user will click on a search result and those predictions are used by the search engine to rank search results for future searches. In another example the events are advertisement impressions and the predictions are used by an online advertisement system.

Abstract: A system, method, and computer program product are provided for generating a range of ordinals corresponding to key values represented in a B-Tree data structure. This allows for a boundary point, usable, for example, for partitioning the B-Tree for parallel processing, to be specified using an ordinal value of the range of ordinals. Then an ordinal-to-key transformation can be performed in order to identify a key value corresponding to the boundary point. Additionally, ordinal values can be identified through the use of key-to-ordinal transformations, allowing for specification of ranges, for example, in terms of key values.

Abstract: A method of decreasing a total computation time for a visual simulation loop includes sharing a common data structure across each phase of the visual simulation loop by adapting the common data structure to a requirement for each particular phase prior to performing a computation for that particular phase.

Abstract: A method for allocating resources includes receiving one or more parameters associated with an object of interest. At least one of the parameters corresponds to a probability that the object of interest is participating in a predetermined situation of interest. The method also includes calculating a plurality of values, based at least in part on the parameters, and selecting, based at least in part on the calculated values, one or more operations to be performed involving the object of interest. In addition the method includes generating an instruction based at least in part on the operation to be performed transmitting the instruction to an operational resource.

Abstract: A broadcaster-specific service module is provided for applications hosted by a processing device. The broadcaster-specific service module and the applications communicate through a common service bus. The broadcaster-specific service module receives items from an online broadcaster via a network, with each item associated with a media file or stream available from the online broadcaster. The broadcaster-specific service module generates a catalog containing a tree of the items, and sends the catalog to a target application via the service bus to display the catalog for user selection. The broadcaster-specific service module formats data of the catalog can be understood by all of the applications attached to the service bus.

Abstract: A node thinning-out means 12 for carrying out a process of thinning out nodes constructing line segments included in map data, the nodes excluding branch points, according to a scale to be created which is smaller than a specific scale is disposed. A hierarchical graph component 13 groups the nodes on which the thinning-out process has not been performed yet and the nodes on which the thinning-out process has been performed by the node thinning-out unit 12 into hierarchical layers according to the scale, and creates connection destination information showing nodes to which each node belonging to each of the hierarchical layers is connected.

Abstract: A method and apparatus for generating a statistical tree representing an extensible markup language Schema (XSD) is disclosed. Components of the XSD are prioritized according to predefined rules. A root node representing said XSD is created. Pairs of child nodes are generated from the root node. Each pair comprises at least one genuine node, and each pair of generated child nodes is appended to a parent node which is a genuine node. The path to each of said child nodes from a respective parent genuine node is represented with a binary sequence. At least one genuine node is allocated to a corresponding component of said XSD, the allocation being based on the prioritization of the component.

Abstract: A relational database query system for a relational database is provided, wherein the relational database comprises several relational tables including at least one constant table storing several unique data. The relational database query system comprises a query receiving module for receiving an extensible-markup-language query (XML query); at least a constant mapping tree respectively corresponds to one of the at least constant tables, wherein the at least constant mapping tree comprises several tree nodes respectively with node numbers respectively corresponding to the unique data in the at least constant table; a query generator for converting the XML query to be a structured query language (SQL) query according to the at least constant mapping tree; a query module for querying the relational database with the SQL query.

Abstract: An information creating apparatus creates a leaf page information including one or more records with a key information to be compared with a retrieval key information inputted for retrieval of a record. The apparatus creates, based on the key information of the record included in the leaf page information, a judgment information used to judge a possibility that the leaf page information located in a position of child of the node page information located between the root and leaf page informations, and in lower positions than it, includes the record to be retrieved with the retrieval key information, and creates the node page information including the judgment information. The apparatus creates the root page information including the judgment information included in the node page information located in the positions of the child of the root page information, and stores the root, node and leaf page informations in a tree structure.

Abstract: A method for auditing and verifying configuration items (CIs) in an information technology (IT) configuration management database (CMDB) includes identifying which configuration item (CI) types should be part of an audit, defining link rules to link an authorized CI type stored in a CMDB to an actual CI type that is part of an IT infrastructure, retrieving all authorized CI instances of the identified CI types from the CMDB, retrieving all actual CI instances of the identified CI types from a discovery upload of a current IT environment, comparing the actual CI instances to the authorized CI instances, and taking remedial action when variances are discovered.

Abstract: In various embodiments, a method is described that includes registering a mobile device with an enterprise by storing registration data for the mobile device in a device management database; designating one or more group designations for the mobile device; storing the one or more group designations in the device management database; determining one or more policies for the mobile device based at least in part on the one or more group designations; and selectively taking action on selected data from the mobile device in the device management database based on the one or more policies.

Abstract: A system and method to integrate breadth-first and depth-first strategies in a single search technique or routine is provided. It combines the complementary strengths of both strategies to achieve significantly improved speed over either strategy used alone. The new algorithm can be used to efficiently find solutions to the treewidth problem that has applications in areas such as diagnosis using probabilistic inferences.

Abstract: Organization and assignment of access privileges to resources in a computer network. The resources of the network are organized into a hierarchical tree structure, with each node in the tree representing a resource, resource group, or resource instance. Read and/or write permission to one or more resources may be explicitly granted to the resource or implicitly granted based upon the location of the resource in the hierarchical structure. The access rights attach to the resource(s). Upon movement of the resource within the tree structure or to an alternate tree structure, the access rights associated therewith remain with the relocated resource.

Abstract: A method and apparatus for performing a paging operation on a tree having a plurality of nodes is provided. A preorder number and a subtree size are maintained in a machine-readable medium for each of the plurality of nodes of the tree. The preorder number associated with a particular node of the tree identifies a position for the particular node in a depth-first search ordering of the plurality of nodes of the tree. The subtree size associated with a particular node of the tree identifies a count of all the nodes in a subtree rooted at the particular node. In response to receiving a request to perform a paging operation on the plurality of nodes of the tree, a set of nodes that satisfy the paging operation may be determined using the preorder number and the subtree size associated with each node of the tree.

Abstract: The techniques presented herein are directed towards providing a user-directed keyword-based search on a large collection of XML documents, and displaying a summary of results to the user. Prior to receiving search requests from a user, an offline analysis of a large collection of XML documents is performed to construct an inverted index of keywords. For each keyword, the index stores a set of location indicators that identify all the instances of the keyword found in the collection of documents. A location indicator may comprise a document identifier, an indication of the position of the node in the hierarchy of nodes within the XML document containing the keyword, and an indication of the pathname of the node containing the keyword. Once the index is constructed, keyword searching can be done efficiently by a keyword lookup in the index.

Abstract: A method for desensitizing character strings comprises ordering an original set of character strings and generating a tree structure that has nodes corresponding to the ordered set of sensitive strings. The sensitive characters on the nodes of the tree are then desensitized in depth-first order such that a set of desensitized strings is generated that preserves the ordering of the original sensitive set.

Abstract: A method for evaluating a device during circuit simulation includes receiving a first request including a first input value; and mapping the first input value to a first space in a table. The table is configured to store one or more table entries. A table entry includes an input value and a stored value. The stored value is obtained as a function of the input value from an analytical device model used to characterize the device during circuit simulation.

Abstract: Interesting location identification embodiments are presented that generally involve identifying and providing the interesting locations found in a given geospatial region. This is accomplished by modeling the location histories of multiple individuals who traveled through the region of interest, and identifying interesting locations in the region based on the number of individuals visiting a location weighted in terms of the travel experience of those individuals. A prescribed number of the top most interesting locations in a specified region can be provided upon request. In addition, prescribed numbers of the top most popular travel sequences through the interesting locations and the top most experienced travelers in the specified region can be provided as well.

Abstract: In one aspect, a method for interacting with a representation of a family tree is provided. The method comprises receiving family tree information from a user with respect to the family tree, displaying a representation of the family tree based, at least in part, on the received family tree information, receiving update information from the user indicating at least one modification to the family tree and/or the family tree representation, the update information received via the user interacting directly with the graphical representation of the family tree, performing the at least one modification to the family tree and/or family tree representation, and displaying a representation of the family tree with the at least one modification.

Abstract: Methods, systems, and computer program products are provided for performing structured parallel data intensive computations. A SQL-FCF framework that defines a SQL construct based interface for performing the computations is provided. The computations within an application are coded as table valued functions (TVFs). Data for the application is partitioned into data partitions to co-locate and load balance the data partitions and corresponding computations. The TVFs are invoked and applied to corresponding ones of the data partitions in a structured order defined by function control forms (FCF).

Abstract: A filtering method for evaluating patents comprises loading each unit of text or figure in a portfolio of patents into digital memory then comparing each unit of text or figure with all other units of text or figures in digital memory using digital data processing. The duplicate units of text or figures are determined and the earliest instance of each duplicate unit of text or figure is identified. The duplicate unit of text or figure, other than earliest instance, are marked as duplicate to create a filtered version of each patent in portfolio. The filtered version of each patent in portfolio is evaluated to determine the uniqueness of the patent specification and the interrelationships between the patents in the portfolio are determined. The interrelationships are illustrated in an electronic workspace for analyzing the portfolio of patents.

Abstract: This disclosure provides various embodiments of systems, software, and computerized methods for generating a business adaptation catalog model. In one aspect, the software identifies one of a plurality of solutions associated with a particular application, and identifies a business adaptation catalog associated with the identified solution. The software then retrieves information from the business adaptation catalog defining a set of business elements, and generates a business adaptation catalog model illustrating the one or more business elements. Further, the business adaptation catalog can comprise a data structure defining the hierarchical relationships between the set of business elements and a set of constraints defining at least one relationship between at least two of the set of business elements.

Abstract: Computer program products, devices, and methods for generating in-text embedded advertising are described. Embedded advertising is “hidden” or embedded into a message by matching an advertisement to the message and identifying a place in the message to insert the advertisement. For textual messages, statistical analysis of individual sentences is performed to determine where it would be most natural to insert an advertisement. Statistical rules of grammar derived from a language model may be used choose a natural and grammatical place in the sentence for inserting the advertisement. Insertion of the advertisement creates a modified sentence without degrading a meaning of the original sentence, yet also includes the advertisement as a part of a new sentence.

Abstract: A book search system and media for generating a book index corresponding to a collection of books and for providing context snippets related to a search string formulated by a user based on the book index are provided. The book index includes a word hash that represents unique words and an offset to a location list that stores locations for each instance of the unique word. The book search system receives the search string from the user, parses the search string to locate phrases and words, and traverses the book index to generate a list of locations for each word or phrase included in the search string. The book search system utilizes a variable-sized container having a maximum size to store subsets of each word or phrase included in the list of locations to generate the context snippets for the search string.

Abstract: The invention relates to identification of individual nucleic acid sequences from a mixed nucleic acid population. A typical application is to determine the bacteria present in sample containing a mix of several different bacteria. Present techniques require initial cultivation of the mixed bacteria sample and manual separation of the bacteria prior to sequencing. The invention allows for identification of the different bacteria by direct sequencing of the mixed bacteria sample without prior cultivation and separation. One aspect of the invention relates to generating a degenerate sequence from a chromatogram obtained by sequencing a mixed bacteria sample. Another aspect relates to base-calling, i.e. identification of individual sequences making up the degenerate sequence from the mixed bacteria sample. In this aspect, the degenerate sequence is divided into degenerate subsequences from which query subsequence combinations are generated.

Abstract: This invention is a generically constructed and authenticated relational database, the main aim of which is to manage data, records and logistics information and the tracing of said data and typically applied to a variety of workflow processes in e.g., but not restricted to, science and industry. To this end information is entered through notebooks or through instruments into a database that can be either a single user system or a full system. A single user system has limited functionality and can be connected to only a single full system at a time, whereas a full system is able to communicate with a plurality of single user systems, databases and other full systems according to the present innovation. This system authenticates data and can be used for reverse tracing to for instance lab animals in biomedical research, and forward tracing to for instance the retail part of the food value chain from the animal of origin or from ingredients like feed or other components added to the chain.

Abstract: The invention relates to the use of history information as an aid to synchronization in a peer-to-peer system. In particular, node trees are used to represent portions of files systems designated for synchronization. The nodes in the node tree embody history information regarding associated objects. The history information includes version vectors that are used to simplify synchronization-related comparisons and create job lists that may be used to bring participating peers into synchronization.

Abstract: In one embodiment, a method for a detection server in communication with each of multiple web pages of multiple websites on multiple web servers, the detection server in communication with an ad indexing server, includes automatically accessing from the detection server a file for rendering the web page from a web server, automatically building an object model of the web page at the detection server using the accessed file, automatically scanning the object model at the detection server for one or more elements that are advertisements, automatically analyzing each scanned advertisement at the detection server to determine one or more attributes of the scanned advertisement, and automatically storing data at the ad indexing server on the determined attributes of the scanned advertisements found at the detection server to facilitate an indexing of advertisements on the web pages of the websites.

Abstract: A method for identifying entry points of a hierarchical structure having a plurality of nodes includes the operations selecting a node of a hierarchical structure and testing it for identification as an entry point. The node is identified as an entry point, and the selection, testing, and identification operations are repeated for at least one additional node of the hierarchical structure to identify at least a second node as a respective second entry point for the hierarchical structure.