Abstract: A system and method for updating, monitoring, and controlling applications on a workstation. The workstation includes a workstation management module configured to detect the launch or request to access a network by an application. A workstation application server receives data associated with the application from the workstation. The application server module can determine one or more policies or categories to associate with the application by referencing an application inventory database. Once the application server module has the category or policy, it forwards a hash/policy table to the workstation management module. Upon receipt of the hash/policy table, the workstation management module applies the policy that is associated with the application to control network access by the application.

Abstract: A system for distributing incoming client requests across multiple servers in a networked client-server computer environment processes all requests as a set that occur within a given time interval and collects information on the attributes of the requests and the resource capability of the servers to dynamically allocate requests in a set to the appropriate servers upon completion of the time interval. Preferably, a request table collects at least two requests incoming within a predetermined time interval, a request examiner routine analyzes each collected request with respect to at least one attribute, a system status monitor collects resource capability information of each server in a resource table and an optimization and allocation process distributes collected requests in the request table across the multiple servers upon completion of said time interval based on an optimization of potential pairings of the requests in the request table with servers in the resource table.

Abstract: At the heart of today's information-explosion problems are issues involving semantics, mutual understanding, concept matching, and interoperability. Ontologies and the Semantic Web are offered as a potential solution, but creating ontologies for real-world knowledge is nontrivial. If we could automate the process, we could significantly improve our chances of making the Semantic Web a reality. While understanding natural language is difficult, tables and other structured information make it easier to interpret new items and relations. In this paper we introduce an approach to generating ontologies based on table analysis. We thus call our approach TANGO (Table ANalysis for Generating Ontologies). Based on conceptual modeling extraction techniques, TANGO attempts to (i) understand a table's structure and conceptual content; (ii) discover the constraints that hold between concepts extracted from the table; (iii) match the recognized concepts with ones from a more general specification of related concepts; and (iv) merge the resulting structure with other similar knowledge representations. TANGO is thus a formalized method of processing the format and content of tables that can serve to incrementally build a relevant reusable conceptual ontology.

Abstract: In this paper, we propose a novel technique for automatic table detection in document images. Lines and tables are among the most frequent graphic, non-textual entities in documents and their detection is directly related to the OCR performance as well as to the document layout description. We propose a workflow for table detection that comprises three distinct steps: (i) image pre-processing; (ii) horizontal and vertical line detection and (iii) table detection. The efficiency of the proposed method is demonstrated by using a performance evaluation scheme which considers a great variety of documents such as forms, newspapers/magazines, scientific journals, tickets/bank cheques, certificates and handwritten documents.

Abstract: The present invention concerns methods and apparatus for implementing the ability to transpose rows and columns of a table displayed in a graphical user interface of a computer system. In embodiments of the invention, at least one in-line table row and column control is incorporated in the table; when selected, the in-line table row and column control causes information originally arrayed in columns to be displayed in rows, and causes information originally arrayed in rows to be displayed in columns. In other embodiments of the present invention, a user can select subsets of rows or columns for display in a transposed table with a filter function that operates in combination with the in-line table row and column control. After a filter selection is made, information contained in rows and columns not selected is filtered out and only information in selected rows and columns will be displayed in the transposed table.

Abstract: A technique is described where on-line players may participate in a table game involving physical elements such as a gaming table, players at the table, dealers, croupiers, betting chips, cards, dice, a roulette wheel, etc. The on-line players thus will have a more realistic experience than in a pure on-line system with all virtual elements. Electronic sensors in the table, or other detectors, sense the dealt cards and bets, and the data is communicated to the remote players. The remote players enter commands via a network (e.g., the Internet), and those commands are carried out at the physical table by the dealer placing bets for the player, dealing cards, or any other action. At the end of the session, the on-line players' accounts are debited or credited. If the on-line players are playing with physical betting chips, the on-line players' bet/won chips are appropriately distributed by the dealer to the player positions at the table. The players physically at the table play in a normal manner.

Abstract: Techniques are provided for indexing XML documents. According to one embodiment, a PATH table created for storing one row for each indexed node of the XML documents. The PATH table row for a node includes (1) information for locating the XML document that contains the node, (2) information that identifies the path of the node, and (3) information that identifies the position of the node within the hierarchical structure of the XML document that contains the node. If the node is associated with the value, then the PATH table row for the node may also include the value. Use of the PATH table to answer XPath queries is facilitated by secondary indexes.

