• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.1
• /
• pp.457-467
• /
• 2020

Increasing environmental concerns have prompted countries around the world to tighten regulations on greenhouse gases and fuel efficiency. Research is being done using advanced driver assistance systems to improve fuel economy and for the convenience of drivers. Research on systems such as adaptive cruise control (ACC), LKAS, and AEB is active. The purpose of ACC is to control the longitudinal speed and distance of the vehicle and minimize the driver's load, which is considered useful for accident prevention. From this point of view, research has used a mathematical method of safety evaluation as a function of distances and scenarios while considering domestic road environments. A vehicle is tested with a simulation in a proposed scenario. The purpose of the analysis is to verify the functional safety of ACC by comparing the theoretical calculations using theoretical equations, the relative distances in the simulation, and an actual vehicle test. These methods are expected to enable many companies to use scenarios, formulas, and simulations as safety verification methods in the development of ACC.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.3
• /
• pp.1202-1211
• /
• 2018

In this paper, induction machine operation efficiency and torque is improved using Machine Learning based Gene Optimization (ML-GO) Technique is introduced. Optimized Genetic Algorithm (OGA) is used to select the optimal induction machine data. In OGA, selection, crossover and mutation process is carried out to find the optimal electrical machine data for induction machine design. Initially, many number of induction machine data are given as input for OGA. Then, fitness value is calculated for all induction machine data to find whether the criterion is satisfied or not through fitness function (i.e., objective function such as starting to full load torque ratio, rotor current, power factor and maximum flux density of stator and rotor teeth). When the criterion is not satisfied, annealed selection approach in OGA is used to move the selection criteria from exploration to exploitation to attain the optimal solution (i.e., efficient machine data). After the selection process, two point crossovers is carried out to select two crossover points within a chromosomes (i.e., design variables) and then swaps two parent's chromosomes for producing two new offspring. Finally, Adaptive Levy Mutation is used in OGA to select any value in random manner and gets mutated to obtain the optimal value. This process gets iterated till finding the optimal value for induction machine design. Experimental evaluation of ML-GO technique is carried out with performance metrics such as torque, rotor current, induction machine operation efficiency and rotor power factor compared to the state-of-the-art works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.984-994
• /
• 2003

This paper proposes a novel blind adaptive algorithm for computing the weight vector of an antenna array system. The new technique utilizes a Generalized On-Off algorithm to obtain the weight vector maximizing the SINR(Signal to Interference plus Noise Ratio) of the received signal. It is observed that the proposed algorithm generates a suboptimal weight vector with a linear computational load(O(6N+8)). From the various simulations, it is confirmed that, when the signal environment becomes adverse, e.g., low Processing Gain, and/or wide angular spread. the proposed algorithm outperforms the conventional one in terms of the communication capacity by about 3 times. Applying the proposed algorithm to satellite tracking systems as well as IS2000 1X mobile communication system, we have found that both communication capacity and communication quality are significantly improved.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.2
• /
• pp.61-66
• /
• 2021

This paper related with the performance comparison of mSE-MMA and mDSE-MMA adaptive equalization algorithm which is possible to reduce the intersymbol interference that occurs in the nonlinear communication channel transmitting 16-QAM signal. This two algorithm is possible to reduce the computational load compared to the current MMA algorithm, it has the degraded equalization performance due to simplified arithmetic in order to applying the mobile communication terminal. In order to improve the performance degradation, they controls the step size according to the existence of arbitrary radius circle of equalizer output compared to transmitted symbol point. The variation of step size according to this principle is applied to the SE-MMA and DSE-MMA, namely mSE-MMA and mDSE-MMA algorithm, the algorithm's performance were compared in the same channel and noise environment by computer simulation. As a result of simulation, the mSE-MMA has more superior to the mDSE-MMA in residual value of every performance index and SER performance, and the vice versa result in convergence speed.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.883-892
• /
• 2019

