基于Android的火车票实名检票系统设计

介绍了一种基于嵌入式平台的实名制检票手持终端的硬件构成和软件实现。采用了Android嵌入式操作系统,对火车票上QR二维码和二代身份证RFID系统采集到的数据进行提取、显示。同时通过WIFI,将采集到的数据与服务器数据进行比对。实际运行表明,系统运行稳定,可正确快速地识别出实名火车票的真伪,实现了系统设计的功能要求。     

IEEE802.11p下删余卷积编码译码方法的研究

应用于智能交通系统的无线接入协议IEEE802.11p,其物理层卷积编码的码率可通过对(2,1,7)卷积编码器的删余来实现。讨论了删余位置的图案和算法,分析了在删余位置插入不同哑元时维特比译码后误码率的统计特性。仿真的同时比较了固定哑元下不同码率所引入的误比特率。     

基于CC1110单片机的无线升级方法研究

针对现有嵌入式设备无线升级方法中存在的占用资源多、升级程序类型不灵活以及功耗消耗大等问题,设计了一种基于CC1110无线单片机的应用程序装载系统来实现应用程序的无缝切换。介绍了系统无线升级的模型及方法,并分析了装载程序的长度和无线传输数据包长度与装载时间及能量消耗的关系。经试验平台测试表明,该方案具有较强的可靠性、及时性、灵活性和较好的节能性。     

Making-a-stop: A new bufferless routing algorithm for on-chip network

In the deep submicron regime, the power and area consumed by router buffers in network-on-chip (NoC) have become a primary concern. With buffers elimination, bufferless routing is emerging as a promising solution to provide power-and-area efficiency for NoC. In this paper, we present a new bufferless routing algorithm that can be coupled with any topology. The proposed routing algorithm is based on the concept of making-a-stop (MaS), aiming to deadlock and livelock freedom in wormhole-switched NoC. Performance evaluation is carried out by using a flit-level, cycle-accurate network simulator under synthetic traffic scenarios. Simulation results indicate that the proposed routing algorithm yields an improvement over the recent bufferless routing algorithm in average latency, power consumption, and area overhead by up to 10%, 9%, and 80%, respectively.     

A meta-analysis of mobile commerce adoption and the moderating effect of culture

This research aims to discover the general factors that influence mobile commerce adoption. A meta-analysis of previous empirical studies on individuals’ mobile commerce adoption behavior was conducted and the proposed mobile commerce adoption model was tested using structural equation modeling. Furthermore, moderator analysis was carried out using partition tests by dividing context into subgroups of eastern and western culture, to investigate the moderating effect of culture. Results confirm the proposed model, and moderator analysis indicates that culture does have specific moderating effects on mobile commerce adoption. The findings of this paper will yield theoretical and managerial implications for the future.     

An improved security-aware packet scheduling algorithm in real-time wireless networks

Developing security-aware packet scheduling algorithms can efficiently enhance the security while delivering packets through wireless links. Existing scheduling algorithms developed for real-time wireless networks provide security at the cost of other important performance, e.g., schedulability. The performance problem becomes especially apparent when wireless networks are heavily loaded. To address this issue, we propose in this paper an improved security-aware packet scheduling algorithm (or ISAPS in short) in wireless networks. ISAPS first gives high priority to deal with schedulability when the real-time system is heavily loaded. When the system is under light workload, ISAPS strives to improve the security levels while achieving high schedulability for real-time packets. Compared with the existing packet scheduling algorithm SPSS, ISAPS shows excellent scheduling quality under a wide range of workload characteristics.     

Maximum speedup ratio curve (MSC) in parallel computing of the binary-tree-based drainage network

Restricted computational capacity has become a key factor in limiting the development of a majority of distributed basin models. Parallel computing is one of the most effective methods for solving this problem. Although many parallel-computing methods have been employed in basin models, few studies have carried out theoretical research on parallel characteristics of river basins. In this paper, the drainage network of river basins is treated as a binary-tree structure. Using the binary-tree theory, we find that there exists a maximum speedup curve (MSC) for an arbitrary drainage network. The x-coordinate of the MSC represents the number of processors used during the computing, while the y-coordinate corresponds to the maximum speedup ratio (MSR) that can be obtained. Under several essential assumptions, the theoretical function of MSC is established. The function indicates that the MSC consists of an ascending section and a horizontal section. A parallel algorithm capable of acquiring the MSC is proposed as well. Using this algorithm, the MSC is tested at two different-resolution drainage networks of the Lhasa River Basin. A 2-year rainfall-runoff process is simulated. The results prove the existence of MSC. However, primarily influenced by the load imbalance of subbasins, the simulation values of MSR are usually smaller than the theoretical ones.     

Procedural models for cartoon cracks and fractures animations

We present an approach for animating cracks and fractures in cartoon style. In our method we take a 2D hand-drawn object as input and then construct a 2.5D model of the object in order to approximate the object volume. Next, we generate the Voronoi textures on the 2.5D object model for visual abstraction of cartoon cracks. Further, cracking gaps on the Voronoi textures are widened progressively until Voronoi cells split apart and finally fall onto ground according to simplified physical rules. With minimum user intervention, our model is able to generate cartoon cracks and fractures animations procedurally, as demonstrated by examples given in the paper.     

An Efficient Algorithm for Haplotype Inference on?Pedigrees with a Small Number of Recombinants

Combinatorial (or rule-based) methods for inferring haplotypes from genotypes on a pedigree have been studied extensively in the recent literature. These methods generally try to reconstruct the haplotypes of each individual so that the total number of recombinants is minimized in the pedigree. The problem is NP-hard, although it is known that the number of recombinants in a practical dataset is usually very small. In this paper, we consider the question of how to efficiently infer haplotypes on a large pedigree when the number of recombinants is bounded by a small constant, i.e. the so called k-recombinant haplotype configuration (k-RHC) problem. We introduce a simple probabilistic model for k-RHC where the prior haplotype probability of a founder and the haplotype transmission probability from a parent to a child are all assumed to follow the uniform distribution and k random recombination events are assumed to have taken place uniformly and independently in the pedigree. We present an O(mnlog? ^k+1 n) time algorithm for k-RHC on tree pedigrees without mating loops, where m is the number of loci and n is the size of the input pedigree, and prove that when 90log?n<m<n ³, the algorithm can correctly find a feasible haplotype configuration that obeys the Mendelian law of inheritance and requires no more than k recombinants with probability $1 -O(k^{2}\frac{\log^{2}n}{mn}+\frac{1}{n^{2}})$ . The algorithm is efficient when k is of a moderate value and could thus be used to infer haplotypes from genotypes on large tree pedigrees efficiently in practice. We have implemented the algorithm as a C++ program named Tree-k-RHC. The implementation incorporates several ideas for dealing with missing data and data with a large number of recombinants effectively. Our experimental results on both simulated and real datasets show that Tree-k-RHC can reconstruct haplotypes with a high accuracy and is much faster than the best combinatorial method in the literature.