一类新的非单调信赖域算法

提出了一类带线性搜索的非单调信赖域算法.算法将非单调Armijo线性搜索技术与信赖域方法相结合,使算法不需重解子问题.而且由于采用了MBFGS校正公式,使矩阵Bk能较好地逼近目标函数的Hesse矩阵并保持正定传递.在较弱的条件下,证明了算法的全局收敛性.数值结果表明算法是有效的.     

大洪水算法在平面选址问题中的应用

大洪水算法是通过模拟洪水上涨过程来进行全局寻优的启发式算法.针对连续优化问题,基于三种不同的邻域搜索策略对其进行改进,并针对一类平面选址问题进行应用测试.仿真结果表明,大洪水算法是一类简单高效的算法,可用于连续优化问题的求解.     

协同设计资源的两级不确定调度问题研究及其求解

针对协同设计资源调度问题中存在的设计任务不确定、资源需求模糊以及任务进行过程中可能出现变化等情况,提出一种基于不确定规划和反应式调度的两级不确定调度模型,通过根据满足系数对最好及最坏规划进行折中的方法对模型进行转化,然后采用离散的自由搜索算法进行求解.通过实例,验证了该方法的有效性.     

Categorizing Normal and Pathological Voices: Automated and Perceptual Categorization

Objectives

The aims of the present study were to evaluate the accuracy of an elaborated automated voice categorization system that classified voice signal samples into healthy and pathological classes and to compare it with classification accuracy that was attained by human experts.

Material and Methods

We investigated the effectiveness of 10 different feature sets in the classification of voice recordings of the sustained phonation of the vowel sound /a/ into the healthy and two pathological voice classes, and proposed a new approach to building a sequential committee of support vector machines (SVMs) for the classification. By applying “genetic search” (a search technique used to find solutions to optimization problems), we determined the optimal values of hyper-parameters of the committee and the feature sets that provided the best performance. Four experienced clinical voice specialists who evaluated the same voice recordings served as experts. The “gold standard” for classification was clinically and histologically proven diagnosis.

Results

A considerable improvement in the classification accuracy was obtained from the committee when compared with the single feature type-based classifiers. In the experimental investigations that were performed using 444 voice recordings coming from 148 subjects, three recordings from each subject, we obtained the correct classification rate (CCR) of over 92% when classifying into the healthy-pathological voice classes, and over 90% when classifying into three classes (healthy voice and two nodular or diffuse lesion voice classes). The CCR obtained from human experts was about 74% and 60%, respectively.

Conclusion

When operating under the same experimental conditions, the automated voice discrimination technique based on sequential committee of SVM was considerably more effective than the human experts.     

基于新型神经网络的乐曲内容检索技术研究

基于文字符号的检索体系,对于音乐材料效果不佳,基于内容的音乐信息检索会成为今后发展的关键。针对音乐检索技术的核心——音频特征描述和特征匹配,本文以音高和相对节奏为音乐作品的关键特征,发展了非毗邻层连接的前馈神经网络结构,给出了误差反传训练算法的分类器,并进行了试验研究。结果表明,非毗邻层连接的前馈神经网络结构有优越的识别性能和极快的收敛速度。     

可再生能源下燃煤电站-碳捕集优化调度

燃煤电站集成碳捕集技术在实现碳减排的同时可以提升电站灵活性,帮助电网消纳风光;而可再生能源网络可以提供富余能量来满足碳捕集的需求,提升电站碳捕集系统的经济性能。为此,本文提出了一种可再生能源背景下超临界燃煤电站-碳捕集系统的整体优化调度方法。该方法将深度学习与启发式计算融合,综合考虑机组运行约束和电网功率平衡约束,以降低运行成本和最大消纳风光为目标,对电站-碳捕集系统整体运行优化。结果表明,碳捕集系统的引入可以消纳51%的弃风弃光量,降低35%的碳捕集成本。通过比较,自由捕集率约束模式具有最好的优化调度空间,而平均捕集率约束模式在满足电网指定碳排放要求的同时能够保证良好的经济性。     

Fast quantum search driven by environmental engineering

Studies have demonstrated that a joined complete graph is a typical mathematical model that can support a fast quantum search. In this paper, we study the implementation of joined complete graphs in atomic systems and realize a quantum search of runtime $O(\sqrt{N})$ based on this implementation with a success probability of 50%. Even though the practical systems inevitably interact with the surrounding environment, we reveal that a successful quantum search can be realized through delicately engineering the environment itself. We consider that our study will bring about a feasible way to realize quantum information processing including quantum algorithms in reality.     

Novel two-dimensional PdSe phase: A puckered material with excellent electronic and optical properties

By combining structural search and first-principles calculations, we predict a new stable two-dimensional PdSe monolayer, and systematically investigate its structural, electronic and optical properties. The calculated formation enthalpy, phonon spectra and molecular dynamic simulations confirm that PdSe monolayer possesses excellent thermodynamic and dynamic stability. PdSe monolayer is a semiconductor with an indirect band gap of ∼ 1.10 eV. The carrier transport of PdSe monolayer is dominated by hole and exhibits remarkable anisotropy due to the intrinsic structure anisotropy. The optical properties also show obvious anisotropic characteristic with considerable absorption coefficient and broad absorption from the visible to ultraviolet regions. Benefiting from these excellent physical properties, PdSe monolayer is expected to be a promising candidate as electronic and optoelectronic devices.     

Adaptive error control during gradient search for an elliptic optimization problem

In this article we describe a cost effective adaptive procedure for optimization of a quantity of interest of a solution of an elliptic problem with respect to parameters in the data, using a gradient search approach. The numerical error in both the quantity of interest and the computed gradient may affect the progression of the search algorithm, while the errors generally change at each step during the search algorithm. We address this by using an accurate a posteriori estimate for the error in a quantity of interest that indicates the effect of error on the computed gradient and so provides a measure for how to refine the discretization as the search proceeds. Specifically, we devise an adaptive algorithm to refine and unrefine the finite element mesh at each step in the search algorithm. We give basic examples and apply this technique to a model of a healing wound.     

A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces

We introduce a two-step direct method, like Korpelevich's, for solving monotone variational inequalities. The advantage of our method over that one is that ours converges strongly in Hilbert spaces, whereas only weak convergence has been proved for Korpelevich's algorithm. Our method also has the following desirable property: the sequence converges to the solution of the problem that lies closest to the initial iterate.