• Title/Summary/Keyword: Second-Order Distance

Search Result 315, Processing Time 0.025 seconds

A study of the simulation of thermal distribution in an aquifer thermal energy storage utilization model (대수층 축열 에너지 활용 모델의 온도 분포 시뮬레이션 연구)

  • Shim, Byoung-Ohan;Song, Yoon-Ho
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.697-700
    • /
    • 2005
  • Aquifer Thermal Energy Storage (ATES) system can be very cost-effective and renewable energy sources, depending on site-specific parameters and load characteristics. In order to develop an ATES system which has certain hydrogeological characteristics, understanding of the thermo hydraulic processes of an aquifer is necessary for a proper design of an aquifer heat storage system under given conditions. The thermo hydraulic transfer for heat storage is simulated using FEFLOW according to two sets of pumping and waste water reinjection scenarios of heat pump operation in a two layered confined aquifer. In the first set of model, the movement of the thermal front and groundwater level are simulated by changing the locations of injection and pumping well in seasonal cycle. However, in the second set of model the simulation is performed in the state of fixing the locations of pumping and injection well. After 365 days simulation period, the temperature distribution is dominated by injected water temperature and the distance from injection well. The small temperature change is appears on the surface compared to other slices of depth because the first layer has very low porosity and the transfer of thermal energy are sensitive at the porosity of each layer. The groundwater levels and temperature changes in injection and pumping wells are monitored to validate the effectiveness of the used heat pump operation method and the thermal interference between wells is analyzed.

  • PDF

A Robust Fault Location Algorithm for Single Line-to-ground Fault in Double-circuit Transmission Systems

  • Zhang, Wen-Hao;Rosadi, Umar;Choi, Myeon-Song;Lee, Seung-Jae;Lim, Il-Hyung
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.1
    • /
    • pp.1-7
    • /
    • 2011
  • This paper proposes an enhanced noise robust algorithm for fault location on double-circuit transmission line for the case of single line-to-ground (SLG) fault, which uses distributed parameter line model that also considers the mutual coupling effect. The proposed algorithm requires the voltages and currents from single-terminal data only and does not require adjacent circuit current data. The fault distance can be simply determined by solving a second-order polynomial equation, which is achieved directly through the analysis of the circuit. The algorithm, which employs the faulted phase network and zero-sequence network with source impedance involved, effectively eliminates the effect of load flow and fault resistance on the accuracy of fault location. The proposed algorithm is tested using MATLAB/Simulink under different fault locations and shows high accuracy. The uncertainty of source impedance and the measurement errors are also included in the simulation and shows that the algorithm has high robustness.

A Study on the Precise Surveying Technique by Terrestrial Photogrammetry (지상사진측량(地上寫眞測量)에 의한 정밀측량기법(精密測量技法)의 연구(硏究))

  • Kang, In Joon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.9 no.2
    • /
    • pp.91-98
    • /
    • 1989
  • The analysis of a single stereo model is not sufficient in applying for some large structures, therefore the precise coordinate analysis photogrammetric block adjustment method should be considered. The distribution of control points has a great influence on the error characteristics of the block adjustment results. Thus, the unit model method is applied to the photogrammentric adjustment procedure to study error characterestics with different distributions of control points. Through this study, the second order polynomial equations about bridging distance and plane error are developed in block adjustment of terrestrial photogrammetry. Comparing the block adjustment method and a single model method, root mean square error of the block adjustment method is 0.44mm, and a single model method is 1.06mm.

  • PDF

Detection and Location of Cable Fault Using Improved SSTDR (개선된 SSTDR을 이용한 케이블 고장 검출과 위치 계산)

  • Jeon, Jeong-Chay;Kim, Jae-Jin;Choi, Myeong-Il
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1583-1589
    • /
    • 2016
  • This paper proposes an improved spread spectrum time domain reflectometry (ISSTDR) using time-frequency correlation and reference signal elimination method in order to have more accurate fault determination and location detection than conventional (SSTDR) despite increased signal attenuation due to the long distance to cable fault location. The proposed method has a two-step process: the first step is to detect a peak location of the reference signal using time-frequency correlation analysis, and the second step is to detect a peak location of the correlation coefficient of the reflected signal by removing the reference signal. The proposed method was validated through comparison with existing SSTDR methods in open-and short-circuit fault detection experiments of low voltage power cables. The experimental results showed that the proposed method can detect correlation coefficients at fault locations accurately despite reflected signal attenuation so that cable faults can be detected more accurately and clearly in comparison to existing methods.

A Study on a new Algorithm for K Shortest Paths Problem (복수 최단 경로의 새로운 해법에 관한 연구)

  • Chang, Byung-Man
    • Korean Management Science Review
    • /
    • v.25 no.2
    • /
    • pp.81-88
    • /
    • 2008
  • This paper presents a new algorithm for the K shortest paths problem in a network. After a shortest path is produced with Dijkstra algorithm. detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set. this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.

