• Title/Summary/Keyword: recursive

Search Result 1,608, Processing Time 0.031 seconds

Design of an Adaptive Reed-Solomon Decoder with Varying Block Length (가변 블록길이를 갖는 적응형 리드솔로몬 복호기의 설계)

  • Song, Moon-Kyou;Kong, Min-Han
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4C
    • /
    • pp.365-373
    • /
    • 2003
  • In this paper, we design a versatle RS decoder which can decode RS codes of any block length n as well as any message length k, based on a modified Euclid's algorithm (MEA). This unique feature is favorable for a shortened RS code of any block length it eliminates the need to insert zeros before decoding a shortened RS code. Furthermore, the value of error correcting capability t can be changed in real time at every codeword block. Thus, when a return channel is available, the error correcting capability can be adaptiverly altered according to channel state. The decoder permits 4-step pipelined processing : (1) syndrome calculation (2) MEA block (3) error magnitude calculation (4) decoder failure check. Each step is designed to form a structure suitable for decoding a RS code with varying block length. A new architecture is proposed for a MEA block in step (2) and an architecture of outputting in reversed order is employed for a polynomial evaluation in step (3). To maintain to throughput rate with less circuitry, the MEA block uses not only a multiplexing and recursive technique but also an overclocking technique. The adaptive RS decoder over GF($2^8$) with the maximal error correcting capability of 10 has been designed in VHDL, and successfully synthesized in a FPGA.

Male Nurses' Adaptation Experiences in Clinical Nursing Settings (남성 간호사들의 임상간호현장 적응 경험)

  • Kim, Seong-Hyuk;Kim, Soo-Jin;Kang, Hee-Kyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.8
    • /
    • pp.304-316
    • /
    • 2017
  • The purpose of this study was to identify the components of the adaptation experiences and factors that help male nurses adapt to clinical nursing settings. The participants were eight male nurses working at general hospitals. Data were collected through in-depth interviews and analyzed using Giorgi's phenomenological analysis methods. The core components of the adaptation experiences of the participants in clinical nursing settings were summarized as 'dedication to work', 'challenges in reality that are different from expectations', 'establishing a professional identity', and 'self-development for the future'. The relationships between these components showed causative, accelerative, and recursive characteristics. The adaptation process was structured in the temporal context. In order for male nurses to adapt well to clinical nursing settings, policy efforts should be made to improve their working conditions and resolve inequalities, such as granting equal opportunities for promotion regardless of sex. In addition, it is essential for male nurses to have sufficient internal control for them to make self-directed efforts to strengthen their willpower and self-development efforts to facilitate their adaptation. This study suggests that developing suitable strategies and policy efforts based on the results is required to assist male nurses in adapting to clinical nursing settings.

Finding the K Least Fare Routes In the Distance-Based Fare Policy (거리비례제 요금정책에 따른 K요금경로탐색)

  • Lee, Mi-Yeong;Baek, Nam-Cheol;Mun, Byeong-Seop;Gang, Won-Ui
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.1
    • /
    • pp.103-114
    • /
    • 2005
  • The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.

A Comparative Analysis of 3D Circle Fitting Algorithms for Determination of VLBI Antenna Reference Point (VLBI 안테나 기준점 결정을 위한 3D Circle Fitting 알고리즘의 비교 분석)

  • Hyuk Gil, Kim;Jin Sang, Hwang;Hong Sik, Yun;Tae Jun, Jeong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.4
    • /
    • pp.231-244
    • /
    • 2015
  • The accuracy of reference point of VLBI antenna is mandatory to perform collocation of different space geodetic techniques. In this study, we evaluated the optimal methods for the 3D circle fitting to enhance the accuracy of the reference point of VLBI antenna. Two kinds of methodologies for the orthonormal coordinate system with translation of planar observation point and the unitary coordinate transforamation were suggested and their fitting accuracies were evaluated where the orthogonal distance was calculated by residual between observation point and fitting model and the recursive calculation was performed to improve the accuracy of 3D circle fitting. Finally, we found that the methodology for the unitary coordinate transformation is highly appropriate to determine the optimal equation for azimuth-axis and elevation-axis of VLBI antenna. Therefore, the reference point of VLBI antenna with high accuracy can be determined by the intersection of the above two axises (azimuth-axis and elevation-axis). This result is expected to be utilized for a variety of researches for connection between VLBI observation results and the national control point.

