• Title/Summary/Keyword: 테스트 데이터 생성

Search Result 342, Processing Time 0.021 seconds

An Extended Data Model based on the IFC for Representing Detailed Design Information of Steel Bridge Members (강교 부재의 상세 설계정보 표현을 위한 IFC기반의 데이터 모델 확장)

  • Lee, Jin-Hoon;Lee, Ji-Hoon;Kim, Hyo-Jin;Lee, Sang-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.21 no.3
    • /
    • pp.253-263
    • /
    • 2008
  • Extension of IFC data model for steel bridge members is proposed to represent detailed design information. First of all, the design data items and their representation method are classified by analyzing primary references such as design specification, structural calculation documents and shop drawings. Some of the classified items are enough to be represented by the existing IFC model. However, the need of additional model is noted to systematically represent the design information for other items such as stiffener, diaphragm, joint system, and shear connector. An inheritance relations and properties for added model are also defined. The application program based on the proposed data model is developed. In the end, by loading the application program on the AutoCAD 2002 program, end-users can input the design information of steel bridge members. The applicability and efficiency of the proposed data model and the program are verified by checking the section area, intervals, and interferences.

Cloud-Oriented XML Metadata Generation between Heterogeneous Navigation Systems for Unknown Roads (클라우드 환경에서 이기종 네비게이션간의 새로운 도로 정보 업데이트를 위한 XML 메타 데이터 생성)

  • Lee, Seung-Gwan;Choi, Jin-Hyuk
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.4
    • /
    • pp.83-91
    • /
    • 2011
  • The roadmap DB update for unknown roads is a very important factor for car navigation systems. In this paper, we propose a cloud computing based roadmap generation method for use between heterogeneous navigation system for unknown roads. While the drivers drive on unknown roads, the proposed method extracts the road attribute information, and then generates the metadata in an XML format that is available for the heterogeneous navigation systems in a cloud environment. The metadata is proposed to be used as a replacement for conventional proprietary roadmap formats which used by roadmap providers, which is efficient for heterogeneous navigation system providers in a cloud computing environment. Then, this metadata is provided to the roadmap DB providers through the cloud computing interfaces. With the proposed method, the roadmap DB providers update the own roadmap DB for navigation systems in real time. Therefore, the proposed method can reduce the costs of an actual traveling test and the maintenance for the roadmap DB provides. Thus, the cloud-oriented road map generation method can more efficiently update the unknown road information.

Real-time Traffic Sign Recognition using Rotation-invariant Fast Binary Patterns (회전에 강인한 고속 이진패턴을 이용한 실시간 교통 신호 표지판 인식)

  • Hwang, Min-Chul;Ko, Byoung Chul;Nam, Jae-Yeal
    • Journal of Broadcast Engineering
    • /
    • v.21 no.4
    • /
    • pp.562-568
    • /
    • 2016
  • In this paper, we focus on recognition of speed-limit signs among a few types of traffic signs because speed-limit sign is closely related to safe driving of drivers. Although histogram of oriented gradient (HOG) and local binary patterns (LBP) are representative features for object recognition, these features have a weakness with respect to rotation, in that it does not consider the rotation of the target object when generating patterns. Therefore, this paper propose the fast rotation-invariant binary patterns (FRIBP) algorithm to generate a binary pattern that is robust against rotation. The proposed FRIBP algorithm deletes an unused layer of the histogram, and eliminates the shift and comparison operations in order to quickly extract the desired feature. The proposed FRIBP algorithm is successfully applied to German Traffic Sign Recognition Benchmark (GTSRB) datasets, and the results show that the recognition capabilities of the proposed method are similar to those of other methods. Moreover, its recognition speed is considerably enhanced than related works as approximately 0.47second for 12,630 test data.

A Study on Development of Collaborative Problem Solving Prediction System Based on Deep Learning: Focusing on ICT Factors (딥러닝 기반 협력적 문제 해결력 예측 시스템 개발 연구: ICT 요인을 중심으로)

  • Lee, Youngho
    • Journal of The Korean Association of Information Education
    • /
    • v.22 no.1
    • /
    • pp.151-158
    • /
    • 2018
  • The purpose of this study is to develop a system for predicting students' collaborative problem solving ability based on the ICT factors of PISA 2015 that affect collaborative problem solving ability. The PISA 2015 computer-based collaborative problem-solving capability evaluation included 5,581 students in Korea. As a research method, correlation analysis was used to select meaningful variables. And the collaborative problem solving ability prediction model was created by using the deep learning method. As a result of the model generation, we were able to predict collaborative problem solving ability with about 95% accuracy for the test data set. Based on this model, a collaborative problem solving ability prediction system was designed and implemented. This research is expected to provide a new perspective on applying big data and artificial intelligence in decision making for ICT input and use in education.

Construction of Test Collection for Evaluation of Scientific Relation Extraction System (과학기술분야 용어 간 관계추출 시스템의 평가를 위한 테스트컬렉션 구축)

  • Choi, Yun-Soo;Choi, Sung-Pil;Jeong, Chang-Hoo;Yoon, Hwa-Mook;You, Beom-Jong
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.754-758
    • /
    • 2009
  • Extracting information in large-scale documents would be very useful not only for information retrieval but also for question answering and summarization. Even though relation extraction is very important area, it is difficult to develop and evaluate a machine learning based system without test collection. The study shows how to build test collection(KREC2008) for the relation extraction system. We extracted technology terms from abstracts of journals and selected several relation candidates between them using Wordnet. Judges who were well trained in evaluation process assigned a relation from candidates. The process provides the method with which even non-experts are able to build test collection easily. KREC2008 are open to the public for researchers and developers and will be utilized for development and evaluation of relation extraction system.

  • PDF

