• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.203-208
• /
• 2013

As smartphones are rapidly and widely spread, their applications request gradually larger computation power. Recently, in the personal computer, computing power of hardware has exceeded performance requirement of software sometimes. Computing power of smartphone, however, will not grow at the same pace as demand of applications because of form factor to seek thinner devices and power limitation by relatively slow technical progress of battery. Computation offloading is getting huge attention as one of solution for the problem. It has not commonly used technology in spite of advantages for performance and power consumption since the existing offloading frameworks are difficult for application developer to utilize. This paper presents an application developer-friendly offloading framework, named SorMob. Based on Aspect Oriented Programming model, SorMob provides a convenient environment for application development, and its performance was verified by comparing with the existing offloading framework.

• Environmental Analysis Health and Toxicology
• /
• v.30
• /
• pp.10.1-10.14
• /
• 2015

Recent cohort studies have relied on exposure prediction models to estimate individual-level air pollution concentrations because individual air pollution measurements are not available for cohort locations. For such prediction models, geographic variables related to pollution sources are important inputs. We demonstrated the computation process of geographic variables mostly recorded in 2010 at regulatory air pollution monitoring sites in South Korea. On the basis of previous studies, we finalized a list of 313 geographic variables related to air pollution sources in eight categories including traffic, demographic characteristics, land use, transportation facilities, physical geography, emissions, vegetation, and altitude. We then obtained data from different sources such as the Statistics Geographic Information Service and Korean Transport Database. After integrating all available data to a single database by matching coordinate systems and converting non-spatial data to spatial data, we computed geographic variables at 294 regulatory monitoring sites in South Korea. The data integration and variable computation were performed by using ArcGIS version 10.2 (ESRI Inc., Redlands, CA, USA). For traffic, we computed the distances to the nearest roads and the sums of road lengths within different sizes of circular buffers. In addition, we calculated the numbers of residents, households, housing buildings, companies, and employees within the buffers. The percentages of areas for different types of land use compared to total areas were calculated within the buffers. For transportation facilities and physical geography, we computed the distances to the closest public transportation depots and the boundary lines. The vegetation index and altitude were estimated at a given location by using satellite data. The summary statistics of geographic variables in Seoul across monitoring sites showed different patterns between urban background and urban roadside sites. This study provided practical knowledge on the computation process of geographic variables in South Korea, which will improve air pollution prediction models and contribute to subsequent health analyses.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2405-2411
• /
• 2009

MMSE, ZF and ML are the decoding mechanisms for V-BLAST system, and ML shows the best performance decoding the original signal among them. However, it has a problem that the computation complexity is increased exponentially according to the number of transmit antennas and transmit degrees. In this paper, we propose a low complexity linear ML detection algorithm having low computation complexity, then analyze the system performance in BER and computation complexity comparing with other algorithms. In the simulation, the BER performance of the proposed algorithm is superior than ZF and MMSE detection algorithms, and similar to ML detection algorithm. However, its computation complexity was 50% less than ML algorithm. From the results, we confirm that the proposed algorithm is superior than other ML detection algorithms.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.94-102
• /
• 2013

We propose the mirror active element pattern (AEP) method for the radiation pattern computation of linear array antennas versus scan angles. The computation time for the radiation pattern of linear array antennas using the mirror AEP method is reduced by almost half compared to that using the AEP method because the number of AEPs of elements obtained by the full-wave simulation necessary for the radiation pattern computation of linear array antennas is reduced by almost half. The difference between the radiation patterns of linear array antennas obtained by the full-wave simulation and mirror AEP method is very small for wide scan angle range when the radiation pattern of an antenna element is symmetric.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.103-110
• /
• 2006

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations Is increases in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of noise derived from mean values of LLR in turbo decoder, the proposed algorithm can largely reduce the computation and average number of iterations without BER performance degradation. As a result of simulations, the computation of the proposed algorithm is reduced by about $66{\sim}80%$ compared to conventional algorithm. The average number of iterations is reduced by about $13.99%{\sim}15.74%$ compared to CE algorithm and about $17.88%{\sim}18.59%$ compared to SCR algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.160-168
• /
• 2011

