• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.028 seconds

k-NN Join Based on LSH in Big Data Environment

  • Ji, Jiaqi;Chung, Yeongjee
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.2
    • /
    • pp.99-105
    • /
    • 2018
  • k-Nearest neighbor join (k-NN Join) is a computationally intensive algorithm that is designed to find k-nearest neighbors from a dataset S for every object in another dataset R. Most related studies on k-NN Join are based on single-computer operations. As the data dimensions and data volume increase, running the k-NN Join algorithm on a single computer cannot generate results quickly. To solve this scalability problem, we introduce the locality-sensitive hashing (LSH) k-NN Join algorithm implemented in Spark, an approach for high-dimensional big data. LSH is used to map similar data onto the same bucket, which can reduce the data search scope. In order to achieve parallel implementation of the algorithm on multiple computers, the Spark framework is used to accelerate the computation of distances between objects in a cluster. Results show that our proposed approach is fast and accurate for high-dimensional and big data.

A Proposal and Implementation of Load Balancing Algorithm for Large Scale Software Streaming Server Platform (대용량 소프트웨어 스트리밍 서버를 위한 부하 분산 알고리즘 제안 및 구현)

  • Hur, Sung-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.5
    • /
    • pp.926-929
    • /
    • 2006
  • In this paper, I propose a load balancing algorithm based on the traffic characteristics of a software streaming service, and implement the proposed algorithm on the large scale software streaming server platform which provides a software streaming service to geographically dispersed internet users. By showing that the large scale software streaming server platform fuctions correctly, we know the proposed load balancing algorithm is operating properly and efficiently.

  • PDF

Competitive Learning Neural Network with Binary Reinforcement and Constant Adaptation Gain (일정적응 이득과 이진 강화함수를 갖는 경쟁 학습 신경회로망)

  • Seok, Jin-Wuk;Cho, Seong-Won;Choi, Gyung-Sam
    • Proceedings of the KIEE Conference
    • /
    • 1994.11a
    • /
    • pp.326-328
    • /
    • 1994
  • A modified Kohonen's simple Competitive Learning(SCL) algorithm which has binary reinforcement function and a constant adaptation gain is proposed. In contrast to the time-varing adaptation gain of the original Kohonen's SCL algorithm, the proposed algorithm uses a constant adaptation gain, and adds a binary reinforcement function in order to compensate for the lowered learning ability of SCL due to the constant adaptation gain. Since the proposed algorithm does not have the complicated multiplication, it's digital hardware implementation is much easier than one of the original SCL.

  • PDF

Implementation of Out-of-Step Detection Algorithm based on Multi-Agent System using EMTP-MODELS (EMTP-MODELS를 이용한 Multi-Agent System 기반의 동기탈조 검출 알고리즘 구현)

  • Lee, Byung-Hyun;Yeo, Sang-Min;Lee, You-Jin;Sung, No-Kyu;Kim, Chul-Hwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.537-542
    • /
    • 2008
  • The protection against transient instability and consequent out-of-step condition is a major concern for the utility industry. Unstable system may cause serious damage to system elements such as generators and transmission lines. Therefore, out-of-step detection is essential to operate a system safely. Also, a multi-agent system is one that consists of a number of agents, which interact with one another. Multi-agent systems(MAS) can offer the flexibility and the adaptability to the previous algorithm. In this paper, the detection algorithm of out-of-step is designed by multi-agent system and implemented by EMTP-MODELS. To verify performance of the proposed algorithm based on multi-agent system, simulations by EMTP have been carried out.

A Study on the Gait Optimization of a Biped Robot (이족보행로봇의 최적 걸음새에 관한 연구)

  • 공정식;노경곤;김진걸
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.7
    • /
    • pp.115-123
    • /
    • 2004
  • This paper deals with the gait optimization of via points on biped robot. ZMP(Zero Moment point) is the most important index in a biped robot's dynamic walking stability. To stable walking of a biped robot, leg's trajectory and a desired ZMP trajectory is required, balancing motion is solved by FDM(Finite Difference Method). In this paper, optimal index is defined to dynamically stable walking of a biped robot, and genetic algorithm is applied to optimize gait trajectory and balancing motion of a biped robot. By genetic algorithm, the index of walking parameter is efficiently optimized, and dynamic walking stability is verified by ZMP verification equation. Genetic algorithm is only applied to balancing motion, and is totally applied to whole trajectory. All of the suggested motions of biped robot are investigated by simulations and verified through the real implementation.

