基于程序升温法保留时间预测的气-质联用系统构建虚拟实验室

在气-质联用技术的理论研究及实验的基础上,采用Flash 8.0和ActionScript 2.0编程技术构建开放式网络气-质联用系统虚拟实验室。以若干有机物为考察对象,根据程序升温色谱法(PTGC)中保留值与温度及流速的关系,构建了不同色谱分析条件下保留参数的预测模型,同时利用Flash组件技术,构建与虚拟实验配套的气-质联用系统虚拟工作站。     

基于图像处理的自动聚焦技术及应用

自动聚焦技术是提高压痕直径测量系统测量精度、智能化和自动化的重要手段.介绍了采用图像处理法实现压痕直径测量系统的自动聚焦技术,核心就是选择一个合适的图像清晰度评价函数.在研究了众多图像清晰度评价函数的基础上,提出了基于向量模型和改进DCT变换的图像清晰度评价函数,实验表明,提出的算法具有良好的单峰性、准确性、稳定性、可靠性和快速性.最后通过基于COM组件技术的Matlab与VB混合编程来保证算法实现和软件设计.     

人工智能实验教学探讨

本文一方面简单介绍人工智能的基本理论及知识体系结构,另一方面则结合笔者的理论实践与实验教学经验,总结出目前在整个教学过程所存在的一些问题,目的在于不断总结经验,力争能更好地完成人工智能的整个教学工作,从而提高人才培养的质量,同时也可以为其他高校提供参考。     

基于改进的基因表达式编程算法在作业车间调度问题中的应用

文章提出一种新颖的方法一改进的基因表达式编程算法来求解作业车间调度问题。作业车间调度问题是许多实际生产调度问题的简化模型,基因表达式编程算法结合了遗传算法和遗传编程的优点,具有更强的解决问题能力,对基因表达式编程算法进行改进使其在作业车间调度问题的应用上更加有效;最后应用一个实例来验证提出方法的有效性。     

遗传编程在符号回归中的应用

遗传编程是一种新型的搜索优化技术,文章介绍了遗传编程的基本原理,以及遗传编程的算法设计及其实现的几个关键问题,并研究了基于遗传编程方法的符号回归。与传统回归方法相比,该方法得到的拟合函数更精确,具有更广泛的适用性。文中通过对一个函数进行符号回归验证,说明此方法合理可行。     

Analogy and duality of texture analysis by harmonics or indicators

According to the classic harmonic approach, an orientation density function (odf)f is expanded into its corresponding Fourier orthogonal series with respect to generalized spherical harmonics, and a pole density function (pdf) into its corresponding Fourier orthogonal series with respect to spherical harmonics. While pdfs are even (antipodally symmetric) functions, odfs are generally not. Therefore, the part of the odf which cannot be determined from normal diffraction pdfs can be mathematically represented as the odd portion of its series expansion. If the odff is given, the even part can be mathematically represented explicitly in terms off itself. Thus, it is possible to render maps ofharmonic orientation ghosts, and to evaluatevariants of mathematical standard odfs resulting in identical pdfs independent of pdf data. However, if only normal diffraction pdfs are known, the data-dependentvariation width of feasible odfs remained unaccessible, and within the harmonic approach a measure of confidence in a solution of the pdf-to-odf inversion problem does not exist.According to any discrete approach, an odff defined on some setG of orientations is expanded into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofG, and a pdf defined on the upper (lower) unit hemisphereS ₊ ^{3 3} into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofS ₊ ³ . The ambiguity of the pdf-to-odf inversion problem is discussed in terms of column-rank deficiency of the augmented projection matrix. The implication of the harmonic approach to split an odf into auniquely determined and anundetermined part does no longer seem to be reasonable. However, it is possible to numerically determine data-dependent confidence intervals for the Fourier coefficients with respect to the indicator functions which can be immediately interpreted as mean orientation densities within the elements of the partition ofG. Doing so for all Fourier coefficients in the finite series expansion, i.e. for all elements of the partition of the setG, eventually results in the data-dependent variation width of odfs feasible with respect to given pdf data, and to the partitions ofG andS ₊ ³ .Thus it is confirmed that the appearance of orientation ghosts, in particular correlations oftrue andghost orientation components, depends on the representation of an odf. It may be questioned whether in practical applications the implicit assumption of the harmonic method that the even part can be determined uniquely and free of error is generally a reasonable initial condition to develop ghost correction procedures.     

Supervisory control using variable lookahead policies

This paper deals with the efficient on-line calculation of supervisory controls for discrete event systems (DES's) in the framework of limited lookahead control policies (or LLPs) that we introduced in previous papers. In the LLP scheme, the control action after a given trace of events has been executed is calculated on-line on the basis of anN-step ahead projection of the behavior of the DES. To compute these controls, one must calculate after the execution of each event the supremal controllable sublanguage of a finite language with respect to another finite larger language. In our previous work, we showed how the required supremal controllable sublanguage calculation can be performed by using a backward dynamic programming algorithm over the nodes of the tree representation of these two languages. In this paper, we pursue the same approach for the calculation of LLP controls, but instead we adopt a forward calculation procedure over theN-level tree of interest. This forward procedure improves upon previous work by avoiding the explicit consideration of all the nodes of theN-level tree, while still permitting tree-to-tree recursiveness as enabled events are executed by the system. The forward search ends whenever a control decision can be made unambiguously or whenever the boundary of theN-level tree is reached, whichever comes first. This motivates the name Variable Lookahead Policy (or VLP) for this implementation of the LLP supervisory control scheme. This paper presents a general VLP algorithm and studies the properties of several special cases of it. The paper also discusses the implementation of the VLP algorithms and presents computational results regarding the application of these algorithms to a time-varying DES.     

含储能参与的日前市场价值公平分配机制

现有的节点边际电价机制中,由于传统发电商具有市场操控力,当储能独立参与市场出清时,各发电商采取策略性报价,打压并挤占储能电站的市场份额,阻碍了储能电站参与市场出清,间接导致市场出清总成本增大。为此,文中提出一种包含传统机组以及储能电站参与的市场竞争机制。首先,分析现有市场结算机制的弊端以及阻碍储能参与市场出清的原因;其次,建立含储能参与的市场出清模型,采用样本均值近似求解二阶段随机规划模型;接着,基于VCG结算机制,提出适应储能参与的日前市场价值分配机制;最后,提出解决激励相容而造成的系统收支不平衡问题的策略。文中采用修改后的IEEE30节点为例,证明该机制满足激励相容、收支平衡以及削弱传统发电商的市场操控力等性质,同时储能的参与将会减小系统出清总成本,降低市场价格剧烈波动的风险。     

A mathematical model for vehicle routing problem under endogenous uncertainty

In this study, a multistage stochastic programming (SP) model is presented for a variant of single-vehicle routing problem with stochastic demands from a dynamic viewpoint. It is assumed that the actual demand of a customer becomes known only when the customer is visited. This problem falls into the category of SP with endogenous uncertainty and hence, the scenario tree is decision-dependent. Therefore, nonanticipativity of decisions is ensured by conditional constraints making up a large portion of total constraints. Thus, a novel approach is proposed that considerably reduces the problem size without any effect on the solution space. Computational results on some test problems are reported.