• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1260-1263
• /
• 2011

최근 차세대 시퀀싱 (Next Generation Sequencing, NGS) 기술이 발전하면서 DNA, RNA 등의 시퀀싱 데이터를 이용한 유전체 분석 방식에 관한 연구가 활발히 이루어지고 있다. 차세대 시퀀싱 데이터를 이용한 유전체 분석 방식은 마이크로어레이 혹은 EST/cDNA 데이터를 이용한 기존의 분석 방식에 비하여 비용이 적게 들고 정확한 결과를 얻을 수 있다는 장점이 있다. 그러나 이 들 DNA, RNA 시퀀싱 데이터는 각 시퀀스의 길이가 짧고 전체 용량은 매우 커서 이 들 데이터로부터 정확한 분석 결과를 추출하는 데에 많은 어려움이 있다. 본 연구에서는 클라우드 컴퓨팅 기술을 기반으로 하여 대용량의 RNA 시퀀싱 데이터를 고속으로 처리하는 병렬 SNP 추출 알고리즘을 제안한다. 전체 게놈 데이터 중 유전자 영역만을 high coverage로 시퀀싱하여 얻어지는 RNA 시퀀싱 데이터는 유전자 변이 추출을 목적으로 분석되며, SNP(Single Nucleotide Polymorphism)와 같은 유전자 변이는 질병의 원인 규명 및 치료법 개발에 직접 이용된다. 제안된 알고리즘은 동시에 실행되는 다수의 Map/Reduce 함수에 의해서 대규모 RNA 시퀀스를 병렬로 처리하며, 레퍼런스 시퀀스에 매핑된 각 염기의 출현 빈도와 품질점수를 이용하여 SNP를 추출한다. 또한 이 들 SNP 추출 결과에 대한 시각적 분석 도구를 제공하여 SNP 추출 과정 및 근거를 시각적으로 확인/검증할 수 있도록 지원한다.

• International conference on construction engineering and project management
• /
• 2017.10a
• /
• pp.42-51
• /
• 2017

Due to the high degree of mechanization and the good environmental benefits, the prefabricated buildings are being promoted in China. The construction site layout of the prefabricated buildings has important influence on its safety benefit. However, few scholars have studied the safety problem on it. Firstly, in order to give a follow-up study foreshadowing the characteristics of prefabricated buildings are analyzed, the research assumptions are given and three types of safety buffers are established. And then a mult-objective model for the prefabricated buildings site layout is presented: taking into account the limits of noise, the coverage of the tower crane and the possibility of exceeding boundaries and overlapping, the constraints are and designed established respectively; Based on the improved System Layout Planning (SLP) method, the efficiency\cost\safety interaction matrices among the facilities are also founded for objective function. For the sake of convenience, a hypothetical facility layout case of the prefabricated building is used, the optimal solution of that is obtained in MATLAB with particle swarm algorithm (PSO), which proves the effectiveness of the model presented in this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.7
• /
• pp.2047-2066
• /
• 2024

In order to improve the coverage and achieve massive spectrum access, non-orthogonal multiple access (NOMA) technology is applied in millimeter wave massive multiple-input multiple-output (mMIMO) communication network. However, the power assumption of active sensors greatly limits its wide applications. Recently, Intelligent Reconfigurable Surface (IRS) technology has received wide attention due to its ability to reduce power consumption and achieve passive transmission. In this paper, spectral efficiency maximum problem in the millimeter wave mMIMO-NOMA system with IRS is considered. The sparse RF chain antenna structure is designed at the base station based on continuous phase modulation. Furthermore, a joint optimization problem for power allocation, power splitting, analog precoding and IRS reconfigurable matrices are constructed, which aim to achieve the maximum spectral efficiency of the system under the constraints of user's quality of service, minimum energy harvesting and total transmit power. A three-stage iterative algorithm is proposed to solve the above mentioned non-convex optimization problems. We obtain the local optimal solution by fixing some optimization parameters firstly, then introduce the relaxation variables to realize the global optimal solution. Simulation results show that the spectral efficiency of the proposed scheme is superior compared to the conventional system with phase shifter modulation. It is also demonstrated that IRS can effectively assist mmWave communication and improve the system spectral efficiency.

• Journal of Intelligence and Information Systems
• /
• v.21 no.1
• /
• pp.119-142
• /
• 2015

