Abstract: An organizational model of a hierarchical system can be distributed across various elements of an enterprise. Such elements include representations of the system that are maintained on higher-level business servers and other representations that serve control elements of the system such as programmable logic controllers and/or other industrial control components. In one aspect, an industrial automation system is provided. The system includes at least one controller to instantiate a portion of an organizational hierarchy. A communications component in the controller interacts with at least one other portion of the organizational hierarchy to facilitate data exchange and control between various components of an enterprise.

Abstract: A server system is disclosed that is capable of providing responsive content to a user when a request for an invalid URL is received. In a preferred embodiment, the server system implements multiple rescue strategies for attempting to rescue the invalid URL. One such rescue strategy involves repairing the URL by correcting for encoding errors, such as errors introduced by some web clients. Another rescue strategy involves determining that the URL contains an obsolete or outdated item identifier (e.g., product identifier) that renders the URL invalid, and returning information regarding one or more related items to the user. Another rescue strategy involves mining the invalid URL for one or more text strings reflective of the type of content desired, and then using the one or more text strings to execute a keyword search to identify content to provide to the user. The various rescue strategies may be attempted in sequence according to a hierarchy.

Abstract: The present invention is directed to a method and system for efficient write journal entry management maintaining minimum write journal information stored in a nonvolatile memory through utilizing an additional structure in a fast volatile memory. The method and system may manage write journaling of a file volume including multiple fixed sized regions and assign a persistent 1-bit synchronization status (the write journal information) to each data region. In addition, a non-persistent I/O counter (the additional structure) for each region to manage the persistent 1-bit synchronization status during run-time. The present invention may provide a mechanism to determine when write I/O operations have not successfully completed to a specific region of the file volume.

Abstract: Suggesting to a user most likely search assets that address a searched topic in each of a number of different software applications is provided. In response to a search for help or general information content associated with a given application, suggested help or general information content associated with a number of different applications or different versions of a given application is provided.

Abstract: Prefetching data using a piecemeal list prefetching method. This is achieved by various means, including building a plurality of data pages, sorting the plurality of data pages into sequential data pages and a list of non-sequential pages, prefetching the sequential data pages using a first prefetching technique, and prefetching the non-sequential list of data pages using a second prefetching technique.

Abstract: A method for identifying records of variable length within a data block containing corrupted data is disclosed herein. In certain embodiments, such a method may include scanning backward from an end of a data block containing variable-length records. The backward scan may proceed, one record at a time, to identify a first span of good (i.e., non-corrupt) records. The method may further include scanning forward from a front of the data block, also proceeding one record at a time, to identify a second span of good records. The method may include identifying a problem region by identifying data that resides between the first span and the second span. The method may also include creating a new record between the first span and the second span that contains the problem region. A corresponding computer program product, apparatus, and system are also disclosed.

Abstract: The present invention provides a system, method and apparatus for electronically searching for an item by receiving a search request comprising a requested category and one or more requested attributes of the item and storing the search request in a search index based on the requested category and the requested attribute(s). The search index includes one or more categories and each category is defined by a taxonomy of attributes. The search index is then searched for any previously stored search requests that match the requested category and the requested attribute(s), a result of the search is determined and a search response that includes the result of the search is sent.

Abstract: A near-duplicate component includes a fingerprint creation component and a similarity detection component. The fingerprint creation component receives a document of arbitrary size and generates a compact “fingerprint” that describes the contents of the document. The similarity detection component compares multiple fingerprints based on the hamming distance between the fingerprints. When the hamming distance is below a threshold, the documents can be said to be near-duplicates of one another.

Abstract: The present invention provides a processing procedure management device which can determine a process procedure by adapting to a performance change of a function engine used for information processing at a high speed.

Abstract: Human computation games are provided wherein a player is shown a page, such as a web page. The player is then asked to provide one or more terms that are intended to cause a search engine to return the page in response to performing a query using the terms. The terms provided by the player during game play are then collected, stored, and utilized to improve the performance of the search engine.

Abstract: Indexing agents and/or data brokers are leveraged to provide search query results related to manufacturing processes. The indexing agents allow different manufacturing configuration data types to be “sub-indexed,” allowing them to be easily searched. In one instance, the sub-indices can be aggregated together to create an overall index to facilitate in query searches of the configuration data. Separate indexing agents can be utilized for indexing contents of the configuration components for the human-machine interface (HMI) and control system and the like. Data brokers can be employed to facilitate in responding to query searches by indexing/searching real-time process variables (tags) and historical data in persistent storage. A search engine can then be employed to aggregate the search results and present them to a user in a selectable fashion. User selected results are then rendered in the proper format and displayed to the user.

