In this paper, we propose an Artificial Bee Colony (ABC) algorithm, a swarm-based artificial intelligence algorithm, for computing a connected dominating set (CDS) in ad hoc wireless networks, which include mobile ad ...
详细信息
In this paper, we propose an Artificial Bee Colony (ABC) algorithm, a swarm-based artificial intelligence algorithm, for computing a connected dominating set (CDS) in ad hoc wireless networks, which include mobile ad hoc networks (MANETS). ABC Algorithm is an optimization algorithm based on the intelligent behavior of honey bee swarm. Wireless ad hoc networks appear in a wide variety of applications, including mobile wireless networks. In this work ABC algorithm is proposed as optimizing heuristic algorithm for the connected dominating set problem in dynamic environment. This approach guarantees properties of correctness, progressiveness, locality, and seamlessness, and also has better throughput than cyclic iterative local solution (CILS) and seamless iterative local solution (SILS). Extensive simulations are conducted to evaluate the effectiveness of the proposed approach in both static and dynamic environments.
The main role of encryption algorithms is to keep devises safe from attack. Using the best and more efficient algorithm for a device according to its storage and amount of data transfer is the most important part. Thi...
详细信息
The main role of encryption algorithms is to keep devises safe from attack. Using the best and more efficient algorithm for a device according to its storage and amount of data transfer is the most important part. This paper compares Elliptical Curve Cryptography algorithm (ECC) with RSA algorithm on a multipurpose smart card. There are three applications in our multipurpose smart card which is named health, credit and passport card. ECC is compared with 160 bit key size and RSA with 1024 bit key size. The result of comparison is described in the final section.
Smart cards have many applications such as health, ID verification and access control, electronic purse card, banking card, payphone card, passport card and license card. Since, there are many kinds of smart cards, it...
详细信息
Smart cards have many applications such as health, ID verification and access control, electronic purse card, banking card, payphone card, passport card and license card. Since, there are many kinds of smart cards, it is difficult to carry and protect them. Losing one card means losing a lot of important information. So in this paper proposes to combine some important cards such as: health, passport and credit system in one multipurpose smart card and find an encryption method to make it enough secure. It should also be efficient in transferring information. It means, we develop an effective encryption system for these three applications in a multipurpose smart card and we propose an optimized encryption system for the applications.
This paper researches on the real time subdivision of surface rendering using approximation scheme and focuses on two methods - Catmull-Clark and Loop subdivision. The two methods are commonly employed separately in m...
详细信息
This paper researches on the real time subdivision of surface rendering using approximation scheme and focuses on two methods - Catmull-Clark and Loop subdivision. The two methods are commonly employed separately in many existing applications and graphics engine. Catmull-Clark outperforms on quad meshes and Loop subdivision superiors on triangle meshes. The exchange of the meshes produces ugly polygonal meshes. In this paper, we propose to combine the methods and subdivide the quad-triangle model simultaneously. We average the vertex points generated by both the functions. This closes up the gap on the original vertex points. Our result turns out to be smoother and without defect. Our proposed method is potential to be employed in other graphics applications such as morphing, animation and etc.
This article introduces the problem of parallelization of Dijkstra's algorithm, a well known algorithm for computing single-source shortest path in a graph. Dijkstra's algorithm can be applied to graphs with a...
详细信息
This article introduces the problem of parallelization of Dijkstra's algorithm, a well known algorithm for computing single-source shortest path in a graph. Dijkstra's algorithm can be applied to graphs with a various number of vertices and edges. Dijkstra's shortest path algorithm is implemented and presented, and the performances of its parallel and serial execution are compared. The algorithm implementation was parallelized using OpenMP (Open Multi-Processing) and OpenCL (Open computing Language) standards. Its performances were measured on 4 different configurations, based on dual core and i5 processors. The experimental results prove that the parallel execution of the algorithm has good performances in terms of speed-up ratio, when compared to its serial execution. Finally, the results show that, because of Dijkstra's algorithm in itself is sequential, and difficult to parallelize, average speed-up ratio achieved by parallelization is only 10%. This proves to be a huge disadvantage of this algorithm, because its use is widespread, and enhancing its performance would have great effects in its many uses.
Banking industry suffers lost in millions of dollars each year caused by credit card fraud. Tremendous effort, time and money have been spent to detect fraud where there are studies done on creating personalized model...
详细信息
Banking industry suffers lost in millions of dollars each year caused by credit card fraud. Tremendous effort, time and money have been spent to detect fraud where there are studies done on creating personalized model for each credit card holder to identify fraud. These studies claimed that each card holder carries different spending behavior which necessitates personalized model. However, to the best of our knowledge, there has not been any study conducted to verify this hypothesis. Hence, in this paper, we investigate the effectiveness of personalized models compared to the aggregated models in identify fraud for different individuals. For this purpose, we have collected some actual transactions and some other data through an online questionnaire. We have then constructed personalized and aggregated models. The performance of these models is evaluated using test data set to compare their accuracy in identifying fraud for different individuals. To our surprise, the experimental results show that aggregated models outperforms personalized models. Besides, we have also compared the performance of the random forest and Naïve Bayes in creating the models for fraud detection. Generally, random forest performs better than the Naïve Bayes for the aggregated model while Naïve Bayes performs better in the personalized models.
Due to the rapid increase of information in the World Wide Web, there exists an explosion of information on the Web that may overwhelm the common Web user. The Web user may find it quicker or more efficient to browse ...
详细信息
Due to the rapid increase of information in the World Wide Web, there exists an explosion of information on the Web that may overwhelm the common Web user. The Web user may find it quicker or more efficient to browse the Web by reading summaries of Web sites. This paper proposes WebSum to compress Web site content into a summary. WebSum is an enhancement of the SumBasic algorithm, that was mainly used for multi-document summarization. In the case of Web sites, we find that several Web characteristics such as title and keywords can be used to extract sentences that may represent the overall topic of the Web site. Initial results show that WebSum is able to reveal sentences relate to the concept of the Web site. WebSum is then evaluated against the original algorithm of SumBasic.
Smart cards are one of the efficient devices in providing security in some systems. Smart cards are secured with using encryption algorithms. Finding the best algorithm in smart cards is more of a concern these days. ...
详细信息
Smart cards are one of the efficient devices in providing security in some systems. Smart cards are secured with using encryption algorithms. Finding the best algorithm in smart cards is more of a concern these days. There are a lot of applications with different types of encryption algorithm. Although many people have worked on modifying and improving the algorithms, the needs for having all information about them in one place and detailed comparisons between them are essential. In this paper we are going to describe the most popular and efficient encryption algorithms in smart cards such as RSA, ECC, DES and ECDSA and comparisons between these algorithms to find out the differences. This result can be helpful for such new device such as multipurpose smart cards. Results are considered under different hardware settings and languages.
This paper describes the procedure and the results of measuring the speed of processing arrays on 1, 2, or 3 hosts, connected in LAN. The measurement scenario was based on having the fixed processing time for each arr...
This paper describes the procedure and the results of measuring the speed of processing arrays on 1, 2, or 3 hosts, connected in LAN. The measurement scenario was based on having the fixed processing time for each array member in all cases. Also, processing each array member is individual from processing others. For gaining control data, the array was processed on only one host. Afterwards, the array was split in two and three equal pieces for processing on two and three hosts, respectively. The communication between the hosts was established by using socket programming techniques in .NET. The results were impressive because the speed-up in some cases was almost linear.
The limited computing resources on mobile device have always been an issue for game developers. With the open doors of mobile companies such as Apple and Android have provided, the barrier for entry into the game deve...
详细信息
The limited computing resources on mobile device have always been an issue for game developers. With the open doors of mobile companies such as Apple and Android have provided, the barrier for entry into the game development field has significantly been lowered down. Many existing works do not understand the loophole on handling resources on the mobile device wisely, causing the program to experience lag or crash. This paper presents a novel collision detection optimization especially for shooting games where massive hit testing is required. We tackle the larger problem on collision between two groups of objects, rather than on the collision checking or intersection between two single objects. The number of objects involved may be as little as five objects or as more as hundreds of objects at one time. We will explain how to optimize the speed process while not using up too much of the memory. It is always important to ensure that it does not reach the maximum memory in the mobile device to prevent any crash in the game. In our result, it shows that our algorithm is efficient in term of having no lags or crashes.
暂无评论