• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.405-419
• /
• 2012

In this paper, we propose a joint base station(BS) and relay precoders design in multi-relay aided multi-user all-multiple-input multiple-output(MIMO) system. The design criterion is to minimize user sum mean square error(SMSE) with relay sum power constraint(RSPC) where only local channel state information(CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel which the relay itself accesses, out of among all the 1st hop and the 2nd hop channel in the system. With BS precoder structure which is concatenated with block diagonalization(BD) precoder, each relay can determine its own precoder using only local CSI. Proposed scheme is based on sequential iteration of two stages; stage 1 determines BS precoder and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. Proposed scheme can be demonstrated theoretically to be always converge. We verify that proposed scheme outperforms simple amplify-and-forward(SAF), MMSE relay, and proposed schemes in [1] in terms of both SMSE and sum-rate performances.

• Journal of the Society of Disaster Information
• /
• v.14 no.2
• /
• pp.219-229
• /
• 2018

Purpose: This research proposes an optimization model for effective evacuation routing and scheduling of civilians near the border area when full-scale war threats heighten. Method: To reflect the reality, administrative unit network is created using Kruscal's Algorithm, Harmony Search, CCRP based on the geographical features, population, and traffic data of real cities, and then, optimal civilian evacuation routes are found. Results: Optimal evacuation routes and schedules are computed by repetitive experiments, and it is found that the scenario that minimizes the average civilian evacuation time is effective for the civilian evacuation plan. Conclusion: By using the civilian evacuation plan this research proposes, at the time of establishing the actual civilian evacuation plan, quantitative analysis is used for the effective plan making rather than only depending.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.153-158
• /
• 2007

사용자들의 특성에 맞게 개인화되고 세분화된 위치 기반 서비스를 제공하기 위해서는 방대한 이동 객체의 위치 이력 데이터 집합으로부터 유용한 패턴을 추출하여 의미 있는 지식을 탐사하기 위한 시공간 패턴 탐사가 필요하다. 현재까지 다양한 패턴 탐사 기법들이 제안되었으나 이동 패턴들 중 단순히 시공간 제약이 없는 빈발 패턴만을 추출하기 때문에 한정된 시간 범위와 제한적인 영역 범위 내에서의 빈발 패턴을 탐사하는 문제에는 적용하기 어렵다. 또한 패턴 탐사 수행 시 데이터베이스를 반복 스캔하여 탐사 수행시간이 많이 소요되는 문제를 포함하거나 메모리상에 탐사 대상인 후보 패턴 트리를 생성하는 방법을 통해 탐사 시간을 줄일 수는 있으나 이동 객체 수나 최소지지도 등에 따라 트리를 구성하고 유지하는데 드는 비용이 커질 수 있다. 따라서 이러한 문제를 해결하기 위한 효율적인 패턴 탐사 기법의 개발이 요구됨으로써 선행 작업으로 본 논문에서는 상세 수준의 객체 이력 데이터들의 시간 및 공간 속성을 의미 있는 시간영역과 공간영역 정보로 변환하는 시공간 데이터 일반화 방법을 제안한다. 제안된 방법은 공간 개념 계층에 대한 영역 정보들을 영역 Grid 해쉬 테이블(AGHT:Area Grid Hash Table)로 생성하여 공간 인덱스트리인 R*-Tree의 검색 방법을 이용해 이동 객체의 위치 속성을 2차원 공간영역으로 일반화하고, 시간 개념 계층을 생성하여 이동 객체의 시간적인 속성을 시간 영역으로 일반화함으로써 일반화된 데이터 집합을 형성하여 효율적인 이동 객체의 시간 패턴 마이닝을 유도할 수 있다.의 성능을 기대할 수 있을 것이다.onium sulfate첨가배지(添加培地)에서 가장 저조(低調)하였다. vitamin중(中)에서는 niacin과 thiamine첨가배지(添加培地)에서 근소(僅少)한 증가(增加)를 나타내었다.소시켜 항이뇨 및 Na 배설 감소를 초래하는 작용과, 둘째는 신경 경로를 통하지 않고, 아마도 humoral factor를 통하여 신세뇨관에서 Na 재흡수를 억제하는 작용이 복합적으로 나타내는 것을 알 수 있었다.으로 초래되는 복합적인 기전으로 추정되었다., 소형과와 기형과는 S-3에서 많이 나왔다. 이상 연구결과에서 입도분포가 1.2-5mm인 것이 바람직한 것으로 나타났다.omopolysaccharides로 확인되었다. EPS 생성량이 가장 좋은 Leu. kimchii GJ2의 평균 분자량은 360,606 Da이었으며, 나머지 두 균주에 대해서는 생성 EPS 형태와 점도의 차이로 미루어 보아 생성 EPS의 분자구조와 분자량이 서로 다른 것으로 판단하였다.TEX>개로 통계학적으로 유의한 차이가 없었다. Heat shock protein-70 (HSP70)과 neuronal nitric oxide synthase (nNOS)에 대한 면역조직화학검사에서 실험군 Cs2군의 신경세포가 대조군 12군에 비해 HSP70과 nNOS의 과발현을 보였으며, 이는 통계학적으로 유의한 차이를 보였다(p<0.05). nNOS와 HSP70의 발현은 강한 연관성을 보였고(상관계수 0.91, p=0.000), nNOS를 발현하는 세포가 동시에 HSP70도 발현함을 확인할 수 있었다. 결론: 우리는

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2009

In this paper, a new adaptive vertex clustering using a KD-tree is presented for 3D mesh partitioning. A vertex clustering is used to divide a huge 3D mesh into several partitions for various mesh processing. An octree-based clustering and K-means clustering are currently leading techniques. However, the octree-based methods practice uniform space divisions and so each partitioned mesh has non-uniformly distributed number of vertices and the difference in its size. The K-means clustering produces uniformly partitioned meshes but takes much time due to many repetitions and optimizations. Therefore, we propose to use a KD-tree to efficiently partition meshes with uniform number of vertices. The bounding box region of the given mesh is adaptively subdivided according to the number of vertices included and dynamically determined axis. As a result, the partitioned meshes have a property of compactness with uniformly distributed vertices.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1476-1484
• /
• 1999

TV 방송 분야에서 다양한 정보와 상호 작용성을 제공하기 위해서 최근 기존 방송 내용인 A/V 스트림 외 부가정보 방송이 시도되고 있다. 데이타 방송에 대한 기존 연구는 대부분 고정된 내용의 데이타를 방송하는 환경을 가정하고 있어서 그 결과가 방송 내용의 변화가 많은 환경에 부적합하다. 본 논문에서는 데이타에 대한 접근이 반복되지 않을 가능성이 높고 사용자 접근 확률을 예상하기 어려운 상황에서 응답 시간을 개선하는 방안으로 수신 데이타를 무조건 캐쉬에 반입하고 교체가 필요한 경우 다음 방송 시각이 가장 가까운 페이지를 축출하는 사용자 단말 시스템에서의 캐슁 정책을 제안하였다. 제안된 캐쉬 관리 정책은 평균적인 캐쉬 접근 실패 비용을 줄임으로써 사용자 응답 시간을 개선하며, 서로 다른 스케줄링 기법을 사용하는 다양한 방송 제공자가 공존하는 환경에서 보편적으로 효과를 가져올 수 있다.Abstract Recently, many television broadcasters have tried to disseminate digital multimedia data in addition to the traditional content (audio-visual stream). The broadcast data need to be cached by a client system, to provide a reasonable response time for a user request. Previous studies assumed the dissemination of a fixed set of items, and the results are not suitable when broadcast items are frequently changed. In this paper, we propose a novel cache management scheme that chooses the replacement victim based on the remaining time to the next broadcast instance. The proposed scheme reduces response time, where it is hard to predict the probability distribution of user accesses. The caching policy we present here significantly reduces expected response time by minimizing expected cache miss penalty, and can be applied without difficulty to different scheduling algorithms.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.185-193
• /
• 1998

Fractal-based monochrome image coding method can be easily applied for color image compression by splitting the color image into different primary spectral channels such as RGB, YIQ or $YC_bC_r$, and encoding each channel independently According to this method, it needs to repeat the fractal coding for each channel, so it have the problem of encoding time. In this paper, a fractal-based coder for color still image is proposed which features the enhancement of compression rate and the reduction of coding time. As the result of the experiment where the proposed algorithm is applied far color images, the compression rate is enhanced by 28 : 1 above with average PSNR value $28{\sim}29[dB]$, do not lossless encoding process using JPEG. And the encoding time is reduced by maximum 11.5 %.

• Journal of the Korean Geotechnical Society
• /
• v.21 no.8
• /
• pp.27-35
• /
• 2005

Several damages due to large displacement caused by liquefaction have been reported increasingly. Numerical procedures based on effective stress analysis are therefore necessary to predict liquefaction-induced deformation. In this paper, the fully coupled effective stress model called UBCSAND is proposed to simulate pore pressure rise due to earthquake or repeated loadings. The proposed model is a modification of the simple perfect elasto-plactic Mohr-Coulomb model, and can simulate a continuous yielding by mobilizing friction and dilation angles below failure state. Yield function is defined as the ratio of shear stress to mean normal stress. It is radial lines on stress space and has the same shape of Mohr-Columob failure envelope. Plastic hardening is based on an isotropic and kinematic hardening rule. The proposed model always causes plastic deformation during loading and reloading but it predicts elastic unloading. It is verified by capturing direct simple shear tests on loose Fraser River sand.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2375-2381
• /
• 2014

In case the coefficient set of an FIR filter is represented in the canonic signed digit (CSD) format with a few nonzero digits, it is possible to implement high data rate digital filters with low hardware cost. Designing an FIR filter with CSD format coefficients, whose number of nonzero signed digits is minimal, is equivalent to finding sparse nonzero signed digits in the coefficient set of the filter which satisfies the target frequency response with minimal maximum error. In this paper, a compressive sensing based CSD coefficient FIR filter design algorithm is proposed for multiplierless and high speed implementation. Design examples show that multiplierless FIR filters can be designed using less than two additions per tap on average with approximate frequency response to the target, which are suitable for high speed filtering applications.

• Journal of Korea Water Resources Association
• /
• v.48 no.11
• /
• pp.937-944
• /
• 2015

This study proposed a novel technique, namely the Radar Polygon Method (RPM), for areal rainfall estimation based on radar precipitation data. The RPM algorithm has the following steps: 1. Determine a map of the similar rainfall occurrence of which each grid cell contains the binary information on whether the grid cell rainfall is similar to that of the observation gage; 2. Determine the similar rainfall probability map for each gage of which each grid cell contains the probability of having the rainfall similar to that of the observation gage; 3. Determine the governing territory of each gage by comparing the probability maps of the gages. RPM method was applied to the Anseong stream basin. Radar Polygons and Thiessen Polygons of the study area were similar to each other with the difference between the two being greater for the rain gage highly influenced by the orography. However, the weight factor between the two were similar with each other. The significance of this study is to pioneer a new application field of radar rainfall data that has been limited due to short observation period and low accuracy.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.5
• /
• pp.547-555
• /
• 2008

This parer proposed the path mismatch detection and compensation algorithm with closed form for linear amplification with non-linear components(LINC) system implementation. The LINC system has a merit of using the high efficient amplifier by transferring the non-constant envelop signal which is high peak to average signal ratio into constant envelop signal. However, the performance degradation is very sensitive to the path mismatch such as an amplitude mismatch and a phase mismatch. In order to improve the path mismatch, the error detection and compensation method is introduced by the use of four test signals. Since the presented method has the closed form solution, the efficient and fast detection is available. The digital-IF structure of LINC system applied by the proposed error detection and compensation algorithm was implemented. The performance was evaluated with the IEEE 802.16 WiMAX baseband sinal which has 7 MHz channel bandwidth and 16-QAM. The Error Vector Magnitude(EVM) of -37.37 dB was obtained through performance test, which meets performance requirement of -24 dB EVM. As a result, the introduced error detection and compensation method was verified to improve the LINC system performance.