Abstract:This paper presents a research work in children Truing test(CTT).The main defference between our test program and other ones is its knowledge-based character,which is supported by a massive commonsense knowledge base.The motivation,design,techniques,experimental results and platform(including a knowledge engine and a cinverstation engine)of the CTT are described in this paper.Finally,some cincluding thoughts about the CTT and AI are given.

Abstract:In shared-control systems, such as intelligent service robots, a human operator and an automated technical system are interdependently in charge of control. Effective shared control requires complex system architectures that provide safety and robustness in operation, while providing a user-friendly interface--provision of these dual requirements is a non-trivial task. This paper reports on an approach to addressing these issues. A dialogue centric cognitive control architecture is presented, which utilizes both agent-oriented programming and formal methods. The SharC Cognitive Control Architecture is a hybrid design that distributes control of a robot amongst a community of deliberative intentional agents. Since safety is of paramount importance in shared-control systems, high-level safety issues must be addressed within such architectures. To this end, the authors also describe a formally modeled dialogue manager that sits at the heart of the control system. The use of these distinct software paradigms is illustrated, by example, with the demonstration platform: Rolland, the Bremen autonomous wheelchair.

Abstract:Tiling an array of projectors has become a practical way to construct a high resolution display system.Unfortunately, such high-resolution display systems have limited use because they require specially developed parallel visualization programs that run on a custom-designed parallel machine or a PC cluster. This paper presents an automatic alignment mechanism for arbitrarily tiled displays running a desktop environment so that users can run ordinary applications developed for desktop PCs. The system consists of three primary procedures: detecting projector misalignment, calculating corrective transformations, and real-time warping for the desktop environment. This allows users to run any 2D, 3D or video applications without modifications or special hardware support. Our experiments indicate that the system is able to achieve sub-pixel accuracy and achieve real-time warping with minimum system performance degradation.

Abstract:With the increasing diversity and complexity of distributed systems in network environment, web application server (WAS) is required to transform its service model from Best Effort?to QoS (quality of service) Guarantee". However, most existing WASs are relatively weak in terms of QoS provision. In this paper, OnceAS/Q is presented to show how a QoS-enabled WAS can offer different QoS provisions for applications. OnceAS/Q provides a set of QoS related services and a framework to support QoS guarantee, in order to realize a QoS enabled WAS. This paper first describes the architecture and main components of OnceAS/Q. Then two key issues, related to QoS enabling and the corresponding solutions, are explored in detail: one is the definition and mapping of QoS specifications, and the other is the dynamic reconfiguration of QoS-aware service components and resources. Ecperf benchmark, a well-known performance benchmark for J2EE Application Server, is used to evaluate the effect of QoS enabling of OnceAS/Q. Experimental results show that OnceAS/Q can support better QoS for applications at a reasonable cost.

Abstract:The problem of dynamically adjusting the sizes of sliding windows when the rates of data streams or continuous queries change in data stream systems is studied in this paper. Based on the amount of available memory resource and the requirement of queries, three classes of algorithms for dynamically adjusting the sizes of sliding windows are proposed. These algorithms provide three levels of quality of service to all kinds of continuous queries and enhance the efficiency and effectiveness of processing continuous queries. Analytical and experimental results show that the algorithms can be applied to data stream systems effectively.

Abstract:In the 21st century, Internet will be one of the most important infrastructures in information society. In this paper, the roadmap of Internet is reviewed, and the successful experience and failed lesson are summarized. From the point of view of application requirements, some essential attributes possessed by the new generation Internet are predicted and concluded, namely controllability, trustworthiness, and scalability, which are explained and discussed in detail. Finally, some thinking about methodology for study on the new generation Internet is introduced.

Abstract:This paper discusses the state of the art, the challenge problems that we face, and the future trends in database research field. It covers the hot topics such as information integration, stream data management, sensor database technology, XML data management, data grid, self-adaptation, moving object management, small-footprint database, and user interface.

Abstract:The thirty years, development of covert channel analysis research is summarized. The essence of covertchannel and its analysis is depicted according to our theoretical research and engineering experience in this area.The state of the art in the application of covert channel analysis approaches to the real systems is illustrated. Somemajor threads and emerging trends of the research in this area are presented.

Abstract:The number of competing stations has great influence on the performance of IEEE 802.11 MAC protocol based on the distributed coordination function (DCF), which utilizes carrier sense multiple access with collision avoidance (CSMA/CA). In this research, it is found that the system performance approaches the optimal values with the same protocol parameters, when the number of competing stations dynamically changes within a certain range. Therefore, an adaptive optimization mechanism, DOOR (dynamic optimization on range), is proposed for the IEEE 802.11 DCF, which is based on the condition detection and range of competing station number. Moreover, the principle and method for partitioning the range of competing station number are also introduced. Later on, the detailed system model and performance evaluation for the new mechanism are given. The elaborate numerical results show that the mechanism could achieve much higher throughput and shorter delay than the standard IEEE 802.11 DCF in almost all the different competing stations numbers.

Abstract:XPath becomes the basic mechanism for XML query. The non-deterministic operators in XPath, such as ‘//’ denoting ancestor-descendant relationship and ‘*’ denoting wildcards in XPath, greatly enhance the flexibility of XPath, but at the same time, introduce the complexity in XPath evaluation. How to explore DTD to reduce non-deterministic operators in XPath in order to improve the efficiency of XPath processing becomes a fundamental problem. The existing work focus on the limited fragment of XPath or DTD. This paper employs tree automata to express XPath and DTD in a unified framework, proposes a novel production operation on tree automata for XPath and tree automata for DTD, proves that the result of production equals to the optimized form of XPath in the presence of DTD, and generates the optimized XPath in a polynomial time based on the generation cost. The experimental result demonstrate that logical optimization on XPath can lead to the increase of efficiency on the existing XPath evaluator.

Abstract:The problem of topology control in multi-rate mobile ad hoc networks is studied and a multi-rate aware topology control algorithm (MATC) is proposed in the paper. MATC fully takes the inherent multi-rate property of wireless network into account. It removes some low rate links while preserving the connectivity of the network. On the basis of MATC, on-demand routing protocols can find the optimal route in one-hop range. Extensive simulations show that MATC can significantly improve the network throughput.

Abstract:The key problem of QoS multicast routing optimization algorithm is to build QoS constrained multicast tree. This is the most noted problem in computer networks as constrained minimum Steiner tree problem, which has also been shown as NP-complete. A fast multicast routing optimal algorithm with QoS constraints based on Tabu-search is proposed in this paper. It chooses delay and bandwidth as QoS parameters, can improve the search speed, and make a better solution by using the merits of Tabu-search. Simulation results with random network models show that TSQMA is faster, easier for implementation, and more suitable for large group scale.

Abstract:The application environments and connection with the Internet require that wireless ad hoc networks should support Quality-of-Service (QoS). In a wireless ad hoc network, supporting quality-of-service is very difficult because of the inherent characteristics of wireless channel and the frequent change of network topology. This paper comprehensively summarizes and deeply analyzes the researches of recent years on the QoS architecture, QoS routing, QoS signaling, and media access control (MAC) mechanism that supports service differentiation and resource reservation in wireless ad hoc networks. Based on the analysis, this paper deeply discusses the problems that must be resolved to support QoS in wireless ad hoc networks, and points out the direction to the research in the future.