• 제목/요약/키워드: integer number

검색결과 464건 처리시간 0.024초

ATM 교환기의 위치 선정 문제에 관한 연구 (Algorithm for the ATM Switching Node Location Problem)

  • 김덕성;이경식;박성수;박경철
    • 한국경영과학회지
    • /
    • 제24권3호
    • /
    • pp.93-107
    • /
    • 1999
  • We consider the development of an integer programming model and algorithm for the ATM switching node location problem. There are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. Each customer needs to be connected to one or more hub facilities via remote facilities, where the hub(remote) facilities need to be installed at the same candidate installation site of hub(remote) facility. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities, We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub facilities via installed remote facilities with minimum costs, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we develop a branch-and-cut algorithm with path variables. In the algorithm, we consider the integer knapsack polytope and derive valid inequalities. Computational experiments show that the algorithm works well in the real world situation. The results of this research can be used to develop optimization algorithms to solve capacitated facility location problems.

  • PDF

TERNARY UNIVERSAL SUMS OF GENERALIZED PENTAGONAL NUMBERS

  • Oh, Byeong-Kweon
    • 대한수학회지
    • /
    • 제48권4호
    • /
    • pp.837-847
    • /
    • 2011
  • For an integer $m{\geq}3$, every integer of the form $p_m(x)$ = $\frac{(m-2)x^2(m-4)x}{2}$ with x ${\in}$ $\mathbb{Z}$ is said to be a generalized m-gonal number. Let $a{\leq}b{\leq}c$ and k be positive integers. The quadruple (k, a, b, c) is said to be universal if for every nonnegative integer n there exist integers x, y, z such that n = $ap_k(x)+bp_k(y)+cp_k(z)$. Sun proved in [16] that, when k = 5 or $k{\geq}7$, there are only 20 candidates for universal quadruples, which h listed explicitly and which all involve only the case of pentagonal numbers (k = 5). He veri ed that six of the candidates are in fact universal and conjectured that the remaining ones are as well. In a subsequent paper [3], Ge and Sun established universality for all but seven of the remaining candidates, leaving only (5, 1, 1, t) for t = 6, 8, 9, 10, (5, 1, 2, 8) and (5, 1, 3, s) for s = 7, 8 as candidates. In this article, we prove that the remaining seven quadruples given above are, in fact, universal.

Abdominal-Deformation Measurement for a Shape-Flexible Mannequin Using the 3D Digital Image Correlation

  • Liu, Huan;Hao, Kuangrong;Ding, Yongsheng
    • Journal of Computing Science and Engineering
    • /
    • 제11권3호
    • /
    • pp.79-91
    • /
    • 2017
  • In this paper, the abdominal-deformation measurement scheme is conducted on a shape-flexible mannequin using the DIC technique in a stereo-vision system. Firstly, during the integer-pixel displacement search, a novel fractal dimension based on an adaptive-ellipse subset area is developed to track an integer pixel between the reference and deformed images. Secondly, at the subpixel registration, a new mutual-learning adaptive particle swarm optimization (MLADPSO) algorithm is employed to locate the subpixel precisely. Dynamic adjustments of the particle flight velocities that are according to the deformation extent of each interest point are utilized for enhancing the accuracy of the subpixel registration. A test is performed on the abdominal-deformation measurement of the shape-flexible mannequin. The experiment results indicate that under the guarantee of its measurement accuracy without the cause of any loss, the time-consumption of the proposed scheme is significantly more efficient than that of the conventional method, particularly in the case of a large number of interest points.

FARA를 이용한 Inverted RTK 측위 정확도 향상에 대한 연구 (Study on the Improvement of the Positioning Accuracy for Inverted RTK Using FARA)

  • 최병규;임삼성
    • 한국측량학회지
    • /
    • 제22권3호
    • /
    • pp.217-223
    • /
    • 2004
  • 실시간 측위 정확도 향상을 위해 많은 방법들이 수행되고 있다. 그 중에 하나가 위상 데이터를 처리함으로써 정밀한 위치 해를 제공해 주는 Inverted RTK(Real-time kinematic)이다. Inverted RTK 측위를 위해서는 최소 1~2분 정도의 1Hz 관측 데이터와 부가적으로 여러 상시 관측소 및 통신 시스템 그리고 데이터 프로세싱 서버가 필요하다. 실시간 응용을 위해서 L1 코드와 반송파 위상 데이터가 동시에 사용되었으며 모호 정수 추정을 위해 칼만 필터를 사용하였다. 또한 이중 차분된 참 모호 정수는 FARA(Fast Ambiguity Resolution Approach)를 이용하여 결정하였다. 본 연구에서는 다양한 기선에 대한 필드 테스트 수행 결과를 제시하였다.

