• Title/Summary/Keyword: and Parallel Processing

Search Result 2,013, Processing Time 0.028 seconds

Performance Analysis on Declustering High-Dimensional Data by GRID Partitioning (그리드 분할에 의한 다차원 데이터 디클러스터링 성능 분석)

  • Kim, Hak-Cheol;Kim, Tae-Wan;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.11D no.5
    • /
    • pp.1011-1020
    • /
    • 2004
  • A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

A Design of the OOPP(Optimized Online Portfolio Platform) using Enterprise Competency Information (기업 직무 정보를 활용한 OOPP(Optimized Online Portfolio Platform)설계)

  • Jung, Bogeun;Park, Jinuk;Lee, ByungKwan
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.5
    • /
    • pp.493-506
    • /
    • 2018
  • This paper proposes the OOPP(Optimized Online Portfolio Platform) design for the job seekers to search for the job competency necessary for employment and to write and manage portfolio online efficiently. The OOPP consists of three modules. First, JDCM(Job Data Collection Module) stores the help-wanted advertisements of job information sites in a spreadsheet. Second, CSM(Competency Statistical Model) classifies core competencies for each job by text-mining the collected help-wanted ads. Third, OBBM(Optimize Browser Behavior Module) makes users to look up data rapidly by improving the processing speed of a browser. In addition, The OBBM consists of the PSES(Parallel Search Engine Sub-Module) optimizing the computation of a Search Engine and the OILS(Optimized Image Loading Sub-Module) optimizing the loading of image text, etc. The performance analysis of the CSM shows that there is little difference in accuracy between the CSM and the actual advertisement because its data accuracy is 99.4~100%. If Browser optimization is done by using the OBBM, working time is reduced by about 68.37%. Therefore, the OOPP makes users look up the analyzed result in the web page rapidly by analyzing the help-wanted ads. of job information sites accurately.

High Resolution Rainfall Prediction Using Distributed Computing Technology (분산 컴퓨팅 기술을 이용한 고해상도 강수량 예측)

  • Yoon, JunWeon;Song, Ui-Sung
    • Journal of Digital Contents Society
    • /
    • v.17 no.1
    • /
    • pp.51-57
    • /
    • 2016
  • Distributed Computing attempts to harness a massive computing power using a great numbers of idle PCs resource distributed linked to the internet and processes a variety of applications parallel way such as bio, climate, cryptology, and astronomy. In this paper, we develop internet-distributed computing environment, so that we can analyze High Resolution Rainfall Prediction application in meteorological field. For analyze the rainfall forecast in Korea peninsula, we used QPM(Quantitative Precipitation Model) that is a mesoscale forecasting model. It needs to a lot of time to construct model which consisted of 27KM grid spacing, also the efficiency is degraded. On the other hand, based on this model it is easy to understand the distribution of rainfall calculated in accordance with the detailed topography of the area represented by a small terrain model reflecting the effects 3km radius of detail and terrain can improve the computational efficiency. The model is broken down into detailed area greater the required parallelism and increases the number of compute nodes that efficiency is increased linearly.. This model is distributed divided in two sub-grid distributed units of work to be done in the domain of $20{\times}20$ is networked computing resources.

Channel Searching Method of IEEE 802.15.4 Nodes for Avoiding WiFi Traffic Interference (WiFi 트래픽 간섭을 피하기 위한 IEEE 802.15.4 노드의 채널탐색방법)

  • Song, Myong Lyol
    • Journal of Internet Computing and Services
    • /
    • v.15 no.2
    • /
    • pp.19-31
    • /
    • 2014
  • In this paper, a parallel backoff delay procedure on multiple IEEE 802.15.4 channels and a channel searching method considering the frequency spectrum of WiFi traffic are studied for IEEE 802.15.4 nodes to avoid the interference from WiFi traffic. In order to search the channels being occupied by WiFi traffic, we analyzed the methods measuring the powers of adjacent channels simultaneously, checking the duration of measured power levels greater than a threshold, and finding the same periodicity of sampled RSSI data as the beacon frame by signal processing. In an wireless channel overlapped with IEEE 802.11 network, the operation of CSMA-CA algorithm for IEEE 802.15.4 nodes is explained. A method to execute a parallel backoff procedure on multiples IEEE 802.15.4 channels by an IEEE 802.15.4 device is proposed with the description of its algorithm. When we analyze the data measured by the experimental system implemented with the proposed method, it is observed that medium access delay times increase at the same time in the associated IEEE 802.15.4 channels that are adjacent each other during the generation of WiFi traffic. A channel evaluation function to decide the interference from other traffic on an IEEE 802.15.4 channel is defined. A channel searching method considering the channel evaluations on the adjacent channels together is proposed in order to search the IEEE 802.15.4 channels interfered by WiFi, and the experimental results show that it correctly finds the channels interfered by WiFi traffic.

