• 대한수학회보
• /
• 제58권2호
• /
• pp.305-313
• /
• 2021

Let h ≥ 2 and A = {a0, a1, …, ak-1} be a finite set of integers. It is well-known that |hA| = hk - h + 1 if and only if A is a k-term arithmetic progression. In this paper, we give some nontrivial inverse results of the sets A with some extremal the cardinalities of hA.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.218-220
• /
• 2004

Orthogonal frequency division multiplexing(OFDM) is one of the most promising technique for next generation wireless broadband communication systems. In this paper, we propose a new bit allocation algorithm in multiuser OFDM. The proposed algorithm is derived from the geometric progression of the additional transmit power of subcarriers and the arithmetic-geometric means inequality. The simulation shows that this algorithm has similar performance to the conventional adaptive bit allocation algorithm and lower computational complexity than the existing algorithms.

• 전자공학회논문지CI
• /
• 제43권1호
• /
• pp.1-8
• /
• 2006

본 논문은 의사난수발생기로 사용할 수 있는 산술 시프트 레지스터(ASR, Arithmetic Shift Register)를 제안한다. 산술 시프트 레지스터는 $GF(2^n)$상에서 0이 아닌 초기 값에 0 또는 1이 아닌 임의의 수 D를 곱하는 수열로 정의한다. 그리고 이를 본 논문에서는 ASR-D로 표현한다. $GF(2^n)$상에서 $'D^k=1'$ 되는 t가 $'t=2^n-1'$로 유일하게 되는 비복원다항식이 ASR-D의 특성다항식이며, ASR-D의 주기는 $'2^n-1'$로 최대주기를 가진다 갈로이 선형 궤환 시프트 레지스터는 $ASR-2^{-1}$에 해당한다. 그러므로 제안하는 산술 시프트 레지스터는 갈로이 선형 제환 시프트 레지스터를 일반화한 것이다. $GF(2^n)$상의 ASR-D의 선형복잡도는 $'n{\leq}LC{\leq}\frac{n^2+n}{2}'$으로 종래의 선형 궤환 시프트 레지스터와 비교하여 안정도가 높다. 제안한 산술 시프트 레지스터의 소프트웨어 구현은 종래의 선형 제환 시프트 레지스터에 비하여 효율적이며, 하드웨어 복잡도는 동일하다. 제안한 산술 시프트 레지스터는 종래의 선형 제환 시프트 레지스터와 같이 암호, 오류수정부호, 몬테카를로 적분, 데이터통신 등 여러 분야에서 폭 넓게 사용될 수 있다.

• 논리연구
• /
• 제5권1호
• /
• pp.147-157
• /
• 2001

In this study I try to show some numerical analogy between Leibniz's binary system anc I-ching's symbolic system of duo rerum principia, imagines quator, octo figurae am 64 hexagrams. But, there is really a formal logical accordance in their symbolic foundations, on which are based especially the Wittgenstein's 16 truth-tables in his Tractatus-logico-philosophicus(5.101) am 16 hexagrams, as long as we interpret with the binary values 0 am 1, i.e. the Bi-Polarity, the logical tradition from J. Boole, G. Frege through B. Russell and AN. Whitehead to R. Wittgenstein. So, I argue that the historical and theoretical root of that tradition goes back to the debate between Bouvet and Leibniz about the mathematical structure of I-ching' symbols and the Leibnizian binary arithmetic. In the letter on 4. 11. 1701 from Peking to Leibniz, Bouvet wrote that the I-Ching's symbolism has an analogous structure with Leibniz's binary arithmetic. Corresponding to his suggestion, but without exact knowledge, in the letter of 2. January 1967 to the duke August in Braunschweig-Lueneburg-Wolfenbuettel had Leibniz shown already an original idea for the creation of the world with imago Dei which comes from binary progression, dark and light on water.

• Journal of Forest and Environmental Science
• /
• 제32권1호
• /
• pp.55-67
• /
• 2016

This paper investigated policies that drive the sustainable management of Ivorian forest which disappear at an annual rate of 250000 hectares. Based on an inter-temporal model for optimum allocation of forest land to three competing uses, the article found that sustainability depends on the incentive structure, of which forest taxes and fees are a key, though obviously not the sole, component. The study proposed to increase the area fee level by accounting for environmental externalities generated by forest harvesters and farmers. The paper showed that the area fee is a decreasing function of the forest natural rate of regeneration and the reconversion rate of agricultural surfaces. Finally, at the given forest natural rate of regeneration and the reconversion rate of agricultural surfaces, the model argued that the area fee need to be progressive (arithmetic progression) in the context of ecological equilibrium break while it should remain constant in normal situation.

• ETRI Journal
• /
• 제29권4호
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.717-734
• /
• 1998

In the present paper is presented a new matrix pencil-based numerical approach achieving the computation of the elemen-tary divisors of a given matrix $A \in C^{n\timesn}$ This computation is at-tained without performing similarity transformations and the whole procedure is based on the construction of the Piecewise Arithmetic Progression Sequence(PAPS) of the associated pencil $\lambda I_n$ -A of matrix A for all the appropriate values of $\lambda$ belonging to the set of eigenvalues of A. This technique produces a stable and accurate numerical algorithm working satisfactorily for matrices with a well defined eigenstructure. The whole technique can be applied for the computation of the first second and Jordan canonical form of a given matrix $A \in C^{n\timesn}$. The results are accurate for matrices possessing a well defined canonical form. In case of defective matrices indications of the most appropriately computed canonical form. In case of defective matrices indication of the most appropriately computed canonical form are given.

• 대한수학회논문집
• /
• 제15권4호
• /
• pp.697-706
• /
• 2000

If an arithmetic progression F of length 2n and the number k with 2k$\leq$n are give, can we find two monic polynomials with the same degrees whose set of all zeros form F such that both the number of bad pairs and the number of nonreal zeros are 2k? We will consider the case that both the number of bad pairs and the number of nonreal zeros are two. Moreover, we will see the fundamental relation between the number of bad pairs and the number of nonreal zeros, and we will show that the polynomial in x where the coefficient of x(sup)k is the number of sequences having 2k bad pairs has all zeros real and negative.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.88.5-88
• /
• 2001

We propose a neural network solver for an inverse problem. The problem is that input data with complete teaching include defects and predict the defect value. The solver is constructed of a three layer neural network whose learning method is combined from BP and reconstruction learning. The input data for the defects are unknown; therefore, the circulation of an arithmetic progression replaces them; rightly, the learning procedure is not converged for the circulation data vut for the normal data. The learning is quitted after such a learning status id kept. Then, we search a minimum of the differences between teaching data and output of the circulation. Then, we search a minimum of the ...

• 대한수학회보
• /
• 제58권6호
• /
• pp.1341-1354
• /
• 2021

Let r ≥ 2, and let k_i ≥ 2 for 1 ≤ i ≤ r. Mixed van der Waerden's theorem states that there exists a least positive integer w = w(k₁, k₂, k₃, …, k_r; r) such that for any n ≥ w, every r-colouring of [1, n] admits a k_i-term arithmetic progression with colour i for some i ∈ [1, r]. For k ≥ 3 and r ≥ 2, the mixed van der Waerden number w(k, 2, 2, …, 2; r) is denoted by w₂(k; r). B. Landman and A. Robertson [9] showed that for k < r < $\frac{3}{2}$(k - 1) and r ≥ 2k + 2, the inequality w₂(k; r) ≤ r(k - 1) holds. In this note, we establish some results on w₂(k; r) for 2 ≤ r ≤ k.