• 제목/요약/키워드: algorithm for division

검색결과 2,646건 처리시간 0.037초

단일주파수 CA코드 GPS 수신기를 이용한 CDGPS 정밀측위실험 (Field Test Results of CDGPS Precision Positioning Using Single Frequency, CA Code GPS Receivers)

  • 원종훈;고선준;박헌준;이자성
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 D
    • /
    • pp.2436-2438
    • /
    • 2000
  • In this paper, field test results of a new efficient integer ambiguity resolution algorithm for precision Carrier Differential GPS(CDGPS) positioning are presented. The new algorithm is based on a reconfiguration Kalman filter which is designed to be used for the real-time precise positioning with low cost, single frequency, conventional C/A code GPS receivers. The tests were performed both in static and kinematic environment

  • PDF

Design and Implementation of the Prevention System for Side Effects of Polypharmacy Components Utilizing Data Queuing Algorithm

  • Choi, Jiwon;Kim, Chanjoo;Ko, Yunhee;Im, Hyeji;Moon, Yoo-Jin;McLain, Reid
    • 한국컴퓨터정보학회논문지
    • /
    • 제26권11호
    • /
    • pp.217-225
    • /
    • 2021
  • 이 논문은 데이터 큐잉 알고리즘과 의약품 빅데이터를 통해 약품 성분-성분 간의 정보와 질병-성분 간의 정보를 지원함으로써 의약품 다약제 복용 시 부작용이 발생 가능한 약물 정보를 사용자에게 제공하기 위한 시스템을 제안하고 구현한다. 또한, 의약품 성분에 더하여 복용이 금지된 의약품, 공급업체, 유통업체의 정보 등을 제공함으로써 의료 전문가뿐만 아니라 일반 사용자의 의약품 복용에 대한 불안감을 덜어줄 수 있다. 제공되는 대표적인 정보는 두 가지 약물 사이에서 일어나는 부작용, 특정 의약품의 주성분과 효능, 동일한 제약회사에서 제조된 의약품, 만성 질환 환자가 주의해야 할 약품 성분 정보이다. 앞으로, 희귀병 약이나 신약에 대한 정보를 수집하여 데이터를 업데이트하는 것이 필요하다.

Effect of cone-beam computed tomography metal artefact reduction on incomplete subtle vertical root fractures

  • Andrea Huey Tsu Wang;Francine Kuhl Panzarella;Carlos Eduardo Fontana;Jose Luiz Cintra Junqueira;Carlos Eduardo da Silveira Bueno
    • Imaging Science in Dentistry
    • /
    • 제53권1호
    • /
    • pp.11-19
    • /
    • 2023
  • Purpose: This study compared the accuracy of detection of incomplete vertical root fractures (VRFs) in filled and unfilled teeth on cone-beam computed tomography images with and without a metal artefact reduction (MAR) algorithm. Materials and Methods: Forty single-rooted maxillary premolars were selected and, after endodontic instrumentation, were categorized as unfilled teeth without fractures, filled teeth without fractures, unfilled teeth with fractures, or filled teeth with fractures. Each VRF was artificially created and confirmed by operative microscopy. The teeth were randomly arranged, and images were acquired with and without the MAR algorithm. The images were evaluated with OnDemand software (Cybermed Inc., Seoul, Korea). After training, 2 blinded observers each assessed the images for the presence and absence of VRFs 2 times separated by a 1-week interval. P-values<0.05 were considered to indicate significance. Results: Of the 4 protocols, unfilled teeth analysed with the MAR algorithm had the highest accuracy of incomplete VRF diagnosis (0.65), while unfilled teeth reviewed without MAR were associated with the least accurate diagnosis (0.55). With MAR, an unfilled tooth with an incomplete VRF was 4 times more likely to be identified as having an incomplete VRF than an unfilled tooth without this condition, while without MAR, an unfilled tooth with an incomplete VRF was 2.28 times more likely to be identified as having an incomplete VRF than an unfilled tooth without this condition. Conclusion: The use of the MAR algorithm increased the diagnostic accuracy in the detection of incomplete VRF on images of unfilled teeth.