R Based Parallelization of a Climate Suitability Model to Predict Suitable Area of Maize in Korea (국내 옥수수 재배적지 예측을 위한 R 기반의 기후적합도 모델 병렬화)

  • Hyun, Shinwoo;Kim, Kwang Soo
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.19 no.3
    • /
    • pp.164-173
    • /
    • 2017
  • Alternative cropping systems would be one of climate change adaptation options. Suitable areas for a crop could be identified using a climate suitability model. The EcoCrop model has been used to assess climate suitability of crops using monthly climate surfaces, e.g., the digital climate map at high spatial resolution. Still, a high-performance computing approach would be needed for assessment of climate suitability to take into account a complex terrain in Korea, which requires considerably large climate data sets. The objectives of this study were to implement a script for R, which is an open source statistics analysis platform, in order to use the EcoCrop model under a parallel computing environment and to assess climate suitability of maize using digital climate maps at high spatial resolution, e.g., 1 km. The total running time reduced as the number of CPU (Central Processing Unit) core increased although the speedup with increasing number of CPU cores was not linear. For example, the wall clock time for assessing climate suitability index at 1 km spatial resolution reduced by 90% with 16 CPU cores. However, it took about 1.5 time to compute climate suitability index compared with a theoretical time for the given number of CPU. Implementation of climate suitability assessment system based on the MPI (Message Passing Interface) would allow support for the digital climate map at ultra-high spatial resolution, e.g., 30m, which would help site-specific design of cropping system for climate change adaptation.

Enhanced Image Mapping Method for Computer-Generated Integral Imaging System (집적 영상 시스템을 위한 향상된 이미지 매핑 방법)

  • Lee Bin-Na-Ra;Cho Yong-Joo;Park Kyoung-Shin;Min Sung-Wook
    • The KIPS Transactions:PartB
    • /
    • v.13B no.3 s.106
    • /
    • pp.295-300
    • /
    • 2006
  • The integral imaging system is an auto-stereoscopic display that allows users to see 3D images without wearing special glasses. In the integral imaging system, the 3D object information is taken from several view points and stored as elemental images. Then, users can see a 3D reconstructed image by the elemental images displayed through a lens array. The elemental images can be created by computer graphics, which is referred to the computer-generated integral imaging. The process of creating the elemental images is called image mapping. There are some image mapping methods proposed in the past, such as PRR(Point Retracing Rendering), MVR(Multi-Viewpoint Rendering) and PGR(Parallel Group Rendering). However, they have problems with heavy rendering computations or performance barrier as the number of elemental lenses in the lens array increases. Thus, it is difficult to use them in real-time graphics applications, such as virtual reality or real-time, interactive games. In this paper, we propose a new image mapping method named VVR(Viewpoint Vector Rendering) that improves real-time rendering performance. This paper describes the concept of VVR first and the performance comparison of image mapping process with previous methods. Then, it discusses possible directions for the future improvements.

