• Title/Summary/Keyword: Recovery algorithm

Search Result 553, Processing Time 0.025 seconds

Molybdenum isotopes separation using squared-off optimized cascades

  • Mahdi Aghaie;Valiyollah Ghazanfari
    • Nuclear Engineering and Technology
    • /
    • v.55 no.9
    • /
    • pp.3291-3300
    • /
    • 2023
  • Recently molybdenum alloys have been introduced as accident tolerating materials for cladding of fuel rods. Molybdenum element has seven stable isotopes with different neutron absorption cross section used in various fields, including nuclear physics and radioisotope production. This study presents separation approaches for all intermediate isotopes of molybdenum element by squared-off cascades using a newly developed numerical code with Salp Swarm Algorithm (SSA) optimization algorithm. The parameters of cascade including feed flow rate, feed entry stage, cascade cut, input feed flow rate to gas centrifuges (GCs), and cut of the first stage are optimized to maximize both isotope recovery and cascade capacity. The squared off and squared cascades are studied, and the efficiencies are compared. The results obtained from the optimization showed that for the selected squared off cascade, Mo94 in four separation steps, Mo95 in five steps, Mo96 in six steps, Mo97 in seven steps, and Mo98 in two steps are separated to the desired concentrations. The highest recovery factor is obtained 63% for Mo94 separation and lowest recovery factor is found 45% for Mo95.

Minimum Bandwidth Clock Recovery Algorithm for 10 Gigabit Ethernet (10 Gigabit Ethernet을 위한 최소 대역폭 클럭리커버리 알고리즘)

  • 성충환;전경규;김환우;김대영
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.911-914
    • /
    • 2001
  • 본 논문에서는 10Gigabit Ethernet 물리계충 전송 기술로서 IEEE 802.3 Higher Speed Study Group (HSSG)에서 검토했던 방법으로 선로부호화 방법이 있는데 그 중에서 국내 연구진에 의해 제안된 최소 대역폭 선로부호 MB810을 사용하여 10Gigabit Ethernet에서의 clock recovery 가능성에 대해 알아 본다. MB810 code를 사용하면 기존의 통신 시스템에서 필요로하는 대역폭을 반만 사용하여 전송할 수 있기 때문에 대역 효율이 좋아지나 이전의 일반적인 square law 방법으로는 clock recovery가 어렵다. 본 논문에서는 4th power law 방법을 사용했을때의 이론적인 해석과 시뮬레이션 결과를 보인다.

  • PDF

A COMOS Oversampling Data Recovery Circuit With the Vernier Delay Generation Technique

  • Jun-Young Park
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10A
    • /
    • pp.1590-1597
    • /
    • 2000
  • This paper describes a CMOS data recovery circuit using oversampling technique. Digital oversampling is done using a delay locked loop circuit locked to multiple clock periods. The delay locked loop circuit generates the vernier delay resolution less than the gate delay of the delay chain. The transition and non-transition counting algorithm for 4x oversampling was implemented for data recovery and verified through FPGA. The chip has been fabricated with 0.6um CMOS technology and measured results are presented.

  • PDF

Fault Management in Crossbar ATM Switches (크로스바 ATM 스위치에서의 장애 관리)

  • Oh Minseok
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.83-96
    • /
    • 2005
  • The multichannel switch is an architecture widely used for ATM (Asynchronous Transfer Mode). It is known that the fault tolerant characteristic can be incorporated into the multichannel crossbar switching fabric. For example, if a link belonging to a multichannel group fails, the remaining links can assume responsibility for some of the traffic on the failed link. On the other hand, if a fault occurs in a switching element, it can lead to erroneous routing and sequencing in the multichannel switch. We investigate several fault localization algorithm in multichannel crossbar ATM switches with a view to early fault recovery. The optimal algorithm gives the best performance in terms of time to localization but it is computationally complex which makes it difficult to implement. We develop an on-line algorithm which is computationally more efficient than the optimal one. We evaluate its performance through simulation. The simulation results show that the Performance of the on-line algorithm is only slightly sub-optimal for both random and bursty traffic. There are cases where the proposed on-line algorithm cannot pinpoint down to a single fault. We enumerate those cases and investigate the causes. Finally, a fault recovery algorithm is described which utilizes the information provided by the fault localization algorithm The fault recovery algorithm providesadditionalrowsandcolumnstoallowcellstodetourthefaultyelement.

SPICE Algorithm for Tone Signals in Frequency Domain (Tone 입사신호에 대한 주파수 영역 SPICE 알고리즘)

  • Zhang, Xueyang;Paik, Ji Woong;Hong, Wooyoung;Kim, Seongil;Lee, Joon-Ho
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.29 no.7
    • /
    • pp.560-565
    • /
    • 2018
  • The SPICE (Sparse Iterative Covariance-based Estimation) algorithm estimates the azimuth angle by applying a sparse recovery method to the covariance matrix in the time domain. In this paper, we show how the SPICE algorithm, which was originally formulated in the time domain, can be extended to the frequency domain. Furthermore, we demonstrate, through numerical results, that the performance of the proposed algorithm is superior to that of the conventional frequency domain algorithm.

