SRS: Spatial-tagged radio-mapping system combining LiDAR and mobile-phone data for indoor location-based services

One of the most challenging issues in radio received signal strength (RSS)-based localization systems is the generation and distribution of a radio map with a coordinate system linked with spatial information in a large indoor space. This study proposes a novel spatial-tagged radio-mapping system (SRS) that effectively combines the heterogeneous properties of LiDAR and mobile phones to simultaneously perform both spatial and radio mappings. The SRS consists of synchronization, localization, and map building processes, and enables real-time spatial and radio mapping. In the synchronization process, the distance range, motion data, and radio signals obtained through the LiDAR and mobile phone are collected in nodal units according to the sensing time. In the localization process, a feature variance filter is used to control the number of features generated from LiDAR and estimate the positions at which the nodes are generated in real time according to the motion data and radio signals. In map building, the estimated positions of the nodes are used to extract spatial and radio maps by using a unified location coordinate system. To ensure mobility, the SRS is manufactured in the form of a backpack supporting LiDAR and a mobile phone; the usefulness of the system is experimentally verified. The experiments are performed in a large indoor shopping mall with a complex structure. The experimental results demonstrated that a common coordinate system could be used to build spatial and radio maps with high accuracy and efficiency in real time. In addition, the field applicability of the SRS to location-based services is experimentally verified by applying the constructed radio map to well-known fingerprinting algorithms using the heterogeneous mobile phones.     

采用八叉树和OSG分页结点的海量点云三维可视化

针对现有海量点云可视化方法存在索引构建时间长、内存占用大等问题，研究一种八叉树索引结合OSG分页结点的快速可视化方法，可在占用较小内存的基础上快速建立点云索引并实时调度。采用八叉树索引结构对海量点云进行数据组织，建立各层级的八叉树结点并以文件映射的方式分块保存，对结点文件重组织转换为支持OSG渲染引擎的多分辨率点云数据。采用基于OSG分页结点的实时调度技术，对海量点云进行高质量可视化。与目前两款主流的点云数据处理商业软件进行实验对比分析，结果表明所提方法具有索引建立速度快、内存占用小等优点，同时可视化交互更加流畅，适用于各种配置计算机下海量点云数据的调度管理与实时可视化。     

Weak Delocalization in Graphene on a Ferromagnetic Insulating Film

Graphene has been predicted to develop a magnetic moment by proximity effect when placed on a ferromagnetic film, a promise that could open exciting possibilities in the fields of spintronics and magnetic data recording. In this work, the interplay between the magnetoresistance of graphene and the magnetization of an underlying ferromagnetic insulating film is studied in detail. A clear correlation between both magnitudes is observed but through a careful modeling of the magnetization and the weak localization measurements, that such correspondence can be explained by the effects of the magnetic stray fields arising from the ferromagnetic insulator is found. The results emphasize the complexity arising at the interface between magnetic and 2D materials.     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

The Precedence Effect in Three Species of Birds (Melopsittacus undulatus, Serinus canaria, and Taeniopygia guttata).

The perceived locations of paired auditory images, simulating direct sounds and their echoes, have been recently studied in budgerigars (Melopsittacus undulatus; M. L. Dent & R. J. Dooling, 2003a, 2003b). In this article, the authors extend those experiments to include measurements of the precedence effect using a discrimination paradigm in two additional bird species: canaries (Serinus canaria) and zebra finches (Taeniopygia guttata). Although time courses of summing localization, localization dominance, and echo thresholds were similar across all species, budgerigars had slightly higher overall levels of discrimination. The results from these experiments add further support that the precedence effect in birds is similar to that found in other animals and that the ability to suppress echoes that might degrade localization and auditory object perception may be a general property of the vertebrate auditory system. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Performance characteristics of cascaded delay‐line node architectures in single‐path interconnection networks

Internally buffered multistage interconnection network architectures have been widely used in parallel computer systems and large switching fabrics. Migration from electrical domain to optical domain has raised the necessity of developing node architectures with optical buffers. Cascaded fibre delay line architectures can be seen as possible realizations of output and shared buffering in a 2 × 2‐switching element. These approaches can be used as buffered node architecture in a Banyan like interconnect. In this paper, we investigate and compare these approaches by using simulation methods. Different performance metrics, such as normalized throughput, average packet delay, packet loss rate and buffer utilization have been used under uniform and non‐uniform traffic models. Results show that the TC‐chain node Banyan network offer an improved normalized throughput and average packet delay performances under both traffic models without disrupting first‐in‐first‐out order of arrivals. The switched delay‐line requires fewer switching elements than TC and TTC architectures but at the cost of high packet delay. Copyright © 2004 John Wiley & Sons, Ltd.     

超媒体系统中的人工智能方法

一、什么是超媒体近年来迅速崛起的多媒体(multimedia)技术,是一种使计算机具有交互式地综合处理和管理文字、图形、图象、声音、视频等多种媒体能力的技术,必将使计算机技术发生一     

冲击噪声背景下的近场源二维参数估计方法

本文针对背景噪声为冲击噪声的情况,提出了一种新的近场源二维参数估计方法.本方法利用协变异(或协变异系数)构造矩阵,并通过求根的方法估计近场源的方向角和距离参数.该算法可以抑制冲击噪声对估计性能的影响,同时具有无需谱峰搜索的优点.仿真实验证明了该算法的有效性.     

单层多跨刚架在移动荷载作用下的影响量计算方法

讨论了桥梁、工业厂房和大型公共建筑中较多采用的单层多跨刚架在移动荷载作用下影响量的计算方法。以工程中计算连续梁的一次力矩分配法的概念和思路为基础,建立了结构中杆端真实抗转刚度和结点转角传递的概念及其相应计算公式,提出了一种单层多跨刚架超静定结构影响量的精确计算方法。算例表明,该方法较之传统的计算方法简捷,且既便于手算,也利于编制通用程序用于电算。     

Affine Dependence Classification for Communications Minimization

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.