Abstract: An apparatus includes a unit dividing a region into blocks having a predetermined bit length and generating addition data having the predetermined bit length corresponding to coordinate data, a unit storing storage data having the predetermined bit length, a unit generating composite data having a bit length twice the length of the predetermined bit length by connecting the addition data to the storage data, and storing the composite data, and a unit repeating an operation of designating the bit length of the composite data as the predetermined bit length, instructing to generate the addition data, and instructing to generate and store the composite data. The number of different bits between a bit string of a location corresponding to the input coordinate data and a bit string of a reference location tends to increase as a distance between the location corresponding to the coordinate data and the reference location increases.

Abstract: The matching apparatus 100 stores, with respect to a branching pattern included in event patterns 140a, a reception time of an event that serves as the branching point in a source node that indicates the transition destination of the event, connects the source node to the branch node by a transition with an interval condition, connects the branch nodes to the link node that indicates the linking point at which these branch nodes are linked together, and thereby generates NFAs 140b. Then, the matching apparatus 100 compares event streams 140c with the NFAs 140b to determine whether the event streams 140c includes the event patterns 140a.

Abstract: A keyword management system for managing keywords used when a user terminal connected to a network accesses contents, includes a Burst value calculating unit that calculates a Burst value indicating an increase per unit time of a keyword, an overall Burst value calculating unit that calculates an overall Burst value by correcting the Burst value based on characteristics in the contents of the keyword corresponding to the Burst value, and an output controlling unit that extracts from the contents, a relevant keyword related to the keyword corresponding to the overall Burst value based on time series changes of the overall Burst value, and outputs the keyword and the relevant keyword associated with each other to the user terminal.

Abstract: A matching device builds a parse tree from an event pattern. The matching device builds an automaton by, while traversing the parse tree, joining child nodes of an AND node in parallel to the AND node and joining child nodes of an OR node in parallel to the OR node. The matching device performs matching of determining whether an event stream includes the event pattern by comparing the event stream with the automaton.

Abstract: A rule learning method for making a computer perform rule learning processing in machine learning includes firstly calculating an evaluation value of respective features in a training example by using data and weights of the training examples; selecting a given number of features in descending order of the evaluation values; secondly calculating a confidence value for one of the given number of selected features; updating the weights of training example, by using the data and weights of the training examples, and the confidence value corresponding to the one feature; firstly repeating the updating for the remaining features of the given number of features; and secondly repeating, for a given number of times, the firstly calculating, the selecting, the secondly calculating, the updating, and the firstly repeating.

Abstract: Related keywords having certain relations to a target keyword are extracted from a unit storing keywords according to relations among each other. Expressions corresponding to the target keyword and related keywords are read from a unit storing expressions correspondingly with each stored keyword, each expression having been extracted from a content containing the corresponding keyword. A commonness between the expressions corresponding to each related keyword and the target keyword is calculated. An association between each related keyword and the target keyword is calculated using a distance for each related keyword from the target keyword and the commonness. A related keyword having a certain association is extracted as a same-region keyword in a same region as the target keyword. A drawing including the target keyword and related keywords arranged according to the associations is output with the same-region keyword displayed distinguishably from other related keywords not included in the same region.

Abstract: An apparatus extracts an area having a highest score or a lowest score that is calculated based on evaluation values of points from a target area including a set of a plurality of points that can be distributed at two-dimensional coordinates. It determines whether the area extracted and an area overlapping a plurality of the target areas intersect with each other, and deletes an area having a lower score or a higher score out of the areas determined to intersect with each other. It selects an area having a highest score or a lowest score out of the areas extracted at the extracting and not deleted at the determining.

Abstract: A computer-readable recording medium stores therein an information retrieving program that causes a computer to execute acquiring a document to be searched and having a hierarchical structure; generating a path schema related to the acquired document; receiving input of a retrieval keyword, a retrieval condition for the retrieval keyword, and a retrieval equation specifying a retrieval range for the retrieval keyword; generating a single automaton that includes a hierarchy retrieval automaton that retrieves a hierarchy of the generated path schema and a hit keyword retrieval automaton that retrieves a hit keyword satisfying the retrieval condition, the single automaton making state transition between a hit hierarchical node where the hit keyword in the hierarchy retrieval automaton is present and a set of nodes representing the hit keyword; retrieving, from the document and using the single automaton, the hit keyword within the retrieval range; and outputting a retrieval result.

Abstract: By carrying out search by a search keyword inputted by a searcher, an initial search result is obtained. On the other hand, extended search keywords associated with the search keyword are extracted to count the number of pertinent keywords or appearance frequency in the initial search result. Then, when the number of pertinent documents or appearance frequency is equal to or less than a predetermined value (including 0), the extended search keyword is adopted, and by carrying out search by the search keyword and adopted extended search keyword, extended search results are obtained. Then, the initial search result and extended search results are shown to the searcher.

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

