• 제목/요약/키워드: Balancing machine

Search Result 120, Processing Time 0.192 seconds

A Supervised Feature Selection Method for Malicious Intrusions Detection in IoT Based on Genetic Algorithm

  • Saman Iftikhar;Daniah Al-Madani;Saima Abdullah;Ammar Saeed;Kiran Fatima
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.3
    • /
    • pp.49-56
    • /
    • 2023
  • Machine learning methods diversely applied to the Internet of Things (IoT) field have been successful due to the enhancement of computer processing power. They offer an effective way of detecting malicious intrusions in IoT because of their high-level feature extraction capabilities. In this paper, we proposed a novel feature selection method for malicious intrusion detection in IoT by using an evolutionary technique - Genetic Algorithm (GA) and Machine Learning (ML) algorithms. The proposed model is performing the classification of BoT-IoT dataset to evaluate its quality through the training and testing with classifiers. The data is reduced and several preprocessing steps are applied such as: unnecessary information removal, null value checking, label encoding, standard scaling and data balancing. GA has applied over the preprocessed data, to select the most relevant features and maintain model optimization. The selected features from GA are given to ML classifiers such as Logistic Regression (LR) and Support Vector Machine (SVM) and the results are evaluated using performance evaluation measures including recall, precision and f1-score. Two sets of experiments are conducted, and it is concluded that hyperparameter tuning has a significant consequence on the performance of both ML classifiers. Overall, SVM still remained the best model in both cases and overall results increased.

Balancing assembly line in an electronics company

  • 박경철;강석훈;박성수;김완희
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.10a
    • /
    • pp.12-19
    • /
    • 1993
  • In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

  • PDF

A Development of Adaptive VM Migration Techniques in Cloud Computing (클라우드 컴퓨팅에서 적응적 VM 마이그레이션 기법 개발)

  • Lee, HwaMin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.315-320
    • /
    • 2015
  • In cloud computing, server virtualization supports one or more virtual machines loaded on multiple operating systems on a single physical host server. Migration of a VM is moving the VM running on a source host to another physical machine called target host. A VM live migration is essential to support task performance optimization, energy efficiency and energy saving, fault tolerance and load balancing. In this paper, we propose open source based adaptive VM live migration technique. For this, we design VM monitoring module to decide VM live migration and open source based full-virtualization hypervisor.

A Two-Stage Scheduling Approach on Hybrid Flow Shop with Dedicated Machine (전용기계가 있는 혼합흐름공정의 생산 일정 계획 수립을 위한 2단계 접근법)

  • Kim, Sang-Rae;Kang, Jun-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.47 no.4
    • /
    • pp.823-835
    • /
    • 2019
  • Purpose: This study deals with a production planning and scheduling problem to minimize the total weighted tardiness on hybrid flow shop with sets of non-identical parallel machines on stages, where parallel machines in the set are dedicated to perform specific subsets of jobs and sequence-dependent setup times are also considered. Methods: A two-stage approach, that applies MILP model in the 1st stage and dispatching rules in the 2nd stage, is proposed in this paper. The MILP model is used to assign jobs to a specific machine in order to equalize the workload of the machines at each stage, while new dispatching rules are proposed and applied to sequence jobs in the queue at each stage. Results: The proposed two-stage approach was implemented by using a commercial MILP solver and a commercial simulation software and a case study was developed based on the spark plug manufacturing process, which is an automotive component, and verified using the company's actual production history. The computational experiment shows that it can reduce the tardiness when used in conjunction with the dispatching rule. Conclusion: This proposed two-stage approach can be used for HFS systems with dedicated machines, which can be evaluated in terms of tardiness and makespan. The method is expected to be used for the aggregated production planning or shop floor-level production scheduling.

Deadline Constrained Adaptive Multilevel Scheduling System in Cloud Environment

  • Komarasamy, Dinesh;Muthuswamy, Vijayalakshmi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1302-1320
    • /
    • 2015
  • In cloud, everything can be provided as a service wherein a large number of users submit their jobs and wait for their services. hus, scheduling plays major role for providing the resources efficiently to the submitted jobs. The brainwave of the proposed ork is to improve user satisfaction, to balance the load efficiently and to bolster the resource utilization. Hence, this paper roposes an Adaptive Multilevel Scheduling System (AMSS) which will process the jobs in a multileveled fashion. The first level ontains Preprocessing Jobs with Multi-Criteria (PJMC) which will preprocess the jobs to elevate the user satisfaction and to itigate the jobs violation. In the second level, a Deadline Based Dynamic Priority Scheduler (DBDPS) is proposed which will ynamically prioritize the jobs for evading starvation. At the third level, Contest Mapping Jobs with Virtual Machine (CMJVM) is roposed that will map the job to suitable Virtual Machine (VM). In the last level, VM Scheduler is introduced in the two-tier VM rchitecture that will efficiently schedule the jobs and increase the resource utilization. These contributions will mitigate job iolations, avoid starvation, increase throughput and maximize resource utilization. Experimental results show that the performance f AMSS is better than other algorithms.

