• Communications for Statistical Applications and Methods
• /
• v.8 no.2
• /
• pp.557-564
• /
• 2001

The objective of he study is to record the real conditions along with the soccer ball that is, each player's ball keeping time, the number football keeping, accuracy of passing to other player, direction, etc., on a real-time basis, measure them in numbers and get necessary analyzed output as much as one needs. The study consists of the following stages: (1) Record the data by drawing through Visual Interface on a real-time basis; (2) Graphic windows to display the recorded data item by item in graphic; (3) Form windows to display the individual or team scores anytime when needed; (4) Windows to display the analyzed data in visualized form. The effect of the study is threefold: (1) It inputs all the game-related data on a real-time basis, which was impossible before and shows analyzed contents during the game enabling each tea manager o use; (2) In cse of TV broadcasting or newspaper articles, it explains objectively the situations of he game to the TV viewers or readers; (3) After the game, it provides importance information on each team's playing ability and individual player's technical improvement through data analysis.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.2
• /
• pp.171-188
• /
• 2015

In this paper, the efficient column-wise/row-wise lattice reduction (LR) updating and downdating methods are developed and their complexities are analyzed. The well-known LLL algorithm, developed by Lenstra, Lenstra, and Lov${\acute{a}}$sz, is considered as a LR method. When the column or the row is appended/deleted in the given lattice basis matrix H, the proposed updating and downdating methods modify the preconditioning matrix that is primarily computed for the LR with H and provide the initial parameters to reduce the updated lattice basis matrix efficiently. Since the modified preconditioning matrix keeps the information of the original reduced lattice bases, the redundant computational complexities can be eliminated when reducing the lattice by using the proposed methods. In addition, the rounding error analysis of the proposed methods is studied. The numerical results demonstrate that the proposed methods drastically reduce the computational load without any performance loss in terms of the condition number of the reduced lattice basis matrix.

• Structural Engineering and Mechanics
• /
• v.15 no.5
• /
• pp.535-550
• /
• 2003

In this paper, a boundary-type meshfree method, the boundary radial point interpolation method (BRPIM), is presented for solving boundary value problems of two-dimensional solid mechanics. In the BRPIM, the boundary of a problem domain is represented by a set of properly scattered nodes. A technique is proposed to construct shape functions using radial functions as basis functions. The shape functions so formulated are proven to possess both delta function property and partitions of unity property. Boundary conditions can be easily implemented as in the conventional Boundary Element Method (BEM). The Boundary Integral Equation (BIE) for 2-D elastostatics is discretized using the radial basis point interpolation. Some important parameters on the performance of the BRPIM are investigated thoroughly. Validity and efficiency of the present BRPIM are demonstrated through a number of numerical examples.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.773-776
• /
• 2003

This paper presents new hardware implementation of the ECC(Elliptic Curve Cryptography) algorithm that is improved in speed and stability. We proposed new datapath that changed square's position so that we can reduce required number of cycles for addition operation between two points by more than 30%. We used Massey-Omura parallel multiplier adopted Normal basis for fast scalar multiplications. Also the use of the window non-adjacent form (WNAF) method can reduce addition operation of each other different points. We implemented ECC system with GF($2^{196}$), and this system was designed and verified by VHDL.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.8
• /
• pp.1921-1930
• /
• 1993

In order to evaluate the inlet pressure correctly, the full Navier-Stokes equations are solved numerically for the computational domain which covers the cavity region between pads as well as the bearing film. A nonuiform grid system is adopted to reduce the number of grid points, and the numerical solutions are obtained for a wide range of Reynolds number in laminar regime with various values of the distance between pads. The numerical results show that the inlet pressure is significantly affected by Reynolds number and the distance between pads. An expression for the loss coefficient in terms of Reynolds number and non-dimensional distance between pads is obtained on the basis of the numerical results. It is found that the inlet pressure over the whole range of numerical solutions can be fairly accurately estimated by applying the formula for the loss coefficient to the extended Bernoulli equation.

• Communications for Statistical Applications and Methods
• /
• v.18 no.4
• /
• pp.403-411
• /
• 2011

This paper deals with a group acceptance sampling plan for time truncated tests which are based on the total number of failures from the whole group assuming that the life time of an item follows the Dagum (inverse Burr) distribution. This study is developed when a multiple number of items as a group can be tested simultaneously in a tester. The minimum number of groups required for a given group size and acceptance number is determined such that the producer and consumer risks are satisfied simultaneously at the specified quality level, while the termination time and the number of testers are specified. Comparisons are made between the proposed plan and the existing plan on the basis of size of the groups. Two real examples are provided.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.1
• /
• pp.109-115
• /
• 1991

In automated manufacturing systems, Automated Guided Vehicle(AGV) Systems are increasingly important in material handling and manufacturing operations. A considerably flexible AGV system needs to be operated with maximum effectiveness. This paper develops an algorithm for the determination of the entering point and the number of AGVs required in the Flow Shop Type FMS. We consider an AGV used as a carrier and mobile workstation. For the limited number of AGV, the entering point of an AGV on a simple loop is determined in order to maximize the utilization of AGVs. For the unlimited number of AGVs, the number of AGVs required in the FMS is determined on the basis of the entering point of AGVs. The result by the algorithm may be used as a criterion on the control of material flow and the assignment of AGVs in the FMS. A numerical example is given to illustrate the algorithm.

• Kyungpook Mathematical Journal
• /
• v.59 no.4
• /
• pp.797-820
• /
• 2019

For every tree T, we introduce a topological invariant, called the T-cross-index, for connected graphs. The T-cross-index of a graph is a non-negative integer or infinity according to whether T is a tree basis of the graph or not. It is shown how this cross-index is independent of the other topological invariants of connected graphs, such as the Euler characteristic, the crossing number and the genus.

• Journal of Korean Society for Quality Management
• /
• v.20 no.1
• /
• pp.118-125
• /
• 1992

Studies upto date for estimating the reliability by means of one accarate value contain risks of many erroneous options. The objective of this paper is to presents a fault tree analueis model on the basis of the membership functions of trape Zoidal fuzzy number after imposing an interval of Confidence on the residual possibility theory. The results from the model Show that the value of Stability was reliable.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.2
• /
• pp.35-49
• /
• 1981

This paper is concerned with developing a Multi-period Behavioral Model for the portfolio selection problem. The unique feature of the model is that it treats a number of factors and decision variables considered germane in decision making on an interrelated basis. The formulated problem has the structure of a Chance Constrained programming Model. Then empoloying arguments of Central Limit Theorem and normality assumption the stochastic model is reduced to that of a Non-Linear Programming Model. Finally, a number of interesting properties for the reduced model are established.