搜索引擎中网络蜘蛛的研究与实现

网络蜘蛛程序是搜索引擎工作的基础和关键,实现了抓取网络资源的网络蜘蛛程序,通过入口网址下载网络资源,并对其分析,获得包含的其他链接,利用这些链接向整个网络扩散,下载其他资源。测试了蜘蛛程序抓取网页的能力,并对多线程实现的利弊进行讨论,总结了常用的算法搜索策略,提出了后续的研究方向。     

启发式算法在搜索引擎的应用

本文对启发式搜索及其搜索过程,启发式搜索的估价函数和A*算法等作了介绍.提出使用人工智能中的启发式搜索来获取特定的信息,通过估价函数计算,对有用的链接进行遍历,以提高收集信息资源的查全率和查准率.     

多策略调和的布谷鸟搜索算法

布谷鸟搜索（CS）算法是一种新型的群智能算法,结构简单且寻优能力较强,但存在勘探与开采不平衡以及易陷入局部极值的问题。提出一种多策略调和的布谷鸟搜索（MSRCS）算法,基于概率规则选择由自适应步长和改进解更新方法组成的调和策略对布谷鸟个体进行更新,其中自适应步长引导布谷鸟在更好的方向上寻优,3种改进的解更新方法分别从自身邻域、当前最优个体和随机位置3个角度对勘探和开采进行调和,从而提升全局搜索和局部搜索在迭代过程中的适应性。在CEC2013测试集的28个基准函数上的实验结果表明,MSRCS算法至少有12个测试函数优于原始CS及其7种改进算法且排名第一,在求解单峰、多峰和组合函数问题时寻优能力更强,同时相比于3种经典群智能优化算法具有更快的收敛速度和更高的解精度。     

GSA: A Gravitational Search Algorithm

In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature. In this paper, a new optimization algorithm based on the law of gravity and mass interactions is introduced. In the proposed algorithm, the searcher agents are a collection of masses which interact with each other based on the Newtonian gravity and the laws of motion. The proposed method has been compared with some well-known heuristic search methods. The obtained results confirm the high performance of the proposed method in solving various nonlinear functions.     

How causal knowledge simplifies decision-making

Making decisions can be hard, but it can also be facilitated. Simple heuristics are fast and frugal but nevertheless fairly accurate decision rules that people can use to compensate for their limitations in computational capacity, time, and knowledge when they make decisions [Gigerenzer, G., Todd, P. M., & the ABC Research Group (1999). Simple Heuristics That Make Us Smart. New York: Oxford University Press.]. These heuristics are effective to the extent that they can exploit the structure of information in the environment in which they operate. Specifically, they require knowledge about the predictive value of probabilistic cues. However, it is often difficult to keep track of all the available cues in the environment and how they relate to any relevant criterion. This problem becomes even more critical if compound cues are considered. We submit that knowledge about the causal structure of the environment helps decision makers focus on a manageable subset of cues, thus effectively reducing the potential computational complexity inherent in even relatively simple decision-making tasks. We review experimental evidence that tested this hypothesis and report the results of a simulation study. We conclude that causal knowledge can act as a meta-cue for identifying highly valid cues, either individual or compound, and helps in the estimation of their validities.     

两级定位-路径问题的变邻域人工蜂群算法

建立了两级定位-路径问题的数学模型,提出了一种求解该问题的人工蜂群算法。针对该算法容易出现早熟现象,将近年来国外出现的一种新颖的轨迹式启发式算法--变邻域搜索融入其中,由此提出三种变邻域搜索策略。基于不同变邻域搜索策略的人工蜂群算法和人工鱼群算法的求解效果进行对比仿真。实验结果表明,变邻域人工蜂群算法能有效求解两级定位-路径问题。     

EPZS运动估计算法的分析及改进

在分析研究H.264视频编码标准推荐的运动估计核心算法EPZS的基础上,针对该算法运动估计实时性不足的缺点,提出一种对EPZS算法进行起始搜索窗口中心点和计算终止条件判断标准的改进方法,在H.264编码器的参考模型JM10.1中,选择5个测试序列进行实验。实验结果表明,改进后的算法与原算法相比,在重建图像质量和码率接近的情况下,运动估计时间平均节省了29.314%,降低了算法的复杂度,提高了编码的实时性。     

基于Newsvendor型产品特性的FJSP问题研究

针对新时代环境下Newsvendor型产品销售期短、期末未出售产品价值递减的产品特点,生产链要求位于上游的供应商必须快速加工出所需的工件,否则将面临着线性递增的拖期惩罚。在面对基于Newsvendor型产品的柔性作业车间调度问题时,设计了一种加入禁忌搜索的混合遗传算法,扩大了解的搜索范围,避免了传统遗传算法容易陷于局部最优的缺陷。最后利用混合遗传算法对一个仿真案例进行求解。     

控制系统模型简化及参数寻优的仿真

本文应用随机数直接搜索的单纯形最优化方法将系统高阶模型简化为低阶等效模型，并对控制系统调节器参数进行在线寻优，该方法的主要特点是：编程简单，有较宽的初值选择范围，搜索的结果可靠。     

Enabled/disabled predicate encryption in clouds

Predicate encryption is a cryptographic primitive that provides fine-grained control over access to encrypted data. It is often used for encrypted data search in a cloud storage environment. In this paper, we propose an enabled/disabled predicate encryption scheme, which is the first work that provides timed-release services and data self-destruction (they correspond to the terms “enabled” and “disabled,” respectively). Owing to these properties, the sender can set the readable/unreadable time of the files to be sent to the receiver. The receiver can read the sent file only after the readable time. After the unreadable time, the structure of the file will be destroyed and the file will become unreadable. Furthermore, for practical usage purposes, the extended scheme, which is based on the proposed scheme, provides not only timed-release services and data self-destruction but also long message encryption and undecryptable search. In the extended scheme, the length of encrypted messages does not depend on the order of the group. Moreover, the cloud server can obtain only the matched ciphertexts after the search.