• Title/Summary/Keyword: 알고리즘과 프로그래밍

Search Result 548, Processing Time 0.036 seconds

A Structural Testing Strategy for PLC Programs Specified by Function Block Diagram (함수 블록 다이어그램으로 명세된 PLC 프로그램에 대한 구조적 테스팅 기법)

  • Jee, Eun-Kyoung;Jeon, Seung-Jae;Cha, Sung-Deok
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.3
    • /
    • pp.149-161
    • /
    • 2008
  • As Programmable Logic Controllers(PLCs) are frequently used to implement real-time safety critical software, testing of PLC software is getting more important. We propose a structural testing technique on Function Block Diagram(FBD) which is one of the PLC programming languages. In order to test FBD networks, we define templates for function blocks including timer function blocks and propose an algorithm based on the templates to transform a unit FBD into a flowgraph. We generate test cases by applying existing testing techniques to the generated flowgraph. While the existing FBD testing technique do not consider infernal structure of FBD to generate test cases and can be applied only to FBD from which the specific intermediate model can be generated, this approach has advantages of systematic test case generation considering infernal structure of FBD and applicability to any FBD without regard to its intermediate format. Especially, the proposed method enables FBD networks including timer function blocks to be tested thoroughly. To demonstrate the effectiveness of the proposed method, we use trip logic of bistable processor of digital nuclear power plant protection systems which is being developed in Korea.

A Fast Multipoint-to-Point LSP Traffic Engineering for Differentiated Service in MPLS Networks (MPLS 망에서 차별화 된 서비스를 제공하기 위한 빠른 Multipoint-to-Point LSP 결정 방식)

  • Kim, Seong-Gwan;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.5
    • /
    • pp.232-242
    • /
    • 2002
  • In a MPLS(Multiprotocol Label Switching) network, it is important to reduce the number of labels and LSP(Lable Switched Path)s for network resource management. MTP(Multipoint-to-Point) LSP can be used to solve this problem. In consideration of traffic engineering, MTP LSP must be chosen to enhance the availability of network and link utilization. Also, a fast mechanism to setup MTP LSPs is required for rerouting capability against link failure. In this paper, we propose a fast MTP LSP traffic engineering of multipath MTP LSP by using a mapping of a MTP LSP upon Diffserv PHBs(Per Hop Behavior) in a Diffserv-capable MPLS network. In the proposed traffic engineering, we determine multiple MTP LSPs in a hierarchical manner according to the characteristics of different services. By using Monte-Carlo method for traffic load balancing process, it provides fast rerouting capability in case of frequent link failure across large network. Out method produces to be nearly optimal within reasonable run-times. It's time complexity is in O( Cn$^2$logn) as conventional multipath routing and it is much faster than Linear Programming approach. Simulation results show that the proposed traffic engineering can be controlled effectively in an administrative manner and enhance the availability of network in comparison with conventional multipath routing.

Experimental Vibration Analysis of Vehicle Body-Engine Systems by Transfer Function Synthesis Method (전달함수합성법에 의한 차체-엔진계의 실험적 진동해석)

  • 정의봉;안세진;김원영
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.289-295
    • /
    • 1995
  • 구조물의 동적부하에 대한 동적변형 응답을 정확히 예측하고, Over Design이나 Under Design이 아닌 합리적인 설계방안의 개발은 중요한 과제이다. 동적강도해석이나 소음 승차감과 같은 진동 및 충격에 기인하는 제반 문제를 복잡한 구조물을 대상으로 합리적으로 처리하기 위한 Dynamic Design Analysis는 높은 신뢰성의 추구와 더불어 필요불가결한 기술이 되고 있다. 동적해석 방법으로는 현재 유한요소법이 널리 사용되고 있으며 여러 종류의 범용 프로그램들이 보급되어 있는 실정이다. 그러나 특히 동적문제에 있어서는 형상이나 거동이 복잡한 구조물의 경우, 또는 차량의 차체와 같이 많은 장착물이 부착된 경우에는 유한요소법의 적용이 곤란하여, 지금까지 대처할 수 있는 유용한 방법이 없었다. 따라서 비교적 용이하고 간단하게 적용가능한 진동실험을 기초로 한 구조물의 동적 응답해석 및 설계 방안의 개발이 필요하다. 본 연구에서는 진동시험으로 얻어진 부분구조물의 응답특성과 결합특성으로부터 결합 후의 응답특성을 예측할 수 있는 방법을 전달함수합성이론을 기초로하여 프로그래밍 package화 한다. 그리고 평판구조물에 대하여 진동시험과 컴퓨터 시뮬레이션을 통하여 개발된 방법의 타당성을 검증한다. 또한 실제 차량에서 차체만의 진동시험과 엔진의 자유진동시험에 의한 시험데이터로부터 차체와 엔진이 마운트 결합된 후의 진동특성을 예측한다. 진동시험시에 입력과 출력에 노이즈가 필연적으로 혼입되어 주파수응답함수의 크기(magnitude)와 위상(phase)을 왜곡시킨다. 특히 위상의 왜곡은 복소수연산을 하는 전달함수합성법의 결과에 중요한 영향을 미치게 된다. 본 연구에서는 데이타 획득시 입력과 출력의 시간지연으로 생기는 위상왜곡을 보정하는 방법을 제시하고, 그 개선 정도를 조사한다.는 소견의 확실도로서 가능성을 표현한 것이다. 예를 들면, 진동진폭 스펙트럼상에 2X 성분이 상당히 크게 나타나 정렬불량의 가능성이 0.7 정도라고 판정하는 것 등은 이러한 수치적진리치를 이용하는 방법이다. 그러나 상기의 수치적 표현만으로는 확실도를 한개의 수치로서 대표하게 하는 것은 진단의 정밀도에 문제가 있을 것으로 생각된다. 따라서 언어적진리치가 도입되어 [상당히 확실], [확실], [약간 확실] 등의 언어적인 표현을 이용하여 애매성을 표현하게 되었다. 본 논문에서는 간이진단 결과로부터 추출된 애매한 진단결과중에서 가장 가능성이 높은 이상원인을 복수로 선정하고, 여러 종류의 수치화할 수 없는 언어적(linguistic)인 정보ㄷㄹ을 if-then 형식의 퍼지추론으로 종합하는 회전기계의 이상진단을 위한 정밀진단 알고리즘을 제안하고 그 유용성을 검토한다. 존재하여도 모우드 변수들을 항상 정확하게 구할 수 있으며, 또한 알고리즘의 안정성이 보장된 것이다.. 여기서는 실험실 수준의 평 판모델을 제작하고 실제 현장에서 이루어질 수 있는 진동제어 구조물에 대 한 동적실험 및 FRS를 수행하는 과정과 동일하게 따름으로써 실제 발생할 수 있는 오차나 error를 실험실내의 차원에서 파악하여 진동원을 있는 구조 물에 대한 진동제어기술을 보유하고자 한다. 이용한 해마의 부피측정은 해마경화증 환자의 진단에 있어 육안적인 MR 진단이 어려운 제한된 경우에만 실제적 도움을 줄 수 있는 보조적인 방법으로 생각된다.ofile whereas relaxivity at high field is not affected by τS. On the other hand, the change in τV does not affect low field profile but strongly in fluences on bot

  • PDF

