International Business Machines Corporation

Tong-Haing Fin

Youssef Drissi

Lev Kozakov

Yurdaer Nezihi Doganata

Moon Jung Kim

Moon Ju Kim

Gregory T Brown

Genady Grabarnik

Thomas Anthony Cofino

Juan Leon Rodriguez

Roberto J Bayardo, Jr

Juan L Rodriguez

Makoto Kobayashi

David Angelo Ferrucci

Sheng Ma

Jun-Jang Jeng

Tetsunosuke Fujisaki

John Williams Miller

Juan Leon-Rodriquez

Noon Ju Kim

Masahide Shinozaki

Juan Leon Rodriquez

Lev Koaakov

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 thereof, classifying each code pattern; and assigning a rank to each of the code pattern based on it's corresponding meta data as well as a skill level and an experience level of the developer thereof. Once the BPV engine resource is built, it will be used to detect best practice violations in other sets of source code.

Method, system and program product for detecting deviation from software development best practice resource in a code sharing system

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. Based on the type system matching, the subject annotator and its type system are associated with a plurality of reference industrial taxonomy nodes.

Method and system for characterizing unknown annotator and its type system with respect to reference annotation types and associated reference taxonomy nodes

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.

Method and apparatus for search optimization based on generation of context focused queries

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.

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.

Method for sharing source code over a network

Method, system and program product for sharing source code over a network

Search time is reduced with a search engine that includes a bi-directional inverted index facility which can be accessed with a keyword search in one of a number of languages and provide a listing of documents contained in all of those languages. The keywords in all supported languages are preferably stored in an inverted index lookup table cross referenced to documents in those language containing the keywords. Keywords with the same meaning in different languages are accessible together when that keyword in one of the languages is queried. The search engine containing the table can identify pertinent documents either in a selected language, a second language or in all supported languages, as determined by the user. Information about each document can include not only the identity of the document but also information used in ranking the documents such as the number of times that a keyword appears in that document, and the keywords proximity to other keywords. The use of the inverted index table therefore reduces search time by eliminating the need for translation of keywords, their identification in documents and accumulating of ranking information at search runtime and avoids inaccuracies which may result from full text translations of documents.

Retrieving matching documents by queries in any national language

A document search and retrieval system and program product therefor. Search requests are provided to the system through a user interface. A document decomposer decomposes documents into individual document components. Document components and corresponding searchable indices for each are stored in a Component Library. A search unit searches stored document components responsive to search queries. A results validator compares document hitlists with a document type identified in a search query to select valid hitlists entries for a final hitlist. A document view assembly module collects identified document components and assembles them into a document for view at the user interface.

System and method for generating and retrieving different document layouts from a given content

A search engine system is provided in which inputted data in various configurations is first passed through transitional translation layers which convert the data in its multiple configurations to a common or kernel computer form and language. The data is operated on and stored in the kernel form and language. The operated on data is then outputted through transitional translation layers and provided in the desired format the same or different from the input form and language.

Universal search management over one or more networks

A method, system, and computer program product for associating events. A provided event dataset includes events occurring in each of N successive time intervals (N&#x2267;3). Association rules pertaining to successive events in the event dataset are deduced. Sequences of events are generated from the association rules. Clusters of the sequences of events are formed. Sequences of the clusters are created. The clusters of the sequences may be used: to identify at least one event occurring in a time interval of the N time intervals as being a probable cause of at least one event occurring in a later-occurring time interval of the N time intervals; or to predict an occurrence of at least one event in a time interval occurring after the N time intervals, wherein the at least one event had occurred within the N time intervals.

Method and system for associating events

The web sharing manager of a receiving sharing client receives duplicated events (e.g. browser requests) and messages from the web sharing manager of a source sharing client that causes the browser of the receiving sharing client to execute the duplicate event/message so that the browsers of the source and receiving sharing client computer system(s) process the same events/messages. Because events/messages, that include control and information locations (addresses), are shared between the source and receiving and sharing client(s), the same web page is simultaneously displayed and controlled, i.e. shared, on all of the sharing client(s).

Growing community of inventors

Harrison, NY, United States of America

Tong-Haing Fin