Abstract: One approach to designing the decision making logic for an aircraft collision avoidance system is to frame the problem as Markov decision process and optimize the system using dynamic programming. The resulting strategy can be represented as a numeric table. This methodology has been used in the development of the ACAS X family of collision avoidance systems for manned and unmanned aircraft. However, due to the high dimensionality of the state space, discretizing the state variables can lead to very large tables. To improve storage efficiency, we propose two approaches for compressing the lookup table. The first approach exploits redundancy in the table. The table is decomposed into a set of lower-dimensional tables, some of which can be represented by single tables in areas where the lower-dimensional tables are identical or nearly identical with respect to a similarity metric. The second approach uses a deep neural network to learn a complex non-linear function approximation of the table. With the use of an asymmetric loss function and a gradient descent algorithm, the parameters for this network can be trained to provide very accurate estimates of values while preserving the relative preferences of the possible advisories for each state. As a result, the table can be approximately represented by only the parameters of the network, which reduces the required storage space by a factor of 1000. Simulation studies show that system performance is very similar using either compressed table representation in place of the original table. Even though the neural network was trained directly on the original table, the network surpasses the original table on the performance metrics and encounter sets evaluated here.

Abstract: This paper describes the organization of the database and the catalog data products from the Pan-STARRS1 $3\pi$ Steradian Survey. The catalog data products are available in the form of an SQL-based relational database from MAST, the Mikulski Archive for Space Telescopes at STScI. The database is described in detail, including the construction of the database, the provenance of the data, the schema, and how the database tables are related. Examples of queries for a range of science goals are included. The catalog data products are available in the form of an SQL-based relational database from MAST, the Mikulski Archive for Space Telescopes at STScI.

Abstract: This paper gives a comprehensive overview about the recent advances related with the application of the nanotechnology in various kinds of the solar collectors. Papers reviewed including theoretical, numerical and experimental up to date works related with the nanotechnology applications in the flat plate, direct absorption, parabolic trough, wavy, heat pipe and another kinds of the solar collectors. A lot of literature are reviewed and summarized carefully in a useful tables ( Table 1 , Table 2 , Table 3 , Table 4 , Table 5 , Table 6 , Table 7 ) to give a panoramic overview about the role of the nanotechnology in improving the various types of the solar collectors. It was found that the use of the nanofluid in the solar collector field can play a crucial role in increasing the efficiency of these devises. We think that this paper can be considered as an important link between the nanotechnology and all available kinds of the solar collectors. From the other side, further researches are required to study the effect of nanotechnology to enhance the solar collector industry over the next several coming years.

Abstract: A security system for a casino table card game has a casino table with i) indicia thereon for the placement of wagers, ii) a data entry system with an associated computer, and iii) sensors that can detect the placement of at least one specific category of wager; a shuffling device with a microprocessor integral to the shuffler for providing information regarding cards or hands; a central table gaming computer that receives information from the shuffler in real time, receives information from the sensors, and receives information from the data entry system, the associated computer, the microprocessor and the central table gaming computer communicating data among each other in real time.

Abstract: In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator for table constraints in or-tools and OscaR, two publicly available CP solvers, it has never been described so far. Importantly, CT has been recently improved further with the introduction of residues, resetting operations and a data-structure called reversible sparse bit-set, used to maintain tables of supports (following the idea of tabular reduction): tuples are invalidated incrementally on value removals by means of bit-set operations. The experimentation that we have conducted with OscaR shows that CT outperforms state-of-the-art algorithms STR2, STR3, GAC4R, MDD4R and AC5-TC on standard benchmarks.

