基于分支定界法的相控阵雷达事件调度算法

为解决相控阵雷达事件调度问题中调度成功率、时间偏移率与算法时效性三者之间的矛盾，本文提出一种基于分支定界法的调度算法；该算法首先在现有调度结果上调取所有可执行事件，即获得若干"节点"，多步递推后由多"层"节点形成若干条备选"分支"，扩大解空间范围，提高算法性能；然后通过"删减"操作删减掉收益较低分支，将解空间控制在一适当范围内，减小搜索盲目性，降低算法计算量.仿真实验表明，与基于综合优先级算法的调度结果相比，利用本文算法调度时调度成功率提升了52%；与基于时间指针算法的调度结果相比，本身算法时间偏移率降低了61%；与基于遗传算法的调度结果相比，本文算法调度耗时仅为前者1~2%.     

结合时间戳的指纹密钥数据加解密传输方案

目的 对于生物密钥而言，生物特征数据的安全与生物密钥的管理存储都很关键。为了构造能够应用在通信数据传输场景的生物密钥，同时保证生物特征本身的模糊性与密码学的精确性处于一种相对平衡状态，提出一种基于时间戳与指纹密钥的数据加解密传输方案。方法 利用发送方指纹特征点之间的相对信息，与保密随机矩阵生成发送方指纹密钥；借助通信双方的预先设定数与时间戳，生成接收方恢复指纹密钥时所需的辅助信息；利用发送方指纹密钥加密数据，实现密文数据的传输。结果 本文方法在仿真通信双方数据加解密的实现中，测试再生指纹密钥的识别率（GAR）与误识率（FAR）。通过实验数据分析，表明了本文提出的指纹密钥生成方法的可用性，以及指纹密钥作为数字身份所具备的可认证性，其中真实发送方的再生指纹密钥识别率可高达99.8%，并且本方案还可用于即时通信、对称加密等多种场景当中。结论 本文方法利用时间戳确定了通信事件的唯一性与不可否认性，同时实现了指纹密钥恢复时的"一次一密"。此外，方案通过保密随机矩阵实现了发送方指纹密钥的可撤销，极大程度保障了指纹数据的安全性。     

Fatigue crack growth analysis of a square hollow section T-joint

Stress concentration sites are always found at the brace and chord intersection corners of any rectangular welded tubular joint. As a result, fatigue cracks are liable to be initiated and propagated from these corners. In this paper, the 3D fatigue crack growth under the weld toe of a square hollow section welded T-joint is simulated using boundary element method. In accordance with the 3D analyses, fatigue crack growth is predicted using a model based on the Paris’ law and stress intensity factors. Good agreement between the experimental and predicted crack growth and crack shape development is obtained. Based on this crack growth analysis, the fatigue life of a specimen is predicted and compared with the standard S-N curve for hollow section joints. It is found that the standard S-N curve is safe and slightly conservative.     

Numerical evaluation of wind effects on a tall steel building by CFD

A comprehensive numerical study of wind effects on the Commonwealth Advisory Aeronautical Council (CAARC) standard tall building is presented in this paper. The techniques of Computational Fluid Dynamics (CFD), such as Large Eddy Simulation (LES), Reynolds Averaged Navier-Stokes Equations (RANS) Model etc., were adopted in this study to predict wind loads on and wind flows around the building. The main objective of this study is to explore an effective and reliable approach for evaluation of wind effects on tall buildings by CFD techniques. The computed results were compared with extensive experimental data which were obtained at seven wind tunnels. The reasons to cause the discrepancies of the numerical predictions and experimental results were identified and discussed. It was found through the comparison that the LES with a dynamic subgrid-scale (SGS) model can give satisfactory predictions for mean and dynamic wind loads on the tall building, while the RANS model with modifications can yield encouraging results in most cases and has the advantage of providing rapid solutions. Furthermore, it was observed that typical features of the flow fields around such a surface-mounted bluff body standing in atmospheric boundary layers can be captured numerically. It was found that the velocity profile of the approaching wind flow mainly influences the mean pressure coefficients on the building and the incident turbulence intensity profile has a significant effect on the fluctuating wind forces. Therefore, it is necessary to correctly simulate both the incident wind velocity profile and turbulence intensity profile in CFD computations to accurately predict wind effects on tall buildings. The recommended CFD techniques and associated numerical treatments provide an effective way for designers to assess wind effects on a tall building and the need for a detailed wind tunnel test.     