Abstract: Systems and methods which facilitate search engine discovery of and/or access to application program content are shown. Declarative code may be provided within the procedural code of a rich Internet application in order to identify various states, and their associated content, of the rich Internet application. A Web crawler may identify content associated with a rich Internet application using the foregoing information. Likewise, direct access to rich Internet application states associated with the identified content may be provided using the foregoing information. A translation module may be provided for interfacing between a Web crawler and a rich Internet application.

Abstract: A system, a method, an apparatus, and a computer-readable medium are provided. Each of a group of documents is segmented. Categories are assigned to each segment of the group of documents. A categorization series for each one of the group of documents is formed, based at least in part, on the categories assigned to each of the segments of respective ones of the plurality of documents. A pattern is found based, at least in part, on the plurality of categorization series corresponding to the plurality of documents. Each of the group of documents is categorized based, at least in part, on the pattern.

Abstract: One embodiment involves a method and apparatus for mapping lexical keywords into entity description semantics in order to create unambiguous buyer-confirmed descriptions of entities. The method described herein relies on a computer program and some mechanism for computer data storage.

Abstract: Methods, systems, and computer program products for combining conjoint analysis with customer relationship management software, search engine software, and auction software are disclosed. According to one method, conjoint analysis is used to facilitate user interaction with a search engine. According to the method, search keywords are received as a user and treated as attributes by a conjoint analysis application. The conjoint analysis application presents the user with paired trade-off questions regarding the search keywords. Conjoint analysis is performed based on user responses to the questions. Based on the user's responses to the questions, relative importance weightings are computed for keywords. The keywords and the relative importance weightings are input to a search engine. The search is performed using the keywords. Results to be output to the user are selected based on occurrences of the keywords in the search results and the relative importance weightings.

Abstract: A method, computer readable medium, and system for storing a structured document in its native format in a database are provided. The method, computer readable medium, and system include receiving the structured document, generating a hierarchical node tree comprising a plurality of nodes, where the node tree represents the structured document, and storing the plurality of nodes in at least one record in the database.

Abstract: A method and computer system for monitoring and controlling the quality of tests performed upon a database. A statistical quality layer is provided, which for each new test to be executed on the database, provides recommendations as to a confidence level to be applied to the test and to a number of additional data records to be added to the database in order to maintain the total expected number of type-I errors of tests performed upon the database. The method and computer system further provide access control of users to the database.

Abstract: A data storage system requires no special operation by owner users (who make data available) and provides guest users (who view the data) with ease of management of information required to access the data. For example, a URL providing access to data is issued in association with the combination of an owner user and a guest user. This provides ease of information management since only a single URL is required for a guest user to access a plurality of data made available by one owner user.

Abstract: A heap management system for a database uses “sets” of pages to store database information. As memory for each successive set of pages is allocated, more memory is allocated for storing rows in each page of the set. Similarly, the maximum number of rows of information storable in each page of each set is greater for each successive set of pages. The number of computer instructions needed to resolve (or calculate) the memory address for a particular row is fixed. Given a target row number, (and the number of rows in the first page, and the width of the column or column group), only a fixed number of computer instructions need to be executed to resolve the starting memory address for the target row. In addition, information of the same type (i.e., one or more columns of a table) may be stored in different pages, and these pages may be located in discontiguous memory segments. This allows space for new rows to be allocated, without requiring all pre-existing rows to be moved to a different memory segment.

Abstract: URL rewriting is a common technique for allowing users to interact with internet resources using easy to remember and search engine friendly URLs. When URL rewriting involves conditions derived for sources other than the URL, inconsistencies in HTTP kernel cache and HTTP user output cache may arise. Methods and a system for rewriting a URL while preserving cache integrity are disclosed herein. Conditions used by a rule set to rewrite a URL may be determined as cache friendly conditions or cache unfriendly conditions. If cache unfriendly conditions exist, the HTTP kernel cache is disabled and the HTTP user output cache is varied based upon a key. If no cache unfriendly conditions exist, then the HTTP kernel cache is not disabled and the HTTP user output cache is not varied. A rule set is applied to the URL and a URL rewrite is performed to create a rewritten URL.