УСТРОЙСТВО ДЛЯ РЕДАКТИРОВАНИЯ, СПОСОБ РЕДАКТИРОВАНИЯ И НОСИТЕЛЬ ЗАПИСИ

Изобретение относится к редактированию записей. Его использование в носителях записи малых размеров позволяет обеспечить более эффективное редактирование. Устройство предназначено для разделения файла данных с основными и управляющими данными на первый файл и второй файл. Технический результат достигается благодаря тому, что устройство содержит: операционное средство для определения точки разделения на первый и второй файлы; средство редактирования для редактирования первых управляющих данных, чтобы сделать недействительной первую часть блока записываемых данных фиксированной длины с основными данными; и средство генерирования для генерирования вторых управляющих данных, чтобы сделать недействительной вторую часть блока записываемых данных фиксированной длины с основными данными, и для добавления вторых управляющих данных ко второму файлу данных. 3 н. и 26 з.п.ф-лы, 46 ил.

СПОСОБ ОРГАНИЗАЦИИ НОСИТЕЛЯ ЗАПИСИ ЦИФРОВЫХ ДАННЫХ, УСТАНОВКА УЧАСТКА ИХ ЗАПИСИ, СПОСОБ И УСТРОЙСТВО ЗАПИСИ ИХ НА НОСИТЕЛЕ, НОСИТЕЛЬ ЗАПИСИ И/ИЛИ ВОСПРОИЗВЕДЕНИЯ ЦИФРОВЫХ ДАННЫХ, КОМПЬЮТЕРНАЯ СИСТЕМА ДЛЯ ЗАПИСИ ЦИФРОВЫХ ДАННЫХ НА НОСИТЕЛЕ

В случае записи компьютерных данных, например, в пакеты 16 - 27 участка записи данных, область пакетов 16 - 27 обеспечивается в качестве пригодной области в таблице организации / таблице частей U - ТОС. Например, в таблице частей под номером 02h такие компьютерные данные записываются в виде сегмента, в котором пакет 16 служит в качестве начального адреса, а пакет 27 - конечного адреса. С целью выполнения организации режима компьютерных данных отдельно обеспечивается FAT (таблица размещения файлов). В этой таблице выполняется организация режимов записи пакетов 16 - 27. Таким образом, компьютерные данные можно записать на мини-диск звуковых данных.

Verzeichnisverwaltung in einem Netzwerk für verteilte Datenverarbeitungssysteme.

Informationssuchvorrichtung.

Struktur und Verfahren zur Anordnung rekursiv abgeleiteter Daten in einer Datenbank

Betriebssystem und Datenbank mit einer aus mehreren Tabellen geformten Zugriffsstruktur

DATABASE MANAGEMENT SYSTEM FOR CONTROLLING CONCURRENT ACCESS TO A DATABASE

METHOD OF RAPIDLY OPENING DISK FILES IDENTIFIED BY PATH NAMES

Method and apparatus for longest match address lookup

We present a method and apparatus for increasing the depth of a lookup table. The lookup table includes at least two lookup units. A search request for a final result value corresponding to the key is issued to each of the lookup units in parallel. Each of the lookup units performs a multi-level search in parallel for the final result value. The final result value stored in only one of the lookup units is provided by one of the lookup units.

DATA PROCESSING SYSTEMS

... 1277852 Sorting INTERNATIONAL BUSINESS MACHINES CORP 13 Nov 1970 [24 Dec 1969] 54029/70 Heading G4M The sorted sequence of items to be sorted is represented by the sequence of indices associated with their addresses. Variable-length stored records each include a key. The addresses of the records are entered in the unsorted order into an address table, and in each case the index position of the address entry in the table is placed in its correct position in an index table which stores the indices in the sorted order of the corresponding keys as follows. Each new index is placed at the top of the occupied part of the index table (which is filled from the bottom up and the existing entries of which are in the sorted order of the corresponding keys), a binary search being done in the index table to find the proper insertion position for the new index by comparing its corresponding key with those corresponding to the index table entries (keys accessed using the address table, of course). The ...

System and method for information retrieval

COMPRESSED INDEX METHOD AND MEANS WITH SINGLE CONTROL FIELD

Verfahren und Vorrichtung zur Speicherung hierarchisch geordneter Daten

System and method for investigating large amounts of data

A data analysis system is proposed for providing fine-grained low latency access to high volume input data from possibly multiple heterogeneous input data sources. The input data is parsed, optionally transformed, indexed, and stored in a horizontally-scalable key-value data repository where it may be accessed using low latency searches. The input data may be compressed into blocks before being stored to minimize storage requirements. The results of searches present input data in its original form. The input data may include access logs, call data records (CDRs), e-mail messages, etc. The system allows a data analyst to efficiently identify information of interest in a very large dynamic data set up to multiple petabytes in size. Once information of interest has been identified, that subset of the large data set can be imported into a dedicated or specialized data analysis system for an additional in-depth investigation and contextual analysis.

High performance message store

A product and method are disclosed for creating an efficient message store and delivery system is provided. A message store having an index directory, index file, and data bucket area, all of which are page based, is described. Each page corresponds to a period of time, such as a day. Each data bucket contains message data and the actual content of the message. The index file contains index file cells which store index information characterizing an associated message. The index directory contains index directory cells which store information on the location of an associated index file cell, and is thereby associated with a message. It also includes page based user folders each having user cells which reference a message, associated with a user, in the user store. A message includes a reference pointer to an associated index file cell and a reference pointer to an associated index directory cell. An index directory pointer in the user cell, an index file pointer in the index directory cell ...

Method and apparatus for longest match address lookup

We present a lookup table for providing a longest prefix match for a key provided in a search request. The search key is provided in a single search request issued to the lookup table. The lookup table performs a multi-level search for the result value based on successive portions of the key.

High performance message store

INFORMATION-INDEXING MACHINES

Information-indexing machines

A data structure for a particular application, for example the enrolment record of a college, is entered into a machine by plotting an appropriate structure diagram 1 on a display of the machine using an appropriate keyboard. The structure diagram 1 comprises labels within boxes 2 denoting the types of data entry which it is intended to index, and links 4 joining the boxes 2 and denoting the relationships between the different types of data entry. When the design of the data structure diagram 1 has been completed the form in which the indexed data is to be displayed on entry and retrieval is determined by designing one or more dummy forms. When data is subsequently entered into the machine and retrieved using the forms, the data is automatically indexed and the indexed data is selectively displayed in dependence on the previously design data structure diagram 1. Furthermore it is a straightforward matter to modify the manner in which the data is indexed by the machine by changing the data ...

High performance message store

Operating system and data base having an access structure formed by a plurality of tables

Programmable computer with automatic translation between source and object code with version control

OPERATING SYSTEM AND DATA BASE HAVING AN ACCESS STRUCTURE FORMED BY A PLURALITY OF TABLES

Information management method, data recording medium, data recording method, information retrieving method and information retrieving apparatus

METHOD AND APPARATUS FOR INDEXED ADDRESSING OF TEXT UNITS

Disclosed is a method which makes it possible to address specific text units very quickly. This is achieved by providing a table allocated to the highest hierarchy stage, for storing the index of the first text unit of the second highest hierarchy stage. Further tables are provided, associated with the lower hierarchy stages, each for storing the indices of the text units of the next lower hierarchy stages. The tables are referred to successively, in decreasing order of hierarchy, until the index of the text unit which is being sought is reached. Very fast access can be had to specific text units. The physical address of each text unit is stored under the corresponding index in the table which is allocated to the lowest hierarchy stage. Text units can be inserted and deleted very quickly in a simple manner, since only the indices need to be changed in the tables. When text units are removed, the entire concatenation of text units is not formed anew, but rather the indices of the previous ...

METHOD FOR FORMING A TREE-STRUCTURE FILE

Method for Forming a Tree-Structure File A method for forming a plurality of files on a recording medium is disclosed, in which, in recording a data block which is to be a recording unit, such as a file itself, a file pointer or a directory, a storage zone intended for recording an unrecorded data block having pertinence with the firstly stated data block is reserved in such a manner that the continuity or correlation among the respective files may be maintained and the retrieval of the files is facilitated without re-writing of the record contents.

VIEW COMPOSITION IN A DATA-BASE MANAGEMENT SYSTEM

A structure and method of arranging recursively derived data items in a database. A set of hierarchical iteration levels, one for each iteration of the recursive relation from which the data items are derived, is provided and all data items derived during a given iteration are associated with the corresponding iteration level. Also provided is an index structure including an index set of non-leaf nodes, a sequence set of leaf nodes, and an iteration level index. The leaf nodes include a record of the iteration level of each data item. The data are globally linked according to iteration level or are clustered on pages which are linked according to iteration level. Highly efficient scan and search are implemented by utilizing the iteration level index and the record of iteration level in the leaf nodes to direct the scanning and searching to data generated during a single iteration. The least fixpoint of a set of mutually recursive relations is efficiently calculated by these methods.

Compressed data optical disk storage system

An improved optical disk data storage system method are disclosed. In an optical disk storage system, a data compression device is interposed between a host computer and an optical disk controller to permit data storage and retrieval operations on an optical disk to occur at a faster rate than would otherwise be possible. Data is compressed when it is received by the optical disk controller and is decompressed before it is sent to the host computer. In this way data may be efficiently stored on an optical disk while providing plug compatibility with a host computer designed to store and retrieve data on a magnetic media data storage device.

METHOD OF RAPIDLY OPENING DISK FILES IDENTIFIED BY PATH NAMES

Method and apparatus for longest match address lookup

INDEX SYSTEM

... 1373985 Information retrieval INTERNATIONAL BUSINESS MACHINES CORP 10 Aug 1972 37262/72 Heading G4A An index system in which addresses are identified by binary key words stored at the terminal vertices of a notional binary tree includes an associative index store 10 (Fig. 5), each record location of which represents a vertex, locations corresponding to non-terminal vertices containing data pointing to the next vertex in the tree and data indicating which bit of the key word should be examined. In the embodiment described a terminal address is found by examining bits of the key word in turn and moving on to the next right-hand or left-hand vertex in accordance with whether the examined bit is an "1" or a "0". The system also includes an associative key store 20, mask store 30 and translation store 40. Index store.-This comprises registers having a plurality of cells, each cell consisting of two bi-stable transistor circuits, data relating to right-hand vertices being stored in one bi-stable ...

OPERATING SYSTEM AND DATA BASE

PROCEDURE FOR SNAPPING OPENING DISK FILES IDENTIFIED WITH PATH NAMES.

SYSTEM AND PROCEDURE FOR INFORMATION LOCATION

PROGRAMMABLE COMPUTER WITH AUTOMATIC TRANSLATION BETWEEN POUR - AND TO GOAL CODE WITH VERSION MONITORING

A method of storing and retrieving miniaturised data

A system for program execution on a host data processing machine

PROGRAMMABLE COMPUTER WITH AUTOMATIC TRANSLATION BETWEEN SOURCE AND OBJECT CODE

A computer which executes rules which are defined according to a language having a valid grammar. The computer comprises input means for receiving and temporarily storing a first source code representation of a rule; object code translation means for translating the first source code representation into a first object code representation executable by the computer; storage means for storing the object code representations of rules; discard means for automatically discarding from the input means the first source code representation upon the storing of the first object code representation in the storage mean s; source code translation means for translating the first object code representation into a second source code representation where the second source code representation has lines of text; edit means for editing the second source code representation by deleting, adding, or changing one or more of the lines of text of the second source code representation; second object code translation ...

SYSTEM FOR CREATING, EDITING, DISPLAYING, AND EXECUTING RULES-BASED PROGRAMMING LANGUAGE RULES HAVING ACTION PART SUBSETS FOR BOTH TRUE AND FALSE EVALUATION OF THE CONDITIONAL PART

A programmable computer which operates by executing rules, each including a rule name, and optionally: input parameters, a set of conditions, a set of actions associated with each condition, and a set of exception handlers. A condition is a logical expression which evaluates to a true or false Boolean value, while an action is an executable statement. An exception handler contains executable statements. The computer includes text entry and display means for programming of rules. A rule is displayed with each condition and each action having a row of text. The computer generates a yes/no quadrant into which a programmer may enter sequence numbers, to associate ordered sets of actions with individual conditions. Sequence numbers may be entered not associated with any condition, to define a set of default actions. Upon entering a rule, the computer sequentially evaluates the rule's conditions. Upon a condition evaluating to true, the computer executes the set of actions associated with that ...

Adaptive mapping

A directory structure for a sparsely filled data container comprises a linked list, doubly linked list, skip list, or other non-fully populated list technique. One or more hierarchical levels of such lists may be used for sparsely filled directories. The directory structure may be converted to a conventional look-up table directory by reconstructing the directory when the directory becomes populated to certain point.

Search method for a data memory, and device to execute the method

In an n-dimensional (n = 1, 2, 3, 4, ...) co-ordinate system, a finite management space, a search space within the management space and search objects are specified. The search objects which intersect the search space are to be identified. In the Cartesian co-ordinate system, the search space is defined by an orthogonal grid, so that for each corner of the search space there is a corresponding grid point. The search objects are described by orthogonal rectangles or cuboids, which may degenerate to points. Using the grid, the management space is divided in each dimension into maximum strips, so that no corner is within a strip, but every strip is delimited by corners. The search space is processed and stored in such a way that the time cost for an overlapping test, if data processing systems with sufficient word width are used, is independent of the complexity of the search space. For this purpose, for each search object, a test is done of whether at least one intersection space of n strips ...

VERFAHREN ZUM WIEDERAUFFINDEN GESPEICHERTER INFORMATIONEN

Verfahren und Vorrichtung zum Suchen verdichteter gespeicherter Informationen

Automatic information retrieval system

... 1,197,429. Information retrieval system. E. FUJIMURA. 16 April, 1968. No. 36114/69. Headings G4A and G4C. An information retrieval system comprises a random access memory having a plurality of addresses each defined by a pair of co-ordinates x and y, a comparator, means for presenting to said comparator on inquiry data code Iq and the contents K of successive addresses x, y in said random access memory for comparison, said means being arranged to start with address x = y = 1 and including x calculating means arranged to change the value of x to x + 1 after each comparison and y calculating means responsive to said comparator to change the value of y to 2y - 1 after each comparison in which K exceeds Iq and to change the value of y to 2y after each comparison in which Iq exceeds K, and means for detecting when Iq equals K. The system is used in an automated telephone number information system in which the telephone numbers are associated with binarydecimal codes based on at least part of ...

METHOD AND MEANS FOR SEARCHING A COMPRESSED INDEX

... 1280485 Information retrieval; calculating INTERNATIONAL BUSINESS MACHINES CORP 30 Dec 1969 [3 Jan 1969] 63204/69 Headings G4A and G4C Compressed keys are searched using a search argument, e.g. for information retrieval. The compressed keys are of the type generated in Specification 1,280,483 (referred to), and each includes none or more key bytes K from a corresponding original uncompressed key, a key byte count field L indicating the number of such key bytes included, and a factor byte count field F indicating the number of key bytes in the uncompressed key to high order of those included. F and L are one-byte long each. A pointer to information associated with the immediately preceding key is also included, together with a length (count) field for the pointer. After setting a count E c to zero, the compressed keys CK are taken in turn for byte-by-byte comparison, in general, with successive bytes of the search argument SA, as follows (Fig. 16). Starting at 202, fields F and L of the ...

DIGITAL DATA PROCESSING SYSTEMS

