Abstract: Learning new motor tasks from physical interactions is an important goal for both robotics and machine learning. However, when moving beyond basic skills, most monolithic machine learning approaches fail to scale. For more complex skills, methods that are tailored for the domain of skill learning are needed. In this paper, we take the task of learning table tennis as an example and present a new framework that allows a robot to learn cooperative table tennis from physical interaction with a human. The robot first learns a set of elementary table tennis hitting movements from a human table tennis teacher by kinesthetic teach-in, which is compiled into a set of motor primitives represented by dynamical systems. The robot subsequently generalizes these movements to a wider range of situations using our mixture of motor primitives approach. The resulting policy enables the robot to select appropriate motor primitives as well as to generalize between them. Finally, the robot plays with a human table tennis partner and learns online to improve its behavior. We show that the resulting setup is capable of playing table tennis using an anthropomorphic robot arm.

Abstract: Research aims at the publication of findings in order to discuss them with the research community and make them available to practitioners A common mean to do so is publishing in conferences and journals As claimed in Part III15, foundations and results of the single cases were discussed with the OIIs and the research community in order to validate and improve them Table 59 lists previous publications that revealed parts of this thesis and the major overlaps with it

Abstract: Table understanding is a well studied problem in document analysis, and many academic and commercial approaches have been developed to recognize tables in several document formats, including plain text, scanned page images and born-digital, object-based formats such as PDF. Despite the abundance of these techniques, an objective comparison of their performance is still missing. The Table Competition held in the context of ICDAR 2013 is our first attempt at objectively evaluating these techniques against each other in a standardized way, across several input formats. The competition independently addresses three problems: (i) table location, (ii) table structure recognition, and (iii) these two tasks combined. We received results from seven academic systems, which we have also compared against four commercial products. This paper presents our findings.

Abstract: Open Data Kit (ODK) is an open-source, modular toolkit that enables organizations to build application-specific information services for use in resource-constrained environments. ODK is one of the leading data collection solutions available and has been deployed by a wide variety of organizations in dozens of countries around the world. This paper discusses how recent feedback from users and developers led us to redesign the ODK system architecture. Specifically, the design principles for ODK 2.0 focus on: 1) favoring runtime languages over compile time languages to make customizations easier for individuals with limited programming experience; 2) implementing basic data structures as single rows within a table of data; 3) storing that data in a database that is accessible across applications and client devices; and 4) increasing the diversity of input types by enabling new data input methods from sensors. We discuss how these principles have led to the refinement of the existing ODK tools, and the creation of several new tools that aim to improve the toolkit, expand its range of applications, and make it more customizable by users.

Abstract: Various embodiments relate to a method performed by a router. The method may include: receiving, at a first line card of the router, a request for content having a content identifier; determining a second line card that is responsible for the content identifier; switching the request for content to the second line card; and updating a pending interest table at the second line card based on the request for content. Various embodiments relate to a router for content based routing that receives a plurality of requests for contents including a content identifier. The router may include: a fabric switch; and a plurality of line cards interconnected by the fabric switch, each line card includes a network processor and a pending interest table configured to store entries for a subset of the requests defined by the content identifier.

Abstract: We describe work on automatically inferring the intended meaning of tables and representing it as RDF linked data, making it available for improving search, interoperability and integration. We present implementation details of a joint inference module that uses knowledge from the linked open data (LOD) cloud to jointly infer the semantics of column headers, table cell values (e.g., strings and numbers) and relations between columns. We also implement a novel Semantic Message Passing algorithm which uses LOD knowledge to improve existing message passing schemes. We evaluate our implemented techniques on tables from the Web and Wikipedia.

Abstract: Data sessions are established based in part on services. When establishing a data session for a communication device, the desired mobility gateway can be dynamically assigned via a specified policy mechanism or provisioned using a predefined service policy table, where particular services are linked with respective identifiers associated with respective mobility gateways. A communication device can reference the service policy table to locate a service that is to be used for the data session and can identify an identifier(s) linked to the service(s) and associated with a mobility gateway(s). The identifier(s) can be received and used to facilitate selecting one or more respective mobility gateways for the data session(s). The service policy table can be automatically pushed to the communication device or the communication device can initiate a download of the service policy table when the default data connection is established.

Abstract: A database has a main table and an auxiliary table. Data are stored by: dividing the data into a sequence of segments each having a size smaller than a predetermined threshold; storing a first segment into a first field of a record of the main table; storing an index indexing the data into a second field of the record of the main table; storing the other segments into first fields of corresponding records of the auxiliary table; generating indexes associated to the other segments and storing each index into a second field of the record of the auxiliary table storing the associated segment of the sequence and also in a third field of the record of the auxiliary table storing a preceding segment in the sequence. A third record of the main table stores the index of a first segment of the sequence which is stored in the auxiliary table.

