Cache invalidation is an important issue in mobile caching and has received much attention by researchers. However most existing studies on cache invalidation strategies are limited to cellular wireless networks in wh...
详细信息
We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni＇s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novot...
详细信息
We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni＇s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novotni had missed and we also gave the method to find out the geodesic path which Novotni had not. It can handle both convex and non-convex surfaces or even with boundaries. Experiment results show that our method works very well both in efficiency and precision.
In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organiza...
详细信息
In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.
In semi-supervised learning, a number of labeled examples are usually required for training an initial weakly useful predictor which is in turn used for exploiting the unlabeled examples. However, in many real-world a...
详细信息
An online semi-supervised active learning algorithm is proposed, which is based on self-organizing incremental neural network (SOINN). The proposed method do not need any priori knowledge such as number of nodes or nu...
详细信息
Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show...
详细信息
Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.
This paper proposes a new scheduling model that integrates the communication awareness into task scheduling. A scheduling algorithm is proposed for the new model, which can produce optimal schedule by serializing the ...
详细信息
Recent developments in processor, memory and radio technology have enabled wireless sensor networks, which are deployed to collect useful information from an area of interest. Since various sensor nodes often detect c...
详细信息
Recent developments in processor, memory and radio technology have enabled wireless sensor networks, which are deployed to collect useful information from an area of interest. Since various sensor nodes often detect common phenomena, there is likely to be redundancy in the data. Data aggregation is an essential paradigm by combining the data coming from different sources reroutes - eliminating redundancy, minimizing the number of transmissions and thus saving energy. Inspired by the social behaviors of ant colony and the technology of intelligent entity agent, in this paper, we proposed a data aggregation routing optimization method based on ant colony algorithm using agent collaboration and migration. A number of ant-like mobile agents traverse the Wireless sensor network (WSNs) in search of data aggregation paths between given source-destination node pairs while seeking to optimum migrate probability based on updating pheromone. Also, we presented an evaluation Ant colony optimation (ACO) algorithm with data aggregation gain. Our simulation results show that our algorithms perform well in energy efficient compared with LEACH and PEGASIS.
In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonym...
详细信息
ISBN:
(纸本)9783540725893
In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.
Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requ...
详细信息
ISBN:
(纸本)9781424403523
Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirement of applications/users such as sensing area coverage. In this paper, we propose a novel hierarchical clustering protocol for long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely intra-cluster coverage to cope with the area coverage problem. We evaluate the performance of the proposed protocol using a simple temperature sensing application. Simulation results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.
暂无评论