Abstract: Collaborative program development systems are provided which implement methods for providing automated programming assistance to code developers in a collaborative program development environment. In particular, systems and methods for automated programming assistance are supported by leveraging a database or library of shared code snippets that are classified according to code patterns and rating scores that are derived from feedback and input from various code developers within a collaborative program development environment.

Abstract: Systems and methods are provided for building and implementing ontology-based information resources. More specifically, multi-user collaborative, semi-automatic systems and methods are provided for constructing ontology-based information resources that are shared by a community of users, wherein ontology categories evolve over time based on categorization rules that are specified by the community of users as well as categorization rules that are automatically learned from knowledge obtained as a result of multi-user interactions and categorization decisions.

Abstract: Euclidean analysis is used to define queries in terms of a multi-axis query space where each of the keywords T1, T2, . . . Ti, . . . Tn is assigned an axis in that space. Sets of test queries St for each one from one of a plurality of server sources, are plotted in the query space. Clusters of the search terms are identified based on the proximity of the plotted query vectors to one another. Predominant servers are identified for each of the clusters. When a search query Ss is received, the location of its vector is determined and the servers accessed by the search query Ss are those that are predominant in the cluster which its vector may fall or is in closest proximity to.

Abstract: Under the present invention, when an application is deployed, certain information corresponding thereto will be stored in an Enterprise Application Directory (EAD). Thereafter, when an instance of the application is requested (e.g., by a requestor), the information is retrieved from the EAD. In addition, the instance is registered with an Application Access Registry (AAR). Registering the instance involves creating a record in the AAR, generating a unique application access key for the instance, and storing the access key with the information in the record. The access key (and optionally the information) is then returned to the requestor, which can then issue service requests to one or more grid services in the shared computer infrastructure. The service request will include the access key so that the grid service can identify the application by searching for the record in the registry using the access key.

Abstract: 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.

Abstract: 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?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.

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.

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 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.

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.

Abstract: Query routing is based on identifying the preeminent search systems and data sources for each of a number of information domains. This involves assigning a weight to each search system or data source for each of the information domains. The greater the weight, the more preeminent a search system or data source is in a particular information domain. These weights Wi{1=0, 1,2, . . . N] are computed through a recursive learning process employing meta processing. The meta learning process involves simultaneous interrogation of multiple search systems to take advantage of the cross correlation between the search systems and data sources. In this way, assigning a weight to a search system takes into consideration results obtained about other search systems so that the assigned weights reflect the relative strengths of each of the systems or sources in a particular information domain. In the present process, a domain dataset used as an input to query generator.

Abstract: 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?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.

Abstract: An automatic search index/meta data self-enhancement system includes a search system log analyzer, which periodically looks through the search system log, of a database, for search queries that did not bring satisfactory results; a search query analyzer which applies query enhancement techniques to the unsatisfactory queries by using glossary terms, synonyms, known typos, translated words, etc. to enhance the queries and categorize them; a relevant document finder which, based on the enhanced query terms and their categorization and subject, uncovers documents that were not previously found and links the documents to the query terms in the search index; and a search index/meta data enhancer, that enhances the meta/data of the documents based on the enhanced query terms in the search index, to reflect these new keywords to allow documents turned up by the enhanced query to be returned when similar future searches are entered by users.

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.

Abstract: A reference document is stripped of relevant search terms and then repopulated with the search terms in accordance with at least one known relevancy algorithm. An example of such a relevancy algorithm involves the position of search terms in a document. When search terms appear early in the document, the document is more relevant than when the search terms appear later in the document. To obtain a relevancy vector chart, a random document is stripped of the relevant terms to generate a non-relevant document. The relevant terms are then formed into sentences by an insertion controller which arranges them in grammatically correct but not necessarily technically correct sentences. The created sentences then are placed back into the document in a selected portion of the document. For instance, correct sentences could be placed at the beginning of the document in one pass through the system. In the middle of a document the second pass through the system and the third time be placed at the end of the document.

Abstract: A method, software and apparatus are provided which enable a user to obtain products and services in a manner which counteracts conflicting actions modifying raw ranking data based on merchants interests. For this purpose, an information a user's web browser is provided with modules that modify search results obtained from one or more sources including directly from merchants. When the user enters a set of key words in an entry field in an on-screen form for a web server to obtain a list of items (products and/or services) of interest to the user, the search terms are modified in the users or his agents browser to reflect the interest of the user, his management or his parents. The user or his agent receives ranking information taking the highest ranked products and obtains the product information for the most highly ranked products. The browser then reranks the products using a ranking algorithm preferred by the user that offsets information sources biases in the ranking of the product information.

Abstract: A data classification method and apparatus are disclosed for labeling unknown objects. The disclosed data classification system employs a learning algorithm that adapts through experience. The present invention classifies objects in domain datasets using data classification models having a corresponding bias and evaluates the performance of the data classification. The performance values for each domain dataset and corresponding model bias are processed to identify or modify one or more rules of experience. The rules of experience are subsequently used to generate a model for data classification. Each rule of experience specifies one or more characteristics for a domain dataset and a corresponding bias that should be utilized for a data classification model if the rule is satisfied.

Abstract: 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.

Abstract: Euclidean analysis is used to define queries in terms of a multi-axis query space where each of the keywords T1, T2, . . . Ti, . . . Tn is assigned an axis in that space. Sets of test queries St each one from one of a plurality of server sources are plotted in the query space. Clusters of the search terms are identified based on the proximity of the plotted query vectors to one another. Predominant servers are identified for each of the clusters. When a search query Ss is received, the location of its vector is determined and the servers accessed by the search query Ss are those that are predominant in the cluster which its vector may fall or is in closest proximity to.

Abstract: Query routing is based on identifying the preeminent search systems and data sources for each of a number of information domains. This involves assigning a weight to each search system or data source for each of the information domains. The greater the weight, the more preeminent a search system or data source is in a particular information domain. These weights Wi{1=0, 1,2, . . . N] are computed through a recursive learning process employing meta processing. The meta learning process involves simultaneous interrogation of multiple search systems to take advantage of the cross correlation between the search systems and data sources. In this way, assigning a weight to a search system takes into consideration results obtained about other search systems so that the assigned weights reflect the relative strengths of each of the systems or sources in a particular information domain. In the present process, a domain dataset used as an input to query generator.

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.