• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.4
• /
• pp.239-247
• /
• 2008

Let $I{\in}C^{1,1}$ be a strongly indefinite functional defined on a Hilbert space H. We investigate the number of the critical points of I when I satisfies two pairs of Torus-Sphere variational linking inequalities and when I satisfies m ($m{\geq}2$) pairs of Torus-Sphere variational linking inequalities. We show that I has at least four critical points when I satisfies two pairs of Torus-Sphere variational linking inequality with $(P.S.)^*_c$ condition. Moreover we show that I has at least 2m critical points when I satisfies m ($m{\geq}2$) pairs of Torus-Sphere variational linking inequalities with $(P.S.)^*_c$ condition. We prove these results by Theorem 2.2 (Theorem 1.1 in [1]) and the critical point theory on the manifold with boundary.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1492-1511
• /
• 2013

A novel, chaotic map that is based on concatenated torus automorphisms is proposed in this paper. As we know, cat map, which is based on torus automorphism, is highly chaotic and is often used to encrypt information. But cat map is periodic, which decreases the security of the cryptosystem. In this paper, we propose a novel chaotic map that concatenates several torus automorphisms. The concatenated mechanism provides stronger chaos and larger key space for the cryptosystem. It is proven that the period of the concatenated torus automorphisms is the total sum of each one's period. By this means, the period of the novel automorphism is increased extremely. Based on the novel, concatenated torus automorphisms, two application schemes in image encryption are proposed, i.e., 2D and 3D concatenated chaotic maps. In these schemes, both the scrambling matrices and the iteration numbers act as secret keys. Security analysis shows that the proposed, concatenated, chaotic maps have strong chaos and they are very sensitive to the secret keys. By means of concatenating several torus automorphisms, the key space of the proposed cryptosystem can be expanded to $2^{135}$. The diffusion function in the proposed scheme changes the gray values of the transferred pixels, which makes the periodicity of the concatenated torus automorphisms disappeared. Therefore, the proposed cryptosystem has high security and they can resist the brute-force attacks and the differential attacks efficiently. The diffusing speed of the proposed scheme is higher, and the computational complexity is lower, compared with the existing methods.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.93-103
• /
• 2019

We introduce a geometric processing method for freeform surfaces based on high-precision torus patch approximation, a new spatial data structure for efficient geometric operations on freeform surfaces. A torus patch fits the freeform surface with flexibility: it can handle not only positive and negative curvature but also a zero curvature. It is possible to precisely approximate the surface regardless of the convexity/concavity of the surface. Unlike the traditional method, a torus patch easily bounds the surface normal, and the offset of the torus becomes a torus again, thus helps the acceleration of various geometric operations. We have shown that the torus patch's approximation accuracy of the freeform surface is high by measuring the upper bound of the two-sided Hausdorff distance between the freeform surface and set of torus patches. Using the method, it can be easily processed to detect an intersection curve between two freeform surfaces and find the offset surface of the freeform surface.

• Tribology and Lubricants
• /
• v.18 no.4
• /
• pp.249-254
• /
• 2002

Adhesive contact characteristics of torus-shaped bumps were analyzed using the finite element technique considering the adhesive force. Analyses focused on the effect of rim and bump radii on the adhesive contact behavior such as the jump-to-contact behavior, adhesion hysteresis, pull-off forces, contact region and pressure, and surface and subsurface stresses. Analysis results in the absence of adhesive force were also included to examine the effect of adhesive force. The applicability of torus-shaped bumps to the MEMS structure for reduction of friction is discussed.

• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.73-88
• /
• 2004

A punctured torus $\Sigma(1,1)$ is a building block of oriented surfaces. The goal of this paper is to formulate the matrix presentations of elements of the Teichmuller space of a punctured torus. Let $\cal{C}$ be a matrix presentation of the boundary component of $\Sigma(1,1)$.In the level of the matrix group $\mathbb{SL}$($\mathbb2,R$) we shall show that the trace of $\cal{C}$ is always negative.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.1-30
• /
• 2020

In this paper, we classify all twisted torus knots which are middle/hyper doubly Seifert. By the definition of middle/hyper doubly Seifert knots, these knots admit Dehn surgery yielding either Seifert-fibered spaces or graph manifolds at a surface slope. We show that middle/hyper doubly Seifert twisted torus knots admit the latter, that is, non-Seifert-fibered graph manifolds whose decomposing pieces consist of two Seifert-fibered spaces over the disk with two exceptional fibers.

• The Pure and Applied Mathematics
• /
• v.17 no.4
• /
• pp.275-288
• /
• 2010

A one-holed torus ${\Sigma}$(l, 1) is a building block of oriented surfaces. In this paper we formulate the matrix presentations of the holonomy group of a one-holed torus ${\Sigma}$(1, 1) by the gluing method. And we present an algorithm for deciding the discreteness of the holonomy group of ${\Sigma}$(1, 1).

• East Asian mathematical journal
• /
• v.16 no.1
• /
• pp.61-69
• /
• 2000

We show that the intersection of two standard torus knots of type (${\lambda}_1$, ${\lambda}_2$) and (${\beta}_1$, ${\beta}_2$) induces an automorphism of the cyclic group ${\mathbb{Z}}_d$, where d is the intersection number of the two torus knots and give an elementary proof of the fact that all non-trivial torus knots are strongly invertiable knots. We also show that the intersection of two standard knots on the 3-torus $S^1{\times}S^1{\times}S^1$ induces an isomorphism of cyclic groups.

• Journal of the Korea Furniture Society
• /
• v.17 no.3
• /
• pp.23-28
• /
• 2006

An experiment was conducted to investigate the pit structure of four kind of pine wood species grown in Korea. Torus diameter, margo width, margo lattice size, diameter of pit aperture and pit border width were taken under consideration for explaining the pit structure difference among Pinus densiflora, Pinus rigida, Pinus koraiensis and Larix kaempferi. Torus diameter was found highest in Pinus rigida and the lowest in Pinus densiflora. Margo lattice size varied with torus diameter. Wider torus lowered the margo lattice size. Highest margo width was found in Pinus rigida while the lowest one was found in Pinus koraiensis. Pit aperture diameter was found highest in Pinus densiflora and lowest in Pinus koraiensis. In Pinus rigida, pit border was found the highest and the lowest was found in Larix kaempferi. Pit aperture diameter and pit border were increased gradually from pith to bark while there was a decreasing trend in the margo lattice size measuring from the pith to bark.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.