... 1434219 Data processing system INTERNATIONAL BUSINESS MACHINES CORP 22 June 1973 [7 Aug 1972] 29712/73 Heading G4A A data processing system comprises main and secondary stores and accesses data from the secondary store using a " master rule " stored in the main store specifying inter alia the format of allowable stored data entries. Accessing stored data.-The stored data consists of fixed size blocks containing control data, one or more data entries of various predetermined sizes, and locators specifying, for each entry, its location relative to the beginning of the block. Each data entry is one of a number of allowable types each of which includes parts specifying its length, its type, its name, and a number of fields, each being of one of a number of allowable types, arranged in a predetermined format. Index blocks are also stored containing keys specifying the name and type of each stored data entry together with pointers giving the address of the corresponding block and the location ...

OPERATING SYSTEM AND DATA BASE WITH A FROM SEVERAL TABLES FIGURATION ACCESS STRUCTURE

OPERATING SYSTEM AND DATA BASE WITH A RULE LANGUAGE TO THE CONDITION-STEERED COMPUTER OPERATION

ADMINISTRATIVE PROCEEDINGS FOR A RECORDING MEDIUM

SYSTEM AND METHOD FOR INFORMATION RETRIEVAL

CACHE ARRANGEMENT FOR FILE SYSTEM IN DIGITAL DATA PROCESSING SYSTEM

... 60412-2159 A method for caching information needed by application programs from a secondary storage in which the cache memory is organized in multiple levels, each level having multiple entries, the entries of each level receiving information of a predetermined category, each entry being accessible independently. Links are defined between entries of one level of the cache memory and entries at another level of the cache memory, the links corresponding to information relationships specified by a user of information stored in the secondary storage. The use and reuse of the cache entries is based on the links. In response to a request to a file system from an application for needed information, the needed information is fetched into the cache, and in connection with fetching the needed information, other information is prefetched from the system of files which is not immediately needed. Quotas are established on information which may be fetched from a secondary storage into the cache, the ...

COMPUTER METHOD FOR IMPLEMENTING A GET INSTRUCTION

A computer method for executing a GET instruction for retrieveing the first record stored in a data base that meets the stated criteria and for issuing an exception when no such record is found.

System and method for exporting formatted transactional data from a database system

A database and data processing system for transactional and other data allows such data to be exported in various different formats as required by other systems. As an example, the exported data can be loaded into a business's general ledger. Data can be exported in different formats, quite flexibly with easy setup of new and different export data formats for different systems.

Flash file management system

A flash memory using branded sectors for managing data files. The flash memory is divided into separately erasable blocks where each block may only be erased in its entirety. Each erasable block includes several file sectors, a sector allocation table (SAT) including an SAT record for each file sector, and a block information record (BIR) including status and an erasure count for the block. Each file sector may be designated as a file data sector, a file header sector, or block erasure sector. The data sectors include a data segment of one of the data files and is branded by a file identification and a sequence number. The brand and the size of the file sectors are used for locating the data sector for accessing the data segment. In order to prevent data from being lost during an update or a consolidation, each SAT record includes a pre-discard indicator for indicating when the associated data sector is being modified or consolidated and a discard indicator for indicating that the modification ...

Process for the management of files on a non-erasable information carrier

A process for the management of files and digitized documents on a non-erasable information carrier consisting of storing objects on the header, file and directory types and a table for converting a logic address into a physical address. A partition into several segments is defines on the storage space, each segment serving to store a single type of objects. The structure chosen for the objects makes it possible to store the information in accordance with a tree-like architecture, wherein the directories form the nodes or knots. The partition is modifiable and is stored in the header. Each type of object comprises means of the chaining field type permitting an updating of its content.

Method, apparatus and computer program product for generating tiered search index fields in a group-based communication platform

Methods, apparatus and computer program product for generating tiered search index fields based on a divided group-based communication data corpus in a group-based communication platform are described herein. In some embodiments, the system provides for receiving a group-based communication data corpus, generating a retrieval score, and assigning each group-based communication data object associated with a retrieval score. Each group-based communication data object may meet or exceed a retrieval score threshold of a high retrieval probability corpus. Each group-based communication data object associated with a retrieval score below the retrieval score threshold may be assigned to a low retrieval probability corpus. High and a low retrieval probability search index fields may be generated and associated with the high and low retrieval probability corpus.

СПОСОБ ОРГАНИЗАЦИИ НОСИТЕЛЯ ЗАПИСИ ЦИФРОВЫХ ДАННЫХ, УСТАНОВКА УЧАСТКА ИХ ЗАПИСИ, СПОСОБ И УСТРОЙСТВО ЗАПИСИ ИХ НА НОСИТЕЛЕ, НОСИТЕЛЬ ЗАПИСИ И/ИЛИ ВОСПРОИЗВЕДЕНИЕ ЦИФРОВЫХ ДАННЫХ, КОМПЪЮТЕРНАЯ СИСТЕМА ДЛЯ ЗАПИСИ ЦИФРОВЫХ ДАННЫХ НА НОСИТЕЛЕ

Изобретение предназначено для организации носителя записи в случае записи подлежащих компьютерной обработке цифровых данных на магнитооптическом диске уплотненным способом или их воспроизведения с такого диска. Выполняется организация режима записи цифровых данных на носитель записи в первые элементы в соответствии с первой таблицей. Назначают предварительно установленную область из области носителя записи, подвергающейся организации в соответствии с первой таблицей для выполнения записи во вторые элементы в назначенной области. Организация режима записи на носитель записи цифровых данных в назначенной области происходит в соответствии со второй таблицей. Технический результат - возможность более рационального использования свободного места на диске с обеспечением его совместимости аппаратуры с обычным мини-диском. 9 с. и 44 з.п. ф-лы, 30 ил.

INFORMATIONSVERWALTUNGSVERFAHREN, DATENAUFZEICHNUNGSTRÄGER UND -VERFAHREN, INFORMATIONSWIEDERAUFFINDUNGSVERFAHREN UND -GERÄT

VERFAHREN ZUM SCHNELLEN EROEFFNEN VON PLATTENDATEIEN

A method and system for processing a data set

Data Storage System

... 1,187,427. Digital data storage. INTERNATIONAL BUSINESS MACHINES CORP. 31 July, 1967 [4 Aug., 1966], No. 35057/67. Heading G4C. In a data storage system, records each including a key and data are arranged in divisions each sub-divided into sub-divisions, stored indices associated with the divisions and subdivisions being searched to identify the division and subdivision containing a desired record, means being provided for addressing the desired record within its division. In the Fig. 1 embodiment, a bulk store 1 is divided into cells, subcells, strips, bars and heads, each of 10 cells having 20 subcells, each of the latter containing 10 strips, and so on. Records in the bulk store 1 each comprise data and a key. A CPU (central processing unit) inserts the key of a desired record serially by byte into a core store 4 together with an indication of the key size (number of bytes). This key is compared at 21, serially by byte, with the highest key number in each cell in turn, these highest ...

HIERARCHICAL FILE SYSTEM

PREFIX SEARCH TREE WITH PARTIAL KEY BRANCHING

Programmable computer with automatic translation between source and object code with version control

METHOD FOR STORING A PARCELWISE DIVIDED DIGITAL DATA BASE AS WELL AS OF ADDRESSING A DATA PARCEL IN A MASS MEMORY, AND APPARATUS FOR CARRYING OUT THE METHOD

Method for storing a parcelwise divided digital data base, as well as of addressing a data parcel in a mass memory and apparatus for carrying out the method. A database is stored in a mass memory. For this purpose, it is first divided into main cells and then into base cells according to a predetermined regular division pattern. Each base cell is then checked to see whether its data content is sufficient to occupy substantially completely a storage parcel having a predetermined capacity. If this is the case, the base cell is thus accommodated in a storage parcel; if this is not the case, adjacent base cells are grouped until a storage parcel is occupied substantially completely. The operation of addressing a storage parcel is effected by the use of a main cell table in which address pointers are stored, each of which points to a base cell table. In the base cell table, an index is given for each base cell and this index indicates in which storage parcel the relevant base cell is accommodated ...

INFORMATION SEARCHING APPARATUS

The information searching apparatus in accordance with the present invention comprises: a memory device having a plurality of banks and containing a plurality of types of information data to be searched, as arranged in block; a table memory device containing, in table, the banks serving as the basis of the information to be searched, the number of changed banks and address data; and a table reading device for reading tabled information from the table memory device. This information searching apparatus is so arranged as to search the target information to be searched by obtaining the base bank information based on the tabled information from the table memory device, and by obtaining the number of changed banks and the address data of the base bank information. Further, this apparatus is arranged such that the user may learn synonyms and antonyms, or the translated terms, the phonetic symbols or the like of index words in dictionary data. Such data may be searched in a short period of time ...

METHOD AND APPARATUS FOR TRANSLUCENT FILE SYSTEM

In a computer system having a hierarchical file structure, a file system is provided which permits users of the system to share a file hierarchy and also have a private hierarchy in which files are automatically copied to as they are modified. Through the system of the present invention, a directory appears to the user as a single directory but may actually comprise files originating from a number of directories which are connected to one another through search links. Each directory has a search link associated with it which contains the path name of the back layer or directory behind it. The first layerseen through the system of the present invention is the front layer, private to the user. The back layers behind the front layer and connected to the front layer through the search links are shared layers accessible to multiple users. Thus transparent to the user the directory accessible comprises multiple layers comprising shared and private files. The system further provides a copy-on-writefeature ...

PREFIX SEARCH TREE WITH PARTIAL KEY BRANCHING

A prefix index tree structure for locating data records stored through keys related to information stored in data records. Each node includes a prefix field for a prefix string of length p of the longest string of key characters shared by all subtrees of the node and a data record field for a reference to a data record whose key is completed by the prefix string. A node may include one or more branch fields when the prefix string is a prefix of keys stored in at least one subtree of the node, with a branch field for each distinct p+1st key character in the keys, wherein each p+1st key character is a branch character. Each branch field includes a branch character and a branch pointer field for a reference to a node containing at least one key whose p+1st character is the branch character. Each node further includes a field for storing the number of key characters in the prefix string and a field for storing the number of branch fields in the node. Also disclosed are methods for constructing ...

Apparatus and method for retrieving character string based on classification of character

A character string retrieval apparatus classifies a plurality of characters following a prefix of a registration character string into a plurality of groups, and registers those following characters in an array structure using a different displacement amount for each group. The character string retrieval apparatus retrieves a given character string based on the displacement amount of a group corresponding to an input character.

Method and system for information storing and retrieval using word stems and derivative pattern codes representing familes of affixes

An information storage/retrieval system stores information to be retrieved in a storage device having a first memory and a second memory. The first memory stores therein main records each containing an index word data, a derivative pattern code and information pieces while the second memory stores therein auxiliary records each containing a derivative pattern code and supplemental word data. Each derivative pattern code represents a group of words whose primary parts such as word stem parts are commonly combinable with the same remaining parts such as affix parts. Thus, each index word data is qualified by the accompanying derivative pattern code, and the supplemental word data includes data corresponding to the above-mentioned remaining parts. An information retrieval is made by searching in a first memory with respect the primary part of a keyword taken from, for example, its head and then in a second memory with respect to the remaining part of the keyword, thereby identifying the keyword ...

Verarbeitungsverfahren und Gerät um einen Dateinamen von einem logischen zu einem richtigen Namen zu erstellen

Verfahren und Vorrichtung zur Adresssuche längster Übereinstimmung

Nachschlagetabelle, umfassend: eine erste Nachschlageeinheit, welche einen Schlüssel empfängt und ein erstes Ergebnis durch eine Mehrstufensuche in der ersten Nachschlageeinheit bereitstellt; und eine zweite Nachschlageeinheit, welche den Schlüssel empfängt und ein zweites Ergebnis durch eine Mehrstufensuche in der zweiten Nachschlageeinheit bereitstellt, wobei sowohl die erste Nachschlageeinheit als auch die zweite Nachschlageeinheit den Schlüssel parallel empfangen und nur eine der Einheiten ein Endergebnis für den Schlüssel bereitstellt, welches nur in einer der Nachschlageeinheiten in Abhängigkeit von dem ersten Ergebnis und dem zweiten Ergebnis gespeichert wird.

Verfahren zum Wiederauffinden gespeicherter Informationen

Method and apparatus for longest match address lookup

METHOD AND MEANS FOR GENERATING COMPRESSED KEYS

... 1280483 Information retrieval; calculating INTERNATIONAL BUSINESS MACHINES CORP 30 Dec 1969 [3 Jan 1969] 63202/69 Headings G4A and G4C] Compressed keys, for information retrieval, are generated from a source index of uncompressed keys by accessing each key and its next key in a sorted sequence to obtain a pair of keys and generating a compressed key for one of them using the other. Each key is compared with the next to determine the highest-order unequal byte position (called the difference position). If the difference position for this pair of keys is to low order of the difference position for the preceding pair (the second key of which is the first key of the present pair) the bytes in the second key, say, of the present pair from after the "preceding" difference position up to and including the "present" difference position are included as key bytes in the compressed key being produced for the uncompressed key from which the bytes come, except that the byte to high order of this selected ...

INFORMATION SEARCHING APPARATUS

VIEW COMPOSITION IN A DATA-BASE MANAGEMENT SYSTEM

RECORDING MEDIUM MANAGEMENT METHOD

In the case of recording computer data, e.g., into clusters 16 to 27 of the data recording area, the range of clusters 16 to 27 is ensured as an available range in management table (parts table) of U-TOC. For example, onto parts table of No. 02h, such computer data is recorded as a segment in which cluster 16 is caused to be start address and cluster 27 is caused to be end address. For the purpose of carrying out management of recording state of computer data, FAT (File Allocation Table) is separately provided. At this table, management of recording states of clusters 16 to 27 is carried out. Thus, computer data can be recorded onto mini-disc for recording audio data.

PROGRAMMABLE COMPUTER WITH AUTOMATIC TRANSLATION BETWEEN SOURCE AND OBJECT CODE

A computer which executes rules which are defined according to a language having a valid grammar. The computer comprises input means for receiving and temporarily storing a first source code representation of a rule; object code translation means for translating the first source code representation into a first object code representation executable by the computer; storage means for storing the object code representations of rules; discard means for automatically discarding from the input means the first source code representation upon the storing of the first object code representation in the storage means; source code translation means for translating the first object code representation into a second source code representation where the second source code representation has lines of text; edit means for editing the second source code representation by deleting, adding, or changing one or more of the lines of text of the second source code representation; second object code translation ...

COMPUTER METHOD FOR IMPLEMENTING A GET INSTRUCTION

A computer method for executing a GET instruction for retrieveing the first record stored in a data base that meets the stated criteria and for issuing an exception when no such record is found.

Method of transforming queries based upon E/R schema into multi-dimensional expression queries

A method of transforming queries based upon an entity/relationship schema into multi-dimensional expression queries is provided. The method comprises matching an object referenced in an entity/relationship schema based report specification to a corresponding object in the entity/relationship schema, the corresponding object adorned with associated multidimensional metadata; adding the associated multi-dimensional metadata to the object referenced in the entity/relationship schema based report specification; translating the entity/relationship schema based report specification into a multi-dimensional expression query; and retrieving directly all data required to populate a report output of the entity/relationship schema report specification.

VERFAHREN UND ANORDNUNG ZUM INDIZIERTEN ADRESSIEREN VON TEXTEINHEITEN

Datenspeichersystem bzw. Verfahren zur Einteilung von Datenspeichern

Method of rapidly opening disk files identified by path names

A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.

Method and apparatus for longest match address lookup

We present a lookup table which allows sparse subtree descriptors and dense subtree descriptors to be stored in the same memory. A subtree entry in the memory stores a dense subtree descriptor for a dense subtree or a plurality of sparse subtree descriptors for sparse subtrees. The subtree entry is indexed by a leaf in the previous subtree. The sparse subtree descriptor stores at least one node descriptor. The node descriptor describes a set of leaves in the sparse subtree having a common value. The common value is encoded in the node descriptor using run length encoding.

