• ETRI Journal
• /
• v.28 no.6
• /
• pp.745-760
• /
• 2006

In this paper, we particularly deal with no $F_p$-rational two-torsion elliptic curves, where $F_p$ is the prime field of the characteristic p. First we introduce a shift product-based polynomial transform. Then, we show that the parities of (#E - 1)/2 and (#E' - 1)/2 are reciprocal to each other, where #E and #E' are the orders of the two candidate curves obtained at the last step of complex multiplication (CM)-based algorithm. Based on this property, we propose a method to check the parity by using the shift product-based polynomial transform. For a 160 bits prime number as the characteristic, the proposed method carries out the parity check 25 or more times faster than the conventional checking method when 4 divides the characteristic minus 1. Finally, this paper shows that the proposed method can make CM-based algorithm that looks up a table of precomputed class polynomials more than 10 percent faster.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.141-144
• /
• 2008

Many studies have been conducted on extracting buildings from ALS(Airborne Laser Scanning) data. After segmentation or classification of building points, additional steps such as generalization is required to get straight boundary lines that better approximate the real ones. In much research, orthogonal constraints are used to improve accuracies and qualities. All the lines of the building boundaries are assumed to be either parallel or perpendicular mutually. However, this assumption is not valid in many cases and more complex shapes of buildings have been increased. A new algorithm is presented that is applicable to various complex buildings. It consists of three steps of boundary tracing, grouping, and regularization. The performance of our approach was evaluated by applying the algorithm to some buildings and the results showed that our proposed method has good potential for extracting building boundaries of various shapes.

• Smart Structures and Systems
• /
• v.19 no.4
• /
• pp.383-391
• /
• 2017

In this paper, we investigate the impacts of network topology on the performance of a distributed estimation algorithm, namely combine-then-adaptive (CTA) diffusion LMS, based on the data with or without the assumptions of temporal and spatial independence with noisy links. The study covers different network models, including the regular, small-world, random and scale-free whose the performance is analyzed according to the mean stability, mean-square errors, communication cost (link density) and robustness. Simulation results show that the noisy links do not cause divergence in the networks. Also, among the networks, the scale free network (heterogeneous) has the best performance in the steady state of the mean square deviation (MSD) while the regular is the worst case. The robustness of the networks against the issues like node failure and noisier node conditions is discussed as well as providing some guidelines on the design of a network in real condition such that the qualities of estimations are optimized.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1527-1575
• /
• 2017

In a spirit of Givental's constructions Batyrev, Ciocan-Fontanine, Kim, and van Straten suggested Landau-Ginzburg models for smooth Fano complete intersections in Grassmannians and partial flag varieties as certain complete intersections in complex tori equipped with special functions called superpotentials. We provide a particular algorithm for constructing birational isomorphisms of these models for complete intersections in Grassmannians of planes with complex tori. In this case the superpotentials are given by Laurent polynomials. We study Givental's integrals for Landau-Ginzburg models suggested by Batyrev, Ciocan-Fontanine, Kim, and van Straten and show that they are periods for pencils of fibers of maps provided by Laurent polynomials we obtain. The algorithm we provide after minor modifications can be applied in a more general context.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

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

Recently, ADI scheme has been a most common tool for solving shallow water equation numerically. But ADI models of tidal flow is likely to cause so called ADI effect in such a region of the Yellow Sea which shows complex topography and has submarine canyons especially. To overcome this, a finite difference algorithm is developed which adopts fully implicit method and preconditioned conjugate gradient squared method. Applying the algorithm including simulation of intertidal zone to Sae-Man-Keum. velocity fields and flooding/drying phenomena are simulated well in spite of complex topography.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.2 s.95
• /
• pp.232-238
• /
• 2005

This paper proposed an optimal plate spring design for the optical pickup suspension. This method requires an analytic solution of plate spring suspension and it can be obtained by Castigliano's theorem and moment equilibrium. However, it is very complex due to the many design variables coupled and some constraints such as pitching angle in focusing motion caused by the characteristics of plate spring. Because of the complex formulation of the analytical solution that is used as the design objective, the genetic algorithm is used to find the optimal design value satisfying design constraints.

• Speech Sciences
• /
• v.4 no.2
• /
• pp.55-68
• /
• 1998

In this paper, a novel method of noise reduction of speech based on a complex adaptive noise canceler and method of optimal feature extraction are proposed. This complex adaptive noise canceler needs simply the noise detection, and LMS algorithm used to calculate the adaptive filter coefficient. The method of optimal feature extraction requires the variance of noise. The experimental results have shown that the proposed method effectively reduced noise in noisy speech. Optimal feature extraction has shown similar characteristics in noise-free speech.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1821-1831
• /
• 2000

In this paper we propose a new adaptive stereo object tracking system that can extract the object from the complex background and foreground noises by using the image-based SAD algorithm and control the convergence angle and pan/tilt of cameras by using optical BPEJTC. From the experimental results the proposed stereo tracking system is found to track the object adpatively under the circumstance of complex and changing background noises and the possibility of real-time implementation of the proposed system by using the optical system is also suggested.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.2
• /
• pp.119-127
• /
• 2010

In this paper, we propose a new automatic surveillance tracking system that can extract the target from the complex background and foreground noises by using the image-based SAD algorithm and control the servo motor of cameras by using kanatani algorithm. From the experimental results the proposed stereo tracking system is found to track the target adaptively under the circumstance of complex and changing background noises and the possibility of real-time implementation of the proposed system by using the optical system is also suggested.