Abstract: A data storage device is disclosed comprising a non-volatile memory comprising a plurality of memory segments. When a write command comprising a logical block address (LBA) is received, a number of consecutive memory segments to access in response to the write command is determined. When the number of consecutive memory segments to access is greater than a threshold, a new run-length mapping entry in a run-length mapping table (RLMT) is created. When the number of memory segments to access is not greater than a threshold, at least one new single address mapping entry in a single address mapping table (SAMT) is created.

Abstract: Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only the required attributes. The overhead incurred is on-the-fly tuple reconstruction for multi-attribute queries. Each tuple reconstruction is a join of two columns based on tuple IDs, making it a significant cost component. The ultimate physical design is to have multiple presorted copies of each base table such that tuples are already appropriately organized in multiple different orders across the various columns. This requires the ability to predict the workload, idle time to prepare, and infrequent updates. In this paper, we propose a novel design, partial sideways cracking, that minimizes the tuple reconstruction cost in a self-organizing way. It achieves performance similar to using presorted data, but without requiring the heavy initial presorting step itself. Instead, it handles dynamic, unpredictable workloads with no idle time and frequent updates. Auxiliary dynamic data structures, called cracker maps, provide a direct mapping between pairs of attributes used together in queries for tuple reconstruction. A map is continuously physically reorganized as an integral part of query evaluation, providing faster and reduced data access for future queries. To enable flexible and self-organizing behavior in storage-limited environments, maps are materialized only partially as demanded by the workload. Each map is a collection of separate chunks that are individually reorganized, dropped or recreated as needed. We implemented partial sideways cracking in an open-source column-store. A detailed experimental analysis demonstrates that it brings significant performance benefits for multi-attribute queries.

Abstract: A system for natural language communication with a computer, comprising a database configures to store at least one table the table configured to store associations between concepts in a text string and associated concept identifiers; and a builder interfaced with the database, the builder configured to construct a concept defined by a text string by performing a process comprising the following steps: assigning a unique identifier to the concept, breaking the concept into sub-concepts, assigning a unique identifier to each sub-concept, using legal joins to join cub-concepts into higher order sub-concepts, assigning a unique identifier to the higher-order concepts, and repeating the steps until the higher order sub-concepts join to form the concept, and storing the concept, sub-concepts, higher order sub-concepts and unique identifiers in a table in the database.

Abstract: One aspect is directed to a system whereby a live gaming table system is provided with one or more handheld user input devices which, for example, may allow multiple different players to simultaneously or concurrently provide wager input data and/or other data to the gaming table system. In at least one embodiment, the handheld user input devices may form part of a multi-player touch input interface system which is operable to identify or determine where, who, and what transactions are taking place at a multi-player gaming table and/or multi-player gaming system.

Abstract: A system for identifying events includes a memory capable of storing a compressed event table including a number of events, the event table having been compressed by reducing the number of events in the event table without reducing the number of events represented by the event table. Each event of the event table includes a set of state parameters, and may also be associated with an output. The system also includes a processor capable of operating a fast state recognition (FSR) application. The FSR application, in turn, can receive a plurality of inputs, and identify an event of the compressed event table based upon the plurality of inputs and the state parameters of the compressed event table, event being identified in accordance with a state recognition technique.

Abstract: This article surveys table algebras as algebraic abstractions of association schemes and other structures. Various definitions are compared; some basic properties are developed; and some theorems and applications are presented.

Abstract: What is provided is an enhanced dynamic address translation facility. In one embodiment, a virtual address to be translated is first obtained and an initial origin address of a translation table of the hierarchy of translation tables is obtained. Based on the obtained initial origin, a segment table entry is obtained. The segment table entry is configured to contain a format control and access validity fields. If the format control and access validity fields are enabled, the segment table entry further contains an access control field, a fetch protection field, and a segment-frame absolute address. Store operations are permitted only if the access control field matches a program access key provided by any one of a Program Status Word or an operand of a program instruction being executed. Fetch operations are permitted if the program access key associated with the virtual address is equal to the segment access control field.

Abstract: In this paper we introduce a distortion free invisible watermarking technique for relational databases. The main idea is to build the watermark after partitioning tuples with actual attribute values. Then, we build hash functions on top of this grouping and get a watermark as a permutation of tuples in the original table. As the ordering of tuples does not affect the original database, this technique is distortion free. Our contribution can be seen as an application to relational databases of software watermarking ideas developed within the Abstract Interpretation framework.

