• Journal of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.479-487
• /
• 2004

Let G be a finite group and N be a normal subgroup of G. We denote by ncc(N) the number of conjugacy classes of N in G and N is called n-decomposable, if ncc(N) = n. Set $K_{G}\;=\;\{ncc(N)$\mid$N{\lhd}G\}$. Let X be a non-empty subset of positive integers. A group G is called X-decomposable, if KG = X. In this paper we characterise the {1, 3, 4}-decomposable finite non-perfect groups. We prove that such a group is isomorphic to Small Group (36, 9), the $9^{th}$ group of order 36 in the small group library of GAP, a metabelian group of order $2^n{2{\frac{n-1}{2}}\;-\;1)$, in which n is odd positive integer and $2{\frac{n-1}{2}}\;-\;1$ is a Mersenne prime or a metabelian group of order $2^n(2{\frac{n}{3}}\;-\;1)$, where 3$\mid$n and $2\frac{n}{3}\;-\;1$ is a Mersenne prime. Moreover, we calculate the set $K_{G}$, for some finite group G.

• Smart Media Journal
• /
• v.7 no.2
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• ETRI Journal
• /
• v.22 no.3
• /
• pp.10-18
• /
• 2000

Although an n-th order cross-entropy (nCE) error function resolves the incorrect saturation problem of conventional error backpropagation (EBP) algorithm, performance of multilayer perceptrons (MLPs) trained using the nCE function depends heavily on the order of nCE. In this paper, we propose an adaptive learning rate to markedly reduce the sensitivity of MLP performance to the order of nCE. Additionally, we propose to limit error signal values at out-put nodes for stable learning with the adaptive learning rate. Through simulations of handwritten digit recognition and isolated-word recognition tasks, it was verified that the proposed method successfully reduced the performance dependency of MLPs on the nCE order while maintaining advantages of the nCE function.

• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.695-708
• /
• 2011

Based on the multiple-time-scale (MTS) method, a general formula has been presented for solving an n-th, n = 2, 3, ${\ldots}$, order ordinary differential equation with strong linear damping forces. Like the solution of the unified Krylov-Bogoliubov-Mitropolskii (KBM) method or the general Struble's method, the new solution covers the un-damped, under-damped and over-damped cases. The solutions are identical to those obtained by the unified KBM method and the general Struble's method. The technique is a new form of the classical MTS method. The formulation as well as the determination of the solution from the derived formula is very simple. The method is illustrated by several examples. The general MTS solution reduces to its classical form when the real parts of eigen-values of the unperturbed equation vanish.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.535-540
• /
• 2002

Let X$_1$, X$_2$‥‥,X$\_$n/ be n independent and identically distributed random variables with continuous cumulative distribution function F(x). Let us rearrange the X's in the increasing order X$\_$1:n/ $\leq$ X$\_$2:n/ $\leq$ ‥‥ $\leq$ X$\_$n:n/. We call X$\_$k:n/ the k-th order statistic. Then X$\_$n:n/ - X$\_$n-1:n/ and X$\_$n-1:n/ are independent if and only if f(x) = 1-e(equation omitted) with some c > 0. And X$\_$j/ is an upper record value of this sequence lf X$\_$j/ > max(X$_1$, X$_2$,¨¨ ,X$\_$j-1/). We define u(n) = min(j|j > u(n-1),X$\_$j/ > X$\_$u(n-1)/, n $\geq$ 2) with u(1) = 1. Then F(x) = 1 - e(equation omitted), x > 0 if and only if E[X$\_$u(n+3)/ - X$\_$u(n)/ | X$\_$u(m)/ = y] = 3c, or E[X$\_$u(n+4)/ - X$\_$u(n)/|X$\_$u(m)/ = y] = 4c, n m+1.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.2
• /
• pp.80-86
• /
• 2001

We design a sliding mode cascade observer to estimate derivatives of the output. In the 1st step of the observer, the output will be estimated, and the 1st order derivative of the output will be estimated via the 2nd step of the observer. Also, nth order derivative of the output will be estimated in the n+1th step of the observer. Exponential convergence of the estimation errors is shown under the bounded initial condition. Numerical examples will be presented to show the validity of the proposed observer.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.375-382
• /
• 2007

We Study, firstly, the dynamics of the difference equation $x_{n+1}\;=\;{\alpha}\;+\;{\frac{x^p_n}{x^p_{n-1}}}$, with $p\;{\in}\;(0,\;1)\;and\;{\alpha}\;{\in}\;[0,\;{\infty})$. Then, we generalize our results to the (k + 1)th order difference equation $x_{n+1}\;=\;{\alpha}\;+\;{\frac{x^p_n}{nx^p_{n-k}}$, $k\;=\;2,\;3,\;{\cdots}$ with positive initial conditions.

• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1083-1090
• /
• 2015

A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the i^th packet traverses along the i^th path. In order for all packets to arrive at the destination node securely, the i^th path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n²) parallel routing algorithm on generalized recursive circulant networks.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.4
• /
• pp.506-510
• /
• 2016

A triple-band (TB) oscillator was implemented in the TSMC $0.18{\mu}m$ 1P6M CMOS process, and it uses a cross-coupled nMOS pair and two shunt $4^{th}$ order LC resonators to form a $6^{th}$ order resonator with three resonant frequencies. The oscillator uses the varactors for band switching and frequency tuning. The core current and power consumption of the high (middle, low)- band core oscillator are 3.59(3.42, 3.4) mA and 2.4(2.29, 2.28) mW, respectively at the dc drain-source bias of 0.67V. The oscillator can generate differential signals in the frequency range of 8.04-8.68 GHz, 5.82-6.15 GHz, and 3.68-4.08 GHz. The die area of the triple-band oscillator is $0.835{\times}1.103mm^2$.

• Communications of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.805-810
• /
• 2017

Let $C_n$ be the cycle graph of order n on the vertices $v_0,v_1,{\ldots},v_n$ and $C^k_n$ be the k-th power of $C_n$. In this article we determine the hull-number of $C^k_n$.