Abstract: A tenant database is used to add tenant ID information to the cloud network manager (CNM) address mapping table to isolate tenant specific data to a tenant ID to the CNM. The CNM maintains a mapping among a plurality of items in a plurality of databases or tables. The plurality of databases or tables include a tenant database (DB), a tenant identifier to tenant label (TITL) table, a top of rack server label to virtual switch link label (TLVLL) table, a label mapping table (SMVL), and a CNM address mapping table. The CNM uses the plurality of databases to generate tenant specific labels that are added to packets sent between tenant virtual machines (VMs).

Abstract: Copyright is retained by the first or sole author, who grants right of first publication to the Practical Assessment, Research & Evaluation. Permission is granted to distribute this article for nonprofit, educational purposes if it is copied in its entirety and the journal is credited. PARE has the right to authorize third party reproduction of this article in print, electronic and database forms.

Abstract: A system and method for database management and accessing data stored in the database may be optimized based on the database structure. For example, data associated with a range (e.g. owners of IP addresses) may have query requests optimized by utilizing two tables. The first table may include all the ranges, such that the ranges are continuous and not overlapping, and an identifier for each of the ranges. The second table may include the identifiers and the data that is associated with the range corresponding with those identifiers. Query requests for a particular range may be optimized by utilizing specialized database queries for the first table and because the data associated with the range is not part of the first table. Further, the second table size is reduced because an identifier may be associated with multiple ranges.

Abstract: Methods and apparatuses for managing load-store dependencies in an out-of-order processor. A load store dependency predictor may include a table for storing entries for load-store pairs that have been found to be dependent and execute out of order. Each entry in the table includes a counter to indicate a strength of the dependency prediction. If the counter is above a threshold, a dependency is enforced for the load-store pair. If the counter is below the threshold, the dependency is not enforced for the load-store pair. When a store is dispatched, the table is searched, and any matching entries in the table are armed. If a load is dispatched, matches on an armed entry, and the counter is above the threshold, then the load will wait to issue until the corresponding store issues.

Abstract: Tripal is an open-source freely available toolkit for construction of online genomic and genetic databases. It aims to facilitate development of community-driven biological websites by integrating the GMOD Chado database schema with Drupal, a popular website creation and content management software. Tripal provides a suite of tools for interaction with a Chado database and display of content therein. The tools are designed to be generic to support the various ways in which data may be stored in Chado. Previous releases of Tripal have supported organisms, genomic libraries, biological stocks, stock collections and genomic features, their alignments and annotations. Also, Tripal and its extension modules provided loaders for commonly used file formats such as FASTA, GFF, OBO, GAF, BLAST XML, KEGG heir files and InterProScan XML. Default generic templates were provided for common views of biological data, which could be customized using an open Application Programming Interface to change the way data are displayed. Here, we report additional tools and functionality that are part of release v1.1 of Tripal. These include (i) a new bulk loader that allows a site curator to import data stored in a custom tab delimited format; (ii) full support of every Chado table for Drupal Views (a powerful tool allowing site developers to construct novel displays and search pages); (iii) new modules including ‘Feature Map’, ‘Genetic’, ‘Publication’, ‘Project’, ‘Contact’ and the ‘Natural Diversity’ modules. Tutorials, mailing lists, download and set-up instructions, extension modules and other documentation can be found at the Tripal website located at http://tripal.info. Database URL: http://tripal.info/

Abstract: A database system supporting persistent queries, comprising a client software application, a persistent query service, and a plurality of network-attached data sources. On receiving a request to create a persistent query from the client software application, the persistent query service: creates a query virtual table; parses the persistent query; creates a plurality of intermediate virtual tables; establishes listeners for the query virtual table; creates a plurality of data source virtual tables; causes the plurality of data source virtual tables to retrieve initial data from data sources; and propagates data via intermediate virtual tables to the persistent query virtual table. On detection of a data change in a data source, the associated data source virtual table causes the data change to propagate via intermediate virtual tables to the persistent query virtual table, and the client software application executes client code of at least one listener.

Abstract: A method, system, and computer program product for displaying components assigned to events produced by resources, includes: registering a new resource by generating a label to which is associated a system specific device identifier used by the new resource within a computing environment; storing in a mapping table the generated label identifying the registered new resource together with an associated system specific device identifier; and updating the mapping table by associating to the label any other system specific device identifier used by the new resource within the computing environment; receiving events produced by resources when being executed within the computing environment, each event being associated with a list of labels for the resources relevant for the generation of the event; and maintaining a tag cloud including different tags, the different tags including labels for the resources associated with the received events to be displayed as components.

