Patents by Inventor Lev Kozakov

Lev Kozakov 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).

  • Publication number: 20110113038
    Abstract: As indicated above, the present invention transparently inserts search arguments/terms (referred to as noise) into a search string so that the search arguments themselves would not be clearly evident when a user is searching. The inserted noise terms are related to the underlying search terms. This would confuse a mining program and/or hacker looking for sensitive material (such as intellectual property). When the search results are returned, any “hits” resulting from noise will be removed transparently from the overall results. The insertion and removal under the present invention provides a more secure level of searching, yet is completely transparent to the end user. The inserted random search arguments are germane contextually to the search string.
    Type: Application
    Filed: November 12, 2009
    Publication date: May 12, 2011
    Applicant: International Business Machines Corporation
    Inventors: Elmer K. Corbin, Richard Ferri, Moon J. Kim, Lev Kozakov
  • Patent number: 7904547
    Abstract: Under the present invention, a stability and updateability (SUP) ratio for a grid computing environment is generated. Thereafter, a size of a set (e.g., at least one) of scale free graphs for the grid computing environment is estimated. Then, based on at least one predetermined parameter such as a quantity of nodes in the grid computing environment, the set of scale free graphs is actually generated. Based on the set of scale free graphs a set of perturbed scale free graphs is generated. In one example, this may be accomplished using a preferential rewiring technique. This process is repeated for each of the monitoring and discovery services, which will yield at least two sets of perturbed scale free graphs. Using these sets of graphs, a set of monitoring and discovery service (MDS) topology graphs for the grid computing environment will be generated and deployed for optimization.
    Type: Grant
    Filed: February 21, 2006
    Date of Patent: March 8, 2011
    Assignee: International Business Machines Corporation
    Inventors: Genady Y. Grabarnik, Moon J. Kim, Lev Kozakov, Yefim Haim Michlin, Larisa Shwartz
  • Patent number: 7844441
    Abstract: In general, the present invention provides a method, system and program product for approximating/estimating computer resource consumption of a computer system. Specifically, under the present invention, a more efficient or reduced computer work gradient matrix (hereinafter “matrix”) is first built. This occurs by creating load measurements for a set of computer resource metrics of the computer system to analyze dependencies between different computer resource metrics. Then, a correlation matrix between the set of computer resource metrics is created based on the dependencies. The set of computer system resource metrics in the correlation matrix is thereafter clustered into a set of clusters, and a reduced matrix is built based thereon. Once the reduced matrix is built, it can be restored to a “full” matrix using linear transformation or the like.
    Type: Grant
    Filed: March 27, 2006
    Date of Patent: November 30, 2010
    Assignee: International Business Machines Corporation
    Inventors: Genady Grabarnik, Moon Ju Kim, Lev Kozakov, Volodimir F. Lemberg, Larisa Shwartz
  • Patent number: 7836451
    Abstract: Under the present invention, a computer work gradient matrix (hereinafter “matrix”) is developed by applying a set of background loading levels and a set of elemental work increments to a computer system, and then measuring the resource consumption of the computer system based thereon. Task work path(s) are also constructed by applying specific tasks to the computer system at a certain background loading level, and measuring the resource consumption of the computer system over time. Once the matrix and task work path(s) have been provided, they can be used to approximate the resource consumption of the computer system in response to a task applied at any background loading level.
    Type: Grant
    Filed: December 14, 2004
    Date of Patent: November 16, 2010
    Assignee: International Business Machines Corporation
    Inventors: Genady Grabarnik, Moon J. Kim, Lev Kozakov, Sheng Ma
  • Patent number: 7831976
    Abstract: Under the present invention, a computer work gradient matrix is built for each computer system that is interconnected in an environment. For each computer system for which resource consumption is desired to be predicted (e.g., “target” computer systems), a transition work cocycle is generated and provided to a master computer system. A set of task work paths will be constructed for the master computer system. Thereafter, an initial resource consumption value can be computed on the master computer system based on the computer work gradient matrix and the set of task work paths for the master computer system as well as a current background loading level that is being experienced by the target computer system. Then, using the initial resource consumption and the transition work cocycle for the target computer system(s), a resource consumption of the target computer system(s) can be predicted on the master computer system.
    Type: Grant
    Filed: May 4, 2005
    Date of Patent: November 9, 2010
    Assignee: International Business Machines Corporation
    Inventors: Genady Grabarnik, Moon Ju Kim, Lev Kozakov, Larisa Shwartz
  • Patent number: 7757163
    Abstract: An unknown annotator and its annotation type system are compared against a reference annotation type system. The comparison is done by providing a plurality of documents, and annotating each document using the reference set of document annotators, producing instances of reference annotation types, to generate a pre-annotated reference document set, and using the subject annotator and its subject annotation type system to generate a pre-annotated evaluation document set. Documents in the pre-annotated evaluation document set are compared to documents in the pre-annotated reference document set, and matches in location, within the compared documents, of instances of the subject annotation types and the reference annotation types are identified. Based on the matching data, reference document annotation types are selected that sufficiently correlate with the subject annotation type system.
    Type: Grant
    Filed: January 5, 2007
    Date of Patent: July 13, 2010
    Assignee: International Business Machines Corporation
    Inventors: Yurdaer N. Doganata, Youssef Drissi, David A. Ferrucci, Tong-Haing Fin, Genady Grabarnik, Lev Kozakov
  • Publication number: 20100095196
    Abstract: Evaluating the performance of a text analysis engine is provided. A plurality of pre-annotated reference documents and a set of annotation types associated with the pre-annotated reference documents are received. Annotation contexts of reference annotations in the plurality of pre-annotated reference documents are analyzed using the set of annotation types. Similar annotation contexts are identified between the reference annotations and the set of annotation types. Responsive to identifying the similar annotation contexts, the similar annotation contexts are clustered thereby forming a plurality of reference annotation clusters. A set of reference content heterogeneity scores are computed based on the number of reference annotation clusters for each annotation type in the set of annotation types. An integral reference content rate for the set of annotation types is then computed and output to a user.
    Type: Application
    Filed: October 9, 2008
    Publication date: April 15, 2010
    Applicant: International Business Machines Corporation
    Inventors: Genady Grabarnik, Lev Kozakov, Larisa Shwartz
  • Patent number: 7676452
    Abstract: Disclosed is a method and apparatus for operating a search system for searching a search space containing domains each representing a collection of related documents. The method includes establishing a domain characterization model (DCM) that includes a DCM index containing keywords and, for each keyword, an identification of a domain where the keyword is found. In response to an original search query, the method forms one or a plurality of enhanced search queries in accordance with the DCM for searching a plurality of domains. Each enhanced search query is formed for searching a particular targeted domain and contains the original search query and at least one keyword associated with the particular domain. The search results are clustered and are displayed so as to be organized by the domains that were searched. The top search results returned in response to each enhanced search query belong to one of the targeted domains.
    Type: Grant
    Filed: July 23, 2002
    Date of Patent: March 9, 2010
    Assignee: International Business Machines Corporation
    Inventors: Yurdaer N. Doganata, Youssef Drissi, Tong-Haing Fin, Genady Grabarnik, Moon J. Kim, Lev Kozakov, Sheng Ma, Juan Leon Rodriguez
  • Patent number: 7647579
    Abstract: Under the present invention, a best practice violation (BPV) engine resource is first built. This typically occurs by: receiving sets of source code from a plurality of sources; detecting a programming language of each of the sets of source code; extracting code patterns from the sets of source code; defining meta data for each code pattern that indicates a quality; classifying each code pattern; and assigning a rank to each of the code pattern based on its corresponding meta data as well as a skill level and an experience level of the developer. Once the BPV engine resource is built, it will be used to detect best practice violations in other sets of source code.
    Type: Grant
    Filed: March 31, 2004
    Date of Patent: January 12, 2010
    Assignee: International Business Machines Corporation
    Inventors: Youssef Drissi, Tong-Haing Fin, Moon Ju Kim, Lev Kozakov, Juan Leon Rodriguez
  • Publication number: 20090261783
    Abstract: A method for extending the service life of a portable device includes monitoring a battery of a portable device; identifying a problem bank; reconfiguring a connection schema for the battery to replace the problem battery bank with at least one spare bank; conditioning or exercising the problem bank; connecting the portable device to a power supply to recharge the problem bank; and reconnecting the recharged or repaired bank according to the connection schema without the at least one spare bank. A method for extending the service life of a portable device includes monitoring power consumption of at least one of the hardware or software of a portable device; and reconfiguring the connection schema of the battery banks to redistribute power consumption of at least one of the hardware or software.
    Type: Application
    Filed: April 18, 2008
    Publication date: October 22, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Cesar A. Gonzales, Genady Grabarnik, Lev Kozakov, Larisa Shwartz
  • Patent number: 7584453
    Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.
    Type: Grant
    Filed: August 30, 2007
    Date of Patent: September 1, 2009
    Assignee: International Business Machines Corporation
    Inventors: Roberto J. Bayardo, Jr., Yurdaer N. Doganata, Youssef Drissi, Tong-Haing Fin, Moon J. Kim, Lev Kozakov, Juan L. Rodriguez
  • Patent number: 7577939
    Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.
    Type: Grant
    Filed: June 27, 2003
    Date of Patent: August 18, 2009
    Assignee: International Business Machines Corporation
    Inventors: Roberto J. Bayardo, Jr., Yurdaer N. Doganata, Youssef Drissi, Tong-Haing Fin, Moon J. Kim, Lev Kozakov, Juan L. Rodriguez
  • Patent number: 7483877
    Abstract: A random document is stripped of the relevant search terms to generate a non-relevant document. The relevant search terms are formed into grammatically correct but not necessarily technically correct sentences. The grammatically correct sentences are placed at the beginning of the random document in one pass through the system in the middle of a document in a second pass through the system and at the end of the document in a third pass through the system. A relevancy vector chart is computed using the references documents and a known relevancy algorithm relating to position of search terms. The results obtained from search engines are compared to the relevancy vector chart to determine the relative relevancy of the returned search results from the search engines.
    Type: Grant
    Filed: April 11, 2003
    Date of Patent: January 27, 2009
    Assignee: International Business Machines Corporation
    Inventors: Moon Ju Kim, Yurdaer Nezihi Doganata, Youssef Drissi, Lev Kozakov
  • Publication number: 20080306729
    Abstract: A system and method of searching a database in which documents of different languages are included. The system includes a synonym or keyword dictionary which is bi-directional and allows for translation of keywords between a first language and other languages. The translated words keywords for the document are stored in an inverted index which is then used for searching, either in a selected language, a second language or in all languages, as determined by the user. This use of multiple searching and a translated synonym dictionary avoids the need for translation of the entire document and avoids inaccuracies which may result from translations.
    Type: Application
    Filed: August 21, 2008
    Publication date: December 11, 2008
    Inventors: Youssef Drissi, Moon Ju Kim, Lev Kozakov, Juan Leon Rodriguez
  • Publication number: 20080306923
    Abstract: A system and method of searching a database in which documents of different languages are included. The system includes a synonym or keyword dictionary which is bi-directional and allows for translation of keywords between a first language and other languages. The translated words keywords for the document are stored in an inverted index which is then used for searching, either in a selected language, a second language or in all languages, as determined by the user. This use of multiple searching and a translated synonym dictionary avoids the need for translation of the entire document and avoids inaccuracies which may result from translations.
    Type: Application
    Filed: August 21, 2008
    Publication date: December 11, 2008
    Inventors: Youssef Drissi, Moon Ju Kim, Lev Kozakov, Juan Leon Rodriguez
  • Patent number: 7454505
    Abstract: A method for communication includes receiving a request from a first party, submitted via a first communication service provider to a telephony application, to place a call using the application to a second party. Responsive to a characteristic of the call placed by the first party, a second communication service provider is selected to carry the call between the application and the second party. The second party is then connected via the second communication service provider to communicate with the first party using the application.
    Type: Grant
    Filed: January 24, 2002
    Date of Patent: November 18, 2008
    Assignee: International Business Machines Corporation
    Inventors: Samuel Kallner, Lev Kozakov, Alexey Roytman, Uri Shani, Pnina Vortman
  • Publication number: 20080282356
    Abstract: In the context of screens, windows and like media, arrangements for automatically detecting when a recipient has entered or left a public setting so that privacy configuration changes can be automatically invoked. Also broadly contemplated herein is an arrangement for selectively displaying messages on the recipient's screen but deferring the messages from being visible on a remote hardware device or software display which is publicly visible. Furthermore, there is broadly contemplated herein a secure arrangement for revealing and responding to deferred messages. More generally, there is broadly contemplated herein a new approach to the provision of application notifications and to alarm control during a desktop screen sharing mode, based on the automatic detection of a screen sharing state and on notifying registered applications of the screen sharing in a unified, consistent manner.
    Type: Application
    Filed: July 22, 2008
    Publication date: November 13, 2008
    Inventors: Genady Grabarnik, Nagui Halim, Neal M. Keller, Lev Kozakov, Larisa Shwartz, Clifford A. Pickover, Robert W. Wieniewski
  • Publication number: 20080270393
    Abstract: Techniques are presented for automatically selecting information sources that are most relevant to user queries. Results of searches returned by information sources for queries are analyzed and the information sources are ranked based on this analysis. The information sources that have high rankings for a query are subsequently used to search for relevant results. This process can be adaptive, as the returned results of old queries can be analyzed at a later date to update the ranking of the information sources, automatic searches can be performed to update the ranking of the information sources, new queries can be used for analysis and stored, new information sources added, and old information sources deleted. A linguistic library is used to store personal categories for one or more users and general categories. Each category is associated with keywords and ranked lists of information sources. The library also contains general categories, taxonomies, and dictionaries.
    Type: Application
    Filed: July 8, 2008
    Publication date: October 30, 2008
    Applicant: International Business Machines Corporation
    Inventors: Yurdaer Nezihi Doganata, Youssef Drissi, Lev Kozakov
  • Patent number: 7433894
    Abstract: A system and method of searching a database in which documents of different languages are included. The system includes a synonym or keyword dictionary which is bi-directional and allows for translation of keywords between a first language and other languages. The translated words keywords for the document are stored in an inverted index which is then used for searching, either in a selected language, a second language or in all languages, as determined by the user. This use of multiple searching and a translated synonym dictionary avoids the need for translation of the entire document and avoids inaccuracies which may result from translations.
    Type: Grant
    Filed: June 13, 2005
    Date of Patent: October 7, 2008
    Assignee: International Business Machines Corporation
    Inventors: Youssef Drissi, Moon Ju Kim, Lev Kozakov, Juan Leon Rodriguez
  • Publication number: 20080168080
    Abstract: An unknown annotator and its annotation type system are compared against a reference annotation type system. The comparison is done by providing a plurality of documents, and annotating each document using the reference set of document annotators, producing instances of reference annotation types, to generate a pre-annotated reference document set, and using the subject annotator and its subject annotation type system to generate a pre-annotated evaluation document set. Documents in the pre-annotated evaluation document set are compared to documents in the pre-annotated reference document set, and matches in location, within the compared documents, of instances of the subject annotation types and the reference annotation types are identified. Based on the matching data, reference document annotation types are selected that sufficiently correlate with the subject annotation type system.
    Type: Application
    Filed: January 5, 2007
    Publication date: July 10, 2008
    Inventors: Yurdaer N. Doganata, Youssef Drissi, David A. Ferrucci, Tong-Haing Fin, Genady Grabarnik, Lev Kozakov