• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.259-266
• /
• 2005

Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.679-689
• /
• 2006

Delivering multicast stream is one of the cost-saving approach in the large scale VOD environment. Because implementing VCR-like interactions for user's convenience in the multicast streaming system involves complex problems, we need the proper solutions for them. In this paper, we propose a hybrid scheme which uses the general P2P and the patching scheme with the Collaborative Interaction Streaming Scheme(CISS). CISS provides jumping functionability to the appropriate multicast session after VCR-like interaction in the environment in which multiple peers transmit VCR-like interaction streams to the VCR-like functionability request node to reduce the loads generated by frequent join or departure of peers at the multicast tree during providing VCR-like functionability. Therefore, with the proposed scheme we can distribute network traffic and reduce control overhead and latency. And to evaluate the performance of proposed scheme we compare it in the aspect of the performance of streaming delivery topology, control overhead and streaming quality with P2Cast[10] and DSL[11]. The simulation result shows that proposed P2Patching reduces about 30% of process overhead and enhances about $25{\sim}30%$ of streaming quality compared with DSL.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.490-496
• /
• 2007

This paper describes the design and implementation of an integrated LTCC front-end module for the IEEE802.11a WLAN applications by performing the behavioral-level simulation using measurement-based behavioral model. To meet the IEEE802.11a WLAN standard, a system transmitting 1024 symbols through 64-QAM process at the rate of 54Mbps should be implemented and nonlinear properties are confirmed by simulations of ACPR and EVM in this circumstance. The right offsets of ACPR which are 30MHz, 20MHz, and 11MHz distant from the center frequency of 5.8GHz are 49.36dBc, 36.90dBc, and 24.58dBc, respectively. The left offsets are 50.14dBc, 30.04dBc, and 28.85dBc, respectively and EVM is 2.94%. The size of the module implemented with LTCC five-layer substrates is $13.4mm{\times}14.2mm$. The measured characteristics of the transmitter show P1dB of 16.2dBm and power gain of 16.73dB. Those of the receiver exhibit the small signal gain of 16.24dB and noise figure of 7.83dB.

• Tribology and Lubricants
• /
• v.36 no.2
• /
• pp.105-115
• /
• 2020

This paper presents a numerical study on the rotordynamic analysis of a dual-spool turbofan engine in the context of blade defect events. The blades of an axial-type aeroengine are typically well aligned during the compressor and turbine stages. However, they are sometimes exposed to damage, partially or entirely, for several operational reasons, such as cracks due to foreign objects, burns from the combustion gas, and corrosion due to oxygen in the air. Herein, we designed a dual-spool rotor using the commercial 3D modeling software CATIA to simulate blade defects in the turbofan engine. We utilized the rotordynamic parameters to create two finite element Euler-Bernoulli beam models connected by means of an inter-rotor bearing. We then applied the unbalanced forces induced by the mass eccentricities of the blades to the following selected scenarios: 1) fully balanced, 2) crack in the low-pressure compressor (LPC) and high pressure compressor (HPC), 3) burn on the high-pressure turbine (HPT) and low pressure compressor, 4) corrosion of the LPC, and 5) corrosion of the HPC. Additionally, we obtained the transient and steady-state responses of the overall rotor nodes using the Runge-Kutta numerical integration method, and employed model reduction techniques such as component mode synthesis to enhance the computational efficiency of the process. The simulation results indicate that the high-vibration status of the rotor commences beyond 10,000 rpm, which is identified as the first critical speed of the lower speed rotor. Moreover, we monitored the unbalanced stages near the inter-rotor bearing, which prominently influences the overall rotordynamic status, and the corrosion of the HPC to prevent further instability. The high-speed range operation (>13,000 rpm) coupled with HPC/HPT blade defects possibly presents a rotor-case contact problem that can lead to catastrophic failure.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.1
• /
• pp.119-131
• /
• 2003

