Journal•ISSN: 1000-1220
Journal of Chinese Computer Systems
Chinese Academy of Sciences
About: Journal of Chinese Computer Systems is an academic journal. The journal publishes majorly in the area(s): Wireless sensor network & Cluster analysis. Over the lifetime, 1176 publications have been published receiving 2627 citations.
Topics: Wireless sensor network, Cluster analysis, Scheduling (computing), Software, Routing protocol
Papers
More filters
•
TL;DR: A new algorithm of fast subsequence matching in time-series database using VA-file, which maps data points directly into the index structure and a new algorithm for Range Query on this index structure is proposed.
Abstract: This paper proposes a new algorithm of fast subsequence matching in time-series database. Dramatically differing from FRM algorithm, we develop an index structure using VA-file, which maps data points directly into the index structure. We also propose a new algorithm for Range Query on this index structure. We implement our method and carry out experiments in different ways on three kinds of time-series data. The result shows that our algorithm accelerated the search time significantly.
62 citations
•
TL;DR: A set of schemes and methods based on a series of technologies of chess computer game and years practice of Chinese chess, such as the process modeling, state representation, move generation, evaluation function, searching game tree, opening book, endgame database, system test and parameter optimization, etc are proposed.
Abstract: Computer game is one of the most challenging topics in the field of artificial intelligence. Chess computer game has a long history, and come through tough research. Finally, DeepBlues victory startled the whole world. Chinese chess computer game is more complex than chess computer game, and the fewer researchers and fewer references lead the lag in the field. Based on a series of technologies of chess computer game and years practice of Chinese chess, a set of schemes and methods are proposed, such as the process modeling, state representation, move generation, evaluation function, searching game tree, opening book, endgame database, system test and parameter optimization, etc. Hot topics and tasks are also proposed at the end.
38 citations
•
TL;DR: This paper gives some security mechanisms to adapt to wireless sensor networks for sensor data and network control protocols.
Abstract: Wireless sensor networks have been identified as being useful in a variety of domains to include military sensing and tracking, environment monitoring, patient monitoring and tracking smart environment, etc. When sensor networks are deployed in a hostile environment, security becomes extremely important, as they are prone to different types of malicious attacks. Due to the resource limitations of sensor nodes, existing network security mechanisms, including those developed for Mobile Ad-Hoc Networks, are inadequate for wireless sensor networks. In this paper, we give some security mechanisms to adapt to wireless sensor networks for sensor data and network control protocols.
30 citations
•
TL;DR: This paper proposes an approach for standardization of facial image quality, and develops facial symmetry based methods for the assessment of it by measuring facial asymmetries caused by non-frontal lighting and improper facial pose.
Abstract: Performance of biometric systems is dependent on quality of acquired biometric samples. Poor sample quality is a main reason for matching errors in biometric systems and may be the main weakness of some implementations. This paper proposes an approach for standardization of facial image quality, and develops facial symmetry based methods for the assessment of it by measuring facial asymmetries caused by non-frontal lighting and improper facial pose. Experimental results are provided to illustrate the concepts, definitions and effectiveness.
28 citations
•
TL;DR: An efficient and applied matching algorithm that uses multi-dimensional indexing mechanism to speed up constraints query and exploits the covering relations between constraints to reduce unnecessary matching is presented.
Abstract: A key issue when designing and implementing large-scale content-based publish/subscribe systems is how to efficiently match high volumes of events against large numbers of subscriptions. This paper, proposed a subscription language and event model, presented an efficient and applied matching algorithm that uses multi-dimensional indexing mechanism to speed up constraints query and exploits the covering relations between constraints to reduce unnecessary matching. Experiments shows that the algorithm is significantly more efficient and scalable than other common used matching algorithms.
25 citations