• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2326-2339
• /
• 2011

To reduce the implementation complexity of the Vertical Bell Labs layered space-time (V-BLAST) systems with respect to the zero-forcing (ZF) criterion, a computationally efficient recursive algorithm is proposed. A fast implementation of the proposed algorithm is developed and its complexity is analyzed in detail. The proposed algorithm matches the ZF-OSIC detection well, and its three significant advantages can be demonstrated by analyses and simulations. Firstly, its speedups over the conventional ZF-OSIC with norm-based ordering, the original fast recursive algorithm (FRA) and the fastest known algorithm (FKA) in the number of flops are 1.58, 2.33 and 1.22, respectively. Secondly, a much simpler implementation than FRA and FKA can be expected. Finally, the storage requirements are lower than those of FRA and FKA. These advantages make the proposed algorithm more efficient and practical.

• Journal of Powder Materials
• /
• v.4 no.3
• /
• pp.205-213
• /
• 1997

Mechanical alloying of $Ni_3Al$ and $Y_2O_3$ added ODS $Ni_3Al$ from elemental powders was investigated by the X-ray diffraction, differential scanning calorimeter, transmission electron microscopy and optical microscopy. The steady states of $Ni_3Al$ and ODS $Ni_3Al$ powders were reached after mechanical alloying with the condition of the ball-to-powder input ratio of 20:1 for 20 hours and 10 hours, respectively. The addition of nano-sized $Y_2O_3$ particles enhanced cold working and fracture, and subsequently accelerated MA of $Ni_3Al$ powders. DSC results of MAed $Ni_3Al$ powders showed four exothermic peaks at 14$0^{\circ}C$, 234$^{\circ}C$, 337$^{\circ}C$ and 385$^{\circ}C$. From the high temperature X-ray diffraction analysis, it was concluded that the peaks were resulted from the recovery solution of unalloyed Al in Ni, the formation of intermediate phase NiAl, and $LI_2$ ordering of MAed $Ni_3Al$ powders.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.423-432
• /
• 2014

Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is applied for solving Combined Economic Emission Dispatch (CEED) problem with valve-point loading of thermal generators. This CEED problem with valve-point loading is a nonlinear, constrained multi-objective optimization problem, with power balance and generator capacity constraints. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a nonsmooth optimization problem. To validate its effectiveness of NSGA-II, two benchmark test systems, IEEE 30-bus and IEEE 118-bus systems are considered. To compare the Pareto-front obtained using NSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Comparison with other optimization techniques showed the superiority of the NSGA-II approach and confirmed its potential for solving the CEED problem. Numerical results show that NSGA-II algorithm can provide Pareto-front in a single run with good diversity and convergence. An approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) is applied on non-dominated solutions obtained to determine Best Compromise Solution (BCS).

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.879-891
• /
• 2021

With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.344-350
• /
• 2003

In this paper, we propose a novel sharing method ordering the events occurring between users collaborated with the common telecomputing environment. We realize the sharing method with multimedia data to improve the coworking effect using teleprocessing network. This sharing method advances the efficiency of communicating projects such as remote education, tele-conference, and co-authoring of multimedia contents by offering conveniences of presentation, group authoring, common management, and transient event productions of the users. As for the conventional sharing white board system, all the multimedia contents segments should be authored by the exclusive program, and we cannot use any existing contents or program. Moreover we suffer from the problem that ordering error occurs in the teleprocessing operation because we do not have any line-up technology for the input ordering of commands. Therefore we develop a method of retrieving input and output events from the windows system and the message hooking technology which transmits between programs in the operating system In addition, we realize the allocation technology of the processing results for all sharing users of the distributed computing environment without any error. Our sharing technology should contribute to improve the face-to-face coworking efficiency for multimedia contents authoring, common blackboard system in the area of remote educations, and presentation display in visual conference.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.30-36
• /
• 2016

In this paper, an Rx-ordering aided sphere decoding algorithm for generalized spatial modulation (GSM) systems is proposed. In the proposed sphere decoding algorithm, to efficiently reduce the search region, the received signals are optimally ordered, which results in the reduction of computational complexity. To evaluate the performance and the computational complexity of the proposed Rx-ordered sphere decoding algorithm, the simulations are performed. In the simulation results, it is observed that in GSM systems, the proposed decoding algorithm achieves the same error performance with the conventional SD, whereas it efficiently decreases the computational complexity for symbol detection.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.323-335
• /
• 2012

In this paper, we propose an AR(augmented reality) system using user's bare hand based on computer vision. It is important for registering a virtual object on the real input image to detect and track correct feature points. The AR systems with markers are stable but they can not register the virtual object on an acquired image when the marker goes out of a range of the camera. There is a tendency to give users inconvenient environment which is limited to control a virtual object. On the other hand, our system detects fingertips as fiducial features using adaptive ellipse fitting method considering the geometric characteristics of hand. It registers the virtual object stably by getting movement of fingertips with determining the shortest distance from a palm center. We verified that the accuracy of fingertip detection over 82.0% and fingertip ordering and tracking have just 1.8% and 2.0% errors for each step. We proved that this system can replace the marker system by tacking a camera projection matrix effectively in the view of stable augmentation of virtual object.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.3
• /
• pp.193-206
• /
• 1993

An analytical model of undertow is presented in the surf zone. Each term of the derived governing equation is evaluated by the ordering methods. Then the turbulent normal stresses and the streaming velocity terms are neglected. The driving force of undertow is derived from the wave profile which is approximated by the 4th order Chebyshev polynomials. The three types of vertical distribution of eddy viscosity are assumed and the coefficient of eddy viscosity is decided from the new boundary condition. So the input parameters for the calculation of undertow become very simple. The theoretical solutions of the present model are compared with the various experimental results. This model shows a good agreement with the experimental results in the case of mild slope and linear type eddy viscosity.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.11a
• /
• pp.148-151
• /
• 2003

The spin density of ${\beta}-MnO_2$ structure was theoretically investigated by $DV-X_{\alpha}$ (the discrete variation $X{\alpha}$) method, which is a sort of the first principle molecular orbital method using Hatre-Fock-Slater approximation. The used cluster model was $[Mn_{14}O_{56}]^{-52}$. The ${\beta}-MnO_2$ is a paramagnetic oxide semiconductor material having the energy band gap of 0.18 eV and an 3 loan-pair electrons in the 3d orbital of an cation. This material exhibits spin-only magnetism and has the magnetic ordering temperature of 94 K. Below this temperature its magnetism appears as antiferromagnetism. The calculations of electronic state showed that if the initial spin condition of input parameters changed, the magnetic state changed from paramagnetic to antiferromagnetic. When d orbital of all Mn atoms in cluster had same initial spin state as only up spin, paramagnetic spin density distribution appeared by the calculation. On the other way, d orbital had alternately changed spin state along special direction the resulted spin distribution showed antiferromagnetism.