一种防止重复查询的RFID优化算法

在动态二进制搜索算法的基础上提出了广度优先的动态二进制RFID防碰撞搜索(BDBS)算法.阅读器在判断碰撞位以后,每次在最高碰撞位将搜索树分裂为0和1的二叉树,阅读器查询以广度优先的方式搜索,直到识别所有标签.仿真结果表明,BDBS算法在查询次数,识别延时以及通信量等性能指标上明显优于动态二进制搜索算法.     

P2P网络智能搜索机制的研究与实现

对P2P网络中的搜索算法进行分析,重点对广度优先搜索做了深入的研究和探讨,在广度优先搜索（BFS）机制的基础上,将智能搜索技术应用于P2P网络资源搜索中,得到了一种基于智能广度优先搜索算法的思路。对BFS算法进行了改进,得出了智能BFS（I-BFS）算法框架,最后对I-BFS进行仿真实验。实验结果表明：智能广度优先搜索算法和广度优先算法相比,避免了向所有接点发送,减少了网络中的路由消息,降低了网络的负载,提高了资源搜索的成功率。     

主机内文档自动搜索技术研究

为降低进行文档搜索时对系统资源的占用,提出了一种实现对主机内文档进行快速高效搜索的方法,采用基于宽度优先非递归搜索算法实现对主机内文档的遍历搜索;采用基于改进的BF算法和改进的KMP算法分别进行文档名和文档关键词匹配;采用降低线程优先级和定时暂停程序的方法控制搜索效率;采用压缩存储的方法对搜索结果进行处理。设计并实现了原型系统,测试结果表明,系统具有较高的准确率和召回率,且对主机内存、CPU、硬盘等资源占用少,降低了在进行文档搜索时对计算机其他进程的影响。     

分支搜索：工厂平面布置的新算法

提出二种工厂平面布置新算法:受控分支搜索算法和预分支搜索算法.该二种算法将分支搜索和启发式优化结合起来,可以在较大的解范围内搜索,获取接近最优的解.     

Transputer网络上分布式组合搜索的效率

Ｔｒａｎｓｐｕｔｅｒ网络是一种典型的消息传送型多处理机系统，无论是传统的数值计算，还是人工智能的动态非确定搜索问题，都可以得到加速处理。本文研究如何在Ｔｒａｎｓｐｕｔｅｒ网络上高效地实现分布式组合搜索。针对搜索的动态非确定性，我们提出一种异步通讯模式，以及Ｔｒａｎｓｐｕｔｅｒ上并行搜索的负载平衡算法。我们实现了最佳优先和启发式导向的深度优先两种策略的分布式分枝限界算法（Ｂｒａｎｃｈ－ａｎｄ－Ｂｏｕｎｄ），应用于求解旅行推销员问题（ＴＳＰ），在１６个Ｔｒａｎｓｐｕｔｅｒ上获得了较好的并行效率。     

逆向通行情形下的灾害应急疏散路线规划研究

针对地震、飓风等自然或者人为灾害条件下大规模路网疏散的交通管理问题进行了研究。在考虑逆向通行的情形下,建立应急疏散路线的规划模型,并得出基于广度优先搜索的遗传算法。在研究中将该模型应用于秦山核电站,并对其疏散效果进行综合分析。     

大数据背景下的网络信息采集策略研究

介绍了网络爬虫技术的运行原理,分析了作为搜索引擎核心技术的通用网络爬虫的搜索策略,进而实现了采用两种搜索策略的网络爬虫,并在互联网中进行了信息爬取,最后比较总结了两种搜索策略的技术特点及优化研究方向。     

基于广度优先搜索的网络蜘蛛设计

网络蜘蛛搜索策略的研究是近年来专业搜索引擎研究的焦点之一,如何使搜索引擎快速准确地从庞大的网页数据中获取所需资源的需求是目前所面临的重要问题。重点阐述了搜索引擎的Web Spider（网络蜘蛛）的搜索策略和搜索优化措施,提出了一种简单的基于广度优先算法的网络蜘蛛设计方案,并分析了设计过程中的优化措施。     

