• 제목/요약/키워드: Survivor

검색결과 199건 처리시간 0.026초

기술성장곡선을 활용한 생존모형 개발 (Development of Survivor Models Using Technological Growth Models)

  • 오현승;조진형
    • 산업경영시스템학회지
    • /
    • 제33권4호
    • /
    • pp.167-177
    • /
    • 2010
  • Recent competitive and technological changes during the past decade have accelerated the need for better capital recovery methods. Competition and technology have together shortened the expected lives of property which could not have been forecasted several years ago. Since the usage of technological growth models has been prevalent in various technological forecasting environments, the various forms of growth models have become numerous. Of six such models studied, some models do significantly better than others, especially at low penetration levels in predicting future levels of growth. A set of criteria for choosing an appropriate model for technological growth models was developed. Two major characteristics of an S-shaped curve were elected which differentiate the various models; they are the skewness of the curve and underlying assumptions regarding the variance of error structure of the model.

Cancer Survivorship에 대한 이해와 전망 (Understanding Cancer Survivorship and Its New Perspectives)

  • 김수현
    • 종양간호연구
    • /
    • 제10권1호
    • /
    • pp.19-29
    • /
    • 2010
  • Purpose: The purpose of this article was to review and discuss the current status, issues, and nursing perspectives of cancer survivorship. Methods: A comprehensive literature review was conducted. Results: The major areas of concern for the survivors included recurrence, secondary malignancies, and long-term treatment sequalae which affect their quality of life. The four essential components of survivorship are prevention, surveillance, intervention, and coordination. Cancer survivorship care plan should address survivor's long-term care, such as types of cancer, treatment modalities, potential side effects, and recommendations for follow-up. It also needs to include preventive practices, health maintenance and well-being, information on legal protections regarding employment and health insurance, as well as psychosocial services in the community. Survivorship care for cancer patients requires multidisciplinary efforts and team approach. Conclusion: Nurses are uniquely positioned to play a key role in ensuring quality services for cancer survivors and family members. Nurses should review the care plans for cancer survivorship with patients and families by instructing them when to seek medical treatment, promoting any recommended surveillance protocols, and encouraging healthy life styles for health promotion and quality of life.

Designing Cultural Syllabus and Lesson Plan Based on Developmental Stages of Acculturation of Intercultural Communicative Competence

  • Jang, Eun-Suk
    • 영어어문교육
    • /
    • 제17권1호
    • /
    • pp.37-52
    • /
    • 2011
  • The purposes of this study were to review developmental stages of acculturation, to establish dimensions and components of intercultural communicative competence, and to suggest teaching methods in the elementary school based on the dimensions and the components of the stages. In order to achieve these purposes, theoretical research on the nature of intercultural communicative competence and teaching methods of intercultural dimensions and components was carried out in terms of developmental stages of acculturation. The stages of acculturation have relation to cognitive domain, affective domain, and cultural awareness. In the domain of cognitive development, the models such as Cummins (1981), Wong-Fillmore (1983), and Ausubel (1968) were presented. In the affective domain of second language research, the models of Gardener and Lambert (1972), Maslow (1954), and Bloom (1974) were argued. Modifying the models of Ausubel, Cummins, Wong-Fillmore, the dimensions and components of intercultural communicative competence were established. In addition, it was suggested that cultural syllabus and lesson plan based on tourist and survivor stage should be considered.

  • PDF

A Bit-level ACSU of High Speed Viterbi Decoder

  • Kim, Min-Woo;Cho, Jun-Dong
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제6권4호
    • /
    • pp.240-245
    • /
    • 2006
  • Viterbi decoder is composed of BMU(Branch metric Unit), ACSU(Add Compare Select Unit), and SMU(Survivor path Memory Unit). For high speed viterbi decoders, ACSU is the main bottleneck due to the compare-select and feedback operation. Thus, many studies have been advanced to solve the problem. For example, M-step look ahead technique and Minimized method are typical high speed algorithms. In this paper, we designed a bit-level ACSU(K=3, R=1/2, 4bit soft decision) based on those algorithms and switched the matrix product order in the backward direction of Minimized method so as to apply Code-Optimized-Array in order to reduce the area complexity. For experimentation, we synthesized our design by using SYNOPSYS Design compiler, with TSMC 0.18 um library, and verified the timing by using CADENCE verilog-XL.

A High Speed Bit-level Viterbi Decoder

  • 김민우;조준동
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2006년도 춘계학술대회
    • /
    • pp.311-315
    • /
    • 2006
  • Viterbi decoder는 크게 BM(Branch metric), ACS(Add-Compare-Select), SM(Survivor Memory) block 으로 구성되어 있다. 이중 ACSU 부분은 고속 데이터 처리를 위한 bottleneck이 되어 왔으며, 이의 해결을 위한 많은 연구가 활발히 진행되어 왔다. look ahead technique은 ACSU를 M-step으로 처리하고 CS(Carry save) number를 사용한 새로운 비교 알고리즘을 제안하여 high throughput을 추구했으며, minimized method는 block processing 방식으로 forward, backward 방향으로 decoding을 수행하여 ACSU 부분의 feedback을 완전히 제거하여 exteremely high throughput 을 추구하고 있다. 이에 대해 look ahead technique 의 기본 PE(Processing Element)를 바탕으로 minimized method 알고 리즘의 core block 을 bit-level 로 구현하였으며 : code converter 를 이용하여 CS number 가운데 redundat number(l)를 제거하여 비교기를 더 간단히 하였다. SYNOPSYS의 Design compiler 와 TSMC 0.18 um library 를 이용하여 합성하였다.

  • PDF

