• Journal of Information Technology Applications and Management
• /
• v.14 no.3
• /
• pp.49-77
• /
• 2007

Role-based access control (RBAC) models are recently receiving considerable attention as a generalized approach to access control. In line with the increase in applications that deal with spatial data. an advanced RBAC model whose entities and constraints depend on the characteristics of spatial data is required. Even if some approaches have been proposed for geographic information systems. most studies focus on the location of users instead of the characteristics of spatial data. In this paper. we extend the traditional RBAC model in order to deal with the characteristics of spatial data and propose new spatial constraints. We use the object-oriented modeling based on open GIS consortium geometric model to formalize spatial objects and spatial relations such as hierarchy relation and topology relation. As a result of the formalization for spatial relations. we present spatial constraints classified according to the characteristics of each relation. We demonstrate our extended-RBAC model called OOGIS-RBAC and spatial constraints through case studies. Finally. we compare our OOGIS-RBAC model and the DAC model in the management of access control to prove the efficiency of our model.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.183-187
• /
• 2003

In this paper, we describe an implementation method of "set constraints logic language" using the logic language Prolog. "Set constraints logic language" is a programming language with a new paradigm that uses the "set theory" in programming. In this paper, we explain "set constraints problem solver" that has been proposed by A. Dovier and his researchers and we describe an implementation method of this solver using Prolog. We ran easily implement the "set constraints problem solver" in Prolog, since Prolog easily implements nondeterministic problems and provides a data structure railed list. We have applied the language to several application fields to show the usefulness of the language.

• Korean Journal of English Language and Linguistics
• /
• v.3 no.4
• /
• pp.547-570
• /
• 2003

There are a fair number of suffixes in English whose conditions on attachment refer to stress and/or segmental information contained within the words they attach to (see Siegel 1974, Jespersen 1942 and Marchand 1969). Through a wide study of relevant data, we will delve deeply into such phonological restrictions on the bases, which may as well be divided into four distinct types: haplological constraints; segmental constraints; prosodic constraints; and mixed types. We will further assume here that the category/ subcategorization requirements of affixes are subject to the Projection Principle (PP) as conceived in Kiparsky (1983). It will be shown how this PP interacts with phonological constraints placed upon the affix in question, especially in the treatment of-ful (inventful/mournful) or -en (longen/lengthen). Our account of problematic affixations in English is based on a number of violable constraints in OT.

• Korean Journal of Human Ecology
• /
• v.18 no.1
• /
• pp.1-12
• /
• 2009

The purpose of this study is to find out leisure constraints of the elderly and to examine how these constraints influence their participation in leisure activities and life satisfaction. The data analysis of 291 senior citizens over 60 years old were conducted, the research results are as follows: first, leisure constraints of senior citizens stem from individual, societal, economic, family constraints. It indicates that anyone of constraints did not exclusively determine leisure constraints. Rather, the result implies that leisure constraints for the elderly is from multifaceted levels of social system. Second, participation in leisure activities positively worked on life satisfaction. Third, leisure constraints of the elderly directly influenced their participation in leisure activities and life satisfaction. In conclusion, to revitalize senior citizens' participation in leisure activities is critical in advancing their life satisfaction. Nationwide positive and supportive social environment for their leisure participation should be established first, on which social and legal systems should be consequently organized. At the same time, social supports to provide opportunities for their leisure participation are required for the future senior citizens.

• Journal of Families and Better Life
• /
• v.28 no.2
• /
• pp.27-37
• /
• 2010

The purpose of the study was to analyze the constraints that are normally experienced before moving in the context of the household characteristics of households that had recently moved to newly-built apartments. The data for the analysis was collected through a self-administered questionnaire from July 1, 2008 to August 10, 2008. The sample consisted of 251 households in Ulsan living in an apartment complex who had moved within a year. The data from the sample was analyzed by descriptive statistics, factor analysis, and analysis of variance with Duncan's multiple range tests. The results are as follows. The constraints were categorized into information gathering, attractive housing characteristics, expectations of residential mobility, housing development and policies, and resources. Overall, the constraints did not have a huge impact on the performance of the residential mobility of the sample households. Resources, however, were the most influential factors among the five constraints followed by attractive housing characteristics, information gathering, etc. The constraints varied based on the demographic characteristics, such as the household size, duration of marriage, age of the household head, and the socio-economic characteristics, such as the education level of the household head, household income, and the number of mobility. As the number of family members increased, the age of the household head went up, or the level of education went down, the constraints on information gathering were affected in terms of performing residential mobility. Households with a middle aged head with a professional occupation were more constrained by the attractive characteristics of the housing. The impact of the resources related constraints was significantly different based on the number of family members, marriage duration, and the household head's age and occupation, and the number of mobility.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.161-171
• /
• 2009

In this paper, we propose an automatic method for setting data constraints of a data cleansing service, which is for managing the quality of data exchanged between composite services based on SOA(Service-Oriented Architecture) and enables to minimize human intervention during the process. Because it is impossible to deal with all kinds of real-world data, we focus on business data (i.e. costumer order, order processing) which are frequently used in services such as CRM(Customer Relationship Management) and ERP(Enterprise Resource Planning). We first generate an extended-element vector by extending semantics of data exchanged between composite services and then build a rule-based system for setting data constraints automatically using the decision tree learning algorithm. We applied this rule-based system into the data cleansing service and showed the automation rate over 41% by learning data from multiple registered services in the field of business.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.212-215
• /
• 2002

In this paper, we present an intermediate representation CDFG(Control Data Flow Graph) and an efficient scheduling technique for low power circuit design. The proposed CDFG represents control flow, data dependency and such constraints as resource constraints and timing constraints. In the scheduling technique, the constraints are substituted by subgraphs, and then the number of subgraphs is minimized by using the inclusion and overlap relation efficiently. Also, iterative rescheduling process are performed in a minimum bound estimation, starting with the as soon as possible as scheduling result, so as to reduce the power consumption in low power design. The effectiveness of the proposed algorithm has been proven by the experiment with the benchmark examples.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.273-283
• /
• 2008

This article describes a cooperative localization technique of multiple robots sharing position information of each robot. In case of conventional methods such as EKF, they need to linearization process. Consequently, they are not able to guarantee that their result is range containing true value. In this paper, we propose a method to merge the data of redundant sensors based on constraints propagation techniques on intervals. The proposed method has a merit guaranteeing true value. Especially, we apply the constraints propagation technique fusing wheel encoders, a gyro, and an inexpensive GPS receiver. In addition, we utilize the correlation between GPS data in common workspace to improve localization performance for multiple robots. Simulation results show that proposed method improve considerably localization performance of multiple robots.

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

We present a method for 3D shape reconstruction of inextensible deformable surfaces from a single image. The key of our approach is to represent the surface as a 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which are designed to retain original lengths of mesh edges. We use a closed-form method to generate an initial structure, then refine this structure by solving the LP problem iteratively. Compared with previous methods, ours neither involves smoothness constraints nor temporal consistency, which enables us to recover shapes of surfaces with various deformations from a single image. The robustness and accuracy of our approach are evaluated quantitatively on synthetic data and qualitatively on real data.