• Title/Summary/Keyword: 다중 접근

Search Result 1,081, Processing Time 0.032 seconds

Security Model Using Role-Based Access Control in Multi-Level Database System (다단계 데이터베이스 역할기반 제어 보안 모델)

  • Jo, Jun-Ho;Kim, Ung-Mo
    • Annual Conference of KIPS
    • /
    • 2000.10a
    • /
    • pp.113-116
    • /
    • 2000
  • 역할 기반의 접근제어 시스템은 응용에 따라 보호 객체들에 대한 접근을 역할들로 분류하고 이를 책임 있는 사용자에게 할당함으로써 개개의 사용자들에게 권한을 할당, 회수하는 전통적인 기법에 비해 단순하고 편리한 권한 관리를 제공한다. 다단계 보안 시스템은 각 시스템의 주체와 객체에게 보안 등급을 부여하고, 등급별로 분리된 정보의 보안을 유지하기 위해서 다중 보안 단계에서 정보를 처리하는 강제적 접근 제어를 제공한다. 본 논문에서는 MAC 기반의 데이터베이스 환경에서 최소 권한 정책을 반영하기 위하여 역할 기반의 접근 제어 기법을 적용한다. 따라서 같은 등급 혹은 그 이상의 등급을 가진 사용자라 할지라도 실제 데이터베이스 내에 저장된 데이터에 대한 권한 없는 접근, 고의적인 파괴 및 변경을 방지함으로써 실제 기업 환경에 적합한 다단계 역할기반 보안 모델을 제시한다.

  • PDF

Some Characteristics of the Performance in Comparison with Indexing techniques for File Organization (화일조직을 위한 인덱싱 기법의 성능 특성 비교)

  • Lee, Gu-Nam
    • Journal of The Korean Association of Information Education
    • /
    • v.1 no.1
    • /
    • pp.49-59
    • /
    • 1997
  • In this thesis, To provide the base of effective data access methods, performance of some indexing techniques used gent-Tally are compared. They are classified as primary key and multikey. For primary key method, made a comparative analysis on Static index. Dynamic index and Hashing. For multikey indexing method K-d tree, K-d-B tree, Inverted file and Grid file of which characteristics are compared. In many applications, multikey indexings are more requested, but are not supplied enough. So, to satisfy users' request - more fast, more exact and to be applied according to the trend of being huge database systems, it is requested more study about multikey data access methods.

  • PDF

Protecting Memory of Process Using Mandatory Access Control (강제적 접근제어를 통한 프로세스 메모리 보호)

  • Shim, Jong-Ik;Park, Tae-Kyou;Kim, Jin-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.9
    • /
    • pp.1947-1954
    • /
    • 2011
  • There are various attacks such as tampering, bypassing and spoofing which are caused with system-wide vulnerabilities of Windows operating system. The underlying operating system is responsible for protecting application-space mechanisms against such attacks. This paper provides the implementation of mandatory access control known as multi-level security (MLS) rating with TCSEC-B1 level on th kernel of Windows$^{TM}$. By adding especially the protection feature against tampering memory of processes to the security kernel, this implementation meets the responsibility against system-wide vulnerabilities.

Pipelined Parallel Processing System for Image Processing (영상처리를 위한 Pipelined 병렬처리 시스템)

  • Lee, Hyung;Kim, Jong-Bae;Choi, Sung-Hyk;Park, Jong-Won
    • Journal of IKEEE
    • /
    • v.4 no.2 s.7
    • /
    • pp.212-224
    • /
    • 2000
  • In this paper, a parallel processing system is proposed for improving the processing speed of image related applications. The proposed parallel processing system is fully synchronous SIMD computer with pipelined architecture and consists of processing elements and a multi-access memory system. The multi-access memory system is made up of memory modules and a memory controller, which consists of memory module selection module, data routing module, and address calculating and routing module, to perform parallel memory accesses with the variety of types: block, horizontal, and vertical access way. Morphological filter had been applied to verify the parallel processing system and resulted in faithful processing speed.

  • PDF

Design and Implementation of Adaptable User Interfaces Generation System for Diverse Devices (다양한 장치를 위한 적응력 있는 유저 인터페이스 생성 시스템의 설계 및 구현)

  • Kim, Chi-Su;Kim, Young-Tae
    • The KIPS Transactions:PartD
    • /
    • v.12D no.7 s.103
    • /
    • pp.979-984
    • /
    • 2005
  • Many web-based Information systems require degrees of adaptation of the system's user interfaces to different client devices, users and tasks. We describe a new approach to providing adaptable client interfaces for web-based Information systems that allow a developer to specify a web-based interface using a high-level mark-up language. At run-time this single interface description is used to automatically provide for multiple web devices This approach allows developers to much more easily construct and maintain web-based user interfaces than other current approaches.