Affine Local Descriptors for Viewpoint Invariant Face Recognition

  • Gao, Yongbin;Lee, Hyo Jong
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2014년도 춘계학술발표대회
    • /
    • pp.781-784
    • /
    • 2014
  • Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we use Affine SIFT to detect affine invariant local descriptors for face recognition under large viewpoint change. Affine SIFT is an extension of SIFT algorithm. SIFT algorithm is scale and rotation invariant, which is powerful for small viewpoint changes in face recognition, but it fails when large viewpoint change exists. In our scheme, Affine SIFT is used for both gallery face and probe face, which generates a series of different viewpoints using affine transformation. Therefore, Affine SIFT allows viewpoint difference between gallery face and probe face. Experiment results show our framework achieves better recognition accuracy than SIFT algorithm on FERET database.

Considerations on Ionospheric Correction and Integrity Algorithm for Korean SBAS

  • Bang, Eugene;Lee, Jiyun
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제3권1호
    • /
    • pp.17-23
    • /
    • 2014
  • Satellite Based Augmentation Systems (SBAS) provide ionospheric corrections at geographically five degree-spaced Ionospheric Grid Points (IGPs) and confidence bounds, called Grid Ionospheric Vertical Errors (GIVEs), on the error of those corrections. Since the ionosphere is one of the largest error sources which may threaten the safety of a single frequency Global Navigation Satellite System (GNSS) user, the ionospheric correction and integrity bound algorithm is essential for the development of SBAS. The current single frequency based SBAS, already deployed or being developed, implement the ionospheric correction and error bounding algorithm of the Wide Area Augmentation System (WAAS) developed for use in the United States. However, the ionospheric condition is different for each region and it could greatly degrade the performance of SBAS if its regional characteristics are not properly treated. Therefore, this paper discusses key factors that should be taken into consideration in the development of the ionospheric correction and integrity bound algorithm optimized for the Korean SBAS. The main elements of the conventional GIVE monitor algorithm are firstly reviewed. Then, this paper suggests several areas which should be investigated to improve the availability of the Korean SBAS by decreasing the GIVE value.

On-load Parameter Identification of an Induction Motor Using Univariate Dynamic Encoding Algorithm for Searches

  • Kim, Jong-Wook;Kim, Nam-Gun;Choi, Seong-Chul;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.852-856
    • /
    • 2004
  • An induction motor is one of the most popular electrical apparatuses owing to its simple structure and robust construction. Parameter identification of the induction motor has long been researched either for a vector control technique or fault detection. Since vector control is a well-established technique for induction motor control, this paper concentrates on successive identification of physical parameters with on-load data for the purpose of condition monitoring and/or fault detection. For extracting six physical parameters from the on-load data in the framework of the induction motor state equation, unmeasured initial state values and profiles of load torque have to be estimated as well. However, the analytic optimization methods in general fail to estimate these auxiliary but significant parameters owing to the difficulty of obtaining their gradient information. In this paper, the univariate dynamic encoding algorithm for searches (uDEAS) newly developed is applied to the identification of whole unknown parameters in the mathematical equations of an induction motor with normal operating data. Profiles of identified parameters appear to be reasonable and therefore the proposed approach is available for fault diagnosis of induction motors by monitoring physical parameters.

  • PDF