With the explosive growth in the volume of information, Internet users are experiencing considerable difficulties in obtaining necessary information online. Against this backdrop, ever-greater importance is being placed on a recommender system that provides information catered to user preferences and tastes in an attempt to address issues associated with information overload. To this end, a number of techniques have been proposed, including content-based filtering (CBF), demographic filtering (DF) and collaborative filtering (CF). Among them, CBF and DF require external information and thus cannot be applied to a variety of domains. CF, on the other hand, is widely used since it is relatively free from the domain constraint. The CF technique is broadly classified into memory-based CF, model-based CF and hybrid CF. Model-based CF addresses the drawbacks of CF by considering the Bayesian model, clustering model or dependency network model. This filtering technique not only improves the sparsity and scalability issues but also boosts predictive performance. However, it involves expensive model-building and results in a tradeoff between performance and scalability. Such tradeoff is attributed to reduced coverage, which is a type of sparsity issues. In addition, expensive model-building may lead to performance instability since changes in the domain environment cannot be immediately incorporated into the model due to high costs involved. Cumulative changes in the domain environment that have failed to be reflected eventually undermine system performance. This study incorporates the Markov model of transition probabilities and the concept of fuzzy clustering with CBCF to propose predictive clustering-based CF (PCCF) that solves the issues of reduced coverage and of unstable performance. The method improves performance instability by tracking the changes in user preferences and bridging the gap between the static model and dynamic users. Furthermore, the issue of reduced coverage also improves by expanding the coverage based on transition probabilities and clustering probabilities. The proposed method consists of four processes. First, user preferences are normalized in preference clustering. Second, changes in user preferences are detected from review score entries during preference transition detection. Third, user propensities are normalized using patterns of changes (propensities) in user preferences in propensity clustering. Lastly, the preference prediction model is developed to predict user preferences for items during preference prediction. The proposed method has been validated by testing the robustness of performance instability and scalability-performance tradeoff. The initial test compared and analyzed the performance of individual recommender systems each enabled by IBCF, CBCF, ICFEC and PCCF under an environment where data sparsity had been minimized. The following test adjusted the optimal number of clusters in CBCF, ICFEC and PCCF for a comparative analysis of subsequent changes in the system performance. The test results revealed that the suggested method produced insignificant improvement in performance in comparison with the existing techniques. In addition, it failed to achieve significant improvement in the standard deviation that indicates the degree of data fluctuation. Notwithstanding, it resulted in marked improvement over the existing techniques in terms of range that indicates the level of performance fluctuation. The level of performance fluctuation before and after the model generation improved by 51.31% in the initial test. Then in the following test, there has been 36.05% improvement in the level of performance fluctuation driven by the changes in the number of clusters. This signifies that the proposed method, despite the slight performance improvement, clearly offers better performance stability compared to the existing techniques. Further research on this study will be directed toward enhancing the recommendation performance that failed to demonstrate significant improvement over the existing techniques. The future research will consider the introduction of a high-dimensional parameter-free clustering algorithm or deep learning-based model in order to improve performance in recommendations.

• Korean Journal of Remote Sensing
• /
• v.31 no.3
• /
• pp.227-244
• /
• 2015

Synthetic Aperture Radar is able to provide images of wide coverage in day, night, and all-weather conditions. Recently, as the SAR image resolution improves up to the sub-meter level, their applications are rapidly expanding accordingly. Especially there is a growing interest in the use of geographic information of high resolution SAR images and the change detection will be one of the most important technique for their applications. In this paper, an automatic threshold tracking and change detection algorithm is proposed applicable to high-resolution SAR images. To detect changes within SAR image, a reference image is generated using log-ratio operator and its amplitude distribution is estimated through K-S test. Assuming SAR image has a non-gaussian amplitude distribution, a generalized thresholding technique is applied using Kittler and Illingworth minimum-error estimation. Also, MoLC parametric estimation method is adopted to improve the algorithm performance on rough ground target. The implemented algorithm is tested and verified on the simulated SAR raw data. Then, it is applied to the spaceborne high-resolution SAR images taken by Cosmo-Skymed and KOMPSAT-5 and the performances are analyzed and compared.

• Journal of the Korean Society for Railway
• /
• v.15 no.4
• /
• pp.364-369
• /
• 2012

This paper presents an experimental study on the radio propagation characteristics in subway tunnel at 18GHz frequency band which has been assigned to video transmission between train and wayside. The radio propagation tests are carried out in the subway tunnel of Seoul Metro using the antenna and communication devices of the prototype video transmission system. The measurement results show that 18GHz radio propagation in subway tunnel has smaller path loss than that of general outdoor radio environment. It is also cleared that the arch-type tunnels have smaller radio propagation losses than rectangular tunnels, and single track tunnels have smaller pass loss than double track tunnels. From the measurements, the radio propagation coverage is worked out as 520 meters. The curved tunnels which cannot have LOS communication between transmitter and receiver have large pass losses and fluctuation profile along distance. The radio propagation coverage along curved tunnels is worked out as 300 meters. These investigation results can be used to design the 18GHz radio transmission system for subway tunnel by providing the optimized wayside transmitter locations and handover algorithm customized to the radio propagation characteristics in subway tunnels.

• The Korean Journal of Applied Statistics
• /
• v.29 no.7
• /
• pp.1459-1473
• /
• 2016

