• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.60
• /
• pp.37-46
• /
• 2000

A biomechanical model of lower extremity in seated postures was developed to assess muscular activities of lower extremity involved in a variety of foot pedal operations. The model incorporated four rigid body segments with the twenty-four muscles to represent lower extremity This study deals with quasi-static movement to investigate dynamic movement effect in seated foot operation. It is found that optimization method which has been used for modeling the articulated body segments does not predict the forces generated from biarticular muscles and antagonistic muscles reasonably. So, the revised nonlinear optimization scheme was employed to consider the synergistic effects of biarticular muscles and the antagonistic muscle effects from the stabilization of the joint. For the model validation, three male subjects performed the experiments in which EMG activities of the nine lower extremity muscles were measured. Predicted muscle forces were compared with the corresponding EMG amplitudes and it showed no statistical difference. For the selection of optimal seated posture, a physiological meaningful criterion was developed for muscular load sharing developed. For exertion levels, the transition point of type F motor unit of each muscle is inferred by analyzing the electromyogram at the seated postures. Also, for predetermined seated foot operations exertion levels, the recruitment pattern is identified in the continuous exertion, by analyzing the electromyogram changes due to the accumulated muscle fatigue.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.24 no.2
• /
• pp.71-77
• /
• 2019

This study proposes a circulating current reduction method that uses high-frequency voltage compensation when carrier phase difference occurs between two inverters in MSIS. In MSIS, inverters are configured in parallel to increase power capacity and to increase efficiency by using inverters only as needed. However, in the parallel inverter structure, circulating current is inevitably generated. Circulating current increases the stress on the switch, adversely affects the current control performance, and renders load sharing difficult. The proposed method compensates for the output voltage reference of the slave module by using the high-frequency voltage so that the switching pattern of each module is matched even in asynchronous carriers. The validity of the proposed method is verified by simulations and experiments with 600 W IPMSM.

• Journal of Power Electronics
• /
• v.19 no.3
• /
• pp.665-675
• /
• 2019

Renewable energy based on photovoltaic systems is beginning to play an important role to supply power to remote areas all over the world. Owing to the lower output voltage of photovoltaic arrays, high gain DC-DC converters with a high efficiency are required in practice. This paper presents a novel interleaved DC-DC boost converter with a high voltage gain, where the input terminal is interlaced in parallel and the output terminal is staggered in series (IPOSB). The IPOSB configuration can reduce input current ripples because two inductors are interlaced in parallel. The double output capacitors are charged in staggered parallel and discharged in series for the load. Therefore, IPOSB can attain a high step-up conversion and a lower output voltage ripple. In addtion, the output voltage can be automatically divided by two capacitors, without the need for extra sharing control methods. At the same time, the voltage stress of the power devices is lowered. The inrush current problem of capacitors is restrained by the inductor when compared with high gain converters with a switching-capacitor structure. The working principle and steady-state characteristics of the converter are analyzed in detail. The correctness of the theoretical analysis is verified by experimental results.

• Journal of the Korean Society of Industry Convergence
• /
• v.25 no.6_3
• /
• pp.1199-1206
• /
• 2022

Fossil fuels are one of the various energy sources used by humans, and industrial development has been achieved by relying on fossil fuels for a long time in the past. In order to respond to the depletion of fossil fuels and climate change, the world is trying to build an eco-friendly energy ecosystem. Research on efficiency improvement using renewable energy and ESS in various ways for energy conversion is being promoted. In this paper, a microgrid for industrial complexes was designed, constructed, and demonstrated. It was operated in two modes: an independent mode that each plant generates and uses independently and a connected operation mode that allows energy sharing between factories. In the case of independent mode, PV and PCS were intermittently stopped and restarted according to the status change of SoC section of each site. But, in the case of the connected operation mode, stable power supply was confirmed through power transaction through the operation of the entire SoC. This paper presented and verified an algorithm to stably supply power to industrial complexes consisting of various consumers with different load characteristics.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.1-7
• /
• 2022

