• Title/Summary/Keyword: decision algorithm

Search Result 2,381, Processing Time 0.023 seconds

Electrical fire prediction model study using machine learning (기계학습을 통한 전기화재 예측모델 연구)

  • Ko, Kyeong-Seok;Hwang, Dong-Hyun;Park, Sang-June;Moon, Ga-Gyeong
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.6
    • /
    • pp.703-710
    • /
    • 2018
  • Although various efforts have been made every year to reduce electric fire accidents such as accident analysis and inspection for electric fire accidents, there is no effective countermeasure due to lack of effective decision support system and existing cumulative data utilization method. The purpose of this study is to develop an algorithm for predicting electric fire based on data such as electric safety inspection data, electric fire accident information, building information, and weather information. Through the pre-processing of collected data for each institution such as Korea Electrical Safety Corporation, Meteorological Administration, Ministry of Land, Infrastructure, and Transport, Fire Defense Headquarters, convergence, analysis, modeling, and verification process, we derive the factors influencing electric fire and develop prediction models. The results showed insulation resistance value, humidity, wind speed, building deterioration(aging), floor space ratio, building coverage ratio and building use. The accuracy of prediction model using random forest algorithm was 74.7%.

Crane Scheduling Considering Tenant Service Time in a Rail-Road Transshipment Yard : Case of the Uiwang ICD (철도-육상트럭 환적지에서의 입주사 작업시간을 고려한 크레인 적하작업 스케줄링 : 의왕ICD 사례)

  • Kim, Kwang-Tae;Kim, Hyo-Jeong;Son, Dong-Hoon;Jang, Jin-Myeong;Kim, Hwa-Joong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.4
    • /
    • pp.238-247
    • /
    • 2018
  • This paper considers the problem of scheduling loading and unloading operations of a crane in a railway terminal motivated from rail-road container transshipment operations at Uiwang Inland Container Depot (ICD). Unlike previous studies only considering the total handling time of containers, this paper considers a bi-criteria objective of minimizing the weighted sum of the total handling time and tenant service time. The tenant service time is an important criterion in terms of terminal tenants who are private logistics companies in charge of moving containers from/to the terminal using their trucks. In the rail-road container shipment yard, the tenant service time of a tenant can be defined by a time difference between beginning and finishing loading and unloading operations of a crane. Thus, finding a set of sequences and time of the crane operations becomes a crucial decision issue in the problem. The problem is formulated as a nonlinear program which is improved by linearizing a nonlinear constraint in the model. This paper develops a genetic algorithm to solve the problem and performs a case study on the Uiwang ICD terminal. Computational experiment results show that the genetic algorithm shows better performance than commercial optimization solvers. Operational implications in terms of tenants are drawn through sensitivity analyses.

A Problem of Locating Electric Vehicle Charging Stations for Load Balancing (로드밸런싱을 위한 전기차 충전소 입지선정 문제)

  • Kwon, Oh-Seong;Yang, Woosuk;Kim, Hwa-Joong;Son, Dong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.4
    • /
    • pp.9-21
    • /
    • 2018
  • In South Korea, Jeju Island has a role as a test bed for electric vehicles (EVs). All conventional cars on the island are supposed to be replaced with EVs by 2030. Accordingly, how to effectively set up EV charging stations (EVCSs) that can charge EVs is an urgent research issue. In this paper, we present a case study on planning the locations of EVCS for Jeju Island, South Korea. The objective is to determine where EVCSs to be installed so as to balance the load of EVCSs while satisfying demands. For a public service with EVCSs by some government or non-profit organization, load balancing between EVCS locations may be one of major measures to evaluate or publicize the associated service network. Nevertheless, this measure has not been receiving much attention in the related literature. Thus, we consider the measure as a constraint and an objective in a mixed integer programming model. The model also considers the maximum allowed distance that drivers would detour to recharge their EV instead of using the shortest path to their destination. To solve the problem effectively, we develop a heuristic algorithm. With the proposed heuristic algorithm, a variety of numerical analysis is conducted to identify effects of the maximum allowed detour distance and the tightness of budget for installing EVCSs. From the analysis, we discuss the effects and draw practical implications.

