Abstract: The invention comprises systems, methods and a computerized data management device for creating and using data relating to a medical or non-medical product or device to enhance the safety of the product or device. A vast amount of data regarding adverse events associated with a particular product or device is analyzed to identify new essential adverse events associated with the product or device. At least one database of new essential adverse event information is created and utilized, and new characteristics of or uses for the product or device related to the new essential adverse event information are determined. Adverse event information is gathered for a large number of population sub-groups. The system may also be programmed to incorporate the information into intellectual property and contract documents.

Abstract: Conditionally branching a validation allows branch-specific child validations to execute based on the values of data in a specific record. This allows for example a conditional branch to call another validation to validate records having particular category field values, family values and/or audience level/name/values. Embodiments comprise an interface that assists users through the use of automatic tokenizing and/or pick lists of field names and fields values, including a measurement builder for entering legal tokenized measurement values with applicable units of measure. Embodiments of the invention allow knowledgeable users to rapidly create expressions to ensure that the legal syntax and semantics of an expression are not violated while providing the user with pick lists and measurement values within legal ranges and with applicable units of measure. Validations rules are generated and performed on desired records in a computer system database without requiring programs, scripts or queries to be written.

Abstract: A method of and system for deriving hierarchical structure from a set of digital objects is presented. The set of digital objects, such as digital images for example, may include a plurality of digital objects each associated with a data tag (such as a date, location, and/or text description, for example) that is part of a flat property set that does not encode the hierarchical relationships of the data objects. The set of digital objects may be filtered by a query and a query engine. Each data tag of each digital object may be compared on the basis of a relationship, such as mathematical equality, proximity in value, and/or similarity of text strings, for example. A hierarchical data structure may be established that includes a parent data segment and a child data segment, each labeled with a related data tag and populated with one or more related digital objects. The hierarchical data structure may be represented by a tree or by nested folders.

Abstract: Systems and methods are provided for manipulating data sets. In accordance with one implementation, a computerized system is provided for storing, managing, indexing, interrelating, and/or retrieving data sets in a manner independent of the data model. The system includes an element module configured to store and uniquely identify elements and an element relation module configured to store relationships between the elements in the element module. The computerized system may also comprise a class module configured to store attributes of elements in a class and a type definition module configured to define the class and the attributes related to the class. The computerized system may further comprise a state machine module, the state machine module including a state machine transition module and a status module.

Abstract: Methods, apparatus, and computer-readable media for providing a device handle database in an EFI environment are disclosed. According to one method, a device handle database is created for storing data identifying the protocols that have been installed on one or more device handles. The database includes a sorted array of elements utilized to store protocol data for a family of protocols having the same GUID. Each element in the array comprises a family data structure including a field for storing the GUID for the family along with a field for storing a pointer to a linked list that stores the protocol instance data for each of the protocols in the family. Each node in the linked list is also a member of a linked list for storing protocol data for all of the protocols installed on a given device handle.

Abstract: A device and method for calculating information regarding a route to a destination. The device may include a computer-readable memory element on which is stored a plurality of templates comprising historical speed values for a quantity of time segments and a map database including data for a plurality of road segments associated with template codes identifying one or more of the templates. The device may also include a processing device for accessing the map database to determine a historical speed value for one or more selected road segments. The historical speed value may be used for calculating an estimated amount of time to complete a selected route, a route to the destination that takes the least amount of time, and/or a predicted time of arrival at the destination.

Abstract: The present invention relates to methods, systems, and computer readable media comprising instructions for detecting templates within one or more web pages comprising a website. The method of the present invention comprises generating one or more groups of hyperlinks within a respective web page of the one or more web pages comprising the website. An in-link score is calculated for a given uniform resource locator associated with the one or more web pages comprising the website. The hyperlink groups in which the uniform resource locators associated with the one or more web pages comprising the website appear are identified. A template score is assigned to the identified hyperlinks groups on the basis of the in-link score associated with the uniform resource locators to which the hyperlinks comprising the hyperlink group correspond. The hyperlink groups with template scores exceeding a given template score threshold are thereafter identified as templates.