Consistent boundary conditions for flows within the atmospheric boundary layer

In computational wind engineering the neutrally stable atmospheric boundary layer (ABL) is often simulated using the standard k-ε model. The application of boundary conditions that are inconsistent with the profiles used at the inflow boundary causes streamwise gradients in the solution and prevents the simulation of a horizontally homogeneous boundary layer. In the present work these problems are overcome by applying a simple extension of the shear stress boundary condition at the top of the domain and by using one-dimensional models to generate inflow profiles in equilibrium with the ground boundary condition. This procedure allows the impact of the inconsistent boundary conditions to be quantitatively assessed. It is shown that inconsistent boundary conditions at the top of the domain result in erroneous streamwise gradients throughout the domain. These errors are reduced by enlarging the domain in the vertical direction but are not removed. The errors are also found in simulations with idealised and real topography included in the domain. A brief discussion of the impact of the errors on simulations of wind energy projects is given.     

S M3杂凑算法的流水线结构硬件实现

提出一种流水线结构的硬件实现策略,同时采用CSA加法器进行关键路径压缩,极大地提高了工作频率和算法的计算速率．在191 M Hz时钟频率下,实现了73．54 Gb／s的高吞吐率．     

Side-Channel Analysis for the Authentication Protocols of CDMA Cellular Networks

Time-division multiple access (TDMA) and code-division multiple access (CDMA) are two technologies used in digital cellular networks. The authentication protocols of TDMA networks have been proven to be vulnerable to side-channel analysis (SCA), giving rise to a series of powerful SCA-based attacks against unprotected subscriber identity module (SIM) cards. CDMA networks have two authentication protocols, cellular authentication and voice encryption (CAVE) based authentication protocol and authentication and key agreement (AKA) based authentication protocol, which are used in different phases of the networks. However, there has been no SCA attack for these two protocols so far. In this paper, in order to figure out if the authentication protocols of CDMA networks are sufficiently secure against SCA, we investigate the two existing protocols and their cryptographic algorithms. We find the side-channel weaknesses of the two protocols when they are implemented on embedded systems. Based on these weaknesses, we propose specific attack strategies to recover their authentication keys for the two protocols, respectively. We verify our strategies on an 8-bit microcontroller and a real-world SIM card, showing that the authentication keys can be fully recovered within a few minutes with a limited number of power measurements. The successful experiments demonstrate the correctness and the effectiveness of our proposed strategies and prove that the unprotected implementations of the authentication protocols of CDMA networks cannot resist SCA.     

Exploiting array manipulation habits to optimize garbage collection and type flow analysis

A widespread practice to implement a flexible array is to consider the storage area into two parts: the used area, which is already available for read/write operations, and the supply area, which is used in case of enlargement of the array. The main purpose of the supply area is to avoid as much as possible the reallocation of the whole storage area in case of enlargement. As the supply area is not used by the application, the main idea of the paper is to convey the information to the garbage collector, making it possible to avoid completely the marking of the supply area. We also present a simple method to analyze the types of objects, which are stored in an array as well as the possible presence of NULL values within the array. This allows us to better specialize the work of the garbage collector when marking the used area, and also, by transitivity, to improve overall results for type analysis of all expressions of the source code. After introducing several abstract data types, which represent the main arrays concerned by our technique (i.e., zero or variable indexing, circular arrays and hash maps), we measure its impact during the bootstrap of two compilers whose libraries are equipped with these abstract data types. We then measure, on various software products we have not written, the frequency of certain habits of manipulation of arrays, to assess the validity of our approach. Copyright © 2014 John Wiley & Sons, Ltd.     

Sketch-based data plane hardware model for software-defined measurement

A sketch-based data plane hardware model for software-defined measurement was introduced,and it was implemented in the programmable network device NetMagic.A generic sketch model for collecting flow-level data using high-speed memories on the FPGA was proposed,the control plane collected and cached the data for further process.Count-min sketch and 2-universal hash functions in the SRAM of FPGA for real-time traffic counting of high-speed traffic were implemented; Bloom filter was used to rebuild the original 5-tuple data which solved the irreversibility of sketch.The CERNET backbone trace to evaluate the prototype system was used,the result shows that it has the ability to use the limited hardware resource to measure a large amount of network traffic data with a proper measurement accuracy at the same time.