A lightweight authentication scheme based on self‐updating strategy for space information network

The security of space information network (SIN) is getting more and more important now. Because of the special features of SIN (e.g., the dynamic and unstable topology, the highly exposed links, the restricted computation power, the flexible networking methods, and so on), the security protocol for SIN should have a balance between security properties and computation/storage overhead. Although a lot of security protocols have been proposed recently, few can provide overall attacks resistance power with low computation and storage cost. To solve this problem, in this paper we propose a lightweight authentication scheme for space information network. It is mainly based on the self‐updating strategy for user's temporary identity. The scheme consists of two phases, namely, the registration phase and the authentication phase. All the computing operations involved are just hash function (h), the bit‐wise exclusive‐or operation (⊕), and the string concatenation operation (||), which are of low computation cost. The security properties discussion and the attacks–resistance power analysis show that the proposed authentication scheme can defend against various typical attacks, especially denial of service attacks. It is sufficiently secure with the lowest computation and storage costs. Furthermore, the formal security proof in SVO logic also demonstrates that the scheme can satisfy the security goals very well. Copyright © 2016 John Wiley & Sons, Ltd.     

Robust tracking with discriminative ranking lists

In this paper, we propose a novel tracking algorithm, i.e., the discriminative ranking list-based tracker (DRLTracker). The DRLTracker models the target object and its local background by using ranking lists of patches of different scales within object bounding boxes. The ranking list of each of such patches is its K nearest neighbors. Patches of the same scale with ranking lists of high purity values (meaning high probabilities to be on the target object) and some confusable background patches constitute the object model under that scale. A pair of object models of two different scales collaborate to determine which patches may belong to the target object in the next frame. The DRLTracker can effectively alleviate the distraction problem, and its superior ability over several representative and state-of-the-art trackers is demonstrated through extensive experiments.     

一种数字光栅无掩模光刻对准方法

针对数字微反射镜装置(DMD)无掩模光刻系统,提出并研究了一种数字光栅无掩模光刻对准方法,将硅片的微位移放大显示在数字光栅与硅片物理光栅叠加产生的叠栅条纹中。建立了基于DMD的数字光栅无掩模光刻对准模型,设计了对准标记以及具体的实现方案,并对模型进行了数值仿真和初步的实验验证。结果表明,采用频率可变、图像干净、具有良好周期性结构的数字光栅代替传统的真实掩模光栅,真正实现了零掩模成本;并且采用变频率数字光栅可以扩大测量范围,减小位移测量误差。最终可以实现深亚微米的对准精度,满足目前无掩模光刻对准精度的要求。     

Coding statistics based fast mode decision for multi-view video coding

Reduction of high computational complexity of multi-view video coding (MVC) is necessary for realization in consumer electronics. Since mode decision is one of the key computational bottlenecks of multi-view video encoders, this paper proposes a coding statistics based fast mode decision algorithm. First of all, a rate–distortion cost based fast DIRECT mode decision algorithm early terminates the mode decision process if possible. Next, the candidates for Inter modes are reduced by taking the advantage of the correlation between an optimal mode and motion cost. The proper thresholds to reduce the candidates for the above two fast algorithms can be easily derived from exponential functions at run time. Finally, motion vector difference based motion characteristics is referred to further speed up the mode decision process of Inter modes. The experimental results show that the proposed scheme reduces up to 70.82% of encoding time with negligible degradation of RD performance.     

Performance and optimization of multistage partial parallel interference cancellation for wideband CDMA systems in multipath fading channels

In this paper, a closed-form bit error rate (BER) of hard-decision multistage partial parallel interference cancellation (PPIC) having perfect and imperfect channel estimation for complex spreading code-division multiple access (CDMA) over multipath Rayleigh channels was derived. The effects of receiving BER, power ratio of pilot to data channels, multiple-access interference (MAI) and multipath interference, additive white Gaussian noise, and other factors affecting channel estimation error are analyzed. The expression determining the optimal interference cancellation weight at path level for PPIC is first derived. Then, the oscillatory behavior of user-level-optimized PIC and the convergence of perfect channel estimation PIC and path-level-optimized PIC are validated. Results indicate that all factors determining the optimal weight certainly affect the BER performance of PPIC and that the lower BER limit of multistage PPIC depends on the adjustable factors, which include power ratio, observation length, and signal-to-noise ratio, and an unchangeable factor, i.e., number of users. In addition, the variance of MAI for complex spreading sequence is obtained, and the analytical expression can also be employed to predict the performance of multicode CDMA.     

