Evaluation of a new sutureless neurorrhaphy technique using human amniotic membrane cuff and n-Butyl-2-cyanoacrylate in sprague-dawley rats : comparison with the conventional neurorrhaphy

학위논문(박사)--서울대학교 대학원 :의학과 성형외과학전공,2006.Docto

A Study on Implementation of Ada Compiler

Ada프로그래밍 언어에 대한 컴파일러의 구성시 컴파일러의 여러 단계 중에서 기억장소의 할당에 대한 문제, 특히 프로그램의 실행중 기억장소에 기억시켜야 한 데이타 형식의 표현방법, 그리고 변수의 표현방법에 대한 문제가 야기된다. Ada언어의 데이타 형식 사용방법에 의하면 일부 데이타 종속형식에 대한 정보는 실행중에야 결정할 수 있게 되어 있는데, 이러한 종속형식 정보는 프로그램 실행중에 기억장소에 기억시켜 놓아야 하며, 이러한 데이타 형식의 변화는 결과적으로 변수에 대한 기억장소의 할당에도 영향을 미치게 되다. 본 논문에서는 이러한 Ada언어의 데이타 형식에 대한 개념을 기억장소내에 효과적으로 표현하는 방법을 취급하였다.When we are implementing an storage allocation phase during construction of an Ada compiler, the problem of representation for Ada types and variables in caused. The type and subtype facilities of the Ada programming language permit some subtype information to be determined dynamically. This subtype information requires a runtime representation, and its dynamic nature influences the representation of variables. This paper presents a representation for Ada types and variables.When we are implementing an storage allocation phase during construction of an Ada compiler, the problem of representation for Ada types and variables in caused. The type and subtype facilities of the Ada programming language permit some subtype information to be determined dynamically. This subtype information requires a runtime representation, and its dynamic nature influences the representation of variables. This paper presents a representation for Ada types and variables

가토에서의 자가근막이식 및 자가근막판의 조직형태학적인 변화에 대한 연구

학위논문(석사)--서울대학교 대학원 :의학과 성형외과학전공,1998.Maste

On Object-Based Software Process programming Languages

소프트웨어 프로세스는 사용자의 요구사항을 수행되는 소프트웨어로 실현시키는데 필요한 소프트웨어의 생산 및 유지보수와 같은 복잡한 소프트웨어공학 활동이다. 지난 몇 년동안, 소프트웨어 프로세스 기법에 대하여 많은 연구가 이루어졌다. 특히, 소프트웨어 프로세스를 언어의 형태로 기술하는 프로세스 프로그래밍 언어에 대부분 상당한 관심을 기울여 왔다. 본 논문에서는 객체기반 프로세스 프로그래밍 언어의 주요한 특성에 대하여 조사하고 분석한다. 또한 이러한 프로세스 프로그래밍 언어를 서로 비교하고, 프로세스 프로그래밍에 필요한 언어 구조의 방향에 대해 제안한다.A software process is complex software engineering activities such as software production and maintenance, needed to realize a user's requirements into functioning software.. Over the last several years, there has been a lot of research on software process technology. In particular, much of the research concerns process programming languages, which describe software processes in linguistic form. In this paper, we examine and analyze the characteristics of major object-based process programming languages. Also, we compare those process programming languages, suggesting a direction to desirable language constructs for process programming.A software process is complex software engineering activities such as software production and maintenance, needed to realize a user's requirements into functioning software.. Over the last several years, there has been a lot of research on software process technology. In particular, much of the research concerns process programming languages, which describe software processes in linguistic form. In this paper, we examine and analyze the characteristics of major object-based process programming languages. Also, we compare those process programming languages, suggesting a direction to desirable language constructs for process programming

Grammatical Description of the Behavior of LR(k) Parsers

