• Journal of the Korean Magnetics Society
• /
• v.5 no.5
• /
• pp.837-840
• /
• 1995

Finite element analysis using two dimensional magnetic permeabillity tensor that can represents phase lag between magnetic field intensity and flux density under rotational flux is examined. Considered problem is confined to two dimensional magnetostatic case. And we applied proposed method to calculate the core loss of the test model and compare the result with that of experiment.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.151-155
• /
• 1996

This paper derives the two-dimensional probability distribution and density functions of morphological dilation and erosion of a one-dimensional memoryless source and reports numerical results for a uniform source, thus providing methodology for joint distributions for other morphological operations. The joint density functions expressed in closed forms contain the Dirac delta functions due to the joint discontinuity within the dilation and erosion. They also exhibit symmetry between these two morphological density functions of dilated and/or eroded sources, in the computation of other higher moments thereof, and in multidimensional quantization.

• Restorative Dentistry and Endodontics
• /
• v.41 no.2
• /
• pp.83-90
• /
• 2016

Objectives: This study was evaluated the marginal microleakage of two different adhesive systems before and after aging with two different dye penetration techniques. Materials and Methods: Class V cavities were prepared on the buccal and lingual surfaces of 48 human molars. Clearfil SE Bond and Single Bond (self-etching and etchand-rinse systems, respectively) were applied, each to half of the prepared cavities, which were restored with composite resin. Half of the specimens in each group underwent 10,000 cycles of thermocycling. Microleakage was evaluated using two dimensional (2D) and three dimensional (3D) dye penetration techniques separately for each half of each specimen. Data were analyzed with SPSS 11.5 (SPSS Inc.), using the Kruskal-Wallis and Mann-Whitney U tests (${\alpha}=0.05$). Results: The difference between the 2D and 3D microleakage evaluation techniques was significant at the occlusal margins of Single bond groups (p = 0.002). The differences between 2D and 3D microleakage evaluation techniques were significant at both the occlusal and cervical margins of Clearfil SE Bond groups (p = 0.017 and p = 0.002, respectively). The difference between the 2D and 3D techniques was significant at the occlusal margins of non-aged groups (p = 0.003). The difference between these two techniques was significant at the occlusal margins of the aged groups (p = 0.001). The Mann-Whitney test showed significant differences between the two techniques only at the occlusal margins in all specimens. Conclusions: Under the limitations of the present study, it can be concluded that the 3D technique has the capacity to detect occlusal microleakage more precisely than the 2D technique.

• Korean Journal of Optics and Photonics
• /
• v.20 no.1
• /
• pp.16-22
• /
• 2009

We propose a method to convert a two-dimensional movie to a three-dimensional movie using normalized cut and optical flow. In this paper, we segment an image of a two-dimensional movie to objects first, and then estimate the depth of each object. Normalized cut is one of the image segmentation algorithms. For improving speed and accuracy of normalized cut, we used a watershed algorithm and a weight function using optical flow. We estimate the depth of objects which are segmented by improved normalized cut using optical flow. Ordinal depth is estimated by the change of the segmented object label in an occluded region which is the difference of absolute values of optical flow. For compensating ordinal depth, we generate the relational depth which is the absolute value of optical flow as motion parallax. A final depth map is determined by multiplying ordinal depth by relational depth, then dividing by average optical flow. In this research, we propose the two-dimensional/three-dimensional movie conversion method which is applicable to all three-dimensional display devices and all two-dimensional movie formats. We present experimental results using sample two-dimensional movies.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1047-1065
• /
• 2022

For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.2
• /
• pp.189-198
• /
• 2004

We consider the problem of whether the three-dimensional checkerboard has the connectivity. For this purpose, we first consider the problem of determining the effective conductivity of a checkerboard-shaped composite material by the Brownian motion simulation method. Specifically, we use the efficient first-passage-time technique. Simulation results show that the effective conductivity of the three-dimensional checkerboard increases faster than the two-dimensional counterpart as the contrast between the phase conductivities increases. This implies that the three-dimensional checkerboard's connectivity is stronger than the two-dimensional checkerboard's and thus each phase material of the three-dimensional checkerboard is more likely to be connected than not to be connected.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.11
• /
• pp.970-975
• /
• 2002

We suggests an effective method to construct time-varying C-obstacles in the 3-dimensional configuration space (C-space) using free arc. The concept of free arc was defined mathematically and the procedure to find free arc in the case off-dimensional C-space was derived in [1]. We showed that time-varying C-obstacles can be constructed efficiently using this concept, and presented simulation results for two SCARA robot manipulators to verify the efficacy of the proposed approach. In this paper, extensions of this approach to the 3-dimensional C-space is introduced since nearly all industrial manipulators are reasonably treated ill the too or three dimensional C-space f3r collision avoidance problem The free arc concept is summarized briefly and the method to find lice arc in the 3-dimensional f-space is explained. To show that this approach enables us to solve a practical collision avoidance problem simulation results f3r two PUMA robot manipulators are presented.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.3
• /
• pp.107-114
• /
• 1985

This paper presents the iterative algorithm for obtaining the ME PSE(Maximum Entropy Power Spectral Estimation) of 2-dimensional signals. This problem involves a correction matching power spectral estimate that can be represented as the reciprocal of the spectral of 2-dimensional signals. This requires two matrix inversion every iterations. Thus, we compensate the matrix to be constantly positive definite with relaxational parameters. Using Row/Column decomposition Discrete Fourier Transform, we can decrease a calculation quantity. Using Lincoln data and white noise, this paper examines ME PSE algorithms. Finally, the results output at the graphic display device. The 2-dimensional data have the 3-dimensional axis components, and, this paper develops 3-dimensional graphic output algorithms using 2-dimensional DGL(Device Independent Graphic Library) which is prepared for HP-1000 F-series computer.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.477-488
• /
• 2012

The convergence rate of a numerical procedure based on Schwarz Alternating Method(SAM) for solving elliptic boundary value problems depends on the selection of the interface conditions applied on the interior boundaries of the overlapping subdomains. It has been observed that the mixed interface condition, controlled by a parameter, can optimize SAM's convergence rate. In [8], one introduced the two-layer multi-parameterized SAM and determined the optimal values of the multi-parameters to produce the best convergence rate for one-dimensional elliptic boundary value problems. In this paper, we present a method which utilizes the one-dimensional result to get the optimal convergence rate for the two-dimensional problem.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.463-475
• /
• 2012

In this work, we investigate solving two-dimensional nonlinear Volterra integral equations of the first kind (2DNVIEF). Here we convert 2DNVIEF to the two-dimensional linear Volterra integral equations of the first kind (2DLVIEF) and then we solve it by using operational approach of the Tau method. But for solving the 2DLVIEF we convert it to an equivalent equation of the second kind and then by giving some theorems we formulate the operational Tau method with standard base for solving the equation of the second kind. Finally, some numerical examples are given to clarify the efficiency and accuracy of presented method.