• 한국언어정보학회지:언어와정보
• /
• 제14권1호
• /
• pp.25-48
• /
• 2010

The distinction of argument and adjunct has been an important notion in linguistic theories, especially at the interface of syntax and semantics, and this distinction has been believed to be binary and categorical. However, there are some gray-area cases such as instruments and participant locations, for which the distinction does not appear to be so clear. In this paper, I will explore whether the argument/adjunct distinction is categorical by examining the controversial cases, particularly the instrumental PPs. I will review the syntactic, semantic, and psychological criteria and evidence that have been proposed in literature and see if instruments can be categorized as either arguments or adjuncts by those criteria. By showing that different criteria yield contradictory results, I conclude that roles like instruments have characteristics of both arguments and adjuncts, which seems to suggest that the argument/adjunct distinction is not categorical.

• 한국언어정보학회지:언어와정보
• /
• 제13권1호
• /
• pp.57-75
• /
• 2009

English floating quantifiers (FQ) are both limited and complex in the sense that they are introduced by a limited set of words, all, both, and each, and display free distributional possibilities. This paper provides a non-movement approach to the syntax of English floating quantifier constructions. The non-movement analysis we develop here is different from stranding movement analyses in that all the FQs are base-generated while the linkage with their antecedent refers to grammatical features such as SUBJ and PRD. The analysis avoids the postulation of abstract levels as well as empty elements in capturing the flexibility of English FQ constructions, making the grammar of English simpler.

• 한국전자거래학회지
• /
• 제3권2호
• /
• pp.141-160
• /
• 1998

In order to achieve a successful introduction of CALS, an enterprise model which is a concise description of what an enterprise does is required. The enterprise model mainly consists of a process model and a data model. The process model describes processes that create, change, combine, or destroy the entities within the enterprise. Several process modeling methodologies have been proposed. Each modeling methodology requires its own modeling view point, elements, and syntax. In developing a process model for CALS, these models created at different view points are required to analyze and design a system in a broad view. This paper aims at proposing an integration methodology for a process model. Specifically, IDEF0, IDEF3, and Petri Net are considered to be integrated. An IDEF0 model describing static functions of enterprise is transformed to an IDEF3 model describing behaviour of a system with additional information. Also, the IDEF3 model is transformed to a Petri Net model. These transformations will be automatically accomplished once the additional information for the transformation is provided.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2003년도 추계종합학술대회
• /
• pp.552-554
• /
• 2003

Recently, many kinds of XML based application services are widely used in internet. And the markets for mathml editor are needed for the technology combined with other text editor. We are developing a system for MathML based browser and editor for the service of internet application. MathML based browser is applicable for e-book service and many kinds of document system. This system is composed of document editing module and displaying processing module. This system isfor the processing of MathML tag by unexperienced users with MathML syntax. Users can edit the math tag's documentwith ease and efficiently. Based on XML, many parser's functions are optimized for the speed of document processing. This system ran afford to the development of internet world.

• 한국통신학회논문지
• /
• 제24권12A호
• /
• pp.1891-1898
• /
• 1999

Traditional syntax-oriented serializability notions are considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in distributed database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of oncurrency and average transaction waiting time.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 추계학술발표대회 및 정기총회
• /
• pp.23-26
• /
• 2005

XML이 발표되면서 대용량의 XML을 효과적으로 관리하는 여러 가지 방법들이 연구되고 있다. 특히 지금까지 상업적, 기술적으로 성공적이고 안정된 데이터 모델인 관계형 데이터베이스를 활용하는 여러 가지 방법들이 연구되고 있다. 본 논문은 관계형 DBMS를 사용하여 XML 질의어인 XQuery를 SQL로 변환하여 처리하는 효율적인 방법을 제안한다. 우선 본 논문에서 제안하는 방식은 XML문서를 분할하여 관계형 테이블에 저장하는 분할방식을 사용하며, 분할된 관계형 테이블을 이용하여 XPath를 포함한 XQuery의 기능을 실행하는 SQL을 생성하여 관계형 DBMS에서 SQL을 실행하는 방식을 사용한다. 제안한 XQuery 처리방식은 먼저 XQuery의 구문 분석을 통하여 AST(Abstract Syntax Tree)를 생성하고, AST를 순회하면서 SQL문장을 생성한다. 생성된 SQL문장은 XML 문서의 경로를 사용함으로써 XQuery 연산의 조인 횟수를 감소시키며, 각 노드마다 부여된 순서 정보를 효과적으로 사용하여 문서의 원래 순서에 맞는 XML 부분을 생성하는 방법을 제시한다. 그리고 실제 제안된 시스템을 개발하여 그 성능을 평가한다.

