INDEX EXPLOITATION - Various embodiments of a computer-implemented method, computer program product, and data processing system are provided that generate an index plan that produces a superset of data comprising the query result. In some embodiments, a computer-implemented method, computer program product, and data processing system produce a maximal-index-satisfiable query tree.

2009-01-01

20090006315

STRUCTURED METHOD FOR SCHEMA MATCHING USING MULTIPLE LEVELS OF ONTOLOGIES - A structured method of matching schemas that uses multiple levels of ontologies is disclosed. The method maps functions of a target system to a process ontology and maps functions of a source system to the process ontology to produce a first mapping of target functions and source functions using the process ontology. The method identifies target function parameters upon which the target functions operate and identifies source function parameters upon which the source functions operate. Then, the method maps the target function parameters to a concept ontology and maps the source function parameters to the concept ontology to produce a second mapping of the target function parameters and the source function parameters using the concept ontology. This second mapping is enhanced by mapping the target function parameters to a data-type ontology and mapping the source function parameters to the data-type ontology. This produces an enhanced second mapping of the target function parameters and the source function parameters using the data-type ontology. This enhanced second mapping can be the resultant output to be used in subsequent processing.

2009-01-01

20090006316

Methods and Apparatus for Rewriting Regular XPath Queries on XML Views - Methods and apparatus are provided for rewriting view queries into equivalent queries on the source document. According to one aspect of the invention, methods are provided for processing a view query on a database view. The method comprises the steps of translating the view query to a mixed finite state automata representation of a document query on one or more documents underlying the database view; and evaluating the document query on the one or more documents to obtain a result to the view query. The view query may be, for example, a regular XPath query.

2009-01-01

20090006317

PROCESSING OF MULTIPLE DATA FILES WITH TIME-CORRELATED DATA - A distributed search architecture utilizing multiple processing cores to search multiple files containing time-correlated and logically/semantically interdependent sequential data. A supervisory processing core may provide coordination of the search where multiple slave processing cores each search one or more data files containing time-correlated and logically/semantically interdependent sequential data. Results of the searches performed by the slave processing cores may be provided to the supervisory processing core for consolidation, further analysis and/or presentation.

2009-01-01

20090006318

Multi-source data visualization system - In one general aspect, the application discloses a data visualization method in which at least two retrieved data tables are associated based on a selection of at least one common field. A visualization is displayed for data from a first of the tables and input for query devices is received to filter data for a second of the tables. The displayed visualization for the first table can then be updated in response to the received query device input for the second table based on the created association.

2009-01-01

20090006319

Data visualization system with axis binding - In one general aspect, the application discloses a data visualization method that includes accessing data tables and receiving an axis binding definition for a particular visualization that relates values in a first of the tables to sets of fields in a second of the tables. A marking indication can then be received that selects one of the values in the first of the tables, and a set of fields in the second table is accessed based on the marking indication and the axis binding definition. This accessed set of fields is presented in the particular visualization for which the axis binding definition was received.

SYSTEM AND METHODS FOR THE AUTOMATIC TRANSMISSION OF NEW, HIGH AFFINITY MEDIA - A system and methods for the automatic transmission of new, high affinity media to a user are provided. In connection with a system that convergently merges perceptual and digital signal processing analysis of media entities for purposes of classifying the media entities, various means are provided to a user for automatically extracting media entities that represent a high (or low) affinity state/space for the user in connection with the generation of a high affinity playlist, channel or station. Techniques for providing a dynamic recommendation engine and techniques for rating media entities are also included are also included. Once a high affinity state/space is identified, the high affinity state/space may be persisted for the user from experience to experience.

2009-01-01

20090006322

Method for Handling Web Search Results to Be Displayed on a Browser - A method for handling web search results to be displayed on a browser is disclosed. A history information file is initially provided on a search server connected to a network. The history information file includes a set of previously viewed websites. After the receipt of a search request from an internet browser on a computer connected to the network, an internet search is preformed according to a search criteria of the search request. After the previously viewed websites listed on the history information file have been removed from the current internet search results, the current search results are then sent to the internet browser to be displayed on the internet browser.

2009-01-01

20090006323

System and Method for Analyzing Intelligence Information - According to one embodiment of the disclosure, a method for information analysis comprises receiving a message in a database. The method further comprises identifying at least one of a person, place, or object within the received message. The method comprises obtaining information stored in one or more databases regarding the identified at least one person, place, or object. Finally, the method comprises displaying at least a portion of the information and the message for analysis.

2009-01-01

20090006324

MULTIPLE MONITOR/MULTIPLE PARTY SEARCHES - A technique for the creation of synthesized results from multi-query, multi-party and multi-monitor searches to provide more relevant information to the user in a more useful format and to discard or reduce in relevancy information that is not so useful. It also provides mechanisms for supporting exploratory searches including: saving/restoring search context; search-specific query history; a “keepers” bin for storing useful results; elimination of redundant results; re-ranking of common search results; integration of searching with navigation; pivoting on search results; collaboration among multiple searchers; user-generated content; generation of hypotheses; re-executing queries and executing standing queries; multi-monitor searching and automatic preparation of search summaries.

2009-01-01

20090006325

DYNAMIC HEADLINE SWITCHER - A system for dynamic headline switching. The system includes a database, a display module, an Interface module, and a search engine. The database contains entry data for accessing content such as stories, pictures, or videos. The display engine generates a display including a current headline. The Interface module indexes through each headline, for example, at a predetermined time interval, to provide new and updated information to the user. The search engine queries the database and generates a list of entries allowing the user to access content related to the current headline.

2009-01-01

20090006326

REPRESENTING QUERIES AND DETERMINING SIMILARITY BASED ON AN ARIMA MODEL - Representing queries and determining similarity of queries based on an autoregressive integrated moving average (“ARIMA”) model is provided. A query analysis system represents each query by its ARIMA coefficients. The query analysis system may estimate the frequency information for a desired past or future interval based on frequency information for some initial intervals. The query analysis system may also determine the similarity of a pair of queries based on the similarity of their ARIMA coefficients. The query analysis system may use various metrics, such as a correlation metric, to determine the similarity of the ARIMA coefficients.

2009-01-01

20090006327