CTaG: An Innovative Approach for Optimizing Recovery Time in Cloud Environment

  • Hung, Pham Phuoc;Aazam, Mohammad;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1282-1301
    • /
    • 2015
  • Traditional infrastructure has been superseded by cloud computing, due to its cost-effective and ubiquitous computing model. Cloud computing not only brings multitude of opportunities, but it also bears some challenges. One of the key challenges it faces is recovery of computing nodes, when an Information Technology (IT) failure occurs. Since cloud computing mainly depends upon its nodes, physical servers, that makes it very crucial to recover a failed node in time and seamlessly, so that the customer gets an expected level of service. Work has already been done in this regard, but it has still proved to be trivial. In this study, we present a Cost-Time aware Genetic scheduling algorithm, referred to as CTaG, not only to globally optimize the performance of the cloud system, but also perform recovery of failed nodes efficiently. While modeling our work, we have particularly taken into account the factors of network bandwidth and customer's monetary cost. We have implemented our algorithm and justify it through extensive simulations and comparison with similar existing studies. The results show performance gain of our work over the others, in some particular scenarios.

Design of a High Speed QPSK/16-QAM Receiver Chip (고속 QPSK/16-QAM 수신기 칩 설계)

  • Park, Ki-Hyuk;Sunwoo, Myung-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4B
    • /
    • pp.237-244
    • /
    • 2003
  • This paper presents the design of a QPSK/16-QAM downstreams receiver chip. The proposed chip consists of a blind equalizer, a timing recovery block and a carrier recovery block. The blind equalizer uses a DFE sturucture using CMA(Constant Module Algorithm). The symbol timing recovery uses the modified parabolic interpolator. The decision-directed carrier recovery is used to remove the carrier frequency offset, phase offset and phase jitter. The implemented LMDS receiver can support four data rates, 10, 20, 30 and 40 Mbps and can accommodate the symbol rate up to 10 Mbaud. This symbol rate is faster than existing QAM receivers.

Deep Learning based Loss Recovery Mechanism for Video Streaming over Mobile Information-Centric Network

  • Han, Longzhe;Maksymyuk, Taras;Bao, Xuecai;Zhao, Jia;Liu, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4572-4586
    • /
    • 2019
  • Mobile Edge Computing (MEC) and Information-Centric Networking (ICN) are essential network architectures for the future Internet. The advantages of MEC and ICN such as computation and storage capabilities at the edge of the network, in-network caching and named-data communication paradigm can greatly improve the quality of video streaming applications. However, the packet loss in wireless network environments still affects the video streaming performance and the existing loss recovery approaches in ICN does not exploit the capabilities of MEC. This paper proposes a Deep Learning based Loss Recovery Mechanism (DL-LRM) for video streaming over MEC based ICN. Different with existing approaches, the Forward Error Correction (FEC) packets are generated at the edge of the network, which dramatically reduces the workload of core network and backhaul. By monitoring network states, our proposed DL-LRM controls the FEC request rate by deep reinforcement learning algorithm. Considering the characteristics of video streaming and MEC, in this paper we develop content caching detection and fast retransmission algorithm to effectively utilize resources of MEC. Experimental results demonstrate that the DL-LRM is able to adaptively adjust and control the FEC request rate and achieve better video quality than the existing approaches.

A shape from shading algorithm using a membrane model an direct recovery (박막 모델과 직접복구를 이용한 영상으로부터 형상 복구 알고리듬)

  • 박상호;이남욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.6
    • /
    • pp.73-81
    • /
    • 1996
  • In this paper, based on the constrained optimizatin technique and direct recovery method, we proesent a shape form shading (SFS) algorithm to recover a 3-D shape form an image. More specifically, we first employ the membrane model for a smoothness constraint to revoer a 3-D shape coarsely. We then compute the surface height directly to reduce the shape distortion due to a regularization term. In our approach, we can obtain a stable and accurate solution by the application of these two steps. Several simulation results on various images are provided and discussed in this paper and they show that the proposed algorithm extracts the 3-D information accurately and efficiently.

  • PDF

An improved SRTS algorithm for DS3 rate video communication (DS3급 영상 통신을 위한 개선된 동기식 나머지 타임스탬프(SRTS) 알고리즘)

  • 이종형;김태균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.2
    • /
    • pp.417-426
    • /
    • 1996
  • The end-to-end service clock recovery is a critical issue in providing constandt bit rate service through ATM network. The Synchronous Residual Time Stamp(SRTS) algorithm is used to recovery the source clock using time stamp of transmitter. In thispaper, we propose a Differential Residual Time Stamp (DRTS) transmission mechanism to effectively deliver the timing information of source clock in SRTS algorithm. The RTS transmission method simple in its hardware. From the results of field trial of DS3 rate interactive video communication system through B-ISDN testbed, it can be identified that DRTS method is superior to the RTS method.

  • PDF