Abstract: A method for showing page flip effect when use electronic device enjoy electronic documents, including: when receiving a flip-page instruction, obtain a parameter from a parameter table from a storage unit, the parameter table contains several parameters, each parameter include a first group of coordinates, a content of a flip-page figure and a second group of coordinates; determining a target page according to the flip-page instruction; producing the flip-page figure of the current page according to the first group coordinates and the content; covering a second area of the current page determined by the second group of coordinates with a second area of the target page determined by the second group of coordinates to form a combined page; displaying the combined page. Present invention also provides an electronic device capable of showing a page flip effect.

Abstract: The increasing power dissipation of current processors and processor cores constrains design options, increases packaging and cooling costs, increases power delivery costs, and decreases reliability. Much research has been focused on decreasing average power dissipation, which most directly addresses cooling costs and reliability. However, much less has been done to decrease peak power, which most directly impacts the processor design, packaging, and power delivery. This research proposes a new architecture which provides a significant decrease in peak power with limited performance loss. It does this through the use of a highly adaptive processor. Many components of the processor can be configured at different levels, but because they are centrally controlled, the architecture can guarantee that they are never all configured maximally at the same time. This paper describes this adaptive processor and explores mechanisms for transitioning between allowed configurations to maximize performance within a peak power constraint. Such an architecture can cut peak power by 25% with less than 5% performance loss; among other advantages, this frees 5.3% of total core area used for decoupling capacitors.

Abstract: Delivering an object to a user would be a generally useful capability for service robots. Within this paper, we look at this capability in the context of assistive object retrieval for motor-impaired users. We first describe a behavior-based system that enables our mobile robot EL-E to autonomously deliver an object to a motor-impaired user. We then present our evaluation of this system with 8 motor-impaired patients from the Emory ALS Center. As part of this study, we compared handing the object to the user (direct delivery) with placing the object on a nearby table (indirect delivery). We tested the robot delivering a cordless phone, a medicine bottle, and a TV remote, which were ranked as three of the top four most important objects for robotic delivery by ALS patients in a previous study. Overall, the robot successfully delivered these objects in 126 out of 144 trials (88%) with a success rate of 97% for indirect delivery and 78% for direct delivery. In an accompanying survey, participants showed high satisfaction with the robot with 4 people preferring direct delivery and 4 people preferring indirect delivery. Our results indicate that indirect delivery to a surface can be a robust and reliable delivery method with high user satisfaction, and that robust direct delivery will require methods that handle diverse postures and body types.

Abstract: The invention relates to a range image-based 3D spatial data processing method and a device In the method, ground laser radar is adopted to scan an object to obtain 3D point cloud data on the surface of the object; a database object table is established by a PL/SQL programming approach; a reference datum is fit according to point cloud which is segmented in advance to generate a minimum bounding box (MBB) of the point cloud and subsequently generate the range image according to the reference datum obtained by fitting Later, data of the MBB and the range image are written into the database object table and the relation between the MBB and a range image object is established, subsequently, R tree 3D spatial database index is established for the database objects which enter the database, finally, visualization is realized based on Oracle Objects for OLE (OO4O) and OpenGL

Abstract: A geographically distributed storage system including a global Peer-To-Peer (P2P) ring and a local P2P ring. The global P2P ring includes all storage nodes and the local P2P ring includes a group of the storage nodes. Each of the group of storage node belongs to the global P2P ring and the local P2P ring and each storage node includes global and local management information. The global management information includes a node table for managing topology information of a network connecting the group, a metadata table for managing locations of stored data objects, and a global routing table for managing routing in the global P2P ring. The local management information includes an object management table for managing stored data objects in the group, a Logical Unit (LU) management table for managing logical units in the group and a local routing table used for managing routing in the local P2P ring.

Abstract: We propose an automatic system for annotating accurately data tables extracted from the web. This system is designed to provide additional data to an existing querying system called MIEL, which relies on a common vocabulary used to query local relational databases. We will use the same vocabulary, translated into an OWL ontology, to annotate the tables. Our annotation system is unsupervised. It uses only the knowledge defined in the ontology to automatically annotate the entire content of tables, using an aggregation approach: first annotate cells, then columns, then relations between those columns. The annotations are fuzzy: instead of linking an element of the table with a precise concept of the ontology, the elements of the table are annotated with several concepts, associated with their relevance degree. Our annotation process has been validated experimentally on scientific domains (microbial risk in food, chemical risk in food) and a technical domain (aeronautics).

