• Title/Summary/Keyword: Extreme Point

Search Result 268, Processing Time 0.025 seconds

Tropospheric Anomaly Detection in Multi-reference Stations Environment during Localized Atmosphere Conditions-(1) : Basic Concept of Anomaly Detection Algorithm

  • Yoo, Yun-Ja
    • Journal of Navigation and Port Research
    • /
    • v.40 no.5
    • /
    • pp.265-270
    • /
    • 2016
  • Extreme tropospheric anomalies such as typhoons or regional torrential rain can degrade positioning accuracy of the GPS signal. It becomes one of the main error terms affecting high-precision positioning solutions in network RTK. This paper proposed a detection algorithm to be used during atmospheric anomalies in order to detect the tropospheric irregularities that can degrade the quality of correction data due to network errors caused by inhomogeneous atmospheric conditions between multi-reference stations. It uses an atmospheric grid that consists of four meteorological stations and estimates the troposphere zenith total delay difference at a low performance point in an atmospheric grid. AWS (automatic weather station) meteorological data can be applied to the proposed tropospheric anomaly detection algorithm when there are different atmospheric conditions between the stations. The concept of probability density distribution of the delta troposphere slant delay was proposed for the threshold determination.

Efficient Implementation of an Extreme Eigenvalue Problem on Cray T3E (Cray T3E에서 극한 고유치문제의 효과적인 수행)

  • 김선경
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.480-483
    • /
    • 2000
  • 공학의 많은 응용분야에서 큰 회소 행렬(Large Sparse Matrices)에 대한 가장 작거나 또는 가장 큰 고유치(Eigenvalues)들을 요구하게 되는데, 이때 많이 이용되는 것은 Krylov Subspace로의 Projection방법이다. 대칭 행렬에 대해서는 Lanczos방법을, 비대칭 행렬에 대해서는 Biorhtogonal Lanczos방법을 이용할 수 있다. 이러한 기존의 알고리즘들은 새롭게 제안되는 병렬처리 시스템에서 효과적이지 못하다. 많은 프로세서를 가지는 병렬처리 컴퓨터 중에서도 분산 기억장치 시스템(Distributed Memory System)에서는 프로세서들 사이의 Data Communication에 필요한 시간을 줄이도록 해야한다. 본 논문에서는 기존의 Lanczos 알고리즘을 수정함으로써, 알고리즘의 동기점(Synchronization Point)을 줄이고 병렬화를 위한 입상(Granularity)을 증가시켜서 MPP인 Cray T3E에서 Data Communication에 필요한 시간을 줄인다. 많은 프로세서를 사용하는 경우 수정된 알고리즘이 기존의 알고리즘에 비해 더 나은 speedup을 보여준다.

  • PDF

Efficient Parallel Algorithm for Gram-Schmidt Method

  • Kim, Sung-Kyung
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.4 no.4
    • /
    • pp.88-93
    • /
    • 1999
  • Several Iterative methods are considered, Gram-Schmidt algerian for thin orthogonalization and Lanczos methodfor a few extreme eigenvalues. For these methods, a variants of method is derived for which only one synchronization point per on iteration is required; that is one global communication in a message passing distributed-memory machine per one iteration is required The variant is called restructured method, and restructured method has better parallel properties to the conventional method.

  • PDF

Remanufacturing Planning on a Single Facility (단일 재생 처리 설비를 이용한 재생계획)

  • 주운기
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.111-122
    • /
    • 2000
  • This paper considers remanufacturing planning problems under deterministic environments. As increasing the environmental pressures in manufacturing, various methods for reducing wasted or postponing the time to be waste are considered. This paper considers remanufacturing planning problems on a single facility, where the wastes(or used products) are remanufactured to satisfy the given demand on the remanufactured products. The objective is to find the optimal remanufacturing and purchasing planning of the wastes which minimize total cost subject to satisfaction all the given demand on the remanufactured products. Two problems that the amount of wastes is a given constant or a decision variable are considered, respectively. For the problems, the extreme point solutions are characterized, and dynamic programming algorithms are developed with numerical examples.

  • PDF

The Mathematical Relationship Between the Region of Efficient Objective Value and the Region of Weight in Multiple Objective Linear Programming (다목적 선형계획 문제의 유효 목적함수 영역과 가중치 수리적 관계에 관한 연구)

  • 소영섭
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.2
    • /
    • pp.119-128
    • /
    • 1994
  • There are three important regions im Multiple Objective Linear Programming (MOLP). One is the region of efficient solutions, another is the region of weight to be used for finding efficient solutions, the third is the region of efficient (nondominated) objective values. In this paper, first, we find the condition of extreme point in the region of efficient objective values. Second, we find that the sum of the dimension of the weight region and the dimension of efficient objective values region is constant. Using the above, it is shown that we find the shape and dimension of weight region corresponding to the given region or efficient objective values and vice versa.

  • PDF

