• 대한산업공학회지
• /
• 제26권3호
• /
• pp.220-226
• /
• 2000

The problem (P) of optimizing a linear function $d^Tx$ over the set of efficient points for a multiple objective linear program (M) is difficult because the efficient set is nonconvex. There are some interesting properties between the objective linear vector d and the matrix of multiple objectives C and those properties lead us to establish criteria to solve (P) with a linear program. In this paper we investigate a system of the linear equations $C^T{\alpha}$ = d and construct two linearly independent positive vectors u, v such that ${\alpha}$ = u - v. From those vectors u, v, solving an weighted sum linear program for finding an efficient extreme point for the (M) is a way of getting an optimal solution of the problem (P). Therefore the theorems presented in this paper provided us an easy way of solving nonconvex program (P) with a weighted sum linear program.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2009년 춘계학술대회논문집
• /
• pp.165-169
• /
• 2009

The effect of the Dirichlet boundary condition for the redistance equation of level set method on the solutionof sloshing problem is investigated by adopting four Dirichlet boundary conditions. For the solution of the incompressible Navier-Stokes equations, P1P1 four-step fractional finite element method is employed and a least-square finite element method is used for the solutions of the two hyperbolic type equations of level set method; advection and redistance equation. ALE (Arbitrary Lagrangian Eulerian) method is used to deal with a moving computational domain. It has been shown that the free surface motion in a sloshing tank is strongly dependent on the type of the Dirichlet boundary condition and the results of broken dam and sloshing problems using various Dirichlet boundary conditions are discussed and compared with the existing experimental results.

• Journal of information and communication convergence engineering
• /
• 제9권1호
• /
• pp.105-109
• /
• 2011

In this paper, we study the dominating-free sest which is defined as follows: k points called servers and n points called clients in the plane are given. For a point p in the plane is said to be dominated by a client c if for every server s, the distance between s and p is greater than the distance between s and c. The dominating-free set is the set of points in the plane which aren't dominated by any client. We present an O(nklogk+$n^2k$) time algorithm for computing the dominating-free set under the $L_1$-metric. Specially, we present an O(nlogn) time algorithm for the problem when k=2. The algorithm uses some variables and 1-dimensional arrays as its principle data structures, so it is easy to implement and runs fast.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.731-734
• /
• 1998

A scalable parallel algorithm is proposed for efficient image component labeling with local operatos on a mesh connected SIMD computer. In contrast to the conventional parallel labeling algorithms, where a single pixel is assigned to each PE, the algorithm presented here is scalable and can assign m$\times$m pixel set to each PE according to the input image size. The assigned pixel set is converted to a single pixel that has representative value, and the amount of the required memory and processing time can be highly reduced. For N$\times$N image, if m$\times$m pixel set is assigned to each PE of P$\times$P mesh, where P=N/m, the time complexity due to the communication of each PE and the computation complexity are reduced to O(PlogP) bit operations and O(P) bit operations, respectively, which is 1/m of each of the conventional method. This method also diminishes the amount of memory in each PE to O(P), and can decrease the number of PE to O(P2) =Θ(N2/m2) as compared to O(N2) of conventional method. Because the proposed parallel labeling algorithm is scalable, we can adapt to the increase of image size without the hardware change of the given mesh connected SIMD computer.

• 대한수학회보
• /
• 제50권1호
• /
• pp.83-96
• /
• 2013

Let K be a number field and fix a prime number $p$. For any set S of primes of K, we here say that an elliptic curve E over K has S-reduction if E has bad reduction only at the primes of S. There exists the set $B_{K,p}$ of primes of K satisfying that any elliptic curve over K with $B_{K,p}$-reduction has no $p$-torsion points under certain conditions. The first aim of this paper is to construct elliptic curves over K with $B_{K,p}$-reduction and a $p$-torsion point. The action of the absolute Galois group on the $p$-torsion subgroup of E gives its associated Galois representation $\bar{\rho}_{E,p}$ modulo $p$. We also study the irreducibility and surjectivity of $\bar{\rho}_{E,p}$ for semistable elliptic curves with $B_{K,p}$-reduction.

• 한국지능시스템학회논문지
• /
• 제22권2호
• /
• pp.212-217
• /
• 2012

