Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

小型机载激光通信系统设计与验证

针对空空宽带高速通信的需求，设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能，并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能，其中粗跟踪误差为533.2 μrad(1σ)，精跟踪误差为3.6 μrad(1σ)，测试数据传输240 s，通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。     

某矿快速掘进最优炮孔间距的选择

山西某矿5308底抽巷在掘进过程中速度慢、效率低，直接影响工作面的瓦斯抽采，为了改善上述情形，对炮孔间距进行研究。通过使用ANSYS软件对不同炮孔间距下快速掘进效果的模拟分析，并经现场验证，得出了适应该矿的最佳炮孔间距。结果表明：炮孔间距为500 mm时，爆破产生裂隙发育范围和岩石损伤区域都最大，快速掘进的效果最好。     

Profiling drunk driving recidivists in Denmark

Drunk drivers are a menace to themselves and to other road users, as drunk driving significantly increases the risk of involvement in road accidents and the probability of severe or fatal injuries. Although injuries and fatalities related to road accidents have decreased in recent decades, the prevalence of drunk driving among drivers killed in road accidents has remained stable, at around 25% or more during the past 10 years. Understanding drunk driving, and in particular, recidivism, is essential for designing effective countermeasures, and accordingly, the present study aims at identifying the differences between non-drunk drivers, drunk driving non-recidivists and drunk driving recidivists with respect to their demographic and socio-economic characteristics, road accident involvement and other traffic and non-traffic-related law violations. This study is based on register-data from Statistics Denmark and includes information from 2008 to 2012 for the entire population, aged 18 or older, of Denmark. The results from univariate and multivariate statistical analyses reveal a five year prevalence of 17% for drunk driving recidivism, and a significant relation between recidivism and the drunk drivers’ gender, age, income, education, receipt of an early retirement pension, household type, and residential area. Moreover, recidivists are found to have a higher involvement in alcohol-related road accidents, as well as other traffic and, in particular, non-traffic-related offences. These findings indicate that drunk driving recidivism is more likely to occur among persons who are in situations of socio-economic disadvantage and marginalisation. Thus, to increase their effectiveness, preventive measures aiming to reduce drunk driving should also address issues related to the general life situations of the drunk driving recidivists that contribute to an increased risk of drunk driving recidivism.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

埋地管道泄漏内封堵装置设计与研究

针对流体输送埋地管道泄漏问题,设计了一种利用管道机器人携带封堵气囊进行快速应急封堵修复的埋地管道泄漏内封堵装置。采用矩阵变换方法建立了牵引系统驱动轮过弯方程,利用MATLAB软件对过弯方程进行了验证,同时利用ADAMS软件仿真分析过弯路径与驱动轮转角对牵引系统行走速度的影响。研究结果表明:由两个串联封堵器组成的应急封堵系统可满足复杂工况下的管道泄漏封堵要求;牵引系统驱动轮在弯管内部行走时,单轮速度呈周期性变化,但三个驱动轮整体周期运动特性一致;驱动轮转角在25°~40°时,牵引系统行走速度与驱动轮转角成正比,且转角为30°时驱动效果最好。该内封堵装置的结构设计可为管道泄漏应急封堵领域装备的研发提供重要参考。     

可调偏迈步式胶带自移机尾的研究

随着掘进工作面自动化程度的提高,掘进巷道速度也在日益加快,而现有的顺槽皮带机机尾移动缓慢且移动时工作量大,需要两三人配合操作,存在一定的安全隐患。针对以上问题,研发可调偏迈步式胶带自移机尾,具有与悬挂二运皮带转载机搭接行程长,可以迈步式前进,自动调偏等功能,同时,可以降低工人的劳动强度,加快巷道掘进速度。     

Uplink Scheduling in CDMA Packet-Data Systems

Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness of service among users, hence reducing chances of buffer overflows for poorly located users. The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time, and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement. Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users, and the strongly recieved users at the base as “strong” users. Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton, NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management and scheduling issues in telecommunication networks. Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S. from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University, all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering.     

A Bluetooth Based Sensor Network for Civil Infrastructure Health Monitoring

Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology.     

基于MODBUS协议的激光雕刻切割系统HMI人机交互设备

近年来,国内激光雕刻切割控制器技术发展迅速,基于PC的传统控制器已相当成熟.为了显著提高工业生产效率,适应工业生产规模扩张的需要以及工业对系统稳定性要求的提高,目前国内几家专业运动控制器厂家已经实现了激光雕刻切割控制器的完全脱机运行.本文针对脱机控制器的需要设计一款人机交互设备,该设备采用AT89C55WD单片机为主控制器,采用标准的MODBUS协议实现HMI与脱机控制器的可靠通讯.