• 한국통신학회논문지
• /
• 제31권11A호
• /
• pp.1037-1043
• /
• 2006

본 논문은 인터넷 상에서 동기화된 실시간 미디어 멀티캐스트 서비스에 적합한 오버레이 멀티캐스트 트리를 구성하는 알고리즘을 제안한다. 제안하는 알고리즘은 멀티캐스트 송신 단에서 각 종단 시스템 사이의 전송 지연에 대한 평균과 변이를 최소화하는 트리 구성을 찾는다. 그러나 위의 문제는 NP-완전하므로, 이러한 문제의 계산 복잡도를 낮추면서, 근사해를 찾기 위한 방법으로 OGA (Orthogonal Genetic Algorithm)을 이용하였다. 실험 결과에서 제안하는 알고리즘이 기존 알고리즘에 비해 통기화된 실시간 미디어 데이터 전송을 위한 효과적인 트리를 구성한다는 것을 보인다.

• 대한수학회지
• /
• 제45권6호
• /
• pp.1705-1723
• /
• 2008

Let n be a 2-step nilpotent Lie algebra which has an inner product <, > and has an orthogonal decomposition $n\;=z\;{\oplus}v$ for its center z and the orthogonal complement v of z. Then Each element z of z defines a skew symmetric linear map $J_z\;:\;v\;{\longrightarrow}\;v$ given by <$J_zx$, y> = for all x, $y\;{\in}\;v$. In this paper we characterize Jacobi fields and calculate all conjugate points of a simply connected 2-step nilpotent Lie group N with its Lie algebra n satisfying $J^2_z$ = A for all $z\;{\in}\;z$, where S is a positive definite symmetric operator on z and A is a negative definite symmetric operator on v.

• International Journal of Precision Engineering and Manufacturing
• /
• 제7권2호
• /
• pp.12-17
• /
• 2006

This study uses a characteristic function to explain correlations between the objective function and design variables. For the use, structural analysis and buckling analysis are carried out. the dimensional change of an original overhead crane is made based on the table of orthogonal array. For two functions or more, the effectiveness of design change can be evaluated in accordance with change in design parameters. Also, the overhead crane's weight is reduced by up to 10.55 percent while its structural stability maintained.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.285-293
• /
• 2006

Let X be a n-set and let A = [aij] be a $n {\times} n$ matrix for which $aij {\subseteq} X$, for $1 {\le} i,\;j {\le} n$. A is called a generalized Latin square on X, if the following conditions is satisfied: $U^n_{i=1}\;aij = X = U^n_{j=1}\;aij$. In this paper, we prove that every generalized Latin square has an orthogonal mate and introduce a Hv-structure on a set of generalized Latin squares. Finally, we prove that every generalized Latin square of order n, has a transversal set.

• 대한기계학회논문집A
• /
• 제25권2호
• /
• pp.312-322
• /
• 2001

This paper investigates the combined effects of parameters such as die surface finish, die directionality of stoning contact pressure and draw speed on the resulting coefficient of friction. Also, this study show the correlation between the NN(Neural Network) and DOE(Design of Experiments) to reduce the number of experiments without the loss of the effects of parameter upon coefficient of friction. The experiments were run in random order with at least three replicates. It was found that the directional stoning orthogonal to the pulling direction is lower friction than directional stoning parallel to the pulling directi on using FCD55 die and SPCEN.

• 대한수학회논문집
• /
• 제37권2호
• /
• pp.371-384
• /
• 2022

Fix an integer n ≥ 1. Then the simplex Π_n, Birkhoff polytope Ω_n, and Latin square polytope Λ_n each yield projective geometries obtained by identifying antipodal points on a sphere bounding a ball centered at the barycenter of the polytope. We investigate conditions for homogeneous coordinates of points in the projective geometries to locate exact vertices of the respective polytopes, namely crisp distributions, permutation matrices, and quasigroups or Latin squares respectively. In the latter case, the homogeneous conditions form a crucial part of a recent projective-geometrical approach to the study of orthogonality of Latin squares. Coordinates based on the barycenter of Ω_n are also suited to the analysis of generalized doubly stochastic matrices, observing that orthogonal matrices of this type form a subgroup of the orthogonal group.

• 대한전자공학회논문지TC
• /
• 제48권8호
• /
• pp.7-14
• /
• 2011

본 논문에서는 선형 분산 시공간 블록 부호(STBC)의 부분간섭 제거(PIC) 그룹 복호와 인터리브 준직교 시공간 블록 부호인 TBH와 Jafakhani의 $8{\times}8$ 행렬을 위한 부분 간섭 제거 그룹 복호를 제안한다. 수신기에서 사용하여 최대 다이버시티를 달성할 수 있는 부분간섭제거 그룹 복호는 시공간 블록 부호(STBC)에 포함된 심벌을 몇몇의 그룹으로 나누고, 선형 부분 간섭 제거가 이루어진 후에 개별적으로 각 그룹에 대한 복호를 진행한다. 이는 단일 그룹에 포함된 모든 심벌을 한꺼번에 복호하는 최대 우도(ML) 복호와 제로포싱(ZF) 후에 독립적인 하나의 심벌을 갖는 각 그룹에 대해 개별적으로 복호를 하는 제로포싱(ZF) 복호의 중간형태로 볼 수 있다. 부분 간섭 그룹 복호는 그룹의 심벌의 수를 선택함으로써 복잡도와 성능 간의 타협점(tradeoff)을 조절할 수 있는 프레임워크(framework)를 제공한다. 본 논문에서 제안한 부분 간섭 제거 그룹 복호를 통하여 복잡도를 상당히 감소시킬 수 있음을 확인할 수 있었다.

• 대한수학회지
• /
• 제37권5호
• /
• pp.763-777
• /
• 2000

We investigate the existence of group invariant solutions of the Emden-Fowler equation, - u=$\mid$x$\mid$$\sigma$$\mid$u$\mid$p-1u in B, u=0 on B and u(gx)=u(x) in B for g G. Here B is the unit ball in n 2, 1$\sigma$ 0 and G is a closed subgrop of the orthogonal group. A soultion of the problem is called a G in variant solution. We prove that there exists a G invariant non-radial solution if and only if G is not transitive on the unit sphere.

• ETRI Journal
• /
• 제32권1호
• /
• pp.44-52
• /
• 2010

Ultra-wideband (UWB) systems have witnessed a debate over whether they may cause interference to other existing and future narrowband systems sharing their band of operation. The detect and avoid (DAA) mechanism was developed as a solution to reduce interference to narrowband systems in order to ease regulatory concerns. It works by adaptively reducing the transmitted power at the overlapping bands upon detecting an active narrowband link. However, employing DAA degrades the performance of UWB transmissions. In this paper, we present the Korean UWB regulations as an example of regulations that require DAA in certain bands. We investigate DAA's impact on performance and propose a method to mitigate it, which provides UWB with the more efficient support of the DAA mechanism and enables it to avoid a larger number of narrowband users while sustaining the data rate. Results show significant improvement in performance with the application of our technique compared to conventional performance.

• ETRI Journal
• /
• 제29권3호
• /
• pp.402-404
• /
• 2007

One of the major disadvantages of the orthogonal frequency division multiplexing system is high peak-to-average power ratio (PAPR). Selected mapping (SLM) is an efficient distortionless PAPR reduction scheme which selects the minimum PAPR sequence from a group of independent phase rotated sequences. However, the SLM requires explicit side information and a large number of IFFT operations. In this letter we investigate a novel PAPR reduction method based on the radial basis function network and SLM.