• 한국언어정보학회지:언어와정보
• /
• 제20권1호
• /
• pp.1-24
• /
• 2016

Korean is well-known for its topic-prominent properties. In this paper, we look into several subtypes of topic constructions whose grammatical complexities have received much attention in generative grammar. From a semantic/pragmatic view, topics in Korean can be classified into three different types: aboutness, contrastive, and scene-setting. Meanwhile, syntax can classify topic constructions into two types, depending on whether or not the comment clause following topic has a syntactic gap linked to the topic. In this paper, we review some key properties of these topic constructions in Korean, and suggest that each type is licensed by tight interactions between syntactic and semantic constraints. In particular, the paper tries to offer a Construction Grammar analysis where each grammatical component is interacting in non-modular ways and in which the multiple inheritance network of constructions plays an important role in capturing cross-cutting generalizations of the topic constructions.

• 한국언어정보학회지:언어와정보
• /
• 제9권2호
• /
• pp.107-126
• /
• 2005

The impersonal or psyc-predicate construction in Old English (=OE) poses a special challenge for most case theories in generative linguistics. In the OE impersonal construction, the experiencer argument is marked by dative, accusative, or nominative, whereas the theme is marked by nominative, genitive, or accusative, or by a PP. The combinations of possible cases for experiencer and theme are not random, bringing about daunting complexity for possible and impossible case frames. In this paper, I develop a conceptual semantic case theory (a la Jackendoff 1990, 1997, 2002; Yip, Maling, and Jackendoff 1987) to provide a unified account for the complicated case frames of the OE impersonal construction. In the conceptual semantic case theory, syntax and semantics have their own independent case assignment principles. For impersonal verbs in OE, I propose that UG leave an option of determining either syntactic or semantic case to lexical items. This proposal opens a new window for the OE impersonal construction, in that it naturally explains both possible and impossible case frames of the construction.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 봄 학술발표논문집 Vol.27 No.1 (A)
• /
• pp.525-527
• /
• 2000

본 논문에서는 최근 객체지향 설계에 많이 사용되고 있는 UML 다이아그램들의 일관성과 완전성을 해결하기 위하여 UML 의 각 다이아그램을 ER 모델로 표현하고, 각 다이아 그램에 대한 공통된 표현으로 통합된 ER 다이아그램을 제공하며 일련의 집합과 함수들을 사용하여 정형적으로 명세한 다음 이러한 정형 명세를 기반으로하여 일관성을 완전성 검사를 수행하기 위한 규칙을 제공한다. 이 규칙은 다이아그램의 구문(syntax)과 의미(semantic)에 대하여 모두 검사할 수 있게 하기 위하여 구문 완전성, 구문 일관성, 의미 완전성, 의미 일관성으로 나누어 생성한다. 이렇게 생성된 규칙들은 추후 CASE 도구에 포함되어 다이아그래밍의 일관성 및 완전성을 검사할 수 있는 CASE 도구로 발전할 수 있게 된다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 봄 학술발표논문집 Vol.27 No.1 (A)
• /
• pp.71-73
• /
• 2000

본 논문에서 다루는 SGML 문서편집기는 파서를 내포하는 구조로서, 문서편집을 위하여 DTD 가 입력되고, 입력된 DTD 는 DTD 파서에 의해 적합성을 점검하게 된다. DTD 파서는 표준규칙에 따라 DTD를 파싱하고, 결과를 편집처리에 적합한 BNF-스타일 형태로 변환된 문법 테이블을 생성한다. SGML 문서 편집은 문법테이블 정보에 따라 처리된다. 문법 테이블의 크기는 엘리먼트 선언내용 중 컨텐트 모델의 표현에 따라 결정된다. 그 중 and(&) 접속자는 엘리먼트 개수에 따라 문법수가 기하급수적으로 증가하므로 DTD 파서에 의해 처리된다면 속도나 비용면에서 비효율적이다. 이에 본 논문에서는 고정된 문법테이블을 이용하는 SGML 편집기에 and 접속자로 표현된 엘리먼트 문법을 동적으로 확정 처리할 수 있는 기능이 추가 향상된 구문지향적 SGML 문서편집기를 제시한다. 그러므로 향상된 구문지향 SGML 문서편집기는 고정된 문법을 이용한 문서편집 뿐 아니라 편집처리에 따른 변환에 능동적으로 처리할 수 있다는 특징을 갖게된다.