• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.426-431
• /
• 2005

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.35.1-35.1
• /
• 2019

We present a statistical analysis on the spin-orbit alignment of dark matter halo pairs in cosmological simulations. The alignment is defined as the angular concurrence between the halo spin vector (${\vec{S}}$) and the orbital angular momentum vector (${\vec{L}}$) of the major companion. We identify interacting halo pairs with the mass ratios from 1:1 to 1:3, with the halo masses of 10.8 < $Log(M_{halo}/M_{sun}$) < 13.0, and with the separations smaller than a sum of their virial radii ($R_{12}<R_{1,vir}+R_{2,vir}$). Based on the total energy ($E_{12}$), the pairs are classified into flybys ($E_{12}$ > 0) and mergers ($E_{12}{\leq}0$). By measuring the angle (${\theta}_{SL}$) between ${\vec{S}}$ and ${\vec{L}}$, we confirm a strong spin-orbit alignment signal such that the halo spin is preferentially aligned with the orbital angular momentum of the major companion. We find that the signal of the spin-orbit alignment for the flyby is weaker than that for the merger. We also find an unexpected excess signal of the spin-orbit alignment at $cos{\theta}_{SL}{\sim}0.25$. Both the strength of the spin-orbit alignment and the degree of the excess depend only on the environment. We conclude that the halo spin is determined by the accretion in a preferred direction set by the ambient environment.

• Phonetics and Speech Sciences
• /
• v.14 no.2
• /
• pp.11-17
• /
• 2022

English vowels play an important role in verbal communication. However, Korean students tend to experience difficulty pronouncing a certain set of vowels despite extensive education in English. The aim of this study is to apply speech recognition software to evaluate Korean students' pronunciation of English vowels in minimal pair words and then to examine acoustic characteristics of the pairs in order to check their pronunciation problems. Thirty female Korean college students participated in the recording. Speech recognition rates were obtained to examine which English vowels were correctly pronounced. To compare and verify the recognition results, such acoustic analyses as the first and second formant trajectories and durations were also collected using Praat. The results showed an overall recognition rate of 54.7%. Some students incorrectly switched the tense and lax counterparts and produced the same vowel sounds for qualitatively different English vowels. From the acoustic analyses of the vowel formant trajectories, some of these vowel pairs were almost overlapped or exhibited slight acoustic differences at the majority of the measurement points. On the other hand, statistical analyses on the first formant trajectories of the three vowel pairs revealed significant differences throughout the measurement points, a finding that requires further investigation. Durational comparisons revealed a consistent pattern among the vowel pairs. The author concludes that speech recognition and analysis software can be useful to diagnose pronunciation problems of English-language learners.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.5
• /
• pp.325-331
• /
• 2010

Categorical perception has been noted as characteristic properties of linguistic stimuli. In this study, Korean monosyllabic minimal pairs (consonant-vowel-consonant, CVC) were analyzed to understand perception boundaries between clinically confusing words. An efficient scheme has been developed to systematically synthesize temporal transition waveforms (11 steps) from one word to the target word for the pairs of /gom/-/gong/, /non/-/noon/, and /don/-/non/. The corresponding slopes, widths, and non-dominant factors of perception boundaries were analyzed for the total of 40 young normal subjects (20 males and 20 females). Results showed that there were relative pattern differences among confusing monosyllabic minimal pairs under categorical perception. For instance, the vowel difference within CVC pairs led to the lowest boundary performance in this experiment set. Data also indicated the potential application of the overall procedure for evaluating auditory functions and assisting rehabilitation programs.

• Korean Journal of Mathematics
• /
• v.28 no.3
• /
• pp.539-554
• /
• 2020

A set {a₁, a₂, …, a_m} of m distinct positive integers is called a D(-1)-m-tuple if the product of any distinct two elements in the set decreased by one is a perfect square. In this paper, we find a solution of Pellian equations which is constructed by D(-1)-triples and using this result, we prove the extendibility of D(-1)-pair with some conditions.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.34-43
• /
• 2012

