• Journal of Korea Multimedia Society
• /
• 제22권2호
• /
• pp.203-209
• /
• 2019

The performance of an intelligent classifier for detecting malwares added to multimedia contents based on machine learning is highly dependent on the properties of feature set. Especially, in order to determine the malicious code in real time the size of feature set should be as short as possible without reducing the accuracy. In this paper, we introduce an optimal feature selection method to satisfy both high detection rate and the minimum length of feature set against the feature set provided by PEFeatureExtractor well known as a feature extraction tool. For the evaluation of the proposed method, we perform the experiments using Windows Portable Executables 32bits.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제36권4호
• /
• pp.123-129
• /
• 2013

The aim of this study is to design an intelligent pattern-based real-time trading system (PRTS) using rough set analysis of technical indicators, dynamic time warping (DTW), and genetic algorithm in stock futures market. Rough set is well known as a data-mining tool for extracting trading rules from huge data sets such as real-time data sets, and a technical indicator is used for the construction of the data sets. To measure similarity of patterns, DTW is used over a given period. Through an empirical study, we identify the ideal performances that were profitable in various market conditions.

• Journal of the Korean Geotechnical Society
• /
• 제15권2호
• /
• pp.95-104
• /
• 1999

The bearing capacity of piles driven in soils showing set-up tendency increases with time. Though WEAP is an excellent tool for evaluating the driveability of driven pile, it has some limitations to predict reliable bearing capacity of pile after driving. It is because the existing WEAP method cannot take into account time-dependent soil properties after driving. The set-up effect should be accounted for to obtain a reliable bearing capacity by the WEAP. Unfortunately, there are no sufficient methods to take the set-up effect into consideration in wave equation analysis. This paper suggests an alternative to consider time effect in wave equation analysis through statistical analysis of dynamic load test data both at the end of driving and in the beginning of restrike. It is shown that the suggested parameters(quake and damping) would be more reliable than the existing one for the wave equation analysis of driven piles.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• 제48권12호
• /
• pp.1575-1579
• /
• 1999

Embedded processors often accommodate two instruction sets, a standard instruction set and a compressed instruction set. With the compressed instruction set, code size can be reduced while instruction count (and consequently execution time) can be increased. To achieve code size reduction without significant increase of execution time, this paper proposes a new compressed instruction set architecture, called TOE (Two Operations Execution). The proposed instruction set format includes the parallel bit that indicates an instruction can be executed simultaneously with the next instruction. To add the parallel bit, TOE instruction format reduces the destination register field. The reduction of the register field limits the number of registers that are accessible by an instruction. To overcome the limited accessibility of registers, TOE adapts non-homogeneous register partition in which registers are divided into multiple subsets, each of which are accessed by different groups of instructions. With non-homogeneous registers, each instruction can access only a limited number of registers, but an entire program can access all available registers. With efficient non-homogeneous register allocator, all registers can be used in a balanced manner. As a result, the increase of code size due to register spills is negligible. Experimental results show that more than 30% of TOE instructions can be executed in parallel without significant increase of code size when compared to existing Thumb instruction set.

• Journal of the Chungcheong Mathematical Society
• /
• 제16권1호
• /
• pp.7-14
• /
• 2003

Let $P_c(z)=z^n+c$ be a complex polynomial with an integer $n{\geq}2$. We derive a criterion that the critical orbit of $P_c$ escapes to infinity and investigate its applications to the degree-n bifurcation set. The intersection of the degree-n bifurcation set with the real line as well as with a typical symmetric axis is explicitly written as a function of n. A well-defined escape-time algorithm is also included for the improved construction of the degree-n bifurcation set.

• Journal of the Korean Data and Information Science Society
• /
• 제22권6호
• /
• pp.1275-1281
• /
• 2011

Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition, we give a polynomial time algorithm for determining the balancedness of the game on a tree, for finding a element of the core.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.77-92
• /
• 2005

An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

• Journal of the Korea Institute of Building Construction
• /
• 제12권1호
• /
• pp.87-97
• /
• 2012

This paper presents a method of estimating the setting time of cement mortar incorporating recycled aggregate powder (RP) and cement kiln dust (CKD) at various curing temperatures by applying an equivalent age method. To estimate setting time, the equivalent age using apparent activation energy (Ea) was applied. Increasing RP and CKD leads to a shortened initial and final set. Ea at the initial set and final set obtained by Arrhenius function showed differences in response to mixture type. These were estimated to be from 10~19 KJ/mol in all mixtures, which is smaller than those of conventional mixture ranging from 30~50 KJ/mol. Based on the application of Ea to Freisleben Hansen and Pederson's equivalent age function, equivalent age is nearly constant, regardless of curing temperature and RP contents. This implies that the concept of maturity is applicable in estimating the setting time of concrete containing RP and CKD. A high correlation was observed between estimated setting time and measured setting time. A multiregression model was provided to determine setting time reflecting RP and CKD. Thus, the setting time estimation method studied herein can be applicable to concrete incorporating RP and CKD in the construction field.

• The KIPS Transactions:PartA
• /
• 제8A권2호
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• Journal of information and communication convergence engineering
• /
• 제9권1호
• /
• pp.105-109
• /
• 2011

In this paper, we study the dominating-free sest which is defined as follows: k points called servers and n points called clients in the plane are given. For a point p in the plane is said to be dominated by a client c if for every server s, the distance between s and p is greater than the distance between s and c. The dominating-free set is the set of points in the plane which aren't dominated by any client. We present an O(nklogk+$n^2k$) time algorithm for computing the dominating-free set under the $L_1$-metric. Specially, we present an O(nlogn) time algorithm for the problem when k=2. The algorithm uses some variables and 1-dimensional arrays as its principle data structures, so it is easy to implement and runs fast.