• Title/Summary/Keyword: Shifting algorithm

Search Result 178, Processing Time 0.025 seconds

The extinction probability in systems randomly varying in time

  • Pazsit, Imre;Williams, M.M.R.;Pal, Lenard
    • Nuclear Engineering and Technology
    • /
    • v.49 no.6
    • /
    • pp.1301-1309
    • /
    • 2017
  • The extinction probability of a branching process (a neutron chain in a multiplying medium) is calculated for a system randomly varying in time. The evolution of the first two moments of such a process was calculated previously by the authors in a system randomly shifting between two states of different multiplication properties. The same model is used here for the investigation of the extinction probability. It is seen that the determination of the extinction probability is significantly more complicated than that of the moments, and it can only be achieved by pure numerical methods. The numerical results indicate that for systems fluctuating between two subcritical or two supercritical states, the extinction probability behaves as expected, but for systems fluctuating between a supercritical and a subcritical state, there is a crucial and unexpected deviation from the predicted behaviour. The results bear some significance not only for neutron chains in a multiplying medium, but also for the evolution of biological populations in a time-varying environment.

Optical-fiber Electronic Speckle Pattern Interferometry for Quantitative Measurement of Defects on Aluminum Liners in Composite Pressure Vessels

  • Kim, Seong Jong;Kang, Young June;Choi, Nak-Jung
    • Journal of the Optical Society of Korea
    • /
    • v.17 no.1
    • /
    • pp.50-56
    • /
    • 2013
  • Optical-fiber electronic speckle pattern interferometry (ESPI) is a non-contact, non-destructive examination technique with the advantages of rapid measurement, high accuracy, and full-field measurement. The optical-fiber ESPI system used in this study was compact and portable with the advantages of easy set-up and signal acquisition. By suitably configuring the optical-fiber ESPI system, producing an image signal in a charge-coupled device camera, and periodically modulating beam phases, we obtained phase information from the speckle pattern using a four-step phase shifting algorithm. Moreover, we compared the actual defect size with that of interference fringes which appeared on a screen after calculating the pixel value according to the distance between the object and the CCD camera. Conventional methods of measuring defects are time-consuming and resource-intensive because the estimated values are relative. However, our simple method could quantitatively estimate the defect length by carrying out numerical analysis for obtaining values on the X-axis in a line profile. The results showed reliable values for average error rates and a decrease in the error rate with increasing defect length or pressure.

Design and characterization of a Muon tomography system for spent nuclear fuel monitoring

  • Park, Chanwoo;Baek, Min Kyu;Kang, In-soo;Lee, Seongyeon;Chung, Heejun;Chung, Yong Hyun
    • Nuclear Engineering and Technology
    • /
    • v.54 no.2
    • /
    • pp.601-607
    • /
    • 2022
  • In recent years, monitoring of spent nuclear fuel inside dry cask storage has become an important area of national security. Muon tomography is a useful method for monitoring spent nuclear fuel because it uses high energy muons that penetrate deep into the target material and provides a 3-D structure of the inner materials. We designed a muon tomography system consisting of four 2-D position sensitive detector and characterized and optimized the system parameters. Each detector, measuring 200 × 200 cm2, consists of a plastic scintillator, wavelength shifting (WLS) fibers and, SiPMs. The reconstructed image is obtained by extracting the intersection of the incoming and outgoing muon tracks using a Point-of-Closest-Approach (PoCA) algorithm. The Geant4 simulation was used to evaluate the performance of the muon tomography system and to optimize the design parameters including the pixel size of the muon detector, the field of view (FOV), and the distance between detectors. Based on the optimized design parameters, the spent fuel assemblies were modeled and the line profile was analyzed to conduct a feasibility study. Line profile analysis confirmed that muon tomography system can monitor nuclear spent fuel in dry storage container.

An Upshift Improvement in the Quality of Forklift's Automatic Transmission by Learning Control (학습제어를 이용한 지게차 자동변속기 상향 변속품질 개선)

  • Jung, Gyuhong
    • Journal of Drive and Control
    • /
    • v.19 no.2
    • /
    • pp.17-26
    • /
    • 2022
  • Recently, automatic transmissions caused a good improvement in the shift quality of a forklift. An advanced shift control algorithm, which was based on TCU firmware, was applied with embedded control technology and microcontrollers. In the clutch-to-clutch shifting, one friction element is released and the other friction element is activated. During this process, if the release and application timings are not synchronized, an overrun or tie-up occurs and ultimately leads to a shift shock. The TCU, which measures only the speed of the forklift, inevitably applies the open-loop shift control. In this situation, the speed ratio does not change during the clutch fill. The torque phase occurs until the clutch is disengaged. In this study, an offline shift logic of the learning control was proposed. It induced a synchronous shift when the learning control progressed. During this process, the reference current trajectory of the release clutch was corrected and applied to the next upshift. We considered the results of the overrun/tie-up characteristics of the upshift performed immediately before. The vehicle test proved that the deviation in shift quality, which was caused by the difference in the mechanical characteristics of the clutch, could be improved by the learning control.

