Patents by Inventor Tatsuya Asai
Tatsuya Asai has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8412737Abstract: 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.Type: GrantFiled: March 9, 2010Date of Patent: April 2, 2013Assignee: Fujitsu LimitedInventors: Tatsuya Asai, Shinichiro Tago, Seishi Okamoto
-
Publication number: 20130031048Abstract: A data partitioning apparatus receives stream data and stores with previous-and-subsequent information that specifies data previous and subsequent to the data. Then, for groups, each of which contains the data that are stored and that are partitioned into the number of the groups, the data partitioning apparatus stores top information specifying data located at the top in a corresponding group and end information specifying data located at the end in the corresponding group. Then, when new data is stored, the data partitioning apparatus specifies data previous and subsequent to the new data and stores the new data by associating it with the previous-and-subsequent information that specifies the data previous and subsequent to the new data. Then, when data is inserted, the data partitioning apparatus updates information for each group such that the difference between the number of data belonging to each group is equal to or less than one.Type: ApplicationFiled: May 16, 2012Publication date: January 31, 2013Applicant: FUJITSU LIMITEDInventors: Tatsuya ASAI, Hiroaki Morikawa, Shinichiro Tago, Hiroya Inakoshi, Nobuhiro Yugami, Seishi Okamoto
-
Publication number: 20130017411Abstract: Disclosed is a hot-dip galvanized steel sheet or an alloyed hot-dip galvanized steel sheet, which has a tensile strength of 980 MPa or more, excellent workability, high yield ratio and high strength. The hot-dip galvanized steel sheet or the alloyed hot-dip galvanized steel sheet is characterized by containing 0.12-0.3% by mass of C, 0.1% by mass or less (excluding 0% by mass) of Si, 2.0-3.5% by mass of Mn, 0.05% by mass or less (excluding 0% by mass) of P, 0.05% by mass or less (excluding 0% by mass) of S, 0.005-0.1% by mass of Al and 0.015% by mass or less (excluding 0% by mass) of N, with the balance made up of iron and unavoidable impurities. The hot-dip galvanized steel sheet or the alloyed hot-dip galvanized steel sheet is also characterized in that the metallic structure thereof contains bainite as a matrix structure, and the area ratio of ferrite is 3-20% and the area ratio of martensite is 10-35% relative to the entire structure.Type: ApplicationFiled: March 30, 2011Publication date: January 17, 2013Applicant: Kabushiki Kaisha Kobe Seiko Sho (Kobe Steel, Ltd.)Inventors: Kazuyuki Hamada, Tatsuya Asai
-
Publication number: 20130013661Abstract: 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.Type: ApplicationFiled: July 3, 2012Publication date: January 10, 2013Applicant: FUJITSU LIMITEDInventors: Hiroya INAKOSHI, Tatsuya Asai, Hiroaki Morikawa, Shinichiro Tago, Nobuhiro Yugami, Seishi Okamoto
-
Publication number: 20120330868Abstract: 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.Type: ApplicationFiled: April 11, 2012Publication date: December 27, 2012Applicant: FUJITSU LIMITEDInventors: Shinichiro TAGO, Tatsuya ASAI, Hiroya INAKOSHI, Nobuhiro YUGAMI, Seishi OKAMOTO, Hiroaki MORIKAWA
-
Publication number: 20120290593Abstract: 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.Type: ApplicationFiled: March 28, 2012Publication date: November 15, 2012Applicant: FUJITSU LIMITEDInventors: Tatsuya ASAI, Hiroaki MORIKAWA, Shinichiro TAGO, Hiroya INAKOSHI, Nobuhiro YUGAMI, Seishi OKAMOTO
-
Publication number: 20120183227Abstract: 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.Type: ApplicationFiled: January 10, 2012Publication date: July 19, 2012Applicant: FUJITSU LIMITEDInventors: Hiroaki MORIKAWA, Tatsuya ASAI, Hiroya INAKOSHI, Shinichiro TAGO, Nobuhiro YUGAMI, Seishi OKAMOTO
-
Patent number: 8195686Abstract: A search device creates as many stack frames as the number obtained by adding one to the number of search condition character strings contained in an out-of-search-condition character string in a stack, sequentially inputs character strings in a text into automaton data, determines whether the character strings in the text hit the search condition character string or the out-of-search-condition character string to push correspondence to the stack or to change correspondence into non-correspondence, and determines whether the text is to be searched.Type: GrantFiled: June 5, 2009Date of Patent: June 5, 2012Assignee: Fujitsu LimitedInventors: Shinichiro Tago, Masahiko Nagata, Tatsuya Asai
-
Patent number: 8190632Abstract: 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.Type: GrantFiled: September 15, 2009Date of Patent: May 29, 2012Assignee: Fujitsu LimitedInventors: Shinichiro Tago, Seishi Okamoto, Hiroya Inakoshi, Tatsuya Asai
-
Patent number: 8122025Abstract: 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.Type: GrantFiled: March 24, 2009Date of Patent: February 21, 2012Assignee: Fujitsu LimitedInventors: Takahisa Ando, Satoko Shiga, Akira Sato, Tatsuya Asai, Seishi Okamoto
-
Patent number: 8122064Abstract: 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.Type: GrantFiled: December 17, 2007Date of Patent: February 21, 2012Assignee: Fujitsu LimitedInventors: Tatsuya Asai, Seishi Okamoto, Hiroki Arimura
-
Publication number: 20120005234Abstract: A retrieval device according to the present embodiment associates one tag key with one node and removes a node not having a tag key when a trie tree generating unit generates a trie tree. Moreover, because a tag key having a low priority is registered in a node close to a root node when the trie tree generating unit registers tag keys in the nodes of the trie tree, the retrieval device can narrow down a node region that is a comparison target when a trie tree searching unit performs a retrieval process.Type: ApplicationFiled: September 14, 2011Publication date: January 5, 2012Applicant: FUJITSU LIMITEDInventors: Shinichiro Tago, Tatsuya Asai
-
Publication number: 20110307511Abstract: 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.Type: ApplicationFiled: August 17, 2011Publication date: December 15, 2011Applicant: FUJITSU LIMITEDInventors: Tatsuya Asai, Shinichiro Tago, Seishi Okamoto
-
Patent number: 7962524Abstract: 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.Type: GrantFiled: December 12, 2005Date of Patent: June 14, 2011Assignee: Fujitsu LimitedInventors: Seishi Okamoto, Tatsuya Asai, Masataka Matsuura, Hiroya Hayashi, Masahiko Nagata
-
Publication number: 20110120204Abstract: A workpiece bending method of forming a final formed article that has two surfaces on opposite sides of an inclined area, in which an inclined area is made up of a first bend portion, a second bend portion, and a flat surface portion, includes: the workpiece holding step of cantilevering an end portion of the workpiece by a stationary die and a holding member; and the forming step of curving an area in the workpiece that corresponds to the flat surface portion by moving a movable die to the stationary die so that the movable die presses a free-end side of the workpiece, and then forming the first bend portion and the second bend portion, and unbending the area in the workpiece that corresponds to the flat surface portion of the inclined area, by causing the moving die to press the workpiece to the stationary die.Type: ApplicationFiled: July 17, 2009Publication date: May 26, 2011Applicant: TOYOTA JIDOSHA KABUSHIKI KAISHAInventors: Kazuhisa Maeda, Yoshiyuki Fukuyama, Tatsuya Asai
-
Publication number: 20100235385Abstract: 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.Type: ApplicationFiled: March 9, 2010Publication date: September 16, 2010Applicant: FUJITSU LIMITEDInventors: Tatsuya ASAI, Shinichiro Tago, Seishi Okamoto
-
Publication number: 20100153438Abstract: 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.Type: ApplicationFiled: December 9, 2009Publication date: June 17, 2010Applicant: FUJITSU LIMITEDInventors: Tatsuya ASAI, Shinichiro Tago, Seishi Okamoto, Masahiko Nagata
-
Publication number: 20100049712Abstract: A search device creates as many stack frames as the number obtained by adding one to the number of search condition character strings contained in an out-of-search-condition character string in a stack, sequentially inputs character strings in a text into automaton data, determines whether the character strings in the text hit the search condition character string or the out-of-search-condition character string to push correspondence to the stack or to change correspondence into non-correspondence, and determines whether the text is to be searched.Type: ApplicationFiled: June 5, 2009Publication date: February 25, 2010Applicant: FUJITSU LIMITEDInventors: Shinichiro TAGO, Masahiko Nagata, Tatsuya Asai
-
Publication number: 20100036815Abstract: 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.Type: ApplicationFiled: June 5, 2009Publication date: February 11, 2010Applicant: FUJITSU LIMITEDInventors: Shinichiro TAGO, Tatsuya ASAI, Seishi OKAMOTO
-
Publication number: 20100005058Abstract: 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.Type: ApplicationFiled: September 15, 2009Publication date: January 7, 2010Applicant: FUJITS LIMITEDInventors: Shinichiro TAGO, Seishi Okamoto, Hiroya Inakoshi, Tatsuya Asai