• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2072-2075
• /
• 2003

This paper is studied the high speed processing moving picture encodec to compress and encode a moving picture by real time. This is used the new motion vector search algorithm with smallest search point in H.263 encodec, and is applied the integer DCT for the encodec by converting a moving picture. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer DCT can reduce the operation amount than basis DCT with having an equal PSNR because the multiplication operation of a floating point number does not need.

• 제어로봇시스템학회논문지
• /
• 제6권8호
• /
• pp.719-726
• /
• 2000

A real-time precise positioning is possible with GPS carrier phase measurements with efficient integer ambiguity resolution techniques. It is known that more reliable and fast integer ambiguity resolution is possi-ble as the number of measurements increases. Most precise positioning systems use dual frequency measurements and the wide-lnae technique to resolve integer ambiguity. The wide-lane technique magnifies the measurement noise while it reduces the number of candidates to be examined. In this paper a new integer ambiguity resolution method using dual frequency is proposed The proposed method utilizes the relationship between the wide-lane single frequency and the narrow-lane ambiguities to resolve narrow-lane integer ambiguity after fixing the wide-lane integer ambiguity. Experiments with real data show that the proposed method gives fast and reliable results.

• 대한수학회지
• /
• 제47권4호
• /
• pp.861-877
• /
• 2010

The works of Erd$\ddot{o}$s et al. about expansions of 1 with respect to a non-integer base q, referred to as q-expansions, are investigated to determine how far they continue to hold when the number 1 is replaced by a positive number x. It is found that most results about q-expansions for real numbers greater than or equal to 1 are in somewhat opposite direction to those for real numbers less than or equal to 1. The situation when a real number has a unique q-expansion, and when it has exactly two q-expansions are studied. The smallest base number q yielding a unique q-expansion is determined and a particular sequence is shown, in certain sense, to be the smallest sequence whose corresponding base number q yields exactly two q-expansions.

• 제어로봇시스템학회논문지
• /
• 제5권1호
• /
• pp.62-68
• /
• 1999

The attitude of a vehicle can be precisely determined using GPS carrier phase measurements from more than two antennas attached to a vehicle and an efficient integer ambiguity resolution technique. Many methods utilizing the known baseline length as a constraint of independent elements of integer ambiguities are proposed to resolve integer ambiguity at real time. Three-dimensional search space is reduced to two-dimensional search space with this constraint. Thus the true integer ambiguity can be easily determined with less computational burden and fewer number of measurements. But there are still strong requirements for the real time integer ambiguity resolution, which uses single epoch measurement of long baseline. In this paper, a new constraint from the geometry of multiple baselines is derived. With this new constraint, two-dimensional search space is further reduced to one-dimensional search space. It makes possible to determine integer ambiguity with single epoch measurement. The proposed method is applied to real data to show its effectiveness.

• 한국통신학회논문지
• /
• 제18권12호
• /
• pp.1928-1934
• /
• 1993

본 논문에서는 VLSI 구현을 위하여 IC의 구조를 간단하게 하고 정수 연산을 수행하는 정수화 DCT에 대한 고속 알고리즘을 제안하였다. 정수화 DCT의 고속 알고리즘은 Chen의 행열 분해 방식을 사용하여 구현하였다. 이 고속 알고리즘은 직접적인 정수화 DCT 계산방식에 비해 덧셈과 곱셈수의 연산수가 크게 감소하였으며, 덧셈수는 DCT의 고속 알고리즘의 경우와 같으며, 곱셈수는 N가 8일 때는 DCT의 고속 알고리즘의 경우와 같지만 N가 8보다 클 경우 곱셈수가 현저하게 감소한다. 뿐만아니라 유한길이 연산으로 인한 DCT의 성능 저하를 극복 할 수 있다.

• 산업경영시스템학회지
• /
• 제18권36호
• /
• pp.183-191
• /
• 1995

When designing a warehouse, one has to recognize that the number of racks in a warehouse takes on only integer value in reality. The existing solution procedures based on noninteger values may result in poor outcomes for the design of a warehouse. This paper deals with the determination of the optimal integer for the number of racks that minimize the total material handling cost associated with the warehouse. An optimum search procedure is proposed here and a number of numerical examples are used to evaluate the efficiency of the proposed procedure.

• 대한수학회논문집
• /
• 제25권2호
• /
• pp.167-171
• /
• 2010

We will show that if d is a cubefree integer and n is an integer, then with some suitable conditions, there are no primes p and a positive integer m such that d is a cubic residue (mod p), $3\;{\nmid}\;m$, p || n if and only if there are integers x, y, z such that $$x^3\;+\;dy^3\;+\;d^2z^3\;-\;3dxyz\;=\;n$$.

• 호남수학학술지
• /
• 제29권3호
• /
• pp.427-443
• /
• 2007

The spanning column rank of an $m{\times}n$ integer matrix A is the minimum number of the columns of A that span its column space. We compare the spanning column rank with column rank of matrices over the ring of integers. We also characterize the linear operators that preserve the spanning column rank of integer matrices.

• 정보보호학회논문지
• /
• 제1권1호
• /
• pp.97-101
• /
• 1991

다항식 인수분해 문제는 정수론에서 뿐만 아니라 Discrete logarithm과 관련하여 암호학의 응용에도 중요한 문제이다. Hensel의 Lifting Lemma를 이용하여 유한체위에서 다항식을 인수분해하여 정수계수위에서 다항식의 인수를 찾는 방법으로 정수계수위에서 다항식의 인수분해를 실행하였다.

• 대한수학회보
• /
• 제59권1호
• /
• pp.111-117
• /
• 2022

Let p_a,b,m(n) be the number of integer partitions of n with more parts congruent to a modulo m than parts congruent to b modulo m. We prove that p_a,b,m(n) ≥ p_b,a,m(n) whenever 1 ≤ a < b ≤ m. We also propose some conjectures concerning series with nonnegative coefficients in their expansions.