• Title/Summary/Keyword: Offline Algorithm

Search Result 94, Processing Time 0.026 seconds

Multi-level Scheduling Algorithm Based on Storm

  • Wang, Jie;Hang, Siguang;Liu, Jiwei;Chen, Weihao;Hou, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1091-1110
    • /
    • 2016
  • Hybrid deployment under current cloud data centers is a combination of online and offline services, which improves the utilization of the cluster resources. However, the performance of the cluster is often affected by the online services in the hybrid deployment environment. To improve the response time of online service (e.g. search engine), an effective scheduling algorithm based on Storm is proposed. At the component level, the algorithm dispatches the component with more influence to the optimal performance node. Inside the component, a reasonable resource allocation strategy is used. By searching the compressed index first and then filtering the complete index, the execution speed of the component is improved with similar accuracy. Experiments show that our algorithm can guarantee search accuracy of 95.94%, while increasing the response speed by 68.03%.

Immune Algorithm Based Active PID Control for Structure Systems

  • Lee, Young-Jin;Cho, Hyun-Cheol;Lee, Kwon-Soon
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.11
    • /
    • pp.1823-1833
    • /
    • 2006
  • An immune algorithm is a kind of evolutional computation strategies, which is developed in the basis of a real immune mechanism in the human body. Recently, scientific or engineering applications using this scheme are remarkably increased due to its significant ability in terms of adaptation and robustness for external disturbances. Particularly, this algorithm is efficient to search optimal parameters against complicated dynamic systems with uncertainty and perturbation. In this paper, we investigate an immune algorithm embedded Proportional Integral Derivate (called I-PID) control, in which an optimal parameter vector of the controller is determined offline by using a cell-mediated immune response of the immunized mechanism. For evaluation, we apply the proposed control to mitigation of vibrations for nonlinear structural systems, cased by external environment load such as winds and earthquakes. Comparing to traditional controls under same simulation scenarios, we demonstrate the innovation control is superior especially in robustness aspect.

Generation Method of Robot Movement Using Evolutionary Algorithm (진화 알고리즘을 사용한 휴머노이드 로봇의 동작 학습 알고리즘)

  • Park, Ga-Lam;Ra, Syung-Kwon;Kim, Chan-Hwan;Song, Jae-Bok
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.315-316
    • /
    • 2007
  • This paper presents a new methodology to improve movement database for a humanoid robot. The database is initially full of human motions so that the kinetics characteristics of human movement are immanent in it. then, the database is updated to the pseudo-optimal motions for the humanoid robot to perform more natural motions, which contain the kinetics characteristics of robot. for this, we use the evolutionary algorithm. the methodology consists of two processes : (1) the offline imitation learning of human movement and (2) the online generation of natural motion. The offline process improve the initial human motion database using the evolutionary algorithm and inverse dynamics-based optimization. The optimization procedure generate new motions using the movement primitive database, minimizing the joint torque. This learning process produces a new database that can endow the humanoid robot with natural motions, which requires minimal torques. In online process, using the linear combination of the motion primitive in this updated database, the humanoid robot can generate the natural motions in real time. The proposed framework gives a systematic methodology for a humanoid robot to learn natural motions from human motions considering dynamics of the robot. The experiment of catching a ball thrown by a man is performed to show the feasibility of the proposed framework.

  • PDF

End-to-end Delay Analysis and On-line Global Clock Synchronization Algorithm for CAN-based Distributed Control Systems (CAN 기반 분산 제어시스템의 종단 간 지연 시간 분석과 온라인 글로벌 클럭 동기화 알고리즘 개발)

  • Lee, Hee-Bae;Kim, Hong-Ryeol;Kim, Dae-Won
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.677-680
    • /
    • 2003
  • In this paper, the analysis of practical end-to-end delay in worst case is performed for distributed control system considering the implementation of the system. The control system delay is composed of the delay caused by multi-task scheduling of operating system, the delay caused by network communication, and the delay caused by the asynchronous between them. Through simulation tests based on CAN(Controller Area Network), the proposed end-to-end delay in worst case is validated. Additionally, online clock synchronization algorithm is proposed here for the control system. Through another simulation test, the online algorithm is proved to have better performance than offline one in the view of network bandwidth utilization.

  • PDF

Two-Dimensional Model of Hidden Markov Mesh

  • Sin, Bong-Kee
    • 한국HCI학회:학술대회논문집
    • /
    • 2006.02a
    • /
    • pp.772-779
    • /
    • 2006
  • The new model proposed in this paper is the hidden Markov mesh model or the 2D HMM with the causality of top-down and left-right direction. With the addition of the causality constraint, two algorithms for the evaluation of a model and the maximum likelihood estimation of model parameters have been developed theoretically which are based on the forward-backward algorithm. It is a more natural extension of the 1D HMM than other 2D models. The proposed method will provide a useful way of modeling highly variable image patterns such as offline cursive characters.

  • PDF