Intelligent Database Scanning - Locating potential licensees and infringers of a patent or other intellectual property can be facilitated by determining whether someone other than the property owner is trying or has tried to patent the same or related subject matter. For example, if an applicant files a patent application but does not respond to an action or other patentability opinion by a patent office that cites prior art references, then it can be presumed that one or more of the cited references must be of interest for the applicant, and vice versa with respect to the owners of the cited references. References cited and, if desired, whether an applicant has responded to a patent office's patentability opinion can be determined from patent data publicly available in computer databases maintained by many patent offices around the world.

2009-01-01

20090006328

IDENTIFYING COMMONALITIES BETWEEN CONTACTS - A method includes selecting a plurality of entities to be merged and aggregated, merging the selected entities and identifying at least one common feature between the selected entities, and providing a view of objects linked to the commonalities identified, wherein the objects can be selected and activated to provide more details on the selected commonality.

2009-01-01

20090006329

Methods and Apparatus for Evaluating XPath Filters on Fragmented and Distributed XML Documents - Methods and apparatus are provided for evaluating XPath filters on fragmented and distributed XML documents. According to one aspect of the invention, a method is disclosed for evaluating a query over a tree having a plurality of fragments distributed over a plurality of sites. The method comprises the steps of identifying the plurality of sites storing at least one of the plurality of fragments of the tree;providing the query to the plurality of identified sites, wherein each of the identified sites partially evaluates the query against one of more fragments of the tree stored by the respective site; obtaining partial results from the plurality of identified sites; and composing the partial results to compute a result to the query. The query may be, for example, a boolean XPath query The method can be performed, for example, by a coordinating site that stores a root fragment of the tree.

2009-01-01

20090006330

Business Application Search - A method of searching data on a computer system includes accepting a search query, searching multiple applications on the computer system for data related to the search query wherein the data can be in a variety of formats and displaying search results wherein the search results comprise data related to the search query.

2009-01-01

20090006331

ENTITY-BASED BUSINESS INTELLIGENCE - A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.

2009-01-01

20090006332

FEDERATED SEARCH - Various techniques are disclosed to permit searching several locations with one query. Locations may include web search sites, subscription-only sites, line of business applications, or other searchable data repositories. The query may be modified to provide the required format or other information for each location to perform a search.

2009-01-01

20090006333

Method and system for accessing search services via messaging services - A user using a chat or instant message, mobile message or email type of interface, for example, an information seeker, can connect via an instant message, mobile message, email or chat type of service provider, for example, an America On-line Instant Messenger (AIM) server. The message server connects the user to a routine that allows the user to utilize his or her service interface in combination with the services provided by the information search system. After connection has been established via the message interface, for example, an instant message is received via the chat process. A query string can then be extracted from the instant message and passed to the search system, which can respond with search results.

2009-01-01

20090006334

Lightweight list collection - Described is a collection of search-related references authored from a set of search results, in which the collection may be persisted. Search results may be obtained via a federated search of multiple data sources (e.g., local files, the Internet, a corporate network/database). Search results may be presented as individual reference items or grouped into dynamic collection query reference sets, which may be added to the collection. A collection may also embed one or more other collections. Upon opening a collection, search results may be automatically updated by re-running any dynamic collection queries. The user authors the collection by selecting items from a search results interface and dropping or pasting the item reference into a collection interface, and/or by activating an item collection affordance associated with the item. Manual or automatic layout of collection item references is provided, such as to provide a tabular layout or a two-dimensional layout.

2009-01-01

20090006335

System And Method For Distributing Multimedia Information - A system for distributing multimedia information includes a user interface module. The user interface module is configured to receive an upload of multimedia information from a user. The user interface module is also configured to receive at least one multimedia information distribution indication from the user for selecting at least one remote site to which to distribute the multimedia information. The system includes a multimedia information distribution module in communication with the user interface module. The multimedia information distribution module is configured to distribute the multimedia information to the at least one remote site in accordance with the multimedia information distribution indication.

2009-01-01

20090006336

LOCATION BASED MEDIA ITEMS - Media items can be distributed to mobile devices based on the location of the media device. The media items can be associated with location information, which can be examined and distributed to those devices whose proximate area includes the location information associated with the media items.

Programmer interface for manufacturing execution system - In order to accelerate the analysis of the structure of a data source of the manufacturing execution system a programmer interface for analyzing a data source of a manufacturing execution system includes a query browser having query building means for generating a query, an execute means configured to provide provides means for receiving data from the data source according to the query, and a data structure means configured to provide a structure of the received data based on the query.

2009-01-01

20090006340

Method for Accessing Data in an Xml File - A method for accessing data in an XML file includes: judging whether the index file of the XML to be accessed exists, and constructing the index file if the index file does not exist; reading the index file of the XML into the memory; searching identification information according to pre-defined rules, and obtaining location parameters of the identification information; extracting corresponding data objects or elements according to the location parameter from the XML file according to the identification information. The present invention may locate the data objects or elements efficiently and quickly by constructing the index file, thus accelerate speed of accessing data in a large-scale XML file, and make user's operation sense better.

2009-01-01

20090006341

METHOD OF WEBSITE RANKING PROMOTION USING CREATION OF MASS BLOG POSTING LINKS - The present invention is directed to a method of promoting the high ranking of a website that is more certain to succeed and less susceptible to current and future advances in search engine filtering techniques. This method includes not only creating a large number of Major Specialty Areas each of which categorizes a general business area or activity to which a Blog is directed, but also further establishing a very large number of Sub-Specialty Areas within each Major Specialty Area so to more specifically categorize a business area or activity to which a Blog is directed. The method further includes determining the number of Blog Postings which need to be linked to a website to achieve a high ranking of the website by a search engine. For this purpose, the nature of the website is categorized, by the Blog Posting purchaser, into at least one Major Specialty Area and at least one Sub-Specialty Area within the Major Specialty Area. Next, Blog Distributor provides a requisite number of Blog Postings directed to the Major Specialty Area and Sub-Specialty Area needed to be linked to the website in order to achieve the high ranking. In this latter regard, the method includes determining how many Blogs are available from external Bloggers to provide the requisite number of Blog Postings. If the number of externally written Blogs is insufficient, then a number of Internal Blogs are created, this number of Blogs being sufficient to supply the remaining number of Blog Postings required. The result is that the requisite number and type of Blog Postings needed to be linked to the website in order to achieve the high ranking are provided, and this is done in a timely and cost efficient manner.

