• Korean Journal of Child Studies
• /
• v.20 no.3
• /
• pp.231-244
• /
• 1999

This study examined the effects of short and long term playing of video gamer on children's visual parallel processing. All of the 64 fourth grade subjects were above average in IQ. They were classified into high and low video game users. Instruments were a visual parallel processing task consisting of imagery integration items, computers, and the arcade video game, Pac-Man. Subjects were pre-tested with a visual parallel processing task. After one week, the experimental group played video games for 15 minutes, but the control group didn't play. Immediately following this, all children were post-tested by the same task used on the pretest. The data was analyzed by ANCOVA and repeated measures ANOVA. The results showed that relaying short-term video games improved visual parallel processing and that long term experience with video games also affected visual parallel processing. there were no differences between high and low users in visual parallel processing after playing short term video games.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.211-214
• /
• 2006

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.04a
• /
• pp.389-395
• /
• 2004

We consider the interface between the parallel distributed memory multifrontal solver and the finite element method. We give in detail the requirement and the data structure of parallel FEM interface which includes the element data and the node array. The full procedures of solving a large scale structural problem are assumed to have pre-post processors, of which algorithm is not considered in this paper. The main advantage of implementing the parallel FEM interface is shown up in the case that we use a distributed memory system with a large number of processors to solve a very large scale problem. The memory efficiency and the performance effect are examined by analyzing some examples on the Pegasus cluster system.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.4
• /
• pp.482-490
• /
• 2017

The radar signal processing procedure is divided into the pre-processing such as frequency down converting, down sampling, pulse compression, and etc, and the post-processing such as doppler filtering, extracting target information, detecting, tracking, and etc. The former is generally designed using FPGA because the procedure is relatively simple even though there are large amounts of ADC data to organize very quickly. On the other hand, in general, the latter is parallel processed by multiple DSPs because of complexity, flexibility and real-time processing. This paper presents the radar signal processor design using FPGA which includes not only the pre-processing but also the post-processing such as doppler filtering, bore-sight error, NCI(Non-Coherent Integration), CFAR(Constant False Alarm Rate) and etc.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.73-76
• /
• 2000

We investigate the stepwise parallel processing of the serial search which can success the co]1 search at low Ec/Io. The single path Rayleigh fading channel which is worst-case channel model is considered. The typical 3-step cell search is used. The probabilities of detection, miss and false alarm for each step are used in closed forms based on the statistics of CDMA noncoherent demodulator output. The optimal power allocation to each channel and The optimal number of post-detection integrations for each step is obtained. Also, the cumulative probability distribution of the average eel] search time for serial search methods are compared.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2B
• /
• pp.125-136
• /
• 2002

It is very important to acquire the synchronization in a intercell asynchronous WCDMA system, and it is carried out through the three-step cell search process. The cell search can operate in a stepwise parallel manner, where each step works in pipelined operation, to reduce the cell search time. In case that the execution time is set to be the same in each step, excessive accumulations will be caused in both step 1 and step 3, because step 2 should take at least one frame for its processing. In general, the effect of post-detection integration becomes saturated as the number of the accumulations increases. Therefore, the stepwise parallel scheme does not give much enhancement. In this paper, the performance of the stepwise parallel processing for cell search in WCDMA system is analyzed over Rayleigh fading channels. Through the analysis, the effect of cell search parameters such as the number of accumulations in each step and the power ratio allocated among channels is investigated. In addition, the performance of the stepwise parallel cell search is improved by adjusting the execution time appropriately for each step and is compared with that of the conventional stepwise serial processing.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.196-204
• /
• 2012

Recently, many applications perform OLAP(On-Line Analytical Processing) over a very large volume of data. Multidimensional data cube is regarded as a core tool in OLAP analysis. This paper focuses on the method how to efficiently compute data cubes in parallel by using a popular parallel processing tool, MapReduce. We investigate efficient ways to implement PipeSort algorithm, a well-known data cube computation method, on the MapReduce framework. The PipeSort executes several (descendant) cuboids at the same time as a pipeline by scanning one (ancestor) cuboid once, which have the same sorting order. This paper proposed four ways implementing the pipeline of the PipeSort on the MapReduce framework which runs across 20 servers. Our experiments show that PipeMap-NoReduce algorithm outperforms the rest algorithms for high-dimensional data. On the contrary, Post-Pipe stands out above the others for low-dimensional data.

• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.18
• /
• pp.8351-8358
• /
• 2016

Electronic cleansing is an image post processing technique in which the tagged colonic content is subtracted from colon using CTC images. There are post processing artefacts, like: 1) soft tissue degradation; 2) incomplete cleansing; 3) misclassification of polyp due to pseudo enhanced voxels; and 4) pseudo soft tissue structures. The objective of the study was to subtract the tagged colonic content without losing the soft tissue structures. This paper proposes a novel adaptive method to solve the first three problems using a multi-step algorithm. It uses a new edge model-based method which involves colon segmentation, priori information of Hounsfield units (HU) of different colonic contents at specific tube voltages, subtracting the tagging materials, restoring the soft tissue structures based on selective HU, removing boundary between air-contrast, and applying a filter to clean minute particles due to improperly tagged endoluminal fluids which appear as noise. The main finding of the study was submerged soft tissue structures were absolutely preserved and the pseudo enhanced intensities were corrected without any artifact. The method was implemented with multithreading for parallel processing in a high performance computer. The technique was applied on a fecal tagged dataset (30 patients) where the tagging agent was not completely removed from colon. The results were then qualitatively validated by radiologists for any image processing artifacts.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.123-131
• /
• 2012

The requirements for computational resources to perform the structural analysis are increasing rapidly. The size of the current analysis problems that are required from practical industry is typically large-scale with more than millions degrees of freedom (DOFs). These large-scale analysis problems result in the requirements of high-performance analysis codes as well as hardware systems such as supercomputer systems or cluster systems. In this paper, the pre- and post-processing system for supercomputing based large-scale structural analysis is presented. The proposed system has 3-tier architecture and three main components; geometry viewer, pre-/post-processor and supercomputing manager. To analyze large-scale problems, the ADVENTURE solid solver was adopted as a general-purpose finite element solver and the supercomputer named 'tachyon' was adopted as a parallel computational platform. The problem solving performance and scalability of this structural analysis system is demonstrated by illustrative examples with different sizes of degrees of freedom.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.248-251
• /
• 2006

Multi-physics problem is considered for the Pitot tube located in uniform freon gas flow with high Mach number and the 3D numerical results of temperature on Pitot tube is given. The model is created by using structural module of ANSYS, the grids are obtained by ICEM, and the problem is solved and the data post-processing is done by CFX.