• 정보처리학회논문지A
• /
• 제12A권2호
• /
• pp.103-108
• /
• 2005

수학적 모델을 컴퓨터 상에 실현시키는데 있어 보다 효율적인 알고리즘을 구현하고 개발하는 것이 수치해석 연구의 궁극적인 목표이다. 일반적으로 컴퓨터 상에서 구한 계산 결과, 즉 근사 값은 수학적으로 구한 값인 참값과 정확하게 같지 않다 따라서 근사 값이 얼마나 참값에 가까운가를 측정하는 오차평가는 알고리즘의 효율성을 평가하는데 있어 가장 중요한 과제라 할 수 있다. 대부분의 경우 오차평가에 있어 오차의 한계를 이용하지만 주어진 문제의 참값을 모르기 때문에 정확한 오차평가를 할 수 없다. 여기서는 수치등각사상을 구하기 위한 해법중 하나인 Wegmann 방법을 다루는데 저자는 수렴하는 문제의 범위를 넓히기 위해 저주파필터를 적용한 알고리즘을 제안한바 있다. 본 논문에서는 몇 가지 수학적 이론에 근거하여 저주파필터를 적용한 Wegmann해법에서 참값을 모르더라도 오차평가를 할 수 있는 방법을 제안하고 수치실험을 통해 그 유효성을 입증한다.

• 제어로봇시스템학회논문지
• /
• 제15권6호
• /
• pp.619-625
• /
• 2009

FastSLAM which uses the Rao-Blackwellized particle filter is one of the famous solutions to SLAM (Simultaneous Localization and Mapping) problem that estimates concurrently a robot's pose and surrounding environment. However, the particle depletion problem arises from the loss of the particle diversity in the resampling process of FastSLAM. Then, the performance of FastSLAM degenerates over the time. In this work, DIR (Density Information-based Resampling) technique is proposed to solve the particle depletion problem. First, the cluster is constructed based on the density of each particle, and the density of each cluster is computed. After that, the number of particles to be reserved in each cluster is determined using a linear method based on the distance between the highest density cluster and each cluster. Finally, the resampling process is performed by rejecting the particles which are not selected to be reserved in each cluster. The performance of the DIR proposed to solve the particle depletion problem in FastSLAM was verified in computer simulations, which significantly reduced both the RMS position error and the feature error.

• 전자통신동향분석
• /
• 제33권1호
• /
• pp.20-33
• /
• 2018

The calculation speed of quantum computing is expected to outperform that of existing supercomputers with regard to certain problems such as secure computing, optimization problems, searching, and quantum chemistry. Many companies such as Google and IBM have been trying to make 50 superconducting qubits, which is expected to demonstrate quantum supremacy and those quantum computers are more advantageous in computing power than classical computers. However, quantum computers are expected to be applicable to solving real-world problems with superior computing power. This will require large scale quantum computing with many more qubits than the current 50 qubits available. To realize this, first, quantum error correction codes are required to be capable of computing within a sufficient amount of time with tolerable accuracy. Next, a compiler is required for the qubits encoded by quantum error correction codes to perform quantum operations. A large-scale quantum computer is therefore predicted to be composed of three essential components: a programming environment, layout mapping of qubits, and quantum processors. These components analyze how many numbers of qubits are needed, how accurate the qubit operations are, and where they are placed and operated. In this paper, recent progress on large-scale quantum computing and the relation of their components will be introduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.323-343
• /
• 2020

With the rapid development of computer and communication techniques, copyright protection of vector geographic data has attracted considerable research attention because of the high cost of such data. A novel adaptive watermark detection algorithm is proposed for vector geographic data that can be used to qualitatively analyze the robustness of watermarks against data addition attacks. First, a watermark was embedded into the vertex coordinates based on coordinate mapping and quantization. Second, the adaptive watermark detection model, which is capable of calculating the detection threshold, false positive error (FPE) and false negative error (FNE), was established, and the characteristics of the adaptive watermark detection algorithm were analyzed. Finally, experiments were conducted on several real-world vector maps to show the usability and robustness of the proposed algorithm.

• 한국통신학회논문지
• /
• 제31권9C호
• /
• pp.831-839
• /
• 2006

본 논문에서는 수신기에서 I/Q 위상 및 진폭 불균형을 갖는 계층적 MPSK(Hierarchical M-ary Phase Shift Keying) 신호에 대해 수치 적분이 필요 없는 정확하고 일반화된 closed-form 형태의 비트 오류 확률(Bit Error Probability) 표현을 유도한다. 새롭게 유도된 비트 오류 확률 표현은 간결한 형태의 일반화된 식으로 되어 있어 다양한 환경으로의 적용이 용이하다. 뿐만 아니라, 계층적 MPSK를 적용하는 많은 디지털 통신 시스템에서 복조시 발생할 수 있는 I/Q 불균형들에 의한 시스템 성능 변화에 대하여 정확한 이론적 성능 기준을 제공할 것으로 기대된다.