Abstract: Situational data integration is often ad hoc, involves active participation of business users, and requires just-in-time treatment. Agility and end-user programming are of importance. The paper presents a spreadsheet-like programming environment called Mashroom, which offers required agility and expressive power to support situational data integration by non-professional users. In Mashroom, various data sources are encapsulated as data services with nested tables as their unified data model both for internal processing and for external uses. Users can operate on the nested tables interactively. Mashroom also supports the basic control flow patterns. The expressive power of Mashroom is analyzed and proved to be richer than N1NF relational algebra. All the XQuery expressions can be mapped to Mashroom operations and formulas. Experiments have revealed the potentials of Mashroom in situational data integration.

Abstract: The invention discloses an ordering method based on a two-dimensional code. The method includes the steps that a corresponding two-dimensional code is generated according to access point information of a wireless fidelity (WIFI) network, server information and dining table identification information, a mobile terminal acquires the two-dimensional code and analyzes the two-dimensional code to acquire the access point information, the server information and the dining table identification information, the mobile terminal is connected onto the WIFI network according to the access point information and connected with a server according to the server information, the mobile terminal is identified according to the dining table identification information, and ordering operation is conducted. Whether a menu is generated is conducted, menu information generated by ordering operation is acquired on yes judgment, and price is generated according to the menu information. By means of the method, customers can know the price of ordered dishes during ordering and conduct consumption under satisfying price, customer satisfaction is improved, unnecessary dining time of the customers is reduced, and economical benefit of a restaurant is improved. Meanwhile, an ordering system based on the two-dimensional code is further disclosed.

Abstract: An identity search algorithm for identifying a plurality of all identity data such as personal names and entity names that might exist in a table or file containing a large number of identity data in the investigative environment. The algorithm is intended to identify person and entities in the shortest time possible with an overly inclusive results. The core algorithm is used in an environment with a growing number of names in the name table, and implemented with a web-based user interface, it can dramatically improve the identity-searching efficiency and increase the chance to generate useful leads in typical discovery and investigation.

Abstract: The present subject matter discloses systems and methods in which a mobile application integrates with a restaurant's point of sale (POS) system such that, by providing a table identifier, users may split and pay an itemized bill, without the need of servers or restaurant staff.

Abstract: The invention discloses a network diagnosis method based on a software defined network (SDN). The method includes the steps that a switchboard sets the rule of debug option of a flow table item according to a flow table debug setting command sent by a controller; the switchboard matches the key field of the message heading with the matching field of the flow table item, and judges whether the flow table item matched with the message is set up with a debug option field or not; if yes, the switchboard executes relevant debugging operations according to the content of the debug option field, and the operations include, but not limited to, sending the matching message and the contextual information to the controller; and the controller proceeds network diagnosis according to the message and the contextual information. The invention further discloses a network diagnosis system and equipment based on the SDN. With the technical scheme provided by the invention, the cycle for positioning a network problem is accelerated, the quality of the network is improved, and the operating maintenance cost of the network is reduced.

Abstract: Methods for processing a query in a multi-tenancy environment utilizing an electronic computing device are presented, the methods including: causing the electronic computing device to receive the query to a database, where the query includes a number of objects; causing the electronic computing device to determine whether any of the number of objects correspond with the set of tenant database objects; if any of the number of objects correspond with the set of tenant database objects, causing the electronic computing device to process the number of objects from the tenant production table; and if any of the number of objects correspond with the set of instance database objects, causing the electronic computing device to process the number of objects from the instance production table.

Abstract: OpenFlow is one of the most potential technique to enable innovation in network. To enable OpenFlow more flexibility and high-efficiency, multi-table pipeline has been introduced in OpenFlow. A HAL(Hardware Abstraction Layer) is proposed to address the incompatibility of flow table pipeline between legacy switch hardware and the controller. However, the burden of controller will be increased greatly. In this paper, an innovative middle layer called FlowAdapter is proposed. It converts flow entry rules from the controller flow table pipeline to switch hardware flow table pipeline, so that the same rules can be fitted into different types of hardware. With FlowAdapter, legacy OpenFlow hardware can be used to support multi-table pipeline rules. Located in switch, FlowAdapter is transparent to the controller. With a prototype implementation, we find that the FlowAdapter performs rules conversion effectively.