Abstract: A computer-readable storage medium storing a dataset sorting program is provided to sort records in a dataset into a plurality of destination groups according to a given key item specification. An item value extractor creates an item value list for every record. Then a frequent tree builder builds a frequent tree from the item value lists by finding patterns of item values that appear more often than a threshold specified by a given growth rate parameter. Each item value pattern is a leading part of an item value list with a variable length. A destination group mapper associates each node of the frequent tree with one of the plurality of destination groups. A record sorter traces the frequent tree according to the item value list of each given record, and upon reaching a particular node, puts the record into the destination group associated with that node.

Abstract: In general, the present invention allows one to define both a hierarchy with one or more peers and no parents (e.g., one or more blades and no chassis) and a hierarchy with one or more peers and a parent (e.g., one or more blades and a chassis) as long as the relationships are valid. Rather than relying on a user's a priori knowledge of the hierarchical relationships, this invention allows a user to select any starting point and then drive in any desired direction. Despite this flexibility, the invention still allows rules for permissible relationships to be enforced. Thus, driving is limited by the relationships extant in the underlying data, or the known combining rules.

Abstract: Provided are a method, system, and article of manufacture, wherein a data structure corresponding to a set of client nodes selected from a plurality of client nodes is generated. Objects from the selected set of client nodes are stored in the data structure. A determination is made that an object corresponding to a client node of the selected set of client nodes has to be stored. An additional determination is made as to whether the object has already been stored in the data structure by any client node of the selected set of client nodes. The object is stored in the data structure, in response to determining that the object has not already been stored in the data structure by any client node of the selected set of client nodes.

Abstract: An online address book system having sufficient hardware and software to operate an address book user interface and to perform intelligent interpretations of voice and text inputs from users. The system includes at least one server software module that includes software to perform a plurality of functions. These include the ability to receive voice input data and separate user voice queries, wherein the software can arrange the data so as to create a data base that includes at least three access dimensions, including contact access, contact-relationship access and contact-time frame access, and so as to create a connectivity matrix based on a plurality of contact pair relationships applying connective recognition logic. The system provides a voice operated user interface that permits access to address book stored data based on user input selected from the group consisting of contact, a contact-relationship pair, a contact-time frame pair, and combinations thereof.

Abstract: A semantic relational database has a phrase registry data store of definitions and data handlers that syntactically traverse sentences and report word phrases of relationships defined by the sentences. In some aspects, the database has a sentence data structure in which a sentence refers to another sentence by containing a sentence phrase definition for the other sentence. In other aspects, the database has a sub-sentence data structure that stores sentences as sub-sentences having syntax types specified by a syntax type data structure. A modified relationship is obtained by one sub-sentence being designated to modify another sub-sentence of the same sentence.

Abstract: An ordered sequence of two or more facet provider objects are associated and each is configured to select successive subsets of data in a registry via a database upon a user request to create and configure a faceted selection. Upon a user selection of a save feature, each associated facet provider object is serialized in the ordered sequence, and each serialization is collected into an ordered list of serializations and saved. The serialization of each facet provider object is performed by one of the respective facet provider object and a facet provider object of a same type as the respective facet provider object. A selection statement is constructed from the associated facet provider objects in the ordered sequence. A difference between the constructed selection statement and an actual selection statement is calculated and the selection statement difference is appended to the saved ordered list of serializations.

Abstract: A method of operating a storage of a finite state machine includes organizing information concerning an operation of the machine in a payload-transition matrix, in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters, and compressing the payload-transition matrix in a row-displaced format.

Abstract: An integrated verification and manufacturability tool provides more efficient verification of integrated device designs than verification using several different verification components. The integrated verification and manufacturability includes a hierarchical database to store shared design data accessed by multiple verification components (e.g., layout versus schematic, design rule check, optical process correction, phase shift mask assignment and OPC verification and machine language conversion). The hierarchical database includes representations of one or more additional, or intermediate layer structures that are created and used by the verification components for operations performed on the design being verified. Use of a single hierarchical database having shared data for access and use by multiple verification components streamlines the verification process, which provides an improved verification tool.

