• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.4
• /
• pp.28-36
• /
• 2009

Sequence-Pair(SP) model represents the topological relation between modules. In general, SP model based floorplanners search solutions using Simulated-Annealing(SA) algorithm. Several SA based floorplanning techniques using SP model have been published. To improve the performance of those techniques they tried to improve the speed for evaluation function for SP model, to find better scheduling methods and perturb functions for SA. In this paper we propose a two phase SA based algorithm. In the first phase, white space between modules is reduced by applying compaction technique to the floorplan obtained by an SP. From the compacted floorplan, the corresponding SP is determined. Solution space has been searched by changing the SP in the SA framework. When solutions converge to some threshold value, the first phase of the SA based search stops. Then using the typical SA based algorithm, ie, without using the compaction technique, the second phase of our algorithm continues to find optimal solutions. Experimental results with MCNC benchmark circuits show that how the proposed technique affects to the procedure for SA based floorplainning algorithm and that the results obtained by our technique is better than those obtained by existing SA-based algorithms.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.79-86
• /
• 2005

This paper suggests that sparse code motion algorithm should be used to make the code optimal in the respect of computation and lifetime. This algorithm Is SpCM algorithm, which expand BCM and LCM algorithm. BCM algorithm carries out the optimal code motion computationally and LCM algorithm reduces the register pressure in SpCM algorithm. Generally, code motion algorithm accomplishes the run-time optimal connected with the optimum of computation and the register pressure. Computational cost and consideration of the code size in the register pressure are also added in the paper. The optimum of code motion could be obtained through SpCM algorithm, which considers the code size, in audition to computational optimal and lifetime optimal. The algorithm presented in this paper is the most optimal algorithm in the respect of computation and lifetime, as all the unnecessary code motions are restrained.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.6
• /
• pp.394-400
• /
• 2017

This paper shows the extension of SpSF (Sparse Spectrum Fitting) algorithm, which is one of covariance matrix fitting-based DOA (Direction-of-Arrival) estimation algorithms, from the time domain to the frequency domain, and presents that SpSF can be implemented in the frequency domain. The superiority of the SpSF algorithm has been demonstrated by comparing DOA estimation performance with the performance of Conventional DOA estimation algorithm in the frequency domain for sinusoidal incident signals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1649-1665
• /
• 2021

In view of the low accuracy of the traditional FunkSVD algorithm, and in order to improve the computational efficiency of the algorithm, this paper proposes a parallel algorithm of improved FunkSVD based on Spark (SP-FD). Using RMSProp algorithm to improve the traditional FunkSVD algorithm. The improved FunkSVD algorithm can not only solve the problem of decreased accuracy caused by iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, thereby achieving the effect of improving the accuracy of the algorithm. And using the Spark big data computing framework to realize the parallelization of the improved algorithm, to use RDD for iterative calculation, and to store calculation data in the iterative process in distributed memory to speed up the iteration. The Cartesian product operation in the improved FunkSVD algorithm is divided into blocks to realize parallel calculation, thereby improving the calculation speed of the algorithm. Experiments on three standard data sets in terms of accuracy, execution time, and speedup show that the SP-FD algorithm not only improves the recommendation accuracy, shortens the calculation interval compared to the traditional FunkSVD and several other algorithms but also shows good parallel performance in a cluster environment with multiple nodes. The analysis of experimental results shows that the SP-FD algorithm improves the accuracy and parallel computing capability of the algorithm, which is better than the traditional FunkSVD algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.6
• /
• pp.73-79
• /
• 2020

Nowadays, with the rapid spread of streaming services in the internet world, security vulnerabilities are also increasing rapidly. For streaming security, this paper proposes a PN(pseudo-random noise) distributed structure-based security processor for web streaming contents(SP-WSC). The proposed SP-WSC is basically a PN distributed code algorithm designed for web streaming characteristics, so it can secure various multimedia contents. The proposed SP-WSC is independent of the security vulnerability of the web server. Therefore, SP-WSC can work regardless of the vulnerability of the web server. That is, the SP-WSC protects the multimedia contents by increasing the defense against external unauthorized signals. Incidentally it also suggests way to reduce buffering due to traffic overload.

