Quick Query Research Articles

A crop trait information acquisition system with multitag-based identification technologies for breeding precision management

This paper aims to establish a crop trait information acquisition system by combining barcode and radio frequency-based electronic identification (RFID) and near-field communication (NFC) technology applications. The system was devised to ensure (a) correct identification of each crop material and plot, (b) quick query and positioning for information collection, (c) correct combination of crop phenotypic data and images, and (d) reliable recording of periodic crop trait data with dependable transmission to the main server. This system, with multitag-based identification technology, was developed on an Android platform using the Java language. A type of RFID/NFC tag with a high-frequency chip was applied in the core, and a quick response (QR) code was used on the surface for material identification. A smartphone with NFC function can be used as an RFID reader, and its built-in camera can be used to decode QR codes. The system was used in some seed industries’ commercial breeding and in national crop variety regional trial, with its functions including reading/writing of RFID/NFC tags, decoding QR codes, acquiring crop trait information, creating field maps, and uploading data. This system provided a low-cost and highly efficient solution for crop trait information collection.

Quick Window Query Processing Using a Non-Uniform Cell-Based Index in Wireless Data Broadcast Environment

Quick Window Query Processing Using a Non-Uniform Cell-Based Index in Wireless Data Broadcast Environment

Reasoning about actions with loops via Hoare logic

Plans with loops are more general and compact than classical sequential plans, and gaining increasing attentions in artificial intelligence (AI). While many existing approaches mainly focus on algorithmic issues, few work has been devoted to the semantic foundations on planning with loops. In this paper, we first develop a tailored action language AL K, together with two semantics for handling domains with non-deterministic actions and loops. Then we propose a sound and (relative) complete Hoare-style proof system for efficient plan generation and verification under 0-approximation semantics, which uses the so-called idea offline planning and on-line querying strategy in knowledge compilation, i.e., the agent could generate and store short proofs as many as possible in the spare time, and then perform quick query by constructing a long proof from the stored shorter proofs using compositional rule. We argue that both our semantics and proof system could serve as logical foundations for reasoning about actions with loops.

Technical note: The Linked Paleo Data framework – a common tongue for paleoclimatology

Abstract. Paleoclimatology is a highly collaborative scientific endeavor, increasingly reliant on online databases for data sharing. Yet there is currently no universal way to describe, store and share paleoclimate data: in other words, no standard. Data standards are often regarded by scientists as mere technicalities, though they underlie much scientific and technological innovation, as well as facilitating collaborations between research groups. In this article, we propose a preliminary data standard for paleoclimate data, general enough to accommodate all the archive and measurement types encountered in a large international collaboration (PAGES 2k). We also introduce a vehicle for such structured data (Linked Paleo Data, or LiPD), leveraging recent advances in knowledge representation (Linked Open Data).The LiPD framework enables quick querying and extraction, and we expect that it will facilitate the writing of open-source community codes to access, analyze, model and visualize paleoclimate observations. We welcome community feedback on this standard, and encourage paleoclimatologists to experiment with the format for their own purposes.

DoOR 2.0--Comprehensive Mapping of Drosophila melanogaster Odorant Responses.

