• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.249-255
• /
• 2007

In general, a large amount of the memory accesses are required for the CAVLC decoding in H.264/AVC. It is a serious problem for the applications such as a DMB and videophone services because the considerable power is consumed for accessing the memory. In order to solve this problem, we propose an efficient decoding method for the coeff-token which is one of the syntax elements of CAVLC. In this paper, the variable length code table is re-designed with the new codewords which are defined by investigating the architecture of the conventional codeword for the coeff_token element. A new coeff_token decoding method is developed based on the suggested table. The simulation results show that the proposed algorithm achieves an approximately 85% memory access saving without video-quality degradation, compared to the conventional CAVLC decoding.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.826-836
• /
• 2010

This paper proposes a hybrid machine translation system which integrates SMT, RBMT, and PBMT in serial manner. SMT in our project has been implemented as a Quasi-syntax-based system where monotone search is done, given a preprocessed string of foreign language. Preprocessing includes rule-based reordering, NE recognition, clausal splitting, and attaching pattern translation information at the end of the input text. For lengthy & complex sentences, clausal splitting turned out to generate better translation than normal input.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.3
• /
• pp.13-23
• /
• 2010

The revised 7th education course of information implies that students use variety of information devices to solve the common problems and it also includes the programming education for improving problem-solving abilities. Not only improving problem-solving abilities but also developing thinking skill is expected in programming education. However, traditional programming education is teacher-oriented and focused on language syntax. Accordingly, students have heavy cognitive load and it decrease students' interest of programming. Therefore, in this paper, a instructional method of programming using educational robot is proposed to improve interest of elementary students in concretive operation stage for effectiveness of programming education. Additionally, results of experiments show that proposed robot programming instructional method can be applied in elementary education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1058-1065
• /
• 2006

In this paper, we propose a new motion vector coding algorithm suitable for MPEG-4 Part 10 video coding standard. In the proposed algorithm, the amount of the motion for a given video sequence is Predicted by using a characteristic of the motion vector distribution for the neighboring blocks as well as the MB_type, which is the syntax element in the standard. And one of the independent coding and the combined coding methods is adaptively employed to compress the motion vector difference. Simulation results show that the proposed algorithm outperforms the conventional methods without additional memory and calculations.

• Language and Information
• /
• v.8 no.2
• /
• pp.73-91
• /
• 2004

The nominative and accusative postpositions in Korean may intervene between the negative auxiliary verb ANH and its complement verb phrase. As Korean is an OV language, this means that 'verb + {nom, acc} + ANH' as well as the simpler concatenation 'verb + ANH' is possible. This fact, together with an overwhelming regularity of these postpositions' optionality in virtually all constructions, poses a problem for formal approaches to the syntax of the language. Working in a constraint-based grammatical framework shaped by such works as Sag and Wasow (1999) and Copestake (2002), we put forth type hierarchies for major_class, which represents verb inflection, and for pos, which has two immediate subtypes, i.e., htrp_pos and ord_pos. What we call the 'half transparency' of the case postpositions separates them from all the other lexical items in the language. The type htrp_pos is used to constrain one of the two newly proposed head_comp_rules, where a newly proposed feature HEAD2 of a phrase inherits its value from the HEAD feature of the head word. The COMPS list of the negative auxiliary ANH is seen as containing a single phrase whose HEAD is a kind of nominal clause and whose HEAD2 is something that is one of the three maximal types: acc, nom, and null.

• ETRI Journal
• /
• v.23 no.2
• /
• pp.41-51
• /
• 2001