임의의 문맥자유문법이 주어졌을 때 이 문법에 대한 LR(k) 파서의 동작을 문법기호를 이용하여 추상적으로 묘사할 수 있다는 것을 밝혔다. 이를 위하여, 임의의 입력문장을 처리하기 위한 LR(k) 파서의 동작 과정을 자신의 문법문장으로 표현할 수 있는 새로운 LR(k) 기계묘사문법을 제안하였다.We show that given a context-free grammar G. the behavior of the LR(k) parser for G can be abstractly described in terms of grammar symbols. For this, we introduce an LR(k) machine description grammar whose sentences describe the sequences of actions taken by a given LR(k) parser.We show that given a context-free grammar G. the behavior of the LR(k) parser for G can be abstractly described in terms of grammar symbols. For this, we introduce an LR(k) machine description grammar whose sentences describe the sequences of actions taken by a given LR(k) parser

미상 적응 채널 등화를 위한 통계학적인 접근

학위논문(박사) - 한국과학기술원 : 전기및전자공학과, 1997.2, [ xi, 124 p. ]In the performance of digital communication systems, a fundamental limiting factor is the intersymbol interference(ISI) caused by bandlimiting or by frequency selective fading as, for example, in telephone or digital microwave radio channel. Removal of ISI is usually accomplished by use of adaptive equalizer at receiver. Conventionally, the adaptive equalization is initiated by sending a training sequence which helps the equalizer adapt to the unknown channel characteristics. Unlike the conventional adaptive equalization schemes, the blind equalization algorithms solely draw upon the received sequence and a priori knowledge of the statistics of the transmitted sequence. This dissertation presents statistical approaches to the blind equalizations in digital communication channels. There has been an increasing interest in applying the higher-order (higher than two) statistics to the blind equalization because the higher-order statistics not only reveal amplitude information about a process, but also reveal phase information while the second-order statistics (i.e., correlations) are phase blind. Basically, these approaches are accounted for the minimization of the cost functions defined by the necessary (higher-order) statistics of the transmitted, received, or equalizer output sequence for the blind equalizations. The problems considered in this dissertation are the designs of the cost function for the blind equalization, their optimization via the stochastic gradient method, and convergence analysis of the proposed algorithms. The contributions of this dissertation are (i) Convergence analysis of FIR (finite impulse response) CMA (constant modulus algorithm) blind equalizers, (ii)Initialization scheme of FIR CMA blind equalizers,(iii)Blind equalization via the higher-order statistics, and (iv) Blind equalization via absolute mean. In Chapters 2 and 3, the convergence properties and initialization of FIR CMA equalizers are analyzed. In Chapter 4, new blind iden...한국과학기술원 : 전기및전자공학과

Error Repair for Omittable Special terminal Symbols

본 논문에서는 프로그램 작성시 주어진 투수 터미널 심볼의 생략 가능성을 분류하기 위한 형식론을 제안한다. 제안된 방법을 만족하는 문법의 경우, 생략된 심볼의 어휘 분석단계(lexical analysis phase)나 구문분석단계(syntax analysis phase)와 같은 컴파일하는 각 단계에서 보정할 수 있게 한다. 그리고, 제시된 방법에 근거하여, 각 컴파일 단계에서 복구할 수 있는 심볼이 포함된 프로그래밍 언어들의 특성을 논의한다. 또한, 제안된 방법론을 실제 구현하였으며 Ada나 Modula-2와 같은 주요 프로그래밍 언어들에 적용하였다. 이들 언어들에 대해서는 심볼을 생략함으로써 야기되는 오류를 만족할만하게 보정해 준다. 제안된 방법을 적용하기 어려운 프로그래밍 언어들에 대한 특성 또한 논의되었다.This paper presents a formalism for classifying the possibility of omitting a given special terminal symbol when writing programs. For the grammars satisfying the proposed formalism, the formalism enables to repair the symbol during phases of compilation such as lexical analysis or syntax analysis. Based on the method, this paper also discusses the characteristics of programming languages in which the symbol is repaired during such phases. The method was implemented and applied to major programming languages such as Ada and Modula-2, repairing satisfactorily the errors caused by omitting the symbol. In addition, the characteristics of the programming languages to which the presented method is hardly applicable, are discussed.This paper presents a formalism for classifying the possibility of omitting a given special terminal symbol when writing programs. For the grammars satisfying the proposed formalism, the formalism enables to repair the symbol during phases of compilation such as lexical analysis or syntax analysis. Based on the method, this paper also discusses the characteristics of programming languages in which the symbol is repaired during such phases. The method was implemented and applied to major programming languages such as Ada and Modula-2, repairing satisfactorily the errors caused by omitting the symbol. In addition, the characteristics of the programming languages to which the presented method is hardly applicable, are discussed