MACHINE ASSISTED QUERY FORMULATION - Architecture for completing search queries by using artificial intelligence based schemes to infer search intentions of users. Partial queries are completed dynamically in real time. Additionally, search aliasing can also be employed. Custom tuning can be performed based on at least query inputs in the form of text, graffiti, images, handwriting, voice, audio, and video signals. Natural language processing occurs, along with handwriting recognition and slang recognition. The system includes a classifier that receives a partial query as input, accesses a query database based on contents of the query input, and infers an intended search goal from query information stored on the query database. A query formulation engine receives search information associated with the intended search goal and generates a completed formal query for execution.

2009-01-01

20090006344

MARK-UP ECOSYSTEM FOR SEARCHING - Architecture for completing search queries by using artificial intelligence based schemes to infer search intentions of users. Partial queries are completed dynamically in real time. Additionally, search aliasing can also be employed. Custom tuning can be performed based on at least query inputs in the form of text, graffiti, images, handwriting, voice, audio, and video signals. Natural language processing occurs, along with handwriting recognition and slang recognition. The system includes a classifier that receives a partial query as input, accesses a query database based on contents of the query input, and infers an intended search goal from query information stored on the query database. A query formulation engine receives search information associated with the intended search goal and generates a completed formal query for execution.

2009-01-01

20090006345

VOICE-BASED SEARCH PROCESSING - Architecture for completing search queries by using artificial intelligence based schemes to infer search intentions of users. Partial queries are completed dynamically in real time. Additionally, search aliasing can also be employed. Custom tuning can be performed based on at least query inputs in the form of text, graffiti, images, handwriting, voice, audio, and video signals. Natural language processing occurs, along with handwriting recognition and slang recognition. The system includes a classifier that receives a partial query as input, accesses a query database based on contents of the query input, and infers an intended search goal from query information stored on the query database. A query formulation engine receives search information associated with the intended search goal and generates a completed formal query for execution.

2009-01-01

20090006346

Method and Apparatus for Efficient Aggregate Computation over Data Streams - Improved techniques are disclosed for processing data stream queries wherein a data stream is obtained, a set of aggregate queries to be executed on the data stream is obtained, and a query plan for executing the set of aggregate queries on the data stream is generated. In a first method, the generated query plan includes generating at least one intermediate aggregate query, wherein the intermediate aggregate query combines a subset of aggregate queries from the set of aggregate queries so as to pre-aggregate data from the data stream prior to execution of the subset of aggregate queries such that the generated query plan is optimized for computational expense based on a given cost model. In a second method, the generated query plan includes identifying similar filters in two or more aggregate queries of the set of aggregate queries and combining the similar filters into a single filter such that the single filter is usable to pre-filter data input to the two or more aggregate queries.

2009-01-01

20090006347

Method and apparatus for conditional search operators - Systems and methods for refining search results in response to a user query are disclosed. A search term can comprise a queried data sets coupled with a fundamental operator (e.g., AND, OR, NOT, etc.), and one or more conditional operators that filter at least one of the data sets prior to execution of the fundamental operator in order to reduce the size of the result set. Post-processing conditional operators can be applied after execution of the fundamental operator to further filter the result set. According to one aspect, conditional operators comprise a mathematical operator and a numerical value.

2009-01-01

20090006348

SYSTEM AND METHOD FOR QUERYING HETEROGENEOUS DATA SOURCES - A system and method for querying heterogeneous data sources is disclosed. In some embodiments, the system comprises a plurality of heterogeneously structured data sources, a plurality of query objects that represent queries to the data sources and that are independent of the structure of the data sources, and a user interface configured to query the plurality of query objects.

2009-01-01

20090006349

ENTITY-BASED BUSINESS INTELLIGENCE - A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.

2009-01-01

20090006350

Information Processing Apparatus, Information Processing Method and Program - An information processing apparatus includes: an acquiring means for acquiring focused content information that is information relating to a predetermined content and includes at least any one of descriptions of the predetermined content having information displayed on a display means, a word related to the descriptions, a genre, a title, and cast of the predetermined content; a retrieving means for using content information about the other content that includes at least any one of descriptions of the other content different from the predetermined content, a genre, a title, and cast of the other content and the acquired focused content information to retrieve a content having a high degree of relation to focused content information in the other contents; and a specification information generating means for generating specification information that specifies the resulted content of retrieval based on the result of retrieval done by the retrieving means.

2009-01-01

20090006351

Device and Method for World Wide Web Organization - A method and a device for locating World Wide Web content includes defining a plurality of top-level domain names with each top-level domain name including a different unique category term and a prefix common to all the top-level domain names, associating a plurality of subcategories with each unique category term, where each subcategory is logically related to the unique category term, presenting a first web page located by a first top-level domain name within the plurality of top-level domain names, the first web page including a first content related to at least one of the plurality of subcategories associated with a unique category term in the first top-level domain name, storing the unique category term in the first top-level domain name in a history, receiving a first at least one search-narrowing input from a user, storing the first at least one search-narrowing input in the history, combining the first at least one search-narrowing input with the unique category term to form a first new search criteria, presenting a second web page located by a second top-level domain name within the plurality of top-level domain names, the second web page including a second content related to the first new search criteria, receiving a second at least one search-narrowing input from a user, storing the second at least one search-narrowing input in the history, and combining the second at least one search-narrowing input with the first at least one search-narrowing input and the unique category term to form a second new search criteria.

2009-01-01

20090006352

COMPOSING ABSTRACT QUERIES FOR DELEGATED USER ROLES - Embodiments of the invention provide a database administrator composing an abstract query with visibility to logical fields that are permitted for the delegated roles. In one embodiment, a query interface is configured to receive administrator selections of delegated roles (i.e., the user roles to be provided with access to the finished abstract query). The query interface may then present the administrator with logical fields that are permitted for each delegated role. Providing such information may enable the administrator to verify that all intended users will have access to the finished abstract query.

2009-01-01

20090006353