Abstract: A communication log storage section stores a communication log of emails exchanged with an external device over an external network. An acquisition destination-selecting section reads out the communication log and identifies an other-end party with whom a target user has performed transmission and reception of emails not less than a predetermined number of times to select the other-end party as an information acquisition destination. An information location-generating section extracts key information related to a location of information at the information acquisition destination contained in the emails transmitted and received to and from the information acquisition destination, to generate information location information. The information location information is stored in an information location-accumulating section. An information acquisition device acquires the information based on the information location information accumulated in the information location-accumulating section.

Abstract: In a search device according to the present invention, a path trie generation unit generates an input path trie from XML data, a path trie display unit outputs the input path trie to an output unit such as a display, so that a user can specify Join points and combining conditions. An instruction reception unit generates a query serving as a command statement to combine each piece of XML data based on the Join points and the combining conditions that are specified by the user.

Abstract: A search supporting device includes an accepting unit for accepting an input word and a URL, a log obtaining unit for obtaining from a search log storing unit in which a log including a search word having been used for every URL of viewed data for a search of the data is stored, the log including a URL having a particular portion in common with the accepted URL and a search word having a particular portion in common with the accepted input word, and an outputting unit for outputting the search word included in the obtained log.

Abstract: A computer-readable storage medium storing a dataset sorting program is provided to sort records in a dataset into a plurality of destination groups according to a given key item specification. An item value extractor creates an item value list for every record. Then a frequent tree builder builds a frequent tree from the item value lists by finding patterns of item values that appear more often than a threshold specified by a given growth rate parameter. Each item value pattern is a leading part of an item value list with a variable length. A destination group mapper associates each node of the frequent tree with one of the plurality of destination groups. A record sorter traces the frequent tree according to the item value list of each given record, and upon reaching a particular node, puts the record into the destination group associated with that node.

Abstract: A retrieval device, from semi-structured data formed by item elements and value elements, creates aggregated structure information from the semi-structured data by aggregating the plurality of child item elements having the same name and directly connected to parent item elements having the same name, into one child item element. The device receives a retrieval request with an output condition and a constraint condition specified on the aggregate structure information. The device determines whether or not a plurality of query are created according to the retrieval request by checking a branch point at the common item elements between the output condition and the constraint condition in the aggregated structured information. And the device outputs a re-aggregate structure information corresponded to the query showing the branch point which is not expressed in the aggregate structure information to the display device.

Abstract: A method and apparatus for allowing a computer to search a hierarchical structure document by creating a list in which a true flag indicating that conditions of a predicate of a search formula are satisfied or a false flag indicating that the conditions of the predicate of the search formula are not satisfied is set to a predicate node of the document data based on the search formula, and scanning the list to search for data designated by the search formula from the document data.

Abstract: Related keywords having certain relations to a target keyword are extracted from a unit storing keywords according to relations among each other. Expressions corresponding to the target keyword and related keywords are read from a unit storing expressions correspondingly with each stored keyword, each expression having been extracted from a content containing the corresponding keyword. A commonness between the expressions corresponding to each related keyword and the target keyword is calculated. An association between each related keyword and the target keyword is calculated using a distance for each related keyword from the target keyword and the commonness. A related keyword having a certain association is extracted as a same-region keyword in a same region as the target keyword. A drawing including the target keyword and related keywords arranged according to the associations is output with the same-region keyword displayed distinguishably from other related keywords not included in the same region.

Abstract: An information search apparatus includes a receiving unit which receives a search request from a searcher's terminal; a search unit which searches and retrieves, from a database, candidate information that includes a content satisfying a search criteria set in the search request; a constriction unit which constricts the retrieved candidate information based on similarities between an attribute of an authorized person who is authorized to determine disclosure or non-disclosure of the candidate information included in the candidate information, and an attribute of the searcher who transmits the search request from the searcher's terminal; and a transmission unit which transmits disclosure requests for the constricted candidate information to an authorized person's terminal and transmits candidate information in which a response for the disclosure request received by the receiving unit is set to permit disclosure to the searcher's terminal.

Abstract: When a searching apparatus accepts a search condition including a logical condition formed of variables, transition table is created by using a BDD method. In the transition table, a combination of a bit string indicative of true or false of a variable at each level for arriving from a starting-point variable to an arrival variable and the starting-point variable is associated with the arrival variable. Then, a true/false decision on the search condition of the search target data is made by, with an arrival variable of a transition destination being taken as the starting-point variable, extracting a bit string of a predetermined number of digits from the starting-point variable from among logical bit strings of the search target data and specifying the arrival variable as the transition destination based on the combination and the transition table.

Abstract: A rule learning method for making a computer perform rule learning processing in machine learning includes firstly calculating an evaluation value of respective features in a training example by using data and weights of the training examples; selecting a given number of features in descending order of the evaluation values; secondly calculating a confidence value for one of the given number of selected features; updating the weights of training example, by using the data and weights of the training examples, and the confidence value corresponding to the one feature; firstly repeating the updating for the remaining features of the given number of features; and secondly repeating, for a given number of times, the firstly calculating, the selecting, the secondly calculating, the updating, and the firstly repeating.