• Title/Summary/Keyword: CPU time

Search Result 946, Processing Time 0.031 seconds

Design and Implementation of Hand-Held Inspection Device for High Performance Mobile TFT LCD/OLED Module (고성능 모바일 TFT LCD/OLED 모듈을 위한 헨드헬드 검사장비 설계 및 구현)

  • Moon, Seung-Jin;Kim, Hong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6B
    • /
    • pp.630-640
    • /
    • 2009
  • The thesis suggests hand-held equipment to overhaul for mobile TFT LCD/OLED module of high-performance. The established module equipment to overhaul could distinguish outputting video data to module for distinguishing flicker, but it is impossible with low system. In this thesis, supporting system could check the various supplement functions from bringing equipment to overhaul without changing design of FPGA or H/W the module various size for equipment to overhaul for module of high-performance coincidently. The system includes hand-held equipment to overhaul, test software embedded and software a base personal computer and have designed to output, save, and certify all contents of module test of hand-held equipment to overhaul to interface universal serial bus. Setting up 9 items that represent for efficient verification of the proposed system have been possible confirmation with TFT LCD/OLED module of high-performance, establishment scan time, creation gamma, changing register, supporting interface, and multi inch modules.

A Parallel Bulk Loading Method for $B^+$-Tree Using CUDA (CUDA를 활용한 병렬 $B^+$-트리 벌크로드 기법)

  • Sung, Joo-Ho;Lee, Yoon-Woo;Han, A;Choi, Won-Ik;Kwon, Dong-Seop
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.707-711
    • /
    • 2010
  • Most relational database systems provide $B^+$-trees as their main index structures, and use bulk-loading techniques for creating new $B^+$-trees on existing data from scratch. Although bulk loadings are more effective than inserting keys one by one, they are still time-consuming because they have to sort all the keys from large data. To improve the performance of bulk loadings, this paper proposes an efficient parallel bulk loading method for $B^+$-trees based on CUDA, which is a parallel computing architecture developed by NVIDIA to utilize computing powers of graphic processor units for general purpose computing. Experimental results show that the proposed method enhance the performance more than 70 percents compared to existing bulk loading methods.

Development of the Dual Mode Syringe Type Infusion Pump (이중모드 주사기형 약물자동주입장치의 개발에 관한 연구)

  • Hong, S.Y.;Um, K.H.;Kim, I.K.;Lee, K.J.;Yoon, H.R.;Kim, U.K.;Um, D.J.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1998 no.11
    • /
    • pp.317-318
    • /
    • 1998
  • The purpose of this study is to design and develop the circuit of the dual mode syringe pump. Syringe pump is used in intensive care unit, delivery room, pediatric room, operating theater and other fields of hospital at present. Normally the syringe pump delivers one medicine in one case, but in case of intensive care unit, it is necessary to deliver more than two kinds of medicines at a time. Therefore we have designed dual mode syringe pump. We used RISC type microcontroller, PIC17C44 as master controller, and PIC16C73 as slave cpu using for the low power consumption. The performance of system is evaluated by analysis of the linearity and accuracy which is the most important factors in application. While the proposed system shows a acceptable linearity and accuracy, a further research about reducing the errorr should be done.

  • PDF

An Implicit Integration Method for Joint Coordinate Subsystem Synthesis Method (조인트 좌표계를 이용한 부분시스템 합성방법의 내재적 적분기법)

  • Jo, Jun-Youn;Kim, Myoung-Ho;Kim, Sung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.4
    • /
    • pp.437-442
    • /
    • 2012
  • To analyze a multibody system, this paper proposes an implicit numerical integration method for joint coordinates subsystem synthesis method. To verify the proposed method, a multibody model for an unmanned robot vehicle, which consists of six identical independent suspension systems, is developed. The symbolic method is applied to compute the system Jacobian matrix for the implicit integration method. The proposed method is also verified by performing rough terrain run-over simulation in comparison with the conventional implicit integration method. In addition, to evaluate the efficiency of the proposed method, the CPU time obtained by using this method is compared with that obtained by using the conventional implicit method.