Abstract: The goal of Emergency Medical Service (EMS) systems is to provide rapid response to emergency calls in order to save lives. This paper proposes a relocation strategy to improve the performance of EMS systems. In practice, EMS systems often use a compliance table to relocate ambulances. A compliance table specifies ambulance base stations as a function of the state of the system. We consider a nested-compliance table, which restricts the number of relocations that can occur simultaneously. We formulate the nested-compliance table model as an integer programming model in order to maximize expected coverage. We determine an optimal nested-compliance table policy using steady state probabilities of a Markov chain model with relocation as input parameters. These parameter approximations are independent of the exact compliance table used. We assume that there is a single type of medical unit, single call priority, and no patient queue. We validate the model by applying the nested-compliance table policies in a simulated system using real-world data. The numerical results show the benefit of our model over a static policy based on the adjusted maximum expected covering location problem (AMEXCLP).

Abstract: A method begins by a processing module receiving data of a file for storage in a dispersed storage network (DSN) memory and determining a segmentation scheme for storing the data. The method continues with the processing module determining how to store the data in accordance with the segmentation scheme to produce information for storing the data and generating an entry within a segment allocation table associated with the file, wherein the entry includes the information for storing the data and the segmentation scheme. The method continues with the processing module facilitating storage of the segment allocation table in the DSN memory. The method continues with the processing module segmenting the data in accordance with the segmentation scheme to produce a plurality of data segments and facilitating storage of the plurality of data segments in the DSN memory in accordance with the information for storing the data.

Abstract: We present smart drill-down, an operator for interactively exploring a relational table to discover and summarize “interesting” groups of tuples. Each group of tuples is described by a rule. For instance, the rule (a, b, ★, 1000) tells us that there are a thousand tuples with value a in the first column and b in the second column (and any value in the third column). Smart drill-down presents an analyst with a list of rules that together describe interesting aspects of the table. The analyst can tailor the definition of interesting, and can interactively apply smart drill-down on an existing rule to explore that part of the table. We demonstrate that the underlying optimization problems are NP-HARD, and describe an algorithm for finding the approximately optimal list of rules to display when the user uses a smart drill-down, and a dynamic sampling scheme for efficiently interacting with large tables. Finally, we perform experiments on real datasets on our experimental prototype to demonstrate the usefulness of smart drill-down and study the performance of our algorithms.

Abstract: An information management system provides a data deduplication system that uses a primary table, a deduplication chunk table, and a chunk integrity table to ensure that a referenced deduplicated data block is only verified once during the data verification of a backup or other replication operation. The data deduplication system may reduce the computational and storage overhead associated with traditional data verification processes. The primary table, the deduplication chunk table, and the chunk integrity table, all of which are stored in a deduplication database, can also ensure synchronization between the deduplication database and secondary storage devices.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: This paper proposes a new technique for DNA cryptography that uses dynamic DNA sequence table to enhance the level of security. While handling with secure data, the requirements like compression, speed-up computation and processing etc are crucial issues. Bio-molecular DNA features possess the capability to cope up with these requirements. Existing DNA cryptographic techniques usually consider fixed DNA sequence table i.e., DNA bases and thereby the security is suspected to be breached by the intruder. To overcome this limitation, the proposed technique considers dynamic sequence table that assigns random ASCII characters to DNA sequence table initially. Then a finite number of iterations are applied based on a mathematical series where in every iteration the positions of ASCII characters are changed dynamically in the sequence table. Later on, One-Time-Pad (OTP) is applied on the modified encoding binary value. Again OTP ciphertext is processed through genomic conversion. Finally, it is converted into compressed ciphertext using amino acid table consisting of protein sequence that increases the confusion of the ciphertext. At last, the time requirements for encoding-decoding and encryption-decryption are evaluated and comparisons with other DNA techniques are presented.