The Influence of Biomarker Mutations and Systemic Treatment on Cerebral Metastases from NSCLC Treated with Radiosurgery

  • Lee, Min Ho;Kong, Doo-Sik;Seol, Ho Jun;Nam, Do-Hyun;Lee, Jung-Il
    • Journal of Korean Neurosurgical Society
    • /
    • v.60 no.1
    • /
    • pp.21-29
    • /
    • 2017
  • Objective : The purpose of this study was to analyze outcomes and identify prognostic factors in patients with cerebral metastases from non-small cell lung cancer (NSCLC) treated with gamma knife radiosurgery (GKS) particularly, focusing on associations of biomarkers and systemic treatments. Methods : We retrospectively reviewed the medical records of 134 patients who underwent GKS for brain metastases due to NSCLC between January 2002 and December 2012. Representative biomarkers including epidermal growth factor receptor (EGFR) mutation, K-ras mutation, and anaplastic lymphoma kinase (ALK) mutation status were investigated. Results : The median overall survival after GKS was 22.0 months (95% confidence interval [CI], 8.8-35.1 months). During follow-up, 63 patients underwent salvage treatment after GKS. The median salvage treatment-free survival was 7.9 months (95% CI, 5.2-10.6 months). Multivariate analysis revealed that lower recursive partition analysis (RPA) class, small number of brain lesions, EGFR mutation (+), and ALK mutation (+) were independent positive prognostic factors associated with longer overall survival. Patients who received target agents 30 days after GKS experienced significant improvements in overall survival and salvage treatment-free survival than patients who never received target agents and patients who received target agents before GKS or within 30 days (median overall survival: 5.0 months vs. 18.2 months, and 48.0 months with p-value=0.026; median salvage treatment-free survival: 4.3 months vs. 6.1 months and 16.6 months with p-value=0.006, respectively). To assess the influence of target agents on the pattern of progression, cases that showed local recurrence and new lesion formation were analyzed according to target agents, but no significant effects were identified. Conclusion : The prognosis of patients with brain metastases of NSCLC after GKS significantly differed according to specific biomarkers (EGFR and ALK mutations). Our results show that target agents combined with GKS was related to significantly longer overall survival, and salvage treatment-free survival. However, target agents were not specifically associated with improved local control of the lesion treated by GKS either development of new lesions. Therefore, it seems that currently popular target agents do not affect brain lesions themselves, and can prolong survival by controlling systemic disease status.

Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences (생물학적 데이터 서열들에서 빈번한 최대길이 연속 서열 마이닝)

  • Kang, Tae-Ho;Yoo, Jae-Soo
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.155-162
    • /
    • 2008
  • Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

Factors analysis of the cyanobacterial dominance in the four weirs installed in of Nakdong River (낙동강의 중·하류 4개보에서 남조류 우점 환경 요인 분석)

  • Kim, Sung jin;Chung, Se woong;Park, Hyung seok;Cho, Young cheol;Lee, Hee suk
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.413-413
    • /
    • 2019
  • 하천과 호수에서 남조류의 이상 과잉증식 문제(이하 녹조문제)는 담수생태계의 생물다양성을 감소시키며, 음용수의 이취미 원인물질을 발생시켜 물 이용에 장해가 된다. 또한 독소를 생산하는 유해남조류가 대량 증식할 경우에는 가축이나 인간의 건강에 치명적 해를 끼치기도 한다. 그 동안 국내에서 녹조문제는 댐 저수지와 하구호와 같은 정체수역에서 간헐적으로 문제를 일으켰으나, 4대강사업(2010-2011)으로 16개의 보가 설치된 이후 낙동강, 금강, 영산강 등 대하천에서도 광범위하게 발생되고 있어 중요한 사회적 환경적 이슈로 대두되었다. 한편, 대하천에 설치된 보 구간에서 빈번히 발생하는 녹조현상의 원인에 대해서는 전 지구적 기온상승에 따른 기후변화의 영향이라는 주장과 유역으로부터 영양염류의 과도한 유입, 가뭄에 따른 유량감소, 보 설치에 따른 체류시간 증가 등 다양한 의견이 제시되고 있으나, 대상 유역과 수체의 특성에 따라 녹조 발생의 원인이 상이하거나 또는 다양한 요인이 복합적으로 작용하기 때문에 보편적 해석(universal interpretation)이 어려운 것이 현실이다. 따라서 각 수계별, 보별 녹조현상에 대한 정확한 원인분석과 효과적인 대책 마련을 위해서는 집중된 실험자료와 데이터마이닝 기법에 근거로 한 보다 과학적이고 객관적인 접근이 이루어져야 한다. 본 연구에서는 2012년 보 설치 이후 남조류에 의한 녹조현상이 빈번히 발생하고 있는 낙동강 4개보(강정고령보, 달성보, 합천창녕보, 창녕함안보)를 대상으로 집중적인 현장조사와 실험분석을 수행하고, 수집된 기상, 수문, 수질, 조류 자료에 대해 통계분석과 다양한 데이터모델링 기법을 적용하여 보별 남조류 우점 환경조건과 이를 제어하기 위한 주요 조절변수를 규명하는데 있다. 연구대상 보 별 수질과 식물플랑크톤의 정성 및 정량 실험은 2017년 5월부터 2018년 11월까지 2년에 걸쳐 실시하였으며, 남조류 세포수 밀도와 환경요인과의 상관성 분석을 실시하고, 단계적 다중회귀모델(Step-wise Multiple Linear Regressions, SMLR), 랜덤포레스트(Random Forests, RF) 모델과 재귀적 변수 제거 기법(Recursive Feature Elimination using Random Forest, RFE-RF)을 이용한 변수중요도 평가, 의사결정나무(Decision Tree, DT), 주성분분석(Principal Component Analysis, PCA) 기법 등 다양한 모수적 및 비모수적 데이터마이닝 결과를 바탕으로 각 보별 남 조류 우점 환경요인을 종합적으로 해석하였다.

  • PDF

