• 제목/요약/키워드: Dual time point

검색결과 127건 처리시간 0.026초

Karmarkar's & Primal-Dual 내부점 알고리즘의 해의 수렴과정의 안정성에 관한 고찰 (A Study of stability for solution′s convergence in Karmarkar's & Primal-Dual Interior Algorithm)

  • 박재현
    • 산업경영시스템학회지
    • /
    • 제21권45호
    • /
    • pp.93-100
    • /
    • 1998
  • The researches of Linear Programming are Khachiyan Method, which uses Ellipsoid Method, and Karmarkar, Affine, Path-Following and Interior Point Method which have Polynomial-Time complexity. In this study, Karmarkar Method is more quickly solved as 50 times then Simplex Method for optimal solution. but some special problem is not solved by Karmarkar Method. As a result, the algorithm by APL Language is proved time efficiency and optimal solution in the Primal-Dual interior point algorithm. Furthermore Karmarkar Method and Primal-Dual interior point Method is compared in some examples.

  • PDF

선형계획문제의 강성다항식 계산단계 기법에 관한 연구 (A Study on the Strong Polynomial Time Algorithm for the Linear Programming)

  • 정성진;강완모;정의석;허홍석
    • 대한산업공학회지
    • /
    • 제19권4호
    • /
    • pp.3-11
    • /
    • 1993
  • We propose a new dual simplex method using a primal interior point. The dropping variable is chosen by utilizing the primal feasible interior point. For a given dual feasible basis, its corresponding primal infeasible basic vector and the interior point are used for obtaining a decreasing primal feasible point The computation time of moving on interior point in our method takes much less than that od Karmarker-type interior methods. Since any polynomial time interior methods can be applied to our method we conjectured that a slight modification of our method can give a polynomial time complexity.

  • PDF

갑상선미세유두암의 수술 전 진단에서 $^{18}F$-FDG PET/CT: 이중시간 영상의 유용성 ($^{18}F$-FDG PET/CT for the Preoperative Diagnosis of Papillary Thyroid Microcarcinoma: The Value of Dual Time Point Imaging)

  • 서영덕;김성민;김근호;김제룡
    • Nuclear Medicine and Molecular Imaging
    • /
    • 제43권6호
    • /
    • pp.543-556
    • /
    • 2009
  • 목적: 이중시간 $^{18}F$-FDG PET/CT 영상(dual time point $^{18}F$-FDG PET/CT imaging)을 통해 갑상선미세유두암 원발 병소와 양성 갑상선결절의 FDG 섭취 양상을 비교 평가하고자 하였다. 대상 및 방법: 갑상선유두암으로 진단받고 수술 전 이중시간 $^{18}F$-FDG PET/CT를 시행한 환자들 중 134명의 갑상선미세유두암(154개)과 49명의 1.0 cm 이하의 양성 갑상선결절 양성 갑상선결절(61개)을 대상으로 후향적 분석을 시행하였다. 두 번의 영상에서 모두 갑상선미세유두암과 양성갑상선결절의 최대 표준화섭취계수(SUVmax)와 두 영상 간 SUVmax의 백분율 변화(${\Delta}%SUVmax$), 병소와 정상조직의 SUVmax의 백분율 변화(${\Delta}%L$:B ratio)를 계산하였다. 두 영상 간의 시간 차이는 평균 $23.4{\pm}4.4$분(갑상선 부위 기준 평균 $10.7{\pm}4.4$분)이었다. 결과: 이중시간 $^{18}F$-FDG PET/CT 영상에서 154개의 갑상선미세유두암은 평균 SUVmax가 $4.9{\pm}4.3$ (1.1~29.9)에서 $5.3{\pm}4.7$ (1.0~33.1)로 증가하였고(p<0.001) 평균 $12.3{\pm}23.6%$ (-34.1~85.3%) 증가하였으나, 61개의 양성 갑상선결절은 $2.1{\pm}1.0$ (1.0~5.3)에서 $2.1{\pm}1.3$ (0.9~8.0)으로 변하였고 평균 $0.3{\pm}20.5%$ (-41.7~118.2%) 감소하였다. 또한 갑상선미세유두암은 100개(64.9%)가 두 번째 영상에서 SUVmax가 증가하였으나 양성 갑상선결절은 19개(31.1%)만 증가하였다. 첫 번째 영상보다 이중시간 $^{18}F$-FDG PET/CT 영상에서 더 많은 수의 갑상선미세유두암이 육안적으로 양성 소견을 보였고(62.3% vs. 76.6%, p=0.006), 크기가 0.5 cm 이하인 경우에도 발견율이 증가하였다(38.6% vs. 60.0%, p=0.011). 결론: 갑상선미세유두암의 평가에 있어서 일반적인 한 번의 영상검사(single time point $^{18}F$-FDG PET/CT imaging)에 비해 이중시간 $^{18}F$-FDG PET/CT 영상이 원발 갑상선미세유두암 병소와 양성 갑상선결절을 감별하는데 도움이 되었고, 특히 특히 단일 $^{18}F$-FDG PET/CT 영상에서 불확실 소견 또는 음성 소견을 보이는 경우나 크기가 0.5 cm 이하인 경우에 이중시간 $^{18}F$-FDG PET/CT 영상을 시행하는 것이 병소의 악성여부 감별에 더 도움이 될 수 있을 것으로 판단된다.

선형계획을 위한 내부점법의 원문제-쌍대문제 로그장벽법 (A primal-dual log barrier algorithm of interior point methods for linear programming)

  • 정호원
    • 경영과학
    • /
    • 제11권3호
    • /
    • pp.1-11
    • /
    • 1994
  • Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

  • PDF

