• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.24 no.1
• /
• pp.1-9
• /
• 2016

In this paper, we integrate three degree of freedom(3DOF) point-mass model for aircraft and three-dimensional path generation algorithms using dubins curve and nonlinear path tracking law. Through this integration, we apply the path generation algorithm to the path planning, and verify tracking performance and feasibility of using the aircraft 3DOF point-mass model for air traffic management. The accuracy of modeling 6DOF aircraft is more accurate than that of 3DOF model, but the complexity of the calculation would be raised, in turn the rate of computation is more likely to be slow due to the increase of degree of freedom. These obstacles make the 6DOF model difficult to be applied to simulation requiring real-time path planning. Therefore, the 3DOF point-mass model is also sufficient for simulation, and real-time path planning is possible because complexity can be reduced, compared to those of the 6DOF. Dubins curve used for generating the optimal path has advantage of being directly available to apply path planning. However, we use the algorithm which extends 2D path to 3D path since dubins curve handles the two dimensional path problems. Control law for the path tracking uses the nonlinear path tracking laws. Then we present these concomitant simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10A
• /
• pp.823-829
• /
• 2011

Recently, wireless body area network (WBAN) has received much attention as an application for the ubiquitous healthcare system. In WBAN, each sensor nodes and a personal base station such as PDA have an energy constraint and computation overhead should be minimized due to node's limited computing power and memory constraint. The reliable data transmission also must be guaranteed because it handles vital signals. In this paper, we propose a systematic network coding scheme for WBAN to reduce the network coding overhead as well as total energy consumption for completion the transmission. We model the proposed scheme using Markov chain. To minimize the total energy consumption for completing the data transmission, we made the problem as a minimization problem and find an optimal solution. Our simulation result shows that large amount of energy reduction is achieved by proposed systematic network coding. Also, the proposed scheme reduces the computational overhead of network coding imposed on each node by simplify the decoding process.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.171-174
• /
• 2006

A large number of service providers in countries all over the world have established GNSS reference station networks in the last years and are using network software today to provide a correction stream to the user as a routine service. In current GNSS network processing, all the geometric related information such as ionospheric free carrier phase ambiguities from all stations and satellites, tropospheric effects, orbit errors, receiver and satellite clock errors are estimated in one centralized Kalman filter. Although this approach provides an optimal solution to the estimation problem, however, the processing time increases cubically with the number of reference stations in the network. Until now one single Personal Computer with Pentium 3.06 GHz CPU can only process data from a network consisting of no more than 50 stations in real time. In order to process data for larger networks in real time and to lower the computational load, a federated filter approach can be considered. The main benefit of this approach is that each local filter runs with reduced number of states and the computation time for the whole system increases only linearly with the number of local sensors, thus significantly reduces the computational load compared to the centralized filter approach. This paper presents the technical aspect and performance analysis of the federated filter approach. Test results show that for a network of 100 reference stations, with the centralized approach, the network processing including ionospheric modeling and network ambiguity fixing needs approximately 60 hours to process 24 hours network data in a 3.06 GHz computer, which means it is impossible to run this network in real time. With the federated filter approach, only less than 1 hour is needed, 66 times faster than the centralized filter approach. The availability and reliability of network processing remain at the same high level.

• Journal of Satellite, Information and Communications
• /
• v.7 no.2
• /
• pp.97-103
• /
• 2012

A very low complexity QRD-M algorithm based on limited search area is proposed for MIMO systems. The conventional QRD-M algorithm calculates Euclidean distance between all constellation symbols and the temporary detection symbol at each layer. We found that performance will not be degraded even if we adaptively restrict the search area of the candidate symbols only to the neighboring points of temporary detection symbol according to the channel condition at each layer. As a channel condition indicator, we employ the channel gain ratio among the layers without necessity of SNR estimation. The simulation results show that the proposed scheme effectively achieves near optimal performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.643-652
• /
• 2002

This paper proposes an efficient hybrid fixed-point (FP) algorithm for improving performances of the independent component analysis (ICA) based on neural networks. The proposed algorithm is the FP algorithm based on secant method and momentum for ICA. Secant method is applied to improve the separation performance by simplifying the computation process for estimating the root of objective function, which is to minimize the mutual informations of the independent components. The momentum is applied for high-speed convergence by restraining the oscillation if the process of converging to the optimal solution. It can simultaneously achieve a superior properties of the secant method and the momentum. The proposed algorithm has been applied to the composite fingerprints and the images generated by random mixing matrix in the 8 fingerprints of $256\times{256}$-pixel and the 10 images of $512\times{512}$-pixel, respectively. The simulation results show that the proposed algorithm has better performances of the separation speed and rate than those using the FP algorithm based on Newton and secant method. Especially, the secant FP algorithm can be solved the separating performances depending on initial points settings and the nonrealistic learning time for separating the large size images by using the Newton FP algorithm.

• Journal of Advanced Navigation Technology
• /
• v.19 no.2
• /
• pp.116-122
• /
• 2015