HEIRARCHICAL FILE SYSTEM

OPERATING SYSTEM AND DATA BASE HAVING AN ACCESS STRUCTURE FORMED BY A PLURALITY OF TABLES

An object access system for retrieving objects in response to requests identifying requested objects, the system comprising an access structure consisting of a plurality of tables where each table is identified by a unique table identifier and has a plurality of rows where each row has a plurality of fields and is identified by a unique primary key in one of the fields and where a field may also contain objects; a row index for each table, each row index having entries ordered on the primary key of the rows in the table where each entry points to a row of fields in the table; a table index ordered on the table identifier for the tables, the table index having an entry for each table which point to the row index for that table and access means, responsive to requests for an object having an associated table identifier and primary key, for searching the table index for the requested table identifier and for retrieving from the table index entry for the requested table identifier the pointer ...

OPERATING SYSTEM AND DATA BASE HAVING AN ACCESS STRUCTURE FORMED BY A PLURALITY OF TABLES

An object access system for retrieving objects in response to requests identifying requested objects, the system comprising an access structure consisting of a plurality of tables where each table is identified by a unique table identifier and has a plurality of rows where each row has a plurality of fields and is identified by a unique primary key in one of the fields and where a field may also contain objects; a row index for each table, each row index having entries ordered on the primary key of the rows in the table where each entry points to a row of fields in the table; a table index ordered on the table identifier for the tables, the table index having an entry for each table which point to the row index for that table and access means, responsive to requests for an object having an associated table identifier and primary key, for searching the table index for the requested table identifier and for retrieving from the table index entry for the requested table identifier the pointer ...

MODULAR DATA STORAGE DIRECTORIES FOR LARGE-CAPACITY DATA STORAGE UNITS

An updatable and expandable directory structure and resultant access procedures emulating a write-once or indelible record medium to a rewriteable record medium as to accessing characteristics. The directory is indexed; one directory header for a first set of files indexes another set of files. Sector clusters or data extents are managed such that random recording from any file proceeds independently of write-once characteristics. The directory is stored on the medium as data is recorded. Each directory entry contains an archival history of recording of a related data file in the medium. Both logical and physical addressing is employable. TU985007 ...

DATABASE MANAGEMENT SYSTEM FOR CONTROLLING CONCURRENT ACCESS TO DATABASE

DATABASE MANAGEMENT SYSTEM FOR CONTROLLING CONCURRENT ACCESS TO A DATABASE A method of assuring that each of a plurality of contemporaneously active database transactions comprising at least one read transaction and at most one update transaction has a consistent view of a database storing a plurality of versions of a relation. A transaction has a consistent view of a database if the data available to a transaction are not changed during its execution. An access dictionary is stored comprising an array of access blocks each defining the database location of one of the relation versions. A-t any given time, only one of the relation versions is defined as current. A relation dictionary comprising an array of relation blocks is stored such that as each database transaction is begun, a relation block associated with that database transaction is stored defining the access block defining the database location of the relation version then defined as current. For the update transaction, a new access ...

Computer Architecture for Processing Correlithm Objects Using a Selective Context Input

A device configured to emulate a correlithm object processing system comprises a memory and one or more processors. The memory stores a mapping table that includes multiple context value entries, multiple corresponding source value entries, and multiple corresponding target value entries. Each context value entry includes a correlithm object. The one or more processors receive at least one input source value and a context input value. The one or more processors identify a context value entry from the mapping table that matches the context input value based at least in part upon n-dimensional distances between the context input value and each of the context value entries. The one or more processors identify a portion of the source value entries corresponding to the identified context value entry, and further identifies a source value entry that matches the input source value. The one or more processors identify a target value entry corresponding to the identified source value entry.

Database system capable of carrying out an efficient free area search

In a database system of the present invention, a storage range in the data storage area has a control record storing the address of the additional range in the overflow area and the upper additional ranges constituting the additional range have control records storing the addresses of the connected lower additional range or ranges and of another upper additional range connected and the free area data for the connected lower additional ranges. In searching for a free area, storage range free area checking means judges whether the storage range has any free area, and upper additional range free area checking means judges whether the upper additional range has any free area. For existence of free area in lower additional ranges, lower additional range free area checking means refers to the free area data for the lower additional ranges stored in the control record of the upper additional range and judges whether a free area exists or not.

SYSTEM UND VERFAHREN FÜR INFORMATIONSAUFFINDUNG

Method and apparatus for longest match address lookup

Computer data storage system

