Withthe recent advances in mobile technologies and infrastructures, citizens start to demand for not just mobile but also ubiquitous access to e-government services. Further withthe invention of new interaction devi...
详细信息
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has been given, which shows our algorithm ca...
详细信息
ISBN:
(纸本)0889865477
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0.27 under random graph model. Experimental results have also been given, which suggest the advantage of the algorithm under other models.
A lightweight RFID application is necessary in diverse enterprise environments. It, however, is quite difficult to develop a full-fledged RFID application in the mid-level companies due to the prototypical developing ...
详细信息
ISBN:
(纸本)0889865477
A lightweight RFID application is necessary in diverse enterprise environments. It, however, is quite difficult to develop a full-fledged RFID application in the mid-level companies due to the prototypical developing cost and/or the integrating cost to the existing legacy systems. In this paper, we will show RFID-based ALE Application Framework (AAF) which is based on the EPCglobal Network and ALE specification, and will demonstrate how to construct RFID application with ease and relatively low cost. AAF utilizes Web Services, thus provides higher interoperability, and can apply for any sort of applications owing to the component based architecture.
Facet-based component retrieval techniques have been proved to be an effective way for retrieving. these Techniques are widely adopted by component library systems, but they usually simply list out all the retrieval r...
详细信息
ISBN:
(纸本)0889865477
Facet-based component retrieval techniques have been proved to be an effective way for retrieving. these Techniques are widely adopted by component library systems, but they usually simply list out all the retrieval results without any kind of ranking. In our work, we focus on the problem that how to determine the ranks of the components retrieved by user. Factors which can influence the ranking are extracted and identified through the analysis of ER-Diagram of facet-based component library system. In this paper, a mathematical model of weighted ranking algorithm is proposed and the timing of ranks calculation is discussed. Experiment results show that this algorithm greatly improves the efficiency of component retrieval system.
In this paper, a novel recognition system based on rough neural network is presented for the application of vehicle classification in wireless sensor network. the proposed system is evaluated using real-world signal d...
详细信息
ISBN:
(纸本)0889865477
In this paper, a novel recognition system based on rough neural network is presented for the application of vehicle classification in wireless sensor network. the proposed system is evaluated using real-world signal datasets as well as two conventional methods. Compared withthem, approach based on rough neural network achieves high performance improvement. Furthermore, the purposed system is extended for multi-channel sensor data fusion directly. Since the experiment results are attractive, algorithm based on rough neural network is believed to have potential for applications of recognition and data fusion in wireless sensor networks.
the proceedings contain 61 papers. the topics discussed include: A wireless intrusion detection method based on neural network;network topology redesigns through a soft computing;using mobile web services in electroni...
详细信息
ISBN:
(纸本)0889865477
the proceedings contain 61 papers. the topics discussed include: A wireless intrusion detection method based on neural network;network topology redesigns through a soft computing;using mobile web services in electronic auctions;identifying ontology components from digital archives for the semantic web;on the top-down tree inclusion;distributed hierarchical document clustering;game based interactive motivating tool for rehabilitation movements: case study;the representation and inferences of hierarchies;database model for taxonomic and observation data;voronoi-diagram based heuristics for the location of mobile and unreliable service providers;a new singular value decomposition algorithm suited to parallelization and preliminary results;an extended openmp targeting on the hybrid architecture of SMP-cluster;and the influence of trail representation in ACO for good results in MKP.
this paper investigates the applicability of distributed clustering technique, called RACHET [1], to organize large sets of distributed text data. Although the authors of RACHET claim that the algorithm generates qual...
详细信息
ISBN:
(纸本)0889865477
this paper investigates the applicability of distributed clustering technique, called RACHET [1], to organize large sets of distributed text data. Although the authors of RACHET claim that the algorithm generates quality clusters for massive and high dimensional data set, the algorithm was not yet evaluated on a well known academic data set. this paper presents performance analysis of the algorithm and tests its suitability for distributed document clustering. this work uses three widely known hierarchical algorithms to generate local clusters at each of distributed repositories and then the RACHET is applied to merge distributed hierarchies of clusters. We perform our own tests of the algorithm on standard document corpora [2], using popular cluster evaluation measures [3, 4] and discuss important implementation details.
We consider the following tree-matching problem: Given labeled, ordered trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, r...
详细信息
ISBN:
(纸本)0889865477
We consider the following tree-matching problem: Given labeled, ordered trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. the existing algorithm for this problem needs O(|T|·|leaves(P)|) time and O(|leaves(P) |·min{DT, |leaves(T)|}) space, where leaves(P) (leaves(T)) stands for the number of the leaves of P (T), and DT for the height of T. In this paper, we present a new algorithm that requires O(|T|·DP) time and O(|T|) extra space, where DP represents the height of P.
In autonomous agents systems, each agent must behave independently according to its states and environments, and, if necessary, must cooperate with other agents in order to perform a given task. therefore, each agent ...
详细信息
ISBN:
(纸本)0889865477
In autonomous agents systems, each agent must behave independently according to its states and environments, and, if necessary, must cooperate with other agents in order to perform a given task. therefore, each agent must incorporate learning and evolution in order to adapt to a dynamic environment. At present, in the field of multi-agent systems, methods by which to acquire the behavior rule from both expert knowledge and perception for an autonomous agent are generating a great deal of interest. In the present paper, we focused on the problem of "trash collection" by a multi-agent system and simulated the cooperative behavior of agents. therefore, we investigated methods by which to learn the rules of cooperative behavior of multi-agents so as to solve problems effectively. We also used genetic algorithms (GA) as a method of acquiring the rules of an agent. Individual coding (definition of the rule) methods are performed, and the learning efficiency is evaluated.
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computerscience. the main goal of pattern discovery in DNA sequences is to identify sequences of important biological f...
详细信息
ISBN:
(纸本)0889865477
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computerscience. the main goal of pattern discovery in DNA sequences is to identify sequences of important biological function hidden in the huge amounts of genomic sequences. Several methods and techniques have been proposed and implemented in this field. However, in order to reduce computational time and complexity, most of them either focus on finding short DNA patterns or require explicit specification of pattern lengths in advance. Scientists need to find longer patterns without specifying pattern lengths in advance and still have good performance. In this paper, we propose a pattern discovery algorithm called Pattern Discovery with Confidence (PDC). Based on biological studies, we propose a new measurement system that can identify over-represented patterns inside DNA sequences. Using this measurement, PDC algorithm can narrow the search space by checking dependency along the pattern, thus extending the pattern as long as possible without the need to restrict or specify the length of a pattern in advance. Experimental tests demonstrate that this approach can find long, interesting patterns within a reasonable computation time.
暂无评论