• Title/Summary/Keyword: reassignment

Search Result 63, Processing Time 0.026 seconds

The behavior of collagen-like molecules in response to different temperature setting methods in steered molecular dynamic simulation (다른 온도 조절 상태에서 분자 동역학에서 콜라겐 단백질의 거동)

  • Yoon, Young-June;Cho, Kang-Hee;Han, Seog-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.5
    • /
    • pp.397-402
    • /
    • 2020
  • Collagen type I is the most abundant protein in the human body. It shows viscoelastic behavior, which is what confers tendons with their viscoelastic properties. There are two different temperature setting methods in molecular dynamics simulations, namely rescaling and reassignment. The rescaling method maintains the temperature by scaling the given temperature, while the reassignment method sets the temperature according to a Maxwell distribution at the target temperature. We observed time-dependent behavior when the reassignment method was applied in tensile simulation, but not when the rescaling method was applied. Time-dependent behavior was observed only when the reassignment method was applied or when one side of the collagen molecule was stretched to a greater extent than the other side. As result, the collagen is elongated to 80nm, 100nm, 130nm, and 180nm, respectively, when the collagen is pulled by different velocities, 0.5, 1, 2, and 5 Å/ps, up to 40 Å. The results do not provide a detailed physical explanation, but the phenomena illustrated in this result are important for caution when further simulations are performed.

Frequency Reassignment Problem in Code Division Multiple Access Networks

  • Han Jung-Hee
    • Management Science and Financial Engineering
    • /
    • v.12 no.1
    • /
    • pp.127-142
    • /
    • 2006
  • In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.

High quality reassignment (HQR) scheme for indoor microcell PCS systems (옥내 마이크로셀 개인휴대통신 시스템의 채널할당과 핸드오버를 위한 High quality reassignment 방식)

  • 오준환;홍대형
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.40-49
    • /
    • 1996
  • In this paper, we studied channel assignment and handover schemes for the indoor microcell systems. For efficient frequency spectrum reuse we proposed the high quality reassignment (HQR) scheme. Proposed HQR scheme tries to keep the reuse distances small by monitoring C/I of channels being used. To assign a channel for a new or handove call, the scheme checks C/I of all available channels. Then HQR assigns the channel that has C/I near the threshold value, A_TH. The scheme also checks C/I of ongoing calls and continuously reassigns a new channel when needed. It attempts handover not only when C/I gets below a handover threshold value, HO_TH, but also when C/I becomes above a high quality reassignment threshold, H_TH. The performance of the proposed HQR scheme was analyzed by a computer simulation configuraed. The performance of the scheme was also analyzed for various threshold values selected and the results are presented in this paper. The results show that HQR scheme perfomrs better than the scheme adopted for DECT.

  • PDF

Redesigning Radio Networks Considering Frequency Demands and Frequency Reassignment Cost (주파수 수요와 주파수 재할당 비용을 고려한 무선통신 네트워크 재설계)

  • Han, Junghee
    • Journal of Information Technology Services
    • /
    • v.10 no.1
    • /
    • pp.117-133
    • /
    • 2011
  • In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

Small-Scale Object Detection Label Reassignment Strategy

  • An, Jung-In;Kim, Yoon;Choi, Hyun-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.12
    • /
    • pp.77-84
    • /
    • 2022
  • In this paper, we propose a Label Reassignment Strategy to improve the performance of an object detection algorithm. Our approach involves two stages: an inference stage and an assignment stage. In the inference stage, we perform multi-scale inference with predefined scale sizes on a trained model and re-infer masked images to obtain robust classification results. In the assignment stage, we calculate the IoU between bounding boxes to remove duplicates. We also check box and class occurrence between the detection result and annotation label to re-assign the dominant class type. We trained the YOLOX-L model with the re-annotated dataset to validate our strategy. The model achieved a 3.9% improvement in mAP and 3x better performance on AP_S compared to the model trained with the original dataset. Our results demonstrate that the proposed Label Reassignment Strategy can effectively improve the performance of an object detection model.

A Study on performance comparison of frequency estimators for sinusoid (정현파 신호 주파수 추정 알고리즘의 추정 정확도 비교 연구)

  • Cho, Hyunjin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.6
    • /
    • pp.457-467
    • /
    • 2018
  • This paper presents performance comparison of several high-resolution frequency estimation algorithms for pure real tone signal. Algorithms are DFT (Discrete Fourier Transform - for reference purpose), Jacobsen, Candan, reassignment and Cedron. Each algorithm is evaluated under various experimental conditions, e.g., different SNR (Signal to Noise Ratio), window function and window length and performance is compared in the perspective of bias, MSE (Mean Square-Error) and variance. Experimental results indicate that Cedron algorithms works well in the most cases. For actual usage in the engineering problem, each algorithm needs additional analysis and modification.