Abstract: A system and method for developing and enabling model-driven extensible Markup Language (XML) transformation to XML Metadata Interchange (XMI) format incorporate a strong built-in validation capability. A platform independent framework applies multiple passes of transformation, where each pass performs specific operations on internal models. Different source models are then merged into a target model.

Abstract: A project management system manages project schedule data using separate current and historical task schedule data structures. In general, current schedule data is stored separately from historical schedule data, so that the current schedule data may be retrieved separately from the historical task schedule data. The project management system may also maintain unscheduled tasks as “to-do lists.” Tasks may be added to a member's schedule without specifying any planned dates and the tasks are added to the database. The tasks have an associated revision number of 0 to indicate that the tasks were added, but not yet scheduled. The tasks are displayed in the member schedule editor and in Web page schedules. The tasks may then be displayed in the member schedule editor and in Web page schedules in a manner that allows a user to readily determine that the tasks are “to-do list” tasks.

Abstract: Systems, methods and computer program products for information sharing are provided. In one embodiment, the method comprises generating metadata associated with content stored in a content repository accessible to a community having a plurality of members, wherein the metadata which is stored in the community's registry, is utilized by a community member to determine attributes associated with the content and its subcontents, such that the community member is provided with access to a compilation of information in the subcontents according to a category of interest and based on information in the metadata, and preferably, the community member generates more metadata which is stored in another community's registry associated with the content such that another community member is provided with access to a second compilation of information in the subcontents.

Abstract: A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.

Abstract: A method, a data format, an encoding device, a decoding device and a system for encoding, for decoding and/or for transmitting location information, the location information including both locating information and description information, a data packet separately containing locating information and description information, and the data packet containing assignment information for assigning at least a part of the locating information to at least a part of the description information.

Abstract: By modeling real-world application objects with complex structures, behaviors, and operations described by a schema which is enforced by the hardware/software interface system, various embodiments of the present invention provide rich sub-typing functionality by extending Items (and Item types) using “Extensions” which provide additional data structures (Properties, Relationships, etc.) to already existing Items type structures. Extensions are strongly typed instances that cannot exist independently and must be attached to an Item or a Nested Element. Extensions are also intended to address “multi-typing” issues by enabling the overlap of type instances (e.g., a Document may be a “legal document” as well a “secure document”).

Abstract: In one or more embodiments, a tag is provided and includes a property that associates a strongly typed variable with the tag. Strongly typed variables can include any suitable types. For example, in at least some embodiments, the strongly typed variable is a people type that allows the tag to be associated with an individual person or group of people by virtue of a unique identification that is associated with the person or group. Strongly typed tags can then serve as a foundation upon which various other types of information and services can be provided to enhance the user experience.

Abstract: A method and a processing device are provided for compressing a web graph including multiple nodes and links between the multiple nodes. Nodes of the web graph may be clustered into groups including no more than a predetermined number of nodes. A list of links of the clustered nodes may be created and sorted based on a frequency of occurrence of each of the links. A prefix tree may be created based on the sorted list of links. The prefix tree may be walked to find candidate virtual nodes. The candidate virtual nodes may be analyzed according to a selection criteria and a virtual node may be selected. The prefix tree may be adjusted to account for the selection of the virtual node and the virtual node may be added to the web graph.

Abstract: To construct an ontology for a target data by re-using an existing ontology, from an aspect of the structure of the class hierarchy according to an object-oriented method and an aspect of the levels of relevance with other properties, the properties that correspond to the data items in the data serving as an ontology construction target and the extraction classes of the properties are determined as property extraction destination candidates for the ontology to be constructed. As a result, it is possible to re-use even a fine difference in the meanings among the properties in the classes. Consequently, it is possible to provide a support for constructing an effective ontology, while reducing the load on the user.

Abstract: A data-driven, hierarchical information navigation system and method enable search of sets of documents or other materials by certain common attributes that characterize the materials. The invention includes several aspects of a data-driven, hierarchical navigation system that employs this navigation mode. The navigation system of the present invention includes features of an interface, a knowledge base and a taxonomy definition process and a classification process for generating the knowledge base, a graph-based navigable data structure and method for generating the data structure, World Wide Web-based applications of the system, and methods of implementing the system. Users are able to search or browse a particular collection of documents by selecting desired values for the attributes.

