• Korean Journal of Mathematics
• /
• v.24 no.4
• /
• pp.613-626
• /
• 2016

In this article, we study skew ruled surfaces by using the geodesic Frenet trihedron of its generator. We obtained some conditions on this surface to ensure that this ruled surface is flat, II-flat, minimal, II-minimal and Weingarten surface. Moreover, the parametric equations of asymptotic and geodesic lines on this ruled surface are determined and illustrated through example using the program of mathematica.

• Journal of the Korean Data and Information Science Society
• /
• v.3 no.1
• /
• pp.47-63
• /
• 1992

Bechhofer and Tamhane(1981) proposed Balanced Treatment Incomplete Block (BTIB) desings for comparing p test treatments with a control treatment in blocks of size ${\kappa}$. Notz and Tamhane(1983) solved the problem about determination of the minimal complete class for ${\kappa}=3$. However there are a number of design parameters for which BTIB designs do not exist. We suggest a new class of designs called Group Divisible Treatment Desings(GDTD's) that is a larger class including BTIB designs as a subclass. In this paper we give the minimal complete classes of generator designs for GDTD's with ${\kappa}=2,\;p{\geq}4(except\;prime\;number)\;and\;{\kappa}=3,\;p=4(2)6$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.156-163
• /
• 2013

The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.393-402
• /
• 1998

In this paper we describe the results of computations to find symmetric presentations based on minimal conjugate generating pairs for the 32 non-abelian simple groups of order less than one million.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 1996.11a
• /
• pp.79-87
• /
• 1996

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.5
• /
• pp.1-8
• /
• 2011

This paper proposes a new input pattern generator for minimal leakage power in the nanometer CMOS technology considering all the leakage current components (sub-threshold leakage, gate tunneling leakage, band-to-band tunneling leakage). Using the accurate macro-model, a heuristic algorithm is developed to generate a input pattern for the minimum leakage. The algorithm applies to ISCAS85 benchmark circuits, and the results are compared with the results of Hspice. The simulation result shows that our method's accuracy is within a 5% difference of the Hspice simulation results. In addition, the simulation time of our method is far faster than that of the Hspice simulation.

• The Journal of Korean Association of Computer Education
• /
• v.21 no.6
• /
• pp.39-47
• /
• 2018

This paper dealt with investigating the number of minimal spanning ladders originated from ladder game and their properties as well as the related computational thinking aspects. The author modified the filtering techniques to enhance Mathematica project where a new type of graph was generated based on the algorithm using a generator of firstly found minimal spanning graph by repeatedly applying independent ladder operator to a subsequence of ladder sequence. The newly produced YC graphs had recursive and hierarchical graph structures and showed the properties of edge-symmetric. As the computational complexity increased the author divided the whole search space into the each floor of the newly generated minimal spanning graphs for the (5, 10) YC graph and the higher (6, 15) YC graph. It turned out that the computational thinking capabilities such as data visualization, abstraction, and parallel computing with Mathematica contributed to enumerating the new YC graphs in order to investigate their structures and properties.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 1998.11a
• /
• pp.80-85
• /
• 1998

본 연구는 기존 발전기에서 회전자 역회전력을 극소화 하며 발전기의 필요한 기계적에너지를 최소화한 발전기 연구이다.

• East Asian mathematical journal
• /
• v.38 no.3
• /
• pp.347-355
• /
• 2022

For a nondegenerate projective variety, it is a classical problem to study its defining equations with respect to a given embedding. In this paper, we precisely determine minimal sets of generators of the defining ideals of some curves of maximal regularity in ℙ⁵.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.2065-2079
• /
• 2017

This paper is devoted to the minimal and maximal bounded solutions for general time interval quadratic backward stochastic differential equations with stochastic conditions. A general existence result is established by the method of convolution, the exponential transform, Girsanov's transform and a priori estimates, where the terminal time is allowed to be finite or infinite, and the generator g is allowed to have a stochastic semi-linear growth and a general growth in y, and a quadratic growth in z. This improves some existing results at some extent. Some new ideas and techniques are also applied to prove it.