• Title/Summary/Keyword: 논리연산

Search Result 310, Processing Time 0.026 seconds

A New Weighted Synaptic Connectvity Matrik for Component Retrieval (컴포넌트 검색을 위한 새로운 가중치 신경 접속 행렬)

  • 금영욱
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.1
    • /
    • pp.1-7
    • /
    • 2002
  • Component-based software development(CBSD) is gaining popularity Effective search and retrieval of desired components, which are stored in a component repository, is a very important issue in CBSD. In this paper. a new weighted synaptic connectivity matrix is proposed to find more appropriate components. An algorithm is proposed for effective search with NOT operator and a proof for the algorithm is Presented . A new procedure to calculate the output vector for a logically combined query is also presented.

  • PDF

A Construction Theory of Sequential Multiple-Valued Logic Circuit by Matrices Operations (행열연산에 의한 순서다치논리회로 구성이론)

  • Kim, Heung Soo;Kang, Sung Su
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.4
    • /
    • pp.460-465
    • /
    • 1986
  • In this paper, a method for constructing of the sequential multiple-valued logic circuits over Galois field GF(px) is proposed. First, we derive the Talyor series over Galois field and the unique matrices which accords with the number of the element over the finite field, and we constdruct sequential multiple-valued logic circuits using these matrices. Computational procedure for traditional polynomial expansion can be reduced by using this method. Also, single and multi-input circuits can be easily implemented.

  • PDF

A Study on Programming Concepts of Programming Education Experts through Delphi and Conceptual Metaphor Analysis

  • Kim, Dong-Man;Lee, Tae-Wuk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.11
    • /
    • pp.277-286
    • /
    • 2020
  • In this paper, we propose a new educational approach to help learners form concepts by identifying the properties of programming concepts targeting a group of experts in programming education. Therefore, we confirmed the typical properties of concepts by programming education experts for programming learning elements through conceptual metaphor analysis, which is a qualitative research method, and confirmed the validity through the delphi method. As a result of this study, we identified 17 typical properties of programming concepts that learners should form in programming education. The conclusions of this study are that need to compose the educational content more specifically for the conceptualization of learners' programming as follows: 1)the concept of a variable is to understand how to store data, how to set a name, what an address has, how to change a value, various types of variables, and the meaning of the size of a variable, 2)the concept of operator is to understand how to operate the four rules, how to deal with it logically, how to connect according to priority, meaning of operation symbols, and how to compare, 3)the concept of the control structure is to understand how to control the execution flow, how to make a logical judgment, how to set an execution rule, meaning of sequential execution, and how to repeat executing.

Group Key Generation Scheme using Logical Operation of HashChain and Random Number in Hierarchy Structures (계층 구조에서의 해쉬 체인과 랜덤난수의 논리 연산을 이용한 그룹키 생성 기법)

  • Kim, Hyun-Chul;Lee, Young-Gu;Kim, Jung-Jae;Lee, Kwang-Hyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.5
    • /
    • pp.1693-1701
    • /
    • 2010
  • In this paper, requirements of efficient group key creation in multiple hierarchy structure environment with clear distinction of hierarchical roles within organizations are explained and the method of creating a group key that satisfies such requirements is proposed. The proposed method creates the group key through logical sum operation of hierarchy identifier created using uni-directional hash chain and group identifier randomly created according to the access right. The problem of excessive possession of key information by upper group users in the existing static group key creation technique was resolved. At the same time, lower group users were prevented from deducing key information of upper group users. In addition, as a result of comparative analysis performed with an experiment on existing super group key creation technique and multiple hierarchy group key method, the proposed method was found to be equivalent or superior to existing method in terms of various items including the total number of keys created, the number of keys possessed by users, the number of keys used for encoding and decoding of information, and expandability of keys.

