62 research outputs found

    A low-cost collaborative location scheme with GNSS and RFID for the Internet of Things

    Get PDF
    The emergence and development of the Internet of Things (IoT) has attracted growing attention to low-cost location systems when facing the dramatically increased number of public infrastructure assets in smart cities. Various radio frequency identification (RFID)-based locating systems have been developed. However, most of them are impractical for infrastructure asset inspection and management on a large scale due to their high cost, inefficient deployment, and complex environments such as emergencies or high-rise buildings. In this paper, we proposed a novel locating system by combing the Global Navigation Satellite System (GNSS) with RFID, in which a target tag was located with one RFID reader and one GNSS receiver with sufficient accuracy for infrastructure asset management. To overcome the cost challenge, one mobile RFID reader-mounted GNSS receiver is used to simulate multiple location known reference tags. A vast number of reference tags are necessary for current RFID-based locating systems, which means higher cost. To achieve fine-grained location accuracy, we utilize a distance-based power law weight algorithm to estimate the exact coordinates. Our experiment demonstrates the effectiveness and advantages of the proposed scheme with sufficient accuracy, low cost and easy deployment on a large scale. The proposed scheme has potential applications for location-based services in smart cities

    The Genomes of Oryza sativa: A History of Duplications

    Get PDF
    We report improved whole-genome shotgun sequences for the genomes of indica and japonica rice, both with multimegabase contiguity, or almost 1,000-fold improvement over the drafts of 2002. Tested against a nonredundant collection of 19,079 full-length cDNAs, 97.7% of the genes are aligned, without fragmentation, to the mapped super-scaffolds of one or the other genome. We introduce a gene identification procedure for plants that does not rely on similarity to known genes to remove erroneous predictions resulting from transposable elements. Using the available EST data to adjust for residual errors in the predictions, the estimated gene count is at least 38,000–40,000. Only 2%–3% of the genes are unique to any one subspecies, comparable to the amount of sequence that might still be missing. Despite this lack of variation in gene content, there is enormous variation in the intergenic regions. At least a quarter of the two sequences could not be aligned, and where they could be aligned, single nucleotide polymorphism (SNP) rates varied from as little as 3.0 SNP/kb in the coding regions to 27.6 SNP/kb in the transposable elements. A more inclusive new approach for analyzing duplication history is introduced here. It reveals an ancient whole-genome duplication, a recent segmental duplication on Chromosomes 11 and 12, and massive ongoing individual gene duplications. We find 18 distinct pairs of duplicated segments that cover 65.7% of the genome; 17 of these pairs date back to a common time before the divergence of the grasses. More important, ongoing individual gene duplications provide a never-ending source of raw material for gene genesis and are major contributors to the differences between members of the grass family

    Phosphorene: Fabrication, Properties and Applications

    Full text link
    Phosphorene, the single- or few-layer form of black phosphorus, was recently rediscovered as a twodimensional layered material holding great promise for applications in electronics and optoelectronics. Research into its fundamental properties and device applications has since seen exponential growth. In this Perspective, we review recent progress in phosphorene research, touching upon topics on fabrication, properties, and applications; we also discuss challenges and future research directions. We highlight the intrinsically anisotropic electronic, transport, optoelectronic, thermoelectric, and mechanical properties of phosphorene resulting from its puckered structure in contrast to those of graphene and transition-metal dichalcogenides. The facile fabrication and novel properties of phosphorene have inspired design and demonstration of new nanodevices; however, further progress hinges on resolutions to technical obstructions like surface degradation effects and non-scalable fabrication techniques. We also briefly describe the latest developments of more sophisticated design concepts and implementation schemes that address some of the challenges in phosphorene research. It is expected that this fascinating material will continue to offer tremendous opportunities for research and development for the foreseeable future.Comment: invited perspective for JPC

    Finishing the euchromatic sequence of the human genome

    Get PDF
    The sequence of the human genome encodes the genetic instructions for human physiology, as well as rich information about human evolution. In 2001, the International Human Genome Sequencing Consortium reported a draft sequence of the euchromatic portion of the human genome. Since then, the international collaboration has worked to convert this draft into a genome sequence with high accuracy and nearly complete coverage. Here, we report the result of this finishing process. The current genome sequence (Build 35) contains 2.85 billion nucleotides interrupted by only 341 gaps. It covers ∼99% of the euchromatic genome and is accurate to an error rate of ∼1 event per 100,000 bases. Many of the remaining euchromatic gaps are associated with segmental duplications and will require focused work with new methods. The near-complete sequence, the first for a vertebrate, greatly improves the precision of biological analyses of the human genome including studies of gene number, birth and death. Notably, the human enome seems to encode only 20,000-25,000 protein-coding genes. The genome sequence reported here should serve as a firm foundation for biomedical research in the decades ahead

    Context-Aware Matrix Factorization for the Identification of Urban Functional Regions with POI and Taxi OD Data

    No full text
    The identification of urban functional regions (UFRs) is important for urban planning and sustainable development. Because this involves a set of interrelated processes, it is difficult to identify UFRs using only single data sources. Data fusion methods have the potential to improve the identification accuracy. However, the use of existing fusion methods remains challenging when mining shared semantic information among multiple data sources. In order to address this issue, we propose a context-coupling matrix factorization (CCMF) method which considers contextual relationships. This method was designed based on the fact that the contextual relationships embedded in all of the data are shared and complementary to one another. An empirical study was carried out by fusing point-of-interest (POI) data and taxi origin–destination (OD) data in Beijing, China. There are three steps in CCMF. First, contextual information is extracted from POI and taxi OD trajectory data. Second, fusion is performed using contextual information. Finally, spectral clustering is used to identify the functional regions. The results show that the proposed method achieved an overall accuracy (OA) of 90% and a kappa of 0.88 in the study area. The results were compared with the results obtained using single sources of non-fused data and other fusion methods in order to validate the effectiveness of our method. The results demonstrate that an improvement in the OA of about 5% in comparison to a similar method in the literature could be achieved using this method

    Spatiotemporal Graph Convolutional Network for Multi-Scale Traffic Forecasting

    No full text
    Benefiting from the rapid development of geospatial big data-related technologies, intelligent transportation systems (ITS) have become a part of people’s daily life. Traffic volume forecasting is one of the indispensable tasks in ITS. The spatiotemporal graph neural network has attracted attention from academic and business domains for its powerful spatiotemporal pattern capturing capability. However, the existing work focused on the overall traffic network instead of traffic nodes, and the latter can be useful in learning different patterns among nodes. Moreover, there are few works that captured fine-grained node-specific spatiotemporal feature extraction at multiple scales at the same time. To unfold the node pattern, a node embedding parameter was designed to adaptively learn nodes patterns in adjacency matrix and graph convolution layer. To address this multi-scale problem, we adopted the idea of Res2Net and designed a hierarchical temporal attention layer and hierarchical adaptive graph convolution layer. Based on the above methods, a novel model, called Temporal Residual II Graph Convolutional Network (Tres2GCN), was proposed to capture not only multi-scale spatiotemporal but also fine-grained features. Tres2GCN was validated by comparing it with 10 baseline methods using two public traffic volume datasets. The results show that our model performs good accuracy, outperforming existing methods by up to 9.4%

    Spatiotemporal Graph Convolutional Network for Multi-Scale Traffic Forecasting

    No full text
    Benefiting from the rapid development of geospatial big data-related technologies, intelligent transportation systems (ITS) have become a part of people’s daily life. Traffic volume forecasting is one of the indispensable tasks in ITS. The spatiotemporal graph neural network has attracted attention from academic and business domains for its powerful spatiotemporal pattern capturing capability. However, the existing work focused on the overall traffic network instead of traffic nodes, and the latter can be useful in learning different patterns among nodes. Moreover, there are few works that captured fine-grained node-specific spatiotemporal feature extraction at multiple scales at the same time. To unfold the node pattern, a node embedding parameter was designed to adaptively learn nodes patterns in adjacency matrix and graph convolution layer. To address this multi-scale problem, we adopted the idea of Res2Net and designed a hierarchical temporal attention layer and hierarchical adaptive graph convolution layer. Based on the above methods, a novel model, called Temporal Residual II Graph Convolutional Network (Tres2GCN), was proposed to capture not only multi-scale spatiotemporal but also fine-grained features. Tres2GCN was validated by comparing it with 10 baseline methods using two public traffic volume datasets. The results show that our model performs good accuracy, outperforming existing methods by up to 9.4%

    A Low-cost RFID/GPS Location Sensing Algorithm for Urban Infrastructure

    No full text
    Low-cost Radio Frequency Identification (RFID) location sensing algorithm is practical and crucial for urban infrastructure location. Current RFID location algorithms are based on fixed multiple RFID reader or reference points (reader or tag) with known position, which is cost and difficult to deployment in urban environment. The objective of this study is to develop a low-cost location sensing algorithm using RFID technique to locate urban infrastructure. This paper presents an algorithm based on multilateration with the integration of mobile RFID and Global Position System (GPS). The mobility of RFID reader can measure many distances between different RFID reader positions and target tag which represent multilateration. The GPS provides coordination of RFID reader. The location of tag is calculated based on triangle geometric property. The redundant observation is adopted to get the optimum location. In practice, the only one RFID reader is necessary, thus the cost is reduced hardly. The performance and accuracy assessment are conducted in field experiment. The experiment proves that the proposed low-cost location sensing algorithm is able to location the urban infrastructure with smaller position error. The lower cost makes it even more economically feasible than other algorithm
    corecore