• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.123-130
• /
• 2004

Routing and wavelength assignment(RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing(WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the Proposed algorithm uses similar or fewer wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP which is currently known to be effective in practice.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.10
• /
• pp.4561-4568
• /
• 2011

In this paper, carrier comparison PWM method for voltage control of Vienna rectifier is discussed. In general, in industrial and communications applications, the two-level rectifier is used. However, this two-level rectifier has the limit of high THD and low efficiency. So, the studies of three-level rectifier has been carried out so far, and the Vienna rectifier circuit is the representative. The space vector pulse width modulation(SVPWM) method is generally used for Vienna rectifier, in which voltage vectors and duration time are calculated from the voltage reference. However, this method require very sophisticated and complex calculations, so realizing this method by software is very difficult. To overcome this disadvantage, simple carrier comparison PWM method for Vienna rectifier is proposed which is modified from the carrier comparison method for 3 level inverter. Furthermore, to verify the usefulness of the Vienna rectifier carrier comparison PWM the simulation and experiment are carried out.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.101-108
• /
• 2003

Construction of automated terminal it urgently demanded to gain the foundation of hub-port in north east Asia. Therefore we suggest an adequate operating system layout of automated terminal in Korea. In this paper the aim of automated terminal operating system is satisfied. four basic models are divided according to moving course of export and import cargo of each automated equipments, several input data are changed and analyzed dynamically by Trial and Error method, and then an optimized operating system model is selected, and designed for yard operating system layout on the basis of the selected model. Particularly, the productivity of automated port is up to the kind of automated equipments. However, because expense and present work process must be considered actually. In order to prevent confusion of the work, the method to optimize the present work and substitute prevent equipments and automated equipments was designed. It is a premise that ail the yard equipments described in this paper must be automatic except quay crane.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.1
• /
• pp.5-10
• /
• 2015

D2D (Device-to-Device) communication underlaying LTE-advanced networks is a promising technology to improve the system capacity and spectral efficiency. By sharing the same radio resources with cellular user equipments, D2D communications can significantly enhance the overall spectral efficiency. However, it may cause interference between D2D link and cellular link. Careful resource allocation and interference coordination between cellular and D2D communications are very important and need to be properly handled. This paper proposes a radio resource allocation scheme based on FFFR (Flexible Fractional Frequency Reuse) for D2D communication underlaying cellular networks. The base station selects randomly resource blocks assigned to cellular users, and reuses them for a D2D pair. Through simulations, we have confirmed that the proposed scheme improves the system throughput, reduces the computational complexity, and mitigates the interference of D2D link and cellular link.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.192-201
• /
• 2014

User scheduling boosts the Multi-User Multi-Input Multi-Output (MU-MIMO) gain by selecting an optimal set of users to increase the 802.11 Wi-Fi system capacities. Many kinds of user scheduling algorithms, however, fail to realize the advantages of MU-MIMO due to formidable Channel State Information (CSI) overhead. In this paper, we propose a user scheduling method considering such CSI exchange overhead and its MAC protocol, called ACE (Active CSI Exchange based User Scheduling for MU-MIMO Transmission). Unlike most proposals, where user scheduling is performed after an Access Point (AP) receives CSI from all users, ACE determines the best user set during the CSI exchange phase. In particular, the AP broadcasts a channel hint about previously scheduled users, and the remaining users actively send CSI reports according to their Effective Channel Gains (ECGs) calculated from the hint. Through trace-driven MATLAB simulations, we prove that the proposed scheme improves the throughput gain significantly.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.215-219
• /
• 2005

Generally, the mobile nodes in MANET have the limited power capacity available for actual communications. Thus, the power management is very important for packet routing or forwarding. Although MTPR, MBCR and MMBCR are proposed to treat the problem of power consumption, there have been few researches resolving the link breakdown that is occurred by the power exhaustion during transmission. In this sense, the reliable scheme should be required to ensure the routing connectivity. In this paper, we propose three schemes to enforce the routing connectivity. If the signal strength is dropped below a signal threshold, the candidate route is previously selected to prepare the link breakdown. Also, on multi-channel, we propose the lifetime increment scheme of a node that it manage its available power to the needed power of a new link. The simulation results show the enforcement of the link connectivity and the performance improvements of the delay time through the effective connection management.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.677-683
• /
• 2006

If a node stops functioning in an ad-hoc wireless network, routing paths involving the node will also fail, when construction of replacement routes is required. A major cause of node failure is energy exhaustion, and route replacements may in turn lead to successive node failures by making more nodes consume their energy. The result could be performance degradation of networks. Therefore it is important to ensure that nodes with limited remaining energy are not included in route construction from the beginning. In this paper we propose a new routing protocol, which takes residue energy of nodes into account in order to prevent node failures resulting from energy shortage. Our routing protocol examines the smallest value of node residue energy ($E_{m}$) from each of all possible routing paths and selects the path which has the largest value of $E_{m}$. We prove, through simulation, that our routing protocol extends the lifetime of nodes which have limited amount of energy, reducing chances of path replacement. It is also shown that our proposed protocol helps alleviate network performance degradation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.834-839
• /
• 2005

When a great variety of services become available to user through the broadband convergence network in the ubiquitous home environment, an intelligent agent is required to deal with the complexity of services and perceive intension of a user. Different from the old-fashioned command-based user interface for selecting services, conversation enables flexible and rich interactions between human and agents, but diverse expressions of the user's background and context make conversation hard to implement by using either user-initiative or system-initiative methods. To deal with the ambiguity of diverse expressions between user and agents, we have to apply hierarchial bayesian networks for the mixed initiative conversation. Missing information from user's query is analyzed by hierarchial bayesian networks to inference the user's intension so that can be collected through the agent's query. We have implemented this approach in ubiquitous home environment by implementing simulation program.

• Journal of Internet Computing and Services
• /
• v.18 no.2
• /
• pp.43-51
• /
• 2017

As the game industry is blooming, the generation of contents is far behind the consumption of contents. With this reason, it is necessary to afford the game contents considering level of game player's skill. In order to effectively solve this problem, Procedural Content Generation(PCG) using Artificial Intelligence(AI) is one of the plausible options. This paper proposes the procedural method to generate various monsters considering level of player's skill using genetic algorithm. One gene consists of the properties of a monster and one genome consists of genes for various monsters. A generated monster is evaluated by battle simulation with a player and then goes through selection and crossover steps. Using our proposed scheme, players adaptive monsters are generated procedurally based on genetic algorithm and the variety of monsters which are generated with different number of genome is compared.

• Applied Chemistry for Engineering
• /
• v.25 no.2
• /
• pp.204-208
• /
• 2014

This study investigated the effect of hydrogen permeance and selectivity, catalyst amount, $H_2O/CO$ ratio in a feed stream, and Ar sweep gas on the performance of a water gas shift reaction in a membrane reactor. It was observed that a minimum hydrogen selectivity of 100 was needed in a membrane reactor to obtain a hydrogen yield higher than the one at equilibrium and the hydrogen yield enhancement gradually decreased as the hydrogen permeance increased. The CO conversion in a membrane reactor initially increased with the catalyst amount and reached a plateau later for a membrane reactor with a low hydrogen permeance while the high CO conversion independent of a catalyst amount was observed for a membrane reactor with a high hydrogen permeance. For the $H_2O/CO$ ratio in a feed stream higher than 1.5, a hydrogen permeance had little effect on the CO conversion in a membrane reactor and it was found that a minimum Ar molar flow rate of $6.7{\times}10^{-6}mol\;s^{-1}$ was needed to achieve the CO conversion higher than the one at equilibrium in a membrane reactor.