• Journal of Biomedical Engineering Research
• /
• v.17 no.3
• /
• pp.319-326
• /
• 1996

Clinical myography(EMG) is a technique for diagnosing neuromuscular disorders by analyzing the electrical signal that can be records by needle electrode during a muscular contraction. The EMG signal arises from electrical discharges that accompany the generation of force by groups of muscular fiber, and the analysis of EMG signal provides symptoms that can distinguish disorder of mLecle from disor- ders of nerve. One of the methods for analysis of EMG signal is to separate the individual discharge-the motor unit action potentials(MVAPS) - from EMG signal. But we can only observe the EMG signal that is a superimposed version of time delayed MUAPS. To obtain the information about MUAP(, i.e., position, firing number, magnitude etc), first of all, a method that can separate each MUAP from the EMG signal must be developed Although the methods for MUAP separation have been proposed by many researcherl they have required heavy computational burden. In this paper, we proposed a new method that has less computational burden and performs more reliable separation of superimposed EMG signal using wavelet filter which has multiresolution analysis as major property. As a result, we develope the separation algorithm of superimposed EMG signal which has less computational burden than any other researchers and exacutes exact separation process. The performance of this method has been discussed in the automatic resolving procedure which is neccessary to identify every firing of every motor unit from the EMG pattern.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.30-35
• /
• 2002

Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4372-4394
• /
• 2020

The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.399-400
• /
• 2009

As a part of the era of human centric applications people started to care about their well being utilizing any possible mean. This paper proposes a framework for real time on-body sensor health-care system, addresses the current issues in such systems, and utilizes an enhanced online divisive agglomerative clustering algorithm (EODAC); an algorithm that builds a top-down tree-like structure of clusters that evolves with streaming data to rationally cluster on-body sensor data and give accurate diagnoses remotely, guaranteeing high performance, and scalability. Furthermore it does not depend on the number of data points.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.42.1-42.1
• /
• 2021

Galaxy/Halo finding based on the friends-of-friend (FoF) algorithm has been widely adopted for its simplicity and expandability to the phase-space. However, cosmological simulations have been progressively bigger in size and more accurate in resolutions, resulting in that galaxy/halo finding gets computationally expensive more and more. In fact, we confirm this issue through our exercise of applying the 6-dimensional (6D) FoF galaxy finder code, VELOCIraptor (Elahi et al.2019) on the NewHorizon simulation (Dubois et al. 2021), in which typical galaxies with about 1e11 M_sun (10⁷ particles) are identified with very low speed (longer than a day). We have applied several improvements to the original VELOCIraptor code that solve the low-performance problem of galaxy finding on a simulation with high resolutions. Our modifications find the exact same FoF group and can be readily applied to any tree-based FoF code, achieving a 2700 (12) times speedup in the 3D (6D) FoF search compared to the original execution. We applied the updated version of VELOCIraptor on the entire NewHorizon simulation (834 snapshots) and identified its galaxies and halos. We present several quick comparisons of galaxy properties with those with GALAXYMaker data.

• Journal of Korea Water Resources Association
• /
• v.33 no.3
• /
• pp.279-288
• /
• 2000

The impact of land slope to the degree of flow divergence was considered employing distributional applications of slope exponents in the now directlOn algoriUnns. Lmear, exponential and ]X)wer law of distributional functIons were employed to address the variation of slope exponents m a terrain analysis. Dongok subwatershed at Wichun test watershed was selected as a study area. Digital Elevation Models of 20m, 30m, 40m and 50m grid size were made to perfonn the analysis. Various calcualtion methodologies of topographic index and the impact of grid sizes were investigated in terms of statistical and spatial aspects. DIstributional applications of slope e.xponents made it possible to represent the flow divergence and convergence about the ten-ain characteristics. The Monte~Carlo method was used to simulate six runoff events to check the impact of topographic factor in the runoff simulation.

• Journal of Korea Water Resources Association
• /
• v.53 no.6
• /
• pp.395-408
• /
• 2020

This paper aims to develop and apply three different machine learning approaches (i.e., artificial neural networks (ANN), adaptive neuro-fuzzy inference systems (ANFIS), and wavelet-based neural networks (WNN)) combined with an evolutionary optimization algorithm and the k-fold cross validation for multi-step (days) streamflow forecasting at the catchment located in Algeria, North Africa. The ANN and ANFIS models yielded similar performances, based on four different statistical indices (i.e., root mean squared error (RMSE), Nash-Sutcliffe efficiency (NSE), correlation coefficient (R), and peak flow criteria (PFC)) for training and testing phases. The values of RMSE and PFC for the WNN model (e.g., RMSE = 8.590 ㎥/sec, PFC = 0.252 for (t+1) day, testing phase) were lower than those of ANN (e.g., RMSE = 19.120 ㎥/sec, PFC = 0.446 for (t+1) day, testing phase) and ANFIS (e.g., RMSE = 18.520 ㎥/sec, PFC = 0.444 for (t+1) day, testing phase) models, while the values of NSE and R for WNN model were higher than those of ANNs and ANFIS models. Therefore, the new approach can be a robust tool for multi-step (days) streamflow forecasting in the Seybous River, Algeria.

• Journal of Biomedical Engineering Research
• /
• v.34 no.4
• /
• pp.182-188
• /
• 2013

This study aims to develop a practical algorithm which can detect freezing of gait(FOG) in patients with Parkinson's disease(PD). Eighteen PD patients($68.8{\pm}11.1yrs.$) participated in this study, and three($68.7{\pm}4.0yrs.$) of them showed FOG. We suggested two time-domain algorithms(with 1-axis or 3-axes acceleration signals) and compared them with the frequency-domain algorithm in the literature. We measured the acceleration of left foot with a 3-axis accelerometer inserted at the insole of a shoe. In the time-domain method, the root-mean-square(RMS) acceleration was calculated in a moving window of 4s and FOG was defined as the periods during which RMS accelerations located within FOG range. The parameters in each algorithm were optimized for each subject using the simulated annealing method. The sensitivity and specificity were same, i.e., $89{\pm}8%$ for the time-domain method with 1-axis acceleration and were $91{\pm}7%$ and $90{\pm}8%$ for the time-domain method with 3-axes acceleration, respectively. Both performances were better in the time-domain methods than in the frequency-domain method although the results were statistically insignificant. The amount of calculation in the time-domain method was much smaller than in the frequency-domain method. Therefore it is expected that the suggested time domain algorithm would be advantageous in the systematic implementation of FOG detection.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.08a
• /
• pp.212-218
• /
• 2003

In order to analyze the heat transfer phenomena in the plasma flames, a mathematical model describing heat and fluid flow in an electric arc has been developed and used to predict heat transfer from the arc to the steel bath in a DC Electric Arc Furnace. The arc model takes the separate contributions to the heat transfer from each involved mechanism into account, i.e. radiation, convection and energy transported by electrons. The finite volume method and a SIMPLE algorithm are used for solving the governing MHD equations, i.e., conservation equations of mass, momentum, and energy together with the equations describing a $\kappa-\epsilon$ model for turbulence. The model predicts heat transfer for different currents and arc lengths. Finally these calculation results can be used as a useful insight into plasma phenomena of the industrial-scale electric arc furnace. From these results, it can be concluded that higher arc current and longer arc length give high heat transfer.