• Language and Information
• /
• v.20 no.1
• /
• pp.93-110
• /
• 2016

VP-ellipsis constructions in English can be schematized as S + [NP finite-AUX __ ] where the underlined part is understood to be a VP. Similarly, the pattern S + NP[-to] can be observed in Korean colloquial contexts. Though the English VP-ellipsis sentence pattern and the Korean pattern superficially seem to be similar, the Korean pattern exhibits peculiar properties: Syntactically, the NP of the pattern should have the delimiter -to. Semantically, it may convey ambiguous readings: VP-ellipsis-like and/or Stripping-like interpretation. To account for the pattern at issue, we propose a base-generated analysis driven by the delimiter -to within a construction grammar. We claim that the mother of the NP[-to] in this pattern is an S whose meaning is ambiguous between a VP-ellipsis-like and a Stripping-like reading. Consequently, the code of the VP-ellipsis in English is finite auxiliary verbs while that of the pattern S + NP[-to] in Korean is the delimiter -to.

• Language and Information
• /
• v.3 no.2
• /
• pp.85-96
• /
• 1999

This paper deals with questions involving the polysemous meanings of Korean delimiter to, which include existence of a sister item, polar values, emphasis, reciprocality, and concession among others. In this paper it is argued that the basic meaning of to is the implication of a sister proposition and that various other meanings can be pragmatically derived from the basic meaning. The pragmatic notion of emphasis is defined formally and it is shown that various meanings of to can be accounted for by investigating how the speaker exploits the background knowledge which the speaker and the listener share in a speech context. According to what type of the context is made use of by the speaker, the various polysemous meanings are analyzed as involving either a simple implicature or a series of implicatures, i.e., scalar implicatures, so the various meanings of the delimiter can be attributable to the different attunement of the speaker to different kinds of context.

• Language and Information
• /
• v.6 no.2
• /
• pp.15-32
• /
• 2002

These analyses can be roughly classified into two groups: the first argue that the delimiter -to is polysemous so that it delivers either additive or concessive meaning; the second contend that it is monosemous and only conveys emphatic or concessive meaning. The current analysis mainly focuses on its two roles with regard to focus and its meaning. On the basis of the findings, a different analysis is proposed that it serves as an indicator of the presence of a type of focus which is hosted mainly by the expression it attaches to. Furthermore, it is solely responsible for the additive force, and the seemingly relevant emphatic or concessive import is derivable from an emphatic or concessive illocutionary operator which is associated with the focus indicated by -to.

• Annual Conference on Human and Language Technology
• /
• 2022.10a
• /
• pp.35-40
• /
• 2022

본 논문에서는 시퀀스 레이블링 문제(sequence labeling problem)인 개체명 인식에 사용할 새로운 태깅 포맷인 Delimiter tag (D-tag)를 소개한다. 시퀀스 레이블링 문제에서 사용하는 BIO-tag 포맷은 개체명 레이블을 B (beginning)와 I (inside) 의미의 레이블로 확장하여 타겟 클래스의 수가 2배 증가한다. 또한 BIO-tag 포맷을 사용할 경우, 모델이 B와 I 를 잘못 분류하는 문제가 발생하며, 레이블 수가 많은 세부 분류 개체명의 경우에는 label confusion을 야기한다. 본 논문에서 제안한 D-tag 포맷은 타겟 클래스의 수를 증가시키지 않기 때문에 앞서 언급한 문제를 해결할 수 있다. 실험 결과, D-tag를 사용하여 학습한 모델이 BIO-tag를 사용한 경우보다 더 좋은 성능을 보여, 유망함을 확인하였다.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.300-309
• /
• 2015

In IEEE 802.11n WLANs(Wireless Local Area Networks), to support high throughput, MAC(Media Access Control) layer adopts A-MSDU(Aggregate-MAC Service Data Unit) and A-MPDU(Aggregate-MAC Protocol Data Unit). Generally, as the A-MPDU uses a selective retransmission capability, A-MPDU provides higher throughput than A-MSDU. However, although A-MPDU uses the selective re-transmission capability, if the size of MPDU within A-MPDU is smaller than the size of minimum MPDU starting spacing, A-MPDU can reduce throughput because of the overhead of retransmission owing to the addition of delimiter, that is a dummy MPDU. Therefore, to overcome the above problem, two-level Aggregation method, where the small MPDU within A-MPDU is replaced by not delimiter but A-MSDU, has been introduced. In the two-level Aggregation method, the existing re-transmission scheme retransmits only A-MPDU, but if the size of retransmission data is smaller than the size of the minimum MPDU starting spacing, the proposed retransmission scheme retransmits the aggregated retransmission data and MSDUs. Therefore, we know that the proposed retransmission scheme have better throughput that the existing retransmission scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.626-633
• /
• 2009