Energy Distribution Characteristics of Nonstationary Acoustic Emission Burst Signal Using Time-frequency Analysis (비정상 AE 진동감시 신호의 에너지 분포특성과 시간-주파수 해석)

  • Jeong, Tae-Gun
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.22 no.3
    • /
    • pp.291-297
    • /
    • 2012
  • Conventional Fourier analysis can give only limited information about the dynamic characteristics of nonstationary signals. Instead, time-frequency analysis is widely used to investigate the nonstationary signal in detail. Several time-frequency analysis methods are compared for a typical acoustic emission burst generated during the impact between a ferrite ceramic and aluminum plate. This AE burst is inherently nonstationary and random containing many frequency contents, which leads to severe interference between cross terms in bilinear convolution type distributions. The smoothing and reassignment processes can improve the readability and resolution of the results. Spectrogram and scalogram of the AE burst are obtained and compared to get the characteristics information. Renyi entropies are computed for various bilinear time-frequency transforms to evaluate the randomness. These bilinear transforms are reassigned by using the improved algorithm in discrete computation.

A sensitivity analysis on AS/RS storage policy with production quantity changes (AS/RS 저장정책의 생산량 변동에 대한 민감도분석)

  • Mun, Gee-Ju;Kim, Gwang-Pil;Ha, Joung-Jin;Lee, Byung-Ho
    • IE interfaces
    • /
    • v.9 no.2
    • /
    • pp.219-229
    • /
    • 1996
  • Most studies on the operation policy for AS/RS concluded that the class-based storage policy has better performance than random storage policy does. However ASRS performances are examined only with the assumption of fixed production quantity in the studies. It is true that production quantity of each item changes frequently in practice. If an ASRS keeps the current storage policy regardless of production quantity variation, the performance of present storage policy will be worse. The effect of production quantity variation per product between 10 and 80% with random storage policy and class-based storage policy with reassignment and relocation are studied. The results are compared with both of the randomized and class-based storage policies without reassignment nor relocation cases. A typical ASRS system is developed using GPSS/PC for operation policy evaluation purposes.

  • PDF

Assignment Problem Based Vehicle Dispatching for a Semiconductio FAB (반도체 라인 물류시스템에서의 할당문제 기반 차량 배차)

  • Kim, Byung-In;Shin, Jae-Joon;Jeong, Sang-Won
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.525-528
    • /
    • 2006
  • This paper considers the vehicle dispatching problem in the automated material handling system (AMHS) of a large scale semiconductor fabrication line, which consists of 18 bays, 468 equipments and uses more than 130 overhead hoist transporters (OHT). We propose an assignment problem based vehicle dispatching approach to take advantage of simultaneous vehicle reassignment based on up-to-date system status. The proposed approach compares fsvorably with the shortest travel distance first rule and with the reassignment based rule which was recently proposed by the authors, in the number of vehicles required and the average lead time.

  • PDF

A Switchbox Router using Divide-and-Conquer Technique (Divide and Conquer 기법을 사용한 스위치박스 배선기)

  • 이성호;정종화
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.3
    • /
    • pp.104-113
    • /
    • 1993
  • A new switchbox router, called CONQUEROR, is proposed in this paper. The proposed CONQUEROR efficiently routes large switchbox routing area using divide-and-conquer technique. The CONQUEROR consists of three phases` namely, partition of large routing area and assignment of optimal pins of sub-area, detailed routing of each sub-ared, reassignment of pins after rip-up. First, large switchbox routing area is partitioned into several sub-areas and each sub-area contains 4-6 detailed grids. Then pins are assigned on boundary of sub-area by the estimated weight. Secondly, when global pin assignment is completed on all sub-areas, each sub-area is routed using detailed router. Also, detailed routing consists of three pases` layerless maze routing, assignment of layer using coloring, and rip-up and reroute. Lastly, if detailed routing of any sub-area fails,reassignment of pins after rip-up is invoked. Detailed routing is performed for the failed sub-area again. Benchmark test cases have been run, and on all the benchmark data known in the literature CONQUEROR has performed as well as or better than existing switchbox routers.

  • PDF