Determining the similarity between two strings can be applied various area such as information retrieval, spell checker and spam filtering. Similarity calculation between Korean strings based on dynamic programming methods firstly requires a definition of the similarity between phonemes. However, existing methods have a limitation that they use manually set similarity scores. In this paper, we propose a method to automatically calculate inter-phoneme similarity from a given set of variant words using a PAM-like probabilistic model. Our proposed method first finds the pairs of similar words from a given word set, and derives derivation rules from text alignment results among the similar word pairs. Then, similarity scores are calculated from the frequencies of variations between different phonemes. As an experimental result, we show an improvement of 10.1%~14.1% and 8.1%~11.8% in terms of sensitivity compared with the simple match-mismatch scoring scheme and the manually set inter-phoneme similarity scheme, respectively, with a specificity of 77.2%~80.4%.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.135-139
• /
• 2014

Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2005.10a
• /
• pp.322-325
• /
• 2005

In order to make a doubly-cowed sheet metal effectively, the sheet metal forming process has been developed by adopting the flexibility of the incremental forming process and the principle of bending deformation which causes slight deformation in thickness. The developed process is an unconstrained forming process without holder. The experimental equipment has been set up with the roll set which consists of two pairs of support rolls and one center roll. In order to analyze process parameters in the incremental roll forming process for the application to doubly curved ship hull plate, the orthogonal array is adopted. From the FEM results, among the process parameters, the distance between supporting rolls in pairs along the direction of one principal radius of curvature as well as the forming depth is shown to influence the generation of curvature in the same direction significantly. That is, the other distance between supporting rolls in pairs which are not located in the same direction of one principal radius of curvature, does not have an significant effect on the generation of the curvature in that direction. Also, the forming load and torque from the FEM simulation are acceptable to the system development of the incremental roll forming process for the forming of ship hull plate.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.3
• /
• pp.9-19
• /
• 2011

Computing triangle-triangle intersections has been a fundamental task required for many 3D geometric problems. We propose a novel robust GPU algorithm to efficiently compute intersections in a large triangle set. The algorithm has three stages:k-d tree construction, triangle pair generation, and exact intersection computation. All three stages are executed on GPU except, for unsafe triangle pairs. Unsafe triangle pairs are robustly handled by CLP(controlled linear perturbation) on a CPU thread. They are identified by floating-point filtering while exact intersection is computed on GPU. Many triangles crossing a split plane are duplicated in k-d tree construction, which form a lot of redundant triangle pairs later. To eliminate them efficiently, we use a split index which can determine redundancy of a pair by a simple bitwise operation. We applied the proposed algorithm to computing 3D Minkowski sum boundaries to verify its efficiency and robustness.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.4
• /
• pp.1-11
• /
• 2009

In this paper, we present a prism-based mesh culling method to improve effectiveness of continuous collision detection which is a major bottleneck in a simulation using polygonal mesh models. A prism is defined based on two matching triangles between a sequence of times m a polygonal model. In order to detect potential colliding set(PCS) of prism between two polygonal models in a unit time, we apply the visibility test based on the occlusion query to two sets of prisms which are defined from two polygonal models in a unit time. Moreover, we execute the narrow band culling based on SAT(Separating Axis Test) to define potential colliding prism pairs from PCS of prisms extracted as a result of the visibility test. In the SAT, we examine one axis to be perpendicular to a plane which divides a 3D space into two half spaces to include each prism. In the experiments, we applied the proposed culling method to pairs of polygonal models with the different size and compared the number of potential colliding prism pairs with the number of all possible prism pairs of two polygonal models. We also compared effectiveness and performance of the visibility test-based method with those of the SAT-based method as the second narrow band culling. In an experiment using two models to consist of 2916 and 2731 polygons, respectively, we got potential colliding prism pairs with 99 % of culling rate.