ISO/IEC/WD 24753 defines new modem specifications for a long-range RFID communications and application protocol for a sensor tag system. According to the standard, the frequency offset of the tag is 4%. In general wireless communications systems, it is known that a coherent receiver is superior to a non-coherent receiver. However, if the frequency offset is large, it is difficult to restore the original data accurately with a coherent receiver, and the performance of a coherent receiver is easily degraded. In this paper, a non-coherent receiver structure is adopted to solve the frequency offset problem of long-range RFID communications. We designed a frequency estimation block to find an optimal frequency from the received signal with 4% frequency offset and proposed a start frame delimiter (SFD) detection algorithm to determine the start position of the payload. The frequency estimation block finds the optimal frequency from the received signal using 9-correlators. And the SFD detection block searches the received signal to find the start position of the payload with dual correlator. We implemented a long-range RFID reader with the proposed methods and evaluated its performance in a wired/wireless test network. The implemented long-range RFID reader showed more superior performance than the commercial RFID reader in terms of recognition range.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.129-132
• /
• 2000

버퍼넘침(buffer overflow)은 특정 프로그램 언어에서 발생하는 배열의 경계파괴 현상을 말한다. 그 대표적인 언어로서 C/C++을 들 수 있는데. 이들 언어는 기본적으로 스트링(문자열)을 정의함에 있어서 크기속성을 배제하고 끝을 의미하는 종료문자(delimiter character. NULL)를 사용함으로써 배열(버퍼)의 경계침범 가능성을 허용하고 있다. 이 때 스택영역에 할당된 버퍼가 넘친다면, 주변에 위치한 지역변수, 레지스터 보관, 복귀주소 둥의 값이 변질되어 원래의 의도된 제어흐름을 보장할 수 없게 된다. 특히 복귀주소 부분을 의도적으로 침범하여 특정 값을 덮어쓸 수 있다면 해당 프로그램의 동작을 인위적으로, 그리고 자유롭게 변경할 수 있게 된다. 본 논문에서는 이와 같은 스택영역에서의 버퍼넘침을 사용한 제어흐름 변경 해킹기법의 과정을 현존하는 UNIX 시스템 및 C/C++ 언어를 이용하여 살펴보고 대응방향을 모색한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.653-655
• /
• 2000

버퍼넘침(buffer overflow)은 특정 프로그램 언어에서 발생하는 배열의 경계파괴 현상을 말한다. 그 대표적인 언어로서 C/C++을 들 수 있는데, 이들 언어는 기본적으로 스트링(문자열)을 정의함에 있어서 크기속성을 배제하고 끝을 의미하는 종료문자(delimiter character, NULL)을 사용함으로써 배열(버퍼)의 경계침범 가능성을 허용하고 있다. 이때 스택영역에 할당된 버퍼가 넘침다면, 주변에 위치한 지역변수, 레지스터 보관, 복귀주소 등의 값이 변질되어 원래의 의도된 제어흐름을 보장할 수 없게 된다. 특히 복귀주소 부분을 의도적으로 침범하여 특정 값을 덮어쓸 수 있다면 해당 프로그램의 동작을 인위적으로, 그리고 자유롭게 변경할 수 있게 된다. 본 논문에서는 이와 같은 스택영역에서의 버퍼넘침을 사용한 제어흐름 변경 해킹기법의 과정을 현존하는 UNIX 시스템 및 C/C++ 언어를 이용하여 살펴보고 대응방향을 모색한다.

• Journal of the Korean Society for information Management
• /
• v.8 no.1
• /
• pp.16-32
• /
• 1991

This paper described the general concept of shared cataloging system and discussed the KORMARC format in the view of shared cataloging system format, including control number, copy statement, holdings statement, modifying information, transcribing MARC, character code of cataloging, nonfiling characters, delimiter codes, report number processing.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.376-386
• /
• 2004

In ad hoc networks, loss-based congestion window progression by the traditional means of duplicate ACKs and timeouts causes high network buffer utilization due to large bursts of data, thereby degrading network bandwidth utilization. Moreover, network-oriented feedbacks to handle route disconnection events may impair packet forwarding capability by adding to MAC layer congestion and also dissipate considerable network resources at reluctant intermediate nodes. Here, we propose a new TCP scheme that does not require the participation of intermediate nodes. It is a purely end-to-end scheme using TCP timestamps to deduce link conditions. It also eliminates spurious reductions of the transmission window in cases of timeouts and fast retransmits. The scheme incorporates a receiver-oriented rate controller (rater), and a congestion window delimiter for the 802.11 MAC protocol. In addition, the transient nature of medium availability due to medium contention during the connection time is addressed by a freezing timer (freezer) at the receiver, which freezes the sender whenever heavy contention is perceived. Finally, the sender-end is modified to comply with the receiver-end enhancements, as an optional deployment. Simulation studies show that our modification of TCP for ad hoc networks offers outstanding performance in terms of goodput, as well as throughput.