A Frequency domain beamforming technique is widely used in sonar systems with a large number of beams and sensors. In the battlefield environment requiring real-time signal processing, it is needed to optimize the computational complexity of the spectrum computation to implement an efficient and fast frequency domain beamformer. So, in this paper, we proposed the pruned-GSFFT (pruned generalized sliding fast Fourier transform) as a new spectrum computation method. The proposed method help to reduce the computational complexity of the real-time partial spectrum computation by eliminating the redundancy between consecutive input samples and skipping the regardless frequency bands. Also the characteristics of the proposed pruned-GSFFT method and its computational complexity are compared to those of previous FFT algorithms.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.6
• /
• pp.452-456
• /
• 2003

We discuss how to reduce the number of inverse matrix and its dimensions requested in MLLR framework for speaker adaptation. To find a smaller set of variables with less redundancy, we adapt PCA (principal component analysis) and ICA (independent component analysis) that would give as good a representation as possible. The amount of additional computation when PCA or ICA is applied is as small as it can be disregarded. 10 components for ICA and 12 components for PCA represent similar performance with 36 components for ordinary MLLR framework. If dimension of SI model parameter is n, the amount of computation of inverse matrix in MLLR is proportioned to O(n⁴). So, compared with ordinary MLLR, the amount of total computation requested in speaker adaptation is reduced by about 1/81 in MLLR with PCA and 1/167 in MLLR with ICA.

• Journal of Navigation and Port Research
• /
• v.32 no.3
• /
• pp.251-255
• /
• 2008

Container cranes are vulnerable structure about difficult weather conditions bemuse there is no shielding facility to protect them from the strong wind. This study was carried out to analyze the wind load which have an effect on container crane according to the various wind direction. The container crane is a model of a 61-ton class that used broadly in the current ports. The external fluid field was figured as a cylinder which was set up $500m{\times}200m$. In this study, we applied mean wind load conformed to 'Design Criteria of Wind Load' in 'Load Criteria of Building Structures' and an external fluid field was divided as interval of 10 degrees to analyze effect according to a wind direction In this conditions, we carried out the computation fluid dynamic analysis using the CFX-10. As we compared computation fluid dynamic analysis with wind tunnel test, we analyzed the wind load which was needed to design the container crane.

• Journal of Biomedical Engineering Research
• /
• v.41 no.3
• /
• pp.128-137
• /
• 2020

Cardiac electrophysiology studies often use simulation to predict how cardiac will behave under various conditions. To observe the cardiac tissue movement, it needs to use the high--resolution heart mesh with a sophisticated and large number of nodes. The higher resolution mesh is, the more computation time is needed. To improve computation speed and performance, parallel processing using multi-core processes and network computing resources is performed. In this study, we compared the computational speeds of CPU parallelization and GPU parallelization in virtual heart simulation for efficiently calculating a series of ordinary differential equations (ODE) and partial differential equations (PDE) and determined the optimal CPU and GPU parallelization architecture. We used 2D tissue model and 3D ventricular model to compared the computation performance. Then, we measured the time required to the calculation of ODEs and PDEs, respectively. In conclusion, for the most efficient computation, using GPU parallelization rather than CPU parallelization can improve performance by 4.3 times and 2.3 times in calculations of ODEs and PDE, respectively. In CPU parallelization, it is best to use the number of processors just before the communication cost between each processor is incurred.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.1
• /
• pp.1-15
• /
• 2020

As differential computation analysis attack(DCA) which is context of side-channel analysis on white-box cryptography is proposed, masking white-box cryptography based on table encoding has been proposed by Lee et al. to counter DCA. Existing higher-order DCA for the masked white box cryptography did not consider the masking implementation structure based on table encoding, so it is impossible to apply this attack on the countermeasure suggested by Lee et al. In this paper, we propose a new higher-order DCA method that can be applied to the implementation of masking based on table encoding, and prove its effectiveness by finding secret key information of masking white-box cryptography suggested by Lee et al. in practice.