• Journal of Korean Academy of Nursing Administration
• /
• v.15 no.4
• /
• pp.491-505
• /
• 2009

Purpose: This study was to develop an algorithm for emergency nursing care of dyspneic patients. Methods: This methodological study was done through reviews of medical records and literatures, checklists of emergency nursing care for dyspneic patients, interviews with nurses, and experts' validity. Results: Firstly, the initial assessment confirmed the identification of airway patency, accessory muscle usage, RR, $SpO_2$, v/s, skin color, and mental status. Immediate emergency care provided oxygen, checked ABG, EKG, and chest X-ray, established a semi-fowler position, maintained IV routes, administered medication orders, and conducted careful monitoring. Secondly, if the patient exhibited $SpO_2$ of less than 90%, the nurse considered the patient's condition to be aggravated. Thirdly, if the patient showed improvement of more than 90% $SpO_2$, the nurse administered secondary assessment and carried out specific nursing care. However, if the patient continuously showed $SpO_2$ of less than 80%, the nurse assisted the intubation and then executed ventilator therapy. Conclusions: This study suggests that the algorithm is an effective decision tool and utilizing the algorithm is expected to improve the emergency nursing care for dyspneic patients.

• Geophysics and Geophysical Exploration
• /
• v.18 no.4
• /
• pp.223-231
• /
• 2015

Self-potential (SP) is sensitive to groundwater flow and there are many causes to generate SP. Among many mechanisms of SP, pore-fluid flow in porous media can generate potential without any external current source, which is referred to as electrokinetic potential or streaming potential. When calculating SP responses on the surface due to geothermal fluid within an engineered geothermal system (EGS) reservoir, SP anomaly is usually considered to be generated by fluid injection or production within the reservoir. However, SP anomaly can also result from geothermal water fluid within EGS reservoirs experiencing temperature changes between injection and production wells. For more precise simulation of SP responses, we developed an algorithm being able to take account of SP anomalies produced by not only water injection and production but also the fluid of geothermal water, based on three-dimensional finite-element-method employing tetrahedron elements; the developed algorithm can simulate electrical potential responses by both point source and volume source. After verifying the developed algorithm, we assumed a simple geothermal reservoir model and analyzed SP responses caused by geothermal water injection and production. We are going to further analyze SP responses for geothermal water in the presence of water production and injection, considering temperature distribution and geothermal water flow in the following research.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2386-2396
• /
• 1994

In this paper, an optimal algorithm for the design of 1-D FIR filters with finite precision coefficients is proposed. The algorithm is based on the observation that the frequency constraints of a sub-problems(SP) in the branch and bound algorithm, which repeatedly use LP(linear programming), are closely related with those of neighboring SPs. By using the relationship between the SPs, the proposed algorithm reduces the number of constraints required for solving each SP with Lp, whereas the conventional algorithm employs all the constraints, which are required for solving the initial problem. Thus, the overall computational load for the design of FIR filters with finite precision coefficients is significantly alleviated, compared to the conventional branch and bound algorithm. Also, a new branching scheme for the design of FIR filters with sum-of-power-of-two(SOPOT) coefficients is proposed. It is shown that the computational load for the design fo SOPT coefficient filters can be further reduced with the new branching scheme.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.629-632
• /
• 2012

This letter investigates the combination of the Chase-2 and sum-product (SP) algorithms for low-density parity-check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC codes. Moreover, a simple yet effective approach is proposed to construct TEPs for dealing with decoding failures with low-weight syndromes. Simulation results show that the proposed algorithm is effective in improving both the waterfall and error floor performance of LDPC codes.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.381-386
• /
• 2006

In this paper, we designed and implemented a web-based grid scheduling platform(WGridSP), which can model a system and simulate scheduling scheme in grid computing. WGridSP used GridSim, a grid scheduling toolkit in java-environment, as a tool for simulation and is able to Perform resource modeling, task modeling, algorithm compiling, simulation, and Performance evaluation rapidly in web environment. WGridSP can be applied as a foundation for grid research and can be used to analyze the efficiency of scheduling algorithm.