• Journal of Information Technology Applications and Management
• /
• v.19 no.1
• /
• pp.37-46
• /
• 2012

The scheduling problem of large products like ships, airplanes, space shuttles, assembled constructions, and automobiles is very complex in nature. To reduce inherent computational complexity, we often design scheduling systems that the original problem is decomposed into small sub-problems, which are scheduled independently and integrated into the original one. Moreover, the steep growth of communication technology and logistics makes it possible to produce a lot of multi-nation corporation by which products are produced across more than one plant. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. In this research, we suggest an agent-based coordinating mechanism for multi-level scheduling systems in supply chain. For design of a general coordination mechanism, at first, we propose a grammar to define individual scheduling agents which are responsible to their own plants, and a meta-level coordination agent which is engaged to supervise individual scheduling agents. Second, we suggest scheduling agent communication protocols for each scheduling agent topology which is classified according to the system architecture, existence of coordinator, and direction of coordination. We also suggest a scheduling agent communication language which consists of three layers : Agent Communication Layer, Scheduling Coordination Layer, Industry-specific Layer. Finally, in order to improve the efficiency of communication among scheduling agents we suggest a rough capacity coordination model which supports to monitor participating agents and analyze the status of them. With this coordination mechanism, we can easily model coordination processes of multiple scheduling systems. In the future, we will apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly-plant-scheduling agents, and a meta-level coordination agent. A series of experiment using the real-world data will be performed to examine this mechanism.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.49-58
• /
• 2020

In this study, we solve an online multi-object problem which finds object states (i.e. locations and sizes) while conserving their identifications in online-provided images and detections. We handle this problem based on a tracking-by-detection approach by linking (or associating) detections between frames. For more accurate online association, we propose novel online appearance learning with discrete fourier transform and partial least square analysis (PLS). We first transform each object image into a Fourier image in order to extract meaningful features on a frequency domain. We then learn PLS subspaces which can discriminate frequency features of different objects. In addition, we incorporate the proposed appearance learning into the recent confidence-based association method, and extensively compare our methods with the state-of-the-art methods on MOT benchmark challenge datasets.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.7 no.6
• /
• pp.1-7
• /
• 2003

