Abstract: According to embodiments, systems and methods for tracking gift card usage improve the speed and efficiency of anomalous transaction detection. Individual transaction data is enriched to form parent records that include indicators that the card is being used outside of established usage criteria or in a way that is otherwise abnormal. Machine learning can improve upon anomalous transactions more quickly using this enriched, parent-level information.

Abstract: Methods, systems, and computer program products are included for defining a partitioning strategy corresponding to an attribute, creating tables and inserting data into the tables according to the partitioning strategy, detecting triggering events, and responsive to the triggering events, dynamically activating tables for storing data.

Abstract: A method for organizing images from multiple image capture devices includes automatically determining a coarse offset between image capture times recorded in a first image capture device and image capture times recorded in a second image capture device. The coarse offset is determined by a computing a correlation between image counts of images captured by the first image capture device and images captured by the first image capture device. The method also includes adjusting the image capture times of images recorded in the second image capture device by the coarse offset to produce adjusted image capture times for images captured by the second image capture device.

Abstract: A method of classifying data is disclosed. Text data items are received. A set of classes into which the text data items are to be classified is received. A phrase-based classifier to classify the text data items into the set of classes is selected. The phrase-based classifier is applied to classify the text data items into the classes. Here, the applying includes creating a controlled vocabulary pertaining to classifying the text data items into the set of classes, building phrases based on the text data items and the controlled vocabulary, and classifying the text data items into the set of classes based on the phrases.

Abstract: The invention provides a system and method for retrieving and storing industrial data, the system comprising a data retriever that includes a data retrieval manager and one or more watchers for monitoring data associated with one or more industrial devices, wherein if the data associated with the one or more industrial devices is new or modified, the one or more watchers notifies the data retrieval manager thereof and the data retrieval manager uploads the new or modified data. The system further includes a database manager for receiving the new or modified data in a first form from the data retrieval manager and for storing the new or modified data in a structural data form in one or more databases.

Abstract: Methods and apparatus for document encoding using block encoding of text are disclosed. A computing device is configured to detect, within a digitized image object, a plurality of element groups, where each group comprises one or more text image elements and is separated from other groups by at least one delimiter. The device generates a numerical representation of the groups, comprising a plurality of numerical values, where a particular value corresponding to a particular group is determined based at least in part on a combined size of text image elements of the particular group. The device stores at least a subset of the numerical representation as a fingerprint representing text contents of the digitized image object.

Abstract: Systems and methods that create and edit a network of interconnected concepts are disclosed. In one embodiment, a semantic engine implements a method comprising receiving a primary term representing a first concept to be added to a network of interrelated concepts, receiving at least one related term related to the primary term, receiving at least one relationship between the first concept and a second concept, receiving a strength value associated with the relationship, and adding the first concept to the network.

Abstract: Spooling strategies are described for producing job information that conforms to a hierarchical structure, and then storing the job information in a spool storage. The job information is then retrieved from the spool storage and consumed. The structured job information includes a multi-level hierarchy of nodes, including a job level that represents the entire job, a document level that represents a document to be processed within the job; a rendition level that represents a rendition of the document to be processed; and a page level that represents a page associated with the rendition. In addition, filter logic processes job information based on capabilities of a target entity utilizing the job information.

Abstract: Apparatus, systems, and methods may operate to receive a request to move at least a portion of a database table stored on a tangible medium from a current partition to a history partition, wherein the database table is partitioned into physical partitions according to a selected mapping update frequency. In response to receiving the request, activities may include modifying a logical partitioning of the database table by updating a mapping of the physical partitions to logical partitions. Other apparatus, systems, and methods are disclosed.

Abstract: An approach for responding to a text-based query for a digital image is provided. A request that identifies one or more keywords is received. A number of annotated digital images are selected based on a previously determined optimum quantity of annotated digital images. Composite data is gathered from each annotated digital image and a set of candidate digital images is selected based on the composite data. The set of candidate images are the digital images, of a set of digital images, which have a visual appearance that is most similar to the composite data. A response is generated that identifies those digital images which are most responsive to the one or more keywords. Alternatively, a partitioned response is generated which identifies dissimilar sets of digital images.

