Abstract: This paper is a short summary of the main classes defined in the ade4 package for one table analysis methods (e.g., principal component analysis). Other papers will detail the classes defined in ade4 for twotables coupling methods (such as canonical correspondence analysis, redundancy analysis, and coinertia analysis), for methods dealing with K-tables analysis (i.e., three-ways tables), and for graphical methods. This package is a complete rewrite of the ADE4 software (Thioulouse et al. (1997), http://pbil.univlyon1.fr/ADE-4/) for the R environment. It contains Data Analysis functions to analyse Ecological and Environmental data in the framework of Euclidean Exploratory methods, hence the name ade4 (i.e., 4 is not a version number but means that there are four E in the acronym). The ade4 package is available in CRAN, but it can also be used directly online, thanks to the Rweb system (http://pbil.univ-lyon1.fr/Rweb/). This possibility is being used to provide multivariate analysis services in the field of bioinformatics, particularly for sequence and genome structure analysis at the PBIL (http://pbil.univ-lyon1.fr/). An example of these services is the automated analysis of the codon usage of a set of DNA sequences by correspondence analysis (http://pbil.univ-lyon1.fr/ mva/coa.php).

Abstract: Table characteristics vary widely. Consequently, a great variety of computational approaches have been applied to table recognition. In this survey, the table recognition literature is presented as an interaction of table models, observations, transformations, and inferences. A table model defines the physical and logical structure of tables; the model is used to detect tables and to analyze and decompose the detected tables. Observations perform feature measurements and data lookup, transformations alter or restructure data, and inferences generate and test hypotheses. This presentation clarifies both the decisions made by a table recognizer and the assumptions and inferencing techniques that underlie these decisions.

Abstract: A configuration management system creates ( 602 ) each configuration by assigning a configuration identifier to each configuration. In addition, relational information is computed ( 706 ) that indicates the relationships between the configuration and any configurations upon which it is based. The system then tracks ( 604 ) changes to files of the configuration by storing information associating each new file version with the configuration identifier. The system also tracks ( 1210 ) changes to file properties. A configuration is then reconstructed ( 608 ) as of a desired date, by identifying ( 2104, 2106 ) the file versions and properties associated with that configuration as of the desired date. A determination is made ( 2110 ) whether a user that has requested the file versions has access privileges by first checking a security cache ( 2600 ) for the user privileges information. If the information is not on the cache, it is computed from a security table ( 2800 ) and stored on the cache. The system automatically compresses ( 3118 ) and reconstitutes ( 3006 ) file versions that are stored in the version store.

Abstract: Many Web sites, especially those that dynamically generate HTML pages to display the results of a user's query, present information in the form of list or tables. Current tools that allow applications to programmatically extract this information rely heavily on user input, often in the form of labeled extracted records. The sheer size and rate of growth of the Web make any solution that relies primarily on user input is infeasible in the long term. Fortunately, many Web sites contain much explicit and implicit structure, both in layout and content, that we can exploit for the purpose of information extraction. This paper describes an approach to automatic extraction and segmentation of records from Web tables. Automatic methods do not require any user input, but rely solely on the layout and content of the Web source. Our approach relies on the common structure of many Web sites, which present information as a list or a table, with a link in each entry leading to a detail page containing additional information about that item. We describe two algorithms that use redundancies in the content of table and detail pages to aid in information extraction. The first algorithm encodes additional information provided by detail pages as constraints and finds the segmentation by solving a constraint satisfaction problem. The second algorithm uses probabilistic inference to find the record segmentation. We show how each approach can exploit the web site structure in a general, domain-independent manner, and we demonstrate the effectiveness of each algorithm on a set of twelve Web sites.

Abstract: A user inputs evaluation for a content on an electronic program table and specifies a search condition on a screen. A content selection device evaluates the content according to these inputs, distinguishes/displays a content recommended in the electronic program table, and displays recommended contents in a list. Thus, it is possible to recommend a content according to a user’s preference without causing a load on the user.

Abstract: The present invention provides a computerised information system method and structured, hierarchical model for capturing, aggregating and visualising structural data of architectures of technical equipment such as IT architectures, comprising: at least one data capture engine (100, 300, 500, 520, 530) for capturing and aggregating data based on a structured, hierarchical model (10); a display engine (200, 510) for generating a plurality of different displays of the captured data in dependency of the structured hierarchical model (10), wherein the data capture engine (100, 300, 500, 520, 530) comprises at least one database (300, 500) for storing the data according to the structured, hierarchical model (10) and wherein the structured, hierarchical model (10) preferably comprises a model table containing one or more major attributes of the model, such as the name, type and version of the model, a Node-Class table containing information regarding the types of nodes that the model (10) contains, and a Node table containing the definition of each node within the model (10) and the node's corresponding hierarchy information.

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. The module date stamps and transmits the data over a network to an external database.

Abstract: A method and apparatus for defining and processing aggregate data is disclosed. Using database abstraction techniques, a set of logical fields may be used to compose queries of a set of underlying physical data sources. In one embodiment, a logical field may represent an aggregate data value calculated from the elements appearing in a column of a relational table in an underlying physical data source. The elements may be divided into to subsets to calculate multiple aggregate values. An abstract derived entity is a data object present in a database abstraction model that may be accessed as though it were a relational table contained in an underlying physical data source. In one embodiment, columns of the table defined by the abstract derived entity may be populated with aggregate data values joined to other data as specified by a composition rule included in the definition of the abstract derived entity.

Abstract: Mixed Presence Groupware (MPG) supports both co-located and distributed participants working over a shared visual workspace. It does this by connecting multiple single-display groupware workspaces together through a shared data structure. Our implementation and observations of MPG systems exposes two problems. The first is display disparity, where connecting heterogeneous tabletop and vertical displays introduces issues in how one seats people around the virtual table and how one orients work artifacts. The second is presence disparity, where a participant's perception of the presence of others is markedly different depending on whether a collaborator is co-located or remote. This is likely caused by inadequate consequential communication between remote participants, which in turn disrupts group collaborative and communication dynamics. To mitigate display and presence disparity problems, we determine virtual seating positions and replace conventional telepointers with digital arm shadows that extend from a person's side of the table to their pointer location.

Abstract: Various methods are disclosed for monitoring user browsing activities that indicate user interests in particular products, or other items, represented in an electronic catalog, and for using such information to identify items that are related to one another. In one embodiment, relationships between items within an electronic catalog are determined by identifying items that are frequently viewed by users within the same browsing session (e.g., items A and B are related because a significant portion of those who viewed A also viewed B). The resulting item relatedness data may be stored in a table that maps items to sets of related items. The table may be used to provide personalized item recommendations to users, and/or to supplement item detail pages of the electronic catalog with lists of related items. In one embodiment, the table is used to provide session-specific item recommendations to users.

Abstract: The subject invention relates to systems and methods that provide electronic data (e.g., Electronic Product Code (EPC) data) obtained from Radio Frequency Identification (RFID) tags by RFID readers and/or from servers to one or more industrial components (e.g., controllers, programmable logic controllers, modules, etc.). The systems and methods employ component that processes, if desired, and stores received electronic data as records within a table. Processing includes filtering for data of interest and/or formatting the data in a suitable structure. Storage can include delineating related electronic data across rows the table and types of data across columns of a row. Upon receiving a subscription and/or request for electronic data from the one or more industrial components, the data can be retrieved and conveyed to the subscribing and/or requesting components.

Abstract: A method of providing operational commands to a AV program transmitted using HTTP protocol includes storing an AV program in a server; generating meta data in the server, wherein the meta data includes a mapping table associating time ranges for the AV program to byte ranges for the AV program; transmitting the meta data and mapping table to a client/player associated with the server; generating and transmitting a HTTP GET command from the client/player to the server as a function of a desired operational command; and selecting appropriate I-frames in the server and transmitting the I-frames to the client/player in response to the HTTP GET command.

Abstract: Information extraction from tables in web pages is a challenging problem due to the diverse nature of table formats and the vocabulary variants in attribute names. This paper presents a new approach to automated table extraction that exploits formatting cues in semi-structured HTML tables, learns lexical variants from training examples and uses a vector space model to deal with non-exact matches among labels. We conducted experiments with this method on a set of tables collected from 157 university web sites, and obtained the information extraction performance of 91.4% in the Fl-measure, showing the effectiveness of the combined use of structural table parsing and example-based label learning.

Abstract: The main contributions of this thesis are, firstly, proposing the Bottleneck Congestion Avoidance algorithm and technique that enhances the use of suggestion label in RSVP-TE to reduce the delay and blocking cost during wavelength assignments; secondly, proposing the Traffic Engineering technique that uses explicit routing and the proposed Proper Suggested Label Selection (PSLS) table to distribute the network resources and to provide fast wavelength allocation. This technique also uses the proposed Lambda Blocking Check Algorithm (LBCA) that inexpensively and efficiently checks resources availability through the optical network. The proposed technique enhances the network utilization by reducing the blocking probabilities. (Abstract shortened by UMI.)

Abstract: A method and system improves efficiency of highly concurrent aggregate summaries updates by delaying the updates to as late as possible in the transaction, while maintaining an accurate in-progress aggregate summary for use by transaction in progress. The system uses a temporary table to store updates to aggregate summaries and consolidates the temporary table with the aggregate summary to create a view of the accurate in-progress data for use by the transaction. Prior to the transaction commit, the system converts the contents of the temporary delta table into a single-statement consolidated update of the inventory summary table, reducing throughput delays caused by write locks early in the transaction.

Abstract: Due to deterministic and fast lookup performance, ternary content addressable memory (TCAM) has recently been gaining popularity in general policy filtering (PF) for packet classification in high-speed networks. However, the PF table update poses significant challenges for efficient use of TCAM. To avoid erroneous and inconsistent rule matching, the traditional approach is to lock the PF table during the rule update period, but table locking has a negative impact on data path processing. In this paper, we propose a novel scheme, called Consistent Policy Table Update Algorithm (CoPTUA), for TCAM. Instead of minimizing the number of rule moves to reduce the locking time, CoPTUA maintains a consistent PF table throughout the update process, thus eliminating the need for locking the PF table while-ensuring correctness of rule matching. Our analysis and simulation show that, even for a PF table with 100,000 rules, an arbitrary number of rules can be updated simultaneously within 1 second in the worst case, provided that 2 percent of the PF table entries are empty. Thus, CoPTUA enforces any new rule in less than 1 second for practical PF table size with high memory utilization and without impacting data path processing.

Abstract: A record management system is provided for generating a multi-dimensional view for different measures A set of records is retrieved in response to a set of queries The records include dimension values and measure values, which are associated with the measures The set of records is maintained in a master table The record management system generates a record structure foundation, including a query map and a master table index The record management system then employs the record structure foundation to generate a multi-dimensional layout mapping for the measures that are to be represented in the view The record structure foundation and measure values in the master table are used to convert the layout mapping into the desired multi-dimensional view The record management system includes data storage units for implementing the master table, query map, master table index, and layout mapping These data storage units are coupled to a set of processing engines, which include a control engine, query engine, index engine, and layout engine that provide for performing operations that result in the generation of a multi-dimensional view

Abstract: The present invention relates to a method for performing integrated storage operations on an information store. The present invention comprises identifying a plurality disparate types of storage operations stored in a policy option table. A first storage operation is performed according to a first set of storage criteria stored in the policy option table and a second operation, disparate from the first storage operation, is performed according to a second set of storage criteria stored in the policy option table.

Abstract: Since 1981, when Lamport introduced the remote user authentication scheme using table, a plenty of schemes had been proposed with tables or without table using. Recently Das et al. proposed a dynamic id-based remote user authentication scheme. They claimed that their scheme is secure against ID-theft, and can resist the reply attacks, forgery attacks, insider attacks an so on. In this paper we show that Das et al's scheme is completly insecure and using of this scheme is like an open server access without password.

Abstract: The present invention is an application-aware method for allocating resources to applications based on a set of predefined policies comprising a Resource Allocation Program (RAP). The RAP is application-aware in that the RAP does not arbitrarily allocate resources to requesting applications. Instead, the RAP allocates resources to requesting applications based on predefined policies. The RAP allows a user to define the resource allocation for each policy in a Resource Allocation Table and associate the applications with the policies in a Policy Application Table. When an application requests resources, the RAP looks to the Policy Allocation Table to determine the policy associated with the application and looks to the Resource Allocation Table to determine the permissible amount of resources to allocate to the application associated with the policy. The RAP then allocates the resources to the requesting application.

Abstract: A system and method for a reentrant database object wizard is provided. The system provides the ability to compare a currently generated dataset to the objects of the underlying database. Columns and tables that are not common between both the dataset and the database are visually displayed for the user to make a decision on inclusion or exclusion. In addition, columns and tables that were previously within the dataset that are no longer available on the database connection are displayed, for example, with warning icons so that the user can either resolve the missing column or table within the database, or remove the column/table from their typed dataset. The system includes a comparison component and a display component. The comparison component provides comparison information based upon a comparison of a dataset to an associated database. The display component displays the comparison information. The system can further, optionally, include an input component which can be employed by a user to provide information associated with the user's decision on inclusion and/or exclusion of column(s) and/or table(s) to the system. Thereafter, based upon the user's input, the system can provide can provide based upon a comparison of the modified dataset to the associated database.

Abstract: A method and system for providing convergence of data copies in asynchronous data replication in a database system, includes: labeling rows of a plurality of table copies with a monotonic number, a copy identification, and propagation controls; asynchronously capturing at least one labeled change to any row of any of the plurality of table copies from a database recovery log; determining that the captured change is to be communicated to others of the plurality of table copies; communicating the captured change to the others of the plurality of table copies; and applying the communicated change to the others of the plurality of table copies, where the plurality of table copies converge to a same state. In applying the communicated changes, conflicting changes are identified and resolved. In this manner, convergence of data copies in asynchronous data replication is provided, and processing and storage costs are significantly reduced.

Abstract: A database table of predefined data transformations is provided. Each predefined data transformation is associated in the table with a unique identifier, a corresponding description and a validity period. When a data modeler wishes to develop a data model for a desired prediction, he/she will first determine a set of variables that will be used therefor. The set of variables can include any of the predefined data transformations from the database table. The data model will then be developed by applying raw data to the set of variables and determining a mathematical relationship there between. Once the data model has been developed, the data modeler will write a reusable specification for applying the data model operationally. Thereafter, IT personnel or the like can code and deploy the data model using the specification.

Abstract: In one embodiment of the present invention, a decoder receives a dependency tree as a source language input and accesses a set of statistical models that produce outputs combined in a log linear framework. The decoder also accesses a table of treelet translation pairs and returns a target dependency tree based on the source dependency tree, based on access to the table of treelet translation pairs, and based on the application of the statistical models.

Abstract: Multiple Network Attached Storage (NAS) appliances are pooled together by a virtual NAS translator, forming one common name space visible to clients. Clients send messages to the virtual NAS translator with a file name and a virtual handle of the parent directory that are concatenated to a full file-path name and compressed by a cryptographic hash function to generate a hashed-name key. The hashed-name key is matched to a storage key in a table. The full file-path name is not stored, reducing the table size. A unique entry number is returned to the client as the virtual file handle that is also stored in another table with one or more native file handles, allowing virtual handles to be translated to native handles that the NAS appliance servers use to retrieve files. File movement among NAS servers alters native file handles but not virtual handles, hiding NAS details from clients.

Abstract: Since 1981, when Lamport introduced the remote user authentication scheme using table, a plenty of schemes had been proposed with table and without table using. Recently Das, Saxena and Gulati have proposed A dynamic ID-based remote user authentication scheme. They claimed that their scheme is secure against ID-theft, and can resist the reply attacks, forgery attacks, insider attacks and so on. In this paper we show that Das et al.'s scheme is completely insecure and using of this scheme is like an open server access without password. 1

Abstract: A program recording/reproducing apparatus capable of easily recording/reproducing programs that meet the preferences of all of a plurality of viewers A recording/reproducing apparatus (100) acquires program recommendation information from a server apparatus (300), designates internally stored program recommendation information, produces, based on these two types of program recommendation information, two search formulas, and combines the produced search formulas to produce a single search formula The apparatus (100) then produces, from EPG data extracted from received broadcast waves, preselected-program information indicative of programs that meet the conditions indicated by the produced search formula The apparatus (100) also produces, based on the produced preselected-program information, and displays a recorded-program table, and further accepts a selection of a program from the recorded-program table in response to a user's command, and reads and reproduces the program the selection of which has been accepted

Abstract: The invention is directed, in one embodiment, to systems and methods relating to managing rights associated with digital content. The protected content is compressed by means of a table of characteristics related to a chaotic system. This table is encrypted and transmitted together with the compressed data to an authorized client device.