斜腿刚构桥几何布局的优化设计

采用数学规划的方法从静力和动力两方面对斜腿刚构桥的几何布局进行优化设计。静力优化设计的优化目标是截面截面应力平方均值最小，动力优化设计的优化目标是结构自振周期平方和最小。采用了直接搜索法寻优。通过算例可知，这两种优化设计方法均可行，且均为刚性设计。     

基于价格的消费者信息搜寻过程研究

消费者在购买商品之前,信息搜集是一个必不可少的阶段。消费者的信息搜集过程是比较复杂的。文章通过构建信息搜寻模型,并对影响信息搜集的因素进行分析,认为产品的价格是影响信息搜集量及其持续时间的主要因素,即消费者在购买高价商品时花费的时间远远大于购买低价商品所花费的时间,并用实例进行验证。     

网络人肉搜索与侵犯个人隐私权问题研究

通过对一些有关于人肉搜索的典型案例分析的基础上，揭示了人肉搜索的运行机制。人肉搜索是一种特殊的信息搜索方式，同时也是一种新的信息生产方式。正确使用的话可以弥补机器搜索引擎的不足，但如果被滥用的话，则可能造成对个人隐私权的侵犯。     

A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks

The problem of determining the number of multi-type protection devices and their locations on electrical supply tree networks with subtree dependency is investigated. The aim is to reduce the amount of inconvenience caused to customers that are affected by any given fault on the networks. An appropriate implementation of tabu search is proposed. We exploit a variable neighborhood and a soft aspiration level, and we embed a data structure and reduction tests into the search to speed up the process. Computational tests are performed on randomly generated electrical tree networks varying in size and branch complexity with encouraging results.     

新一代中文智能搜索引擎研究

本文主要论述了新一代中文智能搜索引擎的发展、工作原理、特点及其发展趋势     

A spanning heuristic for the unordered and ordered matching identification problem

The matching identification problem (MIP) is a combinatoric search problem related to the fields of learning from examples, boolean functions, and knowledge acquisition. The MIP involves identifying a single “goal” item from a large set of items. Because there is commonly a cost associated with evaluating each guess, the goal item should be identified in as few guesses as possible. As in most search problems, the items have a similar structure, which allows an evaluation of each guessed item. In other words, each guessed item elicits partial information about the goal item, i.e. how similar the guess is to the goal. With this information the goal is more quickly identified.The unordered MIP has been studied by Mehrez and Steinberg (ORSA J. Comput. 7 (1995) 211) in which they proposed two different types of algorithms. The purpose of the present paper is to suggest an improved Spanning Heuristic algorithm. Its improvement increases as the problem size increases. Further results and comparisons are derived for the unordered and ordered cases.This research shows that when the search space is very large, it is better to inquire from items that are known not to be the goal (they have been ruled out by previous guesses), for the purpose of acquiring more information about the goal. As the search space is narrowed, it is better to guess items that have not been ruled out.     

具有遗憾值约束的鲁棒供应链网络设计模型研究

考虑不确定性环境,研究战略层次的供应链网络鲁棒设计问题,目标是设计参数发生摄动时,供应链性能能够保持稳健性。基于鲁棒解的定义,建立从上游供应商选择到下游设施选址-需求分配的供应链网络设计鲁棒优化模型;提出确定遗憾值限定系数上限和下限的方法,允许决策者调节鲁棒水平,选择多种供应链网络结构;通过模型分解与协调,设计了供应链节点配置的禁忌搜索算法。算例的计算结果表明了禁忌搜索算法具有良好的收敛特性,以及在处理大规模问题上的优越性;同时也反映了利用鲁棒优化模型进行供应链网络设计,可以有效规避投资风险。     

自动化立体仓库中的储位分配及存取路径优化

储位分配和存取作业路径优化是仓储管理中的两个重要决策问题。本文研究如何在自动化立体仓库中对这两个问题进行同时决策。提出了一个混合整数规划模型对该问题进行优化建模,设计开发了一个基于有向连接图的两阶段优化算法对问题求初始解,并利用禁忌搜索算法对所求得的解进行改进。算法第一阶段解决储位分配问题,在此基础上第二阶段利用Hungarian算法对堆垛机的存取作业路径优化问题进行求解。最后利用实例对算法效率和精度进行分析评价,计算结果验证了算法的有效性。     

认知图式理论在翻译建构中的意义及其具体运用

图式是指已有的知识经验在大脑中形成的“框图”,即知识结构。翻译中通过联想、搜索译入语中有关图式,进行套用、模仿、迁移和重构,有助于发挥译入语的优势,实现双语符号的成功转换。按照认知心理学观点,运用图式进行传译可包括三个方面,即运用原型匹配、运用模板匹配、运用“自上而下”搜索。     

Asymptotic Theory of Outlier Detection Algorithms for Linear Time Series Regression Models

Outlier detection algorithms are intimately connected with robust statistics that down‐weight some observations to zero. We define a number of outlier detection algorithms related to the Huber‐skip and least trimmed squares estimators, including the one‐step Huber‐skip estimator and the forward search. Next, we review a recently developed asymptotic theory of these. Finally, we analyse the gauge, the fraction of wrongly detected outliers, for a number of outlier detection algorithms and establish an asymptotic normal and a Poisson theory for the gauge.