• 산업경영시스템학회지
• /
• 제19권40호
• /
• pp.169-178
• /
• 1996

Geographically dispersed computing system is made of computers interconnected by a telecommunications network. To make the system operated efficiently, system designer must determine the allocation of data files to each node. In designing such distributed computing system, the most important issue is the determination of the numbers and the locations where database files are allocated. This is commonly referred to as the file allocation problem (FAP)[3]. The proposed model is a 0/l integer programming problem minimizing the sum of file storage costs and communication(query and update) costs. File allocation problem belongs to the class of NP-Complete problems. Because of the complexity, it is hard to solve. So, this paper presents an efficient heuristic algorithm to solve the file allocation problem using Tabu Search Technique. By comparing the optimal solutions with the heuristic solutions, it is believed that the proposed heuristic algorithm gives good solutions. Through the experimentation of various starting points and tabu restrictions, this paper presents fast and efficient method to solve the file allocation problem in the distributed computing system.

• Journal of applied mathematics & informatics
• /
• 제33권5_6호
• /
• pp.475-484
• /
• 2015

In this article, we deal with the uniqueness problems of meromorphic functions concerning differential polynomials and prove the following theorem. Let f and g be two nonconstant meromorphic functions, n ≥ 12 a positive integer. If fⁿ(f³ - 1)f′ and gⁿ(g³ - 1)g′ share (1, 2), f and g share ∞ IM, then f ≡ g. The results in this paper improve and generalize the results given by Meng (C. Meng, Uniqueness theorems for differential polynomials concerning fixed-point, Kyungpook Math. J. 48(2008), 25-35), I. Lahiri and R. Pal (I. Lahiri and R. Pal, Nonlinear differential polynomials sharing 1-points, Bull. Korean Math. Soc. 43(2006), 161-168), Meng (C. Meng, On unicity of meromorphic functions when two differential polynomials share one value, Hiroshima Math.J. 39(2009), 163-179).

• 대한수학회지
• /
• 제54권4호
• /
• pp.1301-1316
• /
• 2017

It is well known that every $x{\in}(0,1]$ can be expanded to an infinite $L{\ddot{u}}roth$ series with the form of $$x={\frac{1}{d_1(x)}}+{\cdots}+{\frac{1}{d_1(x)(d_1(x)-1){\cdots}d_{n-1}(x)(d_{n-1}(x)-1)d_n(x)}}+{{\cdots}}$$, where $d_n(x){\geq}2$ for all $n{\geq}1$. In this paper, the set of points with some restrictions on the digits in $L{\ddot{u}}roth$ series expansions are considered. Namely, the Hausdorff dimension of following the set $$F_{\phi}=\{x{\in}(0,1]\;:\;d_n(x){\geq}{\phi}(n),\;i.o.n}$$ is determined, where ${\phi}$ is an integer-valued function defined on ${\mathbb{N}}$, and ${\phi}(n){\rightarrow}{\infty}$ as $n{\rightarrow}{\infty}$.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.11-22
• /
• 1997

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.743-753
• /
• 2001

We provide local convergence results in affine form for inexact Newton-like as well as quasi-Newton iterative methods in a Banach space setting. We use hypotheses on the second or on the first and mth Frechet-derivative (m≥2 an integer) of the operator involved. Our results allow a wider choice of starting points since our radius of convergence can be larger than the corresponding one given in earlier results using hypotheses on the first-Frechet-derivative only. A numerical example is provided to illustrate this fact. Our results apply when the method is, for example, a difference Newton-like or update-Newton method. Furthermore, our results have direct applications to the solution of autonomous differential equations.

• 대한전자공학회논문지
• /
• 제27권3호
• /
• pp.47-53
• /
• 1990

곡선의 다각형 근사화 방법은 화상분석 또는 데이타 압축등에 많이 사용된다. 다각형 근사화 방법으로, 적은 break point수를 갖고, Sequential Process로 결과를 얻을 수 있는 Cone intersection 방법이 있다. 여기서는 화소간의 거리가 일정한 디지탈 곡선의 경우, 종래의 cone intersection 방법을 정수계산을 이용하여 속도를 향상시키는 방법을 제안한다.

• 수산해양교육연구
• /
• 제26권4호
• /
• pp.760-768
• /
• 2014

Yet logistics base in China has a refrigerated storage facilities installed areas, the number of those is very limited and is generally insufficient. According to these especial points, a new construction cold chain logistics network design strategy is required from how to use the existing refrigerated warehouses to new issue. For example, however refrigerated storage facility is supplied, can it satisfy all demand of this area? Then does it have optimized location of this area? If future demand expansion, adding that already other refrigerated storage facilities matter? Or, add another refrigerated facilities, optimum cold chain established a network matter? So on. Above problems can be occurred. In order to solve facing many of these issues of distribution network, northeast area in China has been selected as a subject, and we designed a new cold chain distribution network.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권4호
• /
• pp.235-242
• /
• 2016

The emerging High-Efficiency Video Coding (HEVC) standard attempts to improve coding efficiency by a factor of two over H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation (ME) is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Thus, fast mode decisions are not only an important issue to be researched, but also an urgent one. Several schemes for fast mode decisions have been presented in reference software and in other studies. However, the conventional hierarchical mode decision can be useless when block-level parallelism is exploited. This paper proposes operation-level exploration that offers more chances for early termination. An early termination condition is checked between integer and fractional MEs and between the parts of one partition type. The fast decision points of the proposed algorithm do not overlap those in previous works. Thus, the proposed algorithms are easily used with other fast algorithms, and consequently, independent speed-up is possible.

• 대한수학회보
• /
• 제40권1호
• /
• pp.149-157
• /
• 2003

Let M be an exponentially bounded o-minimal expansion of the standard structure R = (R ,＋,.,<) of the field of real numbers. We prove that if r is a non-negative integer, then every definable $C^{r}$ manifold is affine. Let f : X ${\longrightarrow}$ Y be a definable $C^1$ map between definable $C^1$ manifolds. We show that the set S of critical points of f and f(S) are definable and dim f(S) < dim Y. Moreover we prove that if 1 < s < ${\gamma}$ < $\infty$, then every definable $C^{s}$ manifold admits a unique definable $C^{r}$ manifold structure up to definable $C^{r}$ diffeomorphism.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.1-4
• /
• 2010

As a countermeasure to simple power attack, the unified point addition codes for the elliptic curve cryptosystem were introduced. However, some authors proposed a different kind of power attacks to the codes. This power attack uses the observation that some internal operations in the codes behave differently for addition and doubling. In this paper, we propose a new countermeasure against such an attack. The basic idea of the new countermeasure is that, if one of the input points of the codes is transformed to an equivalent point over the underlying finite field, then the code will behave in the same manner for addition and doubling. The new countermeasure is highly efficient in that it only requires 27(n-1)/3 extra ordinary integer subtractions (in average) for the whole n-bit scalar multiplication. The timing analysis of the proposed countermeasure is also presented to confirm its SPA resistance.