• Title/Summary/Keyword: paper machine

Search Result 9,841, Processing Time 0.038 seconds

A Genetic Algorithm for Minimizing Completion Time with Non-identical Parallel Machines (이종 병렬설비 공정의 작업완료시간 최소화를 위한 유전 알고리즘)

  • Choi, Yu Jun;Song, Han Sik;Lee, Ik Sun
    • Korean Management Science Review
    • /
    • v.30 no.3
    • /
    • pp.81-97
    • /
    • 2013
  • This paper considers a parallel-machine scheduling problem with dedicated and common processing machines. Non-identical setup and processing times are assumed for each machine. A genetic algorithm is proposed to minimize the makespan objective measure. In this paper, a lowerbound and some heuristic algorithms are derived and tested through computational experiments.

An Analytical and Experimental Wheel Tracking Study on Dynamic Interaction of Vehicle (차량의 동적 상호작용에 관한 이론연구 및 윤하중 실험)

  • Kim, Nak-Suk;Pak, Suk-Soon
    • Journal of the Society of Disaster Information
    • /
    • v.2 no.1
    • /
    • pp.39-52
    • /
    • 2006
  • In this paper, an analytical and experimental study was performed in order to determine the effects of interaction between vehicle and structure. Results presented in the paper show that analytical method including moving load effect can investigate the trend of structural response due to dynamic interaction between vehicle and structure. The wheel tracking machine fitted with 2-axle test vehicle can demonstrate more accurate dynamic interaction between vehicle and structure than the wheel tracking machine fitted without 2-axle test vehicle.

  • PDF

Tabu Search methods to minimize the number of tardy jobs in nonidentical parallel machine scheduling problem (동일하지 않는 병렬기계 시스템에서 지연작업수를 최소화하는 Tabu Search 방법)

  • 전태웅;강맹규
    • Korean Management Science Review
    • /
    • v.12 no.3
    • /
    • pp.177-185
    • /
    • 1995
  • This paper presents a Tabu Search method to minimize a number of tardy jobs in the nonidentical parallel machine scheduling. The Tabu Search method employs a restricted neighborhood for the reduction of computation time. In this paper, we use two different types of method for a single machine scheduling. One is Moore's algorithm and the other is insertion method. We discuss computational experiments on more than 1000 test problems.

  • PDF

A Model for Man-Machine System Evaluation (I) (인간-기계시스템의 평가모델 (I))

  • 이상도;하정진;정중희;이동춘
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.6 no.9
    • /
    • pp.39-44
    • /
    • 1983
  • The main issue of his paper is to quantify the compatability between man and machine in a system. This paper offers an evaluation model derived from transfer function of control system, and shows a methodology of applying efficiency for man and machine to the model to quantify the compatability of a system.

  • PDF

A Study on the Construction of Dynamic Recursive Control Model through a Machine State Monitoring (기계상태 Monitoring을 통한 동적 Recursive 제어모형 구축에 관한 연구)

  • 윤상원;윤석환;신용백
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.17 no.30
    • /
    • pp.107-116
    • /
    • 1994
  • This paper formulates a dynamic monitoring and control model with a machine state by quality variations in a single lot production system. A monitoring model is based on estimate of machine state obtained using control theory. The model studied in this paper has a great advance from a point of view the combination between quality control (Sampling, Control Chart) and automatic control theory, and can be extended in a several ways.

  • PDF

Measuring machine parameters of inverter-fed induction motors for an accurate torque control (고정밀 토크제어를 위한 인버터 구동 유도전동기의 상수 측정)

  • Lee Jin-Woo
    • Proceedings of the KIPE Conference
    • /
    • 2002.11a
    • /
    • pp.12-16
    • /
    • 2002
  • This paper deals with the measurement of machine parameters of inverter-fed induction motors for an accurate torque control applications such as machine tools and tension control machines. After discussing nonlinearities of both inverter and motor, this paper suggests appropriate compensation and measurement methods. The experimental results show the validity of the proposed method in the operating conditions.

  • PDF

