• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.4
• /
• pp.768-773
• /
• 2010

In this paper, we study on an optimal design of a triple-band PIFA (Planar Inverted-F Antenna) of 433 MHz, 912 MHz and 2.45 GHz by using evolution strategy. Generally, the resonant frequency of the PIFA is determined by the width and length of a U-type slot used. However the resonant frequencies of the multiple U slots are varied by the mutual effect of the slots. Thus the optimal width and length of U-type slots are determined by using an optimal design program based on the evolution strategy. To achieve this, an interface program between a commercial EM analysis tool and the optimal design program is constructed for implementing the evolution strategy technique that seeks a global optimum of the objective function through the iterative design process consisting of variation and reproduction. The resonant frequencies of initial model are 439.5 MHz, 981.5 MHz and 2.563 GHz. However, the resonant frequencies of the triple-band PIFA yielded by the optimal design program are 430.5 MHz, 907 MHz and 2.4515 GHz. Measured resonant frequencies are 433.5 MHz, 905.5 MHz and 2.454GHz, which show a good agreement with the simulation results.

• Journal of Korean Society of Transportation
• /
• v.13 no.3
• /
• pp.67-86
• /
• 1995

It requires the detector system which can collect highly reliable traffic data in order to perform the real-time traffic signal control. This study is to decide the optimal shape of inductive loop for the real-time traffic signal control .This loop is located at the stopline in the signalized intersection for DS(Degree of Saturation) control. In order to find out the optimal shape of loop, 6types of experiments were performed . The results of the basic experiments of loops are as follows ; -the optimal number of turns for loop is 3 turns. -the impedance values of the loop detectors are similar to that of NEMA standards -the 1.8${\times}$4.5M loop is excellent for sensitivity in actual detection range of car length comparing to other shape of inductive loops. At the experimental of establishments of the optimal loop shape, it found that 1.8 4.5M loop has the highest values of $\DeltaL$ comparing to other types of loops, It means that the range of Lead-in cable length of this loop. And this loop is highly reliable in occpupancy time. Conclusivley, the 1.8${\times}$4.5M inductive loop is the optimal solution as a stop line loop detector for real -time traffic signal control.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.4
• /
• pp.53-60
• /
• 2004

Optimal design of the hybrid motor has been performed for the first stage of nanosat air launch vehicle using F-4E Phantom as mother plane. Selected design variables are number of ports, the initial oxidizer flux, the combustion chamber pressure, and the nozzle expansion ratio. GBM(Gradient Based Method) and GA(Genetic Algorithm) are simultaneously used to compare the versatility of each algorithm for optimal design in this problem. Also, two objective functions of motor weight, and length are treated separatedly in the optimization to study how the objective function can affect the optimal design. The design results show that the optimal design can be successfully achieved either using GBM or GA regardless of the choice of the objective function; motor weight or length. And nanosat air launch vehicle which has total mass of 704.74kg, and length of first stage 3.74m is designed.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.137-140
• /
• 2003

In this paper, we propose a new construction algorithm for the reversible variable-length code (RVLC) using a simplified average length function of the optimal Huffman code. RVLC is introduced as one of the error resilience tools in H.263+ and MPEG-4 owing to its error-correcting capability. The proposed algorithm demonstrates an improved performance in terms of the average codeword length over the existing HVLC algorithms.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.657-664
• /
• 2001

In our predecessor paper(Part I)[13], we introduced a graph that represents the crosstalk relationship among multicast connections in the photonic Banyan-type switching network, and found the upper bound on the degree of it. In this paper(Part II), we consider the number of routing rounds(i.e., scheduling length) required for SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks. Unfortunately, the problem to find an optimal scheduling length is NP-complete thus, we propose an approximation algorithm that gives its scheduling length is always within double of the upper bound on the optimal length. We also study the scheduling length on the Iink-disjoint(i.e., nonblocking) multicasting. Various nonblocking Banyan-type multicasting networks are found under the scheduling lengths.

• Tunnel and Underground Space
• /
• v.20 no.6
• /
• pp.465-474
• /
• 2010

Although the number of medium-length road tunnels, less than 1 km in length, has increased recently more than 30 percent each year, their ventilation and fire safety system design guidelines have not been established yet. The guidelines for long tunnel design are adopted even for the medium-length road tunnels. Therefore the necessity is brought up to optimize the ventilation and fire safety systems based on their own design guidelines. This study aims at determining the optimal start time of jet fan in case of 20 MW fires by analyzing smoke backlayering range, temperature distribution, range of poor visibility, evacuation time and critical velocity. The CFD study results are expected to contribute to propose the optimal fan operation mode.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.121-129
• /
• 2012

In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.367-377
• /
• 2006

This paper develops a periodic preventive maintenance(PM) policy following the expiration of warranty. Two types of warranty are considered: renewing warranty and non-renewing warranty. Also, we consider the situation where each PM cost is an increasing function of the PM effect. We determine the optimal number of PM's before replacing the system by a new one and the optimal length of period for the periodic PM following the expiration of warranty. Explicit solutions to determine the optimal periodic PM are presented for the Weibull distribution case.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.45 no.6
• /
• pp.83-95
• /
• 2003

In this study, a new concept in a paddy consolidation project is introduced in that curved parallel terracing with contour-lined layout is adopted in sloping areas instead of conventional rectangular terracing. The contoured layout reduces earth-moving considerably compared to rectangular methods in consolidation projects. The objective of the paper is to develop a combinatorial optimization model using the network theory for the design of contour-lined plots which minimizes the volume of earth moving. The results showed that as the length of short side of plot is longer or the land slope is steeper, the volume of earth moving for land leveling increases. The developed optimization model is applied for three consolidated districts and the resulting optimal earth moving is compared with the volume of earth from the conventional method. The shorter is the minimum length of short side of a polt with increases the number of plots, the less is the volume of earth. As the minimum length of short side is 20 m for efficient field works by farm machinery, the volume of earth moving of optimal plot is less by 21.0∼27.1 % than that of the conventional consolidated plots.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1554-1566
• /
• 2014

Cloud Computing allows application providers seamlessly scaling their services and enables users scaling their usage according to their needs. In this paper, using queuing game model, we present service scheduling schemes which are used in software as a service (SaaS). The object is maximizing the Cloud Computing platform's (CCP's) payoff via controlling the service requests whether to join or balk, and controlling the value of CCP's admission fee. Firstly, we treat the CCP as one virtual machine (VM) and analyze the optimal queue length with a fixed admission fee distribution. If the position number of a new service request is bigger than the optimal queue length, it balks. Otherwise, it joins in. Under this scheme, the CCP's payoff can be maximized. Secondly, we extend this achievement to the multiple VMs situation. A big difference between single VM and multiple VMs is that the latter one needs to decide which VM the service requests turn to for service. We use a corresponding algorithm solve it. Simulation results demonstrate the good performance of our schemes.