• Journal of the Korea Society for Simulation
• /
• v.32 no.3
• /
• pp.67-74
• /
• 2023

A semiconductor fabrication facility(FAB) is one of the most capital-intensive and large-scale manufacturing systems which operate under complex and uncertain constraints through hundreds of fabrication steps. To improve fab performance with intuitive scheduling, practitioners have used weighted-sum scheduling. Since the determination of weights in the scheduling significantly affects fab performance, they often rely on simulation-based decision making for obtaining optimal weights. However, a large-scale and high-fidelity simulation generally is time-intensive to evaluate with an exhaustive search. In this study, we investigated three sampling methods (i.e., Optimal latin hypercube sampling(OLHS), Genetic algorithm(GA), and Decision tree based sequential search(DSS)) for the optimization. Our simulation experiments demonstrate that: (1) three methods outperform greedy heuristics in performance metrics; (2) GA and DSS can be promising tools to accelerate the decision-making process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.916-937
• /
• 2023

Most of the existing Distributed Denial-of-Service mitigation schemes in Software-Defined Networking are only implemented in the network domain managed by a single controller. In fact, the zombies for attackers to launch large-scale DDoS attacks are actually not in the same network domain. Therefore, abnormal traffic of DDoS attack will affect multiple paths and network domains. A single defense method is difficult to deal with large-scale DDoS attacks. The cooperative defense of multiple domains becomes an important means to effectively solve cross-domain DDoS attacks. We propose an efficient multi-domain DDoS cooperative defense mechanism by integrating blockchain and SDN architecture. It includes attack traceability, inter-domain information sharing and attack mitigation. In order to reduce the length of the marking path and shorten the traceability time, we propose an AS-level packet traceability method called ASPM. We propose an information sharing method across multiple domains based on blockchain and smart contract. It effectively solves the impact of DDoS illegal traffic on multiple domains. According to the traceability results, we designed a DDoS attack mitigation method by replacing the ACL list with the IP address black/gray list. The experimental results show that our ASPM traceability method requires less data packets, high traceability precision and low overhead. And blockchain-based inter-domain sharing scheme has low cost, high scalability and high security. Attack mitigation measures can prevent illegal data flow in a timely and efficient manner.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.8
• /
• pp.127-136
• /
• 2009

Voice of the customer(VOC) is a term used in business and information technology(IT) to describe the process of capturing a customer's requirements in enterprises or various organizations. Recently, in order to satisfy customer's needs, enterprises try to utilize VOC at recurrence prevention of problems and their improvement activities, planning and development of product/service by processing, storing, and analyzing VOC. Until now, VOC management systems are introduced around service industries such as hotel business and insurance/financial business, etc. This paper proposes an integrated management scheme of VOC which are captured by various communication channels and describes a case of implementing an integrated VOC management system on the basis of the proposed scheme for the large-scale manufacturing company. By the implemented system, VOC are stored and utilized as the important knowledge assets of enterprises.

• Journal of Internet Computing and Services
• /
• v.25 no.3
• /
• pp.35-41
• /
• 2024

As online activities have rapidly increased due to recent digital changes and the impact of COVID-19, the importance of large-scale data processing and maintenance is increasing. This study compares the performance of the two main types of databases widely used for data storage and management: Relational Database Management Systems (RDBMS) and Non-Relational Databases (NoSQL). Specifically, we measured and evaluated the execution time of data insertion, query, and deletion functions using MySQL, a representative example of RDBMS, and Redis, a representative example of NoSQL. The experimental results showed that Redis showed performance about 5.84 times faster in data insertion, 6.61 times faster in query, and 12.33 times faster in deletion than MySQL. These results demonstrate that Redis provides superior performance, especially in environments requiring large-scale data processing and maintenance. Therefore, companies and online service providers can choose NoSQL databases such as Redis to ensure more efficient data management solutions. We hope this study will be an essential reference when selecting a database based on data processing performance.

• Smart Structures and Systems
• /
• v.25 no.4
• /
• pp.487-499
• /
• 2020

This paper proposes a novel approach to model updating for a large-scale cable-stayed bridge based on ambient vibration tests coupled with a hybrid metaheuristic search algorithm. Vibration measurements are carried out under excitation sources of passing vehicles and wind. Based on the measured structural dynamic characteristics, a finite element (FE) model is updated. For long-span bridges, ambient vibration test (AVT) is the most effective vibration testing technique because ambient excitation is freely available, whereas a forced vibration test (FVT) requires considerable efforts to install actuators such as shakers to produce measurable responses. Particle swarm optimization (PSO) is a famous metaheuristic algorithm applied successfully in numerous fields over the last decades. However, PSO has big drawbacks that may decrease its efficiency in tackling the optimization problems. A possible drawback of PSO is premature convergence leading to low convergence level, particularly in complicated multi-peak search issues. On the other hand, PSO not only depends crucially on the quality of initial populations, but also it is impossible to improve the quality of new generations. If the positions of initial particles are far from the global best, it may be difficult to seek the best solution. To overcome the drawbacks of PSO, we propose a hybrid algorithm combining GA with an improved PSO (HGAIPSO). Two striking characteristics of HGAIPSO are briefly described as follows: (1) because of possessing crossover and mutation operators, GA is applied to generate the initial elite populations and (2) those populations are then employed to seek the best solution based on the global search capacity of IPSO that can tackle the problem of premature convergence of PSO. The results show that HGAIPSO not only identifies uncertain parameters of the considered bridge accurately, but also outperforms than PSO, improved PSO (IPSO), and a combination of GA and PSO (HGAPSO) in terms of convergence level and accuracy.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.26 no.2
• /
• pp.149-155
• /
• 2020