Motivated by continuous increase in flight demand, awareness of the importance in developing ways to increase aircraft operational efficiency on the airport movement area has been raised. This paper proposes a new routing algorithm for providing the shortest path in a right time, enhancing the aircraft movement efficiency. Many researches on developing algorithms have been performed, for example, Dijkstra algorithm and $A^*$ algorithm. The Dijkstra algorithm provide optimal solution but could possibly provide it with a cost of relatively longer computation time. On the other hand, $A^*$ algorithm does not guarantee the optimality of a solution. In this paper, we suggest a Hybrid $A^*$ algorithm, incorporating both algorithms to eliminate the weaknesses. Rigorous test shows the proposed Hybrid $A^*$ algorithm may achieve shorter computing time and optimality in searching the shortest path.

• Journal of Radiation Industry
• /
• v.5 no.4
• /
• pp.325-330
• /
• 2011

To predict the details of flow in industrial process unit, single photon emission computed tomography (SPECT) is a promising technique. Recently, industrial SPECT based on medical system has developed by researchers of the Korea Atomic Energy Research Institute (KAERI) and Hanyang University. In the present study, to confirm the effect of the number of detectors on image quality, and determine the optimal number of detectors in industrial SPECT, industrial SPECT system with various geometries were evaluated by the Monte Carlo simulation. CsI(Tl) detectors ($12mm{\times}12mm{\times}20mm$) with collimators (the geometric resolution of collimator $R_g$ was 4 cm at the center of the 30 cm diameter cylindrical vessel object) were modeled in a hexagonal array, and the point sources of $^{99m}Tc$, $^{68}Ga$, and $^{137}Cs$ were simulated at the center of the cylindrical vessel object using the MCNPX code. Then, the reconstruction images of each geometry were reconstructed using the expectation maximization (EM) algorithm. In this study, the reciprocity theorem was used to improve computation time required for system matrix of the EM algorithm. The result shows that the resolution of the reconstructed image was significantly improved by increasing the number of detectors in industrial SPECT system and more than 60 detectors will be required for the resolution of the reconstructed image.

• International Journal of Advanced Culture Technology
• /
• v.7 no.2
• /
• pp.168-178
• /
• 2019

In this paper I discuss a more complicated case of 'It'-Extraposition in English in the Optimality Theory [1] by further modifying and extending the analysis done in Khym (2018) [2] in which only the 'relatively' simple cases of 'It'-Extraposition such as 'CP-Predicate' was dealt with. I show in this paper that the constraints and the constraint hierarchy developed to explain the 'relatively' simple cases of 'It'-Extraposition are no longer valid for the more complicated cases of 'It'-Extraposition in configuration of 'CP-V-CP'. In doing so, I also discuss two important theoretic possibilities and suggest a new view to look at the 'It'-Extraposition: first, the long-bothering question of which syntactic approach between P&P (Chomsky 1985) [3] and MP (Chomsky 1992) [4] should be based on in projecting the full surface forms of candidates may boil down to just a simple issue of an intrinsic property of the Gen(erator). Second, the so-called 'It'- Extraposition phenomenon may not actually be a derived construction by the optional application of Extraposition operation. Rather, it could be just a representational construction produced by the simple application of 'It'-insertion after the structure projection with 'that-clause' at the post-verbal position. This observation may lead to elimination of one of the promising candidates of '$It_i{\ldots}[_{CP}that{\sim}]_i$' out of the computation table in Khym [2], and eventually to excluding the long-named 'It'-Extraposition case from Extrsposition phenomena itself. The final constraints and the constraint hierarchy that are explored are as follows: ${\bullet}$ Constraints: $^*SSF$, AHSubj, Subj., Min-D ${\bullet}$ Constraint Hierarchy: SSF<<>>Subj.>> AHSubj.

• Ecology and Resilient Infrastructure
• /
• v.6 no.1
• /
• pp.1-11
• /
• 2019

This study performed the impact of ecological waterway on fish community in a reach of the Dal River, Korea. Fish monitoring revealed that 9 fish species are dominant, namely Zacco platypus, Coreoleuciscus splendidus, Zacco koreanus, Pungtungia herzi, Acheilognathus yamatsutae, Rhinogobius brunneus, Tanakia signifer, Gobiobotia macrocephala, and Pseudopungtungia tenuicorpus, and account for 95% of the total fish community. The River2D model was used for the computation of the flow and the HSI model for the habitat simulation. The restoration of the waterway performed through the small dam removal, the formation of the pool-riffle structure, and the change of the bed elevation and width. Simulation results indicated that the restoration of the ecological waterway effects significantly increased by about 16% for the WUA (Weighted Usable Area) of the total fish community in optimal ecological flow conditions ($Q=7.0m^3/s$). The restoration of the ecological waterway is more advantageous to fish community.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.5
• /
• pp.47-53
• /
• 2021

Sparse ratings data hinder reliable similarity computation between users, which degrades the performance of memory-based collaborative filtering techniques for recommender systems. Many works in the literature have been developed for solving this data sparsity problem, where the most simple and representative ones are the methods of utilizing Jaccard index. This index reflects the number of commonly rated items between two users and is mostly integrated into traditional similarity measures to compute similarity more accurately between the users. However, such integration is very straightforward with no consideration of the degree of data sparsity. This study suggests a novel idea of applying different similarity measures depending on the numeric value of Jaccard index between two users. Performance experiments are conducted to obtain optimal values of the parameters used by the proposed method and evaluate it in comparison with other relevant methods. As a result, the proposed demonstrates the best and comparable performance in prediction and recommendation accuracies.