Comparative characteristic of ensemble machine learning and deep learning models for turbidity prediction in a river (딥러닝과 앙상블 머신러닝 모형의 하천 탁도 예측 특성 비교 연구)

  • Park, Jungsu
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.35 no.1
    • /
    • pp.83-91
    • /
    • 2021
  • The increased turbidity in rivers during flood events has various effects on water environmental management, including drinking water supply systems. Thus, prediction of turbid water is essential for water environmental management. Recently, various advanced machine learning algorithms have been increasingly used in water environmental management. Ensemble machine learning algorithms such as random forest (RF) and gradient boosting decision tree (GBDT) are some of the most popular machine learning algorithms used for water environmental management, along with deep learning algorithms such as recurrent neural networks. In this study GBDT, an ensemble machine learning algorithm, and gated recurrent unit (GRU), a recurrent neural networks algorithm, are used for model development to predict turbidity in a river. The observation frequencies of input data used for the model were 2, 4, 8, 24, 48, 120 and 168 h. The root-mean-square error-observations standard deviation ratio (RSR) of GRU and GBDT ranges between 0.182~0.766 and 0.400~0.683, respectively. Both models show similar prediction accuracy with RSR of 0.682 for GRU and 0.683 for GBDT. The GRU shows better prediction accuracy when the observation frequency is relatively short (i.e., 2, 4, and 8 h) where GBDT shows better prediction accuracy when the observation frequency is relatively long (i.e. 48, 120, 160 h). The results suggest that the characteristics of input data should be considered to develop an appropriate model to predict turbidity.

CNN based Raman Spectroscopy Algorithm That is Robust to Noise and Spectral Shift (잡음과 스펙트럼 이동에 강인한 CNN 기반 라만 분광 알고리즘)

  • Park, Jae-Hyeon;Yu, Hyeong-Geun;Lee, Chang Sik;Chang, Dong Eui;Park, Dong-Jo;Nam, Hyunwoo;Park, Byeong Hwang
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.24 no.3
    • /
    • pp.264-271
    • /
    • 2021
  • Raman spectroscopy is an equipment that is widely used for classifying chemicals in chemical defense operations. However, the classification performance of Raman spectrum may deteriorate due to dark current noise, background noise, spectral shift by vibration of equipment, spectral shift by pressure change, etc. In this paper, we compare the classification accuracy of various machine learning algorithms including k-nearest neighbor, decision tree, linear discriminant analysis, linear support vector machine, nonlinear support vector machine, and convolutional neural network under noisy and spectral shifted conditions. Experimental results show that convolutional neural network maintains a high classification accuracy of over 95 % despite noise and spectral shift. This implies that convolutional neural network can be an ideal classification algorithm in a real combat situation where there is a lot of noise and spectral shift.

Message Security Level Integration with IoTES: A Design Dependent Encryption Selection Model for IoT Devices

  • Saleh, Matasem;Jhanjhi, NZ;Abdullah, Azween;Saher, Raazia
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.8
    • /
    • pp.328-342
    • /
    • 2022
  • The Internet of Things (IoT) is a technology that offers lucrative services in various industries to facilitate human communities. Important information on people and their surroundings has been gathered to ensure the availability of these services. This data is vulnerable to cybersecurity since it is sent over the internet and kept in third-party databases. Implementation of data encryption is an integral approach for IoT device designers to protect IoT data. For a variety of reasons, IoT device designers have been unable to discover appropriate encryption to use. The static support provided by research and concerned organizations to assist designers in picking appropriate encryption costs a significant amount of time and effort. IoTES is a web app that uses machine language to address a lack of support from researchers and organizations, as ML has been shown to improve data-driven human decision-making. IoTES still has some weaknesses, which are highlighted in this research. To improve the support, these shortcomings must be addressed. This study proposes the "IoTES with Security" model by adding support for the security level provided by the encryption algorithm to the traditional IoTES model. We evaluated our technique for encryption algorithms with available security levels and compared the accuracy of our model with traditional IoTES. Our model improves IoTES by helping users make security-oriented decisions while choosing the appropriate algorithm for their IoT data.