Effect of Garbage Collection in the ZG-machine (ZG-machine에서 기억 장소 재활용 체계의 영향)

  • Woo, Gyun;Han, Tai-Sook
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.7
    • /
    • pp.759-768
    • /
    • 2000
  • The ZG-machine is a space-efficient G-machine, which exploits a simple encoding method, called tag-forwarding, to compress the heap structure of graphs. Experiments on the ZG-machine without garbage collection shows that the ZG-machine saves 30% of heap space and the run-time overhead is no more than 6% than the G-machine. This paper presents the results of further experiments on the ZG-machine with the garbage collector. As a result, the heap-residency of the ZG-machine decreases by 34% on average although the run-time increases by 34% compared to the G-machine. The high rate of the run-time overhead of the ZG-machine is incurred by the garbage collector. However, when the heap size is 7 times the heap-residency, the run-time overhead of the ZG-machine is no more than 12% compared to the G-machine. With the aspect of reduced heap-residency, the ZG-machine may be useful in memory-restricted environments such as embedded systems. Also, with the development of a more efficient garbage collector, the run-time is expected to decrease significantly.

  • PDF

Machine Learning based Prediction of The Value of Buildings

  • Lee, Woosik;Kim, Namgi;Choi, Yoon-Ho;Kim, Yong Soo;Lee, Byoung-Dai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3966-3991
    • /
    • 2018
  • Due to the lack of visualization services and organic combinations between public and private buildings data, the usability of the basic map has remained low. To address this issue, this paper reports on a solution that organically combines public and private data while providing visualization services to general users. For this purpose, factors that can affect building prices first were examined in order to define the related data attributes. To extract the relevant data attributes, this paper presents a method of acquiring public information data and real estate-related information, as provided by private real estate portal sites. The paper also proposes a pretreatment process required for intelligent machine learning. This report goes on to suggest an intelligent machine learning algorithm that predicts buildings' value pricing and future value by using big data regarding buildings' spatial information, as acquired from a database containing building value attributes. The algorithm's availability was tested by establishing a prototype targeting pilot areas, including Suwon, Anyang, and Gunpo in South Korea. Finally, a prototype visualization solution was developed in order to allow general users to effectively use buildings' value ranking and value pricing, as predicted by intelligent machine learning.

Executing System of Virtual Machine Code using Decompiling Method (역컴파일링 기법을 이용한 가상기계 코드 실행 시스템)

  • Ahn, Duk-Ki;Yi, Chang-Hwan;Oh, Se-Man
    • The KIPS Transactions:PartA
    • /
    • v.14A no.2
    • /
    • pp.91-98
    • /
    • 2007
  • Generally, virtual machine platform is composed of a compiler, an assembler, and VM(Virtual Machine). To develop it, the design of VMC(Virtual Machine Code) is an essential task. And it is very important to verify the virtual machine platform. To do this and furthermore to execute VMC, it needs to implement VMC execution system using compiling method, interpreting method, or decompiling method. In this paper, we suggested and implemented the executing system of VMC using decompiling method out of three methods to execute the VMC. In our implementation, the VMC is SIL(Standard Intermediate Language) that is an intermediate code of EVM(Embedded Virtual Machine). Actually, we verified the usefulness of the decompiling method. And the decompiling method suggested in this paper can be used to minimize the mistake in developing Virtual machine platform.

A Case Study on Machine Learning Applications and Performance Improvement in Learning Algorithm (기계학습 응용 및 학습 알고리즘 성능 개선방안 사례연구)

  • Lee, Hohyun;Chung, Seung-Hyun;Choi, Eun-Jung
    • Journal of Digital Convergence
    • /
    • v.14 no.2
    • /
    • pp.245-258
    • /
    • 2016
  • This paper aims to present the way to bring about significant results through performance improvement of learning algorithm in the research applying to machine learning. Research papers showing the results from machine learning methods were collected as data for this case study. In addition, suitable machine learning methods for each field were selected and suggested in this paper. As a result, SVM for engineering, decision-making tree algorithm for medical science, and SVM for other fields showed their efficiency in terms of their frequent use cases and classification/prediction. By analyzing cases of machine learning application, general characterization of application plans is drawn. Machine learning application has three steps: (1) data collection; (2) data learning through algorithm; and (3) significance test on algorithm. Performance is improved in each step by combining algorithm. Ways of performance improvement are classified as multiple machine learning structure modeling, $+{\alpha}$ machine learning structure modeling, and so forth.