How to Use an Optimization-Based Method Capable of Balancing Safety, Reliability, and Weight in an Aircraft Design Process

  • Johansson, Cristina;Derelov, Micael;Olvander, Johan
    • Nuclear Engineering and Technology
    • /
    • v.49 no.2
    • /
    • pp.404-410
    • /
    • 2017
  • In order to help decision-makers in the early design phase to improve and make more cost-efficient system safety and reliability baselines of aircraft design concepts, a method (Multi-objective Optimization for Safety and Reliability Trade-off) that is able to handle trade-offs such as system safety, system reliability, and other characteristics, for instance weight and cost, is used. Multi-objective Optimization for Safety and Reliability Trade-off has been developed and implemented at SAAB Aeronautics. The aim of this paper is to demonstrate how the implemented method might work to aid the selection of optimal design alternatives. The method is a three-step method: step 1 involves the modelling of each considered target, step 2 is optimization, and step 3 is the visualization and selection of results (results processing). The analysis is performed within Architecture Design and Preliminary Design steps, according to the company's Product Development Process. The lessons learned regarding the use of the implemented trade-off method in the three cases are presented. The results are a handful of solutions, a basis to aid in the selection of a design alternative. While the implementation of the trade-off method is performed for companies, there is nothing to prevent adapting this method, with minimal modifications, for use in other industrial applications.

A Study on the Extraction of Psychological Distance Embedded in Company's SNS Messages Using Machine Learning (머신 러닝을 활용한 회사 SNS 메시지에 내포된 심리적 거리 추출 연구)

  • Seongwon Lee;Jin Hyuk Kim
    • Information Systems Review
    • /
    • v.21 no.1
    • /
    • pp.23-38
    • /
    • 2019
  • The social network service (SNS) is one of the important marketing channels, so many companies actively exploit SNSs by posting SNS messages with appropriate content and style for their customers. In this paper, we focused on the psychological distances embedded in the SNS messages and developed a method to measure the psychological distance in SNS message by mixing a traditional content analysis, natural language processing (NLP), and machine learning. Through a traditional content analysis by human coding, the psychological distance was extracted from the SNS message, and these coding results were used for input data for NLP and machine learning. With NLP, word embedding was executed and Bag of Word was created. The Support Vector Machine, one of machine learning techniques was performed to train and test the psychological distance in SNS message. As a result, sensitivity and precision of SVM prediction were significantly low because of the extreme skewness of dataset. We improved the performance of SVM by balancing the ratio of data by upsampling technique and using data coded with the same value in first content analysis. All performance index was more than 70%, which showed that psychological distance can be measured well.

Forward Kinematic Analysis of Casing Oscillator (케이싱 오실레이터의 순기구학 해석)

  • Nam, Yun-Joo;Park, Myeong-Kwan
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.12
    • /
    • pp.1845-1855
    • /
    • 2004
  • This paper presents the forward kinematics of the Casing Oscillator that is a construction machine. The Structure of the Casing Oscillator is similar to those of 4 degree-of-freedom mechanisms with a redundancy. With analytical (geometrical) methods, the solutions of the forward position kinematics problem are significantly found by both solving an 8$^{th}$ -order polynomial equation in one unknown variable and using one over-constraint geometrical equation which can be derived under the condition of a redundancy. The proposed forward kinematics has closed-form solutions and allows Auto-Balancing control of the moving platform in real time. Numerical examples are presented and the results are verified by an inverse kinematics analysis.

An Analysis of Hyd-Cylinder Shop Facilities Planning by Simulation (시뮬레이션 기법을 이용한 유압생산부 설비배치 계획의 분석)

  • Chung, K.H.;Chung, S.W.;Park, D.H.;Kim, J.C.;Kwon, K.Y.
    • IE interfaces
    • /
    • v.5 no.2
    • /
    • pp.39-52
    • /
    • 1992
  • This paper presents alternatives for facilities planning and analyses them using simulation approach. For this purpose, hydro-cylinder production line was sampled as a case study. Several facilities planning alternatives are evaluated based on the several factors such as line balancing, equipment utilization, optimum number of equipments, inventory size, flow time, bottleneck machine, and productive capacity. An optimal facilities planning is proposed based on the degree of meeting with the all factors evaluated. The simulation language employed in this study is SIMAN and the data used for simulation are provided by hydro-cylinder shop.

  • PDF

A Method of Axial Thrust Control in Centrifugal Pump (원심펌프의 축추력 제어법에 관한 연구)

  • Choi, Young-Do;Kurokawa, Junichi
    • The KSFM Journal of Fluid Machinery
    • /
    • v.10 no.4
    • /
    • pp.15-20
    • /
    • 2007
  • In order to control and balance axial thrust of turbo machine, many types of balancing devices are used but most of them are complicated and sometimes cause troubles. In this study, a very simple device of using shallow grooves mounted on a casing wall, known as "J-Groove", is proposed and studied experimentally and theoretically. The result shows that 70% of axial thrust in an industrial 4-stage centrifugal pump can be reduced at the best efficiency point. Moreover, the analytical method of "interfered gap flow" is established and a simple formula which can determine the optimum dimension of groove and its location is proposed.