在线煤浆灰分测量的煤泥浮选优化控制系统研究

分析了煤泥浮选自动控制的特点和关键技术。设计并实现了非接触式的同位素煤浆灰分检测装置及多流分析装置，能同时检测原、精、尾煤的灰分。研制了以实时煤浆灰分为反馈量的煤泥浮选优化控制系统，用模糊控制方法调节浮选加药量和浮选槽液位，在保证精煤质量的前提下提高精煤产率。通过现场实践证明了技术路线的可行性。     

利用优化组合GM（n,h）模型预测油藏动态

灰色系统理论自１９８２年以来已在许多领域得到了广泛８。量在藏动态预测的应用却很有限，而用应用效果不甚理想。本文阐述了灰色系统理论在油藏动态预测中的基本思想，并结合油藏生产实际资料，成本地预测了各项开发指标，预测符合率高，可行性强。     

不同斜率赛场的长江竞渡模型与仿真

针对"武汉国际长江抢渡挑战赛"中将近三分之二的选手不能成功到达终点这一突出问题,建立了不同斜率赛场条件下时间最优的长江竞渡模型.结合其影响因素,讨论了不同情况下参赛选手所应采取的优化策略,并在MATLAB/simulink仿真平台上运用迭代搜索法求解该实际问题,仿真结果显示了各年竞渡的最优成绩,证明了研究不同赛场条件下长江竞渡优化策略的重要性.该模型简单、容易理解和运用,在实际竞渡、洋流影响的航行及气流影响的飞行领域都具有参考应用价值.     

基于改进蚁群算法的物流配送问题研究

对带时间窗的物流配送车辆路径优化调度问题进行了描述,给出了数学模型,在最大～最小蚁群算法的基础之上,提出了一种改进的蚁群算法,在物流配送路径优化问题初始解的构造、路径优化、转移规则、信息素更新方式、算法终止判断等进行了改进,并通过引入信息熵的概念,利用与算法运行过程有关的信息熵的值表示选择过程中的不确定性,来控制路径选择和局部随机变异扰动的概率,以实现算法的自适应调节,同时结合局部优化方法对解进行二次优化,通过这些改进,提高了算法的搜索效率,实验仿真整明了该改进算法的有效性.     

A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures

Irregular access patterns are a major problem for today’s optimizing compilers. In this paper, a novel approach will be presented that enables transformations that were designed for regular loop structures to be applied to linked list data structures. This is achieved by linearizing access to a linked list, after which further data restructuring can be performed. Two subsequent optimization paths will be considered: annihilation and sublimation, which are driven by the occurring regular and irregular access patterns in the applications. These intermediate codes are amenable to traditional compiler optimizations targeting regular loops. In the case of sublimation, a run-time step is involved which takes the access pattern into account and thus generates a data instance specific optimized code. Both approaches are applied to a sparse matrix multiplication algorithm and an iterative solver: preconditioned conjugate gradient. The resulting transformed code is evaluated using the major compilers for the x86 platform, GCC and the Intel C compiler.     

XDP: A compiler intermediate language extension for the representation and optimization of data movement

The ability to represent, manipulate, and optimize data placement and movement between processors in a distributed address space machine is crucial in allowing compilers to generate efficient code. Data placement is embodied in the concept of dataownership. Data movement can include not just the transfer of data values but the transfer of ownership as well. However, most existing compilers for distributed address space machines either represent these notions in a language-or machine-dependent manner, or represent data or ownership transfer implicitly. In this paper we describe XDP, a set of intermediate language extensions for representing and manipulating data and ownership transfers explicitly in a compller. XDP is supported by a set of per-processor structures that can be used to implement ownership testing and manipulation at run-time, XDP provides a uniform framework for translating and optimizing sequential, data parallel, and message-passing programs to a distributed address space machine. We describe analysis and optimization techniques for this explicit representation. Finally, we compare the intermediate languages of some current distributed address space compilers with XDP.     

三层C/S结构报刊发行信息系统的设计实现

本文阐述了三层C/S体系结构的优点,TUXEDO中间件的主要功能和特点,介绍了在Linux操作系统下基于TUXEDO的三层C/S体系结构的报刊发行信息系统的设计与实现。     

采用两级软件流水技术的VLIW优化编译器

本文首先提出一种能够充分开发循环程序指令级细粒度并行性的编译技术——两级软件流水,该技术基于URPR软件流水算法,把资源分配和代码优化有机地结合起来;然后叙述采用两级软件流水的VLIW优化编译器;最后给出一个FFT内层循环编译过程的实例及初步实验结果.