• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.416-425
• /
• 1999

복잡한 무결성 제약 조건을 효율적으로 확인하기 위해 제약 조건들을 룰 베이스(rule base)에 저장하고 별도의 룰 관리 시스템과 제약 조건 관리 시스템을 통해 제약 조건을 확인하는 기법이 많은 연구자들에 의해 연구되고 발표되었다. 그러나 제약 조건 관리 시스템이 실행시간에 응용 프로그램을 항상 모니터링하고 있다가 데이타의 수정이 요청될 때마다 개입하여 프로세스를 중단시키고 관련 제약 조건을 확인하는 기존의 방법들은 처리 시간의 지연을 피할 수 없다. 본 논문은 컴파일 시간에 제약 조건 확인 코드를 응용 프로그램에 미리 삽입할 것을 제안한다. 응용 프로그램 자체 내에 제약 조건 확인 코드가 삽입되기 때문에 실행 시간에 다른 시스템의 제어를 받지 않고 직접 제약 조건의 확인 및 데이타베이스의 접근이 가능해져서 처리 시간의 지연을 피할 수 있을 것이다. 이를 위해 어떤 구문이 제약 조건의 확인을 유발하는 지를 추적하였고, 컴파일러가 그러한 구문을 어떻게 전처리 과정에서 검색하는지 그리고 그러한 구문마다 어떻게 해당 제약 조건 확인 코드를 삽입할 수 있는 지를 객체지향1) 데이타베이스 언어인 Objectivity/C++에 대해 gcc의 YACC 코드를 변경함으로써 보여 주었다.Abstract To cope with the complexity of handling integrity constraints, numerous researchers have suggested to use a rule-based system, where integrity constraints are expressed as rules and stored in a rule base. A rule manager and an integrity constraint manager cooperate to check the integrity constraints efficiently. In this approach, however, the integrity constraint manager has to monitor the activity of an application program constantly to catch any database operation. For each database operation, it has to check relevant rules with the help of the rule manager, resulting in considerable delays in database access. We propose to insert the constraints checking code in the application program directly at compile time. With constraints checking code inserted, the application program can check integrity constraints by itself without the intervention of the integrity constraint manager. We investigate what kind of statements require the checking of constraints, show how the compiler can detect those statements, and show how constraints checking code can be inserted into the program, by modifying the GCC YACC file for Objectivity/C++, an object-oriented database programming language.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.4 no.3
• /
• pp.27-42
• /
• 1984

The complexity and expensiveness of water resources projects have made optimum operation and design by computer-based techniques of increasing interest in recent years. Water resources problems in real world need many decisions under numerous constraints. In addition there are nonlinearities in the state and return function. This mathematical and technical troublesome must be overcome so that the optimum operation polices are determined. Then traditional dynamic optimization method encountered two major-cruxes: variable discretization and appearance of constraints. Even several recent methods which based on the Differential Dynamic Programming(DDP) have some difficulties in handling of constraints. This paper has presented New DDP which is applicable to multi-reservoir control. It is intended that the method suggested here is superior to abailable alternatives. This belief is supported by analysis and experiments(New DDT does not suffer course of dimensionality and requires no discretization and is able to handle easily all constraints nonlinearity).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5489-5511
• /
• 2019

The performance of evolutionary algorithms can be seriously weakened when constraints limit the feasible region of the search space. In this paper we present a constrained multi-objective optimization algorithm based on adaptive ε-truncation (ε-T-CMOA) to further improve distribution and convergence of the obtained solutions. First of all, as a novel constraint handling technique, ε-truncation technique keeps an effective balance between feasible solutions and infeasible solutions by permitting some excellent infeasible solutions with good objective value and low constraint violation to take part in the evolution, so diversity is improved, and convergence is also coordinated. Next, an exponential variation is introduced after differential mutation and crossover to boost the local exploitation ability. At last, the improved crowding density method only selects some Pareto solutions and near solutions to join in calculation, thus it can evaluate the distribution more accurately. The comparative results with other state-of-the-art algorithms show that ε-T-CMOA is more diverse than the other algorithms and it gains better in terms of convergence in some extent.

