• Restorative Dentistry and Endodontics
• /
• v.40 no.2
• /
• pp.123-127
• /
• 2015

Objectives: Glide path preparation is recommended to reduce torsional failure of nickel-titanium (NiTi) rotary instruments and to prevent root canal transportation. This study evaluated whether the repetitive insertions of G-files to the working length maintain the apical size as well as provide sufficient lumen as a glide path for subsequent instrumentation. Materials and Methods: The G-file system (Micro-Mega) composed of G1 and G2 files for glide path preparation was used with the J-shaped, simulated resin canals. After inserting a G1 file twice, a G2 file was inserted to the working length 1, 4, 7, or 10 times for four each experimental group, respectively (n = 10). Then the canals were cleaned by copious irrigation, and lubricated with a separating gel medium. Canal replicas were made using silicone impression material, and the diameter of the replicas was measured at working length (D0) and 1 mm level (D1) under a scanning electron microscope. Data was analysed by one-way ANOVA and post-hoc tests (p = 0.05). Results: The diameter at D0 level did not show any significant difference between the 1, 2, 4, and 10 times of repetitive pecking insertions of G2 files at working length. However, 10 times of pecking motion with G2 file resulted in significantly larger canal diameter at D1 (p < 0.05). Conclusions: Under the limitations of this study, the repetitive insertion of a G2 file up to 10 times at working length created an adequate lumen for subsequent apical shaping with other rotary files bigger than International Organization for Standardization (ISO) size 20, without apical transportation at D0 level.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.3
• /
• pp.90-96
• /
• 2011

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.1E
• /
• pp.25-30
• /
• 2002

We report on the development of a fiber optic hydrophone consists of a sensing Michelson interferometer and a compensating Mach-Zehnder interferometer for optical path length compensation. The double interferometer configuration has the following advantages: the hydrophone can be made more small; a laser source with a relatively short coherence length can be used; and the compensating interferometer can be located near the signal processing electronics, far away from the sensing interferometer and noise introduced by reference arm can be greatly reduced. The performance of the hydrophone is evaluated experimentally by immersing the sensing interferometer in a water tank to detect underwater acoustic signals generated by an acoustic wave projector. Experimental results show that over the frequency range of 1 to 4 kHz, the hydrophone has an almost flat response with an average normalized sensitivity of -302 dB re 1/ μ Pa.

• Proceedings of the Optical Society of Korea Conference
• /
• 2005.02a
• /
• pp.184-185
• /
• 2005

• Journal of Biosystems Engineering
• /
• v.24 no.4
• /
• pp.301-308
• /
• 1999

Path planning for field operation of agricultural machinery is an indispensible part for precision farming or autonomous field operation. In this study, two algorithms (I, II) of generating a time-based shortest operation path were suggested to plan an optimal operation of an agricultural tractor-implement in a rectangular shaped field. The algorithms were based on modification of a minimum spanning tree algorithm, and applied for tractor-implement operations. the generated path was consisted of round operation and returning operation sections. The number of round operation was determined from the condition that a tractor can turn smoothly at headlands. The performance of the algorithms was evaluated by the calculation number for path generation and the total path length generated. Their stability was affected by the number of returning operation, but the algorithm II was considered to be more stable. In addition, the performances of the developed algorithms were compared with those of the conventional field operations at selected field sizes and shapes. The results showed that the algorithms could reduce field operation time greatly. For a 100m$\times$40m field, the reduced path length was 78m. The study also included an user interface program for implementing the algorithms and generating GPS coordinates that could be used in GIS softwares for precision farming.

• 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.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.11 no.1
• /
• pp.34-41
• /
• 2001

Passive samplers have been used for personal, indoor, and outdoor air monitoring of VOCs at ppb concentrations in community and office environments. The path length of modified passive sampler was shortened, so it was intended to increase an uptake rate. The performance of the modified 3M 3500 organic vapor monitor(OVM) as a tool for assessing exposures to toxic air pollutants in nonoccupational community environments was evaluated using combined controlled test atmospheres of six selected target volatile organic compounds(VOCs): benzene, methyl tert-butyl ether(MTBE), chloroform, 1,4-dichlorobenzene, tetrachloroethylene, and toluene. The experiments were conducted by exposing the dosimeters to concentrations of $50{\sim}100{\mu}g/m^3$ on six face velocity(0.00, 0.02, 0.06, 0.12, 0.20, 0.30 m/sec) for 24 hours. If the uptake rate was increased, that means that we could use the passive sampler more effectively. The uptake rates were increased linearly according to reduce the path length. Although the diffusion path length was shortened, the change of uptake rate was within ${\pm}25%$ of theoretical value, indicating that the modified passive sampler(TM) can be effectively used over the range of concentrations and environmental conditions tested with a 24-h sampling period if the face velocities were over 0.12 m/s for 6 components of VOCs. But when the face velocities were less than 0.12 m/s, uptake rates were reduced more than expected values. So, the passive sampler with the shortened path length should be used at indoor or outdoor environment where the face velocity should be over about 0.10 m/s. If the path length was shortened more, the uptake rate was more effected by starvation.

