Abstract: Provided are a method, system, and article of manufacture for using a data mining algorithm to generate format rules used to validate data sets. A data set has a plurality of columns and records providing data for each of the columns. Selection is received of at least one format column for which format rules are to be generated and selection is received of at least one predictor column. A format mask column is generated for each selected format column. For records in the data set, a value in the at least one format column is converted to a format mask representing a format of the value in the format column and storing the format mask in the format mask column in the record for which the format mask was generated. The at least one predictor column and the at least one format mask column are processed to generate at least one format rule. Each format rule specifies a format mask associated with at least one condition in the at least one predictor column.

Abstract: Servers in a storage system store a nested multilayer directory structure, and a global index that is an abstract of the directory structure. The global index identifies respective portions of the directory structure that are stored in respective ones of the servers, and the global index identifies paths through the directory structure linking the respective portions. Upon performing a top-down search of the directory structure in response to a client request and finding that a portion of it is offline, the global index is searched to discover portions of the directory structure that are located below the offline portion. The global index may also identify the respective server storing each of the respective portions of the directory structure, and may indicate whether or not each of the respective portions of the directory structure is known to be offline.

Abstract: A method for filter extraction in a service registry includes receiving a user's request in a registry for a list of items in the registry; generating a set of item results by the registry; passing the item results from the registry to a framework; retrieving a list of filter providers by the framework; determining whether all of the filter providers have been used; wherein if all have been used: displaying a list that includes a filter provider title, and one or more filters for each filter provider; wherein if all the filter providers have not been used: retrieving the next filter provider; calling the next filter provider; passing the item results to the next filter provider; determining which filters are applicable based on metadata of the item results; generating a list of applicable filters by the next filter provider; passing the list of applicable filters back to the framework.

Abstract: The approaches described herein provide an efficient way for a database server to process certain kinds of queries over XML data stored in an object-relational database that require the evaluation of a predicate expression with one or more path-based operands. A predicate expression part of a XQuery or SQL WHERE clause that returns a boolean value. A database server first determines whether the query qualifies for this particular kind of optimization, then rewrites the query using an enhanced query operator syntax for specifying the predicate expression to be evaluated. The enhanced query operator subsumes the work of a second path-based query operator, resulting in the suppression of the WHERE EXISTS subquery. The rewritten query operator is used to generate a query execution plan that provides for several query execution optimizations.

Abstract: Digit counts c? after the decimal point of attribute values in a structured document are acquired (S404). The detected attribute values are transformed into value character strings that represent integer values by manipulating the decimal point positions of the attribute values in accordance with a maximum digit count of the acquired digit counts (S406). The transformed value character strings and the maximum digit count C are encoded (S407).

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises concatenating at least a portion of the name of each object being stored into a hint; and storing the hint in an index. The portion of the name is the entire name, the first n characters, the last n characters, or every nth character, and this may be selected based on the application associated with the objects. Either the hint or the longest pathname containing the objects can be stored, and this may be selected based on the application.

Abstract: A function generator (MFG) formulates a query to a mapping database (DBM) based on a received planning geometry type (PGT) and receives corresponding function data (MFD) which is processed to create a function (MF). An evaluator (ELV) receives the function (MF) and an anatomical landmark set (LMS) and determines a computed planning geometry (CPG). A user interface (UI) displays a survey image (IMG), the landmark set (LMS), and the computer planning geometry (CPG) and allows the user to adjust the landmark set and/or the computer program geometry. A record generator (RG) creates a new record from the user adjusted landmarks (ULMS) and the user adjusted computer planning geometries (UPG) and loads the new records (NR) into the mapping database (DBM).

Abstract: An information processing apparatus according to an exemplary aspect of the invention includes a plurality of process units operable in parallel and a cache unit. The information processing apparatus executes a series of processes including access to a database through pipelining of the plurality of process units. The plurality of process units corresponds to a plurality of block process on a one-by-one basis. The series of processes are divided into the plurality of block processes such that reference of a content of data stored in the database by one of the plurality of process units is not followed by update of the data by any of others of the plurality of process units. Each of the plurality of process units executes one of the plurality of block processes at a predetermined timing. The plurality of block processes include a first block process including update of first data in the database. The plurality of process units includes a first process unit corresponding to the first block process.

Abstract: [PROBLEMS] To accurately calculate similarity between media data and a query even if the media data or its meta data has an error. [MEANS FOR SOLVING THE PROBLEMS] A similarity calculation device includes: a single score calculation device used when calculating similarity between first media data and a query, which calculates a single score that shows similarity between second media data different from the first media data and the query; an inter-media similarity calculation device which calculates inter-media similarity that shows the similarity between the second media data and the first media data; and a query similarity calculation device which obtains similarity between the first media data and the query by using the inter-media similarity of the second media data and the single score.