A Methodology for Bankruptcy Prediction in Imbalanced Datasets using eXplainable AI (데이터 불균형을 고려한 설명 가능한 인공지능 기반 기업부도예측 방법론 연구)

  • Heo, Sun-Woo;Baek, Dong Hyun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.45 no.2
    • /
    • pp.65-76
    • /
    • 2022
  • Recently, not only traditional statistical techniques but also machine learning algorithms have been used to make more accurate bankruptcy predictions. But the insolvency rate of companies dealing with financial institutions is very low, resulting in a data imbalance problem. In particular, since data imbalance negatively affects the performance of artificial intelligence models, it is necessary to first perform the data imbalance process. In additional, as artificial intelligence algorithms are advanced for precise decision-making, regulatory pressure related to securing transparency of Artificial Intelligence models is gradually increasing, such as mandating the installation of explanation functions for Artificial Intelligence models. Therefore, this study aims to present guidelines for eXplainable Artificial Intelligence-based corporate bankruptcy prediction methodology applying SMOTE techniques and LIME algorithms to solve a data imbalance problem and model transparency problem in predicting corporate bankruptcy. The implications of this study are as follows. First, it was confirmed that SMOTE can effectively solve the data imbalance issue, a problem that can be easily overlooked in predicting corporate bankruptcy. Second, through the LIME algorithm, the basis for predicting bankruptcy of the machine learning model was visualized, and derive improvement priorities of financial variables that increase the possibility of bankruptcy of companies. Third, the scope of application of the algorithm in future research was expanded by confirming the possibility of using SMOTE and LIME through case application.

A Novel Grasshopper Optimization-based Particle Swarm Algorithm for Effective Spectrum Sensing in Cognitive Radio Networks

  • Ashok, J;Sowmia, KR;Jayashree, K;Priya, Vijay
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.520-541
    • /
    • 2023
  • In CRNs, SS is of utmost significance. Every CR user generates a sensing report during the training phase beneath various circumstances, and depending on a collective process, either communicates or remains silent. In the training stage, the fusion centre combines the local judgments made by CR users by a majority vote, and then returns a final conclusion to every CR user. Enough data regarding the environment, including the activity of PU and every CR's response to that activity, is acquired and sensing classes are created during the training stage. Every CR user compares their most recent sensing report to the previous sensing classes during the classification stage, and distance vectors are generated. The posterior probability of every sensing class is derived on the basis of quantitative data, and the sensing report is then classified as either signifying the presence or absence of PU. The ISVM technique is utilized to compute the quantitative variables necessary to compute the posterior probability. Here, the iterations of SVM are tuned by novel GO-PSA by combining GOA and PSO. Novel GO-PSA is developed since it overcomes the problem of computational complexity, returns minimum error, and also saves time when compared with various state-of-the-art algorithms. The dependability of every CR user is taken into consideration as these local choices are then integrated at the fusion centre utilizing an innovative decision combination technique. Depending on the collective choice, the CR users will then communicate or remain silent.

Short-term Scheduling Optimization for Subassembly Line in Ship Production Using Simulated Annealing (시뮬레이티드 어닐링을 활용한 조선 소조립 라인 소일정계획 최적화)

  • Hwang, In-Hyuck;Noh, Jac-Kyou;Lee, Kwang-Kook;Shin, Jon-Gye
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.1
    • /
    • pp.73-82
    • /
    • 2010
  • Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

A Geographic Routing Algorithm to Prolong the Lifetime of MANET (MANET에서의 네트워크 수명을 연장시키는 위치기반 라우팅 기법)

  • Lee, Ju-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.119-125
    • /
    • 2010
  • In ad-hoc networks, dynamically reconfigurable and temporary wireless networks, all mobile devices cooperatively maintain network connectivity with no assistance of base stations while they have limited amounts of energy that is used in different rates depending on the power level. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other and network lifetime will be shortened. Consequently, it is very important to develop a technique to efficiently consume the limited amounts of energy resources so that the network lifetime is maximized. In this paper, geographical localized routing is proposed to help making smarter routing decision using only local information and reduce the routing overhead. The proposed localized routing algorithm selects energy-aware neighbors considering the transmission energy and error rate over the wireless link, and the residual energy of the node, which enables nodes to achieve balanced energy-consumption and the network lifetime to prolong.