Developmental disability Diagnosis Assessment Systems Implementation using Multimedia Authorizing Tool (멀티미디어 저작도구를 이용한 발달장애 진단.평가 시스템 구현연구)

  • Byun, Sang-Hea;Lee, Jae-Hyun
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.3 no.1
    • /
    • pp.57-72
    • /
    • 2008
  • Serve and do so that graft together specialists' view application field of computer and developmental disability diagnosis estimation data to construct developmental disability diagnosis estimation system in this Paper and constructed developmental disability diagnosis estimation system. Developmental disability diagnosis estimation must supply information of specification area that specialists are having continuously. Developmental disability diagnosis estimation specialist system need multimedia data processing that is specialized little more for developmental disability classification diagnosis and decision-making and is atomized for this. Characteristic of developmental disability diagnosis estimation system that study in this paper can supply quick feedback about result, and can reduce mistake on recording and calculation as well as can shorten examination's enforcement time, and background of training is efficient system fairly in terms of nonprofessional who is not many can use easily. But, as well as when multimedia information that is essential data of system construction for developmental disability diagnosis estimation is having various kinds attribute and a person must achieve description about all developmental disability diagnosis estimation informations, great amount of work done is accompanied, technology about equal data can become different according to management. Because of these problems, applied search technology of contents base (Content-based) that search connection information by contents of edit target data for developmental disability diagnosis estimation data processing multimedia data processing technical development. In the meantime, typical access way for conversation style data processing to support fast image search, after draw special quality of data by N-dimension vector, store to database regarding this as value of N dimension and used data structure of Tree techniques to use index structure that search relevant data based on this costs. But, these are not coincided correctly in purpose of developmental disability diagnosis estimation because is developed focusing in application field that use data of low dimension such as original space DataBase or geography information system. Therefore, studied save structure and index mechanism of new way that support fast search to search bulky good physician data.

  • PDF

Double Encryption of Digital Hologram Based on Phase-Shifting Digital Holography and Digital Watermarking (위상 천이 디지털 홀로그래피 및 디지털 워터마킹 기반 디지털 홀로그램의 이중 암호화)

  • Kim, Cheol-Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.4
    • /
    • pp.1-9
    • /
    • 2017
  • In this Paper, Double Encryption Technology Based on Phase-Shifting Digital Holography and Digital Watermarking is Proposed. For the Purpose, we First Set a Logo Image to be used for Digital Watermark and Design a Binary Phase Computer Generated Hologram for this Logo Image using an Iterative Algorithm. And Random Generated Binary Phase Mask to be set as a Watermark and Key Image is Obtained through XOR Operation between Binary Phase CGH and Random Binary Phase Mask. Object Image is Phase Modulated to be a Constant Amplitude and Multiplied with Binary Phase Mask to Generate Object Wave. This Object Wave can be said to be a First Encrypted Image Having a Pattern Similar to the Noise Including the Watermark Information. Finally, we Interfere the First Encrypted Image with Reference Wave using 2-step PSDH and get a Good Visible Interference Pattern to be Called Second Encrypted Image. The Decryption Process is Proceeded with Fresnel Transform and Inverse Process of First Encryption Process After Appropriate Arithmetic Operation with Two Encrypted Images. The Proposed Encryption and Decryption Process is Confirmed through the Computer Simulations.

Design and Implementation of Automatic Marking System for a Subjectivity Problem of the Program (프로그램의 주관식 문제 자동 채점 시스템 설계 및 구현)

  • Jung, Eun-Mi;Choi, Mi-Sun;Shim, Jae-Chang
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.5
    • /
    • pp.767-776
    • /
    • 2009
  • The purpose of this paper is to design, implement and test the automatic marking system for programming languages using key-words and boolean operations to solve the processing problems of natural languages. There are accurate grammar systems and key-words in programming languages. Using these characteristics, We have designed, programmed, and tested automatic marking system for programming languages through key-words and boolean operations in this paper. We have categorized programming languages into 7 types as the type of answer and when a professor input any key-words, the system make him put conjunction with the special character. It can be logical expressions instantly so that the system easily operates. We asked 10 students who are majoring in computer engineering to take a test on the paper and web to show how well automatic marking system that we have programmed works. Then We requested 3 professors if the subject problems marked objectively. As a result, automatic marking system proved to be appropriate. We have proposed the way of using key-words and boolean operation for prohibiting huge natural language processing in marking of subjective question. It promotes efficiency rate of programming, objectivity and speed through the transferal to the web for marking since the system prohibits marker to include personal opinion on marking and gives feedback quickly

  • PDF

