KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Search Results

Now showing 1 - 8 of 8

Some of the metrics are blocked by your
consent settings
Firefly Mating Algorithm for Continuous Optimization Problems
(2017-01-01)
Ritthipakdee, Amarita
;
Thammano, Arit
;
Premasathian, Nol
;
Jitkongchuen, Duangjai
This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA), for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i) the mutual attraction between males and females causes them to mate and (ii) fireflies of both sexes are of the multiple-mating type, mating with multiple opposite sex partners. A female continues mating until her spermatheca becomes full, and, in the same vein, a male can provide sperms for several females until his sperm reservoir is depleted. This new feature enhances the global convergence capability of the algorithm. The performance of FMA was tested with 20 benchmark functions (sixteen 30-dimensional functions and four 2-dimensional ones) against FA, ALC-PSO, COA, MCPSO, LWGSODE, MPSODDS, DFOA, SHPSOS, LSA, MPDPGA, DE, and GABC algorithms. The experimental results showed that the success rates of our proposed algorithm with these functions were higher than those of other algorithms and the proposed algorithm also required fewer numbers of iterations to reach the global optima.
Some of the metrics are blocked by your
consent settings
A new selection operator to improve the performance of genetic algorithm for optimization problems
(2013-11-25)
Ritthipakdee, Amarita
;
Thammano, Arit
;
Premasathian, Nol
;
Uyyanonvara, Bunyarit
Nature-inspired algorithms, such as Particle swarm optimization (PSO), Ant colony optimization (ACO), and Firefly algorithm, are well known for solving NP-hard optimization problems. They are capable of obtaining optimal solutions in a reasonable time. The algorithm presented in this paper is a combination of a firefly mating concept and genetic algorithm. Genetic algorithm is used as the core of the algorithm while a firefly mating concept is used to compose a new selection operator. The proposed algorithm is tested on four standard benchmark functions. Experimental results have confirmed that the proposed algorithm is not only computationally more efficient than both the original firefly algorithm and the genetic algorithm but also almost always ensure the optimal solutions. © 2013 IEEE.
Some of the metrics are blocked by your
consent settings
A multiple fuzzy commitment scheme
(2013-07-12)
Premasathian, Nol
This paper presents a fuzzy commitment scheme, in which one committed value corresponds to many commitments. The scheme corrects the received input without using any error correcting code. The identification and verification operations in the scheme are performed in the same operation. The scheme uses simple mathematical multiplication and division operations to construct and verify commitments. © 2013 IEEE.
Some of the metrics are blocked by your
consent settings
A dynamic fuzzy commitment scheme using multiple commitments
(2012-12-01)
Choto, Somsak
;
Premasathian, Nol
This paper presents a dynamic fuzzy commitment scheme. In the scheme, multiple commitments are stored and one of them is replaced in each successful authentication. The process of calculation of the new commitment and the replacement is explained in three variants of the scheme. The adjacency matrix is applied to some variants of the scheme to increase their efficiencies. © 2012 IEEE.
Some of the metrics are blocked by your
consent settings
Searchable encryption schemes: With multiplication and simultaneous congruences
(2012-12-01)
Premasathian, Nol
;
Choto, Somsak
This paper presents fast searchable encryption schemes using multiplication and simultaneous congruences. In the schemes, any user can determine if a particular keyword exists in an encrypted document. The message can be encrypted by any technique. The number of occurrences of a keyword can be determined in some schemes. © 2012 IEEE.
Some of the metrics are blocked by your
consent settings
A dynamic fuzzy commitment scheme using ARRSES forecasting
(2012-12-01)
Choto, Somsak
;
Premasathian, Nol
A dynamic fuzzy commitment scheme gradually changes its stored commitment by the time while retains the fuzzy authentication behavior. When an entry passes the authentication, its value is taken to update the commitment. In this paper, we propose simplified Adaptive Response Rate Single Exponential Smoothing (ARRSES) which can be used to forecast the next commitment by using the authenticated input together with the existing commitment. The dynamic fuzzy commitment scheme using ARRSES forecasting stores only one commitment. We have the value of smoothing constant adjusted according to the characteristics of the data. The optimal beta is recommended to achieve the highest successful authentication rate. © 2012 Infonomics Society.
Some of the metrics are blocked by your
consent settings
An improvement of an RFID indoor positioning system using one base station
(2009-01-01)
Hatthasin, Upady
;
Thainimit, Somying
;
Vibhatavanij, Kemathat
;
Premasathian, Nol
;
Worasawate, Denchai
The proliferation of mobile computing devices and wireless positioning networks has fostered a growing interest in location-aware systems and devices. Most technologies such as Radio Frequency IDentification (RFID), RADAR, etc, use at least three Base Station (BS) for calculating position of target objects. This paper describes an improvement of the previous OneBS algorithm [13]. The proposed system uses only one BS based on the RFID infrastructure for positioning target tags amid the clutter of indoor interference environments. We proposed to fuse the Round-trip Time of Flight (RTOF) and the Received Signal Strength (RSS) in the positioning algorithm. Both information are kept in an intersection Box (iBox). The RTOF information is used to focus a target tag's position among groups of four-nearestneighbor reference tags kept within iBox. Then, the RSS information is weighted using the weighted center of gravity technique to estimate a location of the target tags. Our experiments are based on Three Dimension (3D) materials within interference environments. The interference environments are simulated based on Uniform Geometrical Theory of Diffraction (UTD), for measuring signals in each specific area. Our proposed algorithm gains 50 percents better average distance error compared to the OneBS algorithm.
Some of the metrics are blocked by your
consent settings
Vehicle related fee collection system using encoded tickets
(2007-12-01)
Premasathian, Nol
;
Watthayu, Wiboonsak
;
Worasucheep, Chukiat
;
Sinapisomsaran, Charoen
This paper studies the similarity of vehicle related fee collection in various facilities such as highways, expressways, car parks, or an establishment that require a proof of membership before a vehicle can proceed to the reserved area. This paper shows that all of these facilities can share the same fee collection model. The concept is to associate the license plate number of a vehicle with essential information relating to the entry eligibility of the vehicle. The associated information is encoded to ensure security and prevent ticket forgery. The proposed system requires no toll booth or any other structures and therefore vehicles are not required to reduce speed to pay a fee. An application employing the concept is demonstrated.

KMITL

Browse

Filters

Settings

Sort By

Results per page

Search Results