在VC#2008中实现汉字拼音首字母查询SQLServer2005数据库

本文首先介绍了两种获取汉字拼音首字母的方法,然后以查询学生信息为例,介绍了根据汉字拼音首字母查询相应的数据库记录的设计过程,最后基于“Microsoft Windows Server 2003 (sp2) Microsoft Visual Studio 2008 Microsoft SQLServer 2005“软件开发平台,为实现该过程提供了完整的技术支持.     

OBS网络竞争解决机制研究

作为下一代互联网关键技术之一的光突发交换(OBS)技术已受业界的广泛关注.结合国内外最新的研究动态,探讨了解决OBS网中突发包竞争的解决方案,并对这些技术的优缺点进行了分析比较.     

一种基于分层回溯的数据库查询优化算法

结合DP算法和回溯法的基本思想，提出了一种新的基于分层回溯的查询优化算法。其在优化简单查询时，可以提供“最优”的方案；对于一些复杂的应用环境，它可以在杖举算法的高复杂性和算法产生方案的质量之间取得一个权衡点，以产生“次优”的优化结果来换取算法的执行效率，大大节省了运行环境的资源。     

Fast detection of exact clones in business process model repositories

As organizations reach higher levels of business process management maturity, they often find themselves maintaining very large process model repositories, representing valuable knowledge about their operations. A common practice within these repositories is to create new process models, or extend existing ones, by copying and merging fragments from other models. We contend that if these duplicate fragments, a.k.a. exact clones, can be identified and factored out as shared subprocesses, the repository's maintainability can be greatly improved. With this purpose in mind, we propose an indexing structure to support fast detection of clones in process model repositories. Moreover, we show how this index can be used to efficiently query a process model repository for fragments. This index, called RPSDAG, is based on a novel combination of a method for process model decomposition (namely the Refined Process Structure Tree), with established graph canonization and string matching techniques. We evaluated the RPSDAG with large process model repositories from industrial practice. The experiments show that a significant number of non-trivial clones can be efficiently found in such repositories, and that fragment queries can be handled efficiently.     

Contextual web searches in Facebook using learning materials and discussion messages

The web is nowadays one of the main information sources, and information search is an important area in which many advances have been registered. One approach to improve web search results is to consider contextual information. Usually, information about context has been provided through user logs on previous searches or the monitoring of clicks on first results, but different approaches can be used in specific environments. In a web based learning environment, existing documents and exchanged messages could provide contextual information. So, the main goal of this work is to provide a contextual web search engine based on shared documents and messages posted in a social network used for collaborative learning. Contextual search is provided through query expansion using learning documents (material provided by the teacher) and discussion messages (posts, links and comments that result from the participants’ interactions). A prototype was implemented and used in a learning scenario to acquire the context in a learning community. The proposed approach makes the context acquisition faster and more dynamic as it considers an automatic approach over text processing of documents and discussions. In addition, the results of the query engine with and without the contextual information were compared and the proposed approach using contextual information showed improvements in the precision of the results.     

XML twig pattern matching using version tree

A common problem of XML query algorithms is that execution time and input size grows rapidly as the size of XML document increases. In this paper, we propose a version-labeling scheme and TwigVersion algorithm to address this problem. The version-labeling scheme is utilized to identify all repetitive structures in XML documents, and the Version Tree is constructed to hold such version information. To process a query, TwigVersion generates a filter through the created Version Tree, and the final answer to the query can be retrieved from the database easily through the filtering process. Both theoretical proof and experimental results reported in this paper demonstrate that the concise structure of Version Tree and the reduced input size make TwigVersion outperform the existing approaches.     

Enabling structural summaries for efficient update and workload adaptation

To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from data and serve as the indexes for evaluating path expressions. We introduce D(k)-index, an adaptive structural summary, for general graph-structured data. Building on previous 1-index and A(k)-index, D(k)-index is also based on the concept of bisimilarity. However, as a generalization of 1-index and A(k)-index, D(k)-index possesses the adaptive ability to adjust its structure to changes in query load. It also enables efficient update algorithms, which are crucial to real applications but have not been adequately addressed in previous literatures. Our experiments show that D(k)-index is a more effective structural summary than previous static ones as a result of its query load sensitivity. In addition, the update operations on it can be performed more efficient than on its predecessors.     

动态目标移动数据管理技术研究

日益发展的预警监控技术的应用，在信息系统中积累了海量的动态目标运动信息，而这些数据并没有得到很好的管理和利用。本文提出采用移动对象数据库技术对动态目标移动数据进行有效的管理。     

IEEE 802.11移动自组织网络节点竞争窗口长度的概率分布

 在基于IEEE 802.11的移动自组织网络中,MAC(Medium Access Control)层提供了DCF(Distributed Coordinate Function)以控制节点对无线信道的争用.DCF包括了BEB (Binary Exponential Backoff)算法.该文对BEB的重要参数——竞争窗口CW(Contention Window)进行研究,通过随机建模,导出了竞争窗口长度的概率分布,并进行数值分析.研究结果可应用于IEEE 802.11移动自组织网络.