• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제22권4호
• /
• pp.359-364
• /
• 2015

We present smooth simply connected closed 4k-dimensional manifolds N := N_k, for each k ∈ {2, 3, ⋯}, with distinct symplectic deformation equivalence classes [[ω_i]], i = 1, 2. To distinguish [[ω_i]]’s, we used the symplectic Z invariant in [4] which depends only on the symplectic deformation equivalence class. We have computed that Z(N, [[ω₁]]) = ∞ and Z(N, [[ω₂]]) < 0.

• 음성과학
• /
• 제13권2호
• /
• pp.19-33
• /
• 2006

The purpose of this paper was to examine acoustical characteristics of phonatory offset-onset mechanism in the connected speech of female adults with stuttering and normal nonfluency. The phonatory offset-onset mechanism refers to the laryngeal articulatory gestures. Those gestures are required to mark word boundaries in phonetic contexts of the connected speech. This mechanism included 7 patterns based on the speech spectrogram. This study showed the acoustic features in the connected speech in the production of female adults with stuttering (n=1) and normal nonfluency (n=3). Speech tokens in V_V, V_H, and V_S contexts were selected for the analysis. Speech samples were recorded by Sound Forge, and the spectrographic analysis was conducted using Praat. Results revealed a stuttering (with a type of block) female exhibited more laryngealization gestures in the V_V context. Laryngealization gesture was more characterized by a complete glottal stop or glottal fry both in V_H and in V_S contexts. The results were discussed from theoretical and clinical perspectives.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.859-867
• /
• 2002

In this paper, we get a necessary and sufficient condition for an inner automorphism between compact connected semisimple Lie groups to be an atone transformation, and obtain atone transformations of (SU(n),g) with some left invariant metric g.

• Journal of Power Electronics
• /
• 제14권2호
• /
• pp.292-301
• /
• 2014

This paper presents a new configuration for a three-phase multilevel voltage source inverter. The main bridge is built from a classical three-phase two-level inverter and three bidirectional switches. A variable DC-link employing two unequal DC voltage supplies and four switches is connected to the main circuit in such a way that the proposed inverter produces four levels in the output voltage waveform. In order to obtain the desired switching gate signals, the fundamental frequency staircase modulation technique is successfully implemented. Furthermore, the proposed structure is extended and compared with other types of multilevel inverter topologies. The comparison shows that the proposed inverter requires a smaller number of power components. For a given number of voltage steps N, the proposed inverter requires N/2 DC voltage supplies and N+12 switches connected with N+7 gate driver circuits, while diode clamped or flying capacitor inverters require N-1 DC voltage supplies and 6(N-1) switches connected with 6(N-1) gate driver circuits. A prototype of the introduced configuration has been manufactured and the obtained simulation and experimental results ensure the feasibility of the proposed topology and the validity of the implemented modulation technique.

• 대한수학회지
• /
• 제31권3호
• /
• pp.429-437
• /
• 1994

Let $M^n$ be a connected hypersurface in Euclidean (n + 1)-space $E^{n+1}$, and let $G : G^n \longrightarrow S^n(1) \subset E^{n+1}$ be its Gauss map.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.161-169
• /
• 2002

Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.909-912
• /
• 2010

In this note we present a short proof of the following result by Zhou, Liu and Xu. Let G be a graph of order n, and let a and b be two integers with 1 $\leq$ a < b and b $\geq$ 3, and let g and f be two integer-valued functions defined on V(G) such that a $\leq$ g(x) < f(x) $\leq$ b for each $x\;{\in}\;V(G)$ and f(V(G)) - V(G) even. If $n\;{\geq}\;\frac{(a+b-1)^2+1}{a}$ and $\delta(G)\;{\geq}\;\frac{(b-1)n}{a+b-1}$,then G has a connected (g, f)-factor.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.731-734
• /
• 1998

A scalable parallel algorithm is proposed for efficient image component labeling with local operatos on a mesh connected SIMD computer. In contrast to the conventional parallel labeling algorithms, where a single pixel is assigned to each PE, the algorithm presented here is scalable and can assign m$\times$m pixel set to each PE according to the input image size. The assigned pixel set is converted to a single pixel that has representative value, and the amount of the required memory and processing time can be highly reduced. For N$\times$N image, if m$\times$m pixel set is assigned to each PE of P$\times$P mesh, where P=N/m, the time complexity due to the communication of each PE and the computation complexity are reduced to O(PlogP) bit operations and O(P) bit operations, respectively, which is 1/m of each of the conventional method. This method also diminishes the amount of memory in each PE to O(P), and can decrease the number of PE to O(P2) =Θ(N2/m2) as compared to O(N2) of conventional method. Because the proposed parallel labeling algorithm is scalable, we can adapt to the increase of image size without the hardware change of the given mesh connected SIMD computer.

• 호남수학학술지
• /
• 제44권4호
• /
• pp.521-534
• /
• 2022

In this paper, we introduce a new class 𝓡^k_λ(λ ≥ 1, k is any positive real number) of univalent complex functions, which consists of functions f of the form f(z) = z + Σ^∞_n=2 a_nzⁿ (|z| < 1) satisfying the subordination condition $$(1-{\lambda}){\frac{f(z)}{z}}+{\lambda}f^{\prime}(z){\prec}{\frac{1+r^2_kz^2}{1-k{\tau}_kz-{\tau}^2_kz^2}},\;{\tau}_k={\frac{k-{\sqrt{k^2+4}}}{2}$$, and investigate the Fekete-Szegö problem for the coefficients of f ∈ 𝓡^k_λ which are connected with k-Fibonacci numbers $F_{k,n}={\frac{(k-{\tau}_k)^n-{\tau}^n_k}{\sqrt{k^2+4}}}$ (n ∈ ℕ ∪ {0}). We obtain sharp upper bound for the Fekete-Szegö functional |a₃-𝜇a²₂| when 𝜇 ∈ ℝ. We also generalize our result for 𝜇 ∈ ℂ.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.201-215
• /
• 2003

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. For any connected graph $\Gamma$, by introducing the concertion of semi-arc automorphism group Aut$\_$$\frac{1}{2}$/$\Gamma$ and classifying all embedding of $\Gamma$ undo. the action of this group, the numbers r$\^$O/ ($\Gamma$) and r$\^$N/($\Gamma$) of rooted maps on orientable and non-orientable surfaces with underlying graph $\Gamma$ are found. Many closed formulas without sum ∑ for the number of rooted maps on surfaces (orientable or non-orientable) with given underlying graphs, such as, complete graph K$\_$n/, complete bipartite graph K$\_$m, n/ bouquets B$\_$n/, dipole Dp$\_$n/ and generalized dipole (equation omitted) are refound in this paper.