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

검색결과 63건 처리시간 0.03초

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

  • 윤영준;조강희;한석영
    • 한국정보전자통신기술학회논문지
    • /
    • 제13권5호
    • /
    • pp.397-402
    • /
    • 2020
  • 타입 1 콜라겐 단백질은 인체 내에서 가장 많이 존재하는 단백질이다. 이 단백질은 점탄성 거동을 보이며 이는 힘줄에서도 찾아볼 수 있다. 분자동역학 시뮬레이션 방법에는 rescaling 방법과 reassignment 방법으로 온도를 조절할 수 있다. rescaling 방법은 온도를 주어진 온도로 책정하는 방법이고, reassignment 방법은 원하는 온도로 맥스웰 분포를 이용하여서 온도를 책정하는 방법이다. 우리는 reassignment 방법에서 콜라겐 단백질의 거동이 시간에 따라서 변화하는 현상을 찾아내었다. 반면에 rescaling 방법에서는 시간에 무관하게 거동하였다. 콜라겐에 다른 속도로 인장을 가하였을 경우, 예를 들어 0.5, 1, 2, 5 Å/ps의 속도로 40 Å까지 힘을 가했을 경우, rescaling 방법에서는 속도에 따른 변화가 거의 없었던 반면, reassignment 방법의 경우 대략 80nm, 100nm, 130nm, 180nm까지 인장이 되었음을 보여준다. 이 현상에 대한 물리학적 의미를 명확하게 규명하지는 못하였지만, 단백질에 관한 시뮬레이션을 실행하는데 있어서 주의를 기울여 수행하여야 한다는 점에서 이 논문의 가치가 있다고 생각한다.

Frequency Reassignment Problem in Code Division Multiple Access Networks

  • Han Jung-Hee
    • Management Science and Financial Engineering
    • /
    • 제12권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 방식 (High quality reassignment (HQR) scheme for indoor microcell PCS systems)

  • 오준환;홍대형
    • 전자공학회논문지A
    • /
    • 제33A권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)

  • 한정희
    • 한국IT서비스학회지
    • /
    • 제10권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
    • 한국컴퓨터정보학회논문지
    • /
    • 제27권12호
    • /
    • pp.77-84
    • /
    • 2022
  • 본 논문은 객체 위치식별 알고리즘의 성능을 향상하기 위한 레이블 재할당 방법을 제안한다. 제안한 방법은 추론 단계와 재할당 단계로 구분한다. 추론 단계에서는 학습된 모델로부터 사전 지정된 크기에 따라 다중 스케일 추론을 수행한 뒤, 이를 마스킹한 영상을 다시 한번 추론하여 강인한 클래스 종류의 추론 결과를 얻는다. 재할당 단계에서는 박스간의 IoU를 계산하여 중복 박스를 제거하고, 박스와 클래스의 빈도를 계산하여 지배적 클래스를 다시 할당하였다. 제안한 방법을 검증하기 위하여 공사현장 안전장비 인식 영상 데이터 세트에 레이블 재할당 방법을 적용하고 이를 YOLOX-L 객체 탐지 모델에서 학습하였다. 실험 결과 적용 전 대비 mAP가 3.9% 향상하여 51.07%를 달성하였으며 AP_S를 3배 이상 향상하여 14.53%를 달성하였다. 실험 결과를 통해 레이블 재할당 알고리즘이 더 우수한 성능의 모델을 훈련해 냄을 확인하였다.

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

  • 조현진
    • 한국음향학회지
    • /
    • 제37권6호
    • /
    • pp.457-467
    • /
    • 2018
  • 본 논문은 정현파 신호에 대해 고해상도 주파수 추정이 가능한 알고리즘들의 성능을 비교 분석하였다. 비교 대상 알고리즘은 총 5가지로 DFT(Discrete Fourier Transform - 성능 평가 기준), Jacobsen, Candan, 재할당(Reassignment) 알고리즘 및 Cedron 알고리즘이다. 각 알고리즘의 성능을 SNR(Signal to Noise Ratio), 윈도우 함수, 윈도우 길이 등의 요소를 변화시켜가며 성능을 측정하였다. 알고리즘의 성능 평가는 편의 및 오차(Mean Square Error, MSE), 분산을 이용하여 측정하였으며, 실험결과 Cedron 알고리즘이 좋은 성능을 보였다. 실제 공학문제에서의 활용을 위해서는 각 알고리즘별로 보다 다양한 조건에서 실험 결과를 분석하고 개선시킬 필요가 있다.

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

  • 정태건
    • 한국소음진동공학회논문집
    • /
    • 제22권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.

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

  • 문기주;김광필;하정진;이병호
    • 산업공학
    • /
    • 제9권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)

  • 김병인;신재준;정상원
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2006년도 추계학술대회
    • /
    • 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

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

  • 이성호;정종화
    • 전자공학회논문지A
    • /
    • 제30A권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