• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.2
• /
• pp.33-39
• /
• 2015

Power supplying capacity of the distribution feeder should be maintained within thermal capacity of the wire. This paper presents the minimum spanning tree based load balancing technique to release multiple overloading of distribution feeders. In order to minimize number of involved backup feeders, Dijkstra and Prim algorithm are adopted to construct minimum spanning tree. Simulation testing result based on part of KEPCO's commercial distribution systems shows effectiveness of proposed scheme.

• Geomechanics and Engineering
• /
• v.14 no.3
• /
• pp.271-281
• /
• 2018

A jointed rock slope stability evaluation was simulated by a discontinuous deformation analysis numerical method to investigate the process and safety factors for different crack distributions and different overloading situations. An optimized method using Discontinuous Deformation Analysis for Rock Failure (DDARF) is presented to perform numerical investigations on the jointed rock slope stability evaluation of the Dagangshan hydropower station. During the pre-processing of establishing the numerical model, an integrated software system including AutoCAD, Screen Capture, and Excel is adopted to facilitate the implementation of the numerical model with random joint network. These optimizations during the pre-processing stage of DDARF can remarkably improve the simulation efficiency, making it possible for complex model calculation. In the numerical investigations on the jointed rock slope stability evaluations using the optimized DDARF, three calculation schemes have been taken into account in the numerical model: (I) no joint; (II) two sets of regular parallel joints; and (III) multiple sets of random joints. This model is capable of replicating the entire processes including crack initiation, propagation, formation of shear zones, and local failures, and thus is able to provide constructive suggestions to supporting schemes for the slope. Meanwhile, the overloading numerical simulations under the same three schemes have also been performed. Overloading safety factors of the three schemes are 5.68, 2.42 and 1.39, respectively, which are obtained by analyzing the displacement evolutions of key monitoring points during overloading.

• Journal of Yeungnam Medical Science
• /
• v.34 no.1
• /
• pp.19-28
• /
• 2017

The incidence of type 2 diabetes mellitus and insulin resistance is growing rapidly. Multiple organs including the liver, skeletal muscle and adipose tissue control insulin sensitivity coordinately, but the mechanism of skeletal muscle insulin resistance has not yet been fully elucidated. However, there is a growing body of evidence that lipotoxicity induced by mitochondrial dysfunction in skeletal muscle is an important mediator of insulin resistance. However, some recent findings suggest that skeletal mitochondrial dysfunction generated by genetic manipulation is not always correlated with insulin resistance in animal models. A high fat diet can provoke insulin resistance despite a coordinate increase in skeletal muscle mitochondria, which implies that mitochondrial dysfunction is not mandatory in insulin resistance. Furthermore, incomplete fatty acid oxidation by excessive nutrition supply compared to mitochondrial demand can induce insulin resistance without preceding impairment of mitochondrial function. Taken together we suggested that skeletal muscle mitochondrial overloading, not mitochondrial dysfunction, plays a pivotal role in insulin resistance.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1542-1555
• /
• 1999

This paper proposes an algorithm for class hierarchies which can optimize member data and member function. This algorithm considers single/multiple inheritance, static/dynamic binding, overloading/overriding, pure virtual/virtual function, and constructor on the hierarchy of C++ class. We need to eliminate unused function that possesses many component element, because the program uses a limited of function in class hierarchies. Previous works on slicing mainly focused on selecting output data and including the related program statement. It was consists of structured programming language and also centralized on error detection, maintenance, and flexible testing. In this paper, we extend to the object-oriented language, makes a linked-table for objects to raise the efficiency of information management, and proposes necessary algorithm for optimizing system Through this process, we can obtain the simplification of program code and the progress of system performance by eliminating unused member data and member function.

• Journal of Information Technology Applications and Management
• /
• v.16 no.1
• /
• pp.21-36
• /
• 2009

As the World Wide Web (WWW) has become a major channel for information delivery, the data accumulated in the Internet increases at an incredible speed, and it derives the advances of information search technologies. It is the search engine that solves the problem of information overloading and helps people to identify relevant information. However, as search engines become a powerful tool for finding information, the opportunities of plagiarizing have increased significantly in e-Learning. In this paper, we developed an online plagiarism detection system for detecting plagiarized documents that incorporates the functions of search engines and acts in exactly the same way of plagiarizing. The plagiarism detection system uses morpheme analysis to improve the performance and sentence-based comparison to investigate document comes from multiple sources. As a result of applying this system in e-Learning, the performance of plagiarism detection was improved.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.158-170
• /
• 2021

Virtualization technologies are being adopted and broadly utilized in many fields and at different levels. In cloud computing, achieving load balancing across large distributed virtual machines is considered a complex optimization problem with an essential importance in cloud computing systems and data centers as the overloading or underloading of tasks on VMs may cause multiple issues in the cloud system like longer execution time, machine failure, high power consumption, etc. Therefore, load balancing mechanism is an important aspect in cloud computing that assist in overcoming different performance issues. In this research, we propose a new approach that combines the advantages of different task allocation algorithms like Round robin algorithm, and Random allocation with different threshold techniques like the VM utilization and the number of allocation counts using least connection mechanism. We performed extensive simulations and experiments that augment different scheduling policies to overcome the resource utilization problem without compromising other performance measures like makespan and execution time of the tasks. The proposed system provided better results compared to the original round robin as it takes into consideration the dynamic state of the system.