• Journal of Distribution Science
• /
• v.13 no.1
• /
• pp.83-91
• /
• 2015

Purpose - Despite the structural irrationality of multi-level transportation and the oil price rise, the domestic freight transportation market continues to grow, mirroring the rise in e-commerce and resultant increase in courier services and freight volumes. Several studies on courier services have been conducted. However, few studies or statistics have been published regarding regular freight services although they have played a role in the freight service market. The present study identifies the characteristics of regular freight service users to seek competitiveness enhancement measures specific to regular freight services. Research design, data, and methodology - IPA is a comparative analysis of the relative importance of and satisfaction with each attribute simultaneously. This study used IPA because it facilitates the process of analyzing importance and performance, deriving implications and a visual understanding of results. To enhance the competitiveness of regular freight services, this study surveyed its current users regarding the importance of the regular freight service factors. A total of 200 copies of a questionnaire were circulated and 190 copies were returned. In addition to demographics, respondents answered questions about the importance of and satisfaction with services on a 5-point Likert scale. Excluding 3 inappropriate copies, 187 out of 190 copies were analyzed. PASW Statistics 18 was used for statistical analysis. A total of 20 question items were selected for the service factors presented in the questionnaire based on the 1st pilot survey and previous studies. Results - According to the IPA performed to compare the importance of and satisfaction with service factors, both importance and satisfaction are high in the 1st quadrant, which involves the economic advantage of using regular freight services, quick arrival at destinations, weight freight handling, and less time constraints on freight receipt/dispatch. This area requires continuous management. Satisfaction is higher than importance in the 2nd quadrant, which involves the adequacy of freight, cost savings over ordinary courier services, notification on freight arrival, and freight tracking information. This area requires intensive investment and management. Satisfaction is lower than importance in the 3rd quadrant, involving the credit card payment system, courier delivery service, distance to freight handling sites, easy access to freight handling sites, and prompt problem solving. This area requires further intensive management. Both importance and satisfaction are low in the 4th quadrant, involving the availability of collection service, storage space at freight handling sites, kindness of collection/delivery staff, kindness of outlet staff, and easy delivery checks. This area is a set of variables should be excluded from priority control targets. Conclusions - Based on the IPA, service factors that need priority controls because of high importance and low satisfaction include the credit card payment system, delivery service, distance to freight handling sites, easy access to freight handling sites, and prompt problem solving. The findings need to be applied to future marketing strategies for regular freight services and for developing competitiveness enhancement programs.

• Structural Engineering and Mechanics
• /
• v.61 no.3
• /
• pp.359-370
• /
• 2017

This study presents a particle swarm optimization algorithm integrated with weighted particle concept and improved fly-back technique. The rationale behind this integration is to utilize the affirmative properties of these new terms to improve the search capability of the standard particle swarm optimizer. Improved fly-back technique introduced in this study can be a proper alternative for widely used penalty functions to handle existing constraints. This technique emphasizes the role of the weighted particle on escaping from trapping into local optimum(s) by utilizing a recursive procedure. On the other hand, it guaranties the feasibility of the final solution by rejecting infeasible solutions throughout the optimization process. Additionally, in contrast with penalty method, the improved fly-back technique does not contain any adjustable terms, thus it does not inflict any extra ad hoc parameters to the main optimizer algorithm. The improved fly-back approach, as independent unit, can easily be integrated with other optimizers to handle the constraints. Consequently, to evaluate the performance of the proposed method on solving the truss weight minimization problems with discrete variables, several benchmark examples taken from the technical literature are examined using the presented method. The results obtained are comparatively reported through proper graphs and tables. Based on the results acquired in this study, it can be stated that the proposed method (integrated particle swarm optimizer, iPSO) is competitive with other metaheuristic algorithms in solving this class of truss optimization problems.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.649-655
• /
• 2000