Improvement of LMS Algorithm Convergence Speed with Updating Adaptive Weight in Data-Recycling Scheme (데이터-재순환 구조에서 적응 가중치 갱신을 통한 LMS 알고리즘 수렴 속 도 개선)

  • Kim, Gwang-Jun;Jang, Hyok;Suk, Kyung-Hyu;Na, Sang-Dong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.4
    • /
    • pp.11-22
    • /
    • 1999
  • Least-mean-square(LMS) adaptive filters have proven to be extremely useful in a number of signal processing tasks. However LMS adaptive filter suffer from a slow rate of convergence for a given steady-state mean square error as compared to the behavior of recursive least squares adaptive filter. In this paper an efficient signal interference control technique is introduced to improve the convergence speed of LMS algorithm with tap weighted vectors updating which were controled by reusing data which was abandoned data in the Adaptive transversal filter in the scheme with data recycling buffers. The computer simulation show that the character of convergence and the value of MSE of proposed algorithm are faster and lower than the existing LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of LMS algorithm.

Single Image Super Resolution Based on Residual Dense Channel Attention Block-RecursiveSRNet (잔여 밀집 및 채널 집중 기법을 갖는 재귀적 경량 네트워크 기반의 단일 이미지 초해상도 기법)

  • Woo, Hee-Jo;Sim, Ji-Woo;Kim, Eung-Tae
    • Journal of Broadcast Engineering
    • /
    • v.26 no.4
    • /
    • pp.429-440
    • /
    • 2021
  • With the recent development of deep convolutional neural network learning, deep learning techniques applied to single image super-resolution are showing good results. One of the existing deep learning-based super-resolution techniques is RDN(Residual Dense Network), in which the initial feature information is transmitted to the last layer using residual dense blocks, and subsequent layers are restored using input information of previous layers. However, if all hierarchical features are connected and learned and a large number of residual dense blocks are stacked, despite good performance, a large number of parameters and huge computational load are needed, so it takes a lot of time to learn a network and a slow processing speed, and it is not applicable to a mobile system. In this paper, we use the residual dense structure, which is a continuous memory structure that reuses previous information, and the residual dense channel attention block using the channel attention method that determines the importance according to the feature map of the image. We propose a method that can increase the depth to obtain a large receptive field and maintain a concise model at the same time. As a result of the experiment, the proposed network obtained PSNR as low as 0.205dB on average at 4× magnification compared to RDN, but about 1.8 times faster processing speed, about 10 times less number of parameters and about 1.74 times less computation.

Economic Impacts of the increase in Green Immature Citrus Demand on Jeju Field Citrus Industry (풋귤 수요증대가 제주 노지감귤 산업에 미치는 파급영향)

  • Kim, Hwa-Nyeon;Ko, Seong-Bo;Kim, Bae-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.4
    • /
    • pp.108-114
    • /
    • 2021
  • Green colored citrus is the immature fruit of the field citrus crop in Jeju, and its demand has been growing recently as it is known to contain a large amount of carotinoid, pectin, and vitamin C. It differs from the traditional varieties of blue tangerine, which are green in February and turn in yellow in March-April. This study analyzed the effects of the increased demand in green citrus on the field citrus industry. For our analysis, a partial equilibrium supply-demand model was established with a dynamic recursive structure using data from 1989-2017. Model calibration was also conducted to determine the best supply-demand model and then, the impacts of increasing demand for green immature citrus in Jeju for 2018-2030 was simulated. The simulation results show that there is no significant impact on the producing area prior to 2022, but there is a distinguishable increase of 18ha in 2023, 52ha in 2025, and 142ha in 2030. It was also predicted that revenue would increase by KRW 7.75 billion on average from 2021-2030.