Software Development for Dynamic Positron Emission Tomography : Dynamic Image Analysis (DIA) Tool (동적 양전자방출단층 영상 분석을 위한 소프트웨어 개발: DIA Tool)

  • Pyeon, Do-Yeong;Kim, Jung-Su;Jung, Young-Jin
    • Journal of radiological science and technology
    • /
    • v.39 no.3
    • /
    • pp.369-376
    • /
    • 2016
  • Positron Emission Tomography(PET) is nuclear medical tests which is a combination of several compounds with a radioactive isotope that can be injected into body to quantitatively measure the metabolic rate (in the body). Especially, Phenomena that increase (sing) glucose metabolism in cancer tissue using the $^{18}F$-FDG (Fluorodeoxyglucose) is utilized widely in cancer diagnosis. And then, Numerous studies have been reported that incidence seems high availability even in the modern diagnosis of dementia and Parkinson's (disease) in brain disease. When using a dynamic PET iamge including the time information in the static information that is provided for the diagnosis many can increase the accuracy of diagnosis. For this reason, clinical researchers getting great attention but, it is the lack of tools to conduct research. And, it interfered complex mathematical algorithm and programming skills for activation of research. In this study, in order to easy to use and enable research dPET, we developed the software based graphic user interface(GUI). In the future, by many clinical researcher using DIA-Tool is expected to be of great help to dPET research.

A Study on Improved Image Matching Method using the CUDA Computing (CUDA 연산을 이용한 개선된 영상 매칭 방법에 관한 연구)

  • Cho, Kyeongrae;Park, Byungjoon;Yoon, Taebok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2749-2756
    • /
    • 2015
  • Recently, Depending on the quality of data increases, the problem of time-consuming to process the image is raised by being required to accelerate the image processing algorithms, in a traditional CPU and CUDA(Compute Unified Device Architecture) based recognition system for computing speed and performance gains compared to OpenMP When character recognition has been learned by the system to measure the input by the character data matching is implemented in an environment that recognizes the region of the well, so that the font of the characters image learning English alphabet are each constant and standardized in size and character an image matching method for calculating the matching has also been implemented. GPGPU (General Purpose GPU) programming platform technology when using the CUDA computing techniques to recognize and use the four cores of Intel i5 2500 with OpenMP to deal quickly and efficiently an algorithm, than the performance of existing CPU does not produce the rate of four times due to the delay of the data of the partition and merge operation proposed a method of improving the rate of speed of about 3.2 times, and the parallel processing of the video card that processes a result, the sequential operation of the process compared to CPU-based who performed the performance gain is about 21 tiems improvement in was confirmed.

