• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.117-122
• /
• 2018

A large-capacity three-phase system air conditioner recently includes an inverter circuit to reduce power consumption. The inverter circuit uses a DC voltage that comes from DC-link power capacitor with the function of rectifying, which means AC voltage to DC voltage using a diode. An electrolytic capacitor is generally used to satisfy the voltage ripple and current ripple conditions of a DC-link power capacitor used for rectifying. Reducing the capacitance of the capacitor decreases the size, weight, and cost of the circuit. This paper proposes an algorithm to reduce the input ripple current by combining the minimum point estimation phase locked loop (PLL) phase control and the average voltage d axis current control technique. When this algorithm was used, the input ripple current decreased by almost 90%. The current ripple of the DC-link capacitor decreased due to the decrease in input ripple current. The capacitor capacity can be reduced but the electrolytic capacitor has a heat generation problem and life-time limitations because of its large equivalent series resistance (ESR). This paper proposes a method to select a film capacitor considering the current ripple at DC-link stage instead of an electrolytic capacitor. The capacitance was selected considering the voltage limitation, RMS (Root Mean Square) current capacity, and RMS current frequency analysis. A $1680{\mu}F$ electrolytic capacitor can be reduced to a $20{\mu}F$ film capacitor, which has the benefit of size, weight and cost. These results were verified by motor operation.

• The Journal of Korea Robotics Society
• /
• v.11 no.3
• /
• pp.163-171
• /
• 2016

A modular manipulator in serial-chain structure usually consists of a series of modularized revolute joint and link modules. The geometric shapes of these modules affect the number of possible configurations of modular manipulator after assembly. Therefore, it is important to design the geometry of the joint and link modules that allow various configurations of the manipulators with minimal set of modules. In this paper, a new 1-DoF(degree of freedom) joint module and simple link modules are designed based on a methodology of joint configurations using a series of Rotational(type-R) and Twist(type-T) joints. Two of the joint modules can be directly connected so that two types of 2-DoFs joints could be assembled without a link module between them. The proposed geometries of joint and link modules expand the possible configurations of assembled modular manipulators compared to existing ones. Modular manipulator system of this research can be a cornerstone of user-centered markets with various solution but low-cost, compared to conventional manipulators of fixed-configurations determined by the provider.

• The Journal of Information Systems
• /
• v.15 no.3
• /
• pp.107-129
• /
• 2006

The purpose of this study is to provide and validate an IT cost model hi which we link among cost center, cost object and flexible cost driver. in order to accomplish this purpose, this study utilizes ethnographic research methodology. At first we develop the cost model where the flexible cost driver is the distribution basis of overhead cost. For each cost driver, unit cost management model is also proposed. Then we employ the structured design methodology to validate the model. Based on the IT Cost requirements of a case company, the IT cost system was designed and developed for its test. The result shows the model we developed in this study is appropriate for managing IT resources and further, can be used as a reference model for calculating chargeback rates of other departments and IT budget of IT department.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.16 no.6
• /
• pp.587-593
• /
• 2011

A new high power density and low cost Photovoltaic Power Conditioning System (PV PCS) with energy storage system is proposed. Its high power density and cost effectiveness can be achieved through the unification of the maximum power point tracker and battery charger/discharger. Despite of the reduced power stage, the proposed system can achieve the same performances of maximum power point tracking and battery charging/discharging as the conventional system. Moreover, the high voltage stress across the link-capacitor can be relieved through the series-connected link-capacitor with the battery. Therefore, a large number of series/parallel-connected link-capacitors can be reduced by 4-times. Especially, when the utility power failure happens, both photovoltaic and battery energies can be supplied to the load with only one power stage. Therefore, it features a simpler structure, less mass, lower cost, and fewer devices. Finally, to confirm the operation, validity, and features of the proposed system, theoretical analysis and experimental results from a single phase AC 220Vrms/1.5kW prototype are presented.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.546-558
• /
• 2017

The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.2
• /
• pp.49-54
• /
• 2012

As all kind of industry has developed, metal structure and machine instrument use bolt, pin, rivet and welding for assembly and combination. For pin and hinge, dimension accuracy is crucial to keep the operation and safety of the structure and machine instrument. In case of complex machine, the hinge for cover open-loop system is one of the significant design elements. Most of the hinges are being imported and assembled sine they give high technology development cost for its unit cost position. The reason is that the localization of hinge is inadequate. As the demand increase and the necessity of localization grow, it is now more important than ever to develop low cost structure. By the low cost structure, a new technology could be obtained for electronic product and structural hinge since it would enable for complex machine hinge to be guaranteed, technologically. Open-loop hinge is the link type and designed for the structure to keep constant open-loop. And, the hinge is examined in design stability by finite element analysis method. In this paper, the operation result is presented when the hinge for complex machine open-loop is designed for link type structure.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.89-99
• /
• 2003

Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1726-1734
• /
• 1993

This paper propose a survivable communication network design process using node degree that augments the usual traffic flow and cost analyses with previously ignored topological survivability and computing time considerations. At first, decide a initial topology, and then measure a throughput of network. If the throughput is smaller than the required traffic, add edge to the optimum place by using minimum node degree and link distance. Otherwise, drop useless edge by using maximum node degree, link distance and link utilization. This process is repeated until throughput equals to the required traffics. This Process designs a survivable communication network with the minimized cost and computing time and usual traffic flow. The design proceses that minimized computing time are freely select initial topology and easily design a large network. And these results of algorithm are compared with the Kris and Pramod's in order to analyses the perfmance of the designed network.

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

In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and link state. The information is stored in Link State Database (LSDB) located in each router and managed. If link states information is changed, routers inform their neighbor of link state information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual link state information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.