Abstract: A system and method for creating a unique alias associated with an individual identified in a health care database such that health care data, and particularly pharmaceutical-related data, can be efficiently gathered and analyzed. The system has a first data store for storing at least one record where each record includes a plurality of identification fields which when concatenated uniquely identify an individual, and at least one health care field corresponding to health care data associated with the individual. The system also has a second data store, and a processor. The processor selects a record of the first data store, then selects a subset of the plurality of identification fields within the selected record, and concatenates the selected subset of identification fields. Then the processor stores the concatenated identification fields in a record in the second data store with the at least one health care field from the selected record of the first data store.

Abstract: A system protects database operations performed on a shared resource. The system may chunk memory to form a set of memory chunks which have memory blocks, at least some of the memory blocks including database objects. The system may configure at least one binary search tree using the memory chunks as nodes and buffer a set of pointers corresponding to the memory blocks. The system may further validate the buffered pointers and dereference validated buffered pointers.

Abstract: A computer-implemented method for managing price information. Embodiments include receiving a mapping of interconnected components, identifying as a first subset components subject to a first fixed price agreement not subject to a second fixed price agreement that overlaps the first fixed price agreement, identifying as a second subset the components subject to the second fixed price agreement not subject to the first fixed price agreement, and identifying as a third subset the components subject to both the first fixed price agreement and the second fixed price agreement. The method also includes receiving a price change for a price associated with a component in one of the subsets of components, and distributing an offset of the price change to components in the other subsets of components.

Abstract: A method for indexing a plurality of nodes using a computer system is provided. The computer system includes data storage and a processor coupled to the data storage. The method includes acts of storing the plurality of nodes in the data storage, each of the plurality of nodes having a hit count, a link count and an outcome, creating a qualitative index ordering a plurality of nodes according to the hit count, the link count and the outcome of each node and storing the qualitative index in the data storage. The hit count of each node indicates a number of times a case attribute associated with the node is presented to a user. The link count of each node indicates a number of times the case attribute associated with the node is affirmed as useful. The outcome of each node indicates a desirability of the outcome.

Abstract: A system for detecting a local phenomenon, the system includes an interface for receiving queries information from a system for retrieving art related media, and a processor, configured to: (a) create a first local popularity chart, wherein the creating of the first local popularity chart includes enumerating, for each geographic area of a group of sampled geographic areas, identical query strings of queries that are included in a group of queries; (b) create a first global popularity chart, wherein the creating of the first global popularity chart includes enumerating identical query strings of the queries that are included in the group of queries; and (c) select at least one query string in response to a scoring of the query string at the first local popularity chart and to a scoring of the query string at the first global popularity chart; wherein the group of queries includes queries which were queried during a first period of time.

Abstract: One embodiment of the present invention provides a method for incrementally maintaining a Bernoulli sample S with sampling rate q over a multiset R in the presence of update, delete, and insert transactions. The method includes processing items inserted into R using Bernoulli sampling and augmenting S with tracking counters during this processing. Items deleted from R are processed by using the tracking counters and by removing newly deleted items from S using a calculated probability while maintaining a degree of uniformity in S.

Abstract: Systems and methods that create and edit a network of interconnected concepts are disclosed. In one embodiment, a semantic engine implements a method comprising receiving a primary term representing a first concept to be added to a network of interrelated concepts, receiving at least one related term related to the primary term, receiving at least one relationship between the first concept and a second concept, receiving a strength value associated with the relationship, and adding the first concept to the network.

Abstract: The present invention provides a method and device for creating a relation-type form database, the method comprising: displaying an existing form as a background image on a screen; drawing frames on predetermined positions of the background image with an operation means to create multiple data areas; and creating parallel relations and/or cross relations among the multiple data areas to form a relation-type database of the existing form. The operations of the present invention are easy and low-cost, which enable widely spreading of the application of databases.

