• 한국언어정보학회지:언어와정보
• /
• 제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.

• 한국언어정보학회지:언어와정보
• /
• 제11권2호
• /
• pp.1-22
• /
• 2007

This paper examines tasi and tto, two Korean adverbs with roughly the same semantic value of again. It presents two empirical generalizations: (i) semantically tasi can mark the recovery of the original state, modifying an eventuality that is token-identical to a contextually-given eventuality, whereas tto is only limited to mark a simple repetition, thus modifying a type-identical event; (ii) functionally tasi can modify result states, but tto cannot. Then, it illustrates how the functional difference of result state modification can be accounted for by the notion of default events.

• 대한전자공학회논문지
• /
• 제25권9호
• /
• pp.1019-1026
• /
• 1988

A parametric detection scheme for determenistic signals is obtained in a generalized observation model which contains non-additive noise. The model employed in this paper includes several special cases such as those describing purely-additive noise, multiplicative noise, and signal dependent noise and allows the consideration of deterministic and random signals. Locally optimum detectors for known deterministic signals in the model are derived and analyzed for performance. It is shown that the locally optimum detectors are interesting generalizations of those for the purely-additive noise model. Performance of the locally optimum detectors designed for the generalized observation model is compared to that of other common detectors.

• Nuclear Engineering and Technology
• /
• 제4권4호
• /
• pp.294-300
• /
• 1972

메틸 클로로 및 플로로 훼메이트의 각종 구조에 대한 CNDO/2 및 INDO 계산을 실시하였다. 결과로 가장 안정한 구조는 할로겐 원자와 메틸기가 trans인 형 임을 알았다. 원자의 전하와 결합전자밀도를 볼 때 에텔 산소의 비공유 전자쌍의 공액과 칼보닐 산소와 메틸기 간의 정전기적인 상호작용으로 분자가 안정화되어 있음을 알 수 있었다. 쌍극자 모멘트는 trans의 값이 실험간에 가까우며 결합모멘트로 계산된 쌍극자 모멘트로 부터 일반적인 결론을 내리기 어려움을 밝혔다.

• 호남수학학술지
• /
• 제29권3호
• /
• pp.377-402
• /
• 2007

After the introduction of fuzzy sets by Zadeh, there have been a number of generalizations of this fundamental concept. The notion of intuitionistic fuzzy sets introduced by Aranassov is one among them. In this paper, we apply the concept of an intuitionistic fuzzy set to implicative ideals in BCK-algebras. The notion of an intuitionistic fuzzy implicative ideal of a BCK-algebra is introduced, and some related properties are investigated. An extension property for intuitionistic fuzzy implicative ideals is established. Characterizations of an intuitionistic fuzzy implicative ideal are given. Conditions for an intuitionistic fuzzy ideal to be an intuitionistic fuzzy implicative ideal are given. Using a collection of implicative ideals, intuitionistic fuzzy implicative ideals are established.

• 대한전자공학회논문지TC
• /
• 제44권1호
• /
• pp.132-137
• /
• 2007

재킷 변환은 단순한 계산과 용이한 역변환, 그리고 크기 유연성을 갖는 변환의 일종이다. 재킷 변환은 잘 알려진 월쉬-아다마르 변환(WHT)과 중앙 하중 아다마르 변환(CWHT)의 일반화로서 이전 연구에서 보고한 바 있다. 본 논문에서는 WHT 또는 CWHT에서 유도되지 않는 새로운 부류의 재킷 변환을 제시한다. 이러한 부류의 변환은 임의의 우수 길이를 갖는 벡터에 대해 적용할 수 있고, 유한체에 대해 응용할 수 있으며, 오류 정정 부호의 구성에서도 유용하다.

• Kyungpook Mathematical Journal
• /
• 제60권3호
• /
• pp.445-453
• /
• 2020

Let R be a commutative semiring with identity and M be a unitary R-semimodule. Let 𝜙 : 𝒮(M) → 𝒮(M) ∪ {∅} be a function, where 𝒮(M) is the set of all subsemimodules of M. A proper subsemimodule N of M is called 𝜙-prime subsemimodule, if r ∈ R and x ∈ M with rx ∈ N \𝜙(N) implies that r ∈ (N :_R M) or x ∈ N. So if we take 𝜙(N) = ∅ (resp., 𝜙(N) = {0}), a 𝜙-prime subsemimodule is prime (resp., weakly prime). In this article we study the properties of several generalizations of prime subsemimodules.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 춘계학술대회 학술발표 논문집
• /
• pp.34-37
• /
• 2001

Park et al. [Proc. KFIS Fall Conf. 10(2) (2000), 59-62] defined fuzzy ${\gamma}$-open sets by using an operation ${\gamma}$ on a fts (X, $\tau$) and investigated the related fuzzy topological properties of the associated fuzzy topology $\tau$/seb ${\gamma}$/ and $\tau$. As generalizations of the notion of fuzzy ${\gamma}$-closed sets, we define gf. ${\gamma}$-closed sets and g*f. ${\gamma}$-closed sets and study basic properties of these sets relative to union and intersection. Also, we introduce and study two classes of ftss called fuzzy ${\gamma}$-T* and fuzzy ${\gamma}$-T$_{1}$2/ spaces by using the notions of gf. ${\gamma}$-closed and g*f. ${\gamma}$-closed sets.

• 한국통신학회논문지
• /
• 제15권1호
• /
• pp.15-20
• /
• 1990

오랫동안 최소 제곱법에 바탕을 둔 선형 신호복원 방식이 연구되어 널리 쓰여 왔다. 그러나, 선형복원 방식은 실제로 처리해야 할 신호에 적합하지 않을 때가 자주 있다. 이러한 문제점을 풀기 위하여 비선형 신호복원 방식이 제안되었고, 이에 대한 연구가 활발히 진행중이다. 이 논문에서는 신호처리에 자주 쓰이는 여러 비선형 여파기들의 전반적인 성질을 간략히 되살펴 본다.

• Genomics & Informatics
• /
• 제9권1호
• /
• pp.5-11
• /
• 2011

Treating genomes just as languages raises the possibility of producing concise generalizations about information in biological sequences. Grammars used in this way would constitute a model of underlying biological processes or structures, and that grammars may, in fact, serve as an appropriate tool for theory formation. The increasing number of biological sequences that have been yielded further highlights a growing need for developing grammatical systems in bioinformatics. The intent of this review is therefore to list some bibliographic references regarding the recent progresses in the field of grammatical modeling of biological sequences. This review will also contain some sections to briefly introduce basic knowledge about formal language theory, such as the Chomsky hierarchy, for non-experts in computational linguistics, and to provide some helpful pointers to start a deeper investigation into this field.