Abstract: As we enter the era of data deluge, turning data into knowledge has become the major challenge across most sciences and businesses that deal with data. In addition, as we increase our ability to create data, more and more people are confronted with data management problems on a daily basis for numerous aspects of every day life. A fundamental need is \emph{data exploration through interactive tools}, i.e., being able to quickly and effortlessly determine data and patterns of interest. However, modern database systems have not been designed with data exploration and usability in mind; they require users with expert knowledge and skills, while they react in a strict and monolithic way to every user request, resulting in correct answers but slow response times. In this paper, we introduce the vision of a new generation of data management systems, called \emph{dbTouch}; our vision is to enable interactive and intuitive data exploration via \emph{database kernels which are tailored for touch-based exploration}. No expert knowledge is needed. Data is represented in a visual format, e.g., a column shape for an attribute or a fat rectangle shape for a table, while users can touch those shapes and interact/query with gestures as opposed to firing complex SQL queries. The system does not try to consume all data; instead it analyzes only parts of the data at a time, continuously refining the answers and continuously reacting to user input. Every single touch on a data object can be seen as a request to run an operator or a collection of operators over part of the data. Users react to running results and continuously adjust the data exploration - they continuously determine the data to be processed next by adjusting the direction and speed of a gesture, i.e., a collection of touches; the database system does not have control on the data flow anymore. We discuss the various benefits that dbTouch systems bring for data analytics as well as the new and unique challenges for database research in combination with touch interfaces. In addition, we provide an initial architecture, implementation and evaluation (and demo) of a dbTouch prototype over IOs for IPad.

Abstract: Tabular information in text documents contains a wealth of information, and so tables are a natural candidate for information extraction. There are many cues buried in both a table and its surrounding text that allow us to understand the meaning of the data in a table. We study how natural-language tools, such as part-of-speech tagging, dependency paths, and named-entity recognition, can be used to improve the quality of relation extraction from tables. In three domains we show that (1) a model that performs joint probabilistic inference across tabular and natural language features achieves an F1 score that is twice as high as either a puretable or pure-text system, and (2) using only shallower features or non-joint inference results in lower quality.

Abstract: This disclosure concerns homomorphic encryption for database querying. Numerical values (Fig. 5) are encrypted using keys (Fig. 6) and random numbers (Fig. 7) to produce a ciphertext. The ciphertext is homoporhic and is comprised of two or more sub-ciphertexts (Fig. 8). Queries based on addition (Fig. 10), average (Fig. 11) and multiplication operations can be performed without decrypting the numerical values relevant to the query. Each sub-ciphertext (Fig. 8) is stored in a single record and in separate attributes. There is disclosed methods of encrypting (402) and decrypting, creating a suitable table (400), querying such a database (412) and updating such a database (408, 410).

Abstract: Embodiments are directed towards determining and tracking metadata for the generation of visualizations of requested data A user may request data by providing a query that may be employed to search for the requested data The query may include a plurality of commands, which may be employed in a pipeline to perform the search and to generate a table of the requested data In some embodiments, each command may be executed to perform an action on a set of data The execution of a command may generate one or more columns to append and/or insert into the table of requested data Metadata for each generated column may be determined based on the actions performed by executing the commands The table of requested data and the column metadata may be employed to generate and display a visualization of at least a portion of the requested data to a user

Abstract: The invention discloses a network address translation (NAT) implementing system which comprises a controller and an openflow switch, wherein the controller issues a flow table and an improved group table, the openflow switch receives the flow table and the improved group table, a data package which needs to conduct address translation is matched according to a matching rule of the address translation recorded by the flow table, translation between a private address and a public internet protocol (IP) address is conducted according to a rule of address translation recorded by the improved group table, and the data package is transmitted out through an address which is translated. The invention further discloses an NAT implementing method and the openflow switch. According to the NAT implementing system, only the flow table and the improved group table are transmitted to the openflow switch once, frequent intersection between the openflow switch and the controller is not required, time delay of transmission of the data package is shortened, and transmission efficiency of a network is improved.

Abstract: The invention discloses implementation method and system for dynamically generating report pages. The method includes: setting a functional frame of a dynamic report as required; establishing a data model of the dynamic report based on the functional frame; generating a report query page according to report configuration data, and selecting a report display form according to query conditions; querying the report data; selecting the form containing header and index data according to the query conditions; and generating a two-dimensional table of report display result according to the user-selected form, filling with report result data, and generating a final report form. Same data can be displayed through similar report forms by the method and system, so that report number is decreased and management is facilitated. The data are displayed according to the customized report form in the query stage. Therefore, the requirement for counting same data of similar table forms at different levels is met, the number of reports is decreased greatly, and the reports are easy to manage, maintain nd use.

Abstract: 38. J0(kt) 1 1s2 k2 s3 s4 4k4 k(s2 2k2) s4 4k4 k(s2 2k2) s4 4k4 2k2s s4 4k4 s (s2 a2)(s2 b2) cos bt cos at a2 b2 1 (s2 a2)(s2 b2) a sin bt b sin at ab (a2 b2) k3 s2(s2 k2) k2 s(s2 k2) s (s a)(s b) aeat bebt a b 1 (s a)(s b) eat ebt a b s2 k2 (s2 k2)2 2ks (s2 k2)2 2k3 (s2 k2)2 2ks2 (s2 k2)2 s2 k2 (s2 k2)2 2ks (s2 k2)2 s a (s a)2 k2 k (s a)2 k2 { f (t)} F(s) 27069_end05-07_ptg01_hires.qxd 1/30/12 5:10 PM Page 6