Efficient Time-Series Subsequence Matching using Duality in Constructing Windows (윈도우를 구성하는 방법의 이원성을 이용한 효율적인 시계열 서부시퀀스 매칭)

  • Mun, Yang-Se;No, Ung-Gi;Hwang, Gyu-Yeong
    • Journal of KIISE:Databases
    • /
    • v.28 no.1
    • /
    • pp.15-30
    • /
    • 2001
  • 서브시퀀스 매칭은 질의 시퀀스와 유사한 서브시퀀스를 가지는 데이터 시퀀스와 해당 서브시퀀스의 위치를 찾는 문제이다. 본 논문에서는 윈도우를 구성하는 방법의 이원성을 이용한 새로운 서부시퀀스 매칭 방법인 Dual-Match는 윈도우를 구성하는 방법에 있어서 Faloutsos 등이 사용한 방법(간단히 FRM 이라한다)의 이원적 접근법이다. 즉, FRM에서는 데이터 시퀀스를 슬라이딩 윈도우로 나누고 질의 시퀀스를 디스조인트 윈도우로 나누는 방법을 사용한 반면, Dual-Match에서는 데이터 시퀀스를 디스조이트 윈도우로 나누고 질의 시퀀스를 슬라이딩 윈도우로 나누는 방법을 사용한다. FRM은 색인에 필요한 저장공간을 줄이기 위하여 개별 점 대신 최소 포함 사각형만을 저장함으로 인하여 많은 착오해답(유사하지 않은 후보 서브시퀀스)을 발생시켰다. Dual-Match는 FRM과 비슷한 크기의 저장공간에 개별 점을 직접 저장함으로써 이 문제를 해결한다. 실험결과, Dual-Match는 많은 경우에 있어서 FRM에 비하여 후보 개수를 크게 줄이고 성능을 향상시켰다. 특히, 선택률이 낮은 경우($10^{-4}$이하)에는 후보 개수를 최대 8800배 까지 줄이고, 페이지 액세스 횟수를 최대 26.9배까지 줄였으며, 성능을 최대 430배까지 향상시켰다. 또한, 동일한 크기의 색인을 생성하는데 있어서 Dual-Match는 FRM보다 4.10~25.6배 빠르게 색인을 구성하였다. 이는 색인 구성시에 CPU 오버헤드의 많은 부분을 차지하는 저차원 변환의 횟수를 FRM에 비해 크게 줄이기 때문이다. 이 같은 결과로 볼 때, Dual-Match는 대용량 데이터베이스에 대한 서부시퀀스 매칭의 성능을 크게 향상시킬 수 있는 획기적인 연구 결과라 믿는다.

  • PDF

Implementation of u-Healthcare Security System by applying High Speed PS-LFSR (고속 병렬형 PS-LFSR을 적용한 u-헬스케어 보안 시스템 구현)

  • Kim, Nack-Hyun;Lee, Young-Dong;Kim, Tae-Yong;Jang, Won-Tae;Lee, Hoon-Jae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.99-106
    • /
    • 2011
  • The emerging of ubiquitous computing and healthcare technologies provides us a strong platform to build sustainable healthcare applications especially those that require real-time information related to personal healthcare regardless of place. We realize that system stability, reliability and data protection are also important requirements for u-healthcare services. Therefore, in this paper, we designed a u-healthcare system which can be attached to the patient's body to measure vital signals, enhanced with USN secure sensor module. Our proposed u-healthcare system is using wireless sensor modules embedded with NLM-128 algorithm. In addition, PS-LFSR technique is applied to the NLM-128 algorithm to enable faster and more efficient computation. We included some performance statistical results in term of CPU cycles spent on NLM-128 algorithm with and without the PS-LFSR optimization for performance evaluation.

A pioneer scheme in the detection and defense of DrDoS attack involving spoofed flooding packets

  • Kavisankar, L.;Chellappan, C.;Sivasankar, P.;Karthi, Ashwin;Srinivas, Avireddy
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1726-1743
    • /
    • 2014
  • DDoS (Distributed Denial of Service) has been a continuous threat to the cyber world with the growth in cyber technology. This technical evolution has given rise to a number of ultra-sophisticated ways for the attackers to perform their DDoS attack. In general, the attackers who generate the denial of service, use the vulnerabilities of the TCP. Some of the vulnerabilities like SYN (synchronization) flooding, and IP spoofing are used by the attacker to create these Distributed Reflected Denial of Service (DrDoS) attacks. An attacker, with the assistance of IP spoofing creates a number of attack packets, which reflects the flooded packets to an attacker's intended victim system, known as the primary target. The proposed scheme, Efficient Spoofed Flooding Defense (ESFD) provides two level checks which, consist of probing and non-repudiation, before allocating a service to the clients. The probing is used to determine the availability of the requested client. Non-repudiation is taken care of by the timestamp enabled in the packet, which is our major contribution. The real time experimental results showed the efficiency of our proposed ESFD scheme, by increasing the performance of the CPU up to 40%, the memory up to 52% and the network bandwidth up to 67%. This proves the fact that the proposed ESFD scheme is fast and efficient, negating the impact on the network, victim and primary target.

PC Cluster based Parallel Adaptive Evolutionary Algorithm for Service Restoration of Distribution Systems

  • Mun, Kyeong-Jun;Lee, Hwa-Seok;Park, June-Ho;Kim, Hyung-Su;Hwang, Gi-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.4
    • /
    • pp.435-447
    • /
    • 2006
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June-Ho
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.116-124
    • /
    • 2005
  • This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.

Development of Sensor and Block expandable Teaching-Aids-robot (센서 및 블록 확장 가능한 교구용 보조 로봇 개발)

  • Sim, Hyun;Lee, Hyeong-Ok
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.2
    • /
    • pp.345-352
    • /
    • 2017
  • In this paper, we design and implement an educational robot system that can use scratch education with the function of user demanding to perform robot education in actual school site in an embedded environment. It is developed to enable physical education for sensing information processing, software design and programming practice training that is the basis of robotic system. The development environment of the system is Arduino Uno based product using Atmega 328 core, debugging environment based on Arduino Sketch, firmware development language using C language, OS using Windows, Linux, Mac OS X. The system operation process receives the control command of the server using the Bluetooth communication, and drives various sensors of the educational robot. The curriculum includes Scratch program and Bluetooth communication, which enables real-time scratch training. It also provides smartphone apps and is designed to enable education like C and Python through expansion. Teachers at the school site used the developed products and presented performance processing results satisfying the missionary needs of the missionaries.