• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.285-288
• /
• 2008

In ubiquitous computing environment the biological signal ECG (Electrocardiogram signal) is usually recorded with noise components. Adaptive interference (or noise) canceller do adaptive filtering of the noise reference input to maximally match and subtract out noise or interference from the primary (signal plus noise) input thereby adaptively eliminate unwanted interference from the ECG signal. Measured Stress ECG (or exercise ECG signal) signal have three major noisy component like baseline wander noise, motion artifact noise and EMG (Electro-mayo-cardiogram) noise. These noises are not only distorted signal but also root of incorrect diagnosis while ECG data are analyzed. Motion artifact and EMG noises behave like wide band spectrum signals, and they considerably do overlapping with the ECG spectrum. Here the multidimensional adaptive method used for filtering which is more effective to improve signal to noise ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1002-1015
• /
• 2018

The advent of Internet of Things (IoT) and the evident inadequacy of Cloud networks concerning management of numerous end nodes have brought about a shift of paradigm giving birth to Fog computing. Fog computing is an extension of Cloud computing that extends Cloud resources at the edge of the network, closer to the user. Cloud computing has become one of the essential needs of people over the Internet but with the emerging concept of IoT, traditional Clouds seem inadequate. IoT entails extremely low latency and for that, the Cloud servers that are distant and unknown to the user appear to be unsuitable. With the help of Fog computing, the Fog devices installed would be closer to the user that will provide an immediate storage for the frequently needed data. This paper discusses data migration between different storage types especially between Cloud devices and then presents a mechanism to migrate data between Cloud and Fog Layer. We call this mechanism Adaptive Deadline-Aware Scheme (ADAS) for Data migration between Cloud and Fog. We will demonstrate that we can access and process latency sensitive "hot" data through the proposed ADAS more efficiently than with a traditional Cloud setup.

• Journal of Advanced Marine Engineering and Technology
• /
• v.30 no.7
• /
• pp.791-799
• /
• 2006

The aim of this paper is to design an adaptive speed control system of a marine diesel engine by fusion of hard computing based proportional integral derivative (PID) control and soft computing based fuzzy control methods. The model of a marine diesel engine is considered as a typical non oscillatory second order system. When its model and the actual marine diesel engine ate not matched, it is hard to control the speed of the marine diesel engine. Therefore, this paper proposes two methods in order to obtain the speed control characteristics of a marine diesel engine. One is an efficient method to determine the PID control parameters of the nominal model of a marine diesel engine. Second is a reference adaptive speed control method that uses a fuzzy controller and derivative operator for tracking the nominal model of the marine diesel engine. It was found that the proposed PID parameters adjustment method is better than the Ziegler & Nichols' method, and that a model reference adaptive control is superior to using only PID controller. The improved control method proposed here, could be applied to other systems when a model of a system does not match the actual system.

• Journal of Power Electronics
• /
• v.13 no.1
• /
• pp.122-138
• /
• 2013

Adaptive control of a peak current mode controlled (PCM) boost converter supplied by a PEM fuel cell is described in this paper. The adaptive controller with reference model and signal adaptation is developed in order to compensate the deviation of the response during the change of the operating point. The procedure for determining the adaptive algorithm's weighting coefficients, based on a combination of the pole-zero placement method and an optimization method is proposed. After applying the proposed procedure, the optimal adaptive algorithm's weighting coefficients can be determined in just a few iterations, without the use of a computer, thus greatly facilitating the application of the algorithm in real systems. Simulation and experimental results show that the dynamic behavior of a highly nonlinear control system with a fuel cell and a PCM boost converter, can fairly accurately be described by the dynamic behavior of the reference model, i.e., a linear system with constant parameters.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.886-898
• /
• 2020