MPEG-7 standardization work has started with the aims of providing fundamental tools for describing multimedia contents. MPEG-7 defines the syntax and semantics of descriptors and description schemes so that they may be used as fundamental tools for multimedia content description. In this paper, we introduce a texture based image description and retrieval method, which is adopted as the homogeneous texture descriptor in the visual part of the MPEG-7 final committee draft. The current MPEG-7 homogeneous texture descriptor consists of the mean, the standard deviation value of an image, energy, and energy deviation values of Fourier transform of the image. These are extracted from partitioned frequency channels based on the human visual system (HVS). For reliable extraction of the texture descriptor, Radon transformation is employed. This is suitable for HVS behavior. We also introduce various matching methods; for example, intensity-invariant, rotation-invariant and/or scale-invariant matching. This technique retrieves relevant texture images when the user gives a querying texture image. In order to show the promising performance of the texture descriptor, we take the experimental results with the MPEG-7 test sets. Experimental results show that the MPEG-7 texture descriptor gives an efficient and effective retrieval rate. Furthermore, it gives fast feature extraction time for constructing the texture descriptor.

• Language and Information
• /
• v.13 no.1
• /
• pp.127-143
• /
• 2009

Tough-construction is, undoubtedly, one of the most puzzling syntactic problems in the history of transformational grammar. Various approaches have been proposed including Deletion approaches (Akmajian, 1972; Lasnik and Fiengo, 1974) and movement approaches. Among the movement approaches, Chomsky (1977; 1981) argues for movement of null Operator, and Hornstein (2001) argues for a two-step movement equipped with Sideward movement. Most recently, Schueler (2004) and Hartman (2009) each have also argued for a kind of movement approach. With the development of the Minimalist syntax (Chomsky, 1995; Chomsky, 2000; Chomsky, 2001), tough-construction, an age old problem in the description of grammar, turns into another round toward to a more satisfactory answer. By examining the most recent competing analyses of tough-constructions, this paper defends and extends Schueler's (2004) analysis, rather than Hartman's (2009) two step movement approach. Furthermore, this paper proposes that tough-subject originates from the intermediate CP internal Spec-TopicP position rather than from the iterated CP layer (Authier, 1992). This approach has more descriptive power than it was originally argued for in Schueler (2004) and is a step closer toward Minimalism insofar as the conception of government is no longer utilized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1937-1947
• /
• 1996

In the case of developing the real-time system using object-oriented method, k the problem of the timing constraints is certainly considered. we propose the method of modeling the object-oriented real-time system using the OMT methodology and the SDL. And we also present the predictable time table that reflects the constraints of real-time system into dynamic model of OMTs and the predicatable time formula of the sequence, repeat, and parallel routine. The proposed method is applied to the estimate of the maximum process time of the ATMs(Automatic teller machines) and is used to specifying the functional specification for the user interface of the ATMs using the SDL syntax and the object interaction graph.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.242-247
• /
• 2008

This paper discusses a design for Korean language parsing based on subcategorization. First, we discuss some important Korean grammar elements such as syntax category, josa, omi-conjugation, syntactic affix, dependent noun and also discuss subcategorization and expression patterns. Then, we show the basic structure of Korean language parsing process. The first stage scans the input sentence and processes article, noun phrase, numeral, josa, affix, dependent noun, adjective, omi-conjugation, adverb, auxiliary verb. The second stage deals with subcategorization patterns and expression patterns. The third stage processes the clauses and the fourth stage deals with SEA(Sentence Ending+Auxiliary).

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.10
• /
• pp.33-43
• /
• 2018

In this paper, we propose a method to automatically generate the description of an RDF graph structure. The description is expressed in Shape Expression Language (ShEx), which is developed by W3C and provides the syntax for describing the structure of RDF data. The RDF graphs to which this method can be applied are limited to those generated by the direct mapping, which is an algorithm for transforming relational data into RDF by W3C. A relational database consists of its schema including integrity constraints and its instance data. While the instance data can have been published in RDF by some standard methods such as the direct mapping, the translation of the schema has been missing so far. Unlike the users on relational databases, the ones on RDF datasets were forced to write repeated vague SPARQL queries over the datasets to acquire the exact results. This is because the schema for RDF data has not been provided to the users. The ShEx documents generated by our method can be referred as the schema on writing SPARQL queries. They also can validate data on RDF graph update operations with ShEx validators. In other words, they can work as the integrity constraints in relational databases.