Abstract: BackgroundThe human genome contains variants ranging in size from small single nucleotide polymorphisms (SNPs) to large structural variants (SVs). High-quality benchmark small variant calls for the pilot National Institute of Standards and Technology (NIST) Reference Material (NA12878) have been developed by the Genome in a Bottle Consortium, but no similar high-quality benchmark SV calls exist for this genome. Since SV callers output highly discordant results, we developed methods to combine multiple forms of evidence from multiple sequencing technologies to classify candidate SVs into likely true or false positives. Our method (svclassify) calculates annotations from one or more aligned bam files from many high-throughput sequencing technologies, and then builds a one-class model using these annotations to classify candidate SVs as likely true or false positives.ResultsWe first used pedigree analysis to develop a set of high-confidence breakpoint-resolved large deletions. We then used svclassify to cluster and classify these deletions as well as a set of high-confidence deletions from the 1000 Genomes Project and a set of breakpoint-resolved complex insertions from Spiral Genetics. We find that likely SVs cluster separately from likely non-SVs based on our annotations, and that the SVs cluster into different types of deletions. We then developed a supervised one-class classification method that uses a training set of random non-SV regions to determine whether candidate SVs have abnormal annotations different from most of the genome. To test this classification method, we use our pedigree-based breakpoint-resolved SVs, SVs validated by the 1000 Genomes Project, and assembly-based breakpoint-resolved insertions, along with semi-automated visualization using svviz.ConclusionsWe find that candidate SVs with high scores from multiple technologies have high concordance with PCR validation and an orthogonal consensus method MetaSV (99.7 % concordant), and candidate SVs with low scores are questionable. We distribute a set of 2676 high-confidence deletions and 68 high-confidence insertions with high svclassify scores from these call sets for benchmarking SV callers. We expect these methods to be particularly useful for establishing high-confidence SV calls for benchmark samples that have been characterized by multiple technologies.

Abstract: MySQL is the most trusted and depended-on open source database platform in use today. Many of the most popular and highly-trafficked websites in the world are built on MySQL because of its ubiquity across heterogeneous platforms and application stacks and for its well-known performance, reliability and ease of use. Research, publications and community service is one activity that is managed by the Institute for Research and Community Service. The process of managing these activities today cannot be separated from the Internet, therefore we need a system that can manage every activity. To obtain the proper management it needs a system that is supported by the database system is also good. This paper discusses how to conduct the process of optimizing the database system so that when the data is accessed does not affect the performance of server systems. Process optimization is done on the design of the database system. Database design plays an important role in determining system performance. Process optimization is done in this study by using one of the functions that have been given in MySQL by using VIEW. This virtual table process to be performed by the system to be faster. This is because during the system requests to the server is does not need to query over and over because it has been done in the database management system.

Abstract: It is well-recognized that the general public is not typically involved in food policy debates, with participation often limited to elite participants with special interests. This paper investigates potential strategies for more effective and legitimate food policy utilizing systemic approaches to deliberative democracy. Two main strands are explored: first, it is argued that food is a key domain that could benefit from the move to systematic approaches to deliberative democracy. Examination of various types of public engagement about food, including consultation by submission, consensus and citizen conferences, citizens’ juries, and local food planning, reveals a dominance of micro-public perspectives that warrant greater integration and analysis at a systemic, macro level. Second, the paper contributes to the dialogue on systemic deliberative processes by analyzing tensions that are endemic in the domain of food policy, illustrating some of the points of weakness (and potential strengths) for effective deliberation in similar complex systems as well as presenting suggestions of directions for future research to contribute to the development of a more robust analytic framework for systematic approaches to deliberative

Abstract: Cell fusion is a fundamental phenomenon observed in all eukaryotes. Cells can exchange resources such as molecules or organelles during fusion. In this paper, we ask whether a cell can also transfer an adaptive response to a fusion partner. We addressed this question in the unicellular slime mould Physarum polycephalum, in which cell–cell fusion is extremely common. Slime moulds are capable of habituation, a simple form of learning, when repeatedly exposed to an innocuous repellent, despite lacking neurons and comprising only a single cell. In this paper, we present a set of experiments demonstrating that slime moulds habituated to a repellent can transfer this adaptive response by cell fusion to individuals that have never encountered the repellent. In addition, we show that a slime mould resulting from the fusion of a minority of habituated slime moulds and a majority of unhabituated ones still shows an adaptive response to the repellent. Finally, we further reveal that fusion must last a certain time to ensure an effective transfer of the behavioural adaptation between slime moulds. Our results provide strong experimental evidence that slime moulds exhibit transfer of learned behaviour during cell fusion and raise the possibility that similar phenomena may occur in other cell–cell fusion systems.