Method and Apparatus for Selecting Items from a Number of Items - Techniques are presented for selecting one or more items from a collection of items. To select the one or more items, an interface is provided that is adapted to allow a user to define one or more weights. Each weight corresponds to one of a number of similarity criteria. Each item also corresponds to the number of similarity criteria. The one or more weights define a similarity function. The similarity function is applied to the one or more similarity criteria corresponding to the one or more weights and to each of the items in order to select one or more items from the collection of items. The interface can comprise movable markers corresponding to similarity criteria. Locations of the movable markers can be used to weight similarity criteria when creating the similarity function.

2009-01-01

20090006354

SYSTEM AND METHOD FOR KNOWLEDGE BASED SEARCH SYSTEM - The present invention provides functionality for conducting a knowledge based by finding search results from limited topic domains. According to one embodiment, the method of the present invention includes retrieving the context of a given user and identifying a plurality of characteristics associated with the user's context. The one or more characteristics associated with the user's context are displayed to the user and the user may select from the displayed characteristics. One or more items of content are retrieved based upon the user's selection and presented to the user on the user's client device.

2009-01-01

20090006355

GLOBAL RESOURCE METHOD AND SYSTEM - A global resource method and system. The method includes associating by a computing system, groups of suppliers with geographical areas. The computing system receives a selection of a first skill from a requester. The requester is located within a first geographical area. The computing system receives geographical area specification data associated with the first skill. The computing system receives a selection of a first work location associated with the first skill. The computing system receives a selection of a group of suppliers comprising a first supplier associated with the geographical area specification data. The computing system generates a service request document comprising the selection of said first skill. The computing system transmits the service request document to the group of suppliers.

2009-01-01

20090006356

CHANGING RANKING ALGORITHMS BASED ON CUSTOMER SETTINGS - Search term ranking algorithms can be generated and updated based on customer settings, such as where a ranking algorithm is modeled as a combination function of different ranking factors. An end user of a search system provides personalized preferences for weighted attributes, generally or for a single instance of the query. The user also can indicate the relative importance of one or more ranking factors by specifying different weights to the factors. Ranking factors can specify document attributes, such as document title, document body, document page rank, etc. Based on the attribute weights and the received user query, a ranking algorithm function will produce the relevant value for each document corresponding to the user preferences and personalization configurations.

2009-01-01

20090006357

DETERMINING QUALITY MEASURES FOR WEB OBJECTS BASED ON SEARCHER BEHAVIOR - Techniques are provided for generating quality measures for items, including web pages, based on a “random searcher” behavior model. The random searcher behavior model takes into account “implicit” links between items, instead of or in addition to the explicit links. After identifying the implicit links between items, the implicit links may be used as the basis for generating quality measures for the items to which the implicit links point. A variety of types of implicit links are described. To facilitate the generation of quality measures for items based on implicit links, a graph of the implicit links may be constructed in a manner similar to a webgraph.

2009-01-01

20090006358

SEARCH RESULTS - A technique for the creation of synthesized results from multi-query searches to provide more relevant information to the user in a more useful format and to discard or reduce in relevancy information that is not so useful. It can determine which queries belong to the search based on parameters in the queries or results. It also provides mechanisms for supporting exploratory searches including: saving/restoring search context; search-specific query history; a “keepers” bin for storing useful results; elimination of redundant results; re-ranking of common search results; integration of searching with navigation; pivoting on search results; collaboration among multiple searchers; user-generated content; generation of hypotheses; re-executing queries and executing standing queries; multi-monitor searching and automatic preparation of search summaries.

2009-01-01

20090006359

AUTOMATICALLY FINDING ACRONYMS AND SYNONYMS IN A CORPUS - Acronym and synonym pairs can be identified and retrieved automatically in a corpus and/or across an enterprise based on customer settings globally or for a single instance. Possible acronym and synonym term pairs can be identified using a rule such as a heuristic, user-defined rule. Rules selected by the user can be used to rank acronym and synonym pairs using factors such as occurrence frequency and maximum term length. A rule interpreter engine executes the user defined rule set to properly identify and retrieve the user selected acronym and synonym pairs through the utilization of a shallow pause read step. Finally, the user selected acronym and synonym pairs are ranked according to the user preferences, and can be displayed or held for subsequent use in searching.

METHOD AND SYSTEM FOR CONTAINING AND ACCESSING MULITPLE WEB BROWSERS - A container browser or a super browser stores browsers and enables a user to launch any stored web browser and display a designated web page from a preferred browser. This container browser can track and bookmark the browsers such that the browsers could be easily selected and initiated. The container browser could present the content in tabbed form, meaning that a tab that the user can click on will represent every open window. Once the user has designated a particular browser to display particular web page, then this information is stored in the container browser. Further accesses to that web site would be displayed using the designated web browser. Other designated web pages would be displayed on other designated web browsers.

2009-01-01

20090006362

HIERARCHICAL SEEDLISTS FOR APPLICATION DATA - Embodiments of the present invention address deficiencies of the art in respect to crawling content and provide a novel and non-obvious method, system and computer program product for seed lists for hierarchically structured content sources. In one embodiment, a method for crawling seed lists for hierarchically structured content sources can be provided. The method can include specifying a depth of crawling for hierarchically structured content, crawling only seed lists at the specified depth among other seed lists in a hierarchy of seed lists mimicking the hierarchically structured content, and returning indexed data for the crawled seed lists. Optionally, an administrator user interface can be provided for specifying the depth of crawling for the hierarchically structured content.

2009-01-01

20090006363

Granular Data for Behavioral Targeting - A method of targeting receives several granular events and preprocesses the received granular events thereby generating preprocessed data to facilitate construction of a model based on the granular events. The method generates a predictive model by using the pre-processed data. The predictive model is for determining a likelihood of a user action. The method trains the predictive mode. A system for targeting includes granular events, a preprocessor for receiving the granular events, a model generator, and a model. The preprocessor has one or more modules for at least one of pruning, aggregation, clustering, and/or filtering. The model generator is for constructing a model based on the granular events, and the model is for determining a likelihood of a user action. The system of some embodiments further includes several users, a selector for selecting a particular set of users from among the several users, a trained model, and a scoring module.

2009-01-01

20090006364

