• Speech Sciences
• /
• v.8 no.1
• /
• pp.53-66
• /
• 2001

This paper aims to investigate the acoustic characteristics of the vowels attested in Korean and French and to seek a way of understanding them from a phonological point of view. We first compare the two vowel systems by measuring the actual frequencies of the formants using CSL. It is shown that the first and second formants vary in wider range in French compared to Korean. In order to understand the two vowel systems from a phonological point of view, we apply the theory of Licensing Constraints, proposed and developed by Kaye (1994), and Charette and Kaye (1994). We propose the licensing constraints placed upon the vowels both in Korean and French. For Korean, we propose the licensing constraints such that both elements I and U must be heads. For French, we claim the following licensing constraints: U in a headed expression must be head, A cannot be head, and Nothing can only license an expression A in it.

• Language and Information
• /
• v.6 no.1
• /
• pp.41-69
• /
• 2002

This paper addresses the issue of constraints on the conversion of the participle II in German, proposing a constraint-based lexical semantic approach. I argue against the widely accepted syntactic view which is based on the dichotomous distinction of intransitive verbs, which has been advanced by the Unaccusative Hypothesis [Perlmutter (1978)]. Several arguments are also given against the semantic view which is based on some aspectual notions such as 'telicity', 'transformativity' or 'terminativity'. The crucial constraints on the conversion of the participle II in German, it is argued, is instead two lexical semantic entailments, movement with a definite change of location and affectedness. These and other lexical semantic entailments in the sense of Dowty (1991) are encoded into the multiple inheritance type hierarchy of qfpsoa. The proposal made in this paper is based on the multiple inheritance hierarchy which is envisaged in a recent framework of head-driven Phrase Structure Grammar.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.82-89
• /
• 2021

Recently, applications are increasing the importance of security for published documents. This paper deals with data-publishing where the publishers must state sensitive information that they need to protect. If a document containing such sensitive information is accidentally posted, users can use common-sense reasoning to infer unauthorized information. In recent studied of peer-to-peer databases, studies on the security of data of various unique groups are conducted. In this paper, we propose a security framework that fundamentally blocks user inference about sensitive information that may be leaked by XML constraints and prevents sensitive information from leaking from general user. The proposed framework protects sensitive information disclosed through encryption technology. Moreover, the proposed framework is query view security without any three types of XML constraints. As a result of the experiment, the proposed framework has mathematically proved a way to prevent leakage of user information through data inference more than the existing method.

• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.4
• /
• pp.719-728
• /
• 2017

This paper proposes a synthesis of new guidance law to generate an evasive maneuver against enemy's missile interception while considering its impact angle, acceleration, and field-of-view constraints. The first component of the synthesis is a new function of repulsive Artificial Potential Field to generate the evasive maneuver as a real-time dynamic obstacle avoidance. The terminal impact angle and terminal acceleration constraints compliance are based on Time-to-Go Polynomial Guidance as the second component. The last component is the Logarithmic Barrier Function to satisfy the field-of-view limitation constraint by compensating the excessive total acceleration command. These three components are synthesized into a new guidance law, which involves three design parameter gains. Parameter study and numerical simulations are delivered to demonstrate the performance of the proposed repulsive function and guidance law. Finally, the guidance law simulations effectively achieve the zero terminal miss distance, while satisfying an evasive maneuver against intercept missile, considering impact angle, acceleration, and field-of-view limitation constraints simultaneously.

• Journal of Astronomy and Space Sciences
• /
• v.21 no.3
• /
• pp.209-220
• /
• 2004

Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.

• Proceedings of the KIEE Conference
• /
• 2001.10a
• /
• pp.21-23
• /
• 2001

A design and analysis program is proposed for switched reluctance motor using an analytical method and a CAD program LabVIEW. The algorithm uses conventional permeance method, in which flux linkages, inductances and torques are calculated numerically. In order to analyze a dynamic characteristics of the motor, voltage control scheme is fallen and a single pulse operation is applied. 2 SRM models are analyzed under the given specifications and constraints. The results compared with measured data.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1353-1355
• /
• 2003

Genetic algorithms (GA) is a well known technique that is capable of handling multiobjective functions and discrete constraints in the process of numerical optimization. Together with the Pareto ranking scheme, more than one possible solution can be obtained despite the imposed constraints and multi-criteria design functions. In view of this unique capability, the design of the log-periodic dipole antenna array (LPDA) using this special feature is proposed in this paper. This method also provides gain, front-back level and S parameter design tradeoff for the LPDA design in broadband application at no extra computational cost.

• Journal of Computing Science and Engineering
• /
• v.1 no.1
• /
• pp.95-123
• /
• 2007

Existing systems that support semistructured views do not maintain semantics during the process of designing the views. Thus, these systems do not guarantee the validity and reversibility of the views. In this paper, we propose an approach to address the issue of valid and reversible semistructured views, We design a set of view operators for designing semistructured views. These operators are select, drop, join and swap. For each operator, we develop a complete set of rules to maintain the semantics of the views. In particular, we maintain the evolution and integrity of relationships once an operator is applied. We also examine the reversible view problem under our operators and develop rules to guarantee that the designed views are reversible. Finally, we examine the changes in the participation constraints of relationship types during the view design process, and develop rules to ensure the correctness of the participation constraints.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.87-102
• /
• 1994

Conceptual database design is an important activity because the performance of a DBMS heavily depends on the proper design of the database, and view integration is one of the most important phases of conceptual database design. During this phase, the individual views designed by separate user groups are integrated into a global view for the entire system. After the view integration, a database schema must be validated before it becomes a stable product of the design. In this paper, a methodology for view integration an validation is suggested. The individual views are modeled by entity-relationship model. The entities are integrated according to their name and domain information. After that, the relationships are merged by their constraints. We also present a methodology for checking redundant relationships which has an algorithmic description.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.667-672
• /
• 2001

An optimization approach is used to partition the field of view. A cost function is defined to represent the constraints on the solution, which is then mapped onto a two-dimensional Hopfield neural network for minimization. Each neuron in the network represents a possible match between a field of view and one or multiple objects. Partition is achieved by initializing each neuron that represents a possible match and then allowing the network to settle down into a stable state. The network uses the initial inputs and the compatibility measures between a field of view and one or multiple objects to find a stable state.