Attention 기반 Encoder-Decoder 모델을 활용한작물의 생산량 예측 (Forecasting Crop Yield Using Encoder-Decoder Model with Attention)

  • 강수람;조경철;나명환
    • 품질경영학회지
    • /
    • 제49권4호
    • /
    • pp.569-579
    • /
    • 2021
  • Purpose: The purpose of this study is the time series analysis for predicting the yield of crops applicable to each farm using environmental variables measured by smart farms cultivating tomato. In addition, it is intended to confirm the influence of environmental variables using a deep learning model that can be explained to some extent. Methods: A time series analysis was performed to predict production using environmental variables measured at 75 smart farms cultivating tomato in two periods. An LSTM-based encoder-decoder model was used for cases of several farms with similar length. In particular, Dual Attention Mechanism was applied to use environmental variables as exogenous variables and to confirm their influence. Results: As a result of the analysis, Dual Attention LSTM with a window size of 12 weeks showed the best predictive power. It was verified that the environmental variables has a similar effect on prediction through wieghtss extracted from the prediction model, and it was also verified that the previous time point has a greater effect than the time point close to the prediction point. Conclusion: It is expected that it will be possible to attempt various crops as a model that can be explained by supplementing the shortcomings of general deep learning model.

Architecture Design for Maritime Centimeter-Level GNSS Augmentation Service and Initial Experimental Results on Testbed Network

  • Kim, Gimin;Jeon, TaeHyeong;Song, Jaeyoung;Park, Sul Gee;Park, Sang Hyun
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제11권4호
    • /
    • pp.269-277
    • /
    • 2022
  • In this paper, we overview the system development status of the national maritime precise point positioning-real-time kinematic (PPP-RTK) service in Korea, also known as the Precise POsitioning and INTegrity monitoring (POINT) system. The development of the POINT service began in 2020, and the open service is scheduled to start in 2025. The architecture of the POINT system is composed of three provider-side facilities-a reference station, monitoring station, and central control station-and one user-side receiver platform. Here, we propose the detailed functionality of each component considering unidirectional broadcasting of augmentation data. To meet the centimeter-level user positioning accuracy in maritime coverage, new reference stations were installed. Each reference station operates with a dual receiver and dual antenna to reduce the risk of malfunctioning, which can deteriorate the availability of the POINT service. The initial experimental results of a testbed from corrections generated from the testbed network, including newly installed reference stations, are presented. The results show that the horizontal and vertical accuracies satisfy 2.63 cm and 5.77 cm, respectively. For the purpose of (near) real-time broadcasting of POINT correction data, we designed a correction message format including satellite orbit, satellite clock, satellite signal bias, ionospheric delay, tropospheric delay, and coordinate transformation parameters. The (near) real-time experimental setup utilizing (near) real-time processing of testbed network data and the designed message format are proposed for future testing and verification of the system.

AN ELIGIBLE PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi;Lee, Yong-Hoon
    • East Asian mathematical journal
    • /
    • 제29권3호
    • /
    • pp.279-292
    • /
    • 2013
  • It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

AN ELIGIBLE KERNEL BASED PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi
    • 호남수학학술지
    • /
    • 제35권2호
    • /
    • pp.235-249
    • /
    • 2013
  • It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

DDPG 알고리즘을 이용한 양팔 매니퓰레이터의 협동작업 경로상의 특이점 회피 경로 계획 (Singularity Avoidance Path Planning on Cooperative Task of Dual Manipulator Using DDPG Algorithm)

  • 이종학;김경수;김윤재;이장명
    • 로봇학회논문지
    • /
    • 제16권2호
    • /
    • pp.137-146
    • /
    • 2021
  • When controlling manipulator, degree of freedom is lost in singularity so specific joint velocity does not propagate to the end effector. In addition, control problem occurs because jacobian inverse matrix can not be calculated. To avoid singularity, we apply Deep Deterministic Policy Gradient(DDPG), algorithm of reinforcement learning that rewards behavior according to actions then determines high-reward actions in simulation. DDPG uses off-policy that uses 𝝐-greedy policy for selecting action of current time step and greed policy for the next step. In the simulation, learning is given by negative reward when moving near singulairty, and positive reward when moving away from the singularity and moving to target point. The reward equation consists of distance to target point and singularity, manipulability, and arrival flag. Dual arm manipulators hold long rod at the same time and conduct experiments to avoid singularity by simulated path. In the learning process, if object to be avoided is set as a space rather than point, it is expected that avoidance of obstacles will be possible in future research.

Point Cloud Measurement Using Improved Variance Focus Measure Operator

  • Yeni Li;Liang Hou;Yun Chen;Shaoqi Huang
    • Current Optics and Photonics
    • /
    • 제8권2호
    • /
    • pp.170-182
    • /
    • 2024
  • The dimensional accuracy and consistency of a dual oil circuit centrifugal fuel nozzle are important for fuel distribution and combustion efficiency in an engine combustion chamber. A point cloud measurement method was proposed to solve the geometric accuracy detection problem for the fuel nozzle. An improved variance focus measure operator was used to extract the depth point cloud. Compared with other traditional sharpness evaluation functions, the improved operator can generate the best evaluation curve, and has the least noise and the shortest calculation time. The experimental results of point cloud slicing measurement show that the best window size is 24 × 24 pixels. In the height measurement experiment of the standard sample block, the relative error is 2.32%, and in the fuel nozzle cone angle measurement experiment, the relative error is 2.46%, which can meet the high precision requirements of a dual oil circuit centrifugal fuel nozzle.