EXTENDING A SEED LIST TO SUPPORT METADATA MAPPING - Embodiments of the present invention address deficiencies of the art in respect to crawling content and provide a method, system and computer program product for metadata processing for seed lists for structured content sources. In one embodiment, a method for processing metadata for a seed list can include extracting metadata from a seed list for application content, storing the metadata in a repository, associating the metadata with fields of the application content, crawling the fields of the application content by reference to the metadata, and indexing the fields. In an aspect of the embodiment, the method further can include annotating the application to produce metadata for the fields of the application content. In yet another aspect of the embodiment, the method can include mapping the metadata to a document schema generic to a plurality of heterogeneous application content.

2009-01-01

20090006365

IDENTIFICATION OF SIMILAR QUERIES BASED ON OVERALL AND PARTIAL SIMILARITY OF TIME SERIES - Techniques for identifying similar queries based on their overall similarity and partial similarity of time series of frequencies of the queries are provided. To identify queries that are similar to a target query, the query analysis system generates, for each query, an overall similarity score for that query and the target query based on the time series of the query and the target query. The query analysis system also generates, for each query, partial similarity scores for the query and the target query based on various time sub-series of the overall time series of the queries. The query analysis system then identifies queries as being similar to the target query based on the overall similarity scores and the partial similarity scores of the queries.

2009-01-01

20090006366

AUTOMATIC SIGNIFICANCE TAGGING OF INCOMING COMMUNICATIONS - As incoming communications are received, a priority or significance level can be assigned to each communication. A communication determined to have a high priority can be presented to a user at substantially the same time as receiving the communication. A communication having a low priority can be placed in a low priority folder or flagged differently from a high priority communication (e.g., different color-coding). Behavior of a user as it relates to a received communication can be observed for learning purposes or to modify one or more classifications or priority levels.

2009-01-01

20090006367

SEARCH-BASED FILTERING FOR PROPERTY GRIDS - Technologies for search-based filtering of a property grid. Such filtering allows a user to enter a search term into an easily recognized search text box, or apply a user or pre-defined term to a property grid, thus reducing the set of properties visible so that the user has a smaller list to search to find the one on which they desire to operate. The search term is typically applied to all properties shown in the property grid. Elements that match the search term are made visible in an updated property grid while those that do not match are not presented. Also, the search term may be applied to more than just the name of the property. It may be applied to a category within which the property appears, the type of the property, or any of a number of attributes or tags that may be applied to the property.

2009-01-01

20090006368

Automatic Video Recommendation - Automatic video recommendation is described. The recommendation does not require an existing user profile. The source videos are directly compared to a user selected video to determine relevance, which is then used as a basis for video recommendation. The comparison is performed with respect to a weighted feature set including at least one content-based feature, such as a visual feature, an aural feature and a content-derived textural feature. Multimodal implementation including multimodal features (e.g., visual, aural and textural) extracted from the videos is used for more reliable relevance ranking. One embodiment uses an indirect textural feature generated by automatic text categorization based on a set of predefined category hierarchy. Another embodiment uses self-learning based on user click-through history to improve relevance ranking.

2009-01-01

20090006369

AUTO-SUMMARY GENERATOR AND FILTER - A system that facilitates data presentation and management is provided. The system includes at least one database to store a corpus of data relating to one or more topics and a summarizer component to automatically determine a subset of the data over the corpus of data relating to at least one of the topic(s), wherein the subset forms a summary of at least one topic.

2009-01-01

20090006370

ADVANCED TECHNIQUES FOR SQL GENERATION OF PERFORMANCEPOINT BUSINESS RULES - Computer-implemented methods and computer-readable storage media are disclosed to facilitate the application of business rules. A rule is received, the rule defining one or more calculations to be performed on specified data stored in a multidimensional database to yield at least one result. At least one database query is generated seeking the specified data to be retrieved from the multidimensional database. An intermediary table is created to accommodate the specified data retrieved from the multidimensional database. The specified data is stored in the intermediary table and the specified data is manipulated when the data is retrieved or after the specified data is stored in the intermediary table.

2009-01-01

20090006371

SYSTEM AND METHOD FOR RECOMMENDING INFORMATION RESOURCES TO USER BASED ON HISTORY OF USER'S ONLINE ACTIVITY - Blogs (and other information sources) are recommended to a user based history of user's online activities. The system: (1) processes the user's web history, (2) identifies blog posts (and web pages) that link to pages read by the user, (3) generates multiple relevance scores for each identified post/page, and (4) produces multiple rankings of the corresponding source blogs (and web sites) by aggregating individual relevance scores (or combinations of relevance scores), according to users' preferences. The system allows the discovery of information sources that are likely to be interesting to the user and allows sources lost in the “long tail” to be seamlessly discovered.

2009-01-01

20090006372

METHOD AND APPARATUS TO REORDER SERACH RESULTS IN VIEW OF IDENTIFIED INFORMATION OF INTEREST - Various embodiments described herein provide systems, methods, and software to automatically reorder search results presented to users based on information specific to the user or the computing environment of the user. Some embodiments include a data store holding user or environment specific data that is used to identify search results that are more likely to be relevant to the user. These and other embodiments are described in greater detail herein.

2009-01-01

20090006373

RECOMMENDATION SYSTEM WITH MULTIPLE INTEGRATED RECOMMENDERS - A recommendations system is provided in various embodiments for selecting items to recommend to a user. The system includes a recommendation engine with a plurality of recommenders, and each recommender identifies a different type of reason for recommending items. In one embodiment, each recommender retrieves item preference data and generates candidate recommendations responsive to a subset of that data. The recommenders also score the candidate recommendations. In certain embodiments, a normalization engine normalizes the scores of the candidate recommendations provided by each recommender. A candidate selector selects at least a portion of the candidate recommendations based on the normalized scores to provide as recommendations to the user. The candidate selector also outputs the recommendations with associated reasons for recommending the items.

2009-01-01

20090006374

RECOMMENDATION SYSTEM WITH MULTIPLE INTEGRATED RECOMMENDERS - A recommendations system is provided in various embodiments for selecting items to recommend to a user. The system includes a recommendation engine with a plurality of recommenders, and each recommender identifies a different type of reason for recommending items. In one embodiment, each recommender retrieves item preference data and generates candidate recommendations responsive to a subset of that data. The recommenders also score the candidate recommendations. In certain embodiments, a normalization engine normalizes the scores of the candidate recommendations provided by each recommender. A candidate selector selects at least a portion of the candidate recommendations based on the normalized scores to provide as recommendations to the user. The candidate selector also outputs the recommendations with associated reasons for recommending the items.

