• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.4 no.4
• /
• pp.203-212
• /
• 2002

This study was conducted to remove the urban heat island effects embedded in the interpolated surfaces of daily minimum temperature in the Korean Peninsula. Fifty six standard weather stations are usually used to generate the gridded temperature surface in South Korea. Since most of the weather stations are located in heavily populated and urbanized areas, the observed minimum temperature data are contaminated with the so-called urban heat island effect. Without an appropriate correction, temperature estimates over rural area or forests might deviate significantly from the actual values. We simulated the spatial pattern of population distribution within any single population reporting district (city or country) by allocating the reported population to the "urban" pixels of a land cover map with a 30 by 30 m spacing. By using this "digital population model" (DPM), we can simulate the horizontal diffusion of urban effect, which is not possible with the spatially discontinuous nature of the population statistics fer each city or county. The temperature estimation error from the existing interpolation scheme, which considers both the distance and the altitude effects, was regressed to the DPMs smoothed at 5 different scales, i.e., the radial extent of 0.5, 1.5, 2.5, 3.5 and 5.0 km. Optimum regression models were used in conjunction with the distance-altitude interpolation to predict monthly normals of daily minimum temperature in South Korea far 1971-2000 period. Cross validation showed around 50% reduction in terms of RMSE and MAE over all months compared with those by the conventional method.conventional method.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2007.06a
• /
• pp.64-68
• /
• 2007

The classic graphical method to determine the epicenter uses differences between the arrival times of P and S waves at each station. In this research, a robust approach is proposed, which provides a fast and intuitive estimation of earthquake epicenters. This method uses an empirical relationship between epicentral distance and traveltime of the first arrival P phase of local or regional earthquake. The relationship enables us to estimate epicentral distances and draw epicentral circles from each station with P-traveltimes counted from a probable origin time. As the assigned time is getting close to the origin time of the earthquake, epicentral circles begin to intersect each other at a possible location of the epicenter. Then the possibility of the epicenter can be expressed by a function of the time and the space. We choose the location which gives the minimum standard deviation of the origin time as an estimated epicenter. In this research, 918 P arrival times from 84 events occurring from 2005 to 2006 listed in the KMA earthquake catalog are used to determine the empirical P-traveltime function of epicentral distances.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.93-102
• /
• 1995

This paper introduces a general purpose Associative Processor(AP) which is very efficient for search-oriented applications. The proposed architecture consists of three main functional blocks: Content-Addressable Memory(CAM) arry, row logic, and control section. The proposed AP is a Single-Instruction, Multiple-Data(SIMD) device based on a CAM core and an array of high speed processors. As an application for the proposed hardware, we present a parallel algorithm to solve a global routing problem in the layout process utilizing the processing capabilities of a rudimentary logic and the selective matching and writing capability of CAMs, along with basic algorithms such a minimum(maximum) search, less(greater) than search and parallel arithmetic. We have focused on the simultaneous minimization of the desity of the channels and the wire length by sedking a less crowded channel with shorter wire distance. We present an efficient mapping technique of the problem into the CAM structure. Experimental results on difficult examples, on randomly generated data, and on benchmark problems from MCNC are included.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.32-40
• /
• 2015

In this paper, the optimum antenna placement is analyzed by considering the interference between airborne antennas mounted on the unmanned aerial vehicle(UAV). The analysis is implemented by selecting the antennas that the distance and operational frequency band between airborne antennas is close to each other among the omni-directional antennas. The analyzed antennas are the control datalink, TCAS(Traffic Collision & Avoidance System), IFF(Identification Friend or Foe), GPS(Global Positioning System), and RALT(Radar ALTimeter) antennas. There are three steps for the optimum antenna placement analysis. The first step is selecting the antenna position having the optimum properties by monitoring the variation of radiation pattern and return loss by the fuselage of UAV after selecting the initial antenna position considering the antenna use, type, and radiation pattern. The second one is analyzing the interference strength between airborne antennas considering the coupling between airborne antennas, spurious of transmitting antenna, and minimum receiving level of receiving antenna. In case of generating the interference, the antenna position without interference is selected by analyzing the minimum separation distance without interference. The last one is confirming the measure to reject the frequency interference by the frequency separation analysis between airborne antennas in case that the intereference is not rejected by the additional distance separation between airborne antennas. This analysis procedure can be efficiently used to select the optimum antenna placement without interference by predicting the interference between airborne antennas in the development stage.

• The Journal of the Korea Contents Association
• /
• v.7 no.11
• /
• pp.102-110
• /
• 2007

In this paper, a portable RFID reader which operated in 900MHz UHF band is designed and fabricated and the characteristics of the manufactured portable RFID reader is analyzed through measurement. Analysis of measurements results is achieved based on EPC Class 0 standards that proposed by EPC Global. The proposed RFID reader communicate with tags about 11kbps speed, and have 20 dBm for its maximum RF output power. The proposed portable RFID reader can recognize maximum 68 tags per second, and when reader's output power is 20 dBms, maximum recognition distance is 30cm. And the total size of implemented RFID reader is $71mm{\times}55mm$, that is the maximum 90%, minimum 14% reduced size compared with marketed product.

• Journal of the Chungcheong Mathematical Society
• /
• v.17 no.1
• /
• pp.47-56
• /
• 2004

The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1193-1209
• /
• 2015

Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2325-2330
• /
• 2005

A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.3
• /
• pp.188-202
• /
• 2011

Due to emissions of greenhouse gases caused by increased use of fossil fuels, the climate change has been detected and this phenomenon would affect even larger changes in temperature and precipitation of South Korea. Especially, the increase of temperature by climate change can affect the amount and pattern of snowfall. Accordingly, we tried to predict future snowfall and the snowfall pattern changes by using the downscaled GCM (general circulation model) scenarios. Causes of snow varies greatly, but the information provided by GCM are maximum / minimum temperature, rainfall, solar radiation. In this study, the possibility of snow was focused on correlation between minimum temperatures and future precipitation. First, we collected the newest fresh snow depth offered by KMA (Korea meteorological administration), then we estimate the temperature of snow falling conditions. These estimated temperature conditions were distributed spatially and regionally by IDW (Inverse Distance Weight) interpolation. Finally, the distributed temperature conditions (or boundaries) were applied to GCM, and the future snowfall was predicted. The results showed a wide range of variation for each scenario. Our models predict that snowfall will decrease in the study region. This may be caused by global warming. Temperature rise caused by global warming highlights the effectiveness of these mechanisms that concerned with the temporal and spatial changes in snow, and would affect the spring water resources.