Abstract: A method of outputting an alert indicating that an unauthorized event has occurred. The method includes obtaining a status from a sensor and retrieving personnel information from a database, the personnel information relating to the sensor. The method also includes generating the alert, applying a filter to determine whether to modify a severity of the alert, and outputting the alert.

Abstract: A computer automated method of aggregating and presenting data includes the steps of inputting a set of user-defined instructions into a computer database system, inputting a user query into the computer database system, mining the computer database system for data relevant to the user query, creating a data set comprising said data relevant to the user query, and aggregating data in the data set using domain metrics selected based on any of predefined and configurable rules and past user usage, selecting at least one presentation report for compiling the aggregated data, wherein the selection is based on any of predefined and configurable rules and past user usage, and displaying the at least one presentation report to the user, wherein the displaying process comprises graphically arranging the at least one presentation report based on an available viewing area of a device accessing the at least one presentation report.

Abstract: The invention provides an evaluation system for reliably evaluating large amounts of content. The evaluation system is managed by a primary authority that designates one or more contributing authorities by delegating to each a specific quantity of authority. Each contributing authority may in turn designate and delegate authority to one or more additional contributing authorities, subject to the restriction that the total quantity of authority delegated does not exceed the quantity of authority the contributing authority was itself delegated. Each contributing authority, and optionally the primary authority itself, may evaluate one or more portions of content by associating a rating with each evaluated portion of content. A composite rating for a particular portion of content may then be determined based upon the ratings associated with the portion of content.

Abstract: To increase the efficiency of the management of image data in a data network including a multiplicity of network nodes, at least one embodiment of the present invention provides for image data, having been stored at a network node provided as a buffer store, to be transmitted for archiving to a network node provided as an archive store and to be stored there, with the storage of the respective image data in the buffer store and in the archive store involving a reference to the respective network node being recorded in an index in conjunction with an explicit identifier for the respective image data. Further, in at least one embodiment, the index is used when the stored image data are subsequently loaded to ascertain the respective at least one network node at which the respective image data are stored.

Abstract: A search query containing at least one term is received at a search controller from a query server and preferably normalized and hashed into a representation of the search query. The representation of the search query is transmitted towards a cache containing multiple query result entries. Each query result entry contains a list of documents associated with the previously searched search query. The cache is then searched and query result entries for the search query are sent to the search controller from the cache. Subsequently, it is determined whether the query result entries are current versions for the search query. If the query result entries are not the current versions, then current versions of the query result entries are obtained.

Abstract: A method, system, and computer-readable medium to quickly synchronize copies of data that have diverged over time. The present invention can be used in synchronizing replicated copies of data that have become unsynchronized due to the restoration of primary data from a backup copy of the primary data. The solution enables copies of data to be synchronized without copying all of the data from one copy to another. The solution uses minimal resources to maintain data consistency and has minimal effect on performance of applications using the data and on network usage. The method includes determining that a change occurred to data in a region of a primary volume without including the region in a set of regions designated for replication to a secondary volume. The region is added to the set of regions designated for replication to the secondary volume and replicated.

Abstract: A contents retrieval device (100) presenting an appropriate related keyword to a user even when an object user wishes to retrieve dynamically changes. The contents retrieval device (100) includes a contents estimation unit (107) retrieving contents according to a search keyword, a document space database (103) storing document spaces according to an occurrence frequency of the keyword, a document space selection unit (104) selecting a the narrowing-down document space and an expansion document space from the document space database (103) according to the search keyword and the occurrence frequency of the document space indicating a degree of relevance with the contents according to the search keyword, a related keyword estimation unit (108) selecting keywords corresponding to the narrowing-down document space and the expansion document space as a narrowing-down keyword and an expansion keyword, respectively, and an output unit displaying the selected narrowing-down and expansion keywords.

Abstract: The present invention proposes a method for data element information management in a network environment, the network environment comprising a plurality of data element information entities (5a, 5b, 5c, 5d), each keeping a respective record of data element information for a plurality of subscribers, and a request routing entity (3), adapted to route (4, S2) requests to a selected one of said plurality of database entities, the method comprising the steps of transmitting (S1) a data element information update for a specific subscriber to said routing entity (3), selecting, at said request routing entity (3), one (5b) of said plurality of database entities for said specific subscriber, forwarding (S2) said data element information update to said selected database entity (5b), and relaying (S5) said data element information update from said selected database entity (5a) to another database entity (5d) of said plurality of database entities.

Abstract: A methodology has been discovered for transforming garbage collection-dependent algorithms, shared object implementations and/or concurrent software mechanisms into a form that does not presume the existence of an independent, or execution environment provided, garbage collector. Algorithms, shared object implementations and/or mechanisms designed or transformed using techniques described herein provide explicit reclamation of storage using lock-free pointer operations. Transformations can be applied to lock-free algorithms and shared object implementations and preserve lock-freedom of such algorithms and implementations. As a result, existing and future lock-free algorithms and shared object implementations that depend on a garbage-collected execution environment can be exploited in environments that do not provide garbage collection.