2009-01-01

20090006375

Selection of Advertisements for Placement with Content - Methods, systems, and apparatus, including computer program products, for selecting advertisements. A request for sponsored content for presentation with a content item in a document is received. One or more candidate sponsored content items are identified based on one or more criteria. The criteria includes information related to the content item independent of the document, and information related to the document. One or more of the candidate sponsored content items are selected. The selected sponsored content items are transmitted for presentation with the content item.

SYSTEM, METHOD AND COMPUTER EXECUTABLE PROGRAM FOR INFORMATION TRACKING FROM HETEROGENEOUS SOURCES - A system for information clustering comprising a data accumulation part for accumulating documents in a document repository, the documents having loosely related attributes, and defining a cluster between the documents being time sliced so as to define chunks of the documents; a vector space generation part for generating document-keyword vectors, the document-keyword vectors consisting of sparse numeral values depending on presence of key words; a dimension reduction part for reducing dimensions of the keywords to create a dimension reduction matrix of the document-keyword matrix; a centroid vector determination part for generating a centroid vector of the cluster, the centroid vectors being defined from keywords and weight of documents within the cluster; and an item repository for storing the centroid vectors together with the keywords and the weights of the centroid vector.

2009-01-01

20090006378

COMPUTER SYSTEM METHOD AND PROGRAM PRODUCT FOR GENERATING A DATA STRUCTURE FOR INFORMATION RETRIEVAL AND AN ASSOCIATED GRAPHICAL USER INTERFACE - A computer system for generating data structures for information retrieval of documents stored in a database. The computer system includes: a neighborhood patch generation system for defining patch of nodes having predetermined similarities in a hierarchy structure. The neighborhood patch generation subsystem includes a hierarchy generation subsystem for generating a hierarchy structure upon the document-keyword vectors and a patch definition subsystem. The computer system also comprises a cluster estimation subsystem for generating cluster data of the document-keyword vectors using the similarities of the patches.

2009-01-01

20090006379

FILTERING METHOD AND SYSTEM FOR THE CORRELATION BETWEEN TESTING OBJECTS AND PATENTS - In a filtering system for a correlation related to a composing element portfolio of a patent, a plurality of elements are defined by standard element codes and stored. Then composing elements of the patent are defined by the corresponding standard element codes in a standard element depository so as to form the composing element portfolio of the patent to be stored. Then an input module defines a composing element portfolio of the testing object according to the standard element codes. After that, the composing element portfolio input by the input module is matched with the composing element portfolio of each said patent. Afterward, matching result are sorted according to correlation and a sorted result based on the correlation is displayed.

2009-01-01

20090006380

System and Method for Tracking Database Disclosures - A system and method is provided for identifying the source of an unauthorized database disclosure. The system and method stores a plurality of past database queries and determines the relevance of the results of the past database queries (query results) to a sensitive table containing the unauthorized disclosed data. The system and method also ranks the past database queries based on the determined relevance. A list of the most relevant past database queries can then be generated which are ranked according to the relevance, such that the highest ranked queries on the list are most similar to said disclosed data. Three techniques used in embodiments of the invention include partial tuple matching, statistical linkage and deviation probability gain.

2009-01-01

20090006381

INFORMATION SEARCH DEVICE, INFORMATION SEARCH METHOD, AND INFORMATION SEARCH PROGRAM - A systematic problem search unit searches information about a systematic problem that is a common problem to a plurality of projects, using a conditional expression for searching the information about the systematic problem based on one of or a plurality of a count by which the information about the systematic problem is stored in the retrospect storage unit, a count by which a trial improvement plan linked to the systematic problem is stored in the retrospect storage unit, and information indicating whether the stored improvement plan is stored in the retrospect storage unit, as a conditional expression indicating a condition for extracting the information about the systematic problem. a systematic problem output unit outputs a search result in the systematic problem search procedure to each of or one of a predetermined storage unit and a predetermined output unit.

2009-01-01

20090006382

SYSTEM AND METHOD FOR MEASURING THE QUALITY OF DOCUMENT SETS - Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

2009-01-01

20090006383

SYSTEM AND METHOD FOR MEASURING THE QUALITY OF DOCUMENT SETS - Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

2009-01-01

20090006384

SYSTEM AND METHOD FOR MEASURING THE QUALITY OF DOCUMENT SETS - Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

2009-01-01

20090006385

SYSTEM AND METHOD FOR MEASURING THE QUALITY OF DOCUMENT SETS - Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

2009-01-01

20090006386

SYSTEM AND METHOD FOR MEASURING THE QUALITY OF DOCUMENT SETS - Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

2009-01-01

20090006387

SYSTEM AND METHOD FOR MEASURING THE QUALITY OF DOCUMENT SETS - Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

NAMED URL ENTRY - Methods and systems allow users to enter natural language terms that describe a particular web site into an address field of a browser instead of a formal URL. The terms are evaluated to determine whether they correspond, with a high likelihood, to a particular web site. If so, this web site may be immediately accessed. If not, a list of search results based on the terms may be displayed by the browser.

AUTOMATIC CATEGORIZATION OF DOCUMENT THROUGH TAGGING - A system and method for identifying a keyword for tagging a document using a tagging algorithm. The keyword is matching with an existing tag. Irrelevant keywords are rejected based on a relevancy factor. The existing tag is updated based on a feedback.

2009-01-01

20090006392

DATA PROFILE COMPUTATION - Architecture that provides a data profile computation technique which employs key profile computation and data pattern profile computation. Key profile computation in a data table includes both exact keys as well as approximate keys, and is based on key strengths. A key strength of 100% is an exact key, and any other percentage in an approximate key. The key strength is estimated based on the number of table rows that have duplicated attribute values. Only column sets that exceed a threshold value are returned. Pattern profiling identifies a small set of regular expression patterns which best describe the patterns within a given set of attribute values. Pattern profiling includes three phases: a first phases for determining token regular expressions, a second phase for determining candidate regular expressions, and a third phase for identifying the best regular expressions of the candidates that match the attribute values.

2009-01-01

20090006393

