• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.301-305
• /
• 2000

The present study is part of the Special Research Project for the Construction of a Kansei Sensory Evaluation Model that is currently underway at the University of Tsukuba. In this study, a robot was operated by remote control at an actual art museum as part of a preliminary experiment. The results obtained therefrom were used to consider how people might view exhibits. In a previous study, a standard lens and s wide-angle lens were used to analyze differences in sensory-based movements, while VRML was used to analyze differences in these movements between a virtual and an actual museum. In the present study, the time delay in remote operation, which is currently unavoidable, placed some restrictions on the degree of freedom with which exhibits could be viewed, but it was apparent that sensory evaluation could be possible depending on the search behavior and viewing time. Furthermore specific viewing behaviors using the robot were observed, suggesting that new Kansei sensory perceptions were derived from these behaviors.

• IE interfaces
• /
• v.11 no.3
• /
• pp.65-75
• /
• 1998

This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.2
• /
• pp.78-86
• /
• 2010

The traveling purchaser problem(TPP) is a generalization of the well-known traveling salesman problem(TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. TPP also could be extended to the vehicle routing problem(VRP) by incorporating additional constraints such as multi-purchaser, capacity, distance and time restrictions. In the last decade, TPP has received some attention of the researchers in the operational research area. However it has not received the equivalent interest as much as TSP and VRP. Therefore, there does not exist a review of the TPP. The purpose of this paper is to review the TPP and to describe solution procedures proposed for this problem. We also introduce the ILP formulation for the multiple TPP(mTPP) which is generalized type of TPP. We compare the system performance according to change from TPP to mTPP.

• Industrial Engineering and Management Systems
• /
• v.6 no.2
• /
• pp.125-135
• /
• 2007

An automated guided vehicle (AGV) system is a group of collaborating unmanned vehicles which is commonly used for transporting materials within manufacturing, warehousing, or distribution systems. The performance of an AGV system depends on the dispatching rules used to assign vehicles to pickup requests, the vehicle routing protocols, and the home location of idle vehicles, which are called dwell points. In manufacturing and distribution environments which emphasize just-in-time principles, performance measures for material handling are based on response times for pickup requests and equipment utilization. In an AGV system, the response time for a pickup request is the time that it takes for the vehicle to travel from its dwell point to the pickup station. In this article, an exact dynamic programming algorithm for selecting dwell points in a tandem-loop multiple-vehicle AGV system is presented. The objective of the model is to minimize the maximum response time for all pickup requests in a given shift. The recursive algorithm considers time restrictions on the availability of vehicles during the shift.

• Management Science and Financial Engineering
• /
• v.6 no.2
• /
• pp.29-45
• /
• 2000

We consider the design of a two-level telecommunication network having logical full-mesh/star topology, with the implementation of conduit systems taken together. The design problem is then viewed as consisting of three subproblems: locating hub facilities, placing a conduit network, and installing cables therein to configure the logical full-mesh/star network. Without partitioning into subproblems as done in the conventional approach, the whole problem is directly dealt with in a single integrated framework, inspired by some recent successes with the approach. We successfully formulate the problem as a variant of the classical multicommodity flow model for the fixed charge network design problem, aided by network augmentation, judicious commodity definition, and some flow restrictions. With our optimal model, we solve some randomly generated sample problems by using CPLEX MIP program. From the computational experiments, it seems that our model can be applied to the practical problem effectively.

• Wind and Structures
• /
• v.12 no.5
• /
• pp.457-474
• /
• 2009

Techniques for stabilising slender bridges under wind loads are presented in this article. A mathematically consistent description of the acting aerodynamic forces is essential when investigating these ideas. Against this background, motion-induced aerodynamic forces are characterised using a linear time-invariant transfer element in terms of rational functions. With the help of these functions, the aeroelastic system can be described in the form of a linear, time-invariant state-space model. It is shown that the divergence wind speed constitutes an upper bound for the application of the selected mechanical actuators. Even active control with full state feedback cannot overcome this limitation. The results are derived and explained with methods of control theory.

• Cartoon and Animation Studies
• /
• s.11
• /
• pp.169-177
• /
• 2007

This study analyzed the assessment guideline of domestic animations related to the Broadcasting Act. That is, it analyzed assessment objectives, target subjects, procedures, restrictions in examination, assessment standards according to each item, resolution procedures, etc, and suggested problems. Then it presents the improvement plan of assessment guidelines for promoting and fostering creation of animations to be broadcasted.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.284-290
• /
• 1993

In order to improve the adaptability of rice transplanter to seeding with different length when transplanting multicropping rice in south China. The seedling separating planting mechanism is resynthesized in the paper. According to the agronomy requirements of seedling's transplanting, optimum motional path of the tip point of planting needle is obtained. by applying the established kinematic model of the separating planting mechanism, the relevant software is compiled. On the basis of the features of the problem, the constrained optimization method is utilized to solve the problem with 24 restrictions. Thus, the optimum structure parameters are obtained to satisfy the path points accurately.

• International Journal of Aeronautical and Space Sciences
• /
• v.7 no.2
• /
• pp.145-154
• /
• 2006

Many kinds of unmanned aerial vehicles (UAVs) have been developed for a few decades and some of them are now in operational use. Although each UAV as well as a piloted aircraft might have restrictions to execute some tasks simultaneously or to carry some payloads, one with an automatic chase aircraft might have the potential of multi-capabilities to conduct a variety of missions or to carry more storages. This paper introduces a chase UAV control system to enhance a leader (reference) aircraft capability which has storage restriction. The automatic chase guidance and control system will be introduced with the pure pursuit guidance law combined with relative velocity error corrections, and a dynamic inversion technique in order to generate the guidance forces.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.45-56
• /
• 1995

D. H. Gottlieb [1, 2] studied the subgroups $G_n(X)$ of homotopy groups $\pi_n(X)$. In [5, 7, 10], the authors introduced subgroups $G_n(X, A)$ and $G_n^{Rel}(X, A) of \pi_n(X)$ and $\pi_n(X, A)$ respectively and showed that they fit together into a sequence $$ \cdots \to G_n(A) \longrightarrow^{i_*} G_n(X, A) \longrightarrow^{j_*} G_n^{Rel}(X, A) \longrightarrow^\partial $$ $$ \cdots \to G_1^{Rel}(X, A) \to G_0(A) \ to G_0(X, A) $$ where $i_*, j_*$ and \partial$ are restrictions of the usual homomorphisms of the homotopy sequence $$ \cdot \to^\partial \pi_n(A) \longrightarrow^{i_*} \pi_n(X) \longrightarrow^{j_*} \pi_n(X, A) \to \cdot \to \pi_0(A) \to \pi_0(X) $$.