• Journal of Korea Society of Digital Industry and Information Management
• /
• 제6권4호
• /
• pp.45-56
• /
• 2010

This paper suggests constraint data modeling based on constraint data presentation techniques to perform complex spatial database operation naturally. We were able to identify the limitation of extendibility of dimension and non-equal framework via relevant research for former schema of spatial database and query processing. Therefore we described generalized tuple of spatial data and the definition of suggested constraint data modeling. Also we selected MLPQ/PReSTO tool among constraint database prototype and compare standard functionality of ARC/VIEW. Then we design scenario for spatial operation using MLPQ/PReSTO and we suggested application effect after query processing. Based on above explanation, we were able to identify that we can process spatial data naturally and effectively using simple constraint routine on same framework via constraint data modeling.

• Journal of the Korean Association of Geographic Information Studies
• /
• 제12권1호
• /
• pp.81-95
• /
• 2009

The CDB(Constraint Database) model is a new paradigm for massive spatial data processing such as GIS(Geographic Information System). This paper will identify the limitation of the schema structure and query processing through prior spatial database research and suggest more efficient processing mechanism of constraint data model. We presented constraint model concept, presentation method, and the examples of query processing. Especially, we represented TIN (Triangulated Irregular Network) as a constraint data model which displays the height on a plane data and compared it with prior spatial data model. Finally, we identified that we were able to formalize spatial data in a simple and refined way through constraint data modeling.

• Journal of Korea Spatial Information System Society
• /
• 제11권1호
• /
• pp.79-86
• /
• 2009

The tuple of constraint database consists of constraint logical formula and it could process the presentation and query of the constraint database simply. Query operation processing shall include the constraint formula between related tuple such as selection, union, intersection of spatial data through the constraint database. However, this could produce the increasing of duplicated or unnecessary data. Hence, it will drive up the cost as per quality. This paper identified problems regarding query processing result in the constraint database. Also this paper suggested the tuple minimization summary method for result relation and analyzed the effects for efficient query processing. We were able to identify that the effectiveness of the query processing was enhanced by eliminating unnecessary constraint formula of constraint relation using the tuple minimization method.

• Journal of the Korean Data and Information Science Society
• /
• 제6권2호
• /
• pp.17-27
• /
• 1995

We propose a framework for representing and processing uncertain knowledge on the basis of constraint satisfaction. A system of equations and/or inequalities can be considered as a set of constraints that should be solved, and each constraint in the set is transformed into a corresponding logical formula which can be solved through a constraint solving program. Most of rule-based systems, for instance, use a simple probabilistic theory in order to maintain uncertain knowledge, therefore uncertain knowledge can be represented and processed in the constraint satisfaction program quite efficiently.

• Journal of Information Technology Applications and Management
• /
• 제23권2호
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Journal of the Chungcheong Mathematical Society
• /
• 제27권3호
• /
• pp.433-438
• /
• 2014

A semi-infinite optimization problem involving a quasi-convex objective function and infinitely many convex constraint functions with data uncertainty is considered. A surrogate duality theorem for the semi-infinite optimization problem is given under a closed and convex cone constraint qualification.

• Atmosphere
• /
• 제17권1호
• /
• pp.1-15
• /
• 2007

A constraint based on climatology is introduced to the cost function of the three-dimensional variational assimilation (3dVar) to correct the error of the zonal mean wind structure in the global data assimilation system at Korea Meteorological Administration (KMA). The revised cost function compels the analysis fit to the chosen climatology while keeping the balance between the variables in the course of analysis. The constraint varies selectively with the vertical level and the horizontal scale of the motion. The zonally averaged wind field from European Centre for Medium-Range Weather Forecasts Re-Analysis 40 (ERA-40) is used as a climatology field in the constraint. The constraint controls only the zonally averaged stratospheric long waves with total wave number less than 20 to fix the error of the large scale wind field in the stratosphere. The constrained 3dVar successfully suppresses the erroneous westerly in the stratospheric analysis promptly, and has been applied on the operational global 3dVar system at KMA.

• Journal of the Korean Home Economics Association
• /
• 제43권4호
• /
• pp.203-223
• /
• 2005

This study investigated the leisure constraints and leisure life satisfaction of the institutional elderly. The respondents were 302 elderly people residing in 5 free institutionalized elderly homes in Seoul. The data were analyzed by frequency analysis, factor analysis, One-way ANOVA, Duncan's post hoc test and regression analysis using SPSS WIN 12.0 program. Exploratory factor analysis revealed that the 10 items in the proposed scale could be grouped into four factors of constraint on leisure:'physical constraint','psychological constraint','interpersonal constraint', and 'structural constraint 'There were differences in leisure constraints according to sex, age, education degree, interaction with facility colleagues, and interaction with facility staff. There were differences in leisure life satisfaction according to sex, age, having religion or not, interaction with facility colleagues, interaction with facility staff and leisure constraints. Regression analysis results indicated that the main effective factors of leisure life satisfaction were leisure constraints.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.141-144
• /
• 2007

Given a number of training data, a traditional BPN is normally trained by minimizing the absolute difference between target outputs and approximate outputs. When BPN is used as a meta-model for inequality constraint function, approximate optimal solutions are sometimes actually infeasible in a case where they are active at the constraint boundary. The paper describes the development of the efficient BPN based meta-model that enhances the constraint feasibility of approximate optimal solution. The modified BPN based meta-model is obtained by including the decision condition between lower/upper bounds of a constraint and an approximate value. The proposed approach is verified through a simple mathematical function and a ten-bar planar truss problem.

• Asia Marketing Journal
• /
• 제18권4호
• /
• pp.125-138
• /
• 2017

The goal of the study is to understand how consumers' constraint as opposed to utility structure gives rise to final decision when consumers purchase more than one variant of product at a time, i.e., horizontal variety seeking or multiple-discreteness. Purchase and consumption decision not only produces utility but also involves some sort of cognitive pressure. Past consumption or last purchase is likely to be linked to this burden we face such as concern for obesity, risk of harm, and guilt for mischief. In this research, the existence and the role of dynamic constraint are investigated through a microeconomic utility model with multiple dynamic constraint. The model is applied to the salty snacks data collected from field study where burden for spiciness serves as a constraint. The results are compared to the conventional multiple discreteness choice models of static constraints, and policy implications on price discounts is explored. The major findings are that first, one would underestimate the level of consumer preference for product offerings when ignoring the carry-over of the concern from the past consumption, and second, the impact of price promotion on demand would be properly evaluated when the model allows for the role of constraint as both multiple and dynamic. The current study is different from the existing studies in two ways. First, it captures the effect of 'mental constraint' on demand in formal economic model. Second, unlike the state dependence well documented in the literature, the study proposes the notion of state dependence in different way, via constraint rather than utility.