• Title/Summary/Keyword: C language

Search Result 1,646, Processing Time 0.032 seconds

A Generation from Entity-Relationship Model to XML Schema Model (개체-관계 모델에선 XML Schema의 생성)

  • Kim, Chang-Suk;Kim, Dae-Su;Son, Dong-Cheul
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.6
    • /
    • pp.667-673
    • /
    • 2004
  • The XML is emerging as standard language for data exchange on the Web. Therefore the demand of XML Schema(W3C XML Schema Spec.) that verifies XML document becomes increasing. However, XML Schema has a weak point for design because of its complication despite of various data and abundant expressiveness. This paper shows a simple way of design for XML Schema using a fundamental means for database design, the Entity-Relationship model. The conversion from the Entity-Relationship model to XML Schema can not be directly on account of discordance between the two models. So we present some algorithms to generate XML Schema from the Entity-Relationship model. The algorithms produce XML Schema codes using a hierarchical view representation. An important objective of this automatic generation is to preserve XML Schema's characteristics such as reusability, global and local ability, ability of expansion and various type changes.

Design and Applications of Graphics Interface on Personal Computer (개인용 컴퓨터상의 그래픽스 인터페이스 설계와 응용)

  • Kim, Jin-Han;Kyung, Chong-Min
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.1
    • /
    • pp.113-121
    • /
    • 1989
  • A software interface called CGI-K including device driver routines and graphics primitives for the grphic board "K" was designed, implemented in the Design Automation Laboratory of KAIST and installed on IBM PC/AT, using assembly and C language supported by TMS 34010 grphics processor. Several algorithms generating the graphics primitives such as box, circle, pie chord are proposed. The drawing speed of CGI-K on the graphic board K was found out to be three to ten times faster than that of the EGA for several examples. A 2-D graphics editor called GRIM (graphics input and modification) and a 3-dimensional graphics renderer called IPCHE which can draw 3-D objects were developed as two major application programs running on CGI-K. The graphics primitives supported in GRIM include polygon, box, circle, and ace. The IPCHE receives a 3-D objects data file and displays the 3-D object on the screen with hidden surface removal, shading, and perspective scaling.

  • PDF

LOSIM : Logic Simulation Program for VLSI (LOSIM : VLSI의 설계검증을 위한 논리 시뮬레이션 프로그램)

  • Kang, Min-Sup;Lee, Chul-Dong;Yu, Young-Uk
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.5
    • /
    • pp.108-116
    • /
    • 1989
  • The simulator described here-LOSIM(LOgic SIMulator)-was developed to verify the logic design for VLSI(Very Large Scale Integrated) circuits at mixed level. In this paper, we present a modeling approach to obtain more accurate results than conventional logic simulators [5-6,9] for general elements, functional elements, transmission gates and tri-state gates using eight signal values and two gignal strengths. LOSIM has the capability which can perform timing and hazard analysis by using assignable rise and fall delays. We also prosent an efficient algorithm to accurately detectdynamic and static hazards which may be caused by the circuit delays. Our approach is based on five logic values and the scheduled time. LOSIM has been implemented on a UN-3/160 workstation running Berkeley 4.2 UNIX, and the program is written in C language. Static RAM cell and asynchronous circuit are illustrated as an example.

  • PDF

VLSI Design of Reed-Solomon Decoder over GF($2^8$) with Extreme Use of Resource Sharing (하드웨어 공유 극대화에 의한 GF($2^8$) Reed-Solomon Decoder의 VLSI설계)

  • 이주태;이승우;조중휘
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.3
    • /
    • pp.8-16
    • /
    • 1999
  • This paper describes a VLSI design of Reed-Solomon(RS) decoder using the modified Euclid algorithm, with the main theme focused on the $\textit{GF}(2^8)$. To get area-efficient design, a number of new architectures have been devised with maximal register and Euclidean ALU unit sharing. One ALU is shared to replace 18 ALUs which computes an error locator polynomial and an error evaluation polynomial. Also, 18 registers are shared to replace 24 registers which stores coefficients of those polynomials. The validity and efficiency of the proposed architecture have been verified by simulation and by FLEX$^TM$ FPGA implementation in hardware description language VHDL. The proposed Reed-Solomon decoder, which has the capability of decoding RS(208,192,17) and RS(182,172,11) for Digital Versatile Disc(DVD), has been designed by using O.6$\mu\textrm{m}$ CMOS TLM Compass$^TM$ technology library, which contains totally 17k gates with a core area of 2.299$\times$2.284 (5.25$\textrm{mm}^2$). The chip can run at 20MHz while the DVD requirement is 3.74MHz.

  • PDF

A Clock Skew Minimization Technique Considering Temperature Gradient (열 기울기를 고려한 클락 스큐 최소화 기법)

  • Ko, Se-Jin;Lim, Jae-Ho;Kim, Ki-Young;Kim, Seok-Yoon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.7
    • /
    • pp.30-36
    • /
    • 2010
  • Due to the scaling of process parameters, the density on chips has been increasing. This trend increases not only the temperature on chips but also the gradient of the temperature depending on distances. In this paper, we propose the balanced skew tree generation technique for minimizing the clock skew that is affected by the temperature gradients on chips. We calculate the interconnect delay using Elmore delay equation, and find out the optimal balanced clock tree by modifying the clock trees that are generated through the DME(Deferred Merge Embedding) algorithm. We have implemented the proposed technique using C language for the performance evaluation. The experimental results show that the clock insertion point generated by the temperature gradient can be lowered below 54% and we confirm that the skew is remarkably decreased after applying the proposed technique.