Abstract: Various embodiments provide a state-based, regular expression parser in which data, such as generally unstructured text, is received into the system and undergoes a tokenization process which permits structure to be imparted to the data. Tokenization of the data effectively enables various patterns in the data to be identified. In some embodiments, one or more components can utilize stimulus/response paradigms to recognize and react to patterns in the data.

Abstract: Methods (100), algorithms, and implementing systems (200) for guided annotation of process deviations by an individual responsible for annotations (e.g. process operator) for a manufacturing process having an associated computing system (210) including a historical database (stored in memory 219). The historical database is provided (101) including data associated with a plurality of process performance measures including stored deviations for the plurality of process measures, stored quantitative deviation attributes thereof and at least one cause associated with each of the stored deviations process performance measures. The method includes the individual responsible for annotation selecting at least one present deviation (D) to be annotated responsive to a deviation in a target process performance measure (T) selected from the plurality of process measures (102). Automatically, the stored quantitative attributes associated with D, T, and a target value or target interval for T are retrieved (103).

Abstract: The present invention is a method and system for handling a plurality of information units in an information processing system, such as a multimodal human computer interaction (HCI) system, through verification process for the plurality of information units. The present invention converts each information unit in the plurality of information units into verified object by augmenting the first meaning in the information unit with a second meaning and expresses the verified objects by object representation for each verified object. The present invention utilizes a processing structure, called polymorphic operator, which is capable of applying a plurality of relationships among the verified objects based on a set of predefined rules in a particular application domain for governing the operation among the verified objects. The present invention is named Object Verification Enabled Network (OVEN).

Abstract: Embodiments of the present invention provide systems and techniques for displaying data models and data-model instances. During operation, the system can use a model graph to represent the data model and an instance graph to represent the data-model instance. In the graph representation, a vertex can represent an entity or an entity instance, and an edge can represent a relationship or a relationship instance. The system can display the model graph and the instance graph, either separately or concurrently, thereby enabling the user to visually explore the data model and the data-model instance by exploring the associated graphs. The system can display paths in the graphs to the user, thereby enabling the user to visually explore how entities and entity instances are related to one another. The system can also enable a user to search for entities and relationships using various criteria.

Abstract: A method and a system for automated request modelling from a plurality of inputs, imports, interactive sessions, and requirements are provided that rely on various interfaces to both receive the user and other input data and store it. In one instance, the system and models can compares, test, simulate, sort, and analyse incoming data and the processes built with those data, and can execute request models by simulation.

Abstract: A system and method for automatically transforming non-Unicode supporting files into Unicode supporting files via one or more reusable maps. The system comprises a reusable source type tree organized from a schema, wherein the schema is created from a file; and one or more reusable maps, structured to automatically map one or more rules onto the reusable source type tree to transform the reusable source type tree into a reusable target type tree. The method comprises determining a type of data to be supported; defining one or more rules to support the type of data; and applying the one or more rules automatically to a reusable source type tree to transform the reusable source type tree into a reusable target type tree.

Abstract: Methods, systems, and computer-readable media implementing various aspects of complex data in a conceptual table are disclosed which enable complex data in the form of tables to be added to a conceptual table. The complex data can map to scalar values in a plurality of data tables. Complex data may be entered via data modeling methods, accessed via cursoring methods, and queried via query expansion methods.

Abstract: Systems and methods for modeling information from a set of documents are disclosed. A tool allows a user to extract and model concepts of interest and relations among the concepts from a set of documents. The tool automatically configures a database of the model so that the model and extracted concepts from the documents may be customized, modified, and shared.

Abstract: To reduce the processing load for processing structured data pieces in different representation forms, a path correspondence table storage area stores a path correspondence table having a correspondence between first position information for locating an item of a first structured data piece and second position information for locating the item of a second structured data piece, having a different representation form from that of the first structured data piece and corresponding to the item located by the first position information. If the first position information is specified, and a request for obtaining information relating to an item in the second structured data piece is received, a path converting section uses the path correspondence table to convert the first position information to the second position information and obtain the information relating to the item from the second structured data piece stored in a structured data storage area.