This paper aims to compare the mean object size of M/G/1/PS model with that of M/BP/1 model used in the web service. The mean object size is one of important measure to control and manage web service economically. M/G/1/PS model utilizes the processor sharing in which CPU rotates in round-robin order giving time quantum to multiple tasks. M/BP/1 model uses the Bounded Pareto distribution to describe the web service according to file size. We may infer that the mean waiting latencies of M/G/1/PS and M/BP/1 model are equal to the mean waiting latency of the deterministic model using the round robin scheduling with the time quantum. Based on the inference, we can find the mean object size of M/G/1/PS model and M/BP/1 model, respectively. Numerical experiments show that when the system load is smaller than the medium, the mean object sizes of the M/G/1/PS model and the M/BP/1 model become the same. In particular, when the shaping parameter is 1.5 and the lower and upper bound of the file size is small in the M/BP/1 model, the mean object sizes of M/G/1/PS model and M/BP/1 model are the same. These results confirm that it is beneficial to use a small file size in a web service.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.213-226
• /
• 2011

In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.384-394
• /
• 2008

A wireless router is a device which allows several wireless clients to share an internet line using NAT (Network Address Translation). In a school or a small office environment where many clients use multiple wireless routers, a client may select anyone of wireless routers so that most clients can be clustered to a small set of the wireless routers. In such a case, there exists load unbalancing problem between clients and wireless routers. One of its result is that clients using the busiest router get poor service. The other is that the resource utilization of the whole wireless routers becomes very low. In order to resolve the problems, we propose a load sharing scheme to maximize network bandwidth utilization based on multiple SSID. In a time internal, the proposed scheme keeps to show the available bandwidth information of all the possible wireless routers to clients through multiple SSID. A new client can select the most available band with router. This scheme allows to achieve a good load balancing between clients and routers in terms of bandwidth utilization. We implemented the proposed scheme with ASUS WL 500G wireless router and performed experiments. Experimental results show the bandwidth utilization improvement compared to the existing method.

• Journal of the Korean Geotechnical Society
• /
• v.21 no.3
• /
• pp.159-168
• /
• 2005

In the previous studies, settlement behaviors of granular compaction piles have generally been analyzed with an evaluation of the settlement reduction factor based on tile load-sharing ratio and the replacement ratio. In this approach, however, since the reinforced ground with granular compaction piles is simplified as the composite ground, only the difference of a relative vertical strength between piles and soils is taken into account without reflecting lateral behaviors of granular compaction piles. In the companion research paper, the method of estimating the settlement of granular compaction piles was proposed by synthetically considering a vertical strength of the ground, lateral behaviors of granular compaction piles, the strength of pile materials, a pile diameter, and an installation distance of the pile. In the presented study, to validate a propriety of the previously proposed method, large scale field load tests and three dimensional numerical analyses are performed. The results are analyzed in detail and compared with the predicted settlements by the proposed method. Finally, a simple method to estimate the settlement of granular compaction piles is suggested for an easy application of the practical design.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.650-664
• /
• 2000

NOW(Network of Workstations) is considered as a platform for running parallel programs by many people. One of the fundamental problems that must be addressed to achieve good performance for parallel programs on NOW is the determination of efficient job scheduling policies. Currently most research on NOW assumes that all the workstations in the NOW have the same processing power. In this paper we consider a NOW in which workstations may have different computing power. We introduce 10 classes of space sharing-based scheduling policies that can be applied to the NOW with heterogeneous computing power. We compare the performance of these scheduling policies by using the simulator which accepts synthetically generated sequential and parallel workloads and generates the response time and waiting time of parallel jobs as performance indices of various scheduling strategies. Through the experiments the case when a parallel program is partitioned heterogeneously in proportion to the computing power of workstations is shown to have better performance than when a parallel program is partitioned into parallel processes of the same size. When the owner returns to the workstation which is executing a parallel process, the policy which just lowers the priority of the parallel process shows better performance than the one which migrates the parallel process to a new idle workstation. Among the policies which use heterogeneous partitioning and process priority lowering, the adaptive policy performed best across the wide range of inter-arrival time of parallel programs but when the load imbalance among parallel processes becomes very high, the modified adaptive policy performed better.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.