Since marine accidents cause large-scale damage to human lives and the marine environment, prompt response measures are crucial including salvage operations for ships and cargoes along with lifesaving operations. In Korea, marine salvage operations are mainly dependent on global salvage companies in case of large-scale marine accidents due to lack of national capacity for marine salvage. The purpose of this study was to suggest public measures for the promotion of the private salvage industry by identifying the current situation and problems in the domestic marine salvage industry. As a result of the study, the measures of setting up a dedicated agency to support the domestic salvage industry and the function of the dedicated agency were identified and presented. In addition, the main points of the bill of "Law on the Promotion of the Domestic Salvage Industry" were presented to support and promote the salvage industry. To prepare the draft bill of law, relevant domestic laws and international conventions were examined to define the terms and regulations. Based on the legislation enacted as a result of this study, relevant ministries should focus on the legislative process. Legislation can be pursued by competent ministries in cooperation with the private sector and academia. It is expected that this study will help in the development of the domestic marine salvage industry and enhance the national response capacity for marine accidents in Korea.

• Management & Information Systems Review
• /
• v.36 no.4
• /
• pp.129-148
• /
• 2017

Conventional exhibition management information systems recommend tourist attractions that are close to the place in which an exhibition is held. Some recommended attractions by the location-based recommendation could be meaningless when nothing is related to the exhibition's topic. Our goal is to recommend attractions that are related to the content presented in the exhibition, which can be coined as content-based recommendation. Even though human exhibition curators can do this, the quality is limited to their manual task and knowledge. We propose an automatic way of discovering attractions relevant to an exhibition of interests. Language resources are incorporated to discover attractions that are more meaningful. Because a typical single machine is unable to deal with such large-scale language resources efficiently, we implemented the algorithm on top of Apache Spark, which is a well-known distributed computing framework. As a user interface prototype, a web-based system is implemented that provides users with a list of relevant attractions when users are browsing exhibition information, available at http://bike.snu.ac.kr/WARP. We carried out a case study based on Korean Tourism Organization Linked Open Data with Korean Wikipedia as a language resource. Experimental results are demonstrated to show the efficiency and effectiveness of the proposed system. The effectiveness was evaluated against well-known exhibitions. It is expected that the proposed approach will contribute to the development of both exhibition and tourist industries by motivating exhibition visitors to become active tourists.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.658-667
• /
• 2017

The demand for large-scale storage systems has continued to grow due to the emergence of multimedia, social-network, and big-data services. In order to improve the response time and reduce the load of such large-scale storage systems, DRAM-based in-memory cache systems are becoming popular. However, the high cost of DRAM severely restricts their capacity. While the method of compressing cache entries has been proposed to deal with the capacity limitation issue, compression and decompression, which are technically difficult to parallelize, induce significant processing overhead and in turn retard the response time. A selective compression scheme is proposed in this paper for in-memory file system caches that rapidly estimates the compression ratio of incoming cache entries with their Shannon entropies and compresses cache entries with low compression ratio. In addition, a description is provided of the design and implementation of an in-kernel in-memory file system cache with the proposed selective compression scheme. The evaluation showed that the proposed scheme reduced the execution time of benchmarks by approximately 18% in comparison to the conventional non-compressing in-memory cache scheme. It also provided a cache hit ratio similar to the all-compressing counterpart and reduced 7.5% of the execution time by reducing the compression overhead. In addition, it was shown that the selective compression scheme can reduce the CPU time used for compression by 28% compared to the case of the all-compressing scheme.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.225-234
• /
• 2015

Nowadays a Virtual Power Plant (VPP) represents an aggregation of distributed energy resource such as Distributed Generation (DG), Combined Heat and Power generation (CHP), Energy Storage Systems (ESS) and load in order to operate as a single power plant by using Information and Communication Technologies, ICT. The VPP has been developed and verified based on a single virtual plant platform which is connected with a number of various distributed energy resources. As the VPP's distributed energy resources increase, so does the number of data from distributed energy. Moreover, it is obviously inefficient in the aspects of technique and cost that a virtual plant platform operates in a centralized manner over widespread region. In this paper the concept of the large-scale VPP which can reduce a error probability of system's load and increase the robustness of data exchange among distributed energy resources will be proposed. In addition, it can directly control and supervise energy resource by making small size's virtual platform which can make a optimal resource scheduling to consider of variable and sensitive load in the large-scale VPP. It makes certain the result is verified by simulation.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.2
• /
• pp.103-116
• /
• 2017

In this paper, we present the design and implementation of a large-scale qualitative spatial reasoner, which can derive new qualitative spatial knowledge representing both topological and directional relationships between two arbitrary spatial objects in efficient way using Aparch Spark SQL. Apache Spark SQL is well known as a distributed parallel programming environment which provides both efficient join operations and query processing functions over a variety of data in Hadoop cluster computer systems. In our spatial reasoner, the overall reasoning process is divided into 6 jobs such as knowledge encoding, inverse reasoning, equal reasoning, transitive reasoning, relation refining, knowledge decoding, and then the execution order over the reasoning jobs is determined in consideration of both logical causal relationships and computational efficiency. The knowledge encoding job reduces the size of knowledge base to reason over by transforming the input knowledge of XML/RDF form into one of more precise form. Repeat of the transitive reasoning job and the relation refining job usually consumes most of computational time and storage for the overall reasoning process. In order to improve the jobs, our reasoner finds out the minimal disjunctive relations for qualitative spatial reasoning, and then, based upon them, it not only reduces the composition table to be used for the transitive reasoning job, but also optimizes the relation refining job. Through experiments using a large-scale benchmarking spatial knowledge base, the proposed reasoner showed high performance and scalability.