Abstract: Data warehouses are subject oriented, consolidated, integrated, and time variant repository of possibly heterogeneous data. A data warehouse is used to response to on-line analytical queries over the millions records of data in an acceptable time. Since a data warehouse often has millions of records of data, it is an important challenge how we can reduce the time of on-line analytical processing. One of the most important issues which address this problem is the view materialization. Each sub-query results an intermediate table, called virtual view, which is used to find final result of the analytical query. These virtual views often are commonly used to response to several analytical queries. We can materialize such views to prevent multiple redundant computations and thus lead to reduction in response time of queries. The constraint of storage memory on one hand, and the maintenance cost of materialized views when the source data are updated on the other hand, cause that it is impossible to materialize all or even large part of views. Therefore, selection of a proper set of views to materialization plays a major role in performance. There are many methods of view selection to materialization which uses different techniques and frameworks to select optimal set of views to materialization. In this paper, we present a new efficient method to conduct selecting proper set of views to materialization using a frequent itemset mining approach. In our algorithm, the set of given queries is transformed to a transaction database where a transaction corresponds to a query and items of a transaction are the original query's predicates. Our performance study showed that this algorithm outperformed substantially the best former algorithms.

Abstract: The invention discloses a method and an apparatus for realizing real-time increment synchronization of data. The method for realizing the real-time increment synchronization of the data comprises: according to table structure information of a relational database, generating a mapping relation file corresponding to the relational database in a distributed column-oriented open source database HBase; obtaining an operation log of the relational database in real time; according to the obtained operation log, obtaining change data of the relational database, and according to the established mapping relation file, updating the obtained change data into the HBase of Hadoop. The real-time increment update synchronization of the data from the relational database to Hadoop is realized, so that the burden of a Hadoop platform is effectively reduced and the user experience is improved.

Abstract: This article introduces TableMaker, an Excel macro that produces publication-quality tables and includes them as new sheets in workbooks. The macro provides an intuitive graphical user interface that allows for the full customization of all table features. It also allows users to save and load table templates, and thus allows layouts to be both reproducible and transferable. It is distributed in a single computer file. As such, the macro is easy to share, as well as accessible to even beginning and casual users of Excel. Since it allows for the quick creation of reproducible and fully customizable tables, TableMaker can be very useful to academics, policy-makers and businesses by making the presentation and formatting of results faster and more efficient.

Abstract: Methods, systems, apparatuses, and computer program products are provided for secure handling of queries by a data server and a database application. A parameterized query is received from a client. Table column metadata is loaded for one or more table columns referenced by the parameterized query. Datatypes of expressions in the parameterized query are derived with any parameters and variables of the parameterized query indicated as having unknown datatypes. Unsupported datatype conversions in the parameterized query are determined. An encryption scheme is inferred for any parameters and variables to generate an inferred encryption scheme set. The datatypes of expressions in the parameterized query are re-derived with any parameters and variables having their inferred encryption schemes. Encryption key metadata corresponding to the inferred encryption scheme set is loaded. An encryption configuration is transmitted to the client that includes the inferred encryption scheme for any parameters and variables.

Abstract: A solid-state drive (“SSD”) containing a non-volatile memory (“NVM”), flash translation layer (“FTL”) table, cache node index table, and random access memory (“RAM”) configured to cache at least a portion of the FTL table is disclosed. The NVM is organized its memory space into memory blocks for data storage wherein each of the memory blocks is further divided into a set of physical pages addressable by corresponding physical page addresses (“PPAs”). The FTL table, also known as address mapping table, includes multiple entries used for NVM memory accessing. Each entry of the FTL table stores a PPA addressing a physical page in the NVM. The RAM caches or stores a portion of the FTL table based on a table caching mechanism. The cache node index table resided in the RAM or RAM cache contains indexing information associated with the FTL table.

