• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.359-366
• /
• 2010

The purpose of this study is to examine the influence of the leisure constraint of a private security guard on his/her task stress and life satisfaction. The subjects of this study were chosen among the private security guards working in Seoul based private security firms in 2009, and by going through judgement sampling, 300 cases were applied in the final analysis. Collected data went through factor analysis, reliability analysis, regression analysis, and path analysis by using SPSSWIN 17.0. In reference with the reliability of the questionnaire, Cronbach's $\alpha$ was over .600. The conclusion of this study is as following. Firstly, the leisure constraint of a private security guard affects his/her task stress. In other words, when peripheral and individual constraint increase, task stress is intensified, while task stress winds down when interpersonal constraint decreases. Secondly, the leisure constraint of a private security guard affects life satisfaction. That is, when individual constraint goes down, life satisfaction is improved. Thirdly, the task stress of a private security guard affects life satisfaction. when compensation and career development increase, life satisfaction rises. On the other hand when task characteristic is weakened, life satisfaction gets lower. Fourthly, the leisure constraint of a private security guard has a causal influence on task stress and life satisfaction. Accordingly, it becomes apparent that the task stress is a significant variable which intermediates the relation between leisure constraint and life satisfaction.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.10 no.5
• /
• pp.408-417
• /
• 2005

Increasing numbers of value added chemicals are being produced using microbial fermentation strategies. Computational modeling and simulation of microbial metabolism is rapidly becoming an enabling technology that is driving a new paradigm to accelerate the bioprocess development cycle. In particular, constraint-based modeling and the development of genome-scale models of industrial microbes are finding increasing utility across many phases of the bioprocess development workflow. Herein, we review and discuss the requirements and trends in the industrial application of this technology as we build toward integrated computational/experimental platforms for bioprocess engineering. Specifically we cover the following topics: (1) genome-scale models as genetically and biochemically consistent representations of metabolic networks; (2) the ability of these models to predict, assess, and interpret metabolic physiology and flux states of metabolism; (3) the model-guided integrative analysis of high throughput 'omics' data; (4) the reconciliation and analysis of on- and off-line fermentation data as well as flux tracing data; (5) model-aided strain design strategies and the integration of calculated biotransformation routes; and (6) control and optimization of the fermentation processes. Collectively, constraint-based modeling strategies are impacting the iterative characterization of metabolic flux states throughout the bioprocess development cycle, while also driving metabolic engineering strategies and fermentation optimization.

• Proceedings of the CALSEC Conference
• /
• 2004.02a
• /
• pp.318-326
• /
• 2004

The ebXML (Electronic Business using eXtensible Markup Language) Specification Schema is to provide nominal set of specification elements necessary to specify a collaboration between business partners based on XML. As a part of ebXML Specification Schema, BPSS (Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPSS is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification is insufficient to specify formal semantic constraints of modeling elements completely. In this study, we propose a classification schema for the BPSS semantic constraints and describe how to represent those semantic constraints formally using OCL (Object Constraint Language). As a way to verify a Business Process Specification (BPS) with the formal semantic constraint modeling, we suggest a rule-based approach to represent the formal constraints and to use the rule-based constraints specification to verify BPSs in a CLIPS prototype implementation.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.822-828
• /
• 2002

Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1591-1596
• /
• 1991

The present paper describes a method of recognizing a polyhedron employing the notion of network constraint analysis. Typical difficulties in three-dimensional object recognition, other than shading, reflection, and hidden line problems, include the case where appearances of an object vary according to observation points and the case where an object to be recognized is occluded by other objects placed in its front, resulting in incomplete information on the object shape. These difficulties can, however, be solved to a large extent, by taking account of certain local constraints defined on a polyhedral shape. The present paper assumes a model-based vision employing an appearance-oriented model of a polyhedron which is provided by placing it at the origin of a large sphere and observing it from various positions on the surface of the sphere. The model is actually represented by the sets of adjacent faces pairs of the polyhedron observed from those positions. Since the shape of a projected face gives constraint to that of its adjacent face, this results in a local constraint relation between these faces. Each projected face of an unknown polyhedron on an acquired image is examined its match with those faces in the model, producing network constraint relations between faces in the image and faces in the model. Taking adjacency of faces into consideration, these network constraint relations are analyzed. And if the analysis finally provides a solution telling existence of one to one match of the faces between the unknown polyhedron and the model, the unknown polyhedron is understood to be one of those memorized models placed in a certain posture. In the performed experiment, a polyhedron was observed from 320 regularly arranged points on a sphere to provide its appearance model and a polyhedron with arbitrarily postured, occluded, or imposed another difficulty was successfully recognized.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.2
• /
• pp.165-171
• /
• 2013

Due to the difficulty in considering dynamic load in the view point of a computer resource and computing time, it is common that external load is assumed as ideal static loads. However, structural analysis under static load cannot guarantee the safety of design of the structures under dynamic loadings. Recently, the systematic method to construct equivalent static load from the given dynamic load has been proposed. Previous study has calculated equivalent static load through the optimization procedure under displacement constraints. However, previously reported works to distribute equivalent static load were based on ad-hoc methods. Improper selection of equivalent static loading positions may results in unreliable prediction of structural design. The present study proposes the selection method of the proper locations of equivalent static loads to dynamically applied loads when we consider transient dynamic structural problems. Moreover, it is appropriate to take into account the stress constraint as well as displacement constraint condition for the safety design. But the previously reported studies of equivalent static load design methods considered only displacement constraint conditions but not stress constraint conditions. In the present study we consider not only displacement constraint but also stress constraint conditions. Through a few numerical examples, the efficiency and reliability of proposed scheme is verified by comparison of the equivalent stress between equivalent static loading and dynamic loading.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.24 no.5
• /
• pp.543-551
• /
• 2011

The paper deals with the comparative study of design optimization based on various approximation techniques in strength design of riser support structure installed on floating production storage and offloading unit(FPSO) using offshore operation loading conditions. The design optimization problem is formulated such that structural member sizing variables are determined by minimizing the weight of riser support structure subject to the constraints of structural strength in terms of loading conditions. The approximation techniques used in the comparative study are response surface method based sequential approximate optimization(RBSAO), Kriging based sequential approximate optimization(KBSAO), and the enhanced moving least squares method(MLSM) based approximate optimization such as CF(constraint feasible)-MLSM and Post-MLSM. Commercial process integration and design optimization(PIDO) tools are employed for the applications of RBSAO and KBSAO. The enhanced MLSM based approximate optimization techniques are newly developed to ensure the constraint feasibility. In the context of numerical performances such as design solution and computational cost, the solution results from approximate techniques based design optimization are compared to actual non-approximate design optimization.

• Korean Management Science Review
• /
• v.25 no.1
• /
• pp.43-53
• /
• 2008

This paper considers a profit-based unit commitment problem with fuel consumption constraint and maintenance cost, which is one of the key decision problems in electricity industry. The nature of non-linearity inherent in the constraints and objective functions makes the problem intractable which have led many researches to focus on Lagrangian based heuristics. To solve the problem more effectively, we propose mixed integer programming based solution algorithm linearizing the complex non-linear constraints and objectives functions. The computational experiments using the real-world operation data taken from a domestic electricity power generator show that the proposed algorithm solves the given problem effectively.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.410-417
• /
• 2002

We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.