Abstract: A computer implemented method, apparatus, and computer usable program code for deleting rows in a multidimensionally clustering database. A multidimensional clustering processor receives a request to delete a set of multidimensionally clustering data. The multidimensional clustering processor determines whether all multidimensionally clustering data is located in a block. Responsive to all multidimensionally clustered data qualifying for deletion, the multidimensional clustering processor deletes all data in the block to delete the set of multidimensionally clustered data.

Abstract: A method and system for contract processing. Sent by a procurement contract management system (PCMS) to decentralized execution systems is a list of I identifiers identifying a contract dataset in the PCMS earmarked for archiving. The PCMS receives from each DES a return list of M of the I identifiers approved by each DES for archiving. A generated intersection list includes a logical intersection of the return lists received from the decentralized execution systems. If the intersection list is not empty, the PCMS archives each contract dataset identified in the list of I identifiers and appearing in the intersection list and communicates to each DES that the archiving was performed by the PCMS for the contract datasets appearing in the intersection list. If the intersection list is empty, the PCMS communicates to each DES that the archiving will not be performed.

Abstract: A method and system thereof for identifying records are described. Records on a node are distinguished from other records on the node by assigning each record a unique local identifier. When a record is moved from one node to another node, a unique global identifier is assigned to the record. A translation technique is employed to map the local identifier to the global identifier (and vice versa).

Abstract: The location of a drawing of an activity, a property of an element in the drawing and the structural relationship of elements in the drawing are stored in a database. The database is accessed to form a user interface that provides a hierarchical representation of activities and the elements within activities.

Abstract: A data structure comprising a first set of data fields wherein each data field contains data representing a managed object of an object-oriented model; a second set of data fields wherein each data field contains data representing an instance of a collection class; a third set of data fields wherein each data field contains data representing an instance of a first association class; a fourth set of data fields wherein each data field contains data representing an instance of a data source class; and a fifth set of data fields wherein each data field contains data representing an instance of a second association class. At least one data field of the first set is associated with a data field of the second set by a data field of the third set, and the data field of the second set is also associated with a data field of the fourth set by a data field of the fifth set. An information handling system readable medium having stored thereon said data structure. Methods for modifying data of the data structure.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting reference partitioned tables in a relational database are described. One example method includes identifying a partitioning strategy (e.g., range, list, hash) associated with a parent table that is related to a child table by a referential constraint. The example method may also include creating the child table to be a reference-partitioned table partitioned according to the partitioning strategy associated with the parent table. The example method may also include creating the child table to be equi-partitioned with respect to the parent table. The child table is not to replicate a partition key of the parent table but rather is to inherit a partitioning key associated with the parent table through a foreign key relationship.

Abstract: A system and method for providing semantic access of data in a master data management system. Data stored in a dynamic repository schema is exposed in a semantically accurate format. The schema is determined from information received from the master data management system describing the schema. A set of database views is generated based on said schema. A query from an external application in a standard query language is received and the query is performed using at least one database view. The database views are updated when a schema change is detected.

Abstract: Techniques are provided for maintaining high propagation availability for non-persistent messages. Destination-to-instance mapping information is provided to a listener process for a cluster database. The destination-to-instance mapping indicates the current owner instance of each single-instance destination within the cluster database. To establish a connection to a single-instance destination, a sending process sends a connection request to the global listener. The connection request identifies the desired destination queue, but not the owner instance of the queue. The global listener for the cluster database uses the destination-to-instance mapping to determine which instance is the current owner of the specified queue, and establishes a connection between the sending process and the appropriate owner instance.

Abstract: A system protects database operations performed on a shared resource. The system may chunk memory to form a set of memory chunks which have memory blocks, at least some of the memory blocks including database objects. The system may configure at least one binary search tree using the memory chunks as nodes and buffer a set of pointers corresponding to the memory blocks. The system may further validate the buffered pointers and dereference validated buffered pointers.

