KMITL

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

Browse

Search Results

Now showing 1 - 9 of 9

Some of the metrics are blocked by your
consent settings
Efficient breadth-first reduct search
(2020-05-01)
Boonjing, Veera
;
Chanvarasuth, Pisit
This paper formulates the problem of determining all reducts of an information system as a graph search problem. The search space is represented in the form of a rooted graph. The proposed algorithm uses a breadth-first search strategy to search for all reducts starting from the graph root. It expands nodes in breadth-first order and uses a pruning rule to decrease the search space. It is mathematically shown that the proposed algorithm is both time and space efficient.
Some of the metrics are blocked by your
consent settings
An ELECTRE III Based CBR Approach to Combinatorial Portfolio Selection
(2019-06-01)
Chanvarasuth, Pisit
;
Boongasame, Laor
;
Boonjing, Veera
Investors generally learn from historical data and use it to improve future investment decisions. However, existing portfolio selection research rarely considers such a concept. This paper proposes a novel approach to the combinatorial portfolio selection problem. Our solution employs the Case-Based Reasoning (CBR) approach with ELECTRE III, based on the Industry Classification Benchmark standards. The target stocks are ranked based on their similarities to a reference case, allowing specified selection criteria. Similarities are calculated based on selected ELECTRE III metrics. Experimental results with the Stock Exchange of Thailand data show that our CBR approach with ELECTRE III outperforms the traditional method.
Some of the metrics are blocked by your
consent settings
Supply chain management components and firm performance: Evidence from Thailand
(2017-11-01)
Boonjing, Veera
;
Chanvarasuth, Pisit
;
Lertwongsatien, Chalermsak
In general, supply chain management creates value for firms, customers, vendors, and stakeholders interrelating throughout a supply chain. The emergence of supply chain management components in supporting such circumstances have resulted in the need to explore further their subsequent effect on firm performance. This study attempts to examine the use of supply chain management components and investigates relationships between each of 11 supply chain management components and performance of Thai firms. Based on responses received from 241 firms, correlations and simple regression analysis were used to analyze the data. Our results suggest that there are significant positive relationship between components and firm performance. This study not only validates supply chain components’ contribution and emphasizes its potential, but it also ranks top five most critical supply chain management components affecting firm performance. These findings provide important insights for managers to understand the nature of their firms. It is also suggested that firms should focus more on managerial and behavioral management components.
Some of the metrics are blocked by your
consent settings
Risk of overusing mobile phones: Technostress effect
(2017-01-01)
Boonjing, Veera
;
Chanvarasuth, Pisit
Technostress is defined as the stress derived from the use of information technology. Prior researchers have studied this phenomenon in many situations such as in the work environment, concentrating on the effect of technostress on the individual who overwhelmed by the use of information technology on his/her job. In this study, we attempt to examine consequences of continuously overusing mobile phone which lead to technostress. Drawing from the stress-strain-outcome model of stress, we proposed that overusing mobile phone can lead to technostress, whereas technostress will cause problems in personal health and work-related issues. Results from surveying 400 working professionals provide a support for our proposed model.
Some of the metrics are blocked by your
consent settings
A two-hashing table multiple string pattern matching algorithm
(2013-11-04)
Khancome, Chouvalit
;
Boonjing, Veera
;
Chanvarasuth, Pisit
Multiple string pattern matching is one of many approaches to simultaneously search occurrences of a large number of patterns in a given text. In this paper, a new solution to this problem is presented by using two-hashing tables to minimize attempting times. This solution, called Two-Hashing Table Multiple String Patterns Matching Algorithm (Two-HT-MSPMA), is suitable for very long length of minimum pattern length. Its time complexity is more efficient than classic algorithms. Empirical results showed that its attempting times were less than of traditional algorithms. © 2013 IEEE.
Some of the metrics are blocked by your
consent settings
A virtualization approach to auto-scaling problem
(2011-01-01)
Thepparat, Theera
;
Harnprasarnkit, Amnart
;
Thippayawong, Douanghatai
;
Boonjing, Veera
;
Chanvarasuth, Pisit
The paper proposes to simulate feasibility of using virtualization technology to auto-scaling problem in cloud computing. It uses ARENA simulation software to build two different models. There are auto-scaling without server virtualization and auto-scaling with server virtualization. The results of our experiment show that employing virtualization technology increases both life time of servers and CPU utilization. © 2011 IEEE.
Some of the metrics are blocked by your
consent settings
A cost and space efficient method for unbalanced assignment problems
(2010-12-01)
Iampang, Anupong
;
Boonjing, Veera
;
Chanvarasuth, Pisit
In this paper, a new cost and space efficient solution to unbalanced assignment problems is presented. The new solution uses linear space complexity instead of polynomial complexity as used by the Hungarian method. Moreover, its optimal cost is lower than of the Kumar method - an existing linear space complexity solution to unbalanced assignment problems. ©2010 IEEE.
Some of the metrics are blocked by your
consent settings
A meiosis genetic algorithm
(2010-08-11)
Wiriyasermkul, Nattavut
;
Boonjing, Veera
;
Chanvarasuth, Pisit
This paper proposes a new genetic algorithm called a meiosis genetic algorithm (MGA) based on meiosis cell division. The meiosis cell division serves producing chromosome diversity which speeds up converging to a mature solution chromosome. The experiment results on a knapsack problem using the new algorithm show that it is more efficient than the simple genetic algorithm. © 2010 IEEE.
Some of the metrics are blocked by your
consent settings
A skipping SvS intersection algorithm
(2009-12-01)
Chatchaval, Jaratdech
;
Boonjing, Veera
;
Chanvarasuth, Pisit
In this paper, we propose to improve the SvS algorithm by skipping elements of the smaller set for reducing a search boundary. The boundary of skipped element is determined by boundaries of elements prior to and next to it. We perform experiments on uniformly distributed random data sets to compare our algorithm with the standard SvS. We use regression analysis to get an equation for determining an appropriate skipping number. Our results show that the skipping SvS algorithm using the equation obtained can reduce approximately 41% on the number of comparisons of the standard SvS algorithm. © 2009 IEEE.

KMITL

Browse

Filters

Settings

Sort By

Results per page

Search Results