• Journal of English Language & Literature
• /
• v.55 no.4
• /
• pp.719-744
• /
• 2009

This paper aims to reexamine Homorganic Cluster Lengthening in Late Old English whereby OE short vowels became lengthened before specific consonant clusters such as /-ld, -nd, -mb, -rd, -rð, -ng, -rz/. As for the motivation for this apparently odd-looking sound change, I propose that it was the result of phonologization of the phonetic lengthening of syllables containing resonants homorganic with a following voiced obstruent. Adopting Luick's (1898) view of "resonant+voiced homorganic obstruent" phonologically as a single coda, I show that Homorganic Cluster Lengthening is in fact a natural sound change that can be explained with the proper postulation of a few quantity-related universal constraints within the framework of the Optimality Theory. The fact that the constraints and their ranking as posited in this paper can also account for Pre-Cluster Shortening points to the validity of my approach in the analysis of other quantity changes in Middle English.

• Korean Journal of Remote Sensing
• /
• v.26 no.5
• /
• pp.593-603
• /
• 2010

Most spatial data acquisition systems employing a set of frame cameras may have suffered from their small fields of view and poor base-distance ratio. These limitations can be significantly reduced by employing an omni-directional camera that is capable of acquiring images in every direction. Bundle Block Adjustment (BBA) is one of the existing georeferencing methods to determine the exterior orientation parameters of two or more images. In this study, by extending the concept of the traditional BBA method, we attempt to develop a mathematical model of BBA for omni-directional images. The proposed mathematical model includes three main parts; observation equations based on the collinearity equations newly derived for omni-directional images, stochastic constraints imposed from GPS/INS data and GCPs. We also report the experimental results from the application of our proposed BBA to the real data obtained mainly in urban areas. With the different combinations of the constraints, we applied four different types of mathematical models. With the type where only GCPs are used as the constraints, the proposed BBA can provide the most accurate results, ${\pm}5cm$ of RMSE in the estimated ground point coordinates. In future, we plan to perform more sophisticated lens calibration for the omni-directional camera to improve the georeferencing accuracy of omni-directional images. These georeferenced omni-directional images can be effectively utilized for city modelling, particularly autonomous texture mapping for realistic street view.

• International Journal of Advanced Culture Technology
• /
• v.7 no.2
• /
• pp.168-178
• /
• 2019

In this paper I discuss a more complicated case of 'It'-Extraposition in English in the Optimality Theory [1] by further modifying and extending the analysis done in Khym (2018) [2] in which only the 'relatively' simple cases of 'It'-Extraposition such as 'CP-Predicate' was dealt with. I show in this paper that the constraints and the constraint hierarchy developed to explain the 'relatively' simple cases of 'It'-Extraposition are no longer valid for the more complicated cases of 'It'-Extraposition in configuration of 'CP-V-CP'. In doing so, I also discuss two important theoretic possibilities and suggest a new view to look at the 'It'-Extraposition: first, the long-bothering question of which syntactic approach between P&P (Chomsky 1985) [3] and MP (Chomsky 1992) [4] should be based on in projecting the full surface forms of candidates may boil down to just a simple issue of an intrinsic property of the Gen(erator). Second, the so-called 'It'- Extraposition phenomenon may not actually be a derived construction by the optional application of Extraposition operation. Rather, it could be just a representational construction produced by the simple application of 'It'-insertion after the structure projection with 'that-clause' at the post-verbal position. This observation may lead to elimination of one of the promising candidates of '$It_i{\ldots}[_{CP}that{\sim}]_i$' out of the computation table in Khym [2], and eventually to excluding the long-named 'It'-Extraposition case from Extrsposition phenomena itself. The final constraints and the constraint hierarchy that are explored are as follows: ${\bullet}$ Constraints: $^*SSF$, AHSubj, Subj., Min-D ${\bullet}$ Constraint Hierarchy: SSF<<>>Subj.>> AHSubj.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.209-214
• /
• 2004

This paper presents a RFM-based image matching algorithm which put constraints on the search space through the object-space approach. Also, the detail procedure of generating 3-D surface models from the RFM is introduced as an end-user point of view. The proposed algorithm provides the PML (Piecewise Matching Line) for image matching and reduces the search space to within the confined line-shape area.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.534-538
• /
• 1995

