设计IIR数字滤波器的遗传优化算法

提出了ＩＩＲ数字滤波器设计的遗传优化法。这是一种模拟自然遗传和达尔文进化理论的随机并行优化算法。首先，详细描述了遗传算法并给出了计算步骤，然后将遗传算法用于ＩＩＲ数字滤波器的优化设计，最后给出了模拟计算结果。     

蛋白石型光子晶体红外隐身材料的制备

基于光子晶体的红外隐身材料,主要采取一维层层堆叠结构和三维木堆结构等来实现对红外波段电磁波辐射性能的调控.本文报道了一种操作简易、成本低廉的光子晶体红外隐身材料制备方法.通过优化的垂直沉积法,微米级SiO_2胶体微球自组装成高质量的蛋白石型光子晶体结构.对SiO_2胶体微球进行优选,成功制备了禁带位于2.8—3.5μm,8.0—10.0μm的SiO_2胶体晶体蛋白石型光子晶体材料.该材料可改变目标相应波段的红外辐射特征,具有目标红外波段的隐身效果.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming

In this work we devise efficient algorithms for finding the search directions for interior point methods applied to linear programming problems. There are two innovations. The first is the use of updating of preconditioners computed for previous barrier parameters. The second is an adaptive automated procedure for determining whether to use a direct or iterative solver, whether to reinitialize or update the preconditioner, and how many updates to apply. These decisions are based on predictions of the cost of using the different solvers to determine the next search direction, given costs in determining earlier directions. We summarize earlier results using a modified version of the OB1-R code of Lustig, Marsten, and Shanno, and we present results from a predictor–corrector code PCx modified to use adaptive iteration. If a direct method is appropriate for the problem, then our procedure chooses it, but when an iterative procedure is helpful, substantial gains in efficiency can be obtained.     

激光扫描声学显微镜层析成像技术研究

为了获得被测物体三维信息同时具有较高的分辨率,在电子科技大学光电声学信息处理研究中心研制成功的激光扫描声学显微镜的基础上,通过检测电路、数据获取等方面进行的硬件改进以及相应的算法研究,结合层析技术获得层析扫描声学显微镜的样机。通过测试结果可以看出,层析扫描声学显微镜可以获得被测物体的内部层析图像信息,同时具有更高的分辨率。     

粒子群优化算法用于光纤布拉格光栅综合问题的研究

提出了一种新的光纤光栅综合技术,将光纤光栅的传输矩阵法与粒子群优化算法(PSO)结合起来,得到了一种光纤光栅综合问题的全新方法。通过调整粒子群优化算法的相关参数,我们可以得到适合需要的反射谱。与其它光栅综合算法相比,该方法具有简单,收敛速度快等优点,同时该技术具有普遍性,还可以用于其它类似的综合问题。     

MALDI质谱技术在酶活性分析中的应用

酶作为生物催化剂参与很多重要的生理过程,同时也是一类重要的生物分子。酶的活性分析对于疾病诊断和治疗具有重要意义。基质辅助激光解吸电离飞行时间质谱(MALDI-TOF MS)具有操作简单、分析速度快、灵敏度高和易于实现高通量分析的特点,已被广泛用于各种组学研究和生物分子的检测,在酶的检测和活性分析中亦发挥了重要作用。该文综述了国内外利用MALDI-TOF MS分析酶活性和进行药物筛选的策略,总结了各种方法的优缺点,提出了MALDI质谱技术在酶活性分析领域存在的问题和挑战,并对其发展前景进行了展望。     

Monitoring of metabolic profiling and water status of Hayward kiwifruits by nuclear magnetic resonance

The metabolic profiling of kiwifruit (Actinidia deliciosa, Hayward cultivar) aqueous extracts and the water status of entire kiwifruits were monitored over the season (June-December) using nuclear magnetic resonance (NMR) methodologies. The metabolic profiling of aqueous kiwifruit extracts was investigated by means of high field NMR spectroscopy. A large number of water-soluble metabolites were assigned by means of 1D and 2D NMR experiments. The change in the metabolic profiles monitored over the season allowed the kiwifruit development to be investigated. Specific temporal trends of aminoacids, sugars, organic acids and other metabolites were observed.The water status of kiwifruits was monitored directly on the intact fruit measuring the T₂ spin-spin relaxation time by means of a portable unilateral NMR instrument, fully non-invasive. Again, clear trends of the relaxation time were observed during the monitoring period.The results show that the monitoring of the metabolic profiling and the monitoring of the water status are two complementary means suitable to have a complete view of the investigated fruit.     

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

This paper considers the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. It continues recent work by Bräsel et al. [H. Bräsel, A. Herms, M. Mörig, T. Tautenhahn, T. Tusch, F. Werner, Heuristic constructive algorithms for open shop scheduling to minmize mean flow time, European J. Oper. Res., in press (doi.10.1016/j.ejor.2007.02.057)] on constructive algorithms. For this strongly NP-hard problem, we present two iterative algorithms, namely a simulated annealing and a genetic algorithm. For the simulated annealing algorithm, several neighborhoods are suggested and tested together with the control parameters of the algorithm. For the genetic algorithm, new genetic operators are suggested based on the representation of a solution by the rank matrix describing the job and machine orders. Extensive computational results are presented for problems with up to 50 jobs and 50 machines, respectively. The algorithms are compared relative to each other, and the quality of the results is also estimated partially by a lower bound for the corresponding preemptive open shop problem. For most of the problems, the genetic algorithm is superior when fixing the same number of 30 000 generated solutions for each algorithm. However, in contrast to makespan minimization problems, where the focus is on problems with an equal number of jobs and machines, it turns out that problems with a larger number of jobs than machines are the hardest problems.