확률공간 (${\Omega}$, $\mathfrak{F}$, $P$) 위에 정의된 퍼지집합을 퍼지이벤트라 한다. Zadeh는 확률 $P$를 이용하여 퍼지이벤트 $A$에 대한 확률을 정의하였다. 우리는 일반화된 삼각퍼지집합을 정의하고 거기에 확장된 대수적 작용소를 적용하였다. 일반화된 삼각퍼지집합은 대칭적이지만 함숫값으로 1을 갖지 않을 수 있다. 두 개의 일반화된 삼각퍼지집합 $A$와 $B$에 대하여 $A(+)B$와 $A(-)B$는 일반화된 사다리꼴퍼지집합이 되었지만, $A({\cdot})B$와 $A(/)B$는 일반화된 삼각퍼지집합도 되지 않았고 일반화된 사다리꼴퍼지집합도 되지 않았다. 그리고 정규분포를 이용하여 $\mathbb{R}$위에서 정규퍼지확률을 정의하였다. 그리고 일반화된 삼각퍼지집합에 대한 정규퍼지확률을 계산하였다.

• 한국정보과학회논문지:시스템및이론
• /
• 제28권1_2호
• /
• pp.73-79
• /
• 2001

단순 다각형 P에 대한 새로운 화량문제인 경비가능충분집합(Guard Sufficiency Set:GSS)에 대하여 소개하고 정의하였다. 집합 S P가 P의 경비가능집합이라는 의미는 P의 각 점들이 최소한 S에 있는 한 점으로부터 보인다는 것을 의미한다. 집합 G P가 P의 경비가능충분집합이라는 의미는 G를 경비 가능한 임의의 집합 S P가 P 역시 경비 가능하다는 것을 의미한다. 본 논문에서는 꼭지점에 대한 GSS가 다각형 전체에 대한 GSS가 되는 다각형 부류를 제시하고, 또한 에지에 대한 GSS가 다각형 전체에 대한 GSS가 되는 다각형 부류를 제시한다. 그리고, P의 꼭지점에 대한 GSS의 크기에 대한 하한과 상한을 제시하고, 기하학적 요소에 특정 제약조건을 주어 대체 GSS을 정의할 수 있음을 보인다. 이 외에도 다양한 GSS 문제들을 소개하고, 기하학적 요소에 제약을 가한 대체 GSS를 정의하고 그와 관련된 가설을 하나 제시한다.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제12권4호
• /
• pp.253-274
• /
• 2005

An additive regular Semiring S is left inversive if the Set E+ (S) of all additive idempotents is left regular. The set LC(S) of all left inversive semiring congruences on an additive regular semiring S is a lattice. The relations $\theta$ and k (resp.), induced by tr. and ker (resp.), are congruences on LC(S) and each $\theta$-class p$\theta$ (resp. each k-class pk) is a complete modular sublattice with $p_{min}$ and $p_{max}$ (resp. With $p^{min}$ and $p^{max}$), as the least and greatest elements. $p_{min},\;p_{max},\;p^{min}$ and $p^{max}$, in particular ${\epsilon}_{max}$, the maximum additive idempotent separating congruence has been characterized explicitly. A semiring is quasi-inversive if and only if it is a subdirect product of a left inversive and a right inversive semiring.

• 한국국방경영분석학회지
• /
• 제8권1호
• /
• pp.71-76
• /
• 1982

A procedure is established for combining a regression model and a time series model to fit to a set of autocorrelated data. This procedure is based on an iterative method to compute regression parameter estimates and time series parameter estimates simultaneously. The time series model which is discussed is basically AR(p) model, since MA(q) model or ARMA(p,q) model can be inverted to AR({$\infty$) model which can be approximated by AR(p) model. The procedure discussed in this articled is applied in general to any combination of regression model and time series model.

• 대한수학회지
• /
• 제33권3호
• /
• pp.669-677
• /
• 1996

Let $M_n$ be the $C^*$-algebra of all $n \times n$ matrices over the complex field, and $P[M_m, M_n]$ the convex cone of all positive linear maps from $M_m$ into $M_n$ that is, the maps which send the set of positive semidefinite matrices in $M_m$ into the set of positive semi-definite matrices in $M_n$. The convex structures of $P[M_m, M_n]$ are highly complicated even in low dimensions, and several authors [CL, KK, LW, O, R, S, W]have considered the possibility of decomposition of $P[M_m, M_n] into subcones.