• Journal of Korean Society on Water Environment
• /
• v.20 no.2
• /
• pp.190-195
• /
• 2004

A new technology for advanced wastewater treatment was developed using a modified Rotating Biological Contactor (RBC) process, named as Rotating Activated Bacillus Contactor (RABC) process that utilizes Bacillus sp., the facultatively anaerobic or activated microaerophilic bacteria on multiple-stage reticular rotating carriers, as a predominant species. The RABC process for a municipal wastewater with relatively low concentrations of organics, nitrogen, and phosphorus showed stable and high removal efficiencies, less than $BOD_5$ 10 mg/L, T-N 15 mg/L, and T-P 1.5 mg/L in final effluent. The performance load of RABC process was shown to be $1.23kg{\cdot}BOD/m^2{\cdot}day$ for the first stage (average $0.31kg{\cdot}BOD/m^2{\cdot}day$ for the total stages) based on both removed BOD and converted disc area corresponding to the reticular one. The sludge produced in the RABC process is characterized by low generation rate (about $0.18kg{\cdot}MLSS/kg{\cdot}BOD$) and excellent settleability. The number ratio of Bacillus ($2.4{\times}10^6CFU/ml$) to heterotrophic bacteria ($3.6{\times}10^7CFU/ml$) inhabiting in the biofilms of the RABC process was 6.7 %, indicating that Bacillus sp. was a predominant species in the biofilms. The RABC process with reticular rotating carriers showed its excellent performance for the advanced wastewater treatment without any offensive odor problem due to organic overloading.

• The Journal of the Korea Contents Association
• /
• v.11 no.4
• /
• pp.18-26
• /
• 2011

According that smart phones have been widely used, their users can easily access various information around the devices through location information services equipped to the smart phone devices. In this paper, we propose a WeWhere which is a system of client-server model for providing the current location among several smart phone users in real time. A client-side smartphone user send to a server his/her current location obtained by applying location information service provided from smart phones and receive location information of all smartphone users connected to the user from the server. The all location information is displayed on a smartphone of a user in client-side and users can track location of their related users. All most 200,000 persons in the world have used the proposed system, WeWhere, normally without overloading of a server system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2834-2851
• /
• 1997

In this paper, a design and implementation of VHDL compiler front-end, aims at supporting the full-set of VHDL '87 & '93 LRM and carring out the preprocessing of VHDL-to-C, is described. The VHDL compiler front-end includes 1)the symbol tree of analyzed data to represent the hierarchy, the scope and visibility, the overloading and homograph, the concurrent multiple stacks in VHDL, 2)the data structure and supportig routies to deal with the objects, the type and subtype, the attribute and operation in VHDL, 3)the analysis of the concurrent/sequential statements, the behavior/structural descriptions, of semantic token and the propagation of symbol & type to improve the registration and retrieval procedure of analyzed data. In the experiments with Validation Suite, the VHDL compiler front-end could support the full-set specification of VHDL LRM '87 & '93; and in the experiments to asses the performance of symantic token for the VHDL hierachy/visibility/concurrency/semantic checking, the improvement of about 20-30% could be achieved.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1194-1205
• /
• 1999

인과적 메시지 로깅은 정상수행시 낙관적 메시지 로깅의 장점을 가지고, 회복시 비관적 메시지 로깅의 장점을 가지고 있다. 본 논문에서는 회복 프로세스들간의 비동기성을 향상시키기 위한 인과적 메시지 로깅에 기반한 새로운 회복 알고리즘을 제안하고자 한다. 기존의 인과적 메시지 로깅 기반 회복 알고리즘들은 살아있는 프로세스들의 수행을 대기시키거나, 회복 프로세스들간의 높은 동기성을 요구한다. 본 논문에서 제안하는 회복 알고리즘은 각 회복 프로세스가 자신의 회복만을 책임지게 함으로써, 여러 개의 프로세스들이 동시적으로 고장이 발생하더라도 회복시 살아있는 프로세스들의 수행을 대기시키지 않고, 회복 프로세스들 중 하나의 회복 프로세스에게만 과부하가 발생하지 않도록 한다. 또한, 제안하는 알고리즘은 각 회복 프로세스의 회복 과정이 다른 회복 프로세스의 연속적인 고장들에 의해 지연되지 않도록 한다. 본 논문에서는 제안하는 회복 알고리즘의 정당성을 증명하고, 시뮬레이션을 통해서 제안하는 회복 알고리즘이 기존 회복 알고리즘에 비해 고장난 프로세스의 평균회복시간을 단축시킨다는 것을 보여준다.Abstract Causal message logging has the advantages of optimistic message logging during failure-free execution and pessimistic message logging during recovery. In this paper, we present a new recovery algorithm based on causal message logging for improving asynchrony among recovering processes. Existing recovery algorithms based on causal message logging block the execution of live processes or require high synchronization among recovering processes. As each recovering process is responsible for only its recovery in our algorithm, the algorithm avoids blocking the execution of live processes during recovery even in concurrently multiple failures and overloading only one among recovering processes. Moreover, it allows the recovery of each recovering process not to be delayed by the continuous failures of other recovering processes. We prove the correctness of our recovery algorithm, and our simulation results show that our algorithm reduces the average recovery time of a failed process compared with the existing recovery algorithms.