• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.4
• /
• pp.112-120
• /
• 2001

In this paper, the development of a new group controller for high-speed elevator is carried out utilizing the approach of an adaptive dual fuzzy logic. Some goals of control are the minimization of waiting time, mean-waiting time and long-waiting time in a high building, when a new hall call is generated, adaptive dual fuzzy controller evaluate traffic pattern and change appropriately the membership function of a fuzzy rule base. Controls for co-operation among elevators in a group control algorithm arte essential, and the most critical control function in the group controller is an effective and proper hall call assignment of elevators. The group elevator system utilizing adaptive dual fuzzy control reveals a great deal of improvement on its performance.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.205-213
• /
• 2014

A wind generator (WG) maximum power point tracking (MPPT) system is presented here. It comprises of a variable-speed wind generator, a high-efficiency boost-type dc/dc converter and a control unit. The advantages of the aimed system are that it does not call for the knowledge of the wind speed or the optimal power characteristics and that it operates at a variable speed, thus providing high efficiency. The WG operates at variable speed and thus suffers lower stress on the shafts and gears compared to constant-speed systems. It results in a better exploitation of the available wind energy, especially in the low wind-speed range of 2.5-4.5 m/s. It does not depend on the WG wind and rotor-speed ratings or the dc/dc converter power rating. Higher reliability, lower complexity and cost, and less mechanical stress of the WG. It can be applied to battery-charging applications.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.613-620
• /
• 2004

Traditionally, simulation method was used to test and evaluate the performance of communication protocol or functional elements for mobile communication service. In this Paper, PCSsim(Personal Communication System Simulator) was realized that can evaluate and review the call process of mobile communication service or to predict its performance by using the object-oriented simulation platform. PCSsim can simulate the base station and mobile host by considering the user's mobility, call generation rate and call duration time. In this paper, based on the simulation, presented the simulation results of hand-off generation ratio according to call generation, user's moving speed and call duration time both in residence area and commercial area, and it was confirmed that the hand-off rates in simulation and actual service environment have similar features. PCSsim can be used in adjusting the characteristics of base station fellowing the dynamic hand-off buffering or the characteristics of user's call in the design stage, and also can be used in building new mobile communication network by reflecting the characteristics of region where the base station is located and the mobility of the user.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.299-313
• /
• 2002

Recently, the demand for mobile communications and multimedia services has rapidly increased so that conventional cellular system cannot fulfill the requirement of users (capacity and QoS) any more. Therefore, the hierarchical cellular system has been suggested in order to guarantee the QoS and to admit large population of users. IMT-2000 adopts the hierarchical cellular structure, which requires a call control algorithm capable of manipulating and utilizing the complicated structure of hierarchical cellular structure with handiness and efficiency. In this thesis, as an improvement of conventional combined algorithm, a new call control algorithm considering the moving speed of terminal and bandwidth is suggested. This algorithm employs buffers and guard channels to reduce the failure rate. Also, this algorithm considers the moving speed of terminal and bandwidth to elevate the efficiency. Furthermore, calls are handled separately according to the moving speeds of terminal and bandwidths to improve the QoS and reduce the handover rate. As an evaluation of the suggested algorithm, a model hierarchical cellular system is constructed and simulations are conducted with various types of traffic. As the result of the simulations, such indices as block rate, drop rate, channel utilization, and the number of inter layer handovers are examined to demonstrate the excellency fo the suggested algorithm.

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.590-606
• /
• 2009