A Study on Implementation of Intelligent Character for MMORPG using Genetic Algorithm and Neural Networks (유전자 알고리즘과 신경망을 이용한 MMORPG의 지능캐릭터 구현에 관한 연구)

  • Kwon, Jang-Woo;Jang, Jang-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.5
    • /
    • pp.631-641
    • /
    • 2007
  • The domestic game market is developmental in the form which is strange produces only the MMORPG. But the level of the intelligence elder brother character is coming to a standstill as ever. It uses a gene algorithm and the neural network from the dissertation which it sees and embodies the character which has a more superior intelligence the plan which to sleep and it presents it does. When also currently it is used complaring different artificial intelligence technologies and this algorism from the MMORPG, the efficiency proves is not turned over and explains the concrete algorithm it will be able to apply in the MMORPG and an embodiment method.

  • PDF

A Study on the Depth Map using Single Edge (단일 엣지를 이용한 깊이 정보에 관한 연구)

  • Kim, Young-Seop;Song, Eung-Yeol
    • Journal of the Semiconductor & Display Technology
    • /
    • v.9 no.2
    • /
    • pp.123-126
    • /
    • 2010
  • An implementation of modified stereo matching using efficient belief propagation (BP) algorithm is presented in this paper. We do recommend the use of the simple sobel, prewitt edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). When we adopt the only MRF + BP algorithm, however, borders cannot be distinguished due to that the message functions in the BP algorithm is just the mechanism which passes energy data to the only large gap of each Message functions In order to address the abovementioned disadvantageous phenomenon, we use the sobel edge operator + MRF + BP algorithm to distinguish the border that is located between the similar message data. Using edge information, the result shows that our proposed process diminishes the propagation of wrong probabilistic information. The enhanced result is due to that our proposed method effectively reduced errors incurred by ambiguous scene properties.

Proposal of Image Detection Algorithm to Implement Hand Gestures

  • Woo, Eun-Ju;Moon, Yu-Sung;Choi, Ung-Se;Kim, Jung-Won
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.1222-1225
    • /
    • 2018
  • This paper proposes an image detection algorithm to implement gesture. By using a camera sensor, the performance of the extracted image algorithm based on the gesture pattern was verified through experiments. In addition, through the experiments, we confirmed the proposed method's possibility of the implementation. For efficient image detection, we applied a segmentation technique based on image transition which divides into small units. To improve gesture recognition, the proposed method not only has high recognition rate and low false acceptance rate in real gesture environment, but also designed an algorithm that efficiently finds optimal thresholds that can be applied.

An Automatic Construction for Class Diagram from Problem Statement using Natural Language Processing

  • Utama, Ahmad Zulfiana;Jang, Duk-Sung
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.3
    • /
    • pp.386-394
    • /
    • 2019
  • This research will describe algorithm for class diagram extraction from problem statements. Class diagram notation consist of class name, attributes, and operations. Class diagram can be extracted from the problem statement automatically by using Natural Language Processing (NLP). The extraction results heavily depends on the algorithm and preprocessing stage. The algorithm obtained from various sources with additional rules that are obtained in the implementation phase. The evaluation features using five problem statement with different domains. The application will capture the problem statement and draw the class diagram automatically by using Windows Presentation Foundation(WPF). The classification accuracy of 100% was achieved. The final algorithm achieved 92 % of average precision score.

PSF Deconvolution on the Integral Field Unit Spectroscopy Data

  • Chung, Haeun;Park, Changbom
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.58.4-58.4
    • /
    • 2019
  • We present the application of the Point Spread Function (PSF) deconvolution method to the astronomical Integral Field Unit (IFU) Spectroscopy data focus on the restoration of the galaxy kinematics. We apply the Lucy-Richardson deconvolution algorithm to the 2D image at each wavelength slice. We make a set of mock IFU data which resemble the IFU observation to the model galaxies with a diverse combination of surface brightness profile, S/N, line-of-sight geometry and Line-Of-Sight Velocity Distribution (LOSVD). Using the mock IFU data, we demonstrate that the algorithm can effectively recover the stellar kinematics of the galaxy. We also show that lambda_R_e, the proxy of the spin parameter can be correctly measured from the deconvolved IFU data. Implementation of the algorithm to the actual SDSS-IV MaNGA IFU survey data exhibits the noticeable difference on the 2D LOSVD, geometry, lambda_R_e. The algorithm can be applied to any other regular-grid IFS data to extract the PSF-deconvolved spatial information.

  • PDF