APPARATUSES, METHODS, AND COMPUTER PROGRAM PRODUCTS FOR MANAGING FILES BEING STORED IN A MEMORY - A method is provided for interacting with files being stored in a memory. The method includes sequentially receiving characters into a series that at least temporarily designates at least part of a file name for a target file being stored in a memory. As the characters are sequentially received, a respective list of files stored in the memory that have file names that are related to a current version of the series are iteratively provided. The list of files can include at least one file having a file name that fails to include the current version of the series. Also provided are corresponding apparatuses and computer program products.

2009-01-01

20090006394

Systems and methods for validating an address - Systems, methods, and software determine whether a field of an input digital representation of information, such as the street name field in an address, is correct by quickly comparing the field to a list of valid choices for that field. The list of valid choices is generated based on information from the input digital representation, such as a character string. If an exact match is not found, a fuzzy match comparison determines the most closely matching valid choice. If a suitable fuzzy match is not found, then the input information is invalid. Otherwise, another field of the input information, such as the building number field of an address, is tested for validity. If the second field passes the validity check, then the fuzzy match (or exact match) for the field is valid. A fuzzy matching field may replace the input field, thereby correcting the input information.

CONTEXTUAL SEARCH - A method of mobile communication advertising, having steps of entering one of a primary function keyword and a vanity keyword to a mobile communication device, entering a search term in a form of a message string into a data processing module, creating a list of category aliases, creating a list of category names, comparing the list of category aliases to the message string for a length, a category alias and a category name, identifying matches between the category aliases and the message string, wherein matches are placed into a search category list, removing matched category phrases from the search message to leave advertising search words, determining a search sub-module based upon the advertising search words, conducting a search using the sub-module; and sending a search result obtained from the sub-module to a mobile communication device, receiving the search result from the sub-module to a mobile communication device, and displaying the search result on the mobile communication device.

2009-01-01

20090006397

Systems, Methods, Devices and Computer Program Products for Providing Media Recommendation Trekking - An apparatus, method and computer program product are provided to generate a playlist or other sequential list of media items in a game-like manner. A starting media item and a target media item may be initially selected. The system recommends a plurality of media items based on the starting media item. The user selects a media item from these recommendations. The system then recommends another plurality of media items based on the user-selected media item. The user then selects a media item from these recommendations. This process continues until the system recommends and the user selects the target media item. The user generally desires to minimize the steps required to traverse a media collection from the starting media item to the target media item. The path that the user takes to reach the target media item can be stored as a playlist or other sequential list of media items.

2009-01-01

20090006398

RECOMMENDATION SYSTEM WITH MULTIPLE INTEGRATED RECOMMENDERS - A recommendations system is provided in various embodiments for selecting items to recommend to a user. The system includes a recommendation engine with a plurality of recommenders, and each recommender identifies a different type of reason for recommending items. In one embodiment, each recommender retrieves item preference data and generates candidate recommendations responsive to a subset of that data. The recommenders also score the candidate recommendations. In certain embodiments, a normalization engine normalizes the scores of the candidate recommendations provided by each recommender. A candidate selector selects at least a portion of the candidate recommendations based on the normalized scores to provide as recommendations to the user. The candidate selector also outputs the recommendations with associated reasons for recommending the items.

2009-01-01

20090006399

COMPRESSION METHOD FOR RELATIONAL TABLES BASED ON COMBINED COLUMN AND ROW CODING - A robust method to compress relations close to their entropy while still allowing efficient queries. Column values are encoded into variable length codes to exploit skew in their frequencies. The codes in each tuple are concatenated and the resulting tuplecodes are sorted and delta-coded to exploit the lack of ordering in a relation. Correlation is exploited either by co-coding correlated columns, or by using a sort order that can leverage the correlation. Also presented is a novel Huffman coding scheme, called segregated coding, that preserves maximum compression while allowing range and equality predicates on the compressed data, without even accessing the full dictionary. Delta coding is exploited to speed up queries, by reusing computations performed on nearly identical records.

2009-01-01

20090006400

TECHNIQUE FOR ENABLING MULTIPLE ACTIONS TO BE PERFORMED ON AN ACTIVE DATA ITEM - A record is processed, and a determination is made as to whether a data item in the record is usable by any one of a plurality of applications that are operable on the device. The detected data item is made actionable by assigning multiple actions to the data item, so that each action is programmatically initiated responsive to a designated input.

2009-01-01

20090006401

FILE MONITORING METHOD, SYSTEM, AND PROGRAM PRODUCT - The present invention provides a file monitoring approach that runs on bridge servers in an SNI environment, monitors a defined folder and detects the same file existing (by its file name persisting) for a predetermined interval period or longer. Optionally, the program can attempt to unlock the ticket corresponding to the inbound update. It also sends notification of the condition to bridge support. If the option to unlock the ticket is used, it reports on the success or failure of the attempt to unlock the ticket in the notification sent. One advantage of using this approach is to automatically detect when this condition is occurring to avoid bridge log space problems, possible customer calls to a helpdesk to request tickets be unlocked, and to notify bridge support. This approach helps to automate bridge support.

2009-01-01

20090006402

METHODS AND SYSTEMS FOR THE DYNAMIC SELECTION OF A LOCKING STRATEGY - Systems and methods are provided for dynamically selecting a locking strategy for a request by a source to use a stored data object in a computerized system. According to one implementation, a method is provided that comprises receiving, by a locking layer, a request from the source to use a stored data object, and determining, with the locking layer, a locking strategy for the request based on a set of locking configuration rules modifiable by a system administrator. The method also includes associating the request with the determined locking strategy. In some implementations, the request and locking strategy may be forwarded to a data management server, which obtains the physical locks on the data objects. The locking strategy may also be changed by the locking layer when the use of the object changes during runtime of the application.

2009-01-01

20090006403

EFFICIENTLY BOOSTING PRIORITY OF READ-COPY UPDATE READERS WHILE RESOLVING RACES WITH EXITING AND UNLOCKING PROCESSES - A technique for efficiently boosting the priority of a preemptable data reader while resolving races between the priority boosting and the reader exiting a critical section or terminating in order to eliminate impediments to grace period processing that defers the destruction of one or more shared data elements that may be referenced by the reader until the reader is no longer capable of referencing the one or more data elements. A determination is made that the reader is in a read-side critical section and the reader is designated as a candidate for priority boosting. A verification is made that the reader has not exited its critical section or terminated, and the reader's priority is boosted to expedite its completion of the critical section. The reader's priority is decreased following its completion of the critical section.