... 1,018,915. Electric digital data-storage INTERNATIONAL BUSINESS MACHINES CORPORATION. May 21, 1964 [May 23, 1963], No. 20948/64. Heading G4C. In a binary data storage system for hierarchically-organized data of variable field length and having identifier symbols separating the levels of data, the location of identifier symbols in a main store in which a data string is stored is specified by occurrence marks in an auxiliary store. In the particular embodiment, a data string consisting of 8-bit characters is stored in the form of 8-character words in a 3-dimensional magnetic core matrix main store. The data is considered to be organized according to a hierarchy of levels, e.g. phrase, sentence, paragraph, and the beginnings and ends of phrases, sentences and paragraphs are indicated by the presence of phrase, sentence and paragraph identifier characters in the data string, a given identifier character being taken to imply all lower-level identifiers as well (since e.g. every paragraph beginning ...

OPTICAL PROJECTION SYSTEM

... 1336817 Information retrieval INTERNATIONAL BUSINESS MACHINES CORP 22 Sept 1971 [21 Dec 1970] 44104/71 Heading G4A The Specification describes algorithms for maintaining a multi-level compressed key index by making any necessary modifications to the compressed keys resulting from the insertion, deletion or updating of data records. Each maintenance operation includes a multilevel search through the index using a search argument representing a data record, each compressed key level being exited at a compressed key (CK) first comparing high with the search argument and the exiting pointers (printing to the next lower level) being stored, retrieval of a data record with the last pointer stored, derivation of an uncompressed key (UK) from the retrieval data record, and comparison of the UK with the search argument to generate a signal indicating whether the argument is high, low or equal with respect to the UK. If on insertion of a new record, the subsequent addition of a new CK to an index ...

Method and apparatus for longest match address lookup

Method and system for managing execution of virtual applications

A system and method for directing download and execution of an application. A runtime engine receives an identifier of a block of shared memory from a directing process. The shared memory stores a map indicating which portions of an application file have been stored in a local copy of the application file. The runtime engine also receives an instruction from the directing process to execute the local copy when the local copy stores less than the entire application file. As the application executes, the runtime engine identifies requests from the application to access portions of the local copy and uses the map to determine whether the requested portions have been stored in the local copy. If the requested portions are not stored in the local copy, the runtime engine prevents the executing application from accessing the local copy until the map indicates the requested portions have been stored therein.

Method of creating graph structure from time-series of attention data

Embodiments of the present invention provide systems, methods and computer program products for generating search results comprising web documents with associated expert information. One embodiment of a method for generating such search results includes receiving one or more search queries, selecting one of the one or more search queries, determining one or more categories of web documents responsive to the selected search query and crawling a web graph of linked web documents to identify one or more web documents tagged as within the one or more categories responsive to the selected search query. The method further includes generating a result set of the one or more web documents identified as within the one or more categories responsive to the selected search query, ranking the result set and generating a list of ranked search results responsive to the selected search.

Method for classification of objects in a graph data stream

A method for classifying objects in a graph data stream, including receiving a training stream of graph data, the training stream including a plurality of objects along with class labels that are associated with each of the objects, first determining discriminating sets of edges in the training stream for the class labels, wherein a discriminating set of edges is one that is indicative of the object that contains these edges having a given class label, receiving an incoming data stream of the graph data, wherein class labels have not yet been assigned to objects in the incoming data stream, second determining, based on the discriminating sets of edges, class labels that are associated with the objects in the incoming data stream; and outputting to an information repository object class label pairs based on the second determining.

Skip list generation

A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.

System and method for tree creation

Tree creation systems and methods are disclosed. An example of a method includes building a system tree in computer-readable medium, the system tree having a plurality of nodes, each node in the system tree representing a desired range of characteristics of a component of a system under consideration. The method also includes identifying probable nodes in other trees that satisfy the desired range of characteristics of the component of the system under consideration. The method also includes creating in computer-readable medium at least one new tree for the system under consideration by replacing at least one of the nodes in the system tree with at least one of the probable nodes from the other trees.

Bit string search apparatus, search method, and program

To increase space efficiency of a coupled node tree, a branch node does not have an area that holds an array element number of an array element wherein is stored the primary node of the node pair that is the link target, and the root node is disposed in an array element with a node location number 1 , and the primary node is disposed in an array element whose node location number is twice the node location number of the branch node. The node location number of an array element wherein is disposed a link target node is obtained by adding the bit value in the search key at the discrimination bit position for the link source branch node to twice the node location number of the branch node.

Method, system and computer program product for reading a decision tree

In response to a query of a decision tree, a first packed node of the decision tree is copied from a system memory into a direct memory access (“DMA”) memory. In response to copying the first packed node from the system memory into the DMA memory, copying is initiated of a second packed node of the decision tree from the system memory into the DMA memory, up to a limit of then-currently available space within the DMA memory. Concurrently with copying the second packed node from the system memory into the DMA memory, the first packed node is evaluated in the DMA memory. In response to evaluating the first packed node, the second packed node is evaluated in the DMA memory without waiting for additional copying of the second packed node from the system memory into the DMA memory.

Automated creation and delivery of database content

A method and apparatus are disclosed which automatically build a database by automatically assigning links to an expert, pushing content to an expert, providing expert annotation, and linking the content to an annotation database. A term is selected by applying rules. An advertiser can sponsor the term. Content windows can be attached to the term, the content window containing information such as definitions, related products or services, sponsorship information, information from content syndicators, translations and reference works. A utility is available to the expert that allows the expert to analyze the term in context by extending or reducing the sentence or paragraph the word is contained in. Data objects that represent the contents of the database and templates are syndicated to remote servers running a processing engine. The processing engine uses these data objects to execute linking rules without requiring a connection to the database.

System and method for exclusion of irrelevant data from a dom equivalence

A computer-implemented process, computer program product, and apparatus for computing excluded data. A web page of interest is identified to form an identified page. The identified page is loaded a first time to form a first load, and responsive to a determination that a delta has not been computed for the identified web page, the identified page is loaded a second time to form a second load. Whether portions of the first load differ from portions of the second load is determined. Responsive to a determination portions of the first load differ from portions of the second load, the portions that differ to form a delta are identified. The delta is stored to form stored delta and the stored delta is excluded from a document object model associated with the identified page to form a modified document object model.

Pattern matching device, pattern matching method, and pattern matching system

Provided is a pattern matching device capable of generating an event pattern matching tree optimal for efficiently performing pattern matching assessment. The pattern matching device is provided with an event pattern table holding unit for holding an event pattern including a partial event pattern comprising a first attribute name and an attribute value; a first matching ratio measurement unit for measuring a matching ratio corresponding to the first attribute name on the basis of an event including attributes comprising a second attribute name and an attribute value and the event pattern; and an event pattern matching tree generation unit for generating an event pattern matching tree which has arranged on an upper level an attribute value matching assessment instance including the first attribute name which has the low corresponding matching ratio on the basis of the event pattern and the matching ratio.

Management of a history of a meeting

Provenance techniques are disclosed for managing a history of a meeting. For example, a method for managing a history associated with a meeting comprises the following steps. Data associated with the meeting is collected. Provenance data is generated based on at least a portion of the collected data, wherein the provenance data is indicative of a lineage of one or more data items. A provenance graph is generated that defines a visual representation of the generated provenance data, wherein graph elements comprise one or more nodes and one or more edges between nodes, wherein nodes of the graph represent records associated with the collected data and edges of the graph represent relations between the records. One or more applications are associated with at least one graph element and are selectable to invoke functionality. The generated provenance graph is stored in a repository for use in analyzing the meeting.

System and method for locating bilingual web sites

Disclosed herein are systems, methods, and non-transitory computer-readable storage media for bootstrapping a language translation system. A system configured to practice the method performs a bidirectional web crawl to identify a bilingual website. The system analyzes data on the bilingual website to make a classification decision about whether the root of the bilingual website is an entry point for the bilingual website. The bilingual site can contain pairs of parallel pages. Each pair can include a first website in a first language and a second website in a second language, and a first portion of the first web page corresponds to a second portion of the second web page. Then the system analyzes the first and second web pages to identify corresponding information pairs in the first and second languages, and extracts the corresponding information pairs from the first and second web pages for use in a language translation model.

Dynamic reduction of stream backpressure

Techniques are described for eliminating backpressure in a distributed system by changing the rate data flows through a processing element. Backpressure occurs when data throughput in a processing element begins to decrease, for example, if new processing elements are added to the operating chart or if the distributed system is required to process more data. Indicators of backpressure (current or future) may be monitored. Once current backpressure or potential backpressure is identified, the operator graph or data rates may be altered to alleviate the backpressure. For example, a processing element may reduce the data rates it sends to processing elements that are downstream in the operator graph, or processing elements and/or data paths may be eliminated. In one embodiment, processing elements and associate data paths may be prioritized so that more important execution paths are maintained. In another embodiment, if a request to add one or more processing elements may cause future backpressure, the request may be refused.

Event impact analysis

A method and system for analyzing impact of an event on resources of a network. A directed graph is generated and includes nodes and edges. Each node represents a resource. Each edge connects, and is directed from, a predecessor node to a successor node. The event impacts the resource at an event node. A propagation time (PT) is determined for each edge. The PT is a time interval for an impact of the event to travel along each edge from the predecessor node to the successor node. An initial estimated impact time (EIT) is set for each node. The EIT for each node is an estimated time at which the event impacts each node. The EIT of each node that is directly or indirectly connected to the event node by one or more edges is updated. A list of the updated nodes is sent to an output device.

Measuring the goodness of a top-k diversified ranking list

A method, system and computer program product for measuring a relevance and diversity of a ranking list to a given query. The ranking list is comprised of a set of data items responsive to the query. In one embodiment, the method comprises calculating a measured relevance of the set of data items to the query using a defined relevance measuring procedure, and determining a measured diversity value for the ranking list using a defined diversity measuring procedure. The measured relevance and the measured diversity value are combined to obtain a measure of the combined relevance and diversity of the ranking list. The measured relevance of the set of data items may be based on the individual relevance of each of the data items to the query, and the diversity value may be based on the similarities of the data items to each other.

Preserving and handling native data in hybrid object trees

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.

Semantic questioning mechanism to enable analysis of information architectures

Methods, computer program products and systems are directed to receiving a query regarding an information architecture, selecting a set of nodes based on the query, from a plurality of nodes in a weighted linked graph, the weighted linked graph comprising the plurality of nodes and a plurality of pathways, each of the plurality of nodes comprising a source of information regarding the information architecture, each of the plurality of pathways connecting one of the plurality of nodes to another of the plurality of nodes, each of the plurality of pathways comprising a weight, determining a path from the plurality of pathways that passes through all of selected nodes, and presenting the path in response to the query.

Dynamic reduction of stream backpressure

Techniques are described for eliminating backpressure in a distributed system by changing the rate data flows through a processing element. Backpressure occurs when data throughput in a processing element begins to decrease, for example, if new processing elements are added to the operating chart or if the distributed system is required to process more data. Indicators of backpressure (current or future) may be monitored. Once current backpressure or potential backpressure is identified, the operator graph or data rates may be altered to alleviate the backpressure. For example, a processing element may reduce the data rates it sends to processing elements that are downstream in the operator graph, or processing elements and/or data paths may be eliminated. In one embodiment, processing elements and associate data paths may be prioritized so that more important execution paths are maintained.

Updating a perfect hash data structure, such as a multi-dimensional perfect hash data structure, used for high-speed string matching

A representation of a new rule, defined as a set of a new transition(s), is inserted into a perfect hash table which includes previously placed transitions to generate an updated perfect hash table. This may be done by, for each new transition: (a) hashing the new transition; and (b) if there is no conflict, inserting the hashed new transition into the table. If, however, the hashed new transition conflicts with any of the previously placed transitions, either (A) any transitions of the state associated with the conflicting transition are removed from the table , the hashed new transition is placed into the table, and the removed transitions are re-placed into the table, or (B) any previously placed transitions of the state associated with the new transition are removed, and the transitions of the state associated with the new transition are re-placed into the table.

System for organizing and fast searching of massive amounts of data

A system to collect and analyze performance metric data recorded in time-series measurements, converted into unicode, and arranged into a special data structure. The performance metric data is collected by one or more probes running on machines about which data is being collected. The performance metric data is also organized into a special data structure. The data structure at the server where analysis is done has a directory for every day of performance metric data collected with a subdirectory for every resource type. Each subdirectory contain text files of performance metric data values measured for attributes in a group of attributes to which said text file is dedicated. Each attribute has its own section and the performance metric data values are recorded in time series as unicode hex numbers as a comma delimited list. Analysis of the performance metric data is done using regular expressions.

Method and system for managing and querying large graphs

A method, system and computer program product for managing and querying a graph. The method includes the steps of: receiving a graph; partitioning the graph into homogeneous blocks; compressing the homogeneous blocks; and storing the compressed homogeneous blocks in files where at least one of the steps is carried out using a computer device.

Context aware annotation

Various embodiments of systems and methods for context aware annotations are described herein. A user request is received to visualize a dataset according to a user selected visualization type. A visualization of the dataset is created according to the user selected visualization type and the created visualization is displayed on the computer screen. The context information of each region of the displayed visualization is compared with the context information stored in annotations stored in the memory. Based on the comparison, a determination is made whether the context information stored in any of the annotations matches with the context information of any of the regions. The annotation is displayed on the region of the visualization, which has the same context information. In one embodiment, a list of annotations is displayed to the user. The information related to a selected annotation from the list of annotations is displayed to the user.

Acyclic graph navigator

A method for navigating an acyclic graph includes the steps of generating two or more acyclic graphs, each of the two or more acyclic graphs relating to a specific topology, wherein at least two of the two or more acyclic graphs include at least one common node; receiving a request to generate a composite acyclic graph, wherein the composite acyclic graph includes the at least one common node; generating the composite acyclic graph; and displaying the specific node of the composite acyclic graph.

Path-decomposed trie data structures

Path-decomposed trie data structures are described, for example, for representing sets of strings in a succinct manner whilst still enabling fast operations on the string sets such as string retrieval or looking up a string with a specified identifier. A path-decomposed trie is a trie (tree data structure for storing a set of strings) where each node in the path decomposed trie represents a path in the trie. In various embodiments a path-decomposed trie data structure is represented succinctly by interleaving node labels and node degrees in an array and optionally by compressing the node labels using a static dictionary. Node labels may be string characters and a node degree may be a number of children of a node. In some embodiments a path-decomposed hollow trie data structure is used to provide a hash function for string sets.

Data display device, data display method, and program product

Displaying pieces of data includes displaying a tree structure on a display device, identifying, in response to a first node being selected from among nodes constituting the displayed tree structure, all nodes connected to the first node in a high-order direction and a low-order direction as a first node group, and identifying, in response to a second node being selected, the second node not being included in the first node group, all nodes connected to the second node in the high-order direction and the low-order direction as a second node group. The second node moves toward the first node according to an operation. A node not to be displayed is determined according to a rule and movement of the second node group. A display device is instructed to display the first node group and the second node group close to each other omitting display of the determined node.

Binary tree storage method and system

The present invention is applicable to the field of computer technologies and provides a binary tree storage method and system. The method includes: dividing a binary tree into a root tree and a plurality of subtrees, where the plurality of subtrees is layered and stored in N levels of storages; partitioning the plurality of subtrees into M types according to a preset rule, so that the plurality of subtrees is partitioned into N×M data blocks; and adjusting storage positions of the N×M data blocks in the storages, so that a storage at each level occupies the same number of storage units. In the present invention, storage spaces for nodes at each level, which are spaces of non-uniform sizes, are normalized into spaces of the same size, thereby increasing a space utilization rate of storages.

Persistent iteration over a database tree structure

Persistent iteration is performed in stages on nodes arranged according to a node identification (ID) that is increasing in order under a parent node in database tree structure. While performing the persistent iteration, storing a start node ID of the node where the persistent iteration commenced, a current node ID of the node that is undergoing the persistent iteration, a parent node ID of the node that is undergoing the persistent iteration, and a numerical value representing the current level and all levels greater than the current level of nodes that are undergoing the persistent iteration. Upon completion of the persistent iteration on the nodes that are the children of the node with the parent node ID, returning to the first node among the children of the node with the parent node ID, as ordered by increasing node ID, and performing the persistent iteration for children nodes of each node.

Generating data processing code from a directed acyclic graph

The present invention provides a computer-implemented code generation system that generates data processing code from a directed acyclic graph (DAG). The generated code is both declarative and procedural, and can be run in a relational database or in a Map Reduce implementation using Apache Pig. Each node of the DAG specifies operations performed on tabular data that can be stored in a delimited plain text file, a spreadsheet, or a relational database.

Risk manager optimizer

Embodiments of the invention broadly described, introduce systems and methods for automatically generating rules. One embodiment of the invention discloses a method for generating a candidate rule. The method comprises receiving transaction data comprising a plurality of fields, wherein each field is associated with one or more field values, constructing a rule graph, wherein vertices in the rule graph correspond to a plurality of the one or more field values, generating a tree, wherein generating the tree comprises selecting an edge from a set of edges connecting a vertex in the tree with a vertex not in the tree, and adding the edge to the tree if the edge has a maximum signal-to-noise value of all edges in the set of edges, and converting the tree into a candidate rule.

Systems and methods multi-key access to data

A computer-implemented method of storing data for fast lookup comprises forming a first and a second array of pointers, forming a record to store, the record comprising fields for, a first list pointer, a second list pointer, which is not the first field in the record, a first key, and a second key. The method further comprises determining a first index based at least in part the first key, setting the value of the pointer at the first index in the first array to the location of the first pointer field of the record, determining a second index based at least in part the second key, and setting the value of the pointer at the second index in the second array to the location of the second pointer field of the record.

Composite Term Index for Graph Data

An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.

Acquiring structured user data using composer interface having input fields corresponding to acquired structured data

A social networking system obtains specific structured data about a user via a composer interface having textual content with incomplete portions and input fields corresponding to the incomplete potions. The input fields map to data fields in the user's profile and are selected based on the social networking system's need for the information associated with the data fields.

Confidence Based Vein Image Recognition and Authentication

An indexed hierarchical tree search structure converts each registration sample into an equivalent registration model based on the clustering of its registration item descriptors in the leaf nodes of the hierarchical tree. Query item descriptors from a query sample from someone wanting to be recognized are distributed into the hierarchical tree. A query model is defined based on the clustering of query item descriptors at the leaf nodes, and registration and verification are made based on comparison of the query model and the registration models.

Indexing Based on Object Type

In one embodiment, a method includes maintaining data stores for objects of a social-networking system, each data store being configured to store objects of a particular one of multiple object types indexed by a search index; receiving an object; identifying an object type of the received object; storing the received object in at least one data store being configured to store objects of the identified object type; and updating the search index of the at least one data store based on the received object.

Managing cross-correlated data

Systems and processes for storing correlated data in a graph database are described. A first user node may be stored. In response to a request, a first event node and a second user node may be stored. The first event node may be associated with the first user node through an edge indicating participation. The first event node may be associated with the second user node through an edge indicating participation. In response to a content access, a second event node and a content node may be stored. The second event node may be associated with the first user node through an edge indicating participation. The second event node may be associated with the content node through an edge indicating usage. The first user node may be associated with the content node through an edge indicating the first user node handles the content node.

Managing activities over time in an activity graph

Systems and processes for managing a data warehouse using an activity graph are disclosed. One example process may include selectively tracking new versions of an entity based on a tracking type, removing entities based on data retention rules, removing entities based on data decay rules, and summarizing decayed data.

System and method for creating a family tree data structure

A tree building system that accesses data from a social networking site and, in some embodiments, other data sites having information that may pertain to the relationships between users of the social networking site. A rules engine within the system implements logic for analyzing the data from the social networking site. The system provides a candidate list of possible relatives for selection by a user and solicits information from the user through the use of guided questions.

Handling out-of-sequence data in a streaming environment

Computer-implemented method, system, and computer program product for processing data in an out-of-order manner in a streams computing environment. A windowing condition is defined such that incoming data tuples are processed within a specified time or count of each other. Additionally, the windowing condition may be based on a specified attribute of the data tuples. If the tuples are not processed within the constraints specified by the windowing condition, the unprocessed tuples may be discarded, i.e., not processed, to optimize operator performance.

Fast path evaluation of boolean predicates

Techniques for managing fast path evaluation of Boolean predicates are provided. In some examples, the fast path evaluation may be based at least in part on received queries and/or query statements associated with a database and/or streaming data. In some examples, a first instruction for enabling execution of a subset of logical operators of the query may be determined. The determination may be based at least in part on the logical operators of the query. Additionally, based at least in part on the first instruction, logical instructions for implementing the query may be generated. Further, the logical instructions may be compiled into machine-readable instructions for implementing only the subset of the logical operators of the query.

Determining influence in a network

An influence maximization process efficiently identifies an influential set of nodes with which to seed a diffusion process using the transposition of a graph representing the network. This approach offers an acceptable tradeoff between runtime complexity and accurate approximation. In addition, using an approximation condition, the influence maximization process may be further tuned to dramatically reduce the computational complexity even more in certain circumstances while allowing a fallback to the unturned influence maximization process if the approximation condition is not satisfied.

HETEROGENEOUS SYSTEM ON A CHIP SCHEDULER

Described are techniques for scheduling tasks on a heterogeneous system on a chip (SoC). The techniques including receiving a directed acyclic graph at a meta pre-processor associated with a heterogeneous SoC and communicatively coupled to a scheduler, wherein the directed acyclic graph corresponds to a control flow graph of tasks associated with an application executed by the heterogeneous SoC. The techniques further including determining a rank for a respective task in the directed acyclic graph, wherein the rank is based on a priority of the respective task and a slack in the directed acyclic graph. The techniques further including providing the respective task to the scheduler for execution on the heterogeneous SoC according to the rank. 1. A computer-implemented method comprising:receiving a directed acyclic graph at a meta pre-processor associated with a heterogeneous system on a chip (SoC) and communicatively coupled to a scheduler, wherein the directed acyclic graph corresponds to a control flow graph of tasks associated with an application executed by the heterogeneous SoC;determining a rank for a respective task in the directed acyclic graph, wherein the rank is based on a priority of the respective task and a slack in the directed acyclic graph; andproviding the respective task to the scheduler for execution on the heterogeneous SoC according to the rank.2. The method of claim 1 , wherein determining the rank for the respective task further comprises:determining a critical path in the directed acyclic graph;determining a critical path time associated with the critical path;determining a sub-deadline for the respective task;determining the slack by subtracting a computational cost of the respective task from the sub-deadline; anddetermining the rank by dividing the priority of the task by the slack.3. The method of claim 2 , wherein the critical path comprises a longest execution path through the directed acyclic graph.4. The method of claim 2 , wherein ...

System for automatically discovering, enriching and remediating entities interacting in a computer network

An entity tracking system and method for a computer network employs proactive data collection and enrichment driven by configurable rules and workflows responsive to the discovery of new entities, changes to existing entities, and specifics about the entities' attributes. The data collection is used in conjunction with graph technologies to map interactions and relationships between various entities interacting in the computer environment and deduce interactions and relationships between the entities. Machine learning techniques further identify, group or categorize entities and identify patterns which are indicative of anomalies that might be due to nefarious actions or compromised security. 1. A method for managing a computer environment , the method comprising:monitoring a plurality of different data sources for event data for the computer environment and collecting the event data;detecting entities in the computer environment and inferring relationships between the detected entities based on the collected event data;generating an entity relationship graph by representing the detected entities as nodes and representing the inferred relationships between the detected entities as edges between the nodes; andmanaging the computer environment based on the entity relationship graph.2. The method of claim 1 , wherein the inferred dependencies include direct dependencies and data flow dependencies.3. The method of claim 1 , further comprising assigning the edges for the interred dependencies in the entity relationship graph a start timestamp attribute and an end timestamp attribute based on when events in the event data implying the dependency relationship are discovered and criteria for defining validity durations for the edges for the dependencies.4. The method of claim 3 , wherein managing the computer environment based on the entity relationship graph comprises receiving queries and time values associated with the queries and executing the queries against the entity ...

STREAMING METHOD FOR THE CREATION OF MULTIFACETED STATISTICAL DISTRIBUTIONS

Generating persistent multifaceted statistical distributions of event data associated with computing nodes is disclosed. From a data stream, events are identified that occur during a first time interval. Characteristics associated with the events are determined. Based on a primary characteristic, it is determined that an event corresponds to an event cluster. The event count for that cluster is incremented. It is determined that the characteristics correspond to an event descriptor of events in the cluster. Responsive to requests to view the event cluster, information about descriptors from the cluster are displayed indicating events having a particular event descriptor, or a summary of characteristics that distinguish the descriptor from other event descriptors. 1identifying, from a data stream, a first plurality of events that occur during a first time interval on a set of nodes in a computing environment;determining a first plurality of characteristics associated with a first event of the first plurality of events;determining, based on a primary characteristic of the first plurality of characteristics, that the first event corresponds to a first event cluster of a first plurality of event clusters;incrementing a first event count associated with the first event cluster;determining that the first plurality of characteristics corresponds to a particular event descriptor associated with one or more events in the first event cluster; andresponsive to receiving user input requesting to view a data set comprising the first event cluster, displaying information about one or more event descriptors from the first event cluster, the one or more event descriptors comprising the particular event descriptor, and wherein the displayed information indicates one or more of a number of events having the particular event descriptor, or a summary of one or more characteristics of the plurality of characteristics that distinguish the particular event descriptor from one or more ...

RICH DESCRIPTOR FRAMEWORK TO TEXT GENERATION USING GRAPHS AND STRUCTURAL NEURAL ENCODERS

Technology for using a bi-directed graph convolutional neural network (“BGCNN”) to convert RDF data into natural language text. Some embodiments perform RDF-to-Text generation by learning graph-augmented structural neural encoders, consisting of: (a) bidirected graph-based meta-paths encoder; (b) bidirected graph convolutional networks encoder, and (c) separated attention mechanism for combining encoders and decoder to translate RDF triplets to natural language description. 1. A computer-implemented method (CIM) comprising:training a bi-directed graph convolutional neural network (BGCNN) using a plurality of training data sets;receiving an resource description framework (RDF) data set including computer readable corresponding to a plurality of RDF triples;creating, by machine logic, a bidirected graph data set that includes a bidirected graph inclusive of all of the information of the plurality of RDF triples; andtranslating, using the BGCNN, the bidirected graph into a piece of natural language text.2. The CIM of wherein the training includes at least one of the following: supervised learning and/or unsupervised learning.3. The CIM of wherein the translation of the bidirected graph into a piece of natural language text includes the following sub-operation(s):encoding, by a meta-paths encoder module of the BGCNN, meta-paths associated with the bidirected graph.4. The CIM of wherein the translation of the bidirected graph into a piece of natural language text includes the following sub-operation(s):encoding, by a convolutional network (CN) encoder portion of the BGCNN, the bidirected graph.5. The CIM of wherein the translation of the bidirected graph into a piece of natural language text includes the following sub-operation(s):combining, by a separated attention mechanism portion of the BGCNN, encoder(s) and decoder(s) to translate the RDF data set to the piece of natural language text.6. The CIM of wherein the BGCNN includes:a bi-graph-based-meta-paths encoder;a ...

Graph Associated with a Packaging Plant

Among other things, a method is disclosed that is performed by a data processing device comprising the following: obtaining and/or determining graph data representing a graph associated with a packaging plant, wherein the graph comprises a plurality of nodes and a plurality of edges, wherein each edge from the plurality of edges connects two nodes from the plurality of nodes with one another, wherein each node from the plurality of nodes represents a component of the packaging plant, and wherein each edge from the plurality of edges represents a possible packaging process connection between two components of the packaging plant: and storing of the graph data in a memory the data processing device. 1. A method performed by a data processing device , the method comprising:obtaining and/or determining graph data, wherein the graph data represent a graph associated with a packaging plant, wherein the graph comprises a plurality of nodes and a plurality of edges, wherein each edge from the plurality of edges connects two nodes from the plurality of nodes with one another, wherein each node from the plurality of nodes represents a component of the packaging plant, and wherein each edge from the plurality of edges represents a possible packaging process connection between two components of the packaging plant; andstoring of the graph data in a memory of the data processing device;receiving of packaging plant status data, wherein the packaging plant status data are indicative of a packaging process that is feasible by the packaging plant; andwherein the packaging plant status data is communicated to the data processing device by one or more components of the packaging plant via a communication connection; anddetermining of a representative of the packaging process that is feasible by the packaging plant at least partially based on the packaging plant status data and the graph represented by the graph data,wherein the representation of the feasible packaging process of the ...

PRIVACY-PRESERVING ASYNCHRONOUS FEDERATED LEARNING FOR VERTICAL PARTITIONED DATA

System and method for training a federated learning model asynchronously. The system includes a coordinator, an active computing device and a passive computing device in communication with each other. The active computing device has a processor and a storage device storing computer executable code. The computer executable code is configured to: 1. A system comprising an active computing device and at least one passive computing device in communication with each other , wherein each of the active and passive computing devices comprises a federated learning model and local data , the active computing device comprises a processor and a storage device storing computer executable code , and the computer executable code , when executed at the processor , is configured to:train the federated learning model in the active computing device using dimensions of a plurality of training instances in the active computing device; andinstruct the at least one passive computing device to train the federated learning model in the at least one passive computing device using dimensions of a plurality of training instances in the at least one passive computing device,wherein the plurality of training instances in the active and the at least one passive computing devices are indexed, and index of one of the plurality of training instances picked up by the at least one passive computing device is independent from index of one of the plurality of training instances picked up by the active computing device at the same time, such that training of the federated learning model in the active computing device and training of the federated learning model in the at least one passive computing device are asynchronous.2. The system of claim 1 , wherein parameters of the federated learning model comprise a constant learning rate.3. The system of claim 1 , further comprising a coordinator in communication with the active and the at least one passive computing devices claim 1 , wherein transfer of ...

SYSTEMS AND METHODS FOR FILTERING ELECTRONIC ACTIVITIES BY PARSING CURRENT AND HISTORICAL ELECTRONIC ACTIVITIES

The present disclosure relates to systems and methods for filtering electronic activities. The method includes identifying an electronic activity. The method includes parsing the electronic activity to identify one or more electronic accounts in the electronic activity. The method includes determining, responsive to parsing the electronic activity, that the electronic activity is associated with an electronic account of the one or more electronic accounts. The method includes selecting, based on the electronic account, one or more filtering policies associated with the data source provider to apply to the electronic activity. The method includes determining, by applying the selected one or more filtering policies to the electronic activity, to restrict the electronic activity from further processing based on the electronic activity satisfying at least one of the selected one or more filtering policies. The method includes restricting, the electronic activity from further processing. 1. A method comprising:identifying, by one or more processors, an electronic activity associated with a data source provider;parsing, by the one or more processors, the electronic activity to identify one or more electronic accounts in the electronic activity;determining, by the one or more processors, responsive to parsing the electronic activity, that the electronic activity is associated with an electronic account of the one or more electronic accounts, the electronic account corresponding to the data source provider;selecting, by the one or more processors based on the electronic account, one or more filtering policies associated with the data source provider to apply to the electronic activity, the selected one or more filtering policies including at least one of i) a keyword policy configured to restrict electronic activities including a predetermined keyword; ii) a regex pattern policy configured to restrict electronic activities including one or more character strings that match ...