Parallel Processing System with combined Architecture of SIMD with MIMD (SIMD와 MIMD가 결합된 구조를 갖는 병렬처리시스템)

  • Lee, Hyung;Choi, Sung-Hyuk;Kim, Jung-Bae;Park, Jong-Won
    • The KIPS Transactions:PartA
    • /
    • v.8A no.1
    • /
    • pp.9-15
    • /
    • 2001
  • 영상에 관련된 다양한 응용 시스템들을 구현하는 많은 연구들이 진행되어 왔지만, 그러한 영상 관련 응용 시스템을 구현함에 있어서 처리속도의 저하로 인하여 많은 어려움을 겪고 있다. 이를 해결하기 위해 대두된 여러 방법들 중에서 최근 하드웨어 접근 방법에 고려한 많은 관심과 연구가 진행되고 있다. 본 논문은 영상을 실시간으로 처리하기 위하여 하드웨어 구조를 갖는 병렬처리시스템을 기술하며, 또한 병렬처리시스템을 얼굴 검색 시스템에 적용한 후 처리속도 및 실험 결과를 기술한다. 병렬처리시스템은 SIMD와 MIMD가 결합된 구조를 갖고 있기 때문에 다양한 영상 응용시스템에 대해서 융통성과 효율성을 제공하며, 144개의 처리기와 12개의 다중접근기억장치, 외부 메모리 모듈을 위한 인터페이스와 외부 프로세서 장치(i960Kx)와의 통신을 위한 인터페이스로 구성되어있다. 다중접근기억장치는 메모리 모듈선택회로, 데이터 라이팅회로, 그리고, 주소계산 및 라우팅회로로 구성되어 있다. 또한 얼굴 검색 시스템을 병렬처리 시스템에 적합한 병렬화를 제공하기 위해 메쉬방법을 이용하여 전처리, 정규화, 4개 특징값 추출, 그리고 분류화로 구성하였다. 병렬처리시스템은 하드웨어 모의실험 패키지인 CADENCE사의 Verilog-XL로 모의실험을 수행하여 기능과 성능을 검증하였다.

  • PDF

3D Object Extraction Algorithm Based on Hierarchical Approach Using Reduced Windowed Fourier Phase (간소화된 윈도우 푸리에 위상을 이용한 계층적 접근기반의 3차원 객체 추출 기법)

  • Min, Gak;Han, Kyu-Phil;Lee, Ky-Soo;Ha, Yeong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8A
    • /
    • pp.779-785
    • /
    • 2002
  • This paper presents a phase-based stereo matching algorithm in order to efficiently extract 3-dimensional objects from two 2D images. Conventional phase-based methods, especially using windowed Fourier phases, inherit good properties in the case of hierarchical approaches, because they basically use a multi-resolution phase map. On the contrary, their computational costs are very heavy. Therefore, a fast hierarchical approach, using multi-resolution phase-based strategy and reducing the redundancy of phase calculations, is proposed in this pare. In addition, a structural matching algorithm on the phase domain is adopted to improve the matching quality. In experimental results, it is shown that the computation loads are considerably reduced about 8 times and stable outputs are obtained.

A Multiple Access Scheme Using Split and Merge Algorithm for Centralized Wireless MAC Protocols (중앙 집중형 무선 매체 접근 제어 프로토콜을 위한 분할 및 합병 알고리즘을 이용한 다중 접근 방안)

  • Kim Min-Su;Byun Tae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.757-763
    • /
    • 2006
  • In this paper, a novel multiple access scheme using SMA(Split and Merge Algorithm) is proposed to reduce the accessdelay of wireless MAC protocols. The key idea of the SMA is to dynamically split and merge the contending terminals depending on their traffic loads for effective control of access to the channels. The SMA divides the collided terminals into several sub-groups if a collision occurs and merges the idle terminals of the split sub-groups into their original group. The merge algorithm can be used to resolve collision and split operation can be used to dynamic group management. The simulation results indicate that our algorithm may provide a higher throughput and a lower collision rate than the existing algorithms, especially under heavy traffic loads.

PMS: Probability-based Multi Successor Prefetch Algorithm for Software Streaming Services of Mobile Embedded Devices (PMS: 모바일 임베디드 시스템의 소프트웨어 스트리밍 서비스를 위한 확률 기반 다중 접근 블록 선인출 알고리즘)

  • Lee, Young-Jae;Park, Seon-Yeong;Pak, Eun-Jj;Lee, Dae-Woo;Jung, Wook;Kim, Jin-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.5_6
    • /
    • pp.238-248
    • /
    • 2007
  • As the demand of employing various PC software on mobile embedded devices which have limited storages has been increased, software streaming services are needed. However it takes too much time to launch software on them because it is transferred through wireless networks. To address this problem, prefetch algorithms are needed. We examined 'Last successor (LS)' algorithm and PPM-based prefetch algorithm as prefetch algorithms for software streaming services. We present 'Probability-base Multi Successor (PMS)' algorithm which is contrived through analyzing evaluations of previous algorithms and characteristics of software streaming services. While LS has one successor per each block, PMS has N successors based on probability which is calculated by PPM-based prefetch algorithm. The hit rate of PMS is similar to that of PPM-base prefetch algorithm and the space overhead is similar to that of LS. We can get good efficiency at the point of memory usage when PMS is applied to software streaming services.

Multi-Agent based Design of Autonomous UAVs for both Flocking and Formation Flight (새 떼 비행 및 대형비행을 위한 다중에이전트 기반 자율 UAV 설계)

  • Ha, Sun-ho;Chi, Sung-do
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.6
    • /
    • pp.521-528
    • /
    • 2017
  • Research on AI is essential to build a system with collective intelligence that allows a large number of UAVs to maintain their flight while carrying out various missions. A typical approach of AI includes 'top-down' approach, which is a rule-based logic reasoning method including expert system, and 'bottom-up approach' in which overall behavior is determined through partial interaction between simple objects such as artificial neural network and Flocking Algorithm. In the same study as the existing Flocking Algorithm, individuals can not perform individual tasks. In addition, studies such as UAV formation flight can not flexibly cope with problems caused by partial flight defects. In this paper, we propose organic integration between top - down approach and bottom - up approach through multi - agent system, and suggest a flight flight algorithm which can perform flexible mission through it.