Odors elicit complex patterns of activated olfactory sensory neurons. Knowing the complete olfactome, i.e. the responses in all sensory neurons for all relevant odorants, is desirable to understand olfactory coding. The DoOR project combines all available Drosophila odorant response data into a single consensus response matrix. Since its first release many studies were published: receptors were deorphanized and several response profiles were expanded. In this study, we add unpublished data to the odor-response profiles for four odorant receptors (Or10a, Or42b, Or47b, Or56a). We deorphanize Or69a, showing a broad response spectrum with the best ligands including 3-hydroxyhexanoate, alpha-terpineol, 3-octanol and linalool. We include all of these datasets into DoOR, provide a comprehensive update of both code and data, and new tools for data analyses and visualizations. The DoOR project has a web interface for quick queries (http://neuro.uni.kn/DoOR), and a downloadable, open source toolbox written in R, including all processed and original datasets. DoOR now gives reliable odorant-responses for nearly all Drosophila olfactory responding units, listing 693 odorants, for a total of 7381 data points.

Access for the elderly to primary health care services: an integrative review

Background: With the aging of the population, there is a trend of increase in the number of elderly people with greater needs for assistance in health. The challenge is to ensure access to all of them. Objective: Discussing on access of older persons to primary health care services from an integrative review. Method: Integrative review of literature through the databases CINAHL, LILACS, Medline, and Web of Science. The descriptors used were health services accessibility, elderly and primary health care. The instrument of data collection included: article title, journal name, year of publication, database, country, type of study, level of evidence, objectives and key results. There were met 111 published articles, 13 of which were selected for filling the inclusion criteria. Results: The difficulties of access faced by seniors include: limited offer; insufficient number of professionals; quick queries without identifying their needs; opening hours and inadequate, excessive wait time to be answered. The elderly still face external barriers to path-related service, and internal, non-adapted environments to their visual, auditory and limitations. Home care and over the phone, however, can facilitate access. The elderly should also receive information about your health problem and have the opportunity to clarify doubts. Conclusion: It is necessary to recognize the elderly as an individual with distinctive needs for improved access to health care.

HTP-OligoDesigner: An Online Primer Design Tool for High-Throughput Gene Cloning and Site-Directed Mutagenesis.

Following burgeoning genomic and transcriptomic sequencing data, biochemical and molecular biology groups worldwide are implementing high-throughput cloning and mutagenesis facilities in order to obtain a large number of soluble proteins for structural and functional characterization. Since manual primer design can be a time-consuming and error-generating step, particularly when working with hundreds of targets, the automation of primer design process becomes highly desirable. HTP-OligoDesigner was created to provide the scientific community with a simple and intuitive online primer design tool for both laboratory-scale and high-throughput projects of sequence-independent gene cloning and site-directed mutagenesis and a Tm calculator for quick queries.

The Establishment of the Pork Product Traceability System Based on RFID

in order to ensure the quality and safety of pork products, improve the pork food traceability information real-time, reliability and accuracy, this study adopts B/S structure, designed and implemented based on radio frequency identification technology (RFID), bar code technology, network information technology of pork products traceability system. The system through the electronic tag and barcode for pork food raw material source, production and processing, logistics, and real-time tracking, the terminal sales each link of each link and data transmission through the network to the system server. Consumers on the basis of tracing the source through the computer and mobile terminal can be convenient and quick query ginseng food traceability information.

Web GIS Research and Application Based on SVG

In this paper we use the SVG technology to the field of Web GIS and set up the Traffic Accident Scene Management System (TASMS). Using text format characteristics of SVG, combined with ASP.NET technology and the scripting language JavaScript, we achieved dynamically load geographic information image, quick query and some user interaction functions.

A Quick Query Methods for ONS System based on EPC

EPCGlobal proposed for the domain name (DNS) service based on the object name service (ONS) design standards, prone to slow query response ONS system, data logging, storage space, cannot meet a single product inquiry and other issues. This paper presents a separate DNS service, the use of regular expressions and match data records stored ONS system design and implementation, test results show that independent of the DNS service ONS system has a data record storage space and query response speed, meet single product inquiries and so on.

Letters to the journal

The Critical/Biographical Coverage of SF and Fantasy: An Unscientific Snapshot of Subject Coverage in the Science Fiction and Fantasy Research Database, ca. Summer 2013Some time ago, I queried listservs regarding interest in a data file showing subject coverage of science fiction and fantasy, as reflected in the Science Fiction and Fantasy Research Database. The responses indicated enough interest to complete the datafile.The introduction and the Excel datafile on the Texas A&M University Library Institutional Repository. The link to the file is in the Introduction, following this note.The data file is functionally freely available for use by anyone who wants to use the data, to manipulate the data file, to add to the file and extract data (as the sample columns illustrate), or otherwise use it for any type of research.In the course of re-editing the subject entries in the Science Fiction and Fantasy Research Database, it became obvious that for only a bit more work, a data file could be created that would give a snapshot of the material covered in the database. A quick query of SFRA members indicated interest in such a project.The data file is derived from the Science Fiction and Fantasy Research Database as of June 2013, when the database consisted of 100,300 records. The Science Fiction and Fantasy Research Database is a wide-ranging compilation, including scholarly articles and books, newspaper articles, news notes, motion picture reviews and comments, and some web content. Using this data file as a guide, it would be easy, if time consuming, to define the types of coverage in the database: scholarly article, book chapter, news note, and the like.The file is simple: a subject term, and the number of times that term was used in the database. It has the beginnings of other data columns. In the third column, I started coding for terms that would be useful for sorting. Terms such as AUTHOR, ARTIST, DIRECTOR, ACTOR and the like can be added, and used to sort the data for closed evaluation. Sample columns for other coding options are also included. Additional coding and use are left to anyone who may have an interest.The file is an unscientific and non-rigorous presentation of data. By that, I mean the file is a by-product of another project, not a tightly designed research effort. By non-rigorous, I mean that I exercised care in deriving the numerical data, but there are almost certainly some instances of miscounting. …

BI-Filtered Forwarding: A Quasi-Optimal Routing Algorithm for Query Delivery in Wireless Sensor Networks

Abstract A quasi-optimal query propagation algorithm Bi-Filtered Forwarding (BFF) for quickly routing a query throughout a wireless sensor network is proposed in this paper. BFF is implemented in a limited flooding manner for guaranteeing quick query propagation and low message consumption in wireless sensor networks. The experimental results show that in comparison with the flooding algorithm, BFF can greatly reduce the redundant message consumption during the procedure of real time query propagation throughout a wireless sensor network.

Proof Systems for Planning Under Cautious Semantics

Planning with incomplete knowledge becomes a very active research area since late 1990s. Many logical formalisms introduce sensing actions and conditional plans to address the problem. The action language $$\mathcal{A}_{K}$$ invented by Son and Baral is a well-known framework for this purpose. In this paper, we propose so-called cautious and weakly cautious semantics for $$\mathcal{A}_{K}$$ , in order to allow an agent to generate and execute reliable plans in safety-critical environments. Intuitively speaking, cautious and weakly cautious semantics enable the agent to know exactly what happens after the execution of an action. Computational complexity analysis shows that cautious semantics reduces the reasoning complexity of $$\mathcal{A}_{K}$$ , it is also worth to point out that many useful domains could still be expressed with this setting. Another important contribution of our work is the development of Hoare style proof systems. These proof systems are served as inference mechanisms for the verification of conditional plans, and proved to be sound and complete. In addition, they could also be used for plan generation, in the sense that constructing a derivation is indeed a procedure to finding a plan. We point out that the proof systems posses a nice property for off-line planning, that is, the agent could generate and store short proofs in her spare time, and perform quick plan query by easily constructing a long proof from the stored shorter ones (under the assumption that sufficient proofs are stored).

Approximating sliding windows by cyclic tree-like histograms for efficient range queries

The issue of providing fast approximate answers to range queries on sliding windows with a small consumption of storage space is one of the main challenges in the context of data streams. On the one hand, the importance of this class of queries is widely accepted. They are indeed useful to compute aggregate information over the data stream, allowing us to extract from it more abstract knowledge than point queries. On the other hand, the usage of techniques like synopses based on histograms, sketches, sampling, and so on, makes effective those approaches which require multiple scans on data, which otherwise would be prohibitive from the computational point of view. Among the above techniques, histogram-based approaches are considered one of the most advantageous solutions, at least in case of range queries. It is a matter of fact that histograms show a very good capability of summarizing data preserving quick and accurate answers to range queries. In this paper, we propose a novel histogram-based technique to reduce sliding windows supporting approximate arbitrary range-sum queries. Our histogram, relying on a tree-based structure, is suitable to directly support hierarchical queries and, thus, drill-down and roll-up operations. In addition, the structure well supports sliding window shifting and quick query answering, since it operates in logarithmic time in the sliding window size. A bit-saving approach to encoding tree nodes allows us to compress the sliding window with a little price in terms of accuracy. The contribution of this work is thus not only the proposal of a new specific technique to tackle an important problem but also a deep analysis of the advantages given by the hierarchical approach combined with the bit-saving strategy. A careful experimental analysis validates the method showing its superiority w.r.t. the state of the art.

Approximate queries on distributed data marts

The global business deals with a large amount of business data that are stored in potentially hundreds of distributed systems. It is challenging to allow end-users issue online analytical processing (OLAP) queries to retrieve suitable information through a worldwide network. This article presents the idea of using statistical methods to model federated data marts. Once data marts are modelled, reduced sets of distributed data can be imported and used to approximately reconstruct a federated data mart. Approximate queries can then be obtained from the reconstructed federated data mart. Advantages of this design include: quick query responses without accessing external servers; user-defined accuracy of the approximate query answers and network-efficient method for periodical updates. A proof of concept is presented using large data sets used for marketing analysis purposes.

Supporting the data cube lifecycle: the power of ROLAP

The lifecycle of a data cube involves efficient construction and storage, fast query answering, and incremental updating. Existing ROLAP methods that implement data cubes are weak with respect to one or more of the above, focusing mainly on construction and storage. In this paper, we present a comprehensive ROLAP solution that addresses efficiently all functionality in the lifecycle of a cube and can be implemented easily over existing relational servers. It is a family of algorithms centered around a purely ROLAP construction method that provides fast computation of a fully materialized cube in compressed form, is incrementally updateable, and exhibits quick query response times that can be improved by low-cost indexing and caching. This is demonstrated through comprehensive experiments on both synthetic and real-world datasets, whose results have shown great promise for the performance and scalability potential of the proposed techniques, with respect to both the size and dimensionality of the fact table.

Quick queries for checking asthma control

In Brief Pediatricians recommend pacifiers for infants…new CPR guidelines released…how agency nurses measure up…and more.

Understanding the brevity of Web queries

Introduction Internet search engines are the most common resource for people seeking answers to questions and access to webbased information, and in most search engines, keyword queries are the primary means of retrieving information. Yet, web queries tend to be remarkably brief and general. Although they have grown slightly in length over time, web queries are still on average about two words in length, which is significantly shorter and less complex than queries used in earlier types of information systems (Jansen & Pooch, 2000; Wang, Berry & Yang, 2003). Popular queries listed on the Google site, such as "weather", "moon," and "nature" serve as very coarse filters for the two billion indexed web pages, and return millions of hits. Given this scenario, it is not surprising that people are often frustrated by web searching, and that search success rates of about 50% are reported (Nielsen, 2001).

Image Database Query by Content Using Wavelet Coefficient Signature

Abstract This research paper describes how wavelet coefficients can be used for quick image database querying by content. Research into using wavelet decomposition of low frequency components of two dimensional grayscale images has yielded favourable image query hit rates and quick retrieval of image and information from the image database. This paper also introduces several attempts of mathematical signal and image processing transforms and their failures. A favourable method is discussed here and research findings are documented.

A simple WWW interface and quick response system-information query system for cross-sectional body dimensions.

We developed a query and analysis system for normal growth measurement of Japanese children on our WWW server using CGI. It has two subsystems. The first shows standard height and standard weight calculated by height. This subsystem can calculate the difference between measured height and the standard along with deviation and the ratio of measured weight to the standard weight. The second shows standard height, weight, head circumference, and chest circumference. This subsystem can calculate differences between the measurements and the standard as well as deviation. Because of the low amount of output required, very short turn-around time was required. This system also allows use of the same interface no matter which brand terminal is used and has wide reusability. This system will save doctors and nurses the difficulty of looking up a child's data, then having to make the calculation. We also compare the merits of CGI and Java.