Natural language interpretation of hierarchical data

A computer-implemented method includes receiving a search label and accessing a hierarchical data source comprising a plurality of nodes. One node may be a context node. The method further includes determining a similarity score between the search label and a node label of each node, determining a contextual score between the context node and each node, combining, for each node, the similarity score with the contextual score to yield a combined score, and returning a result. The result may be based on ordering the plurality of nodes according to each node's combined score. A corresponding computer program product and computer system are also disclosed.

BUILDING MANAGEMENT SYSTEM WITH NESTED STREAM GENERATION

A building management system (BMS) includes building equipment configured to provide samples of one or more data points in the building management system and a timeseries service. The timeseries service is configured to identify a first timeseries processing workflow that uses an input timeseries as an input and defines processing operations to be applied to the samples of the input timeseries, perform the processing operations defined by the first timeseries processing workflow to generate a first derived timeseries comprising a first set of derived timeseries samples, identify a second timeseries processing workflow that uses the first derived timeseries as an input and defines processing operations to be applied to the samples of the first derived timeseries, and perform the processing operations defined by the second timeseries processing workflow to generate a second derived timeseries comprising a second set of derived timeseries samples. 120-. (canceled)21. A building management system comprising: generate a first derived time correlated data stream according to a first processing workflow;', 'identify a second processing workflow that uses the first derived time correlated data stream as an input, wherein the second processing workflow defines one or more processing operations to be applied to the first derived time correlated data stream;', 'generate a second derived time correlated data stream based on the second processing workflow and the first derived time correlated data stream; and', 'store the first derived time correlated data stream and the second derived time correlated data stream., 'one or more non-transitory computer-readable media having instructions stored thereon that, when executed by one or more processors, cause the one or more processors to22. The building management system of claim 21 , wherein the first derived time correlated data stream is a first timeseries and the second derived time correlated data stream is a second timeseries.23 ...

Systems, apparatus, and methods for social graph based recommendation

Social graph based information recommendation engines, devices, systems and methods are described where information of interest can be retrieved and provided to a user based on sensor input and profile or preference information about the user or about a person other than the user.

Internet-enabled audio visual graphing calculator

A method of graphically representing mathematical expressions in both audio and visual formats on a user device is described. Embodiments of the present invention include an Internet-enabled audio-visual graphing calculator that receives input from a user device in at least one of at least one of audio, visual, or Braille formats. An embodiment of the present invention interprets input received from the user device as a typeset mathematical expression, parses the typeset mathematical expression into an interpreted mathematical expression and compiles the interpreted mathematical expression into an evaluation function. At least one point is sampled on the evaluation function. The sampled evaluation function is rendered as a graph on a visual display of a user device. In an embodiment of the invention, an audible representation of the rendered graph is generated for playback on the user device.

DYNAMIC EXECUTION OF PARAMETERIZED APPLICATIONS FOR THE PROCESSING OF KEYED NETWORK DATA STREAMS

A method is described for processing keyed data items that are each associated with a value of a key, the keyed data items being from a plurality of distinct data streams, the processing including collecting the keyed data items, determining, based on contents of at least one of the keyed data items, satisfaction of one or more specified conditions for execution of one or more actions and causing execution of at least one of the one or more actions responsive to the determining. 1. (canceled)2. A method performed by a data processing system for segmenting one or more data items associated with one or more respective key values and one or more respective attributes by executing a computer program for processing the one or more data items associated with the one or more respective key values and the one or more respective attributes , and , for a particular key value , selecting , from among one or more rules , a particular rule to be applied , if the computer program is in a particular state with respect to the particular key value and the one or more data items are associated with one or more attributes of the particular rule , the method including:identifying a computer program that processes one or more data items, with the one or more data items being associated with one or more key values and one or more attributes;executing the computer program to process the one or more data items, wherein one or more states of the computer program are maintained for the one or more key values, the executing including:for one or more data items associated with a particular key value, identifying first and second states of the computer program, with each of the first and second states being associated with the particular key value;based on determining that the computer program is in the first state, with respect to the particular key value, identifying one or more rules;wherein a rule specifies one or more attributes and further specifies one or more actions to be performed ...

INDEXING A RELATIONSHIP STRUCTURE OF A FILESYSTEM

One or more storage locations of file inodes in a data source to be backed up are identified. Filesystem metadata information is extracted from the one or more identified storage locations. At least one item of the extracted filesystem metadata information includes a reference to a parent inode. The extracted filesystem metadata information are stored in a data structure. The contents of the data structure are analyzed to index a relationship structure of file system contents of the data source. 1. A method , comprising:identifying one or more storage locations associated with a plurality of inodes in a data source to be backed up;extracting information associated with the plurality of inodes from the one or more identified storage locations of the data source to be backed up to a storage system, wherein at least one item of the extracted information associated with the plurality of inodes includes a reference to a parent inode, wherein extracting the information associated with the plurality of inodes from the one or more identified storage locations of the data source to be backed up to a storage system includes copying the extracted information associated with the plurality of inodes to a first storage tier of the storage system and storing the extracted information associated with the plurality of inodes in one or more data structures that are stored in the first storage tier of the storage system;analyzing contents of the one or more data structures to index a relationship structure of the plurality of inodes of the data source; andgenerating the index of the relationship structure of the plurality of inodes of the data source based on the analyzed contents of the one or more data structures.2. The method of claim 1 , wherein identifying the one or more storage locations associated with the plurality of inodes in the data source to be backed up includes issuing a plurality of concurrent read requests for the one or more identified storage locations.3. The ...

CALL PROCESS FOR GRAPH DATA OPERATIONS

In an embodiment, a method comprises: defining, at a client computer, a schema in a graph query language processing system, the schema indicating which querying operations and mutating operations that an endpoint of the graph query language processing system supports, wherein defining the schema comprises: mapping a first resource of a plurality of resources from a cloud infrastructure API to a first field in the schema; mapping a second resource of the plurality of resources from the cloud infrastructure API to a second field in the schema; generating and submitting a query to the endpoint based on the schema that causes retrieving the first resource from the cloud infrastructure API and the second resource from the cloud infrastructure API; generating and causing displaying, at the client computer, a digital data display that shows the first resource and the second resource in a unified format. The method is adapted to enhance cloud infrastructure APIs by providing a solution to accessing dependent resources with a single client request. 1. A method comprising:electronically digitally obtaining access to one or more distributed data storage devices that digitally store a first resource and a second resource, each of the first resource and second resource comprising one or more digitally stored data objects, each of the first resource and second resource having different organizational formats that are not natively displayable together; mapping a first resource of a plurality of digitally stored resources from a cloud infrastructure API to a first field in the schema;', 'mapping a second resource of the plurality of digitally stored resources from the cloud infrastructure API to a second field in the schema;, 'defining, at a client computer, a schema in a graph query language processing system, the schema indicating which querying operations and mutating operations that an endpoint of the graph query language processing system supports, wherein defining the schema ...

PARALLEL MATERIALISATION OF A SET OF LOGICAL RULES ON A LOGICAL DATABASE

A computer-implemented method of providing a materialisation of a set of logical rules on a logical database comprising a set of logical facts. Each of a plurality of parallel processing threads performs the following steps. A logical fact that has not previously been received by any thread is received by the thread. By applying any of the logical rules to the received logical fact and/or any of the logical facts received by any thread prior to the received logical fact, the thread determines whether a new logical fact is implied, and if so the new logical fact is added to the set of logical facts. The thread then repeats the above steps on any further logical facts in the set of logical facts that have not previously been received by any thread. When all threads are waiting for a new logical fact, the method has completed. 139-. (canceled)40. A computer-implemented method , performed by a computer system , the computer system including i) a logical database including a set of logical facts and at least one index that includes a pointer for locating a logical fact in the set of logical facts , and ii) a plurality of parallel processing threads , wherein each of the plurality of parallel processing threads has an associated reserved area in the logical database for adding a new logical fact to the set of logical facts , the method including updating , by the computer system , the logical database , receiving a new logical fact to be added to the logical database;', "adding the new logical fact only to the thread's associated reserved area in the logical database without locking the associated reserved areas of other parallel processing threads;", 'performing an index update process to update the at least one index with the new logical fact without locking the at least one index;, 'wherein one or more threads of the plurality of parallel processing threads of the computer system perform steps comprising 'in a case where the status flag indicates that the at least one ...

SYSTEM FOR HANDLING CONCURRENT PROPERTY GRAPH QUERIES

A graph processing system for concurrent property graph queries of a property graph implemented in a distributed network computes on respective nodes a subgraph shard represented as edge-sets containing vertices within a certain range. Each node stores data for a subgraph shard that contains a range of local vertices that are a subset of all vertices of the property graph. Each subgraph shard also has boundary vertices having edges that connect the subgraph shard to boundary vertices of another subgraph shard. Upon receipt of concurrent queries of the property graph, a query of the subgraph shards is scheduled in accordance with an initial vertex for each concurrent user query. The property graph is traversed by traversing edge-sets within a subgraph shard on each node and during traversal messaging is used to send values of boundary vertices to at least one other node having another subgraph shard sharing the boundary vertices. 1. A graph processing system for concurrent property graph queries of a property graph where the property graph is implemented in a distributed network of nodes , comprising:at least one processor; and determining on a node of a plurality of nodes within the distributed network of nodes a subgraph shard of a plurality of subgraph shards of the property graph, the node storing data for the subgraph shard that contains a range of local vertices that are a subset of all vertices of the property graph, the subgraph shard having boundary vertices that have edges that connect the subgraph shard to boundary vertices of another subgraph shard;', 'converting the subgraph shard into a set of edge-sets containing vertices within a certain range by vertex identifier;', 'receiving concurrent queries of the property graph from at least one user;', 'scheduling a query of the subgraph shard of the plurality of subgraph shards in accordance with an initial vertex for each concurrent user query; and', 'traversing the property graph during execution of the ...

AUTOMATIC INTEGRATION OF MULTIPLE GRAPH DATA STRUCTURES

In an embodiment, a method comprises: generating, at a client computer, a first schema in a graph query language processing system, the schema indicating which querying operations and mutating operations that a graph endpoint of the graph query language processing system supports, wherein generating the first schema comprises: automatically mapping a first resource of a first plurality of resources from a first endpoint of a first data source to a first field in the first schema; automatically mapping a second resource of a second plurality of resources from a second endpoint of a second data source to a second field in the first schema; generating and submitting a query to the graph endpoint based on the first schema that causes retrieving the first resource from the first endpoint and the second resource from the second endpoint; generating and causing displaying, at the client computer, a digital data display that shows the first resource and the second resource in a unified format. The method is adapted to automatically generate a combined schema from multiple schemas and/or data sources and use the combined schema to query and aggregate data from multiple data sources. 2. The method of claim 1 , wherein the first schema is defined by a schema definition language (SDL).3. The method of claim 1 , wherein the first endpoint hosts a first server program that is responsive to representational state transfer (REST) calls to an application programming interface (API) implemented by the server program and wherein the second endpoint hosts a second server program that is responsive to REST calls to an API implemented by the second server program.4. The method of claim 1 , further comprising:defining a first configuration file comprising a mapping of the first resource of the first plurality of resources of the first data source to a third field of a second schema.defining a second configuration file comprising a mapping of the second resource of the second plurality of ...

