Patents by Inventor Yasumasa Kajinaga
Yasumasa Kajinaga 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: 11960618Abstract: A computer implemented method searches data. A number of processor units generates a candidate search result using an index for a data source in response to a search query by a user, wherein the candidate search result comprises files accessible by the user based on access control information in the index. The number of processor units generates a completed search result with a set of the files from the candidate search result having a confidentiality level less than or equal to a threshold confidentiality level. The number of processor units determines whether the user has access to a file in the candidate search result in which the file has the confidentiality level greater than the threshold confidentiality level for the data source. The number of processor units adds the file to the completed search result in response to the file being accessible by the user in the data source.Type: GrantFiled: September 1, 2021Date of Patent: April 16, 2024Assignee: International Business Machines CorporationInventors: Tohru Hasegawa, Shunsuke Ishikawa, Yasumasa Kajinaga, Keisuke Nitta, Daiki Tsuzuku
-
Patent number: 11841909Abstract: A method, computer system, and a computer program for analyzing a webpage content is provided. The present invention may include receiving a plurality of terms, including a plurality of structural information, derived from one or more responses to a faceted search query. The present invention may also include extracting a plurality of facet values from the plurality of terms. The present invention may then include generating an analysis of each facet value of the plurality of facet values. The present invention may further include determining a type of each facet value of the plurality of facet values based on the analysis. The present invention may also include generating an optimized web site mode interface including the analysis and displaying the optimized web site mode interface to a user.Type: GrantFiled: February 11, 2022Date of Patent: December 12, 2023Assignee: International Business Machines CorporationInventors: Keisuke Nitta, Daiki Tsuzuku, Tohru Hasegawa, Shunsuke Ishikawa, Yasumasa Kajinaga
-
Publication number: 20230259561Abstract: A method, computer system, and a computer program for analyzing a webpage content is provided. The present invention may include receiving a plurality of terms, including a plurality of structural information, derived from one or more responses to a faceted search query. The present invention may also include extracting a plurality of facet values from the plurality of terms. The present invention may then include generating an analysis of each facet value of the plurality of facet values. The present invention may further include determining a type of each facet value of the plurality of facet values based on the analysis. The present invention may also include generating an optimized web site mode interface including the analysis and displaying the optimized web site mode interface to a user.Type: ApplicationFiled: February 11, 2022Publication date: August 17, 2023Inventors: Keisuke Nitta, Daiki Tsuzuku, Tohru Hasegawa, Shunsuke Ishikawa, Yasumasa Kajinaga
-
Publication number: 20230119516Abstract: Determining the substantive text and image data that is included in a given file in a configurable file system without having to open the given file. The substantive text and image data included in the given file is determined primarily by analyzing the text meta-information that defines the given file.Type: ApplicationFiled: October 20, 2021Publication date: April 20, 2023Inventors: Tohru Hasegawa, Shunsuke Ishikawa, Masaki Komedani, Yasumasa Kajinaga, Keisuke Nitta, Daiki Tsuzuku
-
Publication number: 20230065222Abstract: A computer implemented method searches data. A number of processor units generates a candidate search result using an index for a data source in response to a search query by a user, wherein the candidate search result comprises files accessible by the user based on access control information in the index. The number of processor units generates a completed search result with a set of the files from the candidate search result having a confidentiality level less than or equal to a threshold confidentiality level. The number of processor units determines whether the user has access to a file in the candidate search result in which the file has the confidentiality level greater than the threshold confidentiality level for the data source. The number of processor units adds the file to the completed search result in response to the file being accessible by the user in the data source.Type: ApplicationFiled: September 1, 2021Publication date: March 2, 2023Inventors: Tohru Hasegawa, Shunsuke Ishikawa, Yasumasa Kajinaga, Keisuke Nitta, Daiki Tsuzuku
-
Publication number: 20220382824Abstract: A search initiated by a user within an internet browsing application using a search phrase can be detected. A similarity between the search phrase and each of one or more existing groups can be determined, each of the one or more existing groups including one or more saved web pages. An existing group of the one or more existing groups can be selected based on the determined similarity. A current browsed web page returned from the search can be obtained, and the current browsed web page can be added to the existing group.Type: ApplicationFiled: May 27, 2021Publication date: December 1, 2022Inventors: Yasumasa Kajinaga, Tohru Hasegawa, SHUNSUKE ISHIKAWA, DAIKI TSUZUKU, Masaki Komedani, KEISUKE NITTA
-
Patent number: 11361030Abstract: Facet-based search processing is provided which includes receiving a query search context for querying documents of a document set, and retrieving, by similar document search processing, a document subset from the document set. The document subset includes documents of the set most similar to a search document of the query search context. Facet analysis processing is used to generate M candidate facets most-related to the query search context, and facets of the M candidate facets associated with documents of the subset are identified, and classified into a positive facet set and a negative facet set based, at least in part, on extent of facet commonality across the documents. A listing is of the documents in the document subset is provided, with the listing highlighting facets of the positive facet set.Type: GrantFiled: November 27, 2019Date of Patent: June 14, 2022Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Daiki Tsuzuku, Tohru Hasegawa, Shunsuke Ishikawa, Keisuke Nitta, Yasumasa Kajinaga, Masaki Komedani
-
Patent number: 11055338Abstract: Embodiments of the present invention include generating a facet tree based on words found in one or more documents, the facet tree being a tree data structure that defines hierarchical relationships between a plurality of words. The method may further include calculating a degree of similarity between a first word and a second word based on similarity of usage of the first word and the second word in the one or more documents, and generate a facet tree based on the degree of similarity. The method may further include, for each of one or more candidate words in the one or more documents, calculating a degree of correlation between a co-occurrence of two or more existing facet tree entries in a document and an occurrence of the candidate word in the document, and updating the facet tree on the basis of the one or more degrees of correlation.Type: GrantFiled: November 26, 2019Date of Patent: July 6, 2021Assignee: International Business Machines CorporationInventors: Yasumasa Kajinaga, Yutaka Moriya, Yuichi Suzuki
-
Publication number: 20210157856Abstract: Facet-based search processing is provided which includes receiving a query search context for querying documents of a document set, and retrieving, by similar document search processing, a document subset from the document set. The document subset includes documents of the set most similar to a search document of the query search context. Facet analysis processing is used to generate M candidate facets most-related to the query search context, and facets of the M candidate facets associated with documents of the subset are identified, and classified into a positive facet set and a negative facet set based, at least in part, on extent of facet commonality across the documents. A listing is of the documents in the document subset is provided, with the listing highlighting facets of the positive facet set.Type: ApplicationFiled: November 27, 2019Publication date: May 27, 2021Inventors: Daiki TSUZUKU, Tohru HASEGAWA, Shunsuke ISHIKAWA, Keisuke NITTA, Yasumasa KAJINAGA, Masaki KOMEDANI
-
Publication number: 20200097531Abstract: Embodiments of the present invention include generating a facet tree based on words found in one or more documents, the facet tree being a tree data structure that defines hierarchical relationships between a plurality of words. The method may further include calculating a degree of similarity between a first word and a second word based on similarity of usage of the first word and the second word in the one or more documents, and generate a facet tree based on the degree of similarity. The method may further include, for each of one or more candidate words in the one or more documents, calculating a degree of correlation between a co-occurrence of two or more existing facet tree entries in a document and an occurrence of the candidate word in the document, and updating the facet tree on the basis of the one or more degrees of correlation.Type: ApplicationFiled: November 26, 2019Publication date: March 26, 2020Inventors: Yasumasa Kajinaga, Yutaka Moriya, Yuichi Suzuki
-
Patent number: 10509855Abstract: Embodiments of the present invention include dynamically updating a facet tree based on words found in one or more documents, the facet tree being a tree data structure that defines hierarchical relationships between a plurality of words. The method may further include calculating a degree of similarity between a first word and a second word based on similarity of usage of the first word and the second word in the one or more documents, and updating the facet tree based on the degree of similarity. The method may further include, for each of one or more candidate words in the one or more documents, calculating a degree of correlation between a co-occurrence of two or more existing facet tree entries in a document and an occurrence of the candidate word in the document, and updating the facet tree on the basis of the one or more degrees of correlation.Type: GrantFiled: March 2, 2016Date of Patent: December 17, 2019Assignee: International Business Machines CorporationInventors: Yasumasa Kajinaga, Yutaka Moriya, Yuichi Suzuki
-
Publication number: 20170255603Abstract: Embodiments of the present invention include dynamically updating a facet tree based on words found in one or more documents, the facet tree being a tree data structure that defines hierarchical relationships between a plurality of words. The method may further include calculating a degree of similarity between a first word and a second word based on similarity of usage of the first word and the second word in the one or more documents, and updating the facet tree based on the degree of similarity. The method may further include, for each of one or more candidate words in the one or more documents, calculating a degree of correlation between a co-occurrence of two or more existing facet tree entries in a document and an occurrence of the candidate word in the document, and updating the facet tree on the basis of the one or more degrees of correlation.Type: ApplicationFiled: March 2, 2016Publication date: September 7, 2017Inventors: Yasumasa Kajinaga, Yutaka Moriya, Yuichi Suzuki
-
Patent number: 7593012Abstract: In a method of visualizing statistical data, to constantly provide drawing with excellent visibility by arranging rectangles corresponding to individual data in an order corresponding to section values of classes, and displaying a desired rectangle in a near square shape. With respect to the statistical data to be processed, a plurality of strip regions are formed in a region corresponding to an entire statistical data, and rectangles for representing individual data of the statistical data are arranged in the above described strip regions to generate image data of the region corresponding to the entire statistical data. With respect to sequences of the rectangles in the image data, the rectangles are rearranged in each of the strip regions such that the rectangles corresponding to the individual data adjacent to each other in the statistical data are also adjacent to each other in the image, and the image data is updated.Type: GrantFiled: February 19, 2003Date of Patent: September 22, 2009Assignee: International Business Machines CorporationInventors: Yuko Ikehata, Takayuki Itoh, Yasumasa Kajinaga
-
Patent number: 7499045Abstract: A graphics image generation apparatus includes element arrangement means for, based on hierarchical data, arranging figures which indicate constituent elements on a lower hierarchy level than a constituent element on a predetermined level of the hierarchical data, in a figure region which indicates the constituent element on the predetermined level; and arrangement control means for generating a graphics image of the hierarchical data by causing the element arrangement means to recursively perform arrangement of figures for each hierarchy level from a lower hierarchy level to a higher hierarchy level of the hierarchical data.Type: GrantFiled: July 25, 2002Date of Patent: March 3, 2009Assignee: International Business Machines CorporationInventors: Takayuki Itoh, Yasumasa Kajinaga, Yuhko Tsukagoshi, Yumi Yamaguchi
-
Publication number: 20080165970Abstract: Methods and arrangements to handle network messages containing security information are disclosed. Embodiments include transformations, code, state machines or other logic to handle network messages containing security information by configuring an application to generate messages containing security information. The configuring may include creating a data structure to store security information of network messages and storing security information, including a specification of a cryptographic key and a specification of a format to represent information about the cryptographic key in the data structure.Type: ApplicationFiled: January 5, 2007Publication date: July 10, 2008Inventors: Hyen V. Chung, Yasumasa Kajinaga, Yuichi Nakamura, Fumiko Satoh, Masayoshi Teraguchi
-
Publication number: 20080168273Abstract: Methods and arrangements to handle network messages containing security information are disclosed. Embodiments include transformations, code, state machines or other logic to handle network messages containing security information by configuring an application to generate and process security information of network messages. An embodiment may involve creating a data structure to store security information of network messages and storing security information in the data structure. The security information may include a specification of a cryptographic key, a format to represent information about the cryptographic key, a policy to select a security token of a requestor when multiple security tokens are contained in network messages, or a policy to select a security token to determine the degree of trust to provide a message sender. The embodiment may include the generation of security information or consumption of security information of a message utilizing security information stored in the data structure.Type: ApplicationFiled: January 5, 2007Publication date: July 10, 2008Inventors: Hyen V. Chung, Yasumasa Kajinaga, Yuichi Nakamura, Fumiko Satoh, Masayoshi Teraguchi
-
Patent number: 7231365Abstract: A solution is provided for the problem of determining a successful bidder in an auction wherein bids are submitted for a great number of trading targets (products). Two restrictions are imposed on the combinations of products that are permitted: 1. Bids may be submitted for only one product type; and 2. The relationship existing among available combinations of products for which bids may be submitted must be based on a hierarchical structure. From a set of bids submitted under the above restrictions, a subset of optimum bids are selected by using dynamic programming.Type: GrantFiled: November 15, 2001Date of Patent: June 12, 2007Assignee: International Business Machines CorporationInventors: Hisashi Kashima, Yasumasa Kajinaga
-
Publication number: 20050237320Abstract: A graphic area is provided in which graphics represent constitutional elements of a predetermined layer. A graphics image generation apparatus includes an element arrangement unit (22) for arranging graphics representing constitutional elements in a layer lower than the predetermined layer according to the layered data and an arrangement control unit (23) for executing arrangement of graphics for each of the layers reflexively from the lower to the upper layer of the layered data, thereby generating graphics image of the layered data.Type: ApplicationFiled: July 25, 2002Publication date: October 27, 2005Inventors: Takayuki Itoh, Yasumasa Kajinaga, Yuhko Tsukagoshi, Yumi Yamaguchi
-
Publication number: 20030158846Abstract: In a method of visualizing statistical data, to constantly provide drawing with excellent visibility by arranging rectangles corresponding to individual data in an order corresponding to section values of classes, and displaying a desired rectangle in a near square shape. With respect to the statistical data to be processed, a plurality of strip regions are formed in a region corresponding to an entire statistical data, and rectangles for representing individual data of the statistical data are arranged in the above described strip regions to generate image data of the region corresponding to the entire statistical data. With respect to sequences of the rectangles in the image data, the rectangles are rearranged in each of the strip regions such that the rectangles corresponding to the individual data adjacent to each other in the statistical data are also adjacent to each other in the image, and the image data is updated.Type: ApplicationFiled: February 19, 2003Publication date: August 21, 2003Applicant: International Business Machines CorporationInventors: Yuko Ikehata, Takayuki Itoh, Yasumasa Kajinaga
-
Publication number: 20020152182Abstract: A solution is provided for the problem of determining a successful bidder in an auction wherein bids are submitted for a great number of trading targets (products). Two restrictions are imposed on the combinations of products that are permitted: 1. Bids may be submitted for only one product type; and 2. The relationship existing among available combinations of products for which bids may be submitted must be based on a hierarchical structure. From a set of bids submitted under the above restrictions, a subset of optimum bids are selected by using dynamic programming.Type: ApplicationFiled: November 15, 2001Publication date: October 17, 2002Inventors: Hisashi Kashima, Yasumasa Kajinaga