• ETRI Journal
• /
• v.29 no.3
• /
• pp.405-407
• /
• 2007

A globally adaptive load-balanced routing algorithm for torus interconnection networks is proposed. Unlike previously published algorithms, this algorithm employs a new scheme based on collision detection to handle deadlock, and has higher routing adaptability than previous algorithms. Simulation results show that our algorithm outperforms previous algorithms by 16% on benign traffic patterns, and by 10% to 21% on adversarial traffic patterns.

• Journal of the Chungcheong Mathematical Society
• /
• v.10 no.1
• /
• pp.127-139
• /
• 1997

The spherical non-commutative $\mathbb{S}_{\omega}$ were defined in [2,3]. Assume that no non-trivial matrix algebra can be factored out of the $\mathbb{S}_{\omega}$, and that the fibres are isomorphic to the tensor product of a completely irrational non-commutative torus with a matrix algebra $M_k(\mathbb{C})$. It is shown that the tensor product of the spherical non-commutative torus $\mathbb{S}_{\omega}$ with the even Cuntz algebra $\mathcal{O}_{2d}$ has a trivial bundle structure if and only if k and 2d - 1 are relatively prime, and that the tensor product of the spherical non-commutative torus $S_{\omega}$ with the generalized Cuntz algebra $\mathcal{O}_{\infty}$ has a non-trivial bundle structure when k > 1.

• Journal of computational fluids engineering
• /
• v.11 no.3 s.34
• /
• pp.52-58
• /
• 2006

A numerical investigation is made of air flow in a spinner equipment used for cleanning and drying flat display panels. A unique feature of the spinner under question is the placement of a torus plate cover over the rotating plate. The turbulent flow is driven by rotation of a large disk and suction by the exhaust system connected to vacuum chamber. The flow is modelled as an axisymmetric two-dimensional flow and computation is conducted by using the FLUENT package with a version of k-$\varepsilon$ turbulence model. The required capacity of the exhaust system is assessed numerically. The usefulness of the cover in controlling air flow circulation is examined. A computational trouble shooting is attempted to resolve the problem of panel rising which occurred in real experiment.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.15-24
• /
• 1992

The purpose of this paper is to parameterize range-equivalence classes of all eigenmaps of flat 3-tori $T^{3}$= $R^{3}$.LAMBDA., .LAMBDA.= $c_{1}$ $e_{1}$ + $c_{2}$ $e_{2}$ + $c_{3}$ $e_{3}$, into the standard unit spheres. In this paper, we classify $A_{ 0 \lambda}$( $T^{3}$)(cf..cint.1) which is contained in $A_{\lambda}$( $T^{3}$), are belonging to $A_{ 0 \lambda}$( $T^{3}$). Moreover, as an application, we show that the only minimally imbedded flat torus into ( $S^{5}$ , can) which is contained in $A_{ 0 \lambda}$( $T^{3}$) is the generalized Clifford torus.rd torus.

• Journal of the Chungcheong Mathematical Society
• /
• v.11 no.1
• /
• pp.151-161
• /
• 1998

The odd spherical non-commutative tori $\mathbb{S}_{\omega}$ were defined in [2]. Assume that no non-trivial matrix algebra can be factored out of $\mathbb{S}_{\omega}$, and that the fibres are isomorphic to the tensor product of a completely irrational non-commutative torus with a matrix algebra $M_{km}(\mathbb{C})$. It is shown that the tensor product of $\mathbb{S}_{\omega}$ with the even Cuntz algebra $\mathcal{O}_{2d}$ has the trivial bundle structure if and, only if km and 2d - 1 are relatively prime, and that the tensor product of $\mathbb{S}_{\omega}$ with the generalized Cuntz algebra $\mathcal{O}_{\infty}$ has a non-trivial bundle structure when km > 1.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.336-346
• /
• 2000

This paper presents a geometric method that can detect and compute all conic sections in the intersection of two tori. Conic sections contained in a torus must be circles. Thus, when two tori intersect in a conic section, the intersection curve must be a circle as well. Circles in a torus are classified into profile circles, cross-sectional circlet, and Yvone-Villarceau circles. Based on a geometric classification of these circles, we present a procedural method that can detect and construct all intersection circles between two tori. All computations can be carried out using simple geometric operations only: e.g., circle-circle intersections, circle-line intersections, vector additions, and inner products. Consequently, this simple structure makes our algorithm robust and efficient, which is an important advantage of our geometric approach over other conventional methods of surface intersection.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.211-213
• /
• 2006

현재 개발되어 사용되고 있는 원격의료시스템은 3계층기반의 구조를 이루고 있는데 환자들이 집중적으로 몰리는 지역에서 심각한 bottleneck현상이 발생할 수 있다. 본 논문에서는 3계층기반 원격의료시스템의 성능을 분석하고 bottleneck 현상을 해결하기 위한 방안으로 hyper-torus 구조의 4계층 아키텍처를 제안하고 Architecture Description Language인 Acme를 이용하여 성능을 비교분석 한다.

• Journal of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.407-442
• /
• 2007

The study of Euclidean submanifolds with finite type "classical" Gauss map was initiated by B.-Y. Chen and P. Piccinni in [11]. On the other hand, it was believed that for spherical sub manifolds the concept of spherical Gauss map is more relevant than the classical one (see [20]). Thus the purpose of this article is to initiate the study of spherical submanifolds with finite type spherical Gauss map. We obtain several fundamental results in this respect. In particular, spherical submanifolds with 1-type spherical Gauss map are classified. From which we conclude that all isoparametric hypersurfaces of $S^{n+1}$ have 1-type spherical Gauss map. Among others, we also prove that Veronese surface and equilateral minimal torus are the only minimal spherical surfaces with 2-type spherical Gauss map.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1183-1193
• /
• 2010

The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.2
• /
• pp.157-161
• /
• 2007

We show that there is an equivariant symplectic embedding of a two-torus with a nontrivial action into a symplectic manifold with a symplectic circle action if and only if the circle action on the manifold is non-Hamiltonian. This is a new equivalent condition for non-Hamiltonian action and gives us a new insight to solve the famous conjecture by Frankel and McDuff.