基于仿射传播聚类的概率分布室内定位算法

随着定位技术的快速发展,基于无线局域网的室内定位成为新的研究热点。本文提出了一种基于近邻传播聚类的概率分布无线局域网(WLAN)室内定位算法。与传统室内定位算法相比,该算法首先引入近邻传播聚类缩小参考点搜索空间,然后利用概率分布定位算法进行精确定位。仿射传播聚类可以有效减少概率分布定位算法的计算量,应用于系统后将有效降低系统复杂度。实验结果表明,本文所提算法具有更好的定位精度,可实现对WLAN室内定位目标的快速、可靠定位。     

A multilayer recognition model for twitter user geolocation

Wireless Networks - Geolocation is important for many emerging applications such as disaster management and recommendation system. In this paper, we propose a multilayer recognition model (MRM) to...     

Resource allocation for OFDM relay systems with statistical QoS guarantees

By integrating the concept of effective capacity, we propose the resource allocation schemes for subcarrier‐pair based OFDM decode‐and‐forward and amplify‐and‐forward relay systems for quality‐of‐service (QoS) guarantees. The objective is to maximize the system throughput subject to a given statistical delay QoS constraint. First, we pair the subcarriers over the source‐relay channel and the relay‐destination channel by the descending order of the subcarriers' channel gains. Second, by making use of the derived equivalent end‐to‐end channel gains of the subcarrier pairs, we apply joint water‐filling power allocation over the subcarrier pairs and then partition the power of the subcarrier pairs between the source and the relay. We prove that as the equivalent end‐to‐end channel gains of the subcarrier pairs are given, the combination of sorted subcarrier pairing and joint water‐filling power allocation is jointly optimal to maximize the effective capacity. The simulation results show that our proposed schemes achieve the highest effective capacity for OFDM decode‐and‐forward and amplify‐and‐forward relay systems as compared with other existing schemes. The results also verify that our proposed schemes can efficiently provide different levels of delay QoS guarantees, even if under the stringent delay QoS constraints. Copyright © 2012 John Wiley & Sons, Ltd.     

Trust establishment in cooperative wireless relaying networks

In cooperative wireless networks, relay nodes are employed to improve the performance of the network in terms of throughput and reliability. However, the presence of malicious relay nodes in the network may severely degrade the performance of the system. When a relay node behaves maliciously, there exists a possibility that such a node refuses to cooperate when it is selected for cooperation or deliberately drops the received packets. Trust establishment is a mechanism to detect misbehaving nodes in a network. In this paper, we propose a trust establishment method for cooperative wireless networks by using Bayesian framework. In contrast with the previous schemes proposed in wireless networks, this approach takes the channel state information and the relay selection decisions into account to derive a pure trust value for each relay node. The proposed method can be applied to any cooperative system with a general relay selection policy whose decisions in each cooperative transmission are independent of the previous ones. Moreover, it does not impose additional communication overhead on the system as it uses the available information in relay selection procedure. Copyright © 2012 John Wiley & Sons, Ltd.     

不同氧化退火工艺下SiO2/SiC界面特性研究

The effect of the different re-oxidation annealing （ROA） processes on the SiO2/SiC interface charac- teristics has been investigated. With different annealing processes, the flat band voltage, effective dielectric charge density and interface trap density are obtained from the capacitance-voltage curves. It is found that the lowest interface trap density is obtained by the wet-oxidation annealing process at 1050 ℃ for 30 min, while a large num- ber of effective dielectric charges are generated. The components at the SiO2/SiC interface are analyzed by X-ray photoelectron spectroscopy （XPS） testing. It is found that the effective dielectric charges are generated due to the existence of the C and H atoms in the wet-oxidation annealing process.