Rainfall-runoff process is under the control of hydrologic parameters having temporal and spatial variety. Accordingly, it is difficult to efficiently deal them since many parameters and various information are required to perform hydrologic simulation. So the purposes of this study is to estimate the runoff volume by frequency using GIS techniques and NRCS method. The analysis of frequency rainfall is analyzed using FARD 2002 program and the result of goodness of fit test show that Log-pearson type III is suitable distribute type for the applied area. TOPAZ program used for the analysis of DEM data examining into geological characteristic. NRCS curve numbers estimated using landuse map and soil map for the estimation of effective rain fall in the basin. The storm Type II and Type III were used as the type for the application of NRCS. The result of application show that the runoff volumes above 80 years frequency in return period have similar patterns regardless of Type II and Type III. In addition, the results of comparison with runoff volumes by frequency in the report of river improvement master plan show that it have similar volumes as the relative errors for them of 80, 100 years frequency are each 7.65%, 5.33%.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.19 no.1
• /
• pp.180-196
• /
• 2016

To minimize the damage from disasters, various aspects of prevention, preparation, and response, etc. are being managed. Even though prevention and preparation are well conducted, irresistible calamities such as natural disasters may cause unexpected damage. Therefore, a system that can share the identical disaster information based on prompt disaster management and prediction must be developed and constructed for integrated disaster management. Especially, for a prompt disaster response, the same information needs to be shared between the related organization and the disaster prevention personnel such as on-site officials. Recent disaster management systems use high-capacity geographic information or other various factors for accurate disaster predictions. In case of using a recently constructed or researched 3D GIS, the system may not be used in some cases due to conflicts with hardware, etc. Thus, even though response information is secured using prediction simulation in advance, it is essentially difficult in some cases to share the common information when the system cannot be utilized or the extension of the corresponding data cannot be read. Therefore, this study aims to construct a system for dealing with disasters that shares the same prompt and accurate information in compliance with common data formats. The system is expected to reduce the existing disaster response time and minimize human and physical damage by assisting decision making through prompt responses.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.62-70
• /
• 2011

Nowadays image sensor is an essential component in many multimedia devices, and it is covered by a color filter array to filter out specific color components at each pixel. We need a certain algorithm to combine those color components reconstructed a full color image from incomplete color samples output from an image sensor, which is called a demosaicking process. Most existing demosaicking algorithms are developed for ideal image sensors, but they do not work well for the practical cases because of dissimilar characteristics of each sensor. In this paper, we propose a new demosaicking algorithm in which the color filter characteristics are fully utilized to generate a good image. To demonstrate significance of our algorithm, we used a commerically available sensor, CBN385B, which is a sort of Honeycomb-style CFA(Color Filter Array) CCD image sensor. As a performance metric of the algorithm, PSNR(Peak Signal to Noise Ratio) and RGB distribution of the output image are used. We first implemented our algorithm in C-language for simulation on various input images. As a result, we could obtain much enhanced images whose PSNR was improved by 4~8 dB compared to the commonly idealized approaches, and we also could remove the inclined red property which was an unique characteristics of the image sensor(CBN385B).Then we implemented it in hardware to overcome its problem of computational complexity which made it operate slow in software. The hardware was verified on Spartan-3E FPGA(Field Programable Gate Array) to give almost the same performance as software, but in much faster execution time. The total logic gate count is 45K, and it handles 25 image frmaes per second.

• Journal of The Korean Association For Science Education
• /
• v.36 no.2
• /
• pp.191-202
• /
• 2016

In this study, a science museum teaching-learning model was developed with emphasis on play. In order to do this, the models of factor-centered museum education and process-centered museum education were reviewed and characteristics of science museum education were considered. The model developed in this study is called 'Play-Learning Model in Science Museum', and 'play' is defined as activities to achieve the mission in accordance with methods and rules set by individuals or small groups including scaffolding and play is divided into competition, simulation, and chance. 'Play-Learning Model in Science Museum' emphasizes learning using the articles on exhibition, scaffolding and interaction in small groups, and play. The model consists of four steps: 'Preparation', 'Exploring the exhibits', 'Experience', and 'Summary of learning content'. In the 'Preparation' step, the students form related knowledge and are ready to play. The 'Exploring the exhibits' step is the core step of this model, and entails the students solving problems in the mission by interacting with members of the small group. When they cannot find resolution, they get help. In the 'Experience' step, hands-on activities related to the prior step are included. In the 'Summary of learning content' step, the students summarize what they learned while playing. As science museum education is implemented in a variety of forms, continuous research about the science museum learning model and development of various programs are needed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.9-16
• /
• 2006

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.