• Journal of the Korean Statistical Society
• /
• v.21 no.2
• /
• pp.201-207
• /
• 1992

The algorithm for obtaining the isotonic regression in simple tree order, the most basic and simplest model next to the simple order, is considered. We propose to call it "Pool-the-Maximum-Violators" algorithm (PMVA) in conjunction with the "Pool-Adjacent-Violators" algorithm (PAVA) in the simple order. The dual problem of obtaining the isotonic regression in simple tree order is our main concern. An intuitively appealing relation between the primal and the dual problems is demonstrated. The interesting difference is that in simple order the required number of pooling is at least the number of initial violating pairs and any path leads to the solution, whereas in the simple tree order it is at most the number of initial violators and there is only one advisable path although there may be some others leading to the same solution.o the same solution.

• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.155-163
• /
• 2021

For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.

• Kyungpook Mathematical Journal
• /
• v.62 no.4
• /
• pp.769-772
• /
• 2022

Given a prime number p and a natural number m not divisible by p, we propose the problem of finding the smallest number r₀ such that for r ≥ r₀, every group G of order p^rm has a non-trivial normal p-subgroup. We prove that we can explicitly calculate the number r₀ in the case where every group of order p^rm is solvable for all r, and we obtain the value of r₀ for a case where m is a product of two primes.

• Journal of Distribution Science
• /
• v.16 no.12
• /
• pp.95-104
• /
• 2018

Purpose - In order to gain the upper hand in competition between container terminals, efforts to improve container terminal productivity continue. Export containers arrive randomly in the container terminal and are carried in the container terminal yard according to the arrival order. On the other hand, containers are carried out of the container terminal yard in order based on container weight, not in order of arrival. Because the carry-in order and the carry-out order are different, rehandling may occur, which reduces the performance of the container terminals. In order to reduce rehandling number, containers can be moved in advance when they arrive, which is called preprocessing. This paper proposes an effective preprocessing algorithm and analyzes the factors that affect the productivity of the container terminals. It also provides a way to choose the best factors for preprocessing for a variety of situations. Research design, data, and methodology - To analyze the impact of factors affecting the performance of preprocessing algorithms presented in this paper, simulations are performed. The simulations are performed for two types of bays, 12 stacks with 8 tiers, and 8 stacks with 6 tiers. Results - The results of the factor analysis that affects the performance of the preprocessing algorithm were as follows. (1) As the LMF increased, preprocessing number increases and rehandling number decreased. (2) The LML effect was greatest when the LML changed from 0 to 1, and that the effect decreased when it changed above 1. (3) The sum of preprocessing number and rehandling number was then shown to be increased after decrease, as the LMF increased. (4) In the case of NCI, a decrease in NCI showed that the containers would become more grouped and thus the performance was improved. (5) There was a positive effect in the case of EFS. Conclusion - In this paper, preprocessing algorithm was proposed and it was possible to choose the best factors for preprocessing for a variety of situations through simulations. Further research related to this study needs to be carried out in the following topic : a study on the improvement of container performance by connecting the preprocessing with remarshalling.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.2E
• /
• pp.26-30
• /
• 1998

In this paper, we compose neural network predictive HMM(NNPHMM) to provide the dynamic feature of the speech pattern for the HMM. The NNPHMM is the hybrid network of neura network and the HMM. The NNPHMM trained to predict the future vector, varies each time. It is used instead of the mean vector in the HMM. In the experiment, we compared the recognition abilities of the one hundred Korean syllables according to the variation of hidden layer, state number and prediction orders of the NNPHMM. The hidden layer of NNPHMM increased from 10 dimensions to 30 dimensions, the state number increased from 4 to 6 and the prediction orders increased from 10 dimensions to 30 dimension, the state number increased from 4 to 6 and the prediction orders increased from the second oder to the fourth order. The NNPHMM in the experiment is composed of multi-layer perceptron with one hidden layer and CMHMM. As a result of the experiment, the case of prediction order is the second, the average recognition rate increased 3.5% when the state number is changed from 4 to 5. The case of prediction order is the third, the recognition rate increased 4.0%, and the case of prediction order is fourth, the recognition rate increased 3.2%. But the recognition rate decreased when the state number is changed from 5 to 6.

• Tribology and Lubricants
• /
• v.20 no.1
• /
• pp.14-20
• /
• 2004

In high-speed gas-levitation applications a high compressibility number may bring a numerical difficulty in predicting generated pressure profiles accurately as it causes erroneous sudden pressure overshoot and oscillation in the trailing-edge. To treat the problem, in this study an exact exponential high-order shape function is introduced in the FE lubrication analyses. It is shown by various example applications that the high-order shape function scheme can successfully subdue undesired pressure overshoot and oscillation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.1
• /
• pp.123-131
• /
• 2014

An INS/vision integrated navigation algorithm is proposed for environments with insufficient number of landmarks. In the proposed algorithm, the raw measurements on the focal plane are directly used in order to cope with the situation where the number of landmarks are not sufficient. In addition to this, the combination of landmarks, which has smallest value of DOP, is used in the update of measurement in order to improve navigation performance. In order to evaluate the performance of the proposed integrated navigation system, Monte-Carlo simulation and van test was performed. The results of the simulation and experiment show that the proposed navigation system gives better navigation performance than an INS/vision integrated navigation system which does not use the raw measurements on the focal plane and the navigation system provides navigation solutions even in environments with insufficient number of landmarks.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• Journal of the Ergonomics Society of Korea
• /
• v.15 no.2
• /
• pp.113-124
• /
• 1996

This study was initiated to suggest the optimal size intervals for mail-order clothing. The questionnaire survey was carried at 360 women and 50 men who purchased apparels by mail-order. The garment sizes providing at the various mail-order companies in Korea were compared. The garment sizes that consumers wanted to purchase were also investigated. The collected data were analyzed and optimal size intervals for mail-order clothing were decided by the loss function. The results are as follow. 1) The optimal size intervals were varied from 4cm to 7cm. The total expected loss of the apparel sizes suggested in this study was less than that of the current mail-order apparel sizes. When the number of sizes for mail-order clothing is increased, the expected loss was reduced considerably. 2) The mail-order clothing is made for consumers with average body size. 30 The number of garment sizes available by mail-order was under three. 4) Subjects tend to select larger size garments, when the right size garments are not available.

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

We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of q-partite graphs of given order, size and number of connected components.