• Proceedings of the Safety Management and Science Conference
• /
• 대한안전경영과학회 2004년도 추계학술대회
• /
• pp.125-130
• /
• 2004

It is not difficult to see the road repairing. There are many and various machines that can crush road surface. The efficiency and power of the machine depend on crushing head-shape, crushing interval, crushing load, crushing stress, machine's dropping height and roller's kind. The objective of this study is to select the optimal model among ten models of crushing machine with constraints such as crushing depth, variation, and crushed particle size. The data for this study are chosen from the site of construction in Kangnung during three months ($2004.\;6.\;1\;\sim\;2004.\;8.\;31$). The provided methodology in this paper will be fruitful not only for the selection of crushing machine but also for the aspects of construction period, cost, work efficacy according to the condition from the various sites of construction.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.758-759
• /
• 1995

In large-scale industry such as shipbuilding, aircraft manufacturing, and construction industry etc., it is required to consider two or three-dimensional spatial availability as one of bottlenecked resource constraints. We call this kind of scheduling a spatial scheduling, which considers the dynamic spatial layouts of objects as well as the traditional resource constraints. Since 1991, we have researched on the spatial scheduling for shipbuilding plant (Lee & Lee, 1992; Lee et al., 1994, Lee et al., 1995). In this paper, we present the various issues of spatial scheduling for the researchers and developers attacking spatial scheduling problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제13권21호
• /
• pp.51-60
• /
• 1990

In this paper we deal with the miniaml cost network flow problem with uncertain arc capacity constraints. When the arc capacities are fuzzy with linear L-R type membership function, using parametric programming procedure, we reduced it to the deterministic minimal cost network flow problem which can be solved by various typical network flow algorithms. A modified Algorithm using the Out-of-kilter algorithm is developed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.103-111
• /
• 1994

An interactive and iterative design method based on the constraint satisfaction problem (CSP) technique was developed to generate an ergonomically sound layout of a control panel. This control panel layout method attempts to incorporate a variety of relevant ergonomic principles and design constraints, and generate an optimal or, at least, a "satisfactory" solution through iterative interactions with the designer. The existing panel design and layout methods are mostly based on the optimization of single objective function formulated to reflect and trade off all ergonomic design objectives which are largely different in their nature. In fact, the problem of seeking an ergonomically sound panel design should be viewed as a multiple objective optimization problem. Furthermore, most of the design objectives should be understood as constraints rather than objectives to be optimized. Hence, a constraint satisfaction approach is proposed in this study as a framework for the panel designer to search through the design decision space effectively and make various design decisions iteratively. In order to apply the constraint satisfaction approach to the panel design procedure, the ergonomic principles such as frequency-of-use, importance, functional grouping, and sequence-of-use are formalized as CSP terms. With this formalization, a prototype system was implemented and applied to panel layout problems. The results clearly showed the effectiveness of the proposed approach since it permits designers to consider and iteratively evaluate various design constraints and ergonomic principles, and, therefore, aids the panel designer to come up with an ergonomically sound control panel layout.

• Language and Information
• /
• 제13권1호
• /
• pp.77-92
• /
• 2009

Geis (1973) has provided various properties of the subjects and by + Gerund Phrase (GerP) in English causative constructions. Among them, the two main issues of Geis's analysis are as follows: unlike Lakoff (1965; 1966), the subject of English causative constructions, including causative-inchoative verbs such as liquefy, first of all, should be acts or events, not persons, and the by + GerP in the construction is a complement of the causative verbs. In addition to these issues, Geis has provided various data exhibiting other idiosyncratic properties and proposed some transformational rules such as the Agent Creation Rule and rule orderings to explain them. Against Geis's claim, I propose that English causative verbs require either Proper nouns or GerP subjects and that the by + GerP in the constructions as a Verbal Modifier needs Gerunds, whose understood Affective-agent subject is identical to the subject of causative verbs with respect to the semantic index value. This enables us to solve the two main issues. At the same time, the other properties Geis mentioned also can be easily accounted for in Head-driven Phrase Structure Grammar (HPSG) by positing a few lexical constraints. On this basis, it is shown that given the few lexical constraints and existing grammatical tools in HPSG, the constraint-based analysis proposed here gives a simpler explanation of the properties of English causative constructions provided by Geis without transformational rules and rule orderings.