SYSTEM AND METHOD FOR DIRECTED ACYCLIC GRAPH (DAG) ENCODING INTO HASH LINKED BLOCKS

The disclosure relates a method to encode Directed Acyclic Graphs (DAG) as linked networks of blocks, with each block containing the fingerprints of preceding blocks in the form of their hashes. This results in the DAG being represented by a series of blocks sequentially connected by hash pointers. This requires the hashes of every block that is an immediate predecessor to be included in a succeeding block. The blocks are associated with DAG vertices. A block may therefore have multiple succeeding blocks or multiple preceding blocks as in a DAG. The method determines the DAG starting vertices. Block creation and hash operations are subsequently performed. Successor vertices are determined, and their blocks and block hashes progressively generated when it is determined that the hashes of all blocks corresponding to preceding vertices have been generated. This continues until all DAG vertices have been processed and are associated with a block. 1. A computer-based method comprising:accessing, by a processor, input data which can be modeled or is representable as an directed acyclic graph (DAG), the input data containing information to identify vertices and edges, where the vertices are records containing data payloads and the edges are records that confirm in what sequence a vertex is related to the other vertices that comprise the DAGs;receiving at least one request to generate an output data encoded as hash linked blocks according to the input data, each block including a vertex record and also including the hashes of the blocks that precede them in the DAG sequence if that corresponding vertex has a predecessor;constructing or accessing a directed acyclic graph (DAG) model of the input data that is based on sequential inter-dependencies in the input data;constructing an Adjacency Matrix based on sequential inter-dependencies among the vertices of the DAG model of the input data;finding the DAG Starting vertices or DAG Starting vertex by accessing the Adjacency ...

System performance logging of complex remote query processor query operations

Described are methods, systems and computer readable media for performance logging of complex query operations.

POST-RANKER FOR SEARCH RESULTS

Methods and systems are disclosed for post-ranking a ranked search result based on a personal affinity of a user. Issues on ranking a search result of information based on user-level optimization without breaking ranking of the search results based on global optimization functions are addressed by first ranking a search result based on the global optimization functions, followed by post-ranking the ranked search result based on a personal affinity of the user. The personal affinity may be determined based on a search history by the user as captured in a knowledge base. The post-ranking is performed on a limited scope by dividing the ranked search result into multiple portions and re-ranking entries within respective portions based on the personal affinity, for example, by boosting entries that matches the personal affinity to the top of the entries within the portion. 1. A computer-implemented method for ranking and post-ranking a search result , the method comprising:receiving a query input for a search;generating a search result based on the received query, wherein the search result includes two or more distinct entries of information;ranking the two or more distinct entries of information of the search result based on global optimization functions;determining a personal affinity of a requestor of the query;post-ranking the ranked two or more distinct entries of information of the search result based on the personal affinity;providing the post-ranked two or more distinct entries of information.2. The computer-implemented method of claim 1 , the method further comprising determining an intent of the query input; the requestor is logged in;', 'the personal affinity of the requestor is determinable;', 'an intent of the query input matches the personal affinity; and', 'a number of the entries of information of the search result classified as the same as the personal affinity satisfies a predetermined condition., 'post-ranking the ranked two or more distinct entries of ...

GRAPH DATABASE FOR OUTBREAK TRACKING AND MANAGEMENT

A graph database for outbreak tracking and management is disclosed. In an example embodiment, an outbreak management system includes a memory device storing instructions that define a graph database for disease outbreak tracking. The instructions specify for a given host that a host node is created and an episode node is connected to the host node via a ‘case’ link. The episode node is associated with episode parameters that are related to a disease classification of the host. In addition, the instructions specify that an outbreak node is connected to the episode node via a ‘part of’ link to indicate that the host has become part of an outbreak of the disease. The outbreak node is connected to a definition node via a ‘defined as’ link. The definition node specifies disease parameters of the disease that is related to the outbreak node. 1. An outbreak management server apparatus comprising:an interface to receive patient data related to patients; comparing the patient data to disease parameters of different diseases, the disease parameters specifying conditions for a ‘possible’ classification for the respective disease, a ‘probable’ classification for the respective disease, and a ‘confirmed’ classification for the respective disease, and', creating a host node for the patient,', 'creating an episode node that is connected to the host node via a ‘case’ link, the episode node being associated with episode parameters that are related to the disease classification of the host, and', 'creating an outbreak node that is connected to the episode node via a ‘part of’ link to indicate that the host has become part of the outbreak for the determined disease, the outbreak node being connected to a definition node via a ‘defined as’ link, the definition node specifying the disease parameters of the disease that is related to the outbreak node; and, 'for each patient in which at least one of the ‘possible’, ‘probable’, and ‘confirmed’ classification is determined for one of the ...

METHOD AND APPARATUS OF MACHINE LEARNING USING A NETWORK WITH SOFTWARE AGENTS AT THE NETWORK NODES AND THEN RANKING NETWORK NODES

An apparatus and method are provided for rapidly ranking network nodes according to input ranking criteria. The links (i.e., first-order paths) between nodes are expressed in a first-order path matrix, which is used to generate nth-order path matrices as nth powers of the first-order path matrix and summed as a power series to generate a surrogate ranking operator (SRO) representing as a single matrix operation a sum over paths of all orders. Thus, in contrast to conventional ranking methods that require multiple recursive steps to account for the interrelatedness of linked nodes, a ranking is produced by multiplying the SRO by a state vector representing the input ranking criteria. 1. A web site ranking apparatus comprising:a network communications interface connected to an internet including websites and receive data elements from the websites,a memory configured to store a database of the websites, the database including a plurality of nodes representing the respective web sites and data elements received therefrom, and the plurality of nodes being respectively connected by a plurality of links representing connections between the websites; and determining a first-order path matrix including values representing one-link paths between pairs the plurality of nodes that are connected by a respective one of the plurality of links,', 'generate a surrogate ranking operator (SRO) using a power series of the first-order path matrix, and', 'rank the websites using a matrix product between a state vector of the input query and the SRO, and provide the ranked nodes to the user as a recommendation of best web sites satisfying the input query., 'processing circuitry configured to rank the web sites according to an input query of a user, the ranking of the websites being performed by'}2. A recommender apparatus comprising:a memory configured to store a database of a network, the database including a plurality of nodes containing respective data elements, and the plurality of ...

GENERATIVE CONTENT SYSTEM AND METHODS THEREFOR

A generative content system is disclosed. According to implementations, the generative content system generates literal representations of an environment based on data collected from a plurality of data sources that are selected in correspondence of the environment. In embodiments, the literal representations are used to generate a 3D rendering of the environment. In some embodiments, the generative content is used to support a location-based service system that locates devices based on a literal representation of an area as represented by the signal strengths observed throughout the area. 1. A method comprising:receiving, by a processing system, a plurality of data instances from a plurality of data sources, the plurality of data sources having been selected in correspondence of an environment to be represented digitally;generating, by the processing system, a plurality of abstract instances based on the plurality of data instances, each abstract instance indicating a set of properties of one or more data instances to which the abstract instance corresponds, wherein the respective properties of each respective abstract instance include a data type of the data instance and one or more relationships between the abstract instance and other abstract instances;generating, by the processing system, an abstract representation corresponding to the environment based on the plurality of abstract instances, wherein generating the abstract representation includes generating a connection between a first abstract instance corresponding to a first data instance and a second abstract instance corresponding to a second data instance based on a relationship between the first data instance and the second data instance;analyzing, by the processing system, the abstract representation with respect to a fitness criteria to determine whether the abstract representation conforms to the fitness criteria;in response to determining that the abstract representation does not conform to the ...

EFFICIENT INCREMENTAL BACKUP AND RESTORATION OF FILE SYSTEM HIERARCHIES WITH CLOUD OBJECT STORAGE

Techniques described herein relate to systems and methods of data storage, and more particularly to providing layering of file system functionality on an object interface. In certain embodiments, file system functionality may be layered on cloud object interfaces to provide cloud-based storage while allowing for functionality expected from a legacy applications. For instance, POSIX interfaces and semantics may be layered on cloud-based storage, while providing access to data in a manner consistent with file-based access with data organization in name hierarchies. Various embodiments also may provide for memory mapping of data so that memory map changes are reflected in persistent storage while ensuring consistency between memory map changes and writes. For example, by transforming a file system disk-based storage into cloud-based storage, the file system gains the elastic nature of cloud storage. 1. A system comprising: [ the data blocks correspond to a file, and', 'the data blocks and the corresponding metadata are stored separately as logical blocks according to a tree hierarchy; and, 'storing, via a block storage system, data blocks and corresponding metadata in one or more storage devices of the block storage system, wherein, 'causing storage of a first set of cloud storage objects in a cloud object store to create a first backup version corresponding to the tree hierarchy, the first set of cloud storage objects comprising data of the data blocks and the corresponding metadata of the tree hierarchy;', 'receiving, via the block storage system, a subsequent request to perform a transaction;', 'translating the subsequent request into an I/O request to perform a write operation with respect to the tree hierarchy in the one or more storage devices of the block storage system;', 'performing the write operation to modify the tree hierarchy at least in part by creating a subset of tree nodes, wherein the write operation results in a modified tree hierarchy; and', ' ...

Stream Computing Method, Apparatus, and System

A stream computing method performed by a manager node includes obtaining input channel description information, a structured query language (SQL) statement, and output channel description information, dynamically generating a data flow diagram according to the input channel description information, the SQL statement, and the output channel description information, and controlling, according to the data flow diagram, a worker node to execute a stream computing task. 1. A stream computing method performed by a manager node of a stream computing system , wherein the stream computing method comprises:generating a first data flow diagram according to input channel description information, a structured query language (SQL) statement, and output channel description information, wherein the first data flow diagram comprises a plurality of logical nodes, wherein the input channel description information defines an input channel, wherein the input channel is a first logical channel for inputting an input data stream from a data production system to the first data flow diagram, wherein the output channel description information defines an output channel, and wherein the output channel is a logical channel for outputting an output data stream of the first data flow diagram to a data consumption system;classifying the logical nodes in the first data flow diagram to obtain a plurality of logical node groups;selecting, from a preset operator library, a common operator corresponding to each logical node group of the logical node groups;generating a second data flow diagram according to the common operator, wherein each operator in the second data flow diagram implements functions of one or more logical nodes in a logical node group corresponding to the operator; andcontrolling, according to the second data flow diagram, a worker node of the stream computing system to execute a stream computing task.2. The stream computing method of claim 1 , wherein the first data flow diagram ...

SEARCH FUNCTIONALITY OF A DATA INTAKE AND QUERY SYSTEM

Disclosed is a technique that can be performed in a distributed computer network. The technique can include a data index and query system that receives a search query, defines a search scheme for applying the search query on distributed data storage systems including an internal data storage system of the data index and query system and an external data storage system. The internal data storage system stores data as time-indexed events including respective segments of raw machine data. The data index and query system can transfer a portion of the search scheme to a search service, which can return search results obtained by application of the search scheme to the distributed data storage systems including the internal data storage system and the external data storage system. Lastly, the search results or data indicative of the search results can be output on a display device to the user. 130.-. (canceled)31. A method comprising:defining, by a data intake and query system, a search scheme for applying a search query on a plurality of distributed data storage systems including an internal data storage system of the data intake and query system and an external data storage system communicatively coupled to the data intake and query system over a computer network;transferring, by the data intake and query system, a first portion of the search scheme to a search service;receiving, by the data intake and query system from the search service, a first search result of the search query obtained by application of the first portion of the search scheme to at least the external data storage system of the plurality of distributed data storage systems;producing, by the data intake and query system, a second search result of the search query by applying a second portion of the search scheme to the internal data storage system; andcausing, by the data intake and query system, the first and second search results or an output indicative of the first and second search results to be ...

Data generation method and computer system

A computer includes a data generation unit and a storage unit which retains graph information for managing a graph configured from a plurality of vertexes and sides. The data generation unit performs acquiring a plurality of data and graph information and assuring storage regions in number equal to the number of vertexes, converting each data into an input value and setting at least one input value to a storage region corresponding to at least one vertex, executing an updating process for updating a value set to a storage region corresponding to a first vertex using the value set to the storage region corresponding to the first vertex and a value set to a storage region corresponding to a different vertex directly connected to the first vertex, and outputting a set of values set to the storage regions corresponding to the vertexes as the feature value.

Social autonomous agent implementation using lattice queries and relevancy detection

Techniques for computer-generated conversation are disclosed. In an example, a method identifies text postings from a conversation. The method creates, for each text fragment of each text posting, a syntactic tree and a discourse tree. The method creates parse thickets, each parse thicket including the syntactic tree and discourse tree of a unique pair of text postings. The method extracts, from each parse thicket, a common text segment and obtains a set of candidate search results by providing the common text segments to a search engine. The candidate search results can be further refined for relevancy and mental state and posted as a response to a conversation.

APPROXIMATE MODELING OF NEXT COMBINED RESULT FOR STOPPING TEXT-FIELD RECOGNITION IN A VIDEO STREAM

Approximate modeling of next combined result for stopping text-field recognition in a video stream. In an embodiment, text-recognition results are generated from frames in a video stream and combined into an accumulated text-recognition result. A distance between the accumulated text-recognition result and a next accumulated text-recognition result is estimated based on an approximate model of the next accumulated text-recognition result, and a determination is made of whether or not to stop processing based on this estimated distance. After processing is stopped, the final accumulated text-recognition result may be output. 1. A method comprising using at least one hardware processor to: receive the image frame,', 'generate a text-recognition result from the image frame, wherein the text-recognition result comprises a vector of class estimations for each of one or more characters,', 'combine the text-recognition result with an accumulated text-recognition result,', 'estimate a distance between the accumulated text-recognition result and a next accumulated text-recognition result based on an approximate model of the next accumulated text-recognition result, and', 'determine whether or not to stop the processing based on the estimated distance; and,, 'until a determination to stop processing is made, for each of a plurality of image frames in a video stream,'}after stopping the processing, output a character string based on the accumulated text-recognition result.2. The method of claim 1 , wherein estimating the distance between the accumulated text-recognition result and a next accumulated text-recognition result comprises modeling the next accumulated text-recognition result by using previous text-recognition results as candidates for a next text-recognition result.7. The method of claim 6 , wherein values of yare stored in one or more balanced binary search trees.8. The method of claim 2 , wherein estimating the distance between the accumulated text-recognition ...

SPATIAL-TEMPORAL GRAPH-TO-SEQUENCE LEARNING BASED GROUNDED VIDEO DESCRIPTIONS

Techniques for generating a grounded video description for a video input are provided. Hierarchical Attention based Spatial-Temporal Graph-to-Sequence Learning framework for producing a GVD is provided by generating an initial graph representing a plurality of object features in a plurality of frames of a received video input and generating an implicit graph for the plurality of object features in the plurality of frames using a similarity function. The initial graph and the implicit graph are combined to form a refined graph and the refined graph is processed using attention processes, to generate an attended hierarchical graph of the plurality of object features for the plurality of frames. The grounded video description is generated for the received video input using at least the hierarchical graph of the plurality of features. 1. A method comprising:generating an initial graph representing a plurality of object features in a plurality of frames of a video input;generating an implicit graph for the plurality of object features in the plurality of frames using a similarity function;combining the initial graph and the implicit graph to form a refined graph;processing the refined graph, using attention processes, to generate an attended hierarchical graph of the plurality of object features for the plurality of frames; andgenerating a grounded video description for the received video input using at least the hierarchical graph.2. The method of claim 1 , wherein the initial graph comprises a plurality of subgraphs claim 1 , wherein each subgraph of the plurality of subgraphs is associated with a frame of the plurality of frames and wherein generating the initial graph comprises:determining a plurality of object feature proposals for each subgraph;classifying each object feature proposal in each subgraph based on spatial information in the subgraph; andadding a temporal relationship edge between object features present in more than one subgraph.3. The method of claim ...