• Physical Therapy Rehabilitation Science
• /
• v.10 no.3
• /
• pp.270-277
• /
• 2021

Objective: The purpose of this study is to compare the effect of static balance, lower extremity function, and gait ability between a lower extremity restrain robot gait training and a general robot gait training in subacute stroke subjects. Design: Two-group pretest-posttest design. Methods: A total of 12 subacute stroke patients were randomly divided into an Experimental group (n=6) and a control group (n=6). Both groups were performed for four weeks, three times a week, for 20 minutes. To compare the Static balance function, the center of pressure (COP) path-length and COP velocity were measured. The Fugl-Meyer assessment lower extremity (FMA-LE) were evaluated to compare the Lower Extremity function. 2D Dartfish Program and 10 Meter Walking Test (10 MWT) on Gait ability were evaluated to compare the gait function. Results: In the intra-group comparison, Experimental groups showed significant improvement in COP path-length, velocity, Lower Extremity Function, 10 MWT, Cadence, by comparing the parameters before and after the intervention (p<0.05). Comparison of the amount of change between groups revealed significant improvement for parameters in the COP path-length, velocity, Lower extremity function, 10 MWT by comparing the parameters before and after the intervention (p<0.01). Conclusions: The Experimental group showed enhanced efficacy for variables such as COP path-length, velocity, Lower extremity function, 10 MWT as compared to the control group.

• Journal of Ecology and Environment
• /
• v.30 no.2
• /
• pp.201-207
• /
• 2007

Researchers have used a variety of methods to measure patterns of animal movement, including the use of spatial data (mapping the position of a moving animal at specified intervals) and direct estimation of travel path length by pacing under a moving animal or group. I collected movement data from five groups of siamangs (Symphalangus syndactylus) using two different methods concurrently to estimate the effects of the method of data collection on estimates of daily path length (DPL). Estimates of DPL produced from spatial data collected at 15-minute intervals were 12% lower than estimates of DPL produced by pacing under the traveling animal. The actual magnitude of the difference was correlated with the travel distance, but there was no correlation between the proportional difference and the travel distance. While the collection of spatial data is generally preferable, as spatial data permit additional analyses of patterns of movements in two or three dimensions, the relatively small difference between the DPL's produced using different methods suggests that pacing is an acceptable substitute where the collection of spatial data is impractical. I also subsampled the spatial data at increasing time intervals to assess the effect of sampling interval on the calculation of daily path lengths. Longer sampling intervals produced significantly shorter estimates of travel paths than shorter sampling intervals. These results suggest that spatial data should be collected at short time intervals wherever possible, and that sampling intervals should not exceed 30 minutes. Researchers should be cautious when comparing data generated using different methods.

• Journal of KIISE:Software and Applications
• /
• v.34 no.11
• /
• pp.971-983
• /
• 2007

Cellular Genetic Algorithms(CGAs) are a subclass of Genetic Algorithms(GAs) in which each individuals are placed in a given geographical distribution. In general, CGAs# population space is a regular network that has relatively long characteristic path length and high clustering coefficient in the view of the Networks Theory. Long average path length makes the genetic interaction of remote nodes slow. If we have the population#s path length shorter with keeping the high clustering coefficient value, CGAs# population space will converge faster without loss of diversity. In this paper, we propose Smallest-Small-World Cellular Genetic Algorithms(SSWCGAs). In SSWCGAs, each individual lives in a population space that is highly clustered but having shorter characteristic path length, so that the SSWCGAs promote exploration of the search space with no loss of exploitation tendency that comes from being clustered. Some experiments along with four real variable functions and two GA-hard problems show that the SSWCGAs are more effective than SGAs and CGAs.