Both longitudinal data and survival data are collected simultaneously in longitudinal data which are observed throughout the passage of time. In this case, the effect of the independent variable becomes biased (provided that sole use of longitudinal data analysis does not consider the relation between both data used) if the missing that occurred in the longitudinal data is non-ignorable because it is caused by a correlation with the survival data. A joint model of longitudinal data and survival data was studied as a solution for such problem in order to obtain an unbiased result by considering the survival model for the cause of missing. In this paper, a joint model of the longitudinal zero-inflated count data and survival data is studied by replacing the longitudinal part with zero-inflated count data. A hurdle model and proportional hazards model were used for each longitudinal zero inflated count data and survival data; in addition, both sub-models were linked based on the assumption that the random effect of sub-models follow the multivariate normal distribution. We used the EM algorithm for the maximum likelihood estimator of parameters and estimated standard errors of parameters were calculated using the profile likelihood method. In simulation, we observed a better performance of the joint model in bias and coverage probability compared to the separate model.

• International Journal of Aeronautical and Space Sciences
• /
• v.10 no.1
• /
• pp.75-82
• /
• 2009

In this parer, we propose a new way of improving DGNSS service using combination of multiple SBAS information. Because SBAS uses Geostationary Earth Orbit (GEO) satellites, it has very large coverage but it can be unavailable in urban canyon because of visibility problem. R. Chen solved this problem by creating Virtual Reference Stations (VRS) using the SBAS signal [1]. VRS converts SBAS signal to RTCM signals corresponding its location, and broadcast the converted RTCM signals over the wireless internet. This method can solve the visibility problem cost effectively. Furthermore it can solve DGNSS coverage problem by creating just a transmitter instead of a reference station. Developing above method, this paper proposes the methods that integrate two or more SEAS signals into one RTCM signal and broadcast it. In Korea, MSAS signal is available even though it is not officially certified for Korean users. As a Korean own SBAS-like system, there is the internet-based KWTB (Korean WADGPS Test Bed) which we developed and released at ION GNSS 2006. As a result, virtually two different SBAS corrections are available in Korea. In this paper, we propose the integration methods for these two independent SBAS corrections and present the test results using the actual measurements from the two systems. We present the detailed algorithm for these two methods and analyze the features and performances of them. To verify the proposed methods, we conduct the experiment using the logged SBAS corrections from the two systems and the RINEX data logged at Dokdo monitoring station in Korea. The preliminary test results showed the improved performance compared to the results from two independent systems, which shows the potential of our proposed methods. In the future, the newly developed SBASs will be available and the places which can access the multiple SBAS signals will increase. At that time, the integration or combination methods of two or more SBASs will become more important. Our proposed methods can be one of the useful solutions for that. As an additional research, we need to extend this research to the system level integration such as the concept of the decentralized W ADGPS.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.12
• /
• pp.1292-1299
• /
• 2014

Weather radar systems can provide weather information of the ground, sea, and air in extensive spatial coverage in near real time. However, it becomes problematic when ground clutter signal exists around precipitation because strong signals of ground can cause a false precipitation report. A large percentage of land coverage of Korea consists of mountainous regions where ground clutter needs to be mitigated for more accurate prediction. Thus, it is considered necessary to introduce a new suitable ground clutter removal technique specifically adequate for Korea. In this paper, the C-Map(Clutter Map) method using raw radar signals is proposed for removing ground clutter using a terrain-adaptive clutter map. A clutter map is generated using raw radar signals(I/Q) of clear days, then it is subtracted from received radar signals in frequency domain. The proposed method is applied to the radar data acquired from Sobaeksan rain radar and the result shows that the clutter rejection ratio is about 91.17 %.

• Journal of Korean Society of Forest Science
• /
• v.83 no.4
• /
• pp.441-449
• /
• 1994

The two reflective channels(red and near infrared spectrum) of advanced very high resolution radiometer(AVHRR) data were used to classify primary vegetation cover types in the Korean Peninsula. From the NOAA-11 satellite data archive of 1991, 27 daytime scenes of relatively minimum cloud coverage were obtained. After the initial radiometric calibration, normalized difference vegetation index(NDVI) was calculated for each of the 27 data sets. Four or five daily NDVI data were then overlaid for each of the six months starting from February to November and the maximum value of NDVI was retained for every pixel location to make a monthly composite. The six bands of monthly NDVI composite were nearly cloud free and used for the computer classification of vegetation cover. Based on the temporal signatures of different vegetation cover types, which were generated by an unsupervised block clustering algorithm, every pixel was classified into one of the six cover type categories. The classification result was evaluated by both qualitative interpretation and quantitative comparison with existing forest statistics. Considering frequent data acquisition, low data cost and volume, and large area coverage, it is believed that AVHRR data are effective for vegetation cover type mapping at regional scale.