一个双参数的共轭梯度法簇

提出了含有双参数的新共轭梯度法厥公式，证明了该方法在适当选取参数口的SWP线搜索下具有充分下降性和全局收敛性，数值试验结果良好．     

Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design

DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.     

An ERP study for the degrees of the difficulty in visual search

The present study mainly probed the relationships between ERP components and the degrees of difficulty in visual search. Three experimental and one controlled conditions were randomly selected. Results showed that the P1, N1, and P2 amplitudes and latencies had no significant differences among the three experimental and one controlled conditions, and the ERP waveforms of low perceptual load of visual search were different from that of high perceptual load. These results might indicate that the latencies and amplitudes of initial P1, N1 and P2 in high and low perceptual load conditions were almost the same. The ERP waveforms of parallel search were very different from that of serial search, and the ERP waveforms of serial search were very similar. The P3 amplitudes increased as the degrees of the difficulty in visual search decreased.     

A New Generalized Similarity-Based Topic Distillation Algorithm

The procedure of hypertext induced topic search based on a semantic relation model is analyzed, and the reason for the topic drift of HITS algorithm was found to prove that Web pages are projected to a wrong latent semantic basis. A new concept-generalized similarity is introduced and, based on this, a new topic distillation algorithm GSTDA（generalized similarity based topic distillation algorithm） was presented to improve the quality of topic distillation. GSTDA was applied not only to avoid the topic drift, but also to explore relative topics to user query. The experimental results on 10 queries show that GSTDA reduces topic drift rate by 10% to 58% compared to that of HITS（hypertext induced topic search） algorithm, and discovers several relative topics to queries that have multiple meanings.     

Analysis of Conditional Value-at-Risk for Newsvendor with Holding and Backorder Cost under Market Search

We consider a distribution system with one supplier and two retailers. For the two retailers, they face different demand and are both risk averse. We study a single period model which the supplier has ample goods and the retailers order goods separately. Market search is measured as the fraction of customers who unsatisfied with their ＂local＂ retailer due to stock-out, and search for the goods at the other retailer before leaving the system. We investigate how the retailers game for order quantity in a Conditional Value-at-Risk framework and study how risk averse degree, market search level, holding cost and backorder cost influence the optimal order strategies. Furthermore, we use uniform distribution to illustrate these results and obtain Nash equilibrium of order strategies.     

简单界约束非线性方程组的不精确线搜索法

提出一种用非单调线搜索方法求解简单界约束非线性方程组,算法采用满足Armijo条件的不精确线搜索技巧,并使用非单调结构,将当前函数最大值的下降改进为函数平均值的下降,推广了算法的适用范围.最后进行了数值试验,结果表明,算法十分有效.     

Optimal Polygonal Approximation of Digital Planar Curves Using Genetic Algorithm and Tabu Search

Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented.With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained.Compared to the famous Teh-chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error.Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.     

规范科技名词在学术文献中的使用调查

为了解规范科学技术名词在科技文献中的使用情况,文章使用全国科学技术名词审定委员会审定公布的英译和汉语科技名词在国家科技图书文献中心网络服务系统中进行了文献检索统计。检索结果表明英译规范名词在不同的文献类型和学科中的使用有较大的差异;汉语科技名词的检索结果从科技文献使用的角度说明了规范名词遴选的科学性和权威性。文章还对《地理学名词》中不同形式的名词在科技文献中的使用情况进行了文献检索统计。     

关于CNMARC中题名检索途径著录的探讨

以实例分析、归纳了机读目录中题名相关字段的规范著录,全面揭示了中文文献的题名特征与题名检索途径。     

基于关键用户的非均衡热传导与物质扩散算法

物质扩散和热传导算法作为2个经典的基于网络结构的算法被普遍用于信息过滤.然而，现有的算法将所有的用户等同看待，没有区分不同用户的贡献，也没有移除恶意用户，从而导致性能不理想.针对这一问题提出基于关键用户的非均衡热传导与物质扩散算法（core-UHM），用以解决教育资源库中的高质量资源检索问题.算法的背后思想主要是基于信息领域中的帕累托法则，也即是20%的用户主导着整个系统中80%的交互.基于关键用户不仅能够保证资源的质量，同时也大大节省了计算开销.通过在真实的学术搜索日志数据集上的实验，证明了算法的有效性.