Development of an SWRL-based Backward Chaining Inference Engine SMART-B for the Next Generation Web (차세대 웹을 위한 SWRL 기반 역방향 추론엔진 SMART-B의 개발)

  • Song Yong-Uk;Hong June-Seok;Kim Woo-Ju;Lee Sung-Kyu;Youn Suk-Hee
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.2
    • /
    • pp.67-81
    • /
    • 2006
  • While the existing Web focuses on the interface with human users based on HTML, the next generation Web will focus on the interaction among software agents by using XML and XML-based standards and technologies. The inference engine, which will serve as brains of software agents in the next generation Web, should thoroughly understand the Semantic Web, the standard language of the next generation Web. As abasis for the service, the W3C (World Wide Web Consortium) has recommended SWRL (Semantic Web Rule Language) which had been made by compounding OWL (Web Ontology Language) and RuleML (Rule Markup Language). In this research, we develop a backward chaining inference engine SMART-B (SeMantic web Agent Reasoning Tools -Backward chaining inference engine), which uses SWRL and OWL to represent rules and facts respectively. We analyze the requirements for the SWRL-based backward chaining inference and design analgorithm for the backward chaining inference which reflects the traditional backward chaining inference algorithm and the requirements of the next generation Semantic Web. We also implement the backward chaining inference engine and the administrative tools for fact and rule bases into Java components to insure the independence and portability among different platforms under the environment of Ubiquitous Computing.

  • PDF

Algorithm Development and Experimental Verification of Acoustic Emission First-arrival-time Determination for the Source Location (정확한 미소파괴음의 발생위치 분석을 위한 신호 도달시간 결정 알고리즘 연구 및 실험적 검증)

  • Jang, Hyun-Sic;Choi, Jun-Young;Jang, Bo-An
    • The Journal of Engineering Geology
    • /
    • v.25 no.4
    • /
    • pp.587-598
    • /
    • 2015
  • We examined various existing threshold methods for the determination of the first arrival time of acoustic emission (AE), and developed a new variable threshold method that could determine the first arrival time of AE more accurately and more quickly than existing methods. The new method, a modification of an existing threshold method, does not fix the threshold, but applies variable thresholds for the AE signals according to noise analysis. Two- and three-dimensional models were established to test the effectiveness of the new method. It could determine source locations of AE in a two-dimensional model 38.3% more accurately than the pre-existing threshold methods. Its accuracy improvement over the existing methods in a three-dimensional model was about 15.2%. A practical test involved measuring the source locations of AE during three-point bending tests of granite cores. The new method placed the sources closer to the fracture plane than did the pre-existing methods, indicating its superior (and quicker) ability to determine the source locations of AE.

Development of robot calibration method based on 3D laser scanning system for Off-Line Programming (오프라인 프로그래밍을 위한 3차원 레이저 스캐닝 시스템 기반의 로봇 캘리브레이션 방법 개발)

  • Kim, Hyun-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.3
    • /
    • pp.16-22
    • /
    • 2019
  • Off-line programming and robot calibration through simulation are essential when setting up a robot in a robot automation production line. In this study, we developed a new robot calibration method to match the CAD data of the production line with the measurement data on the site using 3D scanner. The proposed method calibrates the robot using 3D point cloud data through Iterative Closest Point algorithm. Registration is performed in three steps. First, vertices connected by three planes are extracted from CAD data as feature points for registration. Three planes are reconstructed from the scan point data located around the extracted feature points to generate corresponding feature points. Finally, the transformation matrix is calculated by minimizing the distance between the feature points extracted through the ICP algorithm. As a result of applying the software to the automobile welding robot installation, the proposed method can calibrate the required accuracy to within 1.5mm and effectively shorten the set-up time, which took 5 hours per robot unit, to within 40 minutes. By using the developed system, it is possible to shorten the OLP working time of the car body assembly line, shorten the precision teaching time of the robot, improve the quality of the produced product and minimize the defect rate.

Case study of information curriculum for upper-grade students of elementary school (초등학교 고학년 정보 교육과정 사례 연구)

  • Kang, Seol-Joo;Park, Phanwoo;Kim, Wooyeol;Bae, Youngkwon
    • Journal of The Korean Association of Information Education
    • /
    • v.26 no.4
    • /
    • pp.229-238
    • /
    • 2022
  • At the time of discussing the 2022 revised curriculum, the demand for normalization of information education is increasing. This study was conducted on the case of the information curriculum for the upper elementary grades responding to such needs. For 14 6th grade students of Elementary School B in K Metropolitan City, 4 core areas of the information curriculum, including computing system, data, algorithm & programming, and digital culture, were covered through classes. Cooperative classes were conducted between students by using the cloud-based application according to the class. In addition, it was intended to supplement the curriculum by suggesting ideas for artificial intelligence education area, and to improve the density of research with additional investigation on foreign information education cases. However, the need for independent organization of the information curriculum was strongly confirmed in that the current curriculum for information classes lacked sufficient school hours and had to be operated in combination with other subjects in the form of a project for this case study. It is hoped that this study will serve as a small foundation for the establishment of the information curriculum for the upper elementary grades in the future.

Development of A Turn Label Based Optimal Path Search Algorithm (Turn Label 기반 최적경로탐색 알고리즘 개발)

  • Meeyoung Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.23 no.2
    • /
    • pp.1-14
    • /
    • 2024
  • The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.