Abstract: Summary. Due to their important role in providing safe conditions for train movements, railway interlocking systems are considered as safety critical systems. The reliability, safety and integrity of these systems, relies on reliability and integrity of all stages in their lifecycle including the design, verification, manufacture, test, operation and maintenance. In this paper, the Automatic generation and verification of interlocking control tables, as one of the most important stages in the interlocking design process has been focused on, by the safety critical research group in the School of Railway Engineering, SRE. Three different subsystems including a graphical signalling layout planner, a Control table generator and a Control table verifier, have been introduced. Using NuSMV model checker, the control table verifier analyses the contents of control table besides the safe train movement conditions and checks for any conflicting settings in the table. This includes settings for conflicting routes, signals, points and also settings for route isolation and single and multiple overlap situations. The latest two settings, as route isolation and multiple overlap situations are from new outcomes of the work comparing to works represented on the subject recently.

Abstract: A method of managing data access of a storage medium includes establishing an address mapping table to record a physical address of a first data stored in the storage medium, where the physical address of the first data is mapped to a logical address of the first data; and when receiving a command for handling the first data stored in the storage medium internally, processing the address mapping table to serve the command without physically accessing the first data stored in the storage medium.

Abstract: A method, apparatus, and a computer program product for storing and accessing multi-tenancy data The method includes the steps of: creating a plurality of table sets in one or more databases, wherein each table set is used to store data of a group of tenants selected from a plurality of tenants; accessing data of a tenant in a table set in response to receiving a data access request from the tenant; and recording relationships between the tenants and the table sets in a multi-tenancy metadata repository, wherein the step of accessing the data of the tenant comprises the steps of finding the table set by querying the metadata repository and accessing the data of the tenant in the table set based on the result received from the query of the metadata repository

Abstract: Provided is a method, system, and program for accessing data in a distributed database environment. A client program receives multiple requests for data from a database object satisfying specified search predicates from an application program. Each request includes a request for at least one row from the table. The client program transfers a database command and a rowset parameter indicating a maximum number of rows to return to a server program over a network if the requested row is not maintained by the client program. A data block is generated with the server program including rows from the database object satisfying the search predicates in response to the database command. The rows included in the data block do not exceed the rowset parameter. The server program transfers the data block to the client program. In turn, the client program returns at least one requested row from the received data block in response to one request for the at least one row of data from the application program.

Abstract: A server is configured to receive an input file or table that includes a number of data elements, where the data elements include some sensitive data elements of different types; identify each of the different types of sensitive data elements; identify a subset of the sensitive data elements that corresponds to each of the different types of sensitive data elements; simultaneously perform data masking operations on the sensitive data elements to create masked sensitive data elements, where a separate one of the data masking operations is performed on each of the subsets of the sensitive data elements; generate an output file or table that includes the data elements from the input file or table, where the sensitive data elements, of the input file or table, are replaced with the masked sensitive data elements; and output or store the output file or table.

Abstract: A virtual machine managing method includes: virtual machine list generation step of detecting a plurality of virtual machines deployed on a physical machine; a dependency list generation step of detecting dependencies among the virtual machines deployed on the physical machine; a power-off order generation step of, based on table contents of the virtual machine list table and the dependency list table, generating a power-off order management table which manages a power-off order in which the same virtual machines are sequentially powered off in descending order of dependency, in units of the physical machine; and a target presentation step of, when an instruction for selecting the power-off target physical machine is detected, reading the power-off order corresponding to this power-off target physical machine from the power-off order management table, and visually presenting this read power-off order.

Abstract: The invention discloses an automatic white balance method and relates to an image adjustment method, which is suitable for image processing, wherein the time of generating second image data is before the time of first image data. The method comprises the following steps: imputing the first image data; adjusting the color of the first image data according to a color gain table; executing an object detection procedure so as to remove at least one foreground object and obtaining a target background; and carrying out color difference analysis on the target background so as to decide at least one image gain parameter. The invention can automatically adjust white balance by carrying out the color difference analysis on the background.

Abstract: A virtual media (VM) method for mounting one or more folders in one or more storage devices of a client for accessed by a server as a virtual drive The client assigns virtual cluster indices to each file, and creates a file-cluster index table to store the assigned virtual cluster indices The client also creates a VM file system complying with the FAT file system standard except that only subdirectories and no data files are stored in the VM FAT file system The VM FAT table uses virtual cluster indices rather than actual cluster indices Data written by the server are stored in a temporary data area without modifying the actual file systems of the storage devices The virtual sectors requested to be written are “dirty”, and the dirty sector numbers and corresponding temporary sector numbers are stored in a dirty sector index table for use in a write-back step