• 한국도로학회논문집
• /
• 제20권2호
• /
• pp.127-135
• /
• 2018

PURPOSES : This study develops various models that can estimate the pattern of road surface temperature changes using machine learning methods. METHODS : Both a thermal mapping system and weather forecast information were employed in order to collect data for developing the models. In previous studies, the authors defined road surface temperature data as a response, while vehicular ambient temperature, air temperature, and humidity were considered as predictors. In this research, two additional factors-road type and weather forecasts-were considered for the estimation of the road surface temperature change pattern. Finally, a total of six models for estimating the pattern of road surface temperature changes were developed using the MATLAB program, which provides the classification learner as a machine learning tool. RESULTS : Model 5 was considered the most superior owing to its high accuracy. It was seen that the accuracy of the model could increase when weather forecasts (e.g., Sky Status) were applied. A comparison between Models 4 and 5 showed that the influence of humidity on road surface temperature changes is negligible. CONCLUSIONS : Even though Models 4, 5, and 6 demonstrated the same performance in terms of average absolute error (AAE), Model 5 can be considered the optimal one from the point of view of accuracy.

• 한국인터넷방송통신학회논문지
• /
• 제15권2호
• /
• pp.99-104
• /
• 2015

본 논문에서는 통신 채널에서 발생되는 부호간 간섭 영향을 최소화시키기 위한 MMA 적응 등화 알고리즘의 성능을 개선시키기 위한 RMMA (Region based Multiple Modulus Algorithm) 알고리즘을 제안한다. RMMA 알고리즘에서는 적응을 위한 오차 신호를 얻기 위하여 등화기 출력 constellation을 4개의 영역으로 분할한 후 각 영역별로 4-QAM 신호로 매핑하므로서 nonconstant modulus 신호를 constant modulus 신호로의 변환 효과를 얻으며, 이로 인하여 더욱 적은 오차 신호를 얻을 수 있게 된다. 논문에서는 제안 알고리즘인 RMMA의 적응 등화 성능을 평가하기 위하여 기존 방식인 MMA와 비교하였다. 컴퓨터 시뮬레이션 결과 잔류 isi와 MD에서 수렴 속도와 잔류양에서 개선되었으며, 특히 SER에서 기존 MMA보다 월등함을 알 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제6권3호
• /
• pp.273-283
• /
• 2000

In this paper we suggest an optimal design method of Fuzzy-Neural Networks(FNN) model for complex and nonlinear systems. The FNNs use the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. And we use a HCM(Hard C-Means) Clustering Algorithm to find initial parameters of the membership function. The parameters such as parameters of membership functions learning rates and momentum weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. According to selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity (distribution of I/O data we show that it is available and effective to design and optimal FNN model structure with a mutual balance and dependency between approximation and generalization abilities. This methodology sheds light on the role and impact of different parameters of the model on its performance (especially the mapping and predicting capabilities of the rule based computing). To evaluate the performance of the proposed model we use the time series data for gas furnace the data of sewage treatment process and traffic route choice process.

• Current Optics and Photonics
• /
• 제3권6호
• /
• pp.531-540
• /
• 2019

Spectral Amplitude Coding Optical Code Division Multiple Access (SAC OCDMA) is an advanced technique in asynchronous environments. This paper proposes design and implementation of a novel quantum logic gate (QLG) code, with code construction algorithm generated without following any code mapping procedures for SAC system. The proposed code has a unitary matrices property with maximum overlap of one chip for various clients and no overlaps in spectra for the rest of the subscribers. Results indicate that a single algorithm produces the same length increment for codes with weight greater than two and follows the same signal to noise ratio (SNR) and bit error rate (BER) calculations for a higher number of users. This paper further examines the performance of a QLG code based SAC-OCDMA system with NAND and direct detection techniques. BER analysis was carried out for the proposed code and results were compared with existing MDW, RD and GMP codes. We demonstrate that the QLG code based system performs better in terms of cardinality, which is followed by improved BER. Numerical analysis reveals that for error free transmission (10^-9), the suggested code supports approximately 170 users with code weight 4. Our results also conclude that the proposed code provides improvement in the code construction, cross-correlation and minimization of noises.

• 대한전자공학회논문지TC
• /
• 제38권11호
• /
• pp.41-48
• /
• 2001

이제까지 임의의 M에 대한 M진 직교 진폭 변조 신호에 대하여 일반화된 closed-form BER 표현식은 구하여진 바 없다. 이 논문에서는 가산성 백색 가우시안 잡음 환경에서 정방형 M진 직교 진폭 변조 신호의 일반화된 비트 오류 확률식을 유도하고 분석한다. M이 16, 64, 256일 때의 직교 진폭 변조 신호의 비트 오류 확률식 결과로부터 유도 과정의 규칙성을 찾아내고, 그 규칙성으로부터 임의의 M에 대한 일반화된 비트오류 확률 표현식을 유도하고 분석한다.