• Title/Summary/Keyword: direct mapping

Search Result 217, Processing Time 0.024 seconds

Gate Cost Reduction Policy for Direct Irreversible-to-Reversible Mapping Method without Reversible Embedding (가역 임베딩 없는 직접적 비가역-가역회로 매핑 방법의 게이트비용 절감 방안)

  • Park, Dong-Young;Jeong, Yeon-Man
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.11
    • /
    • pp.1233-1240
    • /
    • 2014
  • For the last three decades after the advent of the Toffoli gate in 1980, while many reversible circuit syntheses have been presented reversible embedding methods onto suitable reversible functions, only a few proposed direct irreversible-to-reversible mapping methods without reversible embedding. In this paper we present two effective policies to reduce the gate cost and complexity for the existing direct reversible mapping methods without reversible embedding. In order to develop new cost reduction policies we consider the cost influence of Toffoli module according to NOT gate arrangement in classical circuits. From this we deduced an inverse proportional property between inverting input numbers of classical AND/OR gates and reversible Toffoli module cost based on a fact - the inverting inputs of classical AND(OR) gates increase(decrease) the Toffoli module cost. We confirm the applications of the inverting input rearrangement and maximum fan-out policies preceding direct reversible mapping will be effective method to improve the reversible Toffoli module cost and complexity with the parallel using of the fan-out and supercell ones.

REMARKS ON THE STABILITY OF ADDITIVE FUNCTIONAL EQUATION

  • Jun, Kil-Woung;Kim, Hark-Mahn
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.4
    • /
    • pp.679-687
    • /
    • 2001
  • In this paper, using an idea from the direct method of Hyers, we give the conditions in order for a linear mapping near an approximately additive mapping to exist.

  • PDF

FUZZY PROCESSING BASED ON ALPHA-CUT MAPPING

  • Stoica, Adrian
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1266-1269
    • /
    • 1993
  • The paper introduces a new method for fuzzy processing. The method allows handing a piece of information lost in the classic fuzzification process, and thus neglected by other methods. Processing the result after fuzzification is sustained by the interpretation that the input-output set mapping, specified by the IF-THEN rules, can be regarded as a direct mapping of their corresponding alpha-cuts. Processing involves just singletons as intermediary results, the final result being a combination of singletons obtained from fired rules.

  • PDF

Implementing a set of Direct3D Functions on OpenGL (OpenGL을 이용한 Direct3D 기능의 구현)

  • Do, Joo-Young;Baek, Nak-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.11
    • /
    • pp.19-27
    • /
    • 2011
  • In this paper, we present an emulation library for the essential features and their API function calls provided by Direct3D, the most actively used API for computer game-related application programs on the MS-Windows-based desktop's, with OpenGL library in the Linux environment. In typical Linux-based systems, only the X window system and OpenGL graphics library are available. There are lots of needs for this kind of emulation library to convert the Direct3D-based game applications and user interfaces on these systems. Through carefully selecting the essential API functions from the DirectX version 9.0, we obtained the prototype implementation of that emulation library, to finally get the final full-scale DirectX implementation. Our implementation currently covers 3D coordinate transformations, light and material processing, texture mapping, simple animation features and more. We showed its feasibility through successfully executing a set of Direct3D demonstration programs including a real-world game character animation on our implementation.

Case Study of Derivation of Input-Parameters for Ground-Structure Stability on Foliation-Parallel Faults in Folded Metamorphic Rocks (단층 발달 습곡지반 상 구조물 안정성을 위한 설계정수 도출 사례 연구)

  • Ihm, Myeong Hyeok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.2
    • /
    • pp.467-472
    • /
    • 2020
  • Methods for deriving design input-parameters to ensure the stability of a structure on a common ground are generally well known. Folded metamorphic rocks, such as the study area, are highly foliated and have small faults parallel to the foliation, resulting in special research methods and tests to derive design input parameters, Etc. are required. The metamorphic rock ground with foliation development of several mm intervals has a direct shear test on the foliation surface, the strike/dip mapping of the foliation, the boring investigation to determine the continuity of the foliation, and the rock mass rating of the metamorphic rock. etc. are required. In the case of a large number of small foliation-parallel faults developed along a specific foliation plane, it is essential to analyze the lineament, surface geologic mapping for fault tracing, and direct shear test. Folded ground requires additional geological-structural-domain analysis, discontinuity analysis of stereonet, electrical resistivity exploration along the fold axis, and so on.

