RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
        • 주제분류
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • 압축과 암호화 결합시스템 구현

        강도균(Kang Do Kyun),성낙운(Seong Nak Un) 한국정보과학회 1994 한국정보과학회 학술발표논문집 Vol.21 No.1

        정보화 사회와 더불어 정보통신의 수용 급증으로 안전하면서도 경제적인 데이타 통신을 위한 요구가 꾸준히 연구되어왔다. 이와 같은 요구사항을 만족할 수 있도록 본 논문에서는 데이타통신 비용을 절약하고 허가 되지 않은자에 의한 도청을 방지하는 방법을 제시하였다. 압축암호화 결합시스템은 화일 압축으로 인하여 자료 송수신 비용 및 저장공간을 절약할 수 있었다. 기존 LZW코딩 방법을 이용한 압축 암호화 결합시스템에서는 압축열 전체를 암호화함으로써 암호화 비용면에서 제안방법보다 효율이 떨어졌고, 일부분만 암호화하는 시스템에서는 등록된 스트링 판단을 위해 1비트를 삽입함으로써 큰 화일에서는 압축률이 상당히 떨어졌다. 제안 시스템에서는 압축된 화일중에서도 일부분(단일문자)만을 암호화함으로써 암호화 비용을 절약할 수 있었고 단일문자 구분을 위해서 삽입되는 구분자도 암호화함으로써 암호화 강도에서도 상당한 효과를 얻었다.

      • 선박 의장 배치 설계 검증을 위한 시스템 개발 사례

        성낙운,노재정,전진영 경성대학교 공학기술연구소 1998 공학기술연구지 Vol.5 No.-

        The purpose of this study is to develop a system for the inspection of the outfitting arrangement design of for a ship design, which will increase the reliability and the efficiency of the inspection process. The system is composed of four major modules; material inspection module at the pipe piece level, material inspection module at the service level, tank-penetrating pipe piece inspection module, and the basic information management module. This system is integrated with a ORACLE database, for transferring and storing 3D CAD data into the inspection system, and a dVISE virtual reality system, for displaying the inspection results.

      • 실시간 시스템에서의 효율적 태스크 스케쥴링 알고리즘

        성낙운,최정만 慶星大學校 1996 論文集 Vol.17 No.4

        We survey the responsive scheduling for the set of preemptive aperiodic tasks in a uniprocessor. REDF(Responsive Earliest Deadline First) algorithm is optimal in a fixed mode to obtain the maxmal responsiveness, but not optimal in the replace mode. We propose RLLF(Reponsive least laxity First) algorithm that has the same time complexity, but has more responsiveness than REDF algorithm in a replace mode.

      • 데이타 플로우 시스템의 화일 처리에서의 병렬효과

        성낙운,김명순 경성대학교 1989 論文集 Vol.10 No.1

        In order to realize very high performance computers, many people demand a new computer system, It is called to be the data flow computer that is no concept of global updatable memory and memory counter different from conventional Von Neumann type computers in structure. To provide storage for large volume of information and allow sharing of information files must be used in the data flow system. A file is regarded as stream stored in the external device separated from the data flow file system and data flow fill system provides an interface to the data flow system. To enhance file concurrency, new data flow window concepts are proposed, it is provided to reduce the data movement overheads between the data flow system and the external environment. Macro and overlapped windows are also used to reduce oveheads when external files are accessed from the data flow system.

      • 분산 공유 메모리의 동기화 기법

        성낙운,정성희 慶星大學校 1998 論文集 Vol.19 No.1

        We examine the principles of memory coherence algorithms; central- server, migration, read- replication, full-replication, adaptive algorithm, for DSM(Distributed Shared Memory ) system, An adaptive algorithm has better performance than others in DSM system. In this paper , we propose a new memory coherence algorithm that adapts dynamically one of algorithms, migration algorithm, read-many algorithm and write-many algorithm, to an adaptive algorithm according to the number of copies of a page which are occurred by the adaptive by the access patterns in application. Here, without user annotations, compiler supports, an special hardwares, All are adapted.

      • 분산 공유 메모리 시스템의 설계

        성낙운,조민규 慶星大學校 1998 論文集 Vol.19 No.2

        Much work has been done on DSM(Distributed Shared Memory) system, which has the programming advantages of shared memory and the cost advantages of distributed memory. We survey the key issues of DSM system and describe the design of DSM, which has been designed for more flexibility and adaptability.

      • 하이퍼큐브에서 불안정 큐브 개념을 이용한 고장 허용 라우팅

        성낙운,조성배 慶星大學校 1994 論文集 Vol.15 No.2

        Multiprocessor systems have been researched due to the need of high performance computers and the development of VLSI technology. The objective of this thesis is to present an improved fault tolerant routing algorithm such that one processor can communicate with others though some of processors of the hypercube computer may be faulty. We propose the algorithm that is fault-tolerable using the information of the state of neighbor node and the number of fault of unsafe neighbor node in hypercubes with the arbitrary number of fault nodes.

      • 블럭 수준에서의 가변길이 토큰 처리기

        성낙운 慶星大學校 1990 論文集 Vol.11 No.3

        Most data flow systems assume a token as a single entity and flow actor at a machine language level. A VLT(Variable Length Token) is a token set and is taken as a unit of processing. The VLT technigue reduces the synchronization and communication overhead. Especially VLT concept with a block level provides a mechanism to control the communication overhead and improve the efficiency of the data flow system.

      • 선박의장 배치 설계의 검도를 위한 컴퓨터 지원 시스템의 개발 사례

        노재정,조형석,전진영,성낙운 경성대학교 공학기술연구소 1999 공학기술연구지 Vol.6 No.-

        The purpose of this study is to develop a computer support system for the inspection of the outfitting arrangement of a ship design, which will increase the accuracy and the effectiveness of the inspection process. This system is integrated with a ORACLE database for transferring and storing 3D CAD data into the inspection system, and a dVISE virtual reality system for displaying the attributes of entities and the inspection results.

      • 데이타 플로우 시스템에서 구조형 데이타의 설계

        성낙운 慶星大學校 1990 論文集 Vol.11 No.2

        In data flow computers and instruction is executed as soon as all its operands are available. An array is considered as a single entity. If an instruction changes even one element, a new array has to be created copying the old array with the appropriate element changed. Many structures that avoid unnecessary copying have been proposed but they expense the increased access time. We propose the processing unit that handles the structured data by both copying and sharing.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