This study is the method which is adapted to control ankle joint movement for resolving the problem of gait imbalance in intervals where gait environments are changed and slope walking, as applying terrain-adaptive technique to intelligent above-knee prosthesis. In this development of above-knee prosthesis, to classify the gait modes is essential. For distinguishing the stance phases and the swing phase depending on roads, a machine learning which combines decision tree and random forest from knee angle data and inertial sensor data, is proposed and adapted. By using this method, the ankle movement state of the prosthesis is controlled. This study verifies whether the problem is resolved through butterfly diagram.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.433-441
• /
• 2021

Android applications are released across various categories, including productivity apps and games, and users are exposed to various applications and even malware depending on their usage patterns. On the other hand, most analysis engines train using existing datasets and do not reflect user patterns even if periodic updates are made. Thus, the detection rate for known malware is high, while types of malware such as adware are difficult to detect. In addition, existing engines incur increased service provider costs due to the cost of server farm, and the user layer suffers from problems where availability and real-timeness are not guaranteed. To address these problems, we propose an analysis system that performs on-device malware detection through transfer learning, which requires only one-time communication with the server. In addition, The system has a complete process on the device, including decompiler, which can distribute the load of the server system. As an evaluation result, it shows 90.3% accuracy without transfer learning, while the model transferred with adware catergories shows 95.1% of accuracy, which is 4.8% higher compare to original model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.149-157
• /
• 2020

Today, due to the large amount of data duplication caused by the increase in user data, various deduplication studies have been conducted. However, research on personal storage is relatively poor. Personal storage, unlike high-performance computers, needs to perform deduplication while reducing CPU and memory resource usage. In this paper, we propose an adaptive algorithm that selectively applies fixed size chunking (FSC) and whole file chunking (WFH) according to the file type and size in order to maintain the deduplication rate and reduce the load in personal storage. We propose an algorithm for minimization. The experimental results show that the proposed file system has more than 1.3 times slower at first write operation but less than 3 times reducing in memory usage compare to LessFS and it is 2.5 times faster at rewrite operation.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.653-660
• /
• 2004

Object-oriented analysis-synthesis coding (OOASC) subdivides each image of a sequence into a number of moving objects and estimates and compensates the motion of each object. It employs a motion parameter technique for estimating motion information of each object. The motion parameter technique employing gradient operators requires a high computational load. The main objective of this paper is to present efficient motion parameter estimation techniques using the hierarchical structure in object-oriented analysis-synthesis coding. In order to achieve this goal, this paper proposes two algorithms : hybrid motion parameter estimation method (HMPEM) and adaptive motion parameter estimation method (AMPEM) using the hierarchical structure. HMPEM uses the proposed hierarchical structure, in which six or eight motion parameters are estimated by a parameter verification process in a low-resolution image, whose size is equal to one fourth of that of an original image. AMPEM uses the same hierarchical structure with the motion detection criterion that measures the amount of motion based on the temporal co-occurrence matrices for adaptive estimation of the motion parameters. This method is fast and easily implemented using parallel processing techniques. Theoretical analysis and computer simulation show that the peak signal to noise ratio (PSNR) of the image reconstructed by the proposed method lies between those of images reconstructed by the conventional 6- and 8-parameter estimation methods with a greatly reduced computational load by a factor of about four.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.53-67
• /
• 2002

The multimedia synchronization is one of the key issues to be resolved in order to provide a good quality of multimedia related services, such as Video on Demands(VoD), Lecture on Demands(LoD), and tele-conferences. In this paper, we introduce an adaptive multimedia synchronization algorithm using the level of buffers and load of servers, which are modeled and analyzed by ExSpect, a Petri net based simulation tool. In the proposed algorithm, the audio and video buffers are divided to 5 different levels, and the pre-defined play-out speed controller tries to make the buffer level to be normal in different temporal relations between multimedia streams using buffer levels and server loads. Because each multimedia packet is played by the pre-defined play-out speed, the media data can be reproduced within the permissible limit of errors while preserving the level of buffers to be normal. The proposed algorithm is able to handle and support various communication restrictions between providers and users, and offers little jitter play-out to many users in networks with the limited transmission capability. The performance of the developed algorithm is analyzed in various network conditions using a Petri net simulation tool.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.773-782
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.