Abstract: A system and method for classifying structured data by automatically suggesting classification labels. The system comprises a taxonomy configured to provide one or more normalized labels and a classification tool configured to automatically classify data across an enterprise system using the one or more normalized labels. The method comprises extracting metadata from one or more relational databases; suggesting classifications based on the metadata; and converting one or more names to normalized labels across an enterprise system based on the suggested classifications.

Abstract: Methods and systems are provided for partitioning data of a database or data store into several independent parts as part of a data mining process. The methods and systems use a mining application having content-based partitioning logic to partition the data. Once the data is partitioned, the partitioned data may be grouped and distributed to an associated processor for further processing. The mining application and content-based partitioning logic may be used in a computing system, including shared memory and distributed memory multi-processor computing systems. Other embodiments are described and claimed.

Abstract: A synchronization process, and associated apparatus, for placing database copies in match with one another by way of communications effectuated upon an air interface of a radio communication system. Hash functions are performed at a mobile node and at a network part upon mobile and network copies of database information. Comparison of the hash information formed therefrom provides a preliminary indication of whether the databases are in match with one another. If a determination is made that the databases are out of match, the data is compared, and the data is placed in match with one another responsive to such additional comparisons.

Abstract: The present invention is directed to a method and system for managing large data sets (or studies) transferred from at least one acquisition device to a study process server in order to transfer the data sets to at least one review station. The method includes transferring a selected subset of the existing data sets to each review station, monitoring each review station for a login, and populating the review station with studies from at least one relevant working set upon detecting the login. In an alternate embodiment, the method may include sorting each received study into an appropriate working set, selecting a subset of the collected set of studies from at least one working set, and distributing the selected subset of studies to each review station.

Abstract: A log managing apparatus includes a collecting unit that receives a log from at least one collecting object that acquires the log including time information, a management unit that manages log format information set for each the collecting object, and a conversion unit that converts the log with reference to the log format information and extracts time information from the log.

Abstract: Provided are a method of generating a node identifier including padding information and location information, in a tree structure, a computer-readable storage medium storing a program for executing a method of generating a node identifier in a tree structure, and a terminal apparatus using the tree structure. The location information is generated by using branch identifiers, each of the branch identifiers being allocated for each branch from a root node to a target node. The padding information is generated by a padding code, which includes information about a group of the target node, and depth information, which includes information about a level of the target node in the tree structure.

Abstract: Methods and apparatus, including computer program products, for using a meta model for an enterprise service architecture. The meta model includes a first class to represent data organization in a back end data store. The first class includes a data type identifier attribute to permit meta data to identify a data type. The meta model also includes a second class associated with the first class. The second class includes a field identifier attribute to permit meta data to identify fields for a particular data type. The meta model also includes a third class associated with the first class. The third class includes an action identifier attribute to permit meta data to identify an action. In some examples, there is a service provider identifier to permit meta data to identify a service provider class that can effect the action.

Abstract: An information searching apparatus stores, in a character-string accumulating unit, first character strings in correspondence with second character strings while classifying each of the second character strings according to an attribute thereof. The information searching apparatus further stores, in a storage unit, the attributes in correspondence with specified information each of which is specified based on at least one of the corresponding first character string and the containing document. The information searching apparatus obtains specified information based on at least one of a first character string and a document that contains the first character string and extracts, from the storage unit, the attributes. The information searching apparatus then extracts, from the character-string accumulating unit, one of the second character strings.

Abstract: Systems and methods for accessing and distributing content objects. Various of the systems and methods utilize a number of content object entities that can be sources and/or destinations for content objects. A combination of abstraction and distinction engines can be used to access content objects from a source of content objects, format and/or modify the content objects, and redistribute the modified content object to one or more content object destinations. In some cases, an access point is included that identifies a number of available content objects, and identifies one or more content object destinations to which the respective content objects can be directed.

Abstract: In an embodiment, a constraint is created for a database table. The constraint specifies a condition for a first column in the database table and an action. The action specifies whether data that violates the condition is allowed to be stored in the first column. A value and a specification of a second column in the database table are received from a data source. If the second column is identical to the first column, the value violates the condition, and the action specifies that data that violates the condition is allowed to be stored, the value is stored in a row in the database, the row is marked as hidden, and an identification of the constraint that was violated is stored in the row. A query does not return the row that is marked as hidden.

Abstract: A computer program product is provided. The product comprises a computer usable medium having a computer readable program code embodied therein, the computer readable program code adapted to be executed to implement a method for converting between data objects constructed according to different software technologies. The method comprises providing a system comprising distinct software modules to perform the converting between data objects and processing a properties file to identify a first class associated with a first software technology based on a second class associated with a second software technology. The method also comprises analyzing the first class to identify a first attribute of the first class. The method also comprises constructing a first object of the first class and assigning a first value to the first attribute of the first object based on a second value of a second attribute of a second object of the second class.