• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1101-1103
• /
• 2006

For a broad class of discrete-time FIFO queueing systems with D-MAP (discrete-time Markovian arrival process) arrivals, we present a distributional Little's law that relates the distribution of the stationary number of customers in system (queue) with that of the stationary number of slots a customer spends in system (queue). Taking the multi-server D-MAP/D/c queue for example, we illustrate how to utilize this relation to get the desired distribution of the number of customers.

• Communications of the Korean Mathematical Society
• /
• v.15 no.2
• /
• pp.357-370
• /
• 2000

In [6], Cheng-Ye You gave a condition equivalent to the Nielsen number product formula for fiber maps. And Jerzy Jezierski also gave a similar condition for coincidences of fiber maps. The main purpose of this paper is to find the condition for which holds the product formula for Nielsen root numbers N(f;a) = N(f;a) N(fb;a).

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.2029-2032
• /
• 2004

The quantity of data were rapidly increased recently and caused the data overwhelming. This led to be difficult in searching the required data. The method of eliminating redundant data was needed. One of the efficient methods was Knowledge Discovery in Database (KDD). Generally data can be separate into 2 cases, continuous data and discrete data. This paper describes algorithm that transforms continuous attributes into discrete ones. We present an Improved Class Attribute Interdependence Maximization (ICAIM), which designed to work with supervised data, for discretized process. The algorithm does not require user to predefine the number of intervals. ICAIM improved CAIM by using significant test to determine which interval should be merged to one interval. Our goal is to generate a minimal number of discrete intervals and improve accuracy for classified class. We used iris plant dataset (IRIS) to test this algorithm compare with CAIM algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1807-1814
• /
• 1999

This paper considers connectivity-related reliability measures for a class of fault-tolerant shuffle exchange networks to characterize the degrading features over time in the presence of faulty switching elements. The mean number of connected input/output pairs, the mean number of survivable input are considered as connectivity measures. The measures for the unique-path shuffle exchange network(SEN) and its two fault-tolerant variants, extra-stage SEN(SEN+) and INDRA network are derived analytically, and then are compared with numerical experiments.

• Korean Institute of Interior Design Journal
• /
• no.38
• /
• pp.201-208
• /
• 2003

Shipboard architecture and design has now become a specialty In its own right. As rationalized as the process of ship' design and built is, it continues to produce some remarkable fleet image. Cruise line has created a number of the hall mark identities and the interior design features of its own. It is to develop a design theme for a reference ship which sets a particular image for later new buildings to follow in same class. When a new class Is created later, key design element will be retained, with some items being changed and new ideas introduced. Thus the approach has the flexibility to grow and change as the industry itself evolves and diversifies. There are a number of notable examples which illustrate how different line are thus able to create and maintain unique product hallmarks and identities through the interior design of their fleets.

• Structural Engineering and Mechanics
• /
• v.25 no.1
• /
• pp.91-106
• /
• 2007

A new class of finite elements is described for dealing with mesh gradation. The approach employs the moving least square (MLS) scheme to devise a class of elements with an arbitrary number of nodal points on the parental domain. This approach generally leads to elements with rational shape functions, which significantly extends the function space of the conventional finite element method. With a special choice of the nodal points and the base functions, the method results in useful elements with polynomial shape functions for which the $C^1$ continuity breaks down across the boundaries between the subdomains comprising one element. Among those, (4 + n)-noded MLS based finite elements possess the generality to be connected with an arbitrary number of linear elements at a side of a given element. It enables us to connect one finite element with a few finite elements without complex remeshing. The effectiveness of the new elements is demonstrated via appropriate numerical examples.

• Journal of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.479-491
• /
• 2017

We investigate the zeros of Epstein zeta functions associated with positive definite quadratic forms with rational coefficients in the vertical strip ${\sigma}_1$ < ${\Re}s$ < ${\sigma}_2$, where 1/2 < ${\sigma}_1$ < ${\sigma}_2$ < 1. When the class number h of the quadratic form is bigger than 1, Voronin gave a lower bound and Lee gave an asymptotic formula for the number of zeros. Recently Gonek and Lee improved their results by providing a new upper bound for the error term when h > 3. In this paper, we consider the cases h = 2, 3 and provide an upper bound for the error term, smaller than the one for the case h > 3.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.3
• /
• pp.545-551
• /
• 2012

In this paper, we propose a new cryptosystem based on the IQC depended on the complexity of class number and intractibility of factoring integer, and introduce two algorithm which reduce encryption and decryption times. To recognize the security of the cryptosystem, we take a simple example to analyze the complexities of public key and secret key and then introduce the operating process of the cryptosystem.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1670-1673
• /
• 2002

For pattern recognition on high-dimensional data, such as images, the dimensionality reduction as a preprocessing is effective. By dimensionality reduction, we can (1) reduce storage capacity or amount of calculation, and (2) avoid "the curse of dimensionality" and improve classification performance. Popular tools for dimensionality reduction are Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), and Independent Component Analysis (ICA) recently. Among them, only LDA takes the class labels into consideration. Nevertheless, it, has been reported that, the classification performance with ICA is better than that with LDA because LDA has restriction on the number of dimensions after reduction. To overcome this dilemma, we propose a new dimensionality reduction technique based on an information theoretic measure for difference of distribution. It takes the class labels into consideration and still it does not, have restriction on number of dimensions after reduction. Improvement of classification performance has been confirmed experimentally.

• The Mathematical Education
• /
• v.51 no.4
• /
• pp.429-453
• /
• 2012

The purpose of the study were to analyze teaching models of arithmetic operations of integers in Korean middle school mathematics textbooks of the first grade and Americans', from which we compare and analyze standards for choice of models of middle school teachers and preservice mathematics teachers. We also analyze the effect of the choice of teaching models for students to understand and appreciate number systems as a coherent body of knowledge. On the basis of that, we would like to find the best model to help students understand and reason the process of formulate the arithmetic operations of natural numbers and integers into the operation of the real number system. Furthermore, we help these series of the study to be applied effectively in the middle school mathematics class in Korea.