Nearest-neighbor Rule based Prototype Selection Method and Performance Evaluation using Bias-Variance Analysis (최근접 이웃 규칙 기반 프로토타입 선택과 편의-분산을 이용한 성능 평가)

  • Shim, Se-Yong;Hwang, Doo-Sung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.10
    • /
    • pp.73-81
    • /
    • 2015
  • The paper proposes a prototype selection method and evaluates the generalization performance of standard algorithms and prototype based classification learning. The proposed prototype classifier defines multidimensional spheres with variable radii within class areas and generates a small set of training data. The nearest-neighbor classifier uses the new training set for predicting the class of test data. By decomposing bias and variance of the mean expected error value, we compare the generalization errors of k-nearest neighbor, Bayesian classifier, prototype selection using fixed radius and the proposed prototype selection method. In experiments, the bias-variance changing trends of the proposed prototype classifier are similar to those of nearest neighbor classifiers with all training data and the prototype selection rates are under 27.0% on average.

Development of Application to Deal with Large Data Using Hadoop for 3D Printer (하둡을 이용한 3D 프린터용 대용량 데이터 처리 응용 개발)

  • Lee, Kang Eun;Kim, Sungsuk
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.1
    • /
    • pp.11-16
    • /
    • 2020
  • 3D printing is one of the emerging technologies and getting a lot of attention. To do 3D printing, 3D model is first generated, and then converted to G-code which is 3D printer's operations. Facet, which is a small triangle, represents a small surface of 3D model. Depending on the height or precision of the 3D model, the number of facets becomes very large and so the conversion time from 3D model to G-code takes longer. Apach Hadoop is a software framework to support distributed processing for large data set and its application range gets widening. In this paper, Hadoop is used to do the conversion works time-efficient way. 2-phase distributed algorithm is developed first. In the algorithm, all facets are sorted according to its lowest Z-value, divided into N parts, and converted on several nodes independently. The algorithm is implemented in four steps; preprocessing - Map - Shuffling - Reduce of Hadoop. Finally, to show the performance evaluation, Hadoop systems are set up and converts testing 3D model while changing the height or precision.

Design and Analysis of Pseudorandom Number Generators Based on Programmable Maximum Length CA (프로그램 가능 최대길이 CA기반 의사난수열 생성기의 설계와 분석)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Han-Doo;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.2
    • /
    • pp.319-326
    • /
    • 2020
  • PRNGs(Pseudorandom number generators) are essential for generating encryption keys for to secure online communication. A bitstream generated by the PRNG must be generated at high speed to encrypt the big data effectively in a symmetric key cryptosystem and should ensure the randomness of the level to pass through the several statistical tests. CA(Cellular Automata) based PRNGs are known to be easy to implement in hardware and to have better randomness than LFSR based PRNGs. In this paper, we design PRNGs based on PMLCA(Programable Maximum Length CA) that can generate effective key sequences in symmetric key cryptosystem. The proposed PRNGs generate bit streams through nonlinear control method. First, we design a PRNG based on an (m,n)-cell PMLCA ℙ with a single complement vector that produces linear sequences with the long period and analyze the period and the generating polynomial of ℙ. Next, we design an (m,n)-cell PC-MLCA based PRNG with two complement vectors that have the same period as ℙ and generate nonlinear sequences, and analyze the location of outputting the nonlinear sequence.

Development of Optimized Driving Model for decreasing Fuel Consumption in the Longitudinal Highway Section (고속도로 종단지형을 고려한 연료 효율적 최적주행전략 모형 개발)

  • Choi, Ji-eun;Bae, Sang-hoon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.6
    • /
    • pp.14-20
    • /
    • 2015
  • The Korea ministry of land, infrastructure and transport set the goal of cutting greenhouse gas emissions from the transport sector by 34.3% relative to the business as usual scenario by 2020. In order to achieve this goal, support is being given to education and information regarding eco-driving. As a practical measure, however, a vehicle control strategy for decreasing fuel consumptions and emissions is necessary. Therefore, this paper presents an optimized driving model in order to decrease fuel consumption. Scenarios were established by driving mode. The speed profile for each scenario applied to Comprehensive Modal Emission Model and then each fuel consumption was estimated. Scenarios and speed variation with the least fuel consumption were derived by comparing the fuel consumptions of scenarios. The optimized driving model was developed by the derived the results. The speed profiles of general driver were collected by field test. The speed profile of the developed model and the speed profile of general driver were compared and then fuel consumptions for each speed profile were analyzed. The fuel consumptions for optimized driving were decreased by an average of 11.8%.

Mobile Camera Processor Design with Multi-lane Serial Interface (멀티레인을 지원하는 모바일 카메라용 직렬 인터페이스 프로세서 설계)

  • Hyun, Eu-Gin;Kwon, Soon;Lee, Jong-Hun;Jung, Woo-Young
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.7 s.361
    • /
    • pp.62-70
    • /
    • 2007
  • In this paper, we design a mobile camera processor to support the MIPI CSI-2 and DPHY specification. The lane management sub-layer of CIS2 handles multi-lane configuration. Thus conceptually, the transmitter and receiver have each independent buffer on multi lanes. In the proposed architecture, the independent buffers are merged into a single common buffer. The single buffer architecture can flexibly manage data on multi lanes though the number of supported lanes are mismatched in a camera processor transmitter and a host processor. For a key issue for the data synchronization problem, the synchronization start codes are added as the starting for image data. We design synchronization logic to synchronize the received clock and to generate the byte clock. We present the verification results under proposed test bench. And we show the waves of simulation and logic synthesis results of the designed processor.