2009-01-01

20090006404

Handling falsely doomed parents of nested transactions - Various technologies and techniques are disclosed for detecting falsely doomed parent transactions of nested children in transactional memory systems. When rolling back nested transactions, a release count is tracked each time that a write lock is released due to rollback for a given nested transaction. For example, a write abort compensation map can be used to track the release count for each nested transaction. The number of times the nested transactions releases a write lock is recorded in their respective write abort compensation map. The release counts can be used during a validation of a parent transaction to determine if a failed optimistic read is really valid. If an aggregated release count for the nested children transactions accounts for the difference in version numbers exactly, then the optimistic read is valid.

2009-01-01

20090006405

Using type stability to facilitate contention management - Various technologies and techniques are disclosed for providing type stability techniques to enhance contention management. A reference counting mechanism is provided that enables transactions to safely examine states of other transactions. Contention management is facilitated using the reference counting mechanism. When a conflict is detected between two transactions, owning transaction information is obtained. A reference count of the owning transaction is incremented. The system ensures that the correct transaction was incremented. If the owning transaction is still a conflicting transaction, then a contention management decision is made to determine proper resolution. When the decision is made, the reference count on the owning transaction is decremented by the conflicting transaction. When each transaction completes, the reference counts it holds to itself is decremented. Data structures cannot be deallocated until their reference count is zero. Dedicated type-stable allocation pools can be reduced using an unstable attribute.

2009-01-01

20090006406

Memory transaction grouping - Various technologies and techniques are disclosed for providing a transaction grouping feature for use in programs operating under a transactional memory system. The transaction grouping feature is operable to allow transaction groups to be created that contain related transactions. The transaction groups are used to enhance performance and/or operation of the programs. For example, different locking and versioning mechanisms can be used with different transaction groups. When running transactions, a hardware transactional memory execution mechanism can be used for one transaction group while a software transactional memory execution mechanism used for another transaction group.

2009-01-01

20090006407

Parallel nested transactions in transactional memory - Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. For example, pessimistic reads are supported. A pessimistic duplication detection data structure is created for a parallel nested transaction. An entry is made into the data structure for each pessimistic read in the parallel nested transaction. When committing the parallel nested transaction, new pessimistic read locks are passed to an immediate parent, and an entry is made into a separate pessimistic duplication detection data structure of the immediate parent with synchronization between sibling transactions. The pessimistic duplication detection data structures can also be used for upgrades from pessimistic reads to write locks. Retry operations are supported with parallel nested transactions. Write abort compensation maps can be used with parallel nested transactions to detect and handle falsely doomed parent transactions.

2009-01-01

20090006408

DOCUMENT MANAGEMENT METHOD AND APPARATUS - A start date of check-out processing of setting a shared document accessible by a plurality of users via a network into an exclusive state is reserved as a check-out start date based on an instruction of a user. In the exclusive state, the shared document can be updated by the user but cannot be updated by other users. When current date has reached the check-out start date, the shared document is set into the exclusive state for the user. The shared document can be released from the exclusive state in response to an instruction of the user checking-out the shared document. An expected check-in date to release the shared document from the exclusive state after the check-out start date can be reserved. This invention enables reservation for a document operation and prevents any decrease in the operation efficiency of users.

2009-01-01

20090006409

METADATA-BASED APPLICATION DEPLOYMENT - Computer-implemented methods, computer-readable media, and an application system are disclosed for creating and deploying metadata-generated applications. Access is provided to one or more type libraries that each include one or more defined object types configurable for use in generating the application. The defined object types include data structure types, rule types, and data types. Input is elicited from a user regarding desired content and function of the application. Based on the user input, metadata is generated to adapt the defined object types to generate the application. Metadata is generated to adapt the defined data structure types to create one or more application databases, to adapt the defined rule types to create one or more application behaviors, and to adapt the defined data types to create one or more application data types.

2009-01-01

20090006410

SYSTEM AND METHOD FOR ON-LINE INTERACTIVE LECTURES - A system and method for implementing on-line interactive lectures are provided. The video and audio lectures are delivered to geographically dispersed students through the internet. The delivery may be performed in two different modes, which are live-broadcast (live lectures) and on-demand (archived lectures). Live-broadcast lectures are delivered to students in real-time while the lectures are recorded. The students may interact with the teacher and also other students using real-time communication methods. The real-time communication methods include text-based on-line chat, and video/audio conferencing systems. On-demand lectures are delivered to students on per-request basis. The students may interact with the teacher or other students using non-real-time communication methods. The non-real-time communication methods include message boards and emails. The system may collaborate with a learning management system (LMS) to control the level of access over the video/audio streams and communications.

2009-01-01

20090006411

Strategic Business Management System - A subject focused information management system is provided based upon an object oriented hub and spoke topology. The information management system provides a structured and secure logically central means for retrieving and storing data oriented by topics and subject matter interests.

2009-01-01

20090006412

METHOD FOR RESOLVING PERMISSION FOR ROLE ACTIVATION OPERATORS - A method for resolving permissions using role activation operators to evaluate permissions assigned to a user in a role context inheritance hierarchy. The method comprises several steps. A step of retrieving a plurality of activated roles within a role context that match roles assigned to a user, wherein one or more permissions in the role context inherit from one or more permissions in a parent role context in a role context permission inheritance hierarchy. A step of determining an aggregate permission for each of the plurality of activated roles, wherein a role activation operator determines how an activated role is evaluated. A step of processing the aggregate permissions for the plurality of activated roles. A step of resolving a final permission for the user.

2009-01-01

20090006413

Owner-Brokered Knowledge Sharing Machine - The invention discloses a system and method for promoting information or knowledge sharing among users registered to a computer network by allowing an information or knowledge owner to locate or directly access private information, to publish information for direct access by knowledge requesters, or to broker information or knowledge with an information or knowledge requester. This invention also discloses a system and method which allow an organization to develop and manage a reward system based on the frequency of an information or knowledge owner's contribution to information or knowledge sharing and the frequency of an information or knowledge requestor's use of shared knowledge.