Real-time application programs have constraints which need to be met between media-data. These constraints represents the delay time ad quality of service between media-data to be presented. In order to efficiently describe the delay time and quality of service, a new synchronization mechanism is needed. Proposed paper is a dynamic synchronization that minimized the effects of adaptive transmission delay time. That is, the method meets the requirements of synchronization between media-dat by handling dynamically the adaptive waiting time resulted from variations of delay time. In addition, the mechanism has interval adjustment using maximum delay jitter time. This paper decreases the data loss resulted from variation of delay time and from loss time of media-data by means of applying delay jitter in order to deal with synchronization interval adjustment. Plus, the mechanism adaptively manages the waiting time of smoothing buffer, which leads to minimize the gap from the variation of delay time. The proposed paper is suitable to the system which requires the guarantee of high quality of service and mechanism improves quality of services such as decrease of loss rate, increase of playout rate.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.14 no.4
• /
• pp.81-88
• /
• 2005

This paper attempts to derive the dynamic model of handling tasks in finger robot which grasps stable and manipulates a rigid object with some dexterity. Firstly, a set of differential equation describing dynamics of the manipulators and object together with geometric constraint of tight area-contacts is formulated by Lagrange's equation. Secondly, the roblems of controlling both the forces of pressing object and the rotation angle of the object under the geometric constraints are discussed. The effect of geometric constraints of area-contacts between the link's end-effector and the object is analyzed and the model based on the differential-algebraic equations is presented. In this paper, the control method for dynamic stable grasping and enhancing dexterity in manipulating things is proposed. It is illustrated by computer simulation and the experiment that the control system gives the performance improvement in the dynamic stable grasping and nimble manipulating of the dual fingers robot with soft tips.

• Journal of Korean Association for Spatial Structures
• /
• v.4 no.4 s.14
• /
• pp.91-98
• /
• 2004

Genetic algorithm is one of the best ways to solve a discrete variable optimization problem. This method is an unconstrained optimization technique, so the constraints are handled in an implicit manner. The most popular way of handling constraints is to transform the original constrained problem into an unconstrained problem, using the concept of penalty function. I present the 3 fitness functions which represent the reject strategy, the penalty strategy, and the combined strategy. I make the design program using the 3 fitness Auctions and it is applied to the design problem of a gable frame and a 2 story 3 span frame.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.848-849
• /
• 2007

This paper presents an efficient approach for solving the economic dispatch (ED) problems with valve-point effects using differential evolution (DE). A DE, one of the evolutionary algorithms (EAs), is a novel optimization method capable of handling nonlinear, non-differentiable, and nonconvex functions. And an efficient constraints treatment method (CTM) is applied to handle the equality and inequality constraints. The resultant DE-CTM algorithm is very effective in solving the ED problems with nonconvex cost functions. To verify the superiority of the proposed method, a sample ED problem with valve-point effects is tested and its results are compared with those of previous works. The simulation results clearly show that the proposed DE-CTM algorithm outperforms other state-of-the-art algorithms in solving ED problems with valve-point effects

• Transactions of the Korean Society of Automotive Engineers
• /
• v.22 no.4
• /
• pp.72-81
• /
• 2014

In this study, we perform the optimization of trailing arm bush in a vehicle rear suspension to improve the ride and handling performance. A design problem was formulated considering 2 objective functions and 7 constraints related to vehicle ride and handling performance. PIAnO, one of the PIDO (Process Integration and Design Optimization) tool, was used to automate analysis procedures and perform a design optimization. In order to assess relation between performances and design variables, we perform the DOE (Design of Experiments). To find the optimal solution, we used Progressive quadratic response surface method (PQRSM), one of the design optimization techniques equipped in PIAnO. As an optimization result, we got an optimal solution and could improve lateral force steer off-center by 43.0% while decreasing brake compliance at wheel center by 8.1%.