• Journal of Intelligence and Information Systems
• /
• 제17권2호
• /
• pp.1-22
• /
• 2011

In this paper, we propose an adaptive genetic algorithm (aGA) approach for effectively solving the sequencing problem with precedence constraints (SPPC). For effective representation of the SPPC in the aGA approach, a new representation procedure, called the topological sort-based representation procedure, is used. The proposed aGA approach has an adaptive scheme using a fuzzy logic controller and adaptively regulates the rate of the crossover operator during the genetic search process. Experimental results using various types of the SPPC show that the proposed aGA approach outperforms conventional competing approaches. Finally the proposed aGA approach can be a good alternative for locating optimal solutions or sequences for various types of the SPPC.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제30권1호
• /
• pp.43-54
• /
• 2005

A flexible assembly line (FAL) is a production system that assembles various parts in unidirectional flow line with many constraints and manufacturing flexibilities. In this research we deal with a FAL balancing problem with the objective of minimizing the maximum workload allocated to the stations. However, almost all the existing researches do not appropriately consider various constraints due to the problem complexity. Therefore, this study addresses a balancing problem of FAL with many constraints and manufacturing flexibilities, unlike the previous researches. We use a genetic algorithm (GA) to solve this problem. To apply GA to FAL. we suggest a genetic representation suitable for FAL balancing and devise evaluation method for individual's fitness and genetic operators specific to the problem, including efficient repair method for preserving solution feasibility. After we obtain a solution using the proposed GA. we use a heuristic method for reassigning some tasks of each product to one or more stations. This method can improve workload smoothness and raise work efficiency of each station. The proposed algorithm is compared and analyzed in terms of solution quality through computational experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• 전기의세계
• /
• 제21권3호
• /
• pp.31-40
• /
• 1972

This study intends to investigate the optimal switching modes of a double-capacitive thermal system under different constraints on the state and the control variable, by the application of the Pontryagin's Minimum Principle. Throughout the development, the control effort is assumed to have two modes of state: M or zero and the terminal times being fixed. In the first part of this study, the Principle is discussed under various conditions for this particular problem, with different criterion functions and in the same time imposing a certain constraints; i) on the terminal states, ii) on functions of the terminal states. Depending upon the upper bound value of the control vector, possible driving modes of the states are studied from which particular optimal driving modes are extracted so as to meet the specified constraints and boundary conditions imposed in the problem. Numerical solutions are evaluated for an over0damped, double-capacitive thermal plant and the optimal solutions: the switching mode, the optimal switching time, and the control effort are compared with the analytical results, in the second part of this work, to confirm the development.

• Proceedings of the KSPS conference
• /
• 대한음성학회 2002년도 11월 학술대회지
• /
• pp.64-69
• /
• 2002

This study concerns the constraints of English Poetic Meter. In English poems, the metrical pattern doesn't always match the linguistic stress on the lines. These mismatches are found differently among the poets. For the lexical stress mismatched with the weak metrical position, $*W{\Rightarrow}{\;}Strength$ is established by the concept of the strong syllable. The peaks of monosyllabic words mismatched with the weak metrical position are divided according to which side of the boundary of a phonological domain they are adjacent to. Adjacency Constraint I is suggested for the mismatched peak which is adjacent to the left boundary of a phonological domain; *Peak] and Adjacency ConstraintII for the mismatched peak which are adjacent to the right boundary of a phonological domain. These constraints are various according to the poets(Pope, Milton and Shakespeare) : *[Peak [-stress], $W{\Rightarrow}{\;}*Strength$ and *Peak] in Pope; *[+stress][Peak [-stress] and *Peak] in Milton ; *[+stress][Peak [-stress], $W{\;}{\Rightarrow}{\;}*Strength$ and ACII in Shakespeare.