Abstract: An apparatus for processing an integrated query from various sensor networks and a method thereof are provided. The apparatus includes an integrated query parser for parsing an integrated query and analyzing a syntax of the parsed integrated query; an integrated query execution plan generator for analyzing meaning of the parsed integrated query and generating an integrated query execution query for processing an integrated query; an integrated query optimizer for optimizing a process time for the generated execution plan based on query information stored in the query information storage and sensor network information stored in the sensor network information storage; and an integrated query executer for detailing the integrated query execution plan by controlling an execution order according to the optimized integrated query and transferring the detailed integrated query execution plan to an event data process executer, a temporal data process executer, and a continuous data process executer.

Abstract: Software for providing a management interface comprises a descriptor file comprising at least one type for at least one resource and further comprising at least one attribute for each type. A management component associated with one of the resources describes at least one of the types. The management component is operable to provide a management interface exposing at least one of the attributes associated with each of the one or more types describing the resource.

Abstract: Systems and methods for allowing media recommendations to be hyped in a media recommendation system. Recommenders desiring to emphasize a particular media recommendations sent to recipients can “hype” the media recommendation. Hyping is a request for the media recommendation to be used or played sooner by the recipient that it otherwise would if the media recommendation were not hyped. Typically, hyping a media recommendation increases its priority or order of placement in a recipient's media queue, which controls the order of usage or play. The higher the placement, the sooner the media recommendation may be used or played by the recipient. A hype score may be calculated for a hyped media's recommendation to control the order of placement of hyped media recommendations in the recipient's media queue. The hype score may be a function of a hype value and a natural score as if the media recommendation were not hyped.

Abstract: A system and method of massively parallel data processing are disclosed. In an embodiment, a method includes generating an interpretation of a customizable database request which includes an extensible computer process and providing an input guidance to available processors of an available computing environment. The method further includes automatically distributing an execution of the interpretation across the available computing environment operating concurrently and in parallel, wherein a component of the execution may be limited to at least a part of an input data. The method also includes automatically assembling a response using a distributed output of the execution.

Abstract: A method and system to permit externally created business objects to access a business management application database without using direct database language statements. An add-on framework includes an add-on extension manager to start an add-on application, register a form from the add-on application, and receive and route an event from the business management application to the add-on application through a user interface application programming interface component object model interface. A persistency layer provides a set of programming language classes and interface definitions to develop a persistent business object in the add-on extension, and connect the persistent business object to a database through a data interface application programming interface component object model interface to read and write data from the database associated with the business management application.

Abstract: The present invention provides a virtual database as well as a method, system, and program product for generating a virtual database. Specifically, under the present invention, Service Data Objects (SDOs) corresponding to a plurality of database tables are provided within a virtual container. Once provided, two or more of the SDOs are interrelated to yield the virtual database (having a Virtual Bounded Persistent Memory). In accordance with the present invention, the database tables can be stored within a single (e.g., conventional) database, or databases. In addition, the virtual database can be generated and removed on-demand. Still yet, the virtual database of the present invention can be queried using standard Structured Query Language (SQL) queries.

Abstract: This invention is to present specific information necessary for maintenance of programs in an information system. This program analysis method includes: storing an entity that is an information unit as an object of a processing in a program into a relation table in association with an event affecting a processing for the entity; calculating importance degrees of the events by using data stored in the relation table; and identifying an event affecting a processing for a specific entity by using the data stored in the relation table, and calculating an influence degree of the specific entity by using the importance degree of the identified event. Because the user can grasp the influence degree of the entity, it becomes easy to grasp how much the update of the entity affects other portion in the information system.

