• 경영과학
• /
• 제12권2호
• /
• pp.63-75
• /
• 1995

The uncapacitated facility location problem considered here is to determine facility location sites, minimizing the total cost of establishing facilities and serving customer demand points which require primary and back-up services. To solve this problem effectively, we propose two things in this study. First, we propose an idea of Benders' decomposition approach as a solution method of the problem. Second, we implement the problem on GAMS. Using GAMS (general Algebraic Modeling System) can utilize an mixed-integer programming solver such as ZOOM/XMP and provide a completely general automated implementation with a proposed solution method.

• 대한수학회보
• /
• 제44권4호
• /
• pp.817-823
• /
• 2007

In this paper, we develop a simple method for computing the stabilizer subgroup of a subgroup of $$D(g)={{\alpha}{\in}\mathbb{F}_q|there\;is\;a\;{\beta}{\in}{\mathbb{F}}^x_q\;such\;that\;{\beta}^n=g(\alpha)}$$ in $PSL_2(\mathbb{F}_q)$, where q is a large odd prime power, n is a positive integer dividing q-1, and $g(x){\in}\mathbb{F}_q[x]$. As an application, we construct new infinite families of 3-designs (cf. Examples 3.4 and 3.5).

• 대한수학회논문집
• /
• 제32권4호
• /
• pp.789-803
• /
• 2017

Let $K={\mathbb{Q}}({\alpha})$ be a cubic field where ${\alpha}$ is an algebraic integer such that $disc_K({\alpha})$ is square-free. In this paper we will classify the structure of the unit group of the quotient ring ${\mathcal{O}}_K/A$ for each non-zero ideal A of ${\mathcal{O}}_K$.

• Korean Journal of Mathematics
• /
• 제30권2호
• /
• pp.187-198
• /
• 2022

In this paper, we introduce a new concept in number theory called ζ-factors associated with a positive integer n. Applications of ζ-factors are in the arrangement of the defining polynomials in cyclic n-roots algebraic system and are thoroughly investigated. More precisely, ζ-factors arise in the proofs of vanishing theorems in regard to associated prime factors of the system. Exact computations through concrete examples of positive dimensions for n = 16, 18 support the results.

• 한국정보통신학회논문지
• /
• 제2권3호
• /
• pp.335-341
• /
• 1998

본 논문에서는 CS-ACELP(Conjugate Structure Algebraic Code Excited Linear prediction) 음성부호화기의 실시간 구현에 관하여 논한다. CS-ACELP 알고리즘은 ITU-T에서 G.729로 표준화되었다. CS-ACELP 음성부호화 알고리즘의 실시간 구현은 16비트 정수형 DSP 칩을 사용하였다. 16비트 정수형 DSP 칩상에 구현하기 위하여, CS-ACELP 알고리즘의 정수형 시뮬레이션을 사용하였다. CS-ACELP 음성부호화기에 포함된 입출력기능과 통신 기능을 설명한다. DSP Evaluation board를 사용하여 CS-ACELP 음성부호화기를 개발하였고 IMT-2000 Test-bed를 사용하여 검증하였다.

• 충청수학회지
• /
• 제24권1호
• /
• pp.19-34
• /
• 2011

A bounded linear operator T on a complex Banach space X is said to have property (I) provided that T has Bishop's property (${\beta}$) and there exists an integer p > 0 such that for a closed subset F of ${\mathbb{C}}$ ${X_T}(F)={E_T}(F)=\bigcap_{{\lambda}{\in}{\mathbb{C}}{\backslash}F}(T-{\lambda})^PX$ for all closed sets $F{\subseteq}{\mathbb{C}}$, where $X_T$(F) denote the analytic spectral subspace and $E_T$(F) denote the algebraic spectral subspace of T. Easy examples are provided by normal operators and hyponormal operators in Hilbert spaces, and more generally, generalized scalar operators and subscalar operators in Banach spaces. In this paper, we prove that if T has property (I), then the quasi-nilpotent part $H_0$(T) of T is given by $$KerT^P=\{x{\in}X:r_T(x)=0\}={\bigcap_{{\lambda}{\neq}0}(T-{\lambda})^PX$$ for all sufficiently large integers p, where ${r_T(x)}=lim\;sup_{n{\rightarrow}{\infty}}{\parallel}T^nx{\parallel}^{\frac{1}{n}}$. We also prove that if T has property (I) and the spectrum ${\sigma}$(T) is finite, then T is algebraic. Finally, we prove that if $T{\in}L$(X) has property (I) and has decomposition property (${\delta}$) then T has a non-trivial invariant closed linear subspace.

• 한국멀티미디어학회논문지
• /
• 제17권12호
• /
• pp.1402-1411
• /
• 2014

Buyer-seller watermarking protocol is defined as the practice of imperceptible altering a digital content to embed a message using watermarking in the encryption domain. This protocol is acknowledged as one kind of copyright protection techniques in electronic commerce. Buyer-seller watermarking protocol is fundamentally based on public-key cryptosystem that is operating using the algebraic property of an integer. However, in general usage, digital contents which are handled in watermarking scheme mostly exist as real numbers in frequency domain through DCT, DFT, DWT, etc. Therefore, in order to use the watermarking scheme in a cryptographic protocol, digital contents that exist as real number must be transformed into integer type through preprocessing beforehand. In this paper, we presented a new watermarking scheme in an encrypted domain in an image that is based on the block-DCT framework and homomorphic encryption method for buyer-seller watermarking protocol. We applied integral-processing in order to modify the decimal layer. And we designed a direction-adaptive watermarking scheme by analyzing distribution property of the frequency coefficients in a block using JND threshold. From the experimental results, the proposed scheme was confirmed to have a good robustness and invisibility.

• 대한수학회보
• /
• 제52권1호
• /
• pp.239-246
• /
• 2015

If for every elements x and y of an associative algebraic structure (S, ${\cdot}$) there exists a positive integer r such that $ab=b^ra$, then S is called quasi-commutative. Evidently, every abelian group or commutative semigroup is quasi-commutative. Also every finite Hamiltonian group that may be considered as a semigroup, is quasi-commutative however, there are quasi-commutative semigroups which are non-group and non commutative. In this paper, we provide three finitely presented non-commutative semigroups which are quasi-commutative. These are the first given concrete examples of finite semigroups of this type.

• 대한수학회지
• /
• 제50권1호
• /
• pp.161-171
• /
• 2013

Given an integer $n{\geq}1$ and a compact group G, we find some restrictions for the probability that two randomly picked elements $x^n$ and $y$ of G commute. In the case $n=1$ this notion was investigated by W. H. Gustafson in 1973 and its influence on the structure of the group has been studied in the researches of several authors in last years.

• Communications for Statistical Applications and Methods
• /
• 제9권2호
• /
• pp.347-354
• /
• 2002

An n-point design is maximal fan if all the models with n-terms satisfying the divisibility condition are estimable. Such designs tend to be space filling and look very similar to the ″Latin-hypercube″ designs used in computer experiments. Caboara, Pistone, Riccomago and Wynn (1997) conjectured that a maximal fan design on an integer grid exists for any n and m, where m is the number of factors. In this paper we examine the relationship between maximal fan design and latin-hypercube to give a partial solution for the conjecture.