G.729A+B语音编解码在新一代定点DSPs上的实现

文章介绍了ITU-TG．729A算法与ITU-TG．729B算法配合使用的语音编解码方案，并讨论了其在TI公司最新一代定点数字信号处理器(DSPs)TMS320C6416上实现的关键技术。G．729A是G.729编码器的简化版本，G．729B是带VAD(活动话音检测)的静音压缩算法。两者结合可以有效地降低码率，同时保持很好的合成语音质量。     

Molecular dynamic study for nanopatterning using atomic force microscopy

The atomic force microscopy (AFM)-based nanolithographic technique is currently used to directly machine material surfaces and fabricate nanocomponents for microelectromechanical systems (MEMS) devices. In the current study, three-dimensional molecular dynamic (MD) simulations with potentials based on the Morse function were performed to evaluate the effect of crystallographic factors and process variables on the nanodeformation characteristics of the nanolithography processing of monocrystalline copper. Moreover, the effects of process variables (tool shape, cutting speed, and ploughing depth) on the nanostructural pattern are investigated. The simulation results revealed that the crystal orientation and ploughing direction had a significant influence on varying the forces (cutting force, thrust force, and width-direction force); the nature of the nanodeformation ahead of the tool; and the surface quality of the machined material.     

Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective

This paper presents several search heuristics and their performance in batch scheduling of parallel, unrelated machines. Identical or similar jobs are typically processed in batches in order to decrease setup times and/or processing times. The problem accounts for allotting batched work parts into unrelated parallel machines, where each batch consists of a fixed number of jobs. Some batches may contain different jobs but all jobs within each batch should have an identical processing time and a common due date. Processing time of each job of a batch is determined according to the machine group as well as the batch group to which the job belongs. Major or minor setup times are required between two subsequent batches depending on batch sequence but are independent of machines. The objective of our study is to minimize the total weighted tardiness for the unrelated parallel machine scheduling. Four search heuristics are proposed to address the problem, namely (1) the earliest weighted due date, (2) the shortest weighted processing time, (3) the two-level batch scheduling heuristic, and (4) the simulated annealing method. These proposed local search heuristics are tested through computational experiments with data from dicing operations of a compound semiconductor manufacturing facility.     

基于统计分析的网络性能管理与故障预测

提出了一种基于统计分析的智能化网络性能管理方法，它利用网络性能监测中得到的统计信息对网络性能进行分析，进而对故障进行预测，提高了网络管理的智能化。论述了统计分析方法的原理，并且给出了网络管理应用实例，证明了它的有效性。     

分布式网络系统中时钟同步的实现

分布式网络系统对时钟同步的需求日益迫切，要求也越来越高。文章针对分布式舰载网络系统提出了采用NTP协议的分层式混合时钟同步方案，并描述了方案的实现。     

数字集成电路的可测性设计及其应用

首先论述了可测性设计的概念，分析了时序电路测试生成面临的困境。然后介绍了可测性设计的专门方法，并举例说明了它在实际中的应用。     

安钢高强板AH60的生产实践

本文论述了高强度低合金钢板AH60的试制过程，结合产品技术要求和生产实际设计合理的成分体系和工艺路线。     

基于蓄电池性能检测的交流恒流源设计

为了对蓄电池的性能进行在线检测和故障诊断．介绍了用以提供检测蓄电池的交流恒流源的设计思想和实现方法。通过实验进行了实例应用和验证，取得了较好的效果．为蓄电池的在线检测提供了一种实用的方法。     

Estimation of break location and size for loss of coolant accidents using neural networks

In this work, a probabilistic neural network (PNN) that has been applied well to the classification problems is used in order to identify the break locations of loss of coolant accidents (LOCA) such as hot-leg, cold-leg and steam generator tubes. Also, a fuzzy neural network (FNN) is designed to estimate the break size. The inputs to PNN and FNN are time-integrated values obtained by integrating measurement signals during a short time interval after reactor scram. An automatic structure constructor for the fuzzy neural network automatically selects the input variables from the time-integrated values of many measured signals, and optimizes the number of rules and its related parameters. It is verified that the proposed algorithm identifies very well the break locations of LOCAs and also, estimate their break size accurately.     

Gaussian process assisted coevolutionary estimation of distribution algorithm for computationally expensive problems

In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.