• Proceedings of the Safety Management and Science Conference
• /
• 2007.04a
• /
• pp.399-415
• /
• 2007

In spite of the development of the service industry, research on measuring customers' service satisfaction is far insufficient. Therefore, ways to measure the service qualify accurately need to be established due to the ambiguous types of service business. This research classifies the types of service business into service factory, service shop, mass service, professional service by using Schmenner's Service Process Matrix and conducts research on domestic literature that measured service satisfaction with Servqual and ServPerf. This study intends to suggest guidelines to measure customer satisfaction according to types of service business by researching ways to measure service satisfaction according to the types of service business and analysing the actual application methods based on a table that summarizes previous research on Servqual and Servperf.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.2
• /
• pp.194-202
• /
• 1998

This paper describes a hardware implementation method of a Petri Net-based controller. A flexible and systematic implementation method, based on look-up tables, is suggested, which enables to build high speed Petri net-based controllers. The suggested method overcomes the inherent speed limit that arises from the microprocessors by using of matrix-based look-up tables. Based on the matrix framework, this paper suggests various specific data path structures as well as a basic data path structure, accompanied by evolution algorithms, for sub-class Petri nets. A new sub-class Petri net, named Biarced Petri Net, resolves memory explosion problem that usually comes with matrix-based look-up tables. The suggested matrix-based method based on the Biarced Petri net has as good efficiency and expendability as the list-based methods. This paper shows the usefulness of the suggested method, evaluating the size of the look-up tables and introducing an architecture of the signal processing unit of a programmable controller. The suggested implementation method is supported by an automatic design support program.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.286-290
• /
• 2005

We consider the poisson equation where the functions involved are periodic including the solution function. Let $R=[0,1]{\times}[0,l]{\times}[0,1]$ be the region of interest and let $\phi$(x,y,z) be an arbitrary periodic function defined in the region R such that $\phi$(x,y,z) satisfies $\phi$(x+1, y, z)=$\phi$(x, y+1, z)=$\phi$(x, y, z+1)=$\phi$(x,y,z) for all x,y,z. We describe a very simple method for solving the equation ${\nabla}^2u(x, y, z)$ = $\phi$(x, y, z) based on the cubic spline interpolation of u(x, y, z); using the requirement that each interval [0,1] is a multiple of the period in the corresponding coordinates, the Laplacian operator applied to the cubic spline interpolation of u(x, y, z) can be replaced by a square matrix. The solution can then be computed simply by multiplying $\phi$(x, y, z) by the inverse of this matrix. A description on how the storage of nearly a Giga byte for $20{\times}20{\times}20$ nodes, equivalent to a $8000{\times}8000$ matrix is handled by using the fuzzy rule table method and a description on how the shape preserving property of the Laplacian operator will be affected by this approximation are included.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.88-94
• /
• 2009

We propose a scheme which reduce the computational complexity of the lattice reduction (LR) aided detector in MIMO system. The performance of the ML detection algorithm is good but the computational complexity grows exponentially with the number of antenna elements and constellation points. LR aided detector shows the same diversity with the ML scheme with relatively less complexity. But the LR scheme still requires many computations since it involves several iterations of size reduction and column vector exchange. We notice that the LR process depends not on the received signal but only on the channel matrix so we can apply LR process offline and store the results in Look-Up Table (LUT). In this paper we propose an algorithm to generate the LUT which require less memory requirement and we evaluate the performance and complexity of the proposed system. We show that the proposed system requires less computational complexity with similar detection performance compared with the conventional LR aided detector.

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

This paper presents a very unique and analytic method for scheduling messages routed through a non-blocking switch. The laxities of schedulable messages are decomposed and the laxity table is rearranged so that the packets to be scheduled in the next time instance are placed in the diagonal of the traffic matrix. And the modified MLF-SDR algorithm is performed on the table. We present some examples and simulation results which show that the success rate is very high, even when the size of which is large.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1556-1559
• /
• 1987

In this paper, a new state assignment method is proposed for the implementation of the area-effective control part. Introducing the, concept of adjacency matrix to control table generated by SDL(Symbolic Description Language) hardware compiler, a state assignment method is proposed with which minimal number of flip flops and effective number of product terms can be obtained to accomplish the area-effective implementation. Also, with substituting the assigned code to state transition table, boolean equations are obtained through 2-level logic minimization. Proposed algorithm is programmed in C-language on VAX-750/UNIX and b efficiency is shown by the practical example.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.875-886
• /
• 2000

Let G denote either of the groups $GL_2(q)$ or $SL_2(q)$. Then ${\theta}$:G -> G given by ${\theta}(A)$ = ${(A^t)}^{-l}$, where $A^t$ denotes the transpose of the matrix A, is an automorphism of G. Therefore we may form the group G.$<{\theta}>$ which is the split extension of the group G by the cyclic group $<{\theta}>$ of order 2. Our aim in this paper is to find the complex irreducible character table of G.$<{\theta}>$.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.94-100
• /
• 1999

This paper concerns the implementation of a digital neural network which performs the high speed operation of Hopfield model's arithmetic operation. It is also designed to use a look-up table and produce floating point arithmetic of nonlinear function with high speed operation. The arithmetic processing of Hopfleld is able to describe the matrix-vector operation, which is adaptable to design the array processor because of its recursive and iterative operation .The proposed method is expected to be applied to the field of real neural networks because of the realization of the current VLSI techniques.

• Communications for Statistical Applications and Methods
• /
• v.28 no.3
• /
• pp.295-305
• /
• 2021

Most graphical representation methods for two-dimensional contingency tables are based on the frequencies, probabilities, association measures, and goodness-of-fit statistics. In this work, a method is proposed to represent the correlation coefficients for each of the two selected levels of the row and column variables. Using the correlation coefficients, one can obtain the vector-matrix that represents the angle corresponding to each cell. Thus, these vectors are represented as a unit circle with angles. This is called a CC plot, which is a correlation plot for a contingency table. When the CC plot is used with other graphical methods as well as statistical models, more advanced analyses including the relationship among the cells of the row or column variables could be derived.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.10-23
• /
• 2009

The fundamental matrix and key frame selection are one of the most important techniques to recover full 3D reconstruction of objects from turntable sequences. This paper proposes a new algorithm that estimates a robust fundamental matrix for camera calibration from uncalibrated images taken under turn-table motion. Single axis turntable motion can be described in terms of its fixed entities. This provides new algorithms for computing the fundamental matrix. From the projective properties of the conics and fundamental matrix the Euclidean 3D coordinates of a point are obtained from geometric locus of the image points trajectories. Experimental results on real and virtual image sequences demonstrate good object reconstructions.