Fujitsu Corporation

Nobuyuki Igata

Shinichiro Tago

Hiroaki Morikawa

Yasuo Yamane

Shuya Abe

Yutaka Mitsuishi

Hodaka Yamamoto

Kenichi Kobayashi

Hiroshi Tsuda

Hidekazu Takahashi

Yoshinori Sakamoto

Yoshio Nakao

Isao Namba

Fumihiko Kozakura

Kunio Matsui

Isao Nanba

A learning device sets each search range that is a part of a graph in which a plurality of nodes are connected by a plurality of edges, for each start node of one or more start nodes in the graph, on the basis of a set problem and relevance of an attribute of each of one or more nodes or edges connected to the each start node, generates an evaluation value of each of the one or more nodes and edges included in the each search range on the basis of a learning result by a learning model of the set problem, updates the one or more nodes and edges of the each search range on the basis of the evaluation value corresponding to the each search range and the relevance of the attribute corresponding to the each search range and the set problem, and performs a search.

Search method, computer-readable recording medium, and search device

A method includes receiving a designation of one or more first items that are to be included in a new table from a user, specifying, based on metadata related to second items included in each of a plurality of existing tables, an existing table from among the plurality of existing tables, the existing table including at least one of the designated one or more first items in the second items, specifying, based on other metadata related to an input item and an output item accompanied with execution of each of a plurality of programs, a program from among the plurality of programs, the program causing the designated one or more first items to be output as the output item when one of the second items included in the specified existing table is input as the input item, and outputting the specified existing table and the specified program.

Device and method for managing table

A detection method includes: executing first processing that includes determining whether or not at least any of one or more attribute values included in an input class corresponds to any of one or more conditions defined in a subject class; executing second processing that includes determining whether or not at least any of the one or more attribute values included in the input class corresponds to a negation class including one or more second conditions that contradict the one or more conditions defined in the subject class; and executing third processing that includes outputting information relating to the input class determined as non-corresponding by the second processing when both a determination result in the first processing and a determination result in the second processing are non-corresponding.

Detection method, detection apparatus, and non-transitory computer-readable storage medium

A method includes acquiring one or a plurality of first tables including a first data group regarding a first item, acquiring a second table corresponding to a result of executing a program with the one or the plurality of first tables set as an input, the second table including a second item and a second data group, generating, when a first name of the first item and a second name of the second item have a relationship in which the first name partially matches the second name, first information indicating the relationship between the first name and the second name while defining parts that partially match, registering the first information in a memory as metadata for the program, the metadata indicating a relationship between the one or the plurality of first tables set as the input and the second table set as an output.

Metadata registration method and device

An information searching apparatus retrieves a sub graph matching an inquiry graph from a graph to be searched. The apparatus includes an extracting unit that extracts, from among clusters of nodes in the graph to be searched, plural cluster pairs that each include a first cluster and a second cluster including a node linked by a link to a node in the first cluster and a calculating unit that calculates a bonding strength for each of the cluster pairs. The apparatus further includes a determining unit that determines, among the cluster pairs and based on the bonding strength of each of the cluster pairs, a cluster pair to be merged; a merging unit that merges the cluster pair; and a searching unit that searches the merged clusters for a sub graph matching the inquiry graph. An output unit outputs a search result of the searching unit.

Information searching apparatus, information searching method, and computer product

An information retrieval terminal provides keywords to an information retrieval device and instructs it to retrieve by using such keywords. The information retrieval terminal includes an information collector for collecting screen information, image information, and voice information around the information retrieval terminal and for obtaining text information from the collected information. A keyword-candidate extracting unit extracts a word related to a retrieval word input by a retriever from the text information obtained by the information collector, and sets the extracted word to be a keyword candidate. A retrieval instructing unit gives an instruction to retrieve by using the retrieval word and the keyword candidate set by the keyword-candidate extracting unit as keywords.

Information retrieval terminal

Based on reference information of a structured-document application program, structure information and contents of a structured document to be delivered are specified separately. Based on the specification, the structure information and the contents are obtained from a database which stores the structured document, to generate the structured document to be delivered. The generated structured document is delivered to the structured-document application program.

Document delivery device, document receiving device, document delivery method, document delivery program, and document delivery system

A query in which a sibling relationship among document parts, which are elements of a structured document, can be designated as a search condition is input, and a query tree which represents the query in a tree structure is created. A query converting unit refers to a hierarchical index in which a hierarchical relationship among document parts of each structured document to be searched is expressed in a tree structure, and converts the query tree to a Boolean expression. A text-index referring unit refers to a text index in which is registered information representing a relationship between each set including a character string in text data and a part-ID of a meta part and a document-ID of a document, thereby searching a document corresponding to the Boolean expression converted from the query tree.

Structured-document search apparatus and method, recording medium storing structured-document searching program, and method of creating indexes for searching structured documents

A user inputs a retrieval query represented by a set of propositions using a modal operator through an interface. The retrieval query is passed to a document set gathering unit through a retrieval input unit. The document set gathering unit refers to an index, gathers a set of documents having a true proposition, and writes it to a work area. A similarity computation unit computes the similarity of the gathered set of documents and writes it to the work area. The retrieval result output unit refers to the work area, ranks the gathered sets of documents in consideration of a true/false value and a similarity, and the ranking result to the interface as a retrieval result. A common keyword extraction unit extracts a keyword for output from the ranked sets of documents, and outputs the keyword after adding a corresponding modal operator to the keyword to the interface.

Apparatus and method for information retrieval, and storage medium storing program therefor

A compression unit compresses original data in block units and encodes compressed data, and it generates continuation flag information expressive of the block length of the compressed data at the top part of the compressed data stored in a storage unit. An expansion unit determines the block length of the remaining data of the compressed data on the basis of the continuation flag information, fetches the remaining data from the storage unit and restores the original data.

Apparatus and method for data compression/expansion using block-based

A collating apparatus generates a sparse state transition table by reducing the amount of data indicating a specific transition operation and a shift operation in a state transition table in which a collating operation corresponding to each symbol contained in one or more retrieval keys is defined. Then, the collating apparatus stores the table after compressing it into an array format, and retrieves the keys in the file to be retrieved while referring to the compressed state transition table. This collating apparatus is applied to a word processor, database system, full-text search system, etc.

Apparatus and method of multi-string matching based on sparse state

A search method selecting unit included in a pattern search apparatus can automatically select a search method with the highest search speed from a plurality of search methods according to the number of search patterns, form, etc., in order to find a search pattern in a search target. An optimum search or replacement can be realized by finding or replacing the search pattern using the selected method.

Growing community of inventors

Kawasaki, Japan

Nobuyuki Igata