도심환경에서의 GNSS 기반 육상 이동체를 위한 짧은 지연 다중경로 감쇄 기법 (A Novel Short Delay Multipath Mitigation Algorithm for a GNSS based Land Vehicle in Urban Environment)

  • 임덕원;천세범;허문범
    • 한국항행학회논문지
    • /
    • 제22권6호
    • /
    • pp.557-565
    • /
    • 2018
  • 도심환경에서의 GNSS 항법을 위하여 짧은 지연 다중경로 감쇄 기법을 제안하였다. 제안한 기법은 GNSS 수신기가 육상 교통 이동체에 탑재되어 있다는 제한 조건을 이용하여 어느 위성에서 다중경로 신호가 발생했는지를 검출하고, 해당위성의 측정치를 제거하여 새로운 항법결과를 도출한다. 이때 검출 조건은 GNSS 수신기의 성능 등급과 이동체의 동적 특성에 따라 결정된다. 제안 기법을 검증하기 위하여 4가지 시나리오에 대한 다중경로 환경에서 실제 데이터를 수집하였으며, GNSS 수신기에 기본적으로 탑재된 다중경로 감쇄 기법과 제안한 기법을 함께 적용하여 데이터를 처리한 결과 가시위성이 5개 미만인 경우를 제외하고는 측위 결과가 5 m 이하로 나타나는 것을 확인하였다.

국지성 집중호우 감시를 위한 천리안위성 2A호 대류운 전조 탐지 알고리즘 개발 (Development of GK2A Convective Initiation Algorithm for Localized Torrential Rainfall Monitoring)

  • 박혜인;정성래;박기홍;문재인
    • 대기
    • /
    • 제31권5호
    • /
    • pp.489-510
    • /
    • 2021
  • In this paper, we propose an algorithm for detecting convective initiation (CI) using GEO-KOMPSAT-2A/advanced meteorological imager data. The algorithm identifies clouds that are likely to grow into convective clouds with radar reflectivity greater than 35 dBZ within the next two hours. This algorithm is developed using statistical and qualitative analysis of cloud characteristics, such as atmospheric instability, cloud top height, and phase, for convective clouds that occurred on the Korean Peninsula from June to September 2019. The CI algorithm consists of four steps: 1) convective cloud mask, 2) cloud object clustering and tracking, 3) interest field tests, and 4) post-processing tests to remove non-convective objects. Validation, performed using 14 CI events that occurred in the summer of 2020 in Korean Peninsula, shows a total probability of detection of 0.89, false-alarm ratio of 0.46, and mean lead-time of 39 minutes. This algorithm can be useful warnings of rapidly developing convective clouds in future by providing information about CI that is otherwise difficult to predict from radar or a numerical prediction model. This CI information will be provided in short-term forecasts to help predict severe weather events such as localized torrential rainfall and hail.

Evaluation and Optimization of Resource Allocation among Multiple Networks

  • Meng, Dexiang;Zhang, Dongchen;Wang, Shoufeng;Xu, Xiaoyan;Yao, Wenwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권10호
    • /
    • pp.2395-2410
    • /
    • 2013
  • Many telecommunication operators around the world have multiple networks. The networks run by each operator are always of different generations, such as 2G and 3G or even 4G systems. Each system has unique characters and specified requirements for optimal operation. It brings about resource allocation problem among these networks for the operator, because the budget of each operator is limited. However, the evaluation of resource allocation among various networks under each operator is missing for long, not to mention resource allocation optimization. The operators are dying for an algorithm to end their blind resource allocation, and the Resource Allocation Optimization Algorithm for Multi-network Operator (RAOAMO) proposed in this paper is what the operators want. RAOAMO evaluates and optimizes resource allocation in the view of overall cost for each operator. It outputs a resource distribution target and corresponding optimization suggestion. Evaluation results show that RAOAMO helps operator save overall cost in various cases.

Weighted Centroid Localization Algorithm Based on Mobile Anchor Node for Wireless Sensor Networks

  • Ma, Jun-Ling;Lee, Jung-Hyun;Rim, Kee-Wook;Han, Seung-Jin
    • 한국공간정보시스템학회 논문지
    • /
    • 제11권2호
    • /
    • pp.1-6
    • /
    • 2009
  • Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.

  • PDF