다중의 Add-compare-select 모듈을 갖는 병렬 비터비 알고리즘의 메모리 관리 방법 (A memory management scheme for parallel viterbi algorithm with multiple add-compare-select modules)

  • 지현순;박동선;송상섭
    • 한국통신학회논문지
    • /
    • 제21권8호
    • /
    • pp.2077-2089
    • /
    • 1996
  • In this paper, a memory organization and its control method are proposed for the implementation of parallel Virterbi decoders. The design is mainly focused on lowering the hardware complexity of a parallel Viterbi decoder which is to reduce the decoding speed. The memories requeired in a Viterbi decoder are the SMM(State Metric Memory) and the TBM(Traceback Memory);the SMM for storing the path metrics of states and the TBM for storing the survial path information. A general parallel Viterbi decoder for high datarate usually consists of multiple ACS (Add-Compare-Select) units and their corresponding memeory modules.for parallel ACS units, SMMs and TBMs are partitioned into smaller independent pairs of memory modules which are separately interleaved to provide the maximum processing speed. In this design SMMs are controlled with addrss generators which can simultaneously compute addresses of the new path metrics. A bit shuffle technique is employed to provide a parallel access to the TBMs to store the survivor path informations from multiple ACS modules.

  • PDF

관개조직의 수명기간 신뢰성 해석 (Lifetime Reliability Analysis of Irrigation System)

  • Kim Han-Joong;Lee Jeong-Jae;Im Sang-Joon
    • 한국농공학회지
    • /
    • 제45권2호
    • /
    • pp.35-44
    • /
    • 2003
  • A system reliability method is proposed to decide reliable serviceability of agricultural irrigation system. Even though reliability method is applied to real engineering situations involving actual life environments and maintaining costs, a number of Issues arise as a modeling and analysis level. This article use concepts that can be described the probability of failure with time variant and series-parallel system reliability analysis model. A proposed method use survivor function that can simulate a time-variant performance function for a lifetime before it is required essential maintenance or replacement to define a target probability of failure in agricultural irrigation canal. In the further study, it is required a relationship between a state of probability of failure and current serviceability to make the optimum repair strategy to maintain appropriate serviceability of an irrigation system.

CM 방법을 활용한 설비 수명분석 (A Study on the Computed Mortality Method in Life Analysis)

  • 오현승;이한교;조진형
    • 산업경영시스템학회지
    • /
    • 제32권2호
    • /
    • pp.179-185
    • /
    • 2009
  • 공공사업이나 자동화 생산시스템 등에 있어서 설비 자산이 차지하는 비중은 매우 크며 이러한 설비들의 경제적 설비 대체 분석을 위하여 설비에 대한 수명분석이 이루어져야 한다. 본 논문에서는 설비들의 폐기 자료가 불충분한 경우의 수명분석에서 Iowa형 생존곡선을 기초로 한 CM 방법을 제시하였다. 기존의 SPR 방법이 평균 수명만을 추정하는데 비하여 제시된 CM 방법은 설비의 수명분포를 추정함으로써 평균 수명뿐만 아니라 폐기 자료의 폐기곡선과 폐기율을 추정할 수 있어 설비 교체 분석 시 유용하게 사용될 수 있다.

설비 생존곡선 추정을 위한 혼합형 Weibull 함수의 활용 (A Study on the Application of Mixed Weibull Function to Estimate Survivor Curves of Industrial Property)

  • 이한교;김경택;오현승
    • 산업경영시스템학회지
    • /
    • 제30권1호
    • /
    • pp.66-73
    • /
    • 2007
  • 일반 투자안의 의사결정에서와 마찬가지로 산업설비의 경제성 분석에서도 가장 중요한 결정 요소 중의 하나가 설비의 생존곡선 추정이다. 설비의 자산 가치가 감소하는 원인은 여러 가지가 있으나, 여러 원인 중 물리적 훼손이 과거의 산업설비에서는 가장 중요한 원인이었으므로 기존의 생존모형 분석에서는 lows 생존곡선을 이용하여 설비의 생존곡선을 추정하였다. 그러나 새로운 기술상의 변화로 인한 첨단 생산시스템의 설비교체 분석 시에는 적합지 않다. 따라서, 본 연구에서 제안된 혼합형 Weibull 함수를 이용하여 설비의 폐기 형태를 추정함으로써 설비들의 실제적인 생존곡선을 정확하게 파악할 수 있다.

The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes

  • Peng, Wanquan;Zhang, Chengchang
    • Journal of Information Processing Systems
    • /
    • 제10권1호
    • /
    • pp.69-80
    • /
    • 2014
  • The free distance of (n, k, l) convolutional codes has some connection with the memory length, which depends on not only l but also on k. To efficiently obtain a large memory length, we have constructed a new class of (2k, k, l) convolutional codes by (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generation function are also given in this paper. With the help of some matrix modules, we designed a single structure Viterbi decoder with a parallel capability, obtained a unified and efficient decoding model for (2k, k, l) convolutional codes, and then give a description of the decoding process in detail. By observing the survivor path memory in a matrix viewer, and testing the role of the max module, we implemented a simulation with (2k, k, l) convolutional codes. The results show that many of them are better than conventional (2, 1, l) convolutional codes.