• Journal of Korean Society of Transportation
• /
• v.31 no.2
• /
• pp.33-44
• /
• 2013

The land use-transportation models typically have complicated model structure that is good for empirical execution but bad for theoretical probe. This complexity makes it very difficult to derive the first-order conditions for system optimization in tractable forms. Yu and Rhee (2011) and Rhee (2012) show how to simplify the derivative of the model's objective function with respect to policy variables in the computable general equilibrium model of land use and transportation. However, the travel demand in their model was fixed. This drawback fundamentally limits the applicability of their methodology in the planning field. We relax this restriction. Once this is done, we can employ the methodology developed in analyzing the impacts of various types of policy instruments in the models where land market is treated endogenously and transportation network is embedded.

• Journal of Korea Water Resources Association
• /
• v.34 no.3
• /
• pp.241-251
• /
• 2001

A flow determination algorithm is proposed for the distributed hydrologic model. The advantages of a single flow direction scheme and multiple flow direction schemes are selectively considered to address the drawbacks of existing algorithms. A spatially varied flow apportioning factor is introduced in order to accommodate the accumulated area from upslope cells. The channel initiation threshold area(CIT) concept is expanded and integrated into the spatially distributed flow apportioning algorithm in order to delineate a realistic channel network. An application of a field example suggests that the linearly distributed flow apportioning scheme provides some advantages over existing approaches, such as the relaxation of over-dissipation problems near channel cells, the connectivity feature of river cells, the continuity of saturated areas and the negligence of the optimization of few parameters in existing algorithms. The effects of grid sizes are explored spatially as well as statistically.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.99-106
• /
• 2011

The emerging of ubiquitous computing and healthcare technologies provides us a strong platform to build sustainable healthcare applications especially those that require real-time information related to personal healthcare regardless of place. We realize that system stability, reliability and data protection are also important requirements for u-healthcare services. Therefore, in this paper, we designed a u-healthcare system which can be attached to the patient's body to measure vital signals, enhanced with USN secure sensor module. Our proposed u-healthcare system is using wireless sensor modules embedded with NLM-128 algorithm. In addition, PS-LFSR technique is applied to the NLM-128 algorithm to enable faster and more efficient computation. We included some performance statistical results in term of CPU cycles spent on NLM-128 algorithm with and without the PS-LFSR optimization for performance evaluation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4923-4939
• /
• 2019

In this paper, a secure transmission scheme based on the artificial noise is proposed for D2D communications underlaying the full-duplex cellular network, and a secure power allocation scheme to maximize the overall secrecy rate of both the cellular user and D2D transmitter node is presented. Firstly, the full-duplex base station transmits the artificial noise to guarantee the secure communications when it receives signals of cellular uplinks. Under this secure framework, it is found that improving the transmission power of the cellular user or the D2D transmitter node will degrade the secrecy rate of the other, although will improve itself secrecy rate obviously. Hence, a secure power allocation scheme to maximize the overall secrecy rate is presented subject to the security requirement of the cellular user. However, the original power optimization problem is non-convex. To efficiently solve it, we recast the original problem into a convex program problem by utilizing the proper relaxation and the successive convex approximation algorithm. Simulation results evaluate the effectiveness of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.785-791
• /
• 2006

A CF-Poll frame which contains the channel reservation time can be piggybacked in QoS-Data frame to increase the channel efficiency in HCCA. However, if any QSTA in the network uses the low physical transmission rate, the QoS-Data frame which includes the CF-Poll frame must be transmitted by the minimum transmission rate. Therefore, it can cause the decrease of the channel efficiency and the increase of the frame transmission delay for other traffic streams when any QSTA has the low physical transmission rate. In this paper, we define this phenomenon as the piggyback problem at the low physical transmission rate and evaluate the effect of this problem. In the simulation results, when a CF-Poll piggyback is used, the delay is increased about 25% if any QSTA has the low physical transmission rate, while the delay is decreased about 7.8% if all QSTA has the high physical transmission rate. We also found that the gain of the CF-Poll piggyback mechanism is achieved when all QSTA has higher physical transmission rate than 24 or 36Mbps.

• Journal of Electrical Engineering and Technology
• /
• v.1 no.4
• /
• pp.435-447
• /
• 2006

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.2
• /
• pp.81-89
• /
• 1996

A design method of fuzzy modeling is presented for the model identification of route choice of traffic problems.The proposed fuzzy modeling implements system structure and parameter identification in the eficient form of""IF..., THEN-.."", using the theories of optimization theory, linguistic fuzzy implication rules. Three kinds ofmethod for fuzzy modeling presented in this paper include simplified inference (type I), linear inference (type 21,and proposed modified-linear inference (type 3). The fuzzy inference method are utilized to develop the routechoice model in terms of accurate estimation and precise description of human travel behavior. In order to identifypremise structure and parameter of fuzzy implication rules, improved complex method is used and the least squaremethod is utilized for the identification of optimum consequence parameters. Data for route choice of trafficproblems are used to evaluate the performance of the proposed fuzzy modeling. The results show that the proposedmethod can produce the fuzzy model with higher accuracy than previous other studies -BL(binary logic) model,B(production system) model, FL(fuzzy logic) model, NN(neura1 network) model, and FNNs (fuzzy-neuralnetworks) model -.fuzzy-neural networks) model -.

• Journal of the Korean Society for Railway
• /
• v.15 no.2
• /
• pp.135-140
• /
• 2012

Interior Permanent Magnet Synchronous motors (IPMSM) with concentrated winding are superior to distributed winding in the power density point of view. But it causes huge amount of eddy current losses on the permanent magnet. This paper presents the optimal permanent magnet V-shape on the rotor of an interior permanent magnet synchronous motor to reduce the core losses and improve the performance. Each eddy current loss on permanent magnet has been investigated in detail by using FEM (Finite Element Method) instead of equivalent magnetic circuit network method in order to consider saturation and non-linear magnetic property. Simulation-based design of experiment is also applied to avoid large number of analyses according to each design parameter and consider expected interactions among parameters. Consequently, the optimal design to reduce the core loss on the permanent magnet while maintaining or improving motor performance is proposed by an optimization algorithm using regression equation derived and lastly, it is verified by FEM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1194-1203
• /
• 2004

The RR protocole, proposed in IETF mip6 WG and standardized by RFC 3775 at lune 2004, send a message 'Binding Update' that express MN's location information to CN safety and update location information. Standard RR protocole has some problems with initiating the protocol by the MN; it causes to increases in communication load in the home network, to increases communication delay between MN and CN. Also, is connoting vulnerability to against attacker who are on the path between CN and HA in security aspect. This paper proposes doing to delegate MN's location information update rights by HA new location information update method. That is, When update MN's location information to HA, Using MN's private key signed location information certificate use and this certificate using method that HA uses MN's location information at update to CN be. It decreases the route optimization overhead by reducing the number of messages as well as the using location information update time. Also, remove security weakness about against attacker who are on the path between CN and HA.