원자력 추진 잠수함 최소 소요량 결정을 위한 임무 할당 최적화 모델 (An Optimal Mission Assignment Model for Determining a Minimum Required Level of Nuclear-powered Submarines)

  • 이동균;박승주;이진호
    • 한국군사과학기술학회지
    • /
    • 제21권2호
    • /
    • pp.235-245
    • /
    • 2018
  • This study first analyzes the necessity and the validity of procuring nuclear-powered submarines, and presents an optimization model as an integer program to determine a minimum required level of them. For an optimization model, we characterize a submarine's mission, ability and availability, and apply these to the model by constraints. Then, we assign the submarines available currently and the nuclear-powered submarines, that will be newly introduced, to the predefined missions over the planning time periods in a way that the number of nuclear-powered submarines be minimized. Randomly generated missions are employed to solve a mission assignment problem, and the results show that our integer programming model provides an optimal solution as designed, and this can provide a guideline for other weapon system procurement processes.

자바카드 기반 공개키 암호 API를 위한 임의의 정수 클래스 설계 및 구현 (Design and Implementation of Arbitrary Precision Class for Public Key Crypto API based on Java Card)

  • 김성준;이희규;조한진;이재광
    • 정보처리학회논문지C
    • /
    • 제9C권2호
    • /
    • pp.163-172
    • /
    • 2002
  • 자바카드 API는 한정된 메모리를 가진 스마트 카드 기반의 프로그램을 개발할 때 많은 이점을 제공한다. 그러나 공개키 암호 알고리즘 구현에 반드시 필요한 연산들인 모듈러 지수 연산, 최대공약수 계산, 그리고 소수 판정과 생성 등의 연산을 지원하지 않는다. 본 논문에서는 자바 카드에서 공개키 암호 알고리즘 구현을 위해서 반드시 필요한 연산들을 지원하는 임의의 정수 클래스의 설계 및 구현하였다.

승용차용 교류발전기의 고정자 슬롯 수가 소음에 미치는 영향 분석 (Analysis on Noise of Automotive Alternator Considering the Number of Stator Slots)

  • 송진서;김광준
    • 대한기계학회논문집A
    • /
    • 제24권1호
    • /
    • pp.126-133
    • /
    • 2000
  • Noise of automotive alternators can be classified into mechanical noise, aerodynamic noise and electro-magnetic noise. which is the same as for electric motors. Previous studies show that the elect ro-magnetic noise takes a maw peak at the rotating frequency multiplied by the number of stator slots. It has not been proved clearly so far, however, that the major peak is wholely due to the stator slots. On the contrary it is well known that noise of motors. which has a mechanism similar to the alternator except that the number of stator slots in automotive alternators is in gene\integer multiple of that of rotor segments, is closely related to the number of rotor slots. Therefore, the statement that only the stator slots is the source of the major peak in the noise spectrum of alternators is suspicious although not easy, to show theoretically, that the statement is incorrect. In this paper. effects of the stator slots on the noise in an automotive alternator are experimentally investigated by intentionally modifying the number of stator slots in such a way that the number of the states is not an integer multiples of the rotor slots. It is shown that both the stator slots are not so much influential as the rotor slots and claimed that the major peak in the noise spectrum of conventional alternators is due to superposition of a component caused by the stator and a higher harmonic component caused by the rotor

INTEGER MATRICES WITH PRESCRIBED PERMANENT AND ITS APPLICATIONS

  • SEOL, HAN-GUK
    • 호남수학학술지
    • /
    • 제28권4호
    • /
    • pp.521-531
    • /
    • 2006
  • In this paper, we construct a procedure of Maple programming for (0, 1)-matrix with a prescribed permanent, $1,2,...,2^{n-1}$. An application of such construction is given, and we obtain the some results of (0, 1)-matrices with the permanent less than or equal to n! by replacing elements 0's by 1's.

  • PDF