• Language and Information
• /
• v.9 no.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.

• Language and Information
• /
• v.7 no.2
• /
• pp.59-79
• /
• 2003

Coordination in natural language is often syntactically explained by the rule schema X \longrightarrow X′ and X", where X′ and X" refer to expressions of a like syntactic type. While this schema does explain a lot of instances of coordination, it is well known that this schema also gives rise to serious structural ambiguity, leading not only to numerous unintended interpretations but also to a high degree of unnecessary computational complexity. In order to identify intended interpretations, we need to take into account a number of clues at all the levels of morphology, syntax, semantics, and pragmatics/discourse. In this paper, we propose, with an accompanying data analysis, principles of symmetry and coherency for an effective and reasonable identification of intended interpretations from coordination-bearing sentences.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.339-352
• /
• 2009

There are a number of formal methods for distributed real-time systems in ubiquitous computing to analyze and verify the behavioral, temporal and the spatial properties of the systems. However most of the methods reveal structural and fundamental limitations of complexity due to mixture of spatial and behavioral representations. Further temporal specification makes the complexity more complicate. In order to overcome the limitations, this paper presents a new formal method, called Timed Calculus of Abstract Real-Time Distribution, Mobility and Interaction(t-CARDMI). t-CARDMI separates spatial representation from behavioral representation to simplify the complexity. Further temporal specification is permitted only in the behavioral representation to make the complexity less complicate. The distinctive features of the temporal properties in t-CARDMI include waiting time, execution time, deadline, timeout action, periodic action, etc. both in movement and interaction behaviors. For analysis and verification of spatial and temporal properties of the systems in specification, t-CARDMI presents Timed Action Graph (TAG), where the spatial and temporal properties are visually represented in a two-dimensional diagram with the pictorial distribution of movements and interactions. t-CARDMI can be considered to be one of the most innovative formal methods in distributed real-time systems in ubiquitous computing to specify, analyze and verify the spatial, behavioral and the temporal properties of the systems very efficiently and effectively. The paper presents the formal syntax and semantics of t-CARDMI with a tool, called SAVE, for a ubiquitous healthcare application.

• Journal of KIBIM
• /
• v.5 no.3
• /
• pp.41-50
• /
• 2015

Increasing size and complexity of indoor structures have led to much more complication in the spatial cognition and situational awareness. Contrary to outdoor environments, occupants have limited information regarding the indoor space syntax in terms of architectural and semantic information as well as how they interact with their surroundings. The availability of such information could give conveniences to both users and managers in various aspects. In order to visualize the exact location of rooms and utilities in 3D, many studies and projects have utilized BIM models because of its promising value of representing building components. In fact, the application of BIM provides definitive spatial indoor data and creates services for indoor space management and navigation. Therefore, this paper aims to provide an overview of practices on BIM-based indoor spatial information implementation and location-based services. It is expected that enabling of technologies, data-rich content and accessibility of information products will accelerate the growth of the spatially-related markets in various fields.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.462-464
• /
• 2010

Logistic of port to use electronic document handling and trade electronic document EDI is used. Thus, EDI electronic documents system is electronic document processing system can handle. and the user wants to convert document formats, or extract the desired information the user should be able to use. Conversion of existing EDI documents and document conversion systems used in mapping the complexity of the grammar of the script, and it is difficult to use the operator. In this paper, efficient processing of EDI documents to electronic mapping of the existing operators in the grammar syntax to create an easy to use, more efficiency, increase operational management of EDI electronic document processing system is designed.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1281-1293
• /
• 1996

In this paper, we propose a novel recognition model of on-line cursive Korean characters using HMM(Hidden Markov Model) and level building algorithm. The model is constructed as a form of recognition network with HMM for graphemes and Korean combination rules. Though the network is so flexible as to accomodate variability of input patterns, it has a problem of recognition speed caused by 11, 172 search paths. To settle the problem, we modify the level building algorithm to be adapted directly to the Korean combination rules and apply it to the model. The modified algorithm is efficient network search procedure time complexity of which depends on the number of HMMs for each grapheme, not the number of paths in the extensive recognition network. A test with 15, 000 hand written characters shows recognition rat 90% and speed of 0.72 second per character.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.1029-1039
• /
• 2012

In this papar, we propose a new motion estimation and coding technique using adaptive motion vector resolution. Currently, HEVC encodes a video using 1/4 motion vector resolution. If there are high texture regions in a picture, HEVC can't get a performance enough. So, we insert additional 1-bit flag meaning whether motion vector resolution is 1/4 or 1/8 in PU syntax. Therefore, decoder can recognize the transmitted motion vector resolution. Experimental results show that maximum coding efficiency gain of the proposed method is up to 5.3% in luminance and 7.9% in chrominance. Average computional time complexity is increased about 33% in encoder and up to 5% in decoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.262-271
• /
• 2004

There are channel errors when video data are transmitted between encoder and decoder. These channel errors would make decoded image incorrect, so it is very important to detect and recover channel errors. This paper proposes a method of error detection and recovery by hiding specific information into video bitstream using fragile watermark and checking it later. The proposed method requires no additional bits into compressed bitstream since it embeds a user-specific data pattern in the least significant bits of LEVELs in VLC codewords. The decoder can extract the information to check whether the received bitstream has an error or not. We also propose to use this method to embed essential data such as motion vectors that can be used for error recovery. The proposed method can detect corrupted MBs that usually escape the conventional syntax-based error detection scheme. This proposed method is quite simple and of low complexity. So the method can be applied to multimedia communication system in low bitrate wireless channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1387-1394
• /
• 2015

Along with the development of network transmission technology, the IPTV market is growing in fast pace. Additionally the UHD resolution broadcasting system along with user experience (UX) that provides better service to user has attracted attention recently since there are not enough research has been done with differentiated the UX that can enhance the UX yet. Therefore we proposed a low complexity syntax level image stitching implementation technique that run with multi-view services, which makes possibility to view multiple channel or video contents on the screen at the same time. Simulation results have demonstrated the liability and effectiveness of the proposed algorithm by showing that capability of generating more than 80 frames per second by stitching four Full-HD size videos into UHD frame.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.64-73
• /
• 2008

In this paper, we propose a novel objective video quality assessment method from encoded H.264/AVC.. Conventional algorithms have been proposed to assess video/image quality with image frames reconstructed in a decoder side. On the other hand, the proposed assessment is conducted with the syntax elements which are embedded in a bitstream. The proposed BS-based algorithm makes use of the statistics of boundary strength(BS) which are employed in the H.264/AVC. The proposed algorithm has lower computational complexity than conventional methods, EPSNR and Blockiness, resulting that it can accomplish assessment of the video quality in real time. Furthermore, the accuracy of the proposed video quality assessment is about 32% and 65% better than several conventional algorithms.