Abstract: Disclosed are systems and methods for a management application accessing a database of interest, including the management application creating an object for indicating a unique identifier for a data item using a SET command; an agent storing the unique identifier in the restricted intermediate database; the management application creating an object for indicating a data type for the data item, the creating including use of a SET command; the agent storing the data type in the restricted intermediate database; the management application creating an object for indicating an action to be performed on the data item with respect to the database of interest, the creating including use of a SET command; the agent issuing an action command to perform the action; and the agent receiving a response and sending it to the management application.

Abstract: One embodiment of the present invention provides a system that facilitates managing metadata associated with entities and entity types in a computing system. During operation, the system initializes a global static metadata cache containing global static metadata at the computing system. Next, the system initializes a global dynamic metadata cache containing global dynamic metadata at the computing system. The system then receives a command to initialize a session at the computing system. In response to the command, the system determines a realm for the session, wherein the realm is a virtual private partition of the computing system. The system then initializes a realm-scoped dynamic metadata cache containing realm-scoped dynamic metadata associated with the realm at the computing system. Finally, the system executes operations on the computing system in compliance with the global static metadata, the global dynamic metadata, and the realm-scoped dynamic metadata.

Abstract: A collaboration server is described that enables both real-time conferencing and content management. Thus, client applications can connect to the server to share data and collaborate in real-time. The server allows fine grained sharing of any type of content using generic shared objects (GSO). Each GSO holds one or more pieces of persistent information and defines a list of people who are allowed to access the information. Each GSO also represents a persistent conferencing session, i.e., if clients modify GSOs, modifications are broadcast to all the other clients on the list of the shared object if they are connected. The server also manages relationships between shared objects; i.e., shared objects could be contained in other shared objects or reference other shared objects.

Abstract: The present invention presents a method, system and computer-implementable medium for remapping child references when parent reference updates are processed.

Abstract: Techniques are described for exchanging data between software applications, such as project-related data between a project management software application (“PMSA”) and an unaffiliated organizational project tracking software application (“OPTSA”). A mapping and other related information may be defined for the data exchange, such as by defining data fields of the OPTSA database and PMSA data file that correspond, and optionally specifying related information such as additional processing to be performed for various data fields during the data exchange, conditions when a mapping is to be used, ordering information for data fields during import and/or export, preferred data formats for stored values, etc. Also, in some situations round-trip data import/export is performed for a single PMSA data file, which may include tracking whether data entity instances previously existed in the destination in order to support changes to stored inter-relationships between data entity instances.

Abstract: The present invention generally relates to data processing, and more specifically to executing a query against a partitioned database. One embodiment provides a computer-implemented method of managing execution of a query against a partitioned database having a plurality of data partitions. The method comprises issuing a query for execution against each of the plurality of data partitions. Then, it is determined whether a complete query result is returned for the query before execution of the query has completed against each of the plurality of data partitions. If so, execution of the query is terminated on at least one of the plurality of data partitions.

Abstract: Embodiments of the present invention provide a system and method for summarizing and reporting the impact of database statements at a database appliance. The database appliance, according to one embodiment, can receive a database request and determine a set of information related to the request. Embodiments disclosed herein take in as input the database statement text and output multiple impact vectors, each containing both the name of an affected entity and a 32-bit “impact bitmap” for that entity. This concise and unambiguous output format can be computed using fast AND, OR, XOR, and NOT operations, allowing for highly efficient evaluation of database statements against user defined policies and finer policy granularity.

Abstract: A technique that provides a file plan including a plurality of containers, wherein each container is capable of providing management information for record information objects assigned to the container, wherein the record information objects represent documents, wherein the file plan comprises one or more segments. Each segment of the file plan at a first records management system is associated with one or more file plan object stores at one or more other records management systems. One or more file plan segments are propagated from the first records management system to the one or more file plan object stores at the one or more other records management systems.

Abstract: A data processor requires setting a plurality of items to a plurality of data sets. The data processor includes a setting unit, a determining unit, a first prompting unit, and a second prompting unit. The setting unit sets an item to a data set. The first prompting unit prompts the setting unit to change the setting of an item from the currently setting item by the setting unit to remaining one of the plurality of items other than the currently setting item when the determining unit determines that a data set which is set for the currently setting item satisfies a prescribed condition for the data set of the currently setting item.