OPTIMALITY CONDITIONS AND AN ALGORITHM FOR LINEAR-QUADRATIC BILEVEL PROGRAMMING

  • Malhotra, Neelam;Arora, S.R.
    • Management Science and Financial Engineering
    • /
    • v.7 no.1
    • /
    • pp.41-56
    • /
    • 2001
  • This linear fractional - quadratic bilevel programming problem, in which the leader's objective function is a linear fractional function and the follower's objective function is a quadratic function, is studied in this paper. The leader's and the follower's variables are related by linear constraints. The derivations of the optimality conditions are based on Kuhn-Tucker conditions and the duality theory. It is also shown that the original linear fractional - quadratic bilevel programming problem can be solved by solving a standard linear fractional program and the optimal solution of the original problem can be achieved at one of the extreme point of a convex polyhedral formed by the new feasible region. The algorithm is illustrated with the help of an example.

  • PDF

Meteorological Data Integrity for Environmental Impact Assessment in Yongdam Catchment (용담댐시험유역 환경영향평가의 신뢰수준 향상을 위한 기상자료의 품질검정)

  • Lee, Khil-Ha
    • Journal of Environmental Science International
    • /
    • v.29 no.10
    • /
    • pp.981-988
    • /
    • 2020
  • This study presents meteorological data integrity to improve environmental quality assessment in Yongdam catchment. The study examines both extreme ranges of meteorological data measurements and data reliability which include maximum and minimum temperature, relative humidity, dew point temperature, radiation, heat flux. There were some outliers and missing data from the measurements. In addition, the latent heat flux and sensible heat flux data were not reasonable and evapotranspiration data did not match at some points. The accuracy and consistency of data stored in a database for the study were secured from the data integrity. Users need to take caution when using meteorological data from the Yongdam catchment in the preparation of water resources planning, environmental impact assessment, and natural hazards analysis.

Two Cases Report of Galgunhaegui-tang Applied on Trigeminal neuralgia (삼차신경통(三叉神經痛)에 갈근해기탕(葛根解肌湯)을 사용한 임상증례 2례)

  • Jo, Joon-Ki;Seong, Eun-Jin;Youn, In-Hwan;Hong, Seok-Hoon;Park, Min-Cheol
    • The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
    • /
    • v.20 no.3
    • /
    • pp.243-250
    • /
    • 2007
  • Trigeminal neuralgia is nerve systematic disease appearing in the distribution scope of trigeminal nerve. It's characterized by extreme pain accompanying with a repeated and simultaneous fit from several seconds to 1-2 minutes. The oriental medical name of trigeminal neuralgia is generally Dootong, Doopoong, Myuntong, Pyundootong, Pyundoopoong, and Myuntong is the nearest in Occidental medicine. So I study for general prescription of Trigeminal neuralgia and point out Galgunhaegui-tang(葛根解肌湯). Trigeminal neuralgia patients were given Galgunhaegui-tang. After taking Galgunhaegui-tang, the patients's Trigeminal neuralgia was improved.

  • PDF

A Technology on Reverse Engineering of Structure Using 3D Scanner (삼차원 스캐너를 이용한 구조물의 역설계 기법)

  • Yang, In-Tae;Shin, Moon-Seung;Acharya, Tri Dev
    • Journal of Industrial Technology
    • /
    • v.35
    • /
    • pp.47-53
    • /
    • 2015
  • Recent extreme weather events and natural disasters are causing rapid aging of the ancient structures with cultural value. It has threatened the safety and management. The construction design documents are not kept for such long time. Even if they are, they seem to be mismatched with the design structures due to corrosive effects. For these reasons, Korea has been facing difficulties in maintenance, reengineering and safety evaluation. In this study, three dimensional point cloud surface of bobsleigh is obtained using 3D LiDAR scanner. The obtained structure is compared with the original design and found to be highly accurate. The study shows the application of reverse engineering technique and its potential use for other civil structures.

  • PDF

Multi-product Remanufacturing Planning on a Single Facility (단일 재생처리 설비를 이용한 다중 제품 재생계획)

  • Joo, Un Gi;Lee, Choong-ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.3
    • /
    • pp.240-247
    • /
    • 2005
  • Today's hightech society requires thousands of different products which ultimately result in billions of tons of materials discarded, most of which end up in landfills. Therefore industrial circles could not help thinking about environmental problems by regulations of government or pressures of consumer. Generally, the related research subjects are classified into both of environmentally conscious manufacturing and product recovery, where product recovery aims to minimize the amount of waste sent to landfills by recovering materials and parts from old or outdated products by means of recycling and remanufacturing (including reuse of parts and products). In this research, we constructed a model for remanufacturing various goods using a single facility and developed a dynamic programing(DP) algorithm based upon the optimal solution characterization. We showed the efficiency of the developed DP algorithm with a numerical example.