Supporting SR Runtime Environment with POSIX Threads

병행성은 컴퓨터 시스템에서 주요한 추상화중의 하나이다. 이러한 병행성은 하드웨어의 디자인과 오퍼레이션, 운영체제, 다중프로세서, 분산계산, 실시간시스템, 프로그래밍 언어와 시스템의 디자인 수단으로 사용되어왔다. 운영체제 서비스에 대하여 응용 프로그램들의 원시코드 이식성을 제공하기 위하여 최근 몇년동안 운영체제에 대한 응용 프로그램 인터페이스를 위한 일련의 표준화 작업으로 IEEE의 운영 체제 기술 협의회는 POSIX를 개발해오고 있다. POSIX 쓰레드 확장에 관한 표준안은 운영체제 서비스가 하나의 프로세스내에서 제어의 다중 쓰레드를 생성하고 수행하는 것을 지원하는 응용 프로그램 인터페이스를 지원한다. 우리는 이러한 POSIX 쓰레드를 사용하여 SR 언어의 실행지원 시스템을 새로이 설계 및 구현한다. 개발된 실행지원 시스템의 이식성은 POIX 쓰레드를 지원하는 시스템들 사이에서 자연스럽게 보장된다. 주어진 컴퓨터 시스템에 대하여 이 새로운 실행지원 시스템의 성능은 그 시스템에서의 POSIX 쓰레드 자체의 구현에 대한 질에 좌우된다. 특히 그 시스템이 많은 프로세서를 가지고 이러한 프로세스들을 효과적으로 지원하도록 POSIX 쓰레드가 구현되었을때 이 새로운 실행지원 시스템은 매우 유용하게 된다.Concurrency is one of the key abstractions in Computer System. It has relevance to hardware design and operation, operating systems, multiprocessor and distributed computation, real-time systems, programming languages and system design methods. To provide source code portability of operating system services for application programs, POSIX is being developed for the recent several years by the IEEE Technical Committee on Operating System as a family of standards for application program interface to an operating system. The draft standard POSIX Threads Extension provides an application program interface to operating system services supporting the creation and execution of multiple threads of control within a single process. Using this POSIX Threads, we present a new design and implementation of the runtime support system of SR. Naturally, the portability of the runtime support system developed is guaranteed between the systems supporting POSIX Threads. For a given system, the performance of the new runtime support system depends on the quality of the implementation of POSIX Threads for the system. In particular, when the system has a lot of processors and the implementation of POSIX Threads utilizes those processors effectively, the new runtime support system is very useful.Concurrency is one of the key abstractions in Computer System. It has relevance to hardware design and operation, operating systems, multiprocessor and distributed computation, real-time systems, programming languages and system design methods. To provide source code portability of operating system services for application programs, POSIX is being developed for the recent several years by the IEEE Technical Committee on Operating System as a family of standards for application program interface to an operating system. The draft standard POSIX Threads Extension provides an application program interface to operating system services supporting the creation and execution of multiple threads of control within a single process. Using this POSIX Threads, we present a new design and implementation of the runtime support system of SR. Naturally, the portability of the runtime support system developed is guaranteed between the systems supporting POSIX Threads. For a given system, the performance of the new runtime support system depends on the quality of the implementation of POSIX Threads for the system. In particular, when the system has a lot of processors and the implementation of POSIX Threads utilizes those processors effectively, the new runtime support system is very useful