In this paper, a realization of a real-time train information system(TIS) is discussed. The requirements of TIS which satisfy real-time constraints are analyzed in view of data transfer. For efficient data communication in TIS, a new network system is suggested and its real-time characteristics are analyzed and compared with the standard network system. A local unit is designed based on VMEbus system.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.127-130
• /
• 2004

This paper describes the design and implementation of a SNMP Agent for NG-SDH transmission system. One of the most important items in SDH network management is the information model that implements every function of SDH equipment at network level. Although the TMN framework of SDH information model has been defined quite well, CMIP constraints of a real implementation urge vendors to implement proprietary features, and make it more difficult to maintain an integrated view of multivendor SDH networks management. To solve these aspects, this work proposes SNMP information model that allows a simple view of NG-SDH network management.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.397-410
• /
• 2007

Visualization of 2D and 3D data, which arises from some scientific phenomena, physical model or mathematical formula, in the form of curve or surface view is one of the important topics in Computer Graphics. The problem gets critically important when data possesses some inherent shape feature. For example, it may have positive feature in one instance and monotone in the other. This paper is concerned with the solution of similar problems when data has convex shape and its visualization is required to have similar inherent features to that of data. A rational cubic function [5] has been used for the review of visualization of 2D data. After that it has been generalized for the visualization of 3D data. Moreover, simple sufficient constraints are made on the free parameters in the description of rational bicubic functions to visualize the 3D convex data in the view of convex surfaces.

• KDI Journal of Economic Policy
• /
• v.43 no.4
• /
• pp.23-44
• /
• 2021

This research attempts to provide an in-depth analysis of the public perceptions of inter-Korean economic cooperation. KDI survey data with a sample size of 1,000 were subjected to empirical analyses. By means of ordered logit estimations, we derive the following results. First, there is a significant effect of age on economic cooperation perceptions, where younger generations tend to be more negative. Second, the group who has positive view on the economic cooperation tends to prefer large-scale, domestic-entity-funded cooperation projects, whereas the group who has negative view tends to prefer small-scale projects and projects funded by international organizations. According to these results, prioritizing trade with the involvement of international organizations is likely to be an effective measure to alleviate potential political constraints and to achieve sustainable long-run economic cooperation systems when pursuing the economic cooperation.

• Journal of KIISE:Databases
• /
• v.37 no.6
• /
• pp.333-342
• /
• 2010

Building ontology is the key factor to construct semantic web. However, this is time-consuming process. Hence, there are several approaches which automatically generate the ontologies from relational databases. Current studies on the automatic generation of the ontologies from relational database are focused on generating the ontology by analyzing the database schema and stored data. These studies generate the ontology by analyzing only tables and constraints in the schema and ignore view definitions. However, view definitions are defined by a database designer considering the domain of the database. Hence, by considering view definitions, additional classes and hierarchical relationships can be generated. And these are useful in answering queries and integration of ontologies. In this paper, we formalize the generation of classes and hierarchical relationships by analyzing existing methods, and we propose the method which generates additional classes and hierarchical relationships by analyzing view definitions. Finally, we analyze the generated ontology by applying our method to synthetic data and real-world data. We show that our method generates meaningful classes and hierarchical relationships using view definitions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3046-3070
• /
• 2017

Nowadays, the utilization of multiprocessor environments has been increased due to the increase in time complexity of application programs and decrease in hardware costs. In such architectures during the compilation step, each program is decomposed into the smaller and maybe dependent segments so-called tasks. Precedence constraints, required execution times of the tasks, and communication costs among them are modeled using a directed acyclic graph (DAG) named task-graph. All the tasks in the task-graph must be assigned to a predefined number of processors in such a way that the precedence constraints are preserved, and the program's completion time is minimized, and this is an NP-hard problem from the time-complexity point of view. The results obtained by different approaches are dominated by two major factors; first, which order of tasks should be selected (sequence subproblem), and second, how the selected sequence should be assigned to the processors (assigning subproblem). In this paper, a hybrid proposed approach has been presented, in which two different artificial ant colonies cooperate to solve the multiprocessor task-scheduling problem; one colony to tackle the sequence subproblem, and another to cope with assigning subproblem. The utilization of background knowledge about the problem (different priority measurements of the tasks) has made the proposed approach very robust and efficient. 125 different task-graphs with various shape parameters such as size, communication-to-computation ratio and parallelism have been utilized for a comprehensive evaluation of the proposed approach, and the results show its superiority versus the other conventional methods from the performance point of view.