• Title/Summary/Keyword: Park Path

Search Result 2,304, Processing Time 0.033 seconds

A Seamless N-Screen Service Technology for Disseminating Disaster Informations (재해정보 확산을 위한 끊김없는 N-스크린 서비스 기술)

  • Kim, Kyungjun;Park, Jonghoon;Kim, Chulwon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.3
    • /
    • pp.587-595
    • /
    • 2015
  • A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

Influence of glide path on the screw-in effect and torque of nickel-titanium rotary files in simulated resin root canals

  • Ha, Jung-Hong;Park, Sang-Shin
    • Restorative Dentistry and Endodontics
    • /
    • v.37 no.4
    • /
    • pp.215-219
    • /
    • 2012
  • Objectives: The purpose of this study was to investigate the screw-in effect and torque generation depending on the size of glide path during root canal preparation. Materials and Methods: Forty Endo-Training Blocks (REF A 0177, Dentsply Maillefer) were used. They were divided into 4 groups. For groups 1, 2, 3, and 4, the glide path was established with ISO #13 Path File (Dentsply Maillefer), #15 NiTi K-file NITIFLEX (Dentsply Maillefer), modified #16 Path File (equivalent to #18), and #20 NiTi K-file NITIFLEX, respectively. The screw-in force and resultant torque were measured using a custom-made experimental apparatus while canals were instrumented with ProTaper S1 (Dentsply Maillefer) at a constant speed of 300 rpm with an automated pecking motion. A statistical analysis was performed using one-way analysis of variance and the Duncan post hoc comparison test. Results: Group 4 showed lowest screw-in effect ($2.796{\pm}0.134$) among the groups (p < 0.05). Torque was inversely proportional to the glide path of each group. In #20 glide path group, the screw-in effect and torque decreased at the last 1 mm from the apical terminus. However, in the other groups, the decrease of the screw-in effect and torque did not occur in the last 1 mm from the apical terminus. Conclusions: The establishment of a larger glide path before NiTi rotary instrumentation appears to be appropriate for safely shaping the canal. It is recommended to establish #20 glide path with NiTi file when using ProTaper NiTi rotary instruments system safely.

A Parallel Match Method for Path-oriented Query Processing in iW- Databases (XML 데이타베이스에서 경로-지향 질의처리를 위한 병렬 매치 방법)

  • Park Hee-Sook;Cho Woo-Hyun
    • Journal of KIISE:Databases
    • /
    • v.32 no.5
    • /
    • pp.558-566
    • /
    • 2005
  • The XML is the new standard fir data representation and exchange on the Internet. In this paper, we describe a new approach for evaluating a path-oriented query against XML document. In our approach, we propose the Parallel Match Indexing Fabric to speed up evaluation of path-oriented query using path signature and design the parallel match algorithm to perform a match process between a path signature of input query and path signatures of elements stored in the database. To construct a structure of the parallel match indexing, we first make the binary tie for all path signatures on an XML document and then which trie is transformed to the Parallel Match Indexing Fabric. Also we use the Parallel Match Indexing Fabric and a parallel match algorithm for executing a search operation of a path-oriented query. In our proposed approach, Time complexity of the algorithm is proportional to the logarithm of the number of path signatures in the XML document.

The Singular Position Detection Method from the Measured Path Loss Data for the Cellular Network (이동 통신 망에서 측정하여 계산된 경로 손실의 급격한 변동 위치 추출 방법)

  • Park, Kyung-Tae;Bae, Sung-Hyuk
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.1
    • /
    • pp.9-14
    • /
    • 2014
  • The path loss data was re-calculated according to the distance between the base station and a mobile station in the mobile telecommunications network. In this paper, the averaged path loss data was plotted with the conventional path loss models(free space, plane earth, Hata model ${\ldots}$). The standard deviations for the 2 Km, 1 Km, 0.5 Km-interval averaged path loss were 2.29 dB, 3.39 dB, 4.75 dB, respectively. Additionally, the derivative values for the 2 Km, 1 Km, 0.5 Km-interval averaged path loss were evaluated to find the positions with more than 1 times or 2times of the standard deviation. The situations with the sharply fluctuated path loss were calculated to 5 positions in the 2 Km interval, to 7 positions in the 1 Km interval, to 19 positions in the 0.5 Km interval, respectively. And, the exact distances between the base station and a mobile station were found with the sharply fluctuated path loss.

Path selection algorithm for multi-path system based on deep Q learning (Deep Q 학습 기반의 다중경로 시스템 경로 선택 알고리즘)

  • Chung, Byung Chang;Park, Heasook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.1
    • /
    • pp.50-55
    • /
    • 2021
  • Multi-path system is a system in which utilizes various networks simultaneously. It is expected that multi-path system can enhance communication speed, reliability, security of network. In this paper, we focus on path selection in multi-path system. To select optimal path, we propose deep reinforcement learning algorithm which is rewarded by the round-trip-time (RTT) of each networks. Unlike multi-armed bandit model, deep Q learning is applied to consider rapidly changing situations. Due to the delay of RTT data, we also suggest compensation algorithm of the delayed reward. Moreover, we implement testbed learning server to evaluate the performance of proposed algorithm. The learning server contains distributed database and tensorflow module to efficiently operate deep learning algorithm. By means of simulation, we showed that the proposed algorithm has better performance than lowest RTT about 20%.

Partial Path Selection Method in Each Subregion for Routing Path Optimization in SEF Based Sensor Networks (통계적 여과 기법 기반 센서 네트워크에서 라우팅 경로 최적화를 위한 영역별 부분 경로 선택 방법)

  • Park, Hyuk;Cho, Tae-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.1
    • /
    • pp.108-113
    • /
    • 2012
  • Routing paths are mightily important for the network security in WSNs. To maintain such routing paths, sustained path re-selection and path management are needed. Region segmentation based path selection method (RSPSM) provides a path selection method that a sensor network is divided into several subregions, so that the regional path selection and path management are available. Therefore, RSPSM can reduce energy consumption when the path re-selection process is executed. However, it is hard to guarantee optimized secure routing path at all times since the information using the path re-selection process is limited in scope. In this paper, we propose partial path selection method in each subregion using preselected partial paths made by RSPSM for routing path optimization in SEF based sensor networks. In the proposed method, the base station collects the information of the all partial paths from every subregion and then, evaluates all the candidates that can be the optimized routing path for each node using a evaluation function. After the evaluation process is done, the result is sent to each super DN using the global routing path information (GPI) message. Thus, each super DN provides the optimized secure routing paths using the GPI. We show the effectiveness of the proposed method via the simulation results. We expect that our method can be useful for the improvement of RSPSM.

A NOTE ON PATH-CONNECTED ORTHOMODULAR LATTICES

  • Park, Eun-Soon
    • Journal of the Korean Mathematical Society
    • /
    • v.33 no.2
    • /
    • pp.217-225
    • /
    • 1996
  • An orthomodular lattice (abbreviated by OML) is an ortholattice L which satisfies the orthomodular law: if x $\leq$ y, then $y = x \vee (x' \wedge y)$ [5]. A Boolean algebra B is an ortholattice satisfying the distributive law : $x \vee (g \wedge z) = (x \vee y) \wedge (x \vee z) \forall x, y, z \in B$.

  • PDF