Abstract: A table, such as a database table can be partitioned into blocks that are conveniently sized for storage and retrieval. The amount of storage space required and the speed of storing and retrieving blocks is proportional to the size of the blocks. Compressing the blocks leads to less required space and more speed. The columns in a table, and therefore the rows in a transposed block, tend to contain similar data. Compression algorithms can work more efficiently when sequential data items are similar. Therefore, transposing the blocks before compression or compressing them in a column-wise manner leads to better compression. Different compression algorithms can be used for each set of columnar data to yield even better compression.

Abstract: A method for filtering a table may include creating a filter in response to a user selecting data in a first table. The method may also include applying the filter to at least one other table in response to a user selecting at least one column in the at least one other table.

Abstract: There are many problems requiring a semantic account of a database schema At its best, such an account consists of mapping formulas between the schema and a formal conceptual model or ontology (CM) of the domain This paper describes the underlying principles, algorithms, and a prototype of a tool which infers such semantic mappings when given simple correspondences from table columns in a relational schema and datatype properties of classes in an ontology Although the algorithm presented is necessarily heuristic, we offer formal results stating that the answers returned are “correct” for relational schemas designed according to standard Entity-Relationship techniques We also report on experience in using the tool with public domain schemas and ontologies

Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table. The back-join is supported from a single-table indexed view to the base table via a unique clustering key which acts as a logical row locator. Thus, the system can back-join to the base table from an indexed view via the unique clustering key. These features allow the use of indexed views to index a table on the contents of multi-set or multi-valued attributes.

Abstract: In this paper, a message-oriented architecture for large database summarization is presented. The summarization system takes a database table as input and produces a reduced version of this table through both a rewriting and a generalization process. The resulting table provides tuples with less precision than the original but yet are very informative of the actual content of the database. This reduced form can be used as input for advanced data mining processes as well as some specific application presented in other works. We describe the incremental maintenance of the summarized table, the system capability to directly deal with XML database systems, and finally scalability which allows it to handle very large datasets of a million record.

Abstract: The invention concerns a detection of duplicate tuples in a database. Previous domain independent detection of duplicated tuples relied on standard similarity functions (e.g., edit distance, cosine metric) between multi-attribute tuples. However, such prior art approaches result in large numbers of false positives if they are used to identify domain-specific abbreviations and conventions. In accordance with the invention a process for duplicate detection is implemented based on interpreting records from multiple dimensional tables in a data warehouse, which are associated with hierarchies specified through key—foreign key relationships in a snowflake schema. The invention exploits the extra knowledge available from the table hierarchy to develop a high quality, scalable duplicate detection process.

Abstract: A system for managing computers in a distributed computer network includes a collection agent for each computer being monitored, a local database coupled to each collection agent, one or more condensing agents coupled to the databases, and at least one console module. The condensing agent generates an index table from a source database and sends it upstream to the next level up in the hierarchy of databases. Other condensing agents may in turn act on this index table and send it up to a still further level, until a top-level master node has an index table reflecting the entire network. The console can use the index table to identify what databases contain needed data, and then make only selective connections to databases to answer queries, avoiding connections to all the local databases. The condensing agent also produces summarized data and sends it upstream as well, to be used by the console. Efficiency is improved over conventional systems. Use of the index method and the summary method can be transparent to (hid from) the use of the console, or may be made visible, with selection options.

Abstract: A method of integrating syntactically valid medical images into a database management system. A database table is created and a database object is initialized with a medical image object. The medical image object is parsed. An XML representation of metadata associated with the medical image object is created and the database object is inserted in the table.

Abstract: A system and method are provided for incorporating a jackpot into an electronic poker game played at electronic poker tables having a plurality of electronic player interaction areas (EPIAs). The system includes a game computer for administering the electronic poker game and a jackpot administrator for administering the jackpot. The jackpot administrator monitors the EPIAs of each of the players for predetermined jackpot events such as predetermined card sequences, consecutive losses, etc, and then awards the jackpot when the predetermined jackpot events are detected.

Abstract: A gaming table with multiple sensing devices on or proximate the table. Each sensing device or groups of devices has a separate intelligent module that senses changes in the sensing devices, as through a state change signal from the sensor. The module date stamps and transmits the data over a network to an external database. The modules broadcast information over a network, such as an Ethernet.

Abstract: In a first aspect, a method is provided for transferring data. The method includes the steps of (1) receiving information about a location and type of a data source and a location and type of a data destination associated with a first data transfer from the data source to the data destination; (2) receiving information relating data in the data source to data in the data destination; (3) creating a data structure that defines a relationship between the data source and the data destination based on the received information; and (4) employing the data structure for the first data transfer. The data structure is adapted to transfer data from a single table in the data source to multiple tables in the data destination and transfer data from multiple tables in the data source to a single table in the data destination. Numerous other aspects are provided.