We present a static analyzer that detects memory leaks in C programs. It achieves relatively high accuracy at a relatively low cost on SPEC2000 benchmarks and several open-source software packages, demonstrating its practicality and competitive edge against other reported analyzers: for a set of benchmarks totaling 1,777 KLOCs, it found 332 bugs with 47 additional false positives (a 12.4% false-positive ratio), and the average analysis speed was 720 LOC/sec. We separately analyze each procedure's memory behavior into a summary that is used in analyzing its call sites. Each procedural summary is parameterized by the procedure's call context so that it can be instantiated at different call sites. What information to capture in each procedural summary has been carefully tuned so that the summary should not lose any common memory-leak-related behaviors in real-world C program. Because each procedure is summarized by conventional fixpoint iteration over the abstract semantics ('a la abstract interpretation), the analyzer naturally handles arbitrary call cycles from direct or indirect recursive calls.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.4
• /
• pp.1-15
• /
• 1990

With increasing ship's speed turnround and port time becomes a large percentage of total roundtrip time and this causes to accelerate the introduction of the various kind of modern handling equipment, the standardization of cargoes, and the improvement of the ship. However, it is still a drag on efficient operation of ship. Similarly, the turnround time at the container port is very important as a measure for the decision of the efficiency of port. To decrease operating coasts, the minimization of the time need to cargo handling at the ports of call must be achieved. Thus the optimization of the time need to cargo handling at the ports of call must be achieved. Thus the optimized Container Loading Plan is necessary, especially under the rapid speed of container operations. For the container loading plan, in this thesis, we use the hungarian method and the branch and bound method to get the initial disposition of both maximization of ship's GM and minimization of shift number to the obstructive container in a yard area. We apply the dynamic programming algorithm to get the final disposition for minimizing total turnroudn time and finally we analyzed the results to check whether the initial disposition is proper or not.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.593-603
• /
• 2000

In this paper, a dynamic route control scheme to increase speed of data communication over public network is presented. And a new structure of gateway which is suitable for the public network environments is proposed and analyzed. For dynamic allocation of transmission routing resources of the gateway and improvement of call processing ratio of the system, virtual queue is used. As results, route utilization ratio of the proposed scheme can be improved up to 60% as compared to the conventional fixed route control scheme. For the case of limited number of routes, it provides high speed data communication while maintaining delay time as low as possible. In addition, as the allocation period at call access node can be varied with the traffic in the proposed scheme, various traffics can be applied easily. Thus, it can be expected that the presented dynamic route control gateway may be suitable for application in high speed data communication over public network.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.501-511
• /
• 1996

Typical integrated service digital network(ISDN) switching systems have several shortcomings including cumulated long call set-up delay and difficulty in higher speed packet communication. The problems come from the nature of X.25 packet swiching technique used in the systems. In this thesis, to solve the above problems, the use of frame relay service within the TDX-10 ISDN switching system is proposed and a frame handling susbsystem(FHS) is designed in order to support the high speed frame relay service in the TDX-10 switching systems. In the proposed TDX-10 architecture, the 64 Kbps packet communication can be executed more ef- ficiently and high speed packet communication is allowed. To measure theperformance characteristics of the proposed systemand to compare the performance with that of the proposed system is superior to that of the existion system and to compare the performance with that of the proposed system is superior to that of the existing system. The proposed switching system offers a seamless evolutionalry path from Narrowband-ISDNto Broadband-ISDNsince itallows anefficient channelutilization and speed packet communication.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.355-358
• /
• 2007

In wireless mobile communication systems, priority of voice service through high speed data and multimedia transmission requires increased service diversification. Research is being carried out in this environment, on the call admission control techniques to guarantee the diversified service's QoS. SRN (Stochastic Reward Net) is an extended version of Petri nets, well know modeling and analysis tool. In this paper, we develop SRN call admission control model considering the 4 classes of services in the 4th generation IEE 802.16e mobile communication Technology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1732-1743
• /
• 1998

In this paper, we have proposed a channel assignment shceme for the multiple traffic class environment where the traffic volume varies with time. Our basic idea is to assign radio channels considering the characteristics of each traffic class and mobile speed and change the number of allocated channels for each traffic class according to vaiation of traffic volume. To evalute the perfomance of our proposed algorithms, we conducted analyical and simulation studies. We derived new call blocking probability and hand-off failure probability of the proposed scheme analytically. The simulatioh results show that our proposed algorithms can grantee GOS of each traffic class and provide a fairness between the new call and the hand-off call.