• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1462-1471
• /
• 2019

Real-time embedded systems have become pervasive in general industry. They also began to be applied in such domains as avionics, automotive, aerospace, healthcare, and industrial Internet. However, the system failure of such domains could result in catastrophic consequences. Runtime software testing is required in such domains that demands very high accuracy. Traditional runtime software testing based on handwork is very inefficient and time consuming. Hence, test automation methodologies in runtime is demanding. In this paper, we introduce a software testing system that translates a real-time software into a monitorable real-time software. The monitorable real-time software means the software provides the monitoring information in runtime. The monitoring target are time constraints of the input real-time software. We anticipate that our system lessens the burden of runtime software testing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.63-71
• /
• 1996

This paper proposes a method which analyzes facial shape and extracts positions of eyes regardless of the tilt and the size of input iamge. With the extracted feature parameters of facial element by the method, full human faces are recognized by a neural network which BP algorithm is applied on. Input image is changed into binary codes, and then labelled. Area, circumference, and circular degree of the labelled binary image are obtained by using chain code and defined as feature parameters of face image. We first extract two eyes from the similarity and distance of feature parameter of each facial element, and then input face image is corrected by standardizing on two extracted eyes. After a mask is genrated line historgram is applied to finding the feature points of facial elements. Distances and angles between the feature points are used as parameters to recognize full face. To show the validity learning algorithm. We confirmed that the proposed algorithm shows 100% recognition rate on both learned and non-learned data for 20 persons.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.46-58
• /
• 1998

Multi-disk data allocation problem examined in this paper is to find a method to distribute a Binary Cartesian Product File on multiple disks to maximize parallel disk I/O accesses for partial match retrieval. This problem is known to be NP-hard, and heuristkc approaches have been applied to obtain sub-optimal solutions. Recently, efficient methods have been proposed with a restriction that the number of disks in which files are stored should be power of 2. In this paper, we propose a new disk Allocation method based on Genetic Algorithm(GA) to remove the restriction on the number of disks to be applied. Using the schema theory, we prove that our method can find a near-optimal solutionwith high probability. We compare the quality of solution derived by our method with General Disk Modulo, Binary Disk Modulo, and Error Correcting Code methods through the simulation. The simulation results show that proposed GA is superior to GDM method in all cases and provides comparable performance to the BDM method which has a restriction on the number of disks.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2006.11a
• /
• pp.489-492
• /
• 2006

Needs for the new technologies and cutting-edge Ultra Flowing Self-Compacting Concrete are emerging as the concrete structures are becoming bigger and more specialized recently. In North America and Europe, SCC, which has high resistance against flow ability and segregation, is being used as concrete material in applications such as precast and prestressed bridges, where reinforcing bars are overcrowdedly placed. In Korea, SCC has been utilized limitedly in building structures but its utilization should be expanded to engineering structures such as bridges. In this study, for the application in precast and prestressed bridges with overlycrowded reinforcing bars, USCC was mixed with admixtures to give a binary system and a ternary system according to the 1st grade rules by JSCE (Japan Society of Civil Engineers). Compressive strength and splitting tensile strength of the resulting USCCs were tested. Elastic modulus were compared with the values suggested in CEB-FIP code and ACI 318-05.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.3
• /
• pp.147-152
• /
• 1985

The error-trapping decoder is constructed for the (7, 3) Reed-Solomon code. The syndrome resister is constructed with the encoder and the substanial test logic circuits. The element of GF(8) is represented by the triple D-flip-floops. The hardware is constructed. And it is controlled by the micro computer(Apple II). The time for the encoding and the decoding were $350\musecs and 910u secs respectively. The experimental results show that the two symbol errors were corrected and 4-bit-binary-burst errors were also corrected.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.15 no.4
• /
• pp.332-337
• /
• 2002

The applicability of models based on fractal geometry to characterize the surface of the EL devices was investigated. Insulating layer and phosphor layer of EL devices were deposited on ITO glass using e-beam method. The images of phosphor layer by scanning electron microscope(SEM) were transformed to binary coded data. The relations between fractal geometry and electrical characteristics of EL devices were investigated. When the fractal dimension of $Cas:EuF_3$ EL device was 1.82 and its grain boundary area was 19%, the brightness of $Cas:EuF_3$ EL device was 261 cd/$\textrm{m}^2$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.164-169
• /
• 2009

This paper presents a fast and accurate ranging algorithm for the WiBro system. The proposed algorithm detects a received ranging code and estimates its propagation delay using the correlation characteristics of the PRBS (Pseudo Random Binary Sequence) and the circular shift property of the discrete Fourier transform operator. The proposed ranging algorithm was applied to array antenna systems to show how it could improve the ranging performance of an array antenna system compared to a conventional base station system, which uses only a single antenna.

• Bulletin of the Korean Space Science Society
• /
• 2010.04a
• /
• pp.32.3-32.3
• /
• 2010

We have analyzed times of minima for six eclipsing binary systems which show asymmetric light curves. We found that five binary systems show period decrease and one system shows cyclic period variation. Three asymmetric light curves (SV Cen, RT Scl and VW Boo) are due to hot spot caused by mass transfer. Other three asymmetric light curves (AD Phe,, EZ Hya and TY Boo) are due to cool spot on the cooler component caused by magnetic activities. We also obtain absolute dimensions from photometric solution and spectroscopic solution by analyzing their light curves and radial velocity curves, collected from literatures, using 2007 version Wilson and Devinney computer code.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.374-388
• /
• 2011

Biometric discretization is a process of transforming continuous biometric features of an identity into a binary bit string. This paper mainly focuses on improving the global discretization method - a discretization method that does not base on information specific to each user in bitstring extraction, which appears to be important in applications that prioritize strong security provision and strong privacy protection. In particular, we demonstrate how the actual performance of a global discretization could further be improved by embedding a global discriminative feature selection method and a Linearly Separable Subcode-based encoding technique. In addition, we examine a number of discriminative feature selection measures that can reliably be used for such discretization. Lastly, encouraging empirical results vindicate the feasibility of our approach.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.73-82
• /
• 2022

This paper shows the hiding process of unlimited secret text size in an image using three methods: the first method is the traditional method in steganography that based on the concealing the binary value of the text using the least significant bits method, the second method is a new method to hide the data in an image based on Exclusive OR process and the third one is a new method for hiding the binary data of the text into an image (that may be grayscale or RGB images) using Exclusive and Huffman Coding. The new methods shows the hiding process of unlimited text size (data) in an image. Peak Signal to Noise Ratio (PSNR) is applied in the research to simulate the results.