Organ Shape Modeling Based on the Laplacian Deformation Framework for Surface-Based Morphometry Studies

  • Kim, Jae-Il;Park, Jin-Ah
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.3
    • /
    • pp.219-226
    • /
    • 2012
  • Recently, shape analysis of human organs has achieved much attention, owing to its potential to localize structural abnormalities. For a group-wise shape analysis, it is important to accurately restore the shape of a target structure in each subject and to build the inter-subject shape correspondences. To accomplish this, we propose a shape modeling method based on the Laplacian deformation framework. We deform a template model of a target structure in the segmented images while restoring subject-specific shape features by using Laplacian surface representation. In order to build the inter-subject shape correspondences, we implemented the progressive weighting scheme for adaptively controlling the rigidity parameter of the deformable model. This weighting scheme helps to preserve the relative distance between each point in the template model as much as possible during model deformation. This area-preserving deformation allows each point of the template model to be located at an anatomically consistent position in the target structure. Another advantage of our method is its application to human organs of non-spherical topology. We present the experiments for evaluating the robustness of shape modeling against large variations in shape and size with the synthetic sets of the second cervical vertebrae (C2), which has a complex shape with holes.

A Study on a New Algorithm for K Shortest Detour Path Problem in a Directed Network (유방향의 복수 최단 우회 경로 새로운 해법 연구)

  • Chang, Byung-Man
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.60-66
    • /
    • 2006
  • This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

  • PDF

Correcting Inconsistency on the Boundary of Neighboring Maps (인접하는 수치지도 간의 경계영역 불일치 보정)

  • Kim, Won-Tae;Kim, Hak-Cheol;Li, Ki-Joune;Ahn, Byeung-Ik;Kim, Seung-Ryong
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.7 no.1 s.13
    • /
    • pp.41-52
    • /
    • 1999
  • In order to correct mismatches between neighboring digital maps, the middle line method has been widely used. However, it may result in not only a corruption of the topological consistency between the objects near to boundaries but also degeneration of accuracy. In this paper, we propose two edge-matching methods to overcome the problem of the middle line method. The first method is based on the rubber sheeting, which performs an elastic transformation for the objects located around the boundaries. The second method transforms the geometry of objects by the function of the distance from the boundary. These methods have important advantages that they preserve the topology of the original maps and improve tile accuracy, compared with the previous methods.

  • PDF

A Stud on the Space Organization and Composition Elements in Gangwon Gamyoung (강원감영의 공간구성과 구성요소의 건축적 특징에 관한 연구)

  • Choi, Jang-Soon
    • Journal of the Korean Institute of Rural Architecture
    • /
    • v.7 no.2
    • /
    • pp.31-47
    • /
    • 2005
  • This study is to inspect and analyse the historical background, spacial organization and architectural features about the traditional government office building of Gangwon Gamyoung(the supreme local government office of Gangwondo in Chosun dynasty). The results are as follows. - Gangwon Gamyoung was located at the center of Gangwondo in consideration of distance to each small local office. And also it was located in consideration of geographical connection between Hanseong(today's Seoul). - The spatial organization of Gamyoung was divided into the three parts of entrance space, government office building space and backyard space. The entrance space was composed of three gates(Pojungru-Jungsammun-Naesammun). The government office building Space was consisted of business and living building as center of Sunhwadang(the main office building). And the backyard space was composed of Yonji(pond), Jungja(bower), and so on - The way to enter the space of Gamyoung follows the order from Pojungru(the first & outer main gate with a bower), Jungsammun(the second & intermediate gate), Naesammun(the third & inner gate) to Sunhwadang at last. - There were a beautiful Yonji(pond) which to be rectangular type and to have a round island with Bongraegak(bower) at Gamyoung backyard, the drain conduit and pedestrian road covered with pebble in the ground.

  • PDF

사업자 사전 선택제 도입 사례와 시사점

  • 유영상
    • Proceedings of the Korea Technology Innovation Society Conference
    • /
    • 2002.11a
    • /
    • pp.45-57
    • /
    • 2002
  • Since a new entrant in the telecommunications market requires time in order to construct its own network, a requirement on the incumbent operator to implement carrier selection and pre-selection can enable a new entrant to immediately attract customers and earn revenue. Carrier selection can normally be accomplished in two ways, on a call-by-call basis or through carrel pre-selection. Call-by-call selection allows customers to choose a new entrant rather than the incumbent carrier using a specific code designated to the new carrier each time a call is made. Carrier Pre-Selection, on the other hand, allows customers directly connect to the network of one provider to have access automatically to another company's services when they pick up the phone to make certain types of calls. The carrier pre-selection option is generally considered to be a second regulatory step following the implementation of the call-by-call carrier selection option. Carrier pre-selection with the ability to override on a call-by-call basis for long distance, international, local, and fixed-to-mobile calls has now been implemented in many EU countries. This paper attempts to identify the issues in introducing CPS and to draw policy implications from other countries' experiences.

  • PDF