A Dynamic Reorganization Method using the Hierarchical Structure in the Grid Database (그리드 데이터베이스에서 계층 구조를 이용한 동적 재조직 기법)

  • Cheon, Jong-Hyeon;Jang, Yong-Il;Cho, Sook-Kyoung;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.1 s.16
    • /
    • pp.93-106
    • /
    • 2006
  • A Grid Database is a database management system to process effectively and use the distributed data in a grid computing environment. Spatial data is more important than other general data according to the local characteristics and requires a large storage. The grid database can be used as the optimal system for the management of the spatial data. However, contrary to the conventional distributed database systems, the Grid Database which guarantees the local autonomy has a possibility not to provide an effective system, or it is impossible to use a centralized management environment. In order to allow flexible responses to a dynamically changing environment, it is required to use effectively reorganized method. In this paper, hierarchical reorganization method is presented for dynamic reorganization in a grid database. When the reorganization is conducted, an organizer is created to collect the information of databases. In addition, the organizer which is constructed by the hierarchical structure supports information communication and reorganization, and then it allows the support of regional reorganization operation and effective balance control. The performance assessment of the proposed method shows that the processing capacity is increased after the reorganization.

  • PDF

Analysis of Positive Logic and Negate Logic in 1bit adder and 4 bit adder 74LS283 (1bit 전 가산기와 4bit 덧셈 연산기 74LS283에서 의정 논리와 부 논리에 대한 분석)

  • Chung, Tong-Ho;Chung, Tea-Sang;You, Jun-Bok
    • Proceedings of the KIEE Conference
    • /
    • 2000.11d
    • /
    • pp.781-783
    • /
    • 2000
  • 1bit full adder have 3 input (including carry_in) and 2 outputs(Sum and Carry_out). Because of 1 bit full adder's propagation delay. We usually use 4-bit binary full adder with fast carry, 74LS283. The 74LS283 is positive logic circuit chip. But the logic function of binary adder is symmetrical, so it can be possible to use it not only positive logic but also the negative logic. This thesis use symmetrical property. such as $C_{i+1}(\bar{a_i}\bar{b_i}\bar{c_i})=C_{i+1}{\bar}(a_i,\;b_i,\;c_i)$ and $S_i(\bar{a_i}\bar{b_i}\bar{c_i})=\bar{S_i}(a_i,\;b_i,\;c_i)$. And prove this property with logic operation. Using these property, the 74LS283 adder is possile as the negation logic circuit. It's very useful to use the chip in negative logic. because many system chip is negative logic circuit. for example when we have negative logic chip with 74LS283. we don't need any not gate for 74LS283 input, and just use output of adder(74LS283) as the negation of original output.

  • PDF

A New Efficient Detection Method in Lane Road Environment (도로 환경에 효율적인 새로운 차선 검출 방법)

  • Lee, Kyung-Min;Lin, Chi-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.1
    • /
    • pp.129-136
    • /
    • 2018
  • In this paper, we propose a new real-time lane detection method that is efficient for road environment. Existing methods have a problem of low reliability under environmental changes. In order to overcome this problem, we emphasize the lane candidate area by using gray level division. And Extracts a straight line component near the lane by using the Hough transform, and generates an ROI for each straight line based on the extracted coordinates. And integrates the generated ROI images. Then, the lane is determined by dividing the object using the dual queue in the ROI image. The proposed method is able to detect lanes even in the environmental change unlike the conventional method. And It is possible to obtain an advantage that the area corresponding to the background such as sky, mountain, etc. is efficiently removed and high reliability is obtained.