Abstract: The utility model discloses a small-sized carpenter board cutting saw. An expanding working table and a pushing table are respectively installed on two sides of a working table, wherein a transverse scale and a fine-tuning mechanism thereof are arranged on the expanding working table, an auxiliary pushing table with a supporting and connecting device is installed outside the pushing table, an angle scale, a material pressing frame, a rotatable material guiding frame scale, a fine-tuning mechanism thereof and an elongated square bar scale which can be telescopic in an inner cavity of the material guiding frame scale are arranged on the auxiliary pushing table, and a cutting part, a saw blade lifting part and a saw blade rotating part are arranged in a box body under the working platform. The small-sized carpenter board cutting saw can cut wider, longer and smaller timber stably, has accurate sizing, big range, high cutting precision, good quality, small volume, low cost, easy operation, safety, environment protection, convenient wrapping and transportation and long service life, and is in particular applicable to small-sized carpenter manufacture factories and domestic workshops.

Abstract: Protecting computers against cache poisoning, including a cache-entity table configured to maintain a plurality of associations between a plurality of data caches and a plurality of entities, where each of the caches is associated with a different one of the entities, and a cache manager configured to receive data that is associated with any of the entities and store the received data in any of the caches that the cache-entity table indicates is associated with the entity, and receive a data request that is associated with any of the entities and retrieve the requested data from any of the caches that the cache-entity table indicates is associated with the requesting entity, where any of the cache-entity table and cache manager are implemented in either of computer hardware and computer software embodied in a computer-readable medium.

Abstract: Two global environmental issues, climate change and contamination by persistent organic pollutants, represent major concerns for arctic ecosystems. Yet, it is unclear how these two stressors interact in the Arctic. For instance, the influence of climate-associated changes in food web structure on exposure to pollutants within arctic ecosystems is presently unknown. Here, we report on recent changes in feeding ecology (1991-2007) in polar bears (Ursus maritimus) from the western Hudson Bay subpopulation that have resulted in increases in the tissue concentrations of several chlorinated and brominated contaminants. Differences in timing of the annual sea ice breakup explained a significant proportion of the diet variation among years. As expected from climate change predictions, this diet change was consistent with an increase in the consumed proportions of open water-associated seal species compared to ice-associated seal species in years of earlier sea ice breakup. Our results demonstrate that climate change is a modulating influence on contaminants in this polar bear subpopulation and may pose an additional and previously unidentified threat to northern ecosystems through altered exposures to contaminants.

Abstract: Linear look-up tables are widely used to approximate and characterize complex nonlinear functional relationships between system input and output. However, both the initial calibration and subsequent real-time adaptation of these tables can be time consuming and prone to error as a result of the large number of table parameters typically required to map the system and the uncertainties and noise in the experimental data on which the calibration is based. In this paper, a new method is presented for identifying or adapting the look-up table parameters using a recursive least-squares based approach. The new method differs from standard recursive least squares algorithms because it exploits the structure of the look-up table equations in order to perform the identification process in a way that is highly computationally and memory efficient. The technique can therefore be implemented within the constraints of typical embedded applications. In the present study, the technique is applied to the identification of the volumetric efficiency look-up table commonly used in gasoline engine fueling strategies. The technique is demonstrated on a Ford 2.0L I4 Duratec engine using time-delayed feedback from a sensor in the exhaust manifold in order to adapt the table parameters online.

Abstract: Combining table top and tangible user interfaces is a relatively new research area. Many problems remain to be solved before users can benefit from tangible interactive table top systems. This paper presents our effort in this direction. RoboTable is an interactive table top system that enables users to naturally and intuitively manipulate robots. The goal of this research is to develop a software framework for human-robot interaction which combines table top, tangible objects, artificial intelligence and physics simulations and demonstrate the framework with game applications.

Abstract: The subject invention relates to systems and methods that distribute electronic data, such as Electronic Product Code (EPC) data, obtained from RFID tags by Radio Frequency Identification (RFID) readers and/or servers to agents within an agent-based control system. The systems and methods employ a component that collects, filters, processes, and stores electronic product data. The component collects electronic product data through corresponding reader and/or server interfaces. This data can be filtered to accept particular electronic product data, processed to a format suitable to the agents, and stored. Such storage can include delineating the electronic product data across rows of a table by electronic product code and across columns of the table by various types of data. Upon receiving a subscription and/or request from an agent for electronic product data, the component can obtain and convey the information to the agent.

Abstract: A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both, of the container sets.