Abstract: We have developed a methodology for transforming garbage collection-dependent algorithms, shared object implementations and/or concurrent software mechanisms into a form that does not presume the existence of an independent, or execution environment provided, garbage collector. Algorithms, shared object implementations and/or mechanisms designed or transformed using techniques described herein provide explicit reclamation of storage using lock-free pointer operations. Transformations can be applied to lock-free algorithms and shared object implementations and preserve lock-freedom of such algorithms and implementations. As a result, existing and future lock-free algorithms and shared object implementations that depend on a garbage-collected execution environment can be exploited in environments that do not provide garbage collection.

Abstract: A method for maintaining a dynamic reference repository within an enterprise architecture domain, comprises discovering pertinent input(s) to the dynamic reference repository. These newly discovered pertinent inputs are then retrieved to the dynamic reference repository. After retrieval, the pertinent input(s) to the dynamic reference repository are managed and distributed within the enterprise architecture domain.

Abstract: A system receives location information from a user, retrieves weather information based on the received location information, retrieves calendar information associated with the user, and associates the weather information with the calendar information in a calendar application.

Abstract: A network file system-based data storage system that converts random I/O requests into a piecewise sequential data structure to facilitate variable length data segment redundancy identification and elimination. For one embodiment of the invention a stateless network file system is employed. For one such embodiment, that provides multiple-client access to stored data, multiple Writes are buffered and then broken into variable length data segments. Redundant segment elimination is then effected. One embodiment of the invention allows sharing of the variable length data segments among files.

Abstract: An application server includes a cache memory that stores in a correlated form a retrieval condition and a retrieval result, an update condition setting unit that sets a cache update condition that indicates when the cache memory is to be updated; and an update processing unit that reads the retrieval condition from the cache memory upon fulfillment of the cache update condition, retrieves data as the retrieval result from the database using the retrieval condition, and updates the retrieval result in the cache memory corresponding to the retrieval condition.

Abstract: A transactional replication system wherein each replicated command applies to a single row as identified by the primary key, replicated commands are dispatched among multiple connections by hashing of primary key from a single command queue to ensure that changes to the same data row are always dispatched to the same connection to maintain the order of commands as originally occurred on publisher. All connections commit their transactions at the same time in a coordinated fashion without a two phase commit. Retry logic based on a logical sequence number is used to reapply commands from any connection that fails to commit.

Abstract: Instance data is transmitted for Payload/Milestone events and for Enable-Continuation events. Payload/Milestone event data contains information describing an instance and/or providing a time of one or more portions of the processing of an instance. Included in the Enable-Continuation event data is an identifier associated with an instance by a first application and an identifier associated with the same instance by another application. The identifiers are placed in a continuation data table which is used to index the appropriate record of an instance data table. Out-of-order data for an instance is hidden from view until sequentially prior data for the instance is received.

Abstract: A method for accessing a database is provided. The method includes creating in a design environment a file that defines a metadata. The metadata relates at least one business object and at least one query. The method also includes communicating the file to a mobile device, storing the file on the mobile device, and transforming the file into a binary structure at an initial run of a computer application running on the mobile device. The binary structure is adapted to be read by the computer application. The method also includes recording the binary structure in a memory of the mobile device. A method for providing database access for a plurality of files with a limited number of database access channels is provided. A method for is provided for accessing a database in a computing environment for a plurality of recordsets. Each of the plurality of recordsets is associated with a database access channel for fetching records of the plurality of recordsets from the database upon occurrence of a preselected event.

Abstract: A system and method is provided for gathering and aggregating operational metrics (e.g., performance metrics, process events, health monitor state, server state) for a plurality of members as a single entity and for a plurality of entities as a singular entity. The system and method provides for operational metrics of members and entities to be aggregated and retrieved as a single result set, such that entity wide operational metrics can be acquired, monitored and displayed as a single entity.

Abstract: Various exemplary metadirectories, systems and/or methods include delta information, error information and/or state information to facilitate metadirectory administration and/or operation. An exemplary metadirectory relies on a hologram and a plurality of deltas to represent information related to an object of a directory. Such an exemplary metadirectory may represent the object in association with one or more processing states based on the hologram and one or more of the plurality of deltas. Various other exemplary metadirectories, systems and/or methods are also disclosed.

Abstract: The present invention relates to a method and system for improving information retrieval from a database. In one aspect, the invention provides a method for implementing a database. The method includes the steps of providing at least one set of linked entities which contain a plurality of entities, and each said entity is arranged to store at least one data value, further providing an additional entity for at least one set of linked entities, and storing in the additional entity the aggregation of a plurality of data values contained in the at least one set of linked entities.