Sentiment Analysis of Movie Review Using Integrated CNN-LSTM Mode (CNN-LSTM 조합모델을 이용한 영화리뷰 감성분석)

  • Park, Ho-yeon;Kim, Kyoung-jae
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.141-154
    • /
    • 2019
  • Rapid growth of internet technology and social media is progressing. Data mining technology has evolved to enable unstructured document representations in a variety of applications. Sentiment analysis is an important technology that can distinguish poor or high-quality content through text data of products, and it has proliferated during text mining. Sentiment analysis mainly analyzes people's opinions in text data by assigning predefined data categories as positive and negative. This has been studied in various directions in terms of accuracy from simple rule-based to dictionary-based approaches using predefined labels. In fact, sentiment analysis is one of the most active researches in natural language processing and is widely studied in text mining. When real online reviews aren't available for others, it's not only easy to openly collect information, but it also affects your business. In marketing, real-world information from customers is gathered on websites, not surveys. Depending on whether the website's posts are positive or negative, the customer response is reflected in the sales and tries to identify the information. However, many reviews on a website are not always good, and difficult to identify. The earlier studies in this research area used the reviews data of the Amazon.com shopping mal, but the research data used in the recent studies uses the data for stock market trends, blogs, news articles, weather forecasts, IMDB, and facebook etc. However, the lack of accuracy is recognized because sentiment calculations are changed according to the subject, paragraph, sentiment lexicon direction, and sentence strength. This study aims to classify the polarity analysis of sentiment analysis into positive and negative categories and increase the prediction accuracy of the polarity analysis using the pretrained IMDB review data set. First, the text classification algorithm related to sentiment analysis adopts the popular machine learning algorithms such as NB (naive bayes), SVM (support vector machines), XGboost, RF (random forests), and Gradient Boost as comparative models. Second, deep learning has demonstrated discriminative features that can extract complex features of data. Representative algorithms are CNN (convolution neural networks), RNN (recurrent neural networks), LSTM (long-short term memory). CNN can be used similarly to BoW when processing a sentence in vector format, but does not consider sequential data attributes. RNN can handle well in order because it takes into account the time information of the data, but there is a long-term dependency on memory. To solve the problem of long-term dependence, LSTM is used. For the comparison, CNN and LSTM were chosen as simple deep learning models. In addition to classical machine learning algorithms, CNN, LSTM, and the integrated models were analyzed. Although there are many parameters for the algorithms, we examined the relationship between numerical value and precision to find the optimal combination. And, we tried to figure out how the models work well for sentiment analysis and how these models work. This study proposes integrated CNN and LSTM algorithms to extract the positive and negative features of text analysis. The reasons for mixing these two algorithms are as follows. CNN can extract features for the classification automatically by applying convolution layer and massively parallel processing. LSTM is not capable of highly parallel processing. Like faucets, the LSTM has input, output, and forget gates that can be moved and controlled at a desired time. These gates have the advantage of placing memory blocks on hidden nodes. The memory block of the LSTM may not store all the data, but it can solve the CNN's long-term dependency problem. Furthermore, when LSTM is used in CNN's pooling layer, it has an end-to-end structure, so that spatial and temporal features can be designed simultaneously. In combination with CNN-LSTM, 90.33% accuracy was measured. This is slower than CNN, but faster than LSTM. The presented model was more accurate than other models. In addition, each word embedding layer can be improved when training the kernel step by step. CNN-LSTM can improve the weakness of each model, and there is an advantage of improving the learning by layer using the end-to-end structure of LSTM. Based on these reasons, this study tries to enhance the classification accuracy of movie reviews using the integrated CNN-LSTM model.