Revealing Content Reuse Using Fine Analysis

Systems and methods for managing content provenance are provided. A network system accesses a document of a plurality of documents to be analyzed. The network system extracts text fragments from the document including a first fragment and a second fragment. A determination is made whether each of the text fragments match an entry in a hash table. Based on a first fragment not matching any entries in the hash table, the network system creates a new entry in the hash table, whereby the first fragment is used to generate a key in the hash table. Based on a second fragment matching an entry of the hash table, the network system associates the document with a key of the matching entry in the hash table, whereby the associating comprising updating the hash table with an identifier of the document.

Revealing Content Reuse Using Coarse Analysis

Systems and methods for managing content provenance are provided. A network system accesses a plurality of documents. The plurality of documents is then hashed to identify one or more content features within each of the documents. In one embodiment, the hash is a MinHash. The network system compares the content features of each of the plurality of documents to determine a similarity score between each of the plurality of documents. In one embodiment, the similarly score is a Jaccard score. The network system then clusters the plurality of documents into one or more clusters based on the similarity score of each of the plurality of documents. In one embodiment, the clustering is performed using DBSCAN. DBSCAN can be iteratively performed with decreasing epsilon values to derive clusters of related but relatively dissimilar documents. The clustering information associated with the clusters are stored for use during runtime. 1. A method comprising:accessing, by a network system, a plurality of documents;hashing, by the network system, each of the plurality of documents to identify one or more content features;comparing, by a processor of the network system, the content features of the plurality of documents to determine a similarity score between each of the plurality of documents;clustering, by the network system, the plurality of documents into one or more clusters based on the similarity score of each of the plurality of documents; andstoring clustering information associated with the one or more clusters in a data store.2. The method of claim 1 , wherein hashing each of the plurality of documents comprises performing a MinHash.3. The method of claim 1 , wherein the comparing the content features comprises determining Jaccard scores between each pair of documents of the plurality of documents claim 1 , the Jaccard score indicating a ratio of overlapping content features.4. The method of claim 3 , further comprising generating a distance matrix between each of the ...

Systems and method for evaluating and selecting a healthcare professional

Systems and methods are provided for evaluating healthcare professionals by assigning each healthcare professional an overall value (Reputation Score) based on a healthcare professional's merits, as well as feedback and endorsement obtained by this healthcare professional from other healthcare professionals or patient users. The Reputation Score gives patients a way to understand each doctor's qualifications, knowledge of medical practices, and the quality of their engagement with patients or other medical professions. The patient users therefore can find and select professionals based on their trusted evaluations. Systems and methods are further provided which utilize information the doctor received from other peer doctors and from patients under many identified topics or area of practice. Such information can be presented together with other content the doctor rendered or other evaluating system to show the doctor's credentials. Systems and methods for soliciting trustworthy answers to health questions in a time fashioned way and for providing virtual consultations between a patient and a healthcare professional are further provided herein.

Machine learning model abstraction layer for runtime efficiency

Systems and methods include training a machine learning model with data for identifying features in monitored traffic in a network; analyzing the trained machine learning model to identify information overhead therein, wherein the information overhead is utilized in part for the training; removing the information overhead in the machine learning model; and providing the machine learning model for runtime use for identifying the features in the monitored traffic, with the removed information overhead from the machine learning model. 1. A non-transitory computer-readable storage medium having computer-readable code stored thereon for programming one or more processors to perform steps of:training a machine learning model with data for identifying features in monitored traffic in a network;analyzing the trained machine learning model to identify information overhead therein, wherein the information overhead is utilized in part for the training;removing the information overhead in the machine learning model; andproviding the machine learning model for runtime use for identifying the features in the monitored traffic, with the removed information overhead from the machine learning model.2. The non-transitory computer-readable storage medium of claim 1 , wherein the steps further includeidentifying features that are not used in the trained machine learning model; andremoving the identified features prior to the providing.3. The non-transitory computer-readable storage medium of claim 1 , wherein the steps further includedetermining thresholds for the identifying features in the trained machine learning model; andnormalizing the thresholds to a scoring system.4. The non-transitory computer-readable storage medium of claim 1 , wherein the information overhead includes hyperparameters.5. The non-transitory computer-readable storage medium of claim 1 , wherein the information overhead includes metadata that is extra overhead in the trained machine learning model.6. The non- ...

Systems and Methods for Orchestrating Autonomously and Manually Performed Operations

A controller is provided to orchestrate operations of two or more different actors or resources in completing a task. The controller orchestrates the operations based on a dependency graph that the controller generates for each received task. The dependency graph has a linked list of nodes. Each node includes a different set of operations for completing a different part of a task represented by that dependency graph. Each set of operations associated with a node may be dependent on the successful completion of a prior set of operations associated with a prior linked node in the same dependency graph. The controller may allocate different sets of operations from different nodes of the dependency graph to different human or robotic resources, and may track the status of multiple tasks in parallel based on the progression through different nodes of the corresponding dependency graphs.

SYSTEM FOR PREDICTING MOOD OF USER BY USING WEB CONTENT, AND METHOD THEREFOR

A system for predicting an emotion of a user by using a web content includes a URL collection unit for collecting a URL of a web page; a representative URL selection unit for selecting a category-specific representative URL, a basic emotion-specific representative URL, and a dimensional emotion-specific representative URL according to contents included in a plurality of collected URLs; a representative vocabulary set creation unit for creating vocabulary sets representing a category, a basic emotion, and a dimensional emotion, respectively, on the basis of the selected representative URLs; a vocabulary extraction unit for crawling a plurality of texts; and a selection unit for comparing document similarities between the plurality of extracted vocabularies and the vocabulary sets. 1. A system for predicting an emotion of a user by using a web content comprising:a URL (uniform resource locator) collection unit for collecting a URL of a web page including a predetermined number of or more texts among a plurality of web pages connected using a web browser previously installed in a user terminal;a representative URL selection unit for selecting a category-specific representative URL, a basic emotion-specific representative URL, and a dimensional emotion-specific representative URL according to contents included in a plurality of collected URLs;a representative vocabulary set creation unit for creating vocabulary sets representing a category, a basic emotion, and a dimensional emotion, respectively, on the basis of the selected representative URLs;a vocabulary extraction unit for crawling a plurality of texts included in a web page of a URL to be classified, and then extracting a plurality of vocabularies which are classified into morpheme units through natural language processing (NLP); anda selection unit for comparing document similarities between the plurality of extracted vocabularies and the vocabulary sets representing a category, a basic emotion, and a dimensional ...

Method and system for storing, organizing and processing data in a relational database

A method comprises grouping, via a data processing system, a plurality of data elements in a same data type into a plurality of data units. The method further comprises gathering, via the data processing system, information about data elements in a first data unit into a first information unit. The first information unit comprising a representation of information that is less than all unique information in the first data unit. The method also comprises storing, via the data processing system, the first information unit on a computer readable storage device. The method additionally comprises identifying, via the data processing system, based at least in part on the first information unit, whether the data elements in the first data unit are required to be retrieved to resolve a first data query received by the data processing system and to resolve the first data query.

Automatically assisting conversations using graph database

Examples of the present disclosure describe systems and methods for automatically assisting conversations using a graph database. In order to minimize misunderstanding of words and phrases used by participants during a conversation, phrases from the conversation may be received by conversation assistance application as the conversation takes place. Entities may be extracted from the phrase based on natural language recognition according to a domain context of the participant being assisted. One or more tags may be looked up from a graph database, and may be provided to the participant as a list of hashtags related to the conversation. Links to documents may be extracted based on the tags for the participant for viewing during the conversation.

Tda enhanced nearest neighbors

A method comprises receiving a network of a plurality of nodes and a plurality of edges, each of the nodes of the plurality of nodes comprising members representative of at least one subset of initial data points, selecting a subset of the data points based on each node of the plurality of nodes, for each selected data point of the set of selected data points, determining a predetermined number of other data points that are closest in distance to that particular selected data point, grouping the selected data points into a plurality of groups based, at least in part, on the predetermined number of other data points of the set of selected data points that are closest in distance, each group of the plurality of groups including a different subset of data points, and providing a list of selected data points and the plurality of groups.

Secure shared vault with encrypted private indices

A store-data-object request, which includes a data object and a data identifier, is received from a requesting device. The data object is stored in a shared vault at a shared-vault-data-object address, and an entry in a private index is updated using a private credential associated with the requesting device. The private index includes private information identifying a storage location of the data object in a non-private shared vault. The entry in the private index includes the data identifier.

Educational and content recommendation management system

An educational system may include a contextualizer that accesses and processes content items and build a knowledge base including educational content and relationships between content items. The system may include a user assessor unit that determines user assessment variables based on user responses to previous educational content items and generate a user model based on the user assessment variables. The system may include a recommender that navigates the knowledge base and generates recommendations of new educational content based on the user model. The recommendation can assess the user's proficiency on a given concept based on the user model and maximize the user's probability of success around the concept of which the user shows proficiency, or improve the user's proficiency around the concept the user shows weakness. In some examples, the system may acquire an expert's knowledge about certain concepts to refine the user model, increasing the accuracy of the recommender.

VISUALISING CLINICAL AND GENETIC DATA

This disclosure relates to generating interactive graphical visualisations of clinical and genetic data. A processor receives the clinical data indicative of observed phenotypes, accesses a database to determine associations of the observed phenotypes with disorders and accesses a second database to determine associations between the disorders and genetic properties. The processor then determines an association value for each combination of the observed phenotypes and the genetic properties based on a number of paths between them. The processor also generates a graphical user interface, comprising an arrangement of the association values and a user control element associated with the phenotypes and/or the genetic properties. Finally, upon detecting user interaction in relation to the user control element, the processor re-arranges the arrangement of the association values in the graphical user interface to reflect the detected user interaction. 1. A method for creating an interactive graphical visualisation of clinical data , the method comprising:receiving clinical data indicative of multiple observed phenotypes of a patient;accessing a first database to determine first associations of each of the multiple observed phenotypes of the patient with multiple disorders;accessing a second database to determine second associations between the multiple disorders and multiple genetic properties;determining an association value for each combination of the multiple observed phenotypes and the multiple genetic properties, wherein the association value for a combination is determined based on a number of paths between an observed phenotype and a genetic property;generating a graphical user interface on a computer system, comprising an arrangement of the association values for each of the genetic properties and each of the observed phenotypes, the graphical user interface further comprising a user control element associated with at least one of the multiple observed phenotypes ...

INFORMATION PROCESSING APPARATUS, CONTROL METHOD, AND PROGRAM

An information processing apparatus () acquires an event graph () to be output and determines a subgraph satisfying a predetermined reference from the acquired event graph () to be output. In the event graph (), an activity content in an event related to an activity of a program is represented as an edge (), and each of a subject and an object of the event is represented as a node (). The information processing apparatus () outputs the event graph () with an output mode of the determined subgraph as a first mode and with an output mode of another portion as a mode other than the first mode. The first mode is a mode in which at least one of the number of nodes () and the number of edges () is reduced than the number included in the determined graph. 1. An information processing apparatus comprising:a determination unit that acquires an event graph to be output and determines a subgraph satisfying a predetermined reference from the acquired event graph to be output; andan output unit that outputs the event graph, with an output mode of the determined subgraph as a first mode and an output mode of another portion as a mode other than the first mode, whereinthe event graph represents an activity content in an event related to an activity of a program as an edge and represents each of a subject and an object of the event as a node, andthe first mode is a mode in which at least one of the number of nodes and the number of edges is reduced than the number of nodes and the number of edges included in the determined subgraph.2. The information processing apparatus according to claim 1 , whereinthe predetermined reference is a reference satisfied by a subgraph representing an event sequence that occurs in a normal state.3. The information processing apparatus according to claim 2 , whereinthe predetermined reference is a reference indicating that one process accesses a plurality of files having the same extension.4. The information processing apparatus according to claim 2 , ...

Dynamic In-Memory Construction of a Knowledge Graph

In an approach for a dynamic in-memory construction of a knowledge graph structure, the knowledge graph structure comprising a plurality of nodes and edges linking selected nodes to each other, a processor receives a record comprising a plurality of strings. The plurality of strings relates to a command combined with a set of strings. A processor determines content records relating to nodes relating to each of the strings. A processor assigns node identifiers for respective determined content records. A processor appends the node identifiers to a dynamic in-memory knowledge graph structure. A processor modifies an edge between selected ones of the node identifiers based on the command combined with the set of strings. A processor builds the dynamic in-memory knowledge graph structure. 1. A method for a dynamic in-memory construction of a knowledge graph structure , the knowledge graph structure comprising a plurality of nodes and edges linking selected nodes to each other , the method comprising:receiving a record comprising a plurality of strings, wherein the plurality of strings relates to a command combined with a set of strings;determining, in a storage system, content records relating to nodes relating to each of the strings;assigning node identifiers for respective determined content records;appending the node identifiers to a dynamic in-memory knowledge graph structure;modifying an edge between selected ones of the node identifiers based on the command combined with the set of strings; andbuilding the dynamic in-memory knowledge graph structure.2. The method of claim 1 , wherein a same content record relates to different received strings.3. The method of claim 1 , wherein the command is selected from the group consisting of creation of a link between two node identifiers claim 1 , deletion of a link between two node identifiers claim 1 , and modification of a link between two node identifiers in the dynamic in-memory knowledge graph structure.4. The method of ...

INTERACTIVE GEOGRAPHIC REPRESENTATION OF NETWORK SECURITY THREATS

A security platform employs a variety techniques and mechanisms to detect security related anomalies and threats in a computer network environment. The security platform is “big data” driven and employs machine learning to perform security analytics. The security platform performs user/entity behavioral analytics (UEBA) to detect the security related anomalies and threats, regardless of whether such anomalies/threats were previously known. The security platform can include both real-time and batch paths/modes for detecting anomalies and threats. By visually presenting analytical results scored with risk ratings and supporting evidence, the security platform enables network security administrators to respond to a detected anomaly or threat, and to take action promptly. 130-. (canceled)31. A computerized method comprising:receiving event data associated with an organization's network, wherein the event data is comprised of machine data;identifying one or more anomalies automatically determined from the event data;identifying one or more threats to the organization's network, wherein threats are identified from and associated with one or more of the identified anomalies, and each threat is classified as being of a type from a set of types and is associated with a device participating in the threat, and wherein the device is associated with a geographical location;causing display, in a graphical user interface, of identified threats on a geographical map, wherein each threat is depicted at a geographical location on the map corresponding to the location of the associated device; andin response to receiving at least one user input associated with a depicted threat on the map via the graphical user interface, causing display of an identification of the classification of the type of the depicted threat and an identification of each anomaly associated with the depicted threat.32. The method of claim 31 , further comprising:responsive to the user selection of the depicted ...

MAXIMIZING CHANNEL YIELD IN DIGITAL TRANSACTION