Unusual data patterns or outliers can be generated because of human errors, incorrect measurements, or malicious activities. Detecting outliers is a difficult task that requires complex ensembles. An ideal outlier detection ensemble should consider the strengths of individual base detectors while carefully combining their outputs to create a strong overall ensemble and achieve unbiased accuracy with minimal variance. Selecting and combining the outputs of dissimilar base learners is a challenging task. This paper proposes a model that utilizes heterogeneous base learners. It adaptively boosts the outcomes of preceding learners in the first phase by assigning weights and identifying high-performing learners based on their local domains, and then carefully fuses their outcomes in the second phase to improve overall accuracy. Experimental results from 10 benchmark datasets are used to train and test the proposed model. To investigate its accuracy in terms of separating outliers from inliers, the proposed model is tested and evaluated using accuracy metrics. The analyzed data are presented as crosstabs and percentages, followed by a descriptive method for synthesis and interpretation.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1122-1133
• /
• 2019

We have designed and implemented a new data processing framework called MOHA(Mtc On HAdoop) which can effectively support Many-Task Computing(MTC) applications in a YARN-based Hadoop platform. MTC applications can be composed of a very large number of computational tasks ranging from hundreds of thousands to millions of tasks, and each MTC application may have different resource usage patterns. Therefore, we have implemented MOHA-TaskExecutor(a pilot-job that executes real MTC application tasks)'s Adaptive Parallel Computability which can adaptively execute multiple tasks simultaneously, in order to improve the parallel computability of a YARN container and the overall system throughput. We have implemented multi-threaded version of TaskExecutor which can "independently and dynamically" adjust the number of concurrently running tasks, and in order to find the optimal number of concurrent tasks, we have employed Hill-Climbing algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.419-423
• /
• 1996

These days, industrial robots are required to have high speed and high precision in doing various tasks. Recently, the adaptive control algorithms for those nonlinear robots have been developed. With spatial vector space, these adaptive algorithms including recursive implementation are simply described. Without sensing joint acceleration and computing the inversion of inertia matrix, these algorithms which include P.D. terms and feedforward terms have global tracking convergence. In this paper, the feasibility of the proposed control method is illustrated by applying to 2 DOF SCARA robot in DSP(Digital Signal Processing).

• Journal of Computing Science and Engineering
• /
• v.6 no.1
• /
• pp.26-38
• /
• 2012

Java has been increasingly used in programming for real-time systems. However, some of Java's features such as automatic memory management and dynamic compilation are harmful to time predictability. If these problems are not solved properly then it can fundamentally limit the usage of Java for real-time systems, especially for hard real-time systems that require very high time predictability. In this paper, we propose to exploit multicore computing in order to reduce the timing unpredictability that is caused by dynamic compilation and adaptive optimization. Our goal is to retain high performance comparable to that of traditional dynamic compilation, while at the same time, obtain better time predictability for Java virtual machine (JVM). We have studied pre-compilation techniques to utilize another core more efficiently, preoptimization on another core (PoAC) scheme to replace the adaptive optimization system (AOS) in Jikes JVM and the counter based optimization (CBO). Our evaluation reveals that the proposed approaches are able to attain high performance while greatly reducing the variation of the execution time for Java applications.

• International journal of advanced smart convergence
• /
• v.7 no.3
• /
• pp.101-109
• /
• 2018

In this paper, we propose an adaptive filtering scheme of connection requests for the defense of malicious energy consumption attacks against wireless computing devices with limited energy budget. The energy consumption attack tries to consume the battery energy of a wireless device with repeated connection requests and shut down the wireless device by exhausting its energy budget. The proposed scheme blocks a connection request of the energy consumption attack in the middle, if the same connection request is repeated and its request result is failed continuously. In order to avoid the blocking of innocuous mistakes of normal users, the scheme gives another chance to allow connection request after a fixed blocking time. The scheme changes the blocking time adaptively by comparing the message arriving ate during non-blocking period and that during blocking period. Evaluation shows that the proposed defense scheme saves up to 94% energy consumption compared to the non-defense case.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.233-240
• /
• 2005

The concept of ubiquitous computing has changed the way we look at computing. In the ubiquitous computing, the service depends on the contexts. The existing scheduling management systems require the contexts, but does not consider various contexts. In this paper, we design and implement new web-based scheduling management system adaptive to contexts. We implemented our system by using user, time, season, location. The results show that our system suggests a good scheduling.