• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1157-1163
• /
• 2009

Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

• 한국멀티미디어학회논문지
• /
• 제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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5212-5230
• /
• 2016

How to determine the right number of small base stations to activate in multi-cell uplinks to match traffic from a fixed quantity of K users is an open question. This paper analyses the uplink cooperative that jointly receives base stations activation to explore this question. This paper is different from existing works only consider transmitting power as optimization objective function. The global objective function is formulated as a summation of two terms: transmitting power for data and coordinated overhead for control. Then, the joint base stations activation and beamforming problem is formulated as a mixed integer second order cone optimization. To solve this problem, we develop two polynomial-time distributed methods. Method one is a two-stage solution which activates no more than K small base stations (SBSs). Method two is a heuristic algorithm by dual decomposition to MI-SOCP that activates more SBSs to obtain multiple-antennae diversity gains. Thanks to the parallel computation for each node, our methods are more computationally efficient. The strengths and weaknesses of these two proposed two algorithms are also compared using numerical results.

• Bulletin of the Korean Chemical Society
• /
• 제30권11호
• /
• pp.2617-2620
• /
• 2009

Using Coulomb-Yukawa like correlated interaction potentials of integer and noninteger indices the series expansion formulae in terms of multicenter overlap integrals of three complete orthonormal sets of ${\psi}^{\alpha}$‒exponential type orbitals and linear combination coefficients of molecular orbitals are established for the potential of electrostatic field produced by the charges of molecule, where $\alpha$ = 1, 0, ‒1, ‒2,${\cdots}$. The formulae obtained can be useful for the study of interaction between atomic--molecular systems containing any number of closed and open shells when the ${\psi}^{\alpha}$‒exponential type basis functions and Coulomb-Yukawa like correlated interaction potentials are used in the Hartree-Fock-Roothaan and explicitly correlated approximations. The final results are valid for the arbitrary values of parameters of correlated interaction potentials and orbitals. As an example of application, the calculations have been performed for the potential energy of interaction between electron and molecule $H_2O$ using combined Hartree-Fock-Roothaan equations suggested by the author.

• 산업공학
• /
• 제13권4호
• /
• pp.658-667
• /
• 2000

Seasonal variation of natural gas demand coupled with rigid and stable import pattern of gas represents the characteristic feature of the Korean Liquified Natural Gas(LNG) industry. This attribute has required a huge amount of investment for the construction of storage facility. Thus, to minimize the supply cost, it is legitimate to reduce storage requirement itself. In this study, we combine three alternative methods to deal with the storage requirement to minimize the supply cost. Those are (1) adding additional storage tanks, (2) inducing large firm customers, and (3) constructing gas-turbine self generation facilities. Methodologically, we employ the mixed integer program (MIP) to optimize the system. The model also consider demand and price-setting scheme in separate modules. From the results, it is shown that if alternatives are combined optimally, a number of storage tanks can be reduced substantially compared with the original capacity plan set by the industry authorities. We perform various sensitivity analyses to check the robustness of the results. The methodology presented in this study can be applied to the other physical network industry, such as hydraulics. The empirical results will shed some light on the rationalization of capacity planning of the Korean natural gas industry.

• 한국항해학회지
• /
• 제20권4호
• /
• pp.59-70
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. In this paper, we concerned with of fuzzy mathematical programming models for a berth assignment problem to achieved an efficient berth operation in a fuzzy environment. In this paper, we focus on the berth assignment programming with fuzzy parameters which are based on personal opinions or subjective judgement. From the above point of view, assume that a goal and a constraint are given by fuzzy sets, respectively, which are characterized by membership functions. Let a fuzzy decision be defined as the fuzzy set resulting from the intersection of a goal and constraint. This paper deals with fuzziness in all parameters which are expressed by fuzzy numbers. A fuzzy parameter defined by a fuzzy number means a possibility distribution of the parameters. These fuzzy 0-1 integer programming problems are formulated by fuzzy functions whose concept is also called the extension principle. We deal with a berth assignment problem with triangular fuzzy coefficients and propose a branch and bound algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) concept. The berth assignment problem is formulated by min-max and fuzzy 0-1 integer programming. Finally, we gave the numerical solutions of the illustrative examples.