Subitizing in Children and Adults, Depending on the Object Individuation Level of Stimulus: Focusing on Performance According to Spacing, Color, and Shape of Objects (자극의 대상개별화 수준에 따른 유아와 성인의 즉지하기: 대상의 간격, 색, 모양 구성에 따른 수행을 중심으로)

  • Kim, Bokyung;Pack, Yun Hyun;Yi, Soon Hyung
    • Human Ecology Research
    • /
    • v.55 no.5
    • /
    • pp.491-505
    • /
    • 2017
  • This study investigated the development and core mechanism of subitizing in children and adults as well as provides related theoretical and practical discussions. This study was conducted to determine if subitizing changed with the age of participants and if there were differences in subitizing according to the spacing, color, and shape of the stimuli. The subitizing task set (including forty main trials) was prepared. Forty-five children (fifteen each in groups of 3, 4, and 5-year-olds) and fifteen adults were recruited to perform the subitizing tasks. The results demonstrated that the subitizing speed and accuracy of children improved abruptly between age 3 and age 4. Furthermore, there were significant differences in children's subitizing speed according to the spacing and color of the objects. The children's response time decreased when the objects were fully apart or were of diverse colors. In addition, there were partial significant differences in the subitizing speed of children related to the shape of the objects. The subitizing speed of children decreased in a condition (subitizing 5 objects of diverse colors in fixed spacing) when the shapes of the objects were diverse. The subitizing speed of adults only differed according to the space of the objects. The results demonstrate the development of subitizing in early childhood along with the presence of object individuation processing stages underlying subitizing. This study also provides practical information and suggestions for educational curricula that can strengthen the competency of children in systematic and diverse activities.

Development of a general framework of resonance self-shielding treatment for broad-spectrum reactor lattice physics calculation

  • Jinchao Zhang;Qian Zhang;Hang Zou;Jialei Yu;Wei Cao;Shifu Wu;Shuai Qin;Qiang Zhao;Erez Gilad
    • Nuclear Engineering and Technology
    • /
    • v.56 no.10
    • /
    • pp.4335-4354
    • /
    • 2024
  • Some core designs integrate high-enriched fuel and moderator materials to enhance neutron utilization. This combination results in a broad spectrum within the system, posing challenges in resonance calculation. This paper introduces a general framework to realize resonance self-shielding treatment in broad-spectrum fuel lattice problems. The framework consists of three components. First, a new energy group structure is devised to support resonance calculation in the entire energy range and capture spectral transition and thermalization effects during eigenvalue calculation. Second, the subgroup method based on narrow approximation is selected as a universal method to perform resonance calculation. Finally, transport equations for each fissionable region are solved for neutron flux to collapse the fission spectrum. The proposed method is verified against fast, intermediate, and thermal spectrum pin cell problems and an assembly problem featuring a fast-thermal coupled spectrum. Numerical results affirm the accuracy of the proposed method in handling these scenarios, with eigenvalue errors below 154 pcm for pin cell problems and 106 pcm for the assembly problem. The verification results revealed that the proposed method enables accurate resonance self-shielding treatment for broad-spectrum problems.

Analysis of Two Dimensional and Three Dimensional Supersonic Turbulence Flow around Tandem Cavities

  • Woo Chel-Hun;Kim Jae-Soo;Lee Kyung-Hwan
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.8
    • /
    • pp.1256-1265
    • /
    • 2006
  • The supersonic flows around tandem cavities were investigated by two-dimensional and three-dimensional numerical simulations using the Reynolds-Averaged Navier-Stokes (RANS) equation with the k- ω turbulence model. The flow around a cavity is characterized as unsteady flow because of the formation and dissipation of vortices due to the interaction between the freestream shear layer and cavity internal flow, the generation of shock and expansion waves, and the acoustic effect transmitted from wake flow to upstream. The upwind TVD scheme based on the flux vector split with van Leer's limiter was used as the numerical method. Numerical calculations were performed by the parallel processing with time discretizations carried out by the 4th-order Runge- Kutta method. The aspect ratios of cavities are 3 for the first cavity and 1 for the second cavity. The ratio of cavity interval to depth is 1. The ratio of cavity width to depth is 1 in the case of three dimensional flow. The Mach number and the Reynolds number were 1.5 and $4.5{\times}10^5$, respectively. The characteristics of the dominant frequency between two- dimensional and three-dimensional flows were compared, and the characteristics of the second cavity flow due to the first cavity flow was analyzed. Both two dimensional and three dimensional flow oscillations were in the 'shear layer mode', which is based on the feedback mechanism of Rossiter's formula. However, three dimensional flow was much less turbulent than two dimensional flow, depending on whether it could inflow and outflow laterally. The dominant frequencies of the two dimensional flow and three dimensional flows coincided with Rossiter's 2nd mode frequency. The another dominant frequency of the three dimensional flow corresponded to Rossiter's 1st mode frequency.