Abstract: This document describes a data processing system for database management. The system includes a registry management server in communication with a logical registry in a data repository. The data repository includes profile data associated with profile objects, a library of electronic instruments and a logical table including a number of logical rows corresponding to the profile objects. The registry management receives profile data from a client device, selects electronic instruments from the library, and maps the electronic instruments and profile objects by updating the logical table and indexing the logical table.

Abstract: The invention discloses an indexing method for quickening block chain query. Multiple parties jointly establish a quick index table to quicken information query efficiency. The quick index table is obtained through the calculation of the contents in all pieces of current Blocks; when a new Block is added each time, the new index table is calculated again, and once the new index table is accepted by each party, the original index table is replaced. The indexing method extracts records in the original Block to sort and establish the new index table, information query efficiency is quickened, and the correctness of the index table is guaranteed since the index table is independently calculated and jointly conformed by multiple parties.

Abstract: Arbitrary tables presented in spreadsheets can be an important data source in business intelligence. However, many of them have complex layouts that hinder the process of extracting, transforming, and loading their data in a database. The paper is devoted to the issues of rule-based data transformation from arbitrary tables presented in spreadsheets to a structured canonical form that can be loaded into a database by regular ETL-tools. We propose a system for canonicalization of arbitrary tables presented in spreadsheets as an implementation of our methodology for rule-based table analysis and interpretation. It enables the execution of rules expressed in our specialized rule language called CRL to recover implicit relationships in a table. Our experimental results show that particular CRL-programs can be developed for different sets of tables with similar features to automate table canonicalization with high accuracy.

Abstract: A method and system associate conditional formats with selected data points or groups of data points within a summary table. In one embodiment, related groups of data are determined based upon currently highlighted cells in a summary table. A user then selects from the groups and identifies conditional formats to be associated with the specified data points. The conditional formats are associated with currently displayed as well as non-displayed data within the summary table. The associated conditions are saved relative to the data points rather than the original cell positions so that the conditions remain associated with the data points following a reorganization of the summary table.

Abstract: The invention provides a resource distribution method and device. After user equipment is synchronous with other use equipment, a resource information table of the user equipment can be transmitted to other use equipment, and a resource information table transmitted by other equipment can be received. For each piece of user equipment, the method can distribute resources based on the resource information table of the user equipment and the resource information table of other use equipment. Moreover, because the resource information table can reflect a resource demand of the corresponding user equipment for D2D communication, each piece of user equipment can avoid the resources needed by other user equipment while the method carries out the resource distribution based on the resource information table of the user equipment and the resource information table of other use equipment, thereby reducing the probability that user equipment occupies the same resources, and reducing the resource conflicts.

Abstract: Web service composition enables the provision of existing resources on the web without investing in new infrastructure. However, searching an optimal composition solution with both functional and non-functional requirements is a computationally demanding problem: the time and space requirements may be insufferable due to the high number of available services. To alleviate this problem, we propose the application of a skyline operation to reduce the search space and improve the scalability. We design a system to solve the composition problem with two separate processes. The Graphplan approach finds a solution in a short time, the database approach may take longer time to find a solution, but the solution returned by this approach always has fewer redundant services with a better QoS value. Full Solution Indexing using Database (FSIDB) approach pre-computes all services combinations and store them as paths in a database. Partial pre-composing approach chooses "popular" paths generated by FSIDB approach and store them in a separate table. If the problem can be solved by these paths, there is no need to search the table with whole paths. We evaluate our approach with a web service challenge dataset.

Abstract: The invention relates to an account security technology, and discloses a method and system for identifying computer risks based on account clustering. In the method disclosed by the invention, clustering is carried out according to a pre-set characteristic attribute; account characteristic data is divided into multiple categories; furthermore, whether the account number in various categories after division is greater than a first threshold value or not is judged, such that a potential batch suspicious account is identified; therefore, risks are avoided effectively; in addition, judgement of the suspicious account is completed through an offline server; furthermore, a service permission table is generated; an online server can find the suspicious account in time according to the service permission table and forbid the suspicious account to use corresponding services; therefore, the online risk identification speed is enhanced; and better services are provided.