Making knowledge machine-processable: some implications of general semantic search

The central argument of this paper is that the design, implementation and use of technologies that underpin general semantic search have implications for what we know and the way in which knowledge is understood. Semantic search is an assemblage of technologies that most Internet users would use regularly without necessarily realising. Users of search engines implementing semantic search can obtain answers to questions rather than just retrieve pages that include their search query. This paper critically examines the design of the Semantic Web, upon which semantic search is based. It demonstrates that implicit in the design of the Semantic Web are particular assumptions about the nature of classification and the nature of knowledge. The Semantic Web was intended for interoperability within specific domains. It is here argued that the extension to general semantic search, for use by the general public, has implications for what type of knowledge is visible and what counts as legitimate knowledge. The provision of a definitive answer to a query, via the reduction of discursive knowledge into machine-processable data, provides the illusion of objectivity and authority in a way that is increasingly impenetrable to critical scrutiny.     

基于改进异质协同演化的测试用例生成研究

路径搜索是测试用例自动生成的重要环节。针对遗传算法在测试用例生成中的“早熟”缺陷,提出一种改进的异质协同演化算法,将种群划分成两个子种群,分别采用遗传子群和差分子群进行演化,在演化的过程中两个子种群相互协作,通过改进迁移间隔代数和迁移率这两个参数,增加扰动,更加均衡遗传算法的全局探索与差异演化算法的局部搜索。实验结果表明,该算法比遗传算法和传统异质协同演化算法在生成测试用例的收敛性能方面更具优势,因此该方法更适合测试用例自动生成的应用中。     

Multi-Objective Optimization Model for QoS-Enabled Web Service Selection in Service-Based Systems

Nowadays, the web service has become the emerging communication technology where the interaction of each user is performed through the World Wide Web. However, the performance of the web service mechanism is degraded due to security flaws that occur throughout the Internet.. The user or service requester may not attain the relevant web service for their requirement. To overcome this problem, the newly developed multi-objective based Cuckoo Search (MCS) algorithm is proposed in this article. Initially, the input query model was built by the query keyword that is provided by the service requester. Then, the given query is matched with the database that hosts the web services that relates to input query. Among the various services, the user has to select the appropriate web service using the proposed algorithm. The MCS algorithm is newly designed by combining the Cuckoo Search algorithm and the QoS parameter based multiple objectives. Additionally, the new mathematical model of fitness is evaluated by the multi-objective parameters. Finally, the proposed algorithm exploits the fitness value to select the relevant web service for the user query. The experimental results are validated and performance is analyzed by the parameters of precision, recall, and F-measure. Thus, 86.6% of precision value was obtained by the proposed method, which ensured provision of the appropriate web service.     

消费者在线评论有用性影响因素模型研究

消费者在线评论的价值已经得到消费者和在线零售商的公认,对评论有用性的研究已经成为新的研究热点。从减少消费者决策风险出发,在感知诊断性概念基础上定义了评论有用性概念,构建了一个评论有用性影响因素模型。从传播说服理论的维度考察,评论等级、评论长度、好评率和使用互联网经验是影响评论有用性的重要因素。商品类型对评论有用性具有调节作用。     

主题搜索引擎中网络蜘蛛搜索策略的研究

主题网络蜘蛛的搜索策略是主题搜索引擎的核心部分,是近年来主题搜索引擎研究中的热点问题之一。深入研究了主题网络蜘蛛的关键技术,阐述了多线程网络蜘蛛的实现过程,并对传统的VSM算法和PageRank算法进行了改进,提高了主题网络蜘蛛采集信息的有效性和准确性。     

Computer chess move-ordering schemes using move influence

The chessmaps heuristic is a pattern-oriented approach to ordering moves for the game of chess. It uses a neural network to learn a relation between the control of the squares and the influence of a move. Depending on what squares a player controls, the chessmaps heuristic tries to determine where the important areas of the chessboard are. Moves that influence these important areas are then ordered first. The heuristic has been incorporated into a move-ordering algorithm that also takes account of immediate tactical threats. Human players also rely strongly on patterns when selecting moves, but would also consider immediate tactical threats, so this move-ordering algorithm is an attempt to mimic something of the human thought process when selecting a move. This paper presents a new definition for the influence of a move, which improves the performance of the heuristic. It also presents a new experience-based approach to determining what areas of the chessboard are important, which may actually be preferred to the chessmaps heuristic. The results from game-tree searches suggest that the move-ordering algorithm could compete with the current best alternative of using the history heuristic with capture moves in a brute-force search.     

机载激光水下目标探测中GPS的应用

在机载激光对水下目标探测技术中,如何快速有效的搜索目标并得到目标的精确位置信息是其中的重要内容,为此,研究提出了将全球卫星定位系统（GPS）应用于机载激光水下目标探测的方法,将GPS信号作为探测信号的一个参数,与探测信号同时进行实时的传输与存储。基于此方法可以实现多机协同的高效搜索,并可对每个探测信号实现精确定位,使探测信息在脱线分析中也能得到充分利用。针对上述方法进行了仿真试验,证明了其可行性。     

浅析基于Lucene框架的网络论坛信息分析与实现

在当今互联网的各大论坛,帖吧,个人空间,BLOG中存在着非常多的网友发布的薪水,职业,等方面的信息。如在各大高校的BBS中,每年到应届生加入求职大军时,相当一部分学生会就各公司的薪水状况,福利待遇进行询问以及讨论,而一部分得到公司职位的学生亦会在一定程度上公布公司的薪水待遇状况。这一类各公司的薪水信息,对于以后学生的求职,职业人士跳槽,具有相当的参考价值。同样,在各大论坛,互动社区中,都会有相当大的薪水信息帖。很不幸的是,这些薪水讨论帖子淹没在浩淼的互联网中,并且通过互联网在大陆近十年来发展积淀,此类信息已经达到了海量。利用成熟的Lucene框架,文本检索理论(Information Retrieve),以及相关的分词,归类,索引技术,将这些信息,按照网友提交的关键字进行抽取与分析。按网友需要搜索出具备参考价值的职业信息。为网友的求职,跳槽,提供决策支持。     

Web2.0环境下的网络信息检索研究

Web2.0网站在现有网站中的比例越来越高,其具有的互动性、提倡个人体验等特点给信息搜索带来了新的挑战。该文分析了Web2.0的特点,指出Web2.0的某些特点会导致很多信息隐蔽化,并从隐蔽信息检索的角度尝试性地提出了解决办法。     

非结构化对等网络资源定位机制研究

非结构化对等网络是当今P2P的主流,资源搜索定位机制是其核心问题,Gnutella为代表的非结构化对等网络采用基于BFS和DFS的定位机制。在分析非结构化对等网络特征的基础上,提出了改进搜索定位机制的思路和方法。