一种搜索模糊聚类全局最优解的Tabu算法

模糊聚类问题由于其非凸性而成为一个难以解决的数学问题。在解决模糊聚类问题时,会出现很多局部极小值和鞍点。因此,启发式的模糊C-均值算法是应用最为广泛的算法,其缺点是很容易陷入局部极小值。本文提出了一种搜索模糊聚类全局最优解的Tabu搜索算法,并比较这种新算法和模糊C-均值算法的性能。经过多次数据试验,证明Tabu搜索算法在搜索全局最优解时是很有效的。     

搜索选择对新产品开发绩效的影响机制

新产品开发日益成为企业维持竞争优势的关键因素,然而,既有研究鲜有探讨搜索选择是否以及如何影响新产品开发绩效。为此,文章利用203家创业企业经验数据,从资源损失应对启发式和行业经验视角来构建搜索选择对新产品开发绩效的影响机制。研究发现,行业外领域搜索对新产品开发绩效具有积极影响,而不熟悉领域搜索并未对其发挥作用;资源损失应对启发式决策在行业外领域搜索与新产品开发绩效中发挥完全中介作用;行业经验负向调节行业外领域搜索与新产品开发绩效关系,即行业经验越丰富,越不利于从行业外领域搜索信息和知识以促进新产品开发。研究结论对于创业者通过行业外领域搜索克服资源损失并提升新产品开发绩效具有重要意义。     

A heuristic hierarchical scheme for academic search and retrieval

We present PubSearch, a hybrid heuristic scheme for re-ranking academic papers retrieved from standard digital libraries such as the ACM Portal. The scheme is based on the hierarchical combination of a custom implementation of the term frequency heuristic, a time-depreciated citation score and a graph-theoretic computed score that relates the paper’s index terms with each other. We designed and developed a meta-search engine that submits user queries to standard digital repositories of academic publications and re-ranks the repository results using the hierarchical heuristic scheme. We evaluate our proposed re-ranking scheme via user feedback against the results of ACM Portal on a total of 58 different user queries specified from 15 different users. The results show that our proposed scheme significantly outperforms ACM Portal in terms of retrieval precision as measured by most common metrics in Information Retrieval including Normalized Discounted Cumulative Gain (NDCG), Expected Reciprocal Rank (ERR) as well as a newly introduced lexicographic rule (LEX) of ranking search results. In particular, PubSearch outperforms ACM Portal by more than 77% in terms of ERR, by more than 11% in terms of NDCG, and by more than 907.5% in terms of LEX. We also re-rank the top-10 results of a subset of the original 58 user queries produced by Google Scholar, Microsoft Academic Search, and ArnetMiner; the results show that PubSearch compares very well against these search engines as well. The proposed scheme can be easily plugged in any existing search engine for retrieval of academic publications.     

一种基于TSP问题的启发式搜索算法研究

旅行推销员问题(TSP问题)是算法研究的经典问题,该问题属于典型的NP难题。研究解决此问题尽可能少计算时间的算法具有重要意义。本文通过研究一种启发式搜索算法,把TSP问题的矩阵通过一种启发式准则约简和搜索,尽量地简少了搜索的范围。     

一种离散细菌菌落优化算法研究

为了拓宽智能优化算法解决实际问题的能力,提出一种离散的细菌菌落优化算法。首先,设计新的个体编码方式以及进化方式;其次,融合禁忌搜素算法,克服算法易陷入早熟的不足;最后,与其它算法在Taillard标准调度测试问题集上比较实验,验证了算法的有效性。仿真表明,算法能够寻求到问题的最优组合。     

基于数据可重用的运动估计低功耗VLSI实现