A method, computer system, and computer program product for dynamic digital channel journey analysis are provided. The embodiment may include obtaining information related to user page accesses and flows. The embodiment may also include creating a period graph for a measurement period. The embodiment may further include computing an initial yield leakage value for the measurement period. The embodiment may also include creating a temporal reference. The embodiment may further include updating the period graph based on the yield leakage value and the temporal reference. The embodiment may also include identifying a link where the yield leakage value is high and where the link leads to. 1. A processor-implemented method for dynamic digital channel journey analysis , the method comprising:obtaining information related to user page accesses and flows;creating a period graph for a measurement period;computing an initial yield leakage value for the measurement period;creating a temporal reference,updating the period graph based on the yield leakage value and the temporal reference; andidentifying a link where the yield leakage value is high and where the link leads to.2. The method of claim 1 , further comprising:determining an engagement level on one or more webpages the user accesses.3. The method of claim 1 , further comprising:determining a coefficient value, wherein the coefficient value is “n x n” matrix and has “w” layers based on the level of user engagement.4. The method of claim 1 , further comprising:determining an edge value representing a number of unique traversals between two nodes in the period graph.5. The method of claim 1 , further comprising:determining a value representing steps to completion of a transaction in a flow, andapplying the value when there are exits without completion of a transaction.6. The method of claim 3 , further comprising:updating the coefficient value when there is an increase in the yield leakage value.7. The method of claim 3 , ...

Method and System for Automated Cybersecurity Incident and Artifact Visualization and Correlation for Security Operation Centers and Computer Emergency Response Teams

A method and system is provided for visualizing and navigating cybersecurity information. A hypertree is displayed on a display device of a computerized system. The hypertree includes a plurality of nodes linked by edges, one or more of the nodes representing cybersecurity incidents, and one or more of the nodes representing elements or artifacts of cybersecurity incidents, the edges representing a specific relationship between the nodes linked by the edges. The computerized system displays an interactive navigation aid to enable a user to navigate the hypertree, and receives a navigation command from the user through the interactive navigation aid. The computerized system modifies the displayed hypertree in response to the navigation command. The navigation command comprises selective elimination or restoration of edges or nodes on the hypertree so as to enable the user to readily visualize interrelationships between the displayed nodes that are significant to a cybersecurity investigation or response. 118-. (canceled)19. A method of correlating , visualizing and navigating cybersecurity information , comprising:correlating, to a first cybersecurity incident of a plurality of cybersecurity incidents, through use of a correlation finder, one or more cybersecurity incident elements and one or more cybersecurity incidents of the plurality of cybersecurity incidents, by matching details of the one or more cybersecurity incident elements and the one or more cybersecurity incidents to the first cybersecurity incident, or, through use of an artifacts correlator, one or more artifacts of the plurality of cybersecurity incidents to the first cybersecurity incident by finding points of correlation between the one or more artifacts and the first cybersecurity incident;displaying a hypertree on the display device of the computerized system, the displayed hypertree comprising a plurality of nodes linked by a plurality of edges, one of the plurality of nodes representing the ...

SUPPORTING CLONES WITH CONSOLIDATED SNAPSHOTS

The present disclosure is related to methods, systems, and machine-readable media for supporting clones with consolidated snapshots. A clone of a virtual computing instance can be created in a snapshot tree provided by a software defined data center. A consolidated snapshot including tuples from a diskchain of the clone in the snapshot tree can be created responsive to a determination that the snapshot tree exceeds a threshold. 1. A method , comprising:creating a clone of a virtual computing instance (VCI) in a snapshot tree provided by a software defined data center; andcreating a consolidated snapshot including tuples from a diskchain of the clone in the snapshot tree responsive to a determination that the snapshot tree exceeds a threshold.2. The method of claim 1 , wherein the method includes creating the consolidated snapshot including all tuples from the diskchain of the clone in the snapshot tree.3. The method of claim 1 , wherein determining that the snapshot tree exceeds the threshold includes determining that the creation of the clone caused the snapshot tree to have a clone depth that exceeds the threshold.4. The method of claim 1 , wherein the method includes:maintaining a clone table that associates each of a plurality of clones in the snapshot tree with a respective clone depth identifier; anddetermining that the snapshot tree exceeds the threshold based on a value of the respective clone depth identifier associated with the clone exceeding the threshold.5. The method of claim 1 , wherein determining that the snapshot tree exceeds the threshold includes:counting read requests associated with the clone that cause ascension through the diskchain in order to satisfy the read requests; anddetermining that the count exceeds the threshold.6. The method of claim 1 , wherein creating the consolidated snapshot includes:issuing a read request for a current logical address and a number of addresses corresponding to the VCI;receiving, responsive to the read request ...

Method for efficient grouping of cache requests for datapath scheduling

In a ray tracer, a cache for streaming workloads groups ray requests for coherent successive bounding volume hierarchy traversal operations by sending common data down an attached data path to all ray requests in the group at the same time or about the same time. Grouping the requests provides good performance with a smaller number of cache lines.

Flash memory controller mechanism capable of generating host-based cache information or flash-memory-based cache information to build and optimize binary tree with fewer nodes when cache stores data from host

A flash memory controller includes a processor and a cache. When the processor receives a specific write command and specific data a host, the processor stores the specific data into a region of the cache, and the processor generates host-based cache information or flash-memory-based cache information to build or update/optimize a binary tree with fewer number of nodes to improve the searching speed of the binary tree, reducing computation overhead of multiple cores in the flash memory controller, and minimizing the number of accessing the cache to reduce the total latency wherein the host-based cache information may indicate dynamic data length and flash-memory-based cache information indicates the data length of one writing unit such as one page in flash memory chip.

Object relational mapping with a single database query

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating an object graph from records of a relational database. One of the methods includes receiving a request to populate a software object with values from a plurality of tables represented in a graph, the plurality of tables stored in a relational database maintained by a database management system, each table comprising one or more respective tuples of values; generating a single query statement that, when executed by the database management system, causes the database management system to retrieve the values from the plurality of tables represented in the graph as a result set; querying the relational database using the single query statement to obtain the result set; and populating the software object with one or more values of the result set.

ENTITY TO VECTOR REPRESENTATION FROM GRAPHS IN A COMPUTING SYSTEM

An example method of representing a selected entity in a plurality of entities in a computing system includes: obtaining a graph representation of the plurality of entities, the graph representation having nodes and edges representing a hierarchy of the plurality of entities; extracting a set of paths from the graph representation, each path in the set of paths including a series of edge-connected nodes in the graph representation; processing the set of paths to generate a vector representation of the selected entity, the vector representation having a plurality of elements representing a context of the selected entity within the graph representation; and providing the vector representation as input to an application executing in the computing system. 1. A method of representing a selected entity in a plurality of entities in a computing system , comprising:obtaining a graph representation of the plurality of entities, the graph representation having nodes and edges representing a hierarchy of the plurality of entities;extracting a set of paths from the graph representation, each path in the set of paths including a series of edge-connected nodes in the graph representation;processing the set of paths to generate a vector representation of the selected entity, the vector representation having a plurality of elements representing a context of the selected entity within the graph representation; andproviding the vector representation as input to an application executing in the computing system.2. The method of claim 1 , wherein the step of obtaining comprises:generating the graph representation from tabular data describing the plurality of entities.3. The method of claim 1 , wherein the step of obtaining comprises:obtaining the graph representation from a graph database.4. The method of claim 1 , wherein the plurality of entities comprises at least one of a virtual machine (VM) claim 1 , an Internet Protocol (IP) address claim 1 , and a process executable in the ...

SUBGRAPH GUIDED KNOWLEDGE GRAPH QUESTION GENERATION

A method, a computer program product, and a system for subgraph guided knowledge graph question generation. The method includes inputting a knowledge graph subgraph and a target answer into a long short-term memory encoder. The method also includes producing embeddings relating to the nodes and the edges. The method includes indicating the embeddings associated with the target answer. The method includes applying a graph neural network encoder computation in an iterative manner to the embeddings, with updated embeddings produced by the GNN encoder acting as initial values that are applied to the GNN encoder for a next iteration, until final state embeddings are produced. The method includes computing a graph-level embedding based on the final state embeddings and computing, by a recurrent neural network decoder, a question relating to the target answer and the knowledge graph subgraph using the graph-level embedding. 1. A computer-implemented method for subgraph guided knowledge graph question generation , the computer-implemented method comprising:inputting a knowledge graph subgraph and a target answer into an encoding module, wherein the knowledge graph subgraph is a collection of entities and predicates relating to a domain and represented as nodes for the entities and edges for the predicates;producing, by the encoding module, embeddings related to the nodes and the edges, wherein each of the nodes and the edges in the subgraph is an embedding represented as an initial vector in an embedding space;indicating the embeddings associated with the target answer;applying a graph neural network (GNN) encoder computation in an iterative manner to the embeddings, with updated embeddings produced by the GNN encoder acting as initial values that are applied to the GNN encoder for a next iteration, until final state embeddings are produced;generating a graph-level embedding based on the final state embeddings; andcomputing, by a recurrent neural network (RNN) decoder, a ...

INTRA-PERIOD RESOLUTION VALUE DATA GENERATION, STORAGE, DISPLAY, SYSTEM, METHOD, AND DEVICE

A method of generating first OHLC (open, high, low, close) data representative of price changes over a predetermined time period having a first duration, the method includes in response to determining that the first OHLC data representative of price changes over the predetermined time period having the first duration cannot be obtained directly, determining whether second OHLC data representative of price changes over an intra-time period having a second duration shorter than the first duration can be obtained, wherein the first duration divided by the second duration is an integer K greater than one, when determining that the second OHLC data can be obtained, obtaining K items of the second OHLC data, wherein each item of the obtained second OHLC data is representative of price changes over the intra-time period having the second duration, and generating the first OHLC data representative of price changes over the predetermined time period having the first duration from the obtained K items of the second OHLC data. 1. A method of displaying an OHLC (open , high , low , close) type symbol representative of changes in price during a predetermined time period , the predetermined time period having a first duration T , the method comprising:receiving an intra-time-period resolution value N, wherein N is an integer greater than two;calculating a second duration by dividing T by N;determining whether OHLC data representative of price changes over an intra-time period having the second duration can be obtained;in response to determining that the OHLC data representative of price changes over the intra-time period having the second duration can be obtained, obtaining N items of OHLC data, wherein each item of the obtained OHLC data is representative of price changes over the intra-time period having the second duration;in response to determining that the OHLC data representative of price changes over the intra-time period having the second duration cannot be obtained, ...

OPTIMIZED LOGISTIC PLANNING

A list of containers that each contain items is received. A list of the items is received and, for each item, data specifying which of the containers contains the item. A starting location is received. Container constraints that specify at least one condition in which at least one container is inaccessible is received. Delivery constraints that specify at least one condition that must be true for at least one item to be delivered are received. For each container, starting and ending locations are received and a sub-route corresponding to the container that specifies a delivery route to be followed to deliver each item in the container is generated. The sub-route for each container is compiled into a logistics route specifying a route a delivery route to be followed to deliver all items in all containers. 1. A system for determining a logistics route comprising:one or more processors; receiving a list of containers that each contain items;', 'receiving a list of the items and, for each item, data specifying which of the containers contains the item;', 'receiving a starting location;', 'receiving container constraints that specify at least one condition in which at least one container is inaccessible;', 'receiving delivery constraints that specify at least one condition that must be true for at least one item to be delivered;', identifying starting and ending locations; and', 'generating a sub-route corresponding to the container that specifies a delivery route to be followed to deliver each item in the container; and, 'for each container, 'compiling the sub-route for each container into a logistics route specifying a route a delivery route to be followed to deliver all items in all containers., 'computer memory storing instructions that, when run by the processors, cause the processors to perform operations comprising2. The system of claim 1 , wherein for at least one container claim 1 , identifying starting and ending locations comprises:identifying geographic areas ...

Method and system to process electronic medical records for predicting health conditions of patients

A method and a system are provided for processing electronic medical records for predicting a health condition of a patient. The method may determine a first set of datasets of a first patient based on one or more first electronic medical records. The method may extract one or more second sets of datasets of one or more second patients from a database server based on the first set of datasets. The method may generate one or more bipartite graphs based on the first set of datasets and the one or more second sets of datasets. The method may determine a set of edges from the one or more edges based on a matching score in each bipartite graph. The method may further predict the health condition of the first patient based on at least the matching score associated with each of the one or more bipartite graphs.

Conversational/multi-turn question understanding using web intelligence

Conversational or multi-turn question understanding using web intelligence is provided. An intelligent query understanding system is provided for receiving a context-dependent query from a user, obtaining contextual information related to the context-dependent query, and reformatting the context-dependent query as one or more reformulations based on the contextual information. The intelligent query understanding system is further operative to query a search engine with the one or more reformulations, receive one or more candidate results, and select a highest ranked reformulation based on the candidate results. The system can provide the highest ranked reformulation of the highest ranked reformulation as a response.

DELTA GRAPH TRAVERSING SYSTEM

Methods and systems are disclosed for traversing a graph database. The graph database may be used for search for information for a variety of applications, a web search and dictionary look-ups for voice recognitions for examples. Issues on quickly traversing a graph in the graph database with highly connected entities (nodes) may be addressed by generating a subgraph upon a graph traversal for an entity and traversing the subgraph in subsequent occurrences of looking up the entity. The methods and systems are disclosed for updating the entity of the subgraph with a newer version of data of the corresponding entity of the graph when the data in the entity of the subgraph and the data in the graph are distinct. The differences of versions of data may be identified based on an availability status of data for versions of data and timestamps of last updates to data in the entity of the graph. 1. A computer-implemented method for traversing a graph database based on a request for an entity , the method comprising:retrieving a subgraph of a graph, wherein the subgraph is associated with a previous traversal of the graph for searching the entity;determining a link to follow in the subgraph for a graph traversal;retrieving the entity from the subgraph;determining a version of data in the entity of the graph based on an availability status of the version of data in the entity of the graph; andupdating data in the entity in the subgraph based on corresponding data in the graph when the data in the entity in the subgraph and the data in the entity in the graph based on the version of data are distinct.2. The computer-implemented method of claim 1 , the method further comprising:determining the version of data in the entity based on the latest available version of the data; andproviding data in the entity in the subgraph.3. The computer-implemented method of claim 1 , the method further comprising:receiving a request for a data in the entity of the graph; andproviding the ...

DATA PROCESSING

A computer-processor-implemented data processing method comprises: a computer processor executing instances of one or more processing functions, each instance of a processing function having an associated function-call identifier; and in response to initiation of execution by the computer processor of a given processing function instance configured to modify one or more pointers of a partitioned acyclic data structure: the computer processor storing the function-call identifier for that processing function instance in a memory at a storage location associated with the partitioned acyclic data structure; for a memory location which stores data representing a given pointer of the partitioned acyclic data structure, the computer processor defining a period of exclusive access to at least that memory location by applying and subsequently releasing an exclusive tag for at least that memory location; and the computer processor selectively processing the given pointer during the period of exclusive access in dependence upon whether the function-call identifier of the prevailing processing function instance is identical to the function-call identifier stored in association with the partitioned acyclic data structure. 1. A computer-processor-implemented data processing method comprising:a computer processor executing instances of one or more processing functions, each instance of a processing function having an associated function-call identifier; and the computer processor storing the function-call identifier for that processing function instance in a memory at a storage location associated with the partitioned acyclic data structure;', 'for a memory location which stores data representing a given pointer of the partitioned acyclic data structure, the computer processor defining a period of exclusive access to at least that memory location by applying and subsequently releasing an exclusive tag for at least that memory location; and', 'the computer processor selectively ...

Storage medium, information processing method, and information processing apparatus

A non-transitory computer-readable storage medium storing a program that causes a computer to execute a process, the process includes acquiring training data in which information that indicates whether or not an attack is performed from a first device to a second device is associated with each of a specific operation log from the first device to the second device and a plurality of operation logs that includes operation logs from the first device to the second device before and after the specific operation log; generating order matrix data that includes a graph structure that corresponds to each of the plurality of operation logs and an order relationship of the specific operation log and the operation logs before and after the specific operation log; and generating a machine learning model based on the training data by inputting the data of the order matrix data to a neural network.