Automatic Construction of SHACL Schemas for RDF Knowledge Graphs Generated by Direct Mappings

  • Choi, Ji-Woong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.10
    • /
    • pp.23-34
    • /
    • 2020
  • In this paper, we proposes a method to automatically construct SHACL schemas for RDF knowledge graphs(KGs) generated by Direct Mapping(DM). DM and SHACL are all W3C recommendations. DM consists of rules to transform the data in an RDB into an RDF graph. SHACL is a language to describe and validate the structure of RDF graphs. The proposed method automatically translates the integrity constraints as well as the structure information in an RDB schema into SHACL. Thus, our SHACL schemas are able to check integrity instead of RDBMSs. This is a consideration to assure database consistency even when RDBs are served as virtual RDF KGs. We tested our results on 24 DM test cases, published by W3C. It was shown that they are effective in describing and validating RDF KGs.

Accuracy Analysis of Image Orientation Technique and Direct Georeferencing Technique

  • Bae Sang-Keun;Kim Byung-Guk
    • Spatial Information Research
    • /
    • v.13 no.4 s.35
    • /
    • pp.373-380
    • /
    • 2005
  • Mobile Mapping Systems are effective systems to acquire the position and image data using vehicle equipped with the GPS (Global Positioning System), IMU (Inertial Measurement Unit), and CCD camera. They are used in various fields of road facility management, map update, and etc. In the general photogrammetry such as aerial photogrammetry, GCP (Ground Control Point)s are needed to compute the image exterior orientation elements (the position and attitude of camera). These points are measured by field survey at the time of data acquisition. But it costs much time and money. Moreover, it is not possible to make sufficient GCP as much as we want. However Mobile Mapping Systems are more efficient both in time and money because they can obtain the position and attitude of camera at the time of photographing. That is, Image Orientation Technique must use GCP to compute the image exterior orientation elements, but on the other hand Direct Georeferencing can directly compute the image exterior orientation elements by GPS/INS. In this paper, we analyze about the positional accuracy comparison of ground point using the Image Orientation Technique and Direct Georeferencing Technique.

  • PDF

Path Space Approach for Planning 2D Shortest Path Based on Elliptic Workspace Geometry Mapping

  • Namgung, Ihn
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.1
    • /
    • pp.92-105
    • /
    • 2004
  • A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

Three-Dimensional Grid Generation Method for an Orthogonal Grid at the Boundary by Using Boundary Element Method (경계요소법을 이용한 경계에 직교하는 삼차원 격자형성법)

  • Jeong H. K.;Kwon J. H.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.82-89
    • /
    • 1995
  • In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

  • PDF

Analysis of Concept Mapping about the Perception of Teacher's Rights by Childcare Teachers (보육교사의 교사권리 인식에 대한 개념도 분석)

  • Jang, Kyung Wha;Lim, Sun Ah
    • Korean Journal of Childcare and Education
    • /
    • v.18 no.1
    • /
    • pp.51-70
    • /
    • 2022
  • Objective: In order to promote the rights of childcare teachers, there is a need to identify problems and demands about the rights of childcare teachers. Therefore, this study sought to examine the perception of childcare teachers' rights in order to identify the concepts of teacher rights. Methods: This study used the concept mapping method to identify the concepts of childcare teachers' teacher rights and interpreted these concepts utilizing the multi-dimension analysis method. Results: As a result of interviews from eight childcare teachers, 37 statements were derived. The result of similarities evaluated by 28 childcare teachers showed that 37 statements about teachers' rights consisted of two dimensions and four clusters (direct-indirect and indoor-outdoor of day-care center). Conclusion/Implications: This study suggested that direct and indirect efforts are needed to enhance the rights of childcare teachers and that change is necessary not only within daycare centers such as the principal but that change is also necessary outside daycare centers such as at government agencies in relation to daycare teachers's rights.