Abstract: A minimal perfect hash function can be created for input data by dividing the input data into multiple collections, with each collection comprising fewer elements that the input data as a whole. Subsequently, minimal perfect hash functions can be created for each of the collections and the resulting hash values can be offset by a value equivalent to the number of input data in preceding collections. The minimal perfect hash function can, thereby, be derived in parallel and can consume substantially less storage space. To further save storage space, the internal state of each individual minimal perfect hash function can be further compressed using algorithms exploiting a skewed distribution of values in a lookup table comprising the internal state.

Abstract: To manage data flow in generating profile models for use in optical metrology, a project data object is created. A first profile model data object is created. The first profile model data object corresponds to a first profile model defined using profile parameters. A version number is associated with the first profile model data object. The first profile model data object is linked with the project data object. At least a second profile model data object is created. The second profile model data object corresponds to a second profile model defined using profile parameters. The first and second profile models are different. Another version number is associated with the second profile model data object. The second profile model data object is linked with the project data object. The project data object, the first profile model data object, and the second profile model data object are stored.

Abstract: Methods and systems for computing algebraic equations are disclosed, with particular relevance to financial analytics. Analytic formulas may be represented as data, and the analytic system may be structured as a kind of an analytic interpretation engine in a database layer of a system. Because analytic formulas may be represented as data in some table or tables, analytics can be added, deleted or modified without having to make changes to the analytic engine's source code. The analytic engine may be implemented in some relational language, such as a dialect of SQL, to manipulate and compute the analytic formulas stored in the database.

Abstract: The concept of portioning is expanded with a variety of techniques. In particular, one technique involves partitioning an object at multiple levels, where at least one of the levels uses list-based partitioning. Further, a partitioning technique is provided which involves storing a data item in a default partition when the item does not map to any one of the list-based partitions for which a key value group has been defined. Techniques are also provided for efficiently splitting a partition.

Abstract: The present invention provides a data structure recorded in a recording medium, data recording method and data recording apparatus, in which data are recorded in a high-density recording medium such as a Blu-ray disc. In recording data per cluster within a recording medium, a data structure recorded in the recording system is characterized in that the data includes an address unit in which a plurality of per recording unit address fields included in a corresponding cluster and a control information field indicating per recording unit attribute are recorded and in that each information configuring the control information field is identified by byte unit.

Abstract: To manage data flow in generating different signal formats for use in optical metrology, a project data object is created. A first option data object is created. The first option data object has a set of signal parameters. Different settings of the set of signal parameters correspond to different signal formats for diffraction signals. A version number is associated with the first option data object. The first option data object is linked with the project data object. At least a second option data object is created. The second option data object has a set of signal parameters. Different settings of the set of signal parameters correspond to different signal formats for diffraction signals. The set of signal parameters of the first option data object and the set of signal parameters of the second option data object are set differently. Another version number is associated with the second option data object. The second option data object is linked with the project data object.

Abstract: In a database whose entries contain values organized in categories, a first query is performed that includes input query values respectively associated with at least some of the categories and that seeks entries whose values match each input query value. Upon finding no entries, a category whose input query value to eliminate is identified. A second query is performed that includes the input query values except for the identified at least one category. The second query seeks any of the entries whose values match each of the input query values of the second query and that has no specified value for the identified at least one category. A data structure is configured to indicate an order that at least some of several categories will be eliminated when generating a new query after a previous query does not result in a match among entries of a database.

Abstract: Documents are clustered or categorized to generate a model associating documents with classes. Outlier measures are computed for the documents indicative of how well each document fits into the model. Outlier documents are identified to a user based on the outlier measures and a user selected outlier criterion. Ambiguity measures are computed for the documents indicative of a number of classes with which each document has similarity under the model. If a document is annotated with a label class, a possible corrective label class is identified if the annotated document has higher similarity with the possible corrective label class under the model than with the annotated label class. The clustering or categorizing is repeated adjusted based on received user input to generate an updated model associating documents with classes. Outlier and ambiguity measures are also calculated at runtime for new documents classified using the model.