块匹配全局搜索算法(FSBM)是效果最好的运动估计算法,但是由于它庞大的运算量限制了它的应用,特别是在数字多媒体终端等对实时性和功耗要求比较高的应用场合。针对这种情况,作者提出的处理结构结合了数据重用和低功耗技术,使得该结构的功耗比传统的全局搜索结构降低50%的功耗,数据可重用性大为提高,确保了每个数据只需被读取一次,这样就确保了较少的I/O端口数和片上内存,同时实现100%的硬件资源利用率。     

Comparing rankings of search results on the Web

The Web has become an information source for professional data gathering. Because of the vast amounts of information on almost all topics, one cannot systematically go over the whole set of results, and therefore must rely on the ordering of the results by the search engine. It is well known that search engines on the Web have low overlap in terms of coverage. In this study we measure how similar are the rankings of search engines on the overlapping results.We compare rankings of results for identical queries retrieved from several search engines. The method is based only on the set of URLs that appear in the answer sets of the engines being compared. For comparing the similarity of rankings of two search engines, the Spearman correlation coefficient is computed. When comparing more than two sets Kendall’s W is used. These are well-known measures and the statistical significance of the results can be computed. The methods are demonstrated on a set of 15 queries that were submitted to four large Web search engines. The findings indicate that the large public search engines on the Web employ considerably different ranking algorithms.     

Amount of invested mental effort (AIME) in online searching

This research investigates how people’s perceptions of information retrieval (IR) systems, their perceptions of search tasks, and their perceptions of self-efficacy influence the amount of invested mental effort (AIME) they put into using two different IR systems: a Web search engine and a library system. It also explores the impact of mental effort on an end user’s search experience. To assess AIME in online searching, two experiments were conducted using these methods: Experiment 1 relied on self-reports and Experiment 2 employed the dual-task technique. In both experiments, data were collected through search transaction logs, a pre-search background questionnaire, a post-search questionnaire and an interview. Important findings are these: (1) subjects invested greater mental effort searching a library system than searching the Web; (2) subjects put little effort into Web searching because of their high sense of self-efficacy in their searching ability and their perception of the easiness of the Web; (3) subjects did not recognize that putting mental effort into searching was something needed to improve the search results; and (4) data collected from multiple sources proved to be effective for assessing mental effort in online searching.     

A Wikipedia powered state-based approach to automatic search query enhancement

This paper describes the development and testing of a novel Automatic Search Query Enhancement (ASQE) algorithm, the Wikipedia N Sub-state Algorithm (WNSSA), which utilises Wikipedia as the sole data source for prior knowledge. This algorithm is built upon the concept of iterative states and sub-states, harnessing the power of Wikipedia’s data set and link information to identify and utilise reoccurring terms to aid term selection and weighting during enhancement. This algorithm is designed to prevent query drift by making callbacks to the user’s original search intent by persisting the original query between internal states with additional selected enhancement terms. The developed algorithm has shown to improve both short and long queries by providing a better understanding of the query and available data. The proposed algorithm was compared against five existing ASQE algorithms that utilise Wikipedia as the sole data source, showing an average Mean Average Precision (MAP) improvement of 0.273 over the tested existing ASQE algorithms.     

利用Google进行专题信息检索

Google是当今一个具有强大功能和独到特点的优秀搜索引擎，本文研究Google基本检索和高级检索语法规则;探讨利用Google的语法规则增强Google的关键词检索功能、提高查准率，正确构建检索式，实施专题信息检索的策略。     

因特网上信息索引数据库的利用

网络信息资源搜索引擎的第二功能模块为信息检索与提供。本文讨论了检索模块的工作原理与查询过程。通过HTML浏览程序,在SX+AF+MX索引数据库中检索,快速反馈检索结果。并分组编辑输出命中网点的索引信息,阅读索引后若有进一步的需求．可点击索引记录的URL,链接出网点的原始信息资源,提供用户使用。