异构多核处理器的任务分配及能耗的研究*

异构多核处理器采用不同的任务分配与调度算法,会导致不同的时间消耗与能量消耗,采用合适的任务分配与调度算法能节省较多的能耗。目前普遍认为最有发展前途的任务分配与调度技术是先用启发式方法进行分组,然后再用遗传算法进行调度。在改进任务分组后,又首次提出了用遗传算法解决能耗问题。实验结果表明在实时要求不高的情况下,能以较小的时间代价来节省较多的能耗。     

一种汽轮机组排汽焓和最优初压在线计算方法

通过对已往的汽轮机变工况计算方法的分析,提出了以汽轮机末级抽汽或次末级抽汽(过热蒸汽状态)为计算起点的汽轮机顺序变工况核算方法。根据初始假定的末级流量和现场实际的末级前热力状态和背压,用汽轮机变工况流型判别准则,判别级的流型,然后从末级前参数开始顺序进行一次级的变工况核算,得到新的排汽焓,最后算得机组热耗率和排汽焓。以此方法为变工况计算的基础,并利用系统分析方法,建立了在线确定单元机组最优运行初压的数学模型。为火电机组的优化运行提出了一种新思路。     

An automatic parameter calibration method for the SWAT model in runoff simulation

Runoff simulation is highly significant for hydrological monitoring, flood peak simulation, water resource management, and basin protection. Runoff simulation by distributed hydrological models, such as the soil and water assessment tool (SWAT) model which is the most widely used, is becoming a hotspot for hydrological forecasting research. However, parameter calibration is inefficient and inaccurate for the SWAT model. An automatic parameter calibration (APC) method of the SWAT model was developed by hybrid of the genetic algorithm (GA) and particle swarm optimization (PSO). Multi‐station and multi‐period runoff simulation and accuracy analysis were conducted in the basin of the Zhangjiang River on the basis of this hybrid algorithm. For example, in the Yaoxiaba Station, the calibration results produced an R² of 0.87 and Nash Sutcliffe efficiency (NSE) index of 0.85, while verification results revealed an R² of 0.83 and NSE of 0.83. Results of this study show that the proposed method can effectively improve the efficiency and simulation accuracy of the model parameters. It can be concluded that the feasibility and applicability of GA‐PSO as an APC method for the SWAT model were confirmed via case studies. The proposed method can provide theoretical guidance for many hydrological research fields, such as hydrological simulation, flood prevention, and forecasting.     

模具生产联合体加工作业统一调度问题的研究

模具生产联合体是由小规模企业组成的模具设计、制造联盟，由于设备、工装和人员分属于不同的加盟企业，其作业排序过程非常复杂。为此提出一种复合式模具生产联合体的生产排序方法：依据基本优先规则首先完成单一工序作业，然后对多工序作业用改进遗传算法进行工艺优化，求出最优解和次优解，再使用评价函数法选择最佳作业路线。该方法在生产试验中取得了良好的成效．能较好满足模具用户和加盟企业两方面的需要。     

Evolutionary circuit design for fast FPGA-based classification of network application protocols

The evolutionary design can produce fast and efficient implementations of digital circuits. It is shown in this paper how evolved circuits, optimized for the latency and area, can increase the throughput of a manually designed classifier of application protocols. The classifier is intended for high speed networks operating at 100 Gbps. Because a very low latency is the main design constraint, the classifier is constructed as a combinational circuit in a field programmable gate array (FPGA). The classification is performed using the first packet carrying the application payload. The improvements in latency (and area) obtained by Cartesian genetic programming are validated using a professional FPGA design tool. The quality of classification is evaluated by means of real network data. All results are compared with commonly used classifiers based on regular expressions describing application protocols.     

Genetic algorithm‐based neural‐network modeling approach applied to AlGaN/GaN devices

An accurate equivalent circuit large‐signal model (ECLSM) for AlGaN‐GaN high electron mobility transistor (HEMT) is presented. The model is derived from a distributed small‐signal model that efficiently describes the physics of the device. A genetic neural‐network‐based model for the gate and drain currents and charges is presented along with its parameters extraction procedure. This model is embedded in the ECLSM, which is then implemented in CAD software and validated by pulsed and continuous large‐signal measurements of on‐wafer 8 × 125‐μm GaN on SiC substrate HEMT. Pulsed IV simulations show that the model can efficiently describe the bias dependency of trapping and self‐heating effects. Single‐ and two‐tone simulation results show that the model can accurately predict the output power and its harmonics and the associated intermodulation distortion (IMD) under different input‐power and bias conditions. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.     

Mining partial periodic correlations in time series

Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University. X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing. Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University. Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.     

Test frame updating in CPM testing of Prolog programs

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

改进的猴王遗传算法求解组合拍卖最优竞胜标

应用遗传算法求解第一价格封闭组合拍卖问题,编码及约束条件复杂,在交叉和变异的过程中容易产生大量不可行解,并且在选择和精英保留中,一些局部最优点(早熟点)对应的个体容易被大量复制,使群体多样性下降。该文就以上的问题,改进了原有遗传算法求解组合拍卖最优竞胜标的方法,并采用了猴王遗传算法的精英保留策略。实际计算证明本算法编码方式自然并且直观表达了个体和标的的关系。在交叉和变异算子中,产生不可行解的数量下降,更积极的保存了上一代进化的部分成果。而改进猴王遗传算法的精英保留策略,使算法能够以高概率跳出早熟,达到算法速度与准确的平衡。     

遗传算法与文本特征选择方法相结合的研究

对文本特征选择的传统方法进行了深入分析并对各自的优缺点进行了详细的对比;其次,通过利用遗传算法自身的寻优特点,把它与传统特征选择方法相结合,并得出了算法。最后,在对各自算法进行了分析,表明了在性能上有了明显的提高。