An Embedded Information Extraction of Color QR Code for Offline Applications (오프라인 응용을 위한 컬러 QR코드의 삽입 정보 추출 방법)

  • Kim, Jin-soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.9
    • /
    • pp.1123-1131
    • /
    • 2020
  • The quick-response (QR) code is a two-dimensional barcode which is widely being used. Due to several interesting features such as small code size, high error correction capabilities, easy code generation and reading process, the QR codes are used in many applications. Nowadays, a printed color QR code for offline applications is being studied to improve the information storage capacity. By multiplexing color information into the conventional black-white QR code, the storage capacity is increased, however, it is hard to extract the embedded information due to the color crosstalk and geometrical distortion. In this paper, to overcome these problems, a new type of QR code is designed based on the CMYK color model and the local spatial searching as well as the global spatial matching is introduced in the reading process. These results in the recognition rate increase. Through practical experiments, it is shown that the proposed algorithm can perform the bit recognition rate improvement of about 3% to 5%.

Peer to Peer Search Algorithm based on Advanced Multidirectional Processing (개선된 다방향 프로세싱 기반 P2P 검색 알고리즘)

  • Kim, Boon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.10
    • /
    • pp.133-139
    • /
    • 2009
  • A P2P technology in distributed computing fields is presented various methods to share resources between network connected peers. This is very efficient that a degree of resources to good use as compared with peers by using centralized network by a few servers. However peers to compose P2P system is not always online status, therefore it is difficult to support high reliability to user. In our previous work of this paper, it is contributing to reduce the loading rates to select of new resource support peer but a selection method the peers to share works to download resources is very simple that it is just selected about peer to have lowest job. In this paper, we reduced frequency offline peers by estimate based on a average value of success rates for peers.

Online Dead Time Effect Compensation Algorithm of PWM Inverter for Motor Drive Using PR Controller

  • Park, Chang-Seok;Jung, Tae-Uk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.3
    • /
    • pp.1137-1145
    • /
    • 2017
  • This paper proposes the dead time effect compensation algorithm using proportional resonant controller in pulse width modulation inverter of motor drive. To avoid a short circuit in the dc link, the dead time of the switch device is surely required. However, the dead time effect causes the phase current distortions, torque pulsations, and degradations of control performance. To solve these problems, the output current including ripple components on the synchronous reference frame and stationary reference frame are analyzed in detail. As a results, the distorted synchronous d-and q-axis currents contain the 6th, 12th, and the higher harmonic components due to the influence of dead time effect. In this paper, a new dead time effect compensation algorithm using proportional resonant controller is also proposed to reduce the output current harmonics due to the dead time and nonlinear characteristics of the switching devices. The proposed compensation algorithm does not require any additional hardware and the offline experimental measurements. The experimental results are presented to demonstrate the effectiveness of the proposed dead time effect compensation algorithm.

Traffic Classification Using Machine Learning Algorithms in Practical Network Monitoring Environments (실제 네트워크 모니터링 환경에서의 ML 알고리즘을 이용한 트래픽 분류)

  • Jung, Kwang-Bon;Choi, Mi-Jung;Kim, Myung-Sup;Won, Young-J.;Hong, James W.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.707-718
    • /
    • 2008
  • The methodology of classifying traffics is changing from payload based or port based to machine learning based in order to overcome the dynamic changes of application's characteristics. However, current state of traffic classification using machine learning (ML) algorithms is ongoing under the offline environment. Specifically, most of the current works provide results of traffic classification using cross validation as a test method. Also, they show classification results based on traffic flows. However, these traffic classification results are not useful for practical environments of the network traffic monitoring. This paper compares the classification results using cross validation with those of using split validation as the test method. Also, this paper compares the classification results based on flow to those based on bytes. We classify network traffics by using various feature sets and machine learning algorithms such as J48, REPTree, RBFNetwork, Multilayer perceptron, BayesNet, and NaiveBayes. In this paper, we find the best feature sets and the best ML algorithm for classifying traffics using the split validation.

Low-Complexity Lattice Reduction Aided MIMO Detectors Using Look-Up Table (Look-Up Table 기반의 복잡도가 낮은 Lattice Reduction MIMO 검출기)

  • Lee, Chung-Won;Lee, Ho-Kyoung;Heo, Seo-Weon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.88-94
    • /
    • 2009
  • We propose a scheme which reduce the computational complexity of the lattice reduction (LR) aided detector in MIMO system. The performance of the ML detection algorithm is good but the computational complexity grows exponentially with the number of antenna elements and constellation points. LR aided detector shows the same diversity with the ML scheme with relatively less complexity. But the LR scheme still requires many computations since it involves several iterations of size reduction and column vector exchange. We notice that the LR process depends not on the received signal but only on the channel matrix so we can apply LR process offline and store the results in Look-Up Table (LUT). In this paper we propose an algorithm to generate the LUT which require less memory requirement and we evaluate the performance and complexity of the proposed system. We show that the proposed system requires less computational complexity with similar detection performance compared with the conventional LR aided detector.