This paper presents a novel hybrid time-frequency-domain method for nonlinear soil-structure interaction(SSI) analysis. It employs, in a practical manner, a computer code for equivalent linear SSI analysis and a general-purpose nonlinear finite element program. The proposed method first (calculates dynamic responses on a truncated finite element boundary utilizing an equivalent linear SSI program in the frequency domain. Then, a general purpose nonlinear finite element program is employed to analyze the nonlinear SSI problem in the time domain, in which boundary conditions at the truncated boundary are imposed with the responses calculated in the previous frequency domain SSI analysis, In order to validate the proposed method, seismic response analyses are carried out for a 2-D underground subway station in a multi-layered half-space, For the analyses, a equivalent linear SSI code KIESSI-2D is coupled to ANSYS program. The numerical results indicate that the proposed methodology can be a viable solution for nonlinear SSI problems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.566-575
• /
• 2009

Clinical Data Interchange Standards Consortium (CDISC) developed global and platform-independent data standards to improve ineffective processes of clinical trial studies. Regardless of its objective toward global cooperation, the current version of the CDISC standard cannot describe clinical trial data in various languages for multi-national investigators or reviewers. This problem applies not only to tabulated datasets in Study Data Tabulation Model (SDTM) but also to extensible markup language representation of the datasets in Operational Data Model (ODM) instances. In order to address this issue, we propose to extend the current version of SDTM and ODM to collect clinical data for multi-national clinical trials. SDTM needs to have new special-purpose domain for multi-language representation purpose. Additionally, ODM is recommended to extend its XML schema using subtyping or type inheritance mechanism respectively. Our extension of SDTM and ODM enable to represent any granule of study data tabulation model or XML data entities to describe in efficient languages. This result will contribute to collect multi-language data easily for multi-national clinical trials.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.301-314
• /
• 2013

In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.3 no.4
• /
• pp.95-107
• /
• 1983

The general purpose programs are in their fixed algorithm and theory of mechanics which can not be altered without painful program modifications. Users are usually guided by user's manual for data input. The several symbolic manipulation programs for structural analysis are introduced recently. These programs allow users to include a wide class of solution algorithm and to specify, by means of some symbolic manipulation, a combination of analytical steps to suit a particular problem. As they can solve a single domain problem, a large computer is usually needed. The scope of this study is to develop an efficient symbolic manipulation program with space beam element, plate bending element and eigen value routines. The incorporated Substructure capability and generation capability of finite element characteristic arrays (e.g., stiffness matrix, mass matrix) enables users to analyse multidomain problem with small computer. The program consists of modulized independent processors, each having its own specific function and is easily modified, eliminated and added. The processors are efficiently handling data by the Data base approach which is the concept of integrated program network(IPN).

• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.19-22
• /
• 2004

A 30-inch WQXGA+ TFT-LCD Monitor has been developed based on in-plane switching mode with multi-domain. This product adopts Cu electrode which, in spite of low resistivity, was not applied to TFT LCD products because of productivity and reliability problems etc. This low resistivity material makes it possible to clear the problem caused by line delay in such high resolution TFT-LCDs. As a results of successful adoption of innovative materials and technologies, our world's largest TFT-LCD Monitor has best performance for high information display.

• Design & Manufacturing
• /
• v.7 no.1
• /
• pp.34-39
• /
• 2013

The finite element method(FEM) presents some limitations when the mesh becomes highly distorted. For analysis of metal forming processes with large deformation, the conventional finite element method usually requires several remeshing operations due to severe mesh distortion. The new computational method developed in the recent years, usually designated by meshfree method, offers an attractive approach to avoid those time-consuming remeshing efforts. This new method uses a set of points to represent the problem domain with no need of an additional mesh. Also this new generation of computational method provides a higher rate of convergence than that of the conventional finite element methods. One of the promising applications of meshfree methods is the adaptive refinement for problems having multi-scale nature. In this study, an adaptive node generation procedure is proposed and also to illustrate the efficiency of proposed method, several numerical examples are presented.

• Honam Mathematical Journal
• /
• v.25 no.1
• /
• pp.83-91
• /
• 2003

We prove a unique continuation theorem for $C^{\infty}$ functions in pseudoconvex domains in ${\mathbb{C}}^{n}$. More specifically, we show that if ${\Omega}$ is a pseudoconvex domain in ${\mathbb{C}}^n$, if f is in $C^{\infty}({\Omega})$ such that for all multi-indexes ${\alpha},{\beta}$ with ${\mid}{\beta}{\mid}{\geq}1$ and for any positive integer k, there exists a positive constant $C_{{\alpha},{\beta},{\kappa}}$ such that $$|{\frac{{\partial}^{{\mid}{\alpha}{\mid}+{\mid}{\beta}{\mid}}f}{{\partial}z^{\alpha}{\partial}{\bar{z}}^{\beta}}{\mid}{\leq}C_{{\alpha},{\beta},{\kappa}}{\mid}f{\mid}^{\kapp}}\;in\;{\Omega}$$, and if there exists $z_0{\in}{\Omega}$ such that f vanishes to infinite order at $z_0$, then f is identically zero. We also have a sharp result for the case of strongly pseudoconvex domains.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.4
• /
• pp.499-508
• /
• 2008

Frequency regulation in off-normal conditions has been an important problem in electric power system design/operation and is becoming much more significant today due to the increasing size, changing structure and complexity of interconnected power systems. Increasing economic pressures for power system efficiency and reliability have led to a requirement for maintaining power system frequency closer to nominal value. This paper presents a decentralized frequency control framework using a modified low-order frequency response model containing a proportional-integral(PI) controller. The proposed framework is suitable for near-normal and emergency operating conditions. An $H_{\infty}$ control technique is applied to achieve optimal PI parameters, and an analytic approach is used to analyse the system frequency response for wide area operating conditions. Time-domain simulations with a multi-area power system example show that the simulated results agree with those predicted analytically.