Suffix Array Based Path Query Processing Scheme for Semantic Web Data (시맨틱 웹 데이터에서 접미사 배열 기반의 경로 질의 처리 기법)

  • Kim, Sung-Wan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.10
    • /
    • pp.107-116
    • /
    • 2012
  • The applying of semantic technologies that aim to let computers understand and automatically process the meaning of the interlinked data on the Web is spreading. In Semantic Web, understanding and accessing the associations between data that is, the meaning between data as well as accessing to the data itself is important. W3C recommended RDF (Resource Description Framework) as a standard format to represent both Semantic Web data and their associations and also proposed several RDF query languages in order to support query processing for RDF data. However further researches on the query language definition considering the semantic associations and query processing techniques are still required. In this paper, using the suffix array-based indexing scheme previously introduced for RDF query processing, we propose a query processing approach to handle ${\rho}$-path query which is the representative type of semantic associations. To evaluate the query processing performance of the proposed approach, we implemented two different types of query processing approaches and measured the average query processing times. The experiments show that the proposed approach achieved 1.8 to 2.5 and 3.8 to 11 times better performance respectively than others two.

Development of the 3-D Fracture Network Analysis and Visualization Software Modules (삼차원 불연속면 연결구조 해석 및 가시화 소프트웨어 모듈 개발)

  • Noh, Young-Hwan;Choi, Yosoon;Um, Jeong-Gi;Hwang, Sukyeon
    • Tunnel and Underground Space
    • /
    • v.23 no.4
    • /
    • pp.261-270
    • /
    • 2013
  • As part of the development of the 3-D geologic modeling software, this study addresses on new development of software modules that can perform the analysis and visualization of the fracture network system in 3-D. The developed software modules, such as BOUNDARY, DISK3D, FNTWK3D, CSECT and BDM, are coded on Microsoft Visual Studio platform using the MFC and OpenGL library supported by C++ program language. Each module plays a role in construction of analysis domain, visualization of fracture geometry in 3-D, calculation of equivalent pipes, production of cross-section map and management of borehole data, respectively. The developed software modules for analysis and visualization of the 3-D fracture network system can be used to tackle the geomechanical problems related to strength, deformability and hydraulic behaviors of the fractured rock masses. All these benefits will further enhance the economic competitiveness of the domestic software industry.

Verification of Dose Evaluation of Human Phantom using Geant4 Code (Geant4 코드를 사용한 인체팬텀 선량평가 검증)

  • Jang, Eun-Sung;Choi, Ji-Hoon
    • Journal of the Korean Society of Radiology
    • /
    • v.14 no.5
    • /
    • pp.529-535
    • /
    • 2020
  • Geant4 is compatible with the Windows operating system in C++ language use, enabling interface functions that link DICOM or software. It was simulated to address the basic structure of the simulation using Geant4/Gate code and to specifically verify the density composition and lung cancer process in the human phantom. It was visualized using the Gate Graphic System, i.e. openGL, Ray Tracer: Ray Tracing by Geant4 Tracing, and using Geant4/Gate code, lung cancer is modeled in the human phantom area in 3D, 4D to verify the simulation progress. Therefore, as a large number of new functions are added to the Gate Code, it is easy to implement accurate human structure and moving organs.

The Design and Performance Analysis of an Effective OWL Storage System Based on the DBMS (데이터베이스 시스템에 기반한 효율적인 OWL 저장시스템 설계 및 성능분석)

  • Cha, Seong-Hwan;Kim, Seong-Sik;Kim, TaeYoung
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.5
    • /
    • pp.77-88
    • /
    • 2008
  • Having observed the restriction of the current Web technology, the semantic Web has been developed, and it now has grown up with the core help of the W3C to a level where it recommends the OWL Web ontology language. Besides, in order to deduce the information out of OWL data, several inference systems have been developed such as Jena, Jess, and JTP. Unfortunately, however, quite few systems can effectively handle recently developed OWL data, and further, due to the limitation of file-based operation, the current inference systems cannot meet the requirements for handing huge OWL data. An efficient method for storing and searching ontology data is essential for ensuring stable information inference processes. In this study, firstly, we proposed a model based on the database management system to transform and store OWL data and to enable deduction process from the database. Secondly, we designed and implemented an effective OWL storing system based on our model. Finally, we compare our system with the previous inference systems through experimental performance analysis.

  • PDF

The Development and Application of Tutoring Strategy for On-line Programming Learning Based on Affective Learning Style of the Informatics Gifted (정보영재의 정의적 학습양식에 기반한 온라인 프로그래밍 학습 튜터링 전략의 개발 및 적용)

  • Kim, Jiseon;Kim, Yungsik
    • The Journal of Korean Association of Computer Education
    • /
    • v.19 no.6
    • /
    • pp.33-44
    • /
    • 2016
  • In this study, learning preferences of the informatics gifted participating in on-line programming practice has been investigated and the tutoring strategy based on learning styles was developed and verified its effectiveness. On-line programming learning is the environment in which learning is done through interaction with a tutor. For determination of the students' learning styles, Grasha-Reichmann's learning style was utilized. Key elements, learning activity and feedback, of tutoring strategy were derived based on learning style and developed on-line programming learning tutoring strategy. To verify the effectiveness, six-class period of learning C-language of 173 middle and high school students based on learning styles was applied for 12 weeks. As a result, the experiment group applied with a tutoring strategy based on the learning style showed significant improvements in terms of satisfaction and achievement than the control group.