• 한국게임학회 논문지
• /
• 제19권4호
• /
• pp.97-108
• /
• 2019

최근 입력 방식의 다양성이나 편리성 때문에 음성 게임 명령어에 대한 관심이 증가하고 있다. 음성 명령어의 인식률은 인식 엔진의 성능뿐만이 아니라, 명령어간의 거리에도 영향을 받는다. 명령어간 거리란 명령어 발음간의 음성적 차이를 말하는데, 이 거리가 클수록 인식률이 높아진다. 본 논문에서 우리는 명령별 명령어 후보들이 주어졌을 때 명령어간의 평균 거리를 최대화하는 명령어 조합을 선택하는 문제를 IP(Integer Programming)으로 모델링한다. 또한 명령어 선택 문제의 해를 구하는 SA(Simulated Annealing) 기반의 방법을 제안한다. 우리의 방법을 명령어 수, 허용되는 명령어 길이 등의 다양한 조건에 하에서 실험한 결과를 토대로 특징을 분석한다.

• 대한수학회지
• /
• 제60권5호
• /
• pp.1073-1085
• /
• 2023

A partition of n is called a t-core partition if none of its hook number is divisible by t. In 2019, Hirschhorn and Sellers [5] obtained a parity result for 3-core partition function a3(n). Motivated by this result, both the authors [8] recently proved that for a non-negative integer α, a3αm(n) is almost always divisible by an arbitrary power of 2 and 3 and at(n) is almost always divisible by an arbitrary power of pji, where j is a fixed positive integer and t = pa11pa22···pamm with primes pi ≥ 5. In this article, by using Hecke eigenform theory, we obtain infinite families of congruences and multiplicative identities for a2(n) and a13(n) modulo 2 which generalizes some results of Das [2].

• 대한수학회보
• /
• 제55권5호
• /
• pp.1523-1528
• /
• 2018

For $r{\geq}2$, let ${\mathcal{H}}$ be an r-uniform hypergraph with n vertices and m hyperedges. Let R be a random vertex set obtained by choosing each vertex of ${\mathcal{H}}$ independently with probability p. Let ${\mathcal{H}}[R]$ be the subhypergraph of ${\mathcal{H}}$ induced on R. We obtain an upper bound on the matching number ${\nu}({\mathcal{H}}[R])$ and a lower bound on the independence number ${\alpha}({\mathcal{H}}[R])$ of ${\mathcal{H}}[R]$. First, we show that if $mp^r{\geq}{\log}\;n$, then ${\nu}(H[R]){\leq}2e^{\ell}mp^r$ with probability at least $1-1/n^{\ell}$ for each positive integer ${\ell}$. It is best possible up to a constant factor depending only on ${\ell}$ if $m{\leq}n/r$. Next, we show that if $mp^r{\geq}{\log}\;n$, then ${\alpha}({\mathcal{H}}[R]){\geq}np-{\sqrt{3{\ell}np\;{\log}\;n}-2re^{\ell}mp^r$ with probability at least $1-3/n^{\ell}$.

• 한국통신학회논문지
• /
• 제37A권12호
• /
• pp.1031-1037
• /
• 2012

Tonelli-Shanks 알고리즘을 변형한 새로운 알고리즘을 통해 효율적으로 제곱근 및 세제곱근을 찾을 수 있는 방법을 연구하였다. 이 논문에서 소개하는 제곱근을 찾는 알고리즘은 Number Field Sieve에 응용할 수 있다. 큰 합성수를 인수분해하는데 가장 효율적인 알고리즘으로 알려진 Number Field Sieve (NFS)는 법 N에 대하여 공통근을 갖는 두 다항식 선택한 후에, sieving, linear algebra, square root 단계를 차례대로 거친다. NFS의 마지막 단계에서는 수체(Number Field)상에서 제곱근을 구하는 과정이 필요한데 이를 유한체(Finite Field)상으로 내려서 계산한 후 CRT(Chinese Remainder Theorem)을 이용하여 수체 상에서의 제곱근으로 복원하는 과정에서 제안된 알고리즘이 사용될 수 있다.