Development of a New Lunar Regolith Simulant using an Automated Program Framework

  • GyeongRok Kwon;Kyeong Ja Kim;Eungseok Yi
    • Journal of Astronomy and Space Sciences
    • /
    • v.41 no.2
    • /
    • pp.79-85
    • /
    • 2024
  • Nowadays, the trend in lunar exploration missions is shifting from prospecting lunar surface to utilizing in-situ resources and establishing sustainable bridgehead. In the past, experiments were mainly focused on rover maneuvers and equipment operations. But the current shift in trend requires more complex experiments that includes preparations for resource extraction, space construction and even space agriculture. To achieve that, the experiment requires a sophisticated simulation of the lunar environment, but we are not yet prepared for this. Particularly, in the case of lunar regolith simulants, precise physical and chemical composition with a rapid development speed rate that allows different terrains to be simulated is required. However, existing lunar regolith simulants, designed for 20th-century exploration paradigms, are not sufficient to meet the requirements of modern space exploration. In order to prepare for the latest trends in space exploration, it is necessary to innovate the methodology for producing simulants. In this study, the basic framework for lunar regolith simulant development was established to realize this goal. The framework not only has a sample database and a database of potential simulation target compositions, but also has a built-in function to automatically calculate the optimal material mixing ratio through the particle swarm optimization algorithm to reproduce the target simulation, enabling fast and accurate simulant development. Using this framework, we anticipate a more agile response to the evolving needs toward simulants for space exploration.

Facility Location Problem for Blood Logistics Center (혈액 물류센터 위치 선정 문제)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.2
    • /
    • pp.135-143
    • /
    • 2012
  • This paper suggests the optimal blood distribution center algorithm that satisfies the minimum total transportation cost and within the allowable distribution time $T^*$. Zhang and Yang proposes shifting the location of each point that has less than the average distance of two maximum distance points from each point. But they cannot decide the correct facility location because they miscompute the shortest distance. This algorithm computes the shortest distance $l_{ij}$ from one area to another areas. Then we select the $v_i$ area to thecandidate distribution center location such that $_{max}l_{ij}{\leq}L^*$ and the $v_i$ such that $l_{ij}-L^*$ area that locates in ($v_i,v_k$) and ($v_j,v_l$) from $P_{ij}=v_i,v_k,{\cdots},v_l,v_j$ path and satisfies the $_{max}l_{ij}{\leq}L^*$ condition. Finally, we decide the candidate distribution area that has minimum transportation cost to optimal distribution area.

A Study on a Cell search Using PCSSCG in Broadband OFCDM Systems (OFCDM시스템에서 PCSSCG를 이용한 셀 탐색에 관한 연구)

  • Kim Dae-Yong;Choi Kwon-Hue;Park Yong-Wan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.6 s.348
    • /
    • pp.1-8
    • /
    • 2006
  • In the asynchrous OFCDM(Orthogonal Frequency and Code Division Multiplexing) system, a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC (Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yeilded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification code(PCSSCG:Patial Cell Specific Scrambling Code Group) of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions with the nearly same performance. The proposed method is to be compared and verified through the computer simulation.

Face Recognitions Using Centroid Shift and Neural Network-based Principal Component Analysis (중심이동과 신경망 기반 주요성분분석을 이용한 얼굴인식)

  • Cho Yong-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.12B no.6 s.102
    • /
    • pp.715-720
    • /
    • 2005
  • This paper presents a hybrid recognition method of first moment of face image and principal component analysis(PCA). First moment is applied to reduce the dimension by shifting to the centroid of image, which is to exclude the needless backgrounds in the face recognitions. PCA is implemented by single layer neural network which has a teaming rule of Foldiak algorithm. It has been used as an alternative method for numerical PCA. PCA is to derive an orthonormal basis which directly leads to dimensionality reduction and possibly to feature extraction of face image. The proposed method has been applied to the problems for recognizing the 48 face images(12 Persons $\ast$ 4 scenes) of 64$\ast$64 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate). The negative angle has been relatively achieved more an accurate similarity than city-block or Euclidean.

Approximate Front Face Image Detection Using Facial Feature Points (얼굴 특징점들을 이용한 근사 정면 얼굴 영상 검출)

  • Kim, Su-jin;Jeong, Yong-seok;Oh, Jeong-su
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.675-678
    • /
    • 2018
  • Since the face has a unique property to identify human, the face recognition is actively used in a security area and an authentication area such as access control, criminal search, and CCTV. The frontal face image has the most face information. Therefore, it is necessary to acquire the front face image as much as possible for face recognition. In this study, the face region is detected using the Adaboost algorithm using Haar-like feature and tracks it using the mean-shifting algorithm. Then, the feature points of the facial elements such as the eyes and the mouth are extracted from the face region, and the ratio of the two eyes and degree of rotation of the face is calculated using their geographical information, and the approximate front face image is presented in real time.

  • PDF

A Robustness Performance Improvement of QE-MMA Adaptive Equalization Algorithm based on Dithering (Dithering을 이용한 QE-MMA 적응 등화 알고리즘의 Robustness 성능 개선)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.93-98
    • /
    • 2017
  • This paper relates with the robustness performance improvement of QE-MMA (Quantized Error-MMA) adaptive equalization algorithm based on the dithering in order to reduce the intersymbol interference by nonlinear distortion occurs at channel. The QE-MMA was appeared for the easiness of H/W implementation in place of multiplication to shifting in the tap coefficient updates applying the power-of-two operation to the magnitude of error signal in currently SE-MMA, it's performance were degraded by this. For improving it's performance, the proposed DQE-MMA adds the dither signal which has constant statistical characteristics in the prestage of power-of-two operation. It was confirmed by simulation that the DQE-MMA gives better robustness performance than current QE-MMA in the same channel and signal to noise ratio.