Abstract: A session management server, which is provided with a service determination table having a plurality of entries each indicating a service identifier in association with possible particular items of information which may be extracted from a session setup request packet, receives a session setup request packet issued from a client to a particular application server and determines whether the client terminal is authorized to receive an information service by referring to the determination table, in place of the particular application server. When the determination results in success, the session setup request packet is forwarded to the particular application server.

Abstract: Radio Frequency Identification (RFID) based item-level tracking holds the promise of revolutionizing supply-chain, retail store, and asset management applications. However, the high volume of data generated by item-level tracking poses challenges to the applications as well as to backend databases. This paper addresses the problem of efficiently modeling identifier collections occurring in RFID-based item-tracking applications and databases. Specifically, 1) a bitmap datatype is introduced to compactly represent a collection of identifiers, and 2) a set of bitmap access and manipulation routines is provided. The proposed bitmap datatype can model a collection of generic identifiers, including 64-bit, 96-bit, and 256-bit Electronic Product Codes™ (EPCs), and it can be used to represent both transient and persistent identifier collections. Persistent identifier collections can be stored in a table as a column of bitmap datatype. An efficient primary B+- tree-based storage scheme is proposed for such columns. The bitmap datatype can be easily implemented by leveraging the DBMS bitmap index implementation, which typically manages bitmaps of table row identifiers. This paper presents the bitmap datatype and related functionality, illustrates its usage in supporting RFID-based item-tracking applications, describes its prototype implementation in Oracle DBMS, and gives a performance study that characterizes the benefits of the bitmap datatype.

Abstract: A Web services access management system which enables loosely coupled Web services can include a servlet configured to receive incoming request messages to access business logic and a mapping table associating different ones of the request messages with different business logic. Mapping logic can be disposed between the servlet and the business logic and configured to route at least part of the incoming request messages to selected ones of the business logic according to the mapping table. Finally, the system can include a response builder configured to build responses with data produced by the business logic responsive to processing incoming request messages routed by the mapping logic. In this regard, changes to the mapping logic can remain transparent to clients transmitting request messages and the business logic servicing the requests.

Abstract: A system and method to manage the pre-authentication service by providing a network-centric, managed list of neighboring/logical access points from which a wireless station should pre-authenticate. An access point is provided with a pre-authentication table. When a wireless station associates with the access point, the access point transmits the pre-authentication table to the client. The client responsive to receiving the table only pre-authenticates with neighboring access points on the table.

Abstract: The TABLE function mechanism available in a RDBMS is used to integrate RDF models into SQL queries. The table function invocation takes parameters including an RDF pattern, an RDF model, and an RDF rule base and returns result rows to the SQL query that contain RDF triples resulting from the application of the pattern to the triples of the model and the triples inferred by applying the rule base to the model. The RDBMS includes relational representations of the triples and the rules. Optimizations include indexes and materialized views of the representations of the triples, precomputed inferred triples, and a method associated with the TABLE function that rewrites the part of the SQL query that contains the TABLE function invocation as an equivalent SQL string. The latter technique is generally applicable to TABLE functions.

Abstract: A dynamic Quality of Service (QoS) management apparatus includes: a management server having a database, the management server storing system performance information data collected from a network element (NE) system and dynamic user core management information generated by a user's selection in a table of the database; and a client manager to generate system performance information by referring to the dynamic core management information stored in the database and displaying a status information corresponding to the dynamic user core management information. The management for generating/modifying/deleting the new Key Performance Indicator (KPI) by performing the four rules of arithmetic on the different data (multi DB table attributes) can be performed without stopping the system operation such that the requirements for managing the QoS with compound characteristics due to various functions and policies of different standards can be satisfied.

Abstract: We have proposed a chaotic cryptographic scheme based on iterating the logistic map and updating the look-up table dynamically. However, it has been broken recently. In this paper, the weaknesses of the original dynamic look-up table scheme are analyzed and a more secure chaotic encryption scheme based on this dynamic look-up table concept is proposed. Theoretical analysis indicates that the modified scheme can resist the reported attacks. Moreover, simulation results show that this encryption scheme leads to a flat ciphertext distribution.

Abstract: A Personal Video Recorder (PVR) generates an object index table in real-time that can be updated while streaming media is being encoded and stored in memory. This allows more dynamic video trick mode operations such as fast forward, reverse and skip. The PVR also provides automatic data rate control that prevents video frames from being dropped thus preventing jitter in the output media.

Abstract: The present invention provides restaurant management method (M1) in which a customer operates a computing device (DC1) to make requests. A waiter can fulfill the request on the next visit to the customer's table (TB1), instead of having to visit the table first to obtain the request and requiring a second visit to fulfill the request.