• The Journal of the Society of Korean Medicine Diagnostics
• /
• v.14 no.1
• /
• pp.1-14
• /
• 2010

Backgrounds : Bojungikgitang is one of the most common herbal prescriptions in Oriental Medicine, and it is highly recommended prescription for Nogwonsang syndrome. The Author developed Nogwonsang questionnaire for quantitative evaluation. Nogwonsang questionnaire is consisted of causes that induce fatigue, symptoms that directly associated with fatigue, and secondary symptoms that is induced from fatigue. Purposes : This study aims to verify whether the Bojungikgitang Questionnaire has causality and meaningful path structure by path analysis. Methods : 242 patients from 12 OMD clinics participated in this study. The patients executed a question investigation in the object. Factor analysis was conducted for extraction of factor and abridgment of items. Path analysis was conducted to verify path structure. SPSS 15.0 for Windows and AMOS 7.0 were used for statistical analysis. Results : Overwork factor explains fatigue factor. Coefficient is 0.771. Fatigue factor explains digesting and cold factor. Individually coefficient is 0.632 and 0.465. Model fit is $X^2=61.395$(df=51), GFI=0.960, AGFI=0.939, NFI= 0.924, CFI=0.986, RMSEA=0.029. Path structure is proved to be significant. Conclusions : Further research is needed Gold standard of Nogwonsang. Establishment of Gold standard leads and the collection of data and the research which are objective are possible. Connection of the clinical indexes which are objective on the paperweight outside and leads and the development of the diagnosis tool which is fixed quantity is demanded.

• Journal of Multimedia Information System
• /
• v.8 no.4
• /
• pp.203-210
• /
• 2021

Deep leaning convolutional neural networks (CNN) have successfully been applied to image super-resolution (SR). Despite their great performances, SR techniques tend to focus on a certain upscale factor when training a particular model. Algorithms for single model multi-scale networks can easily be constructed if images are upscaled prior to input, but sub-pixel convolution upsampling works differently for each scale factor. Recent SR methods employ multi-scale and multi-path learning as a solution. However, this causes unshared parameters and unbalanced parameter distribution across various scale factors. We present a multi-scale single-path upsample module as a solution by exploiting the advantages of sub-pixel convolution and interpolation algorithms. The proposed model employs sub-pixel convolution for the highest scale factor among the learning upscale factors, and then utilize 1-dimension interpolation, compressing the learned features on the channel axis to match the desired output image size. Experiments are performed for the single-path upsample module, and compared to the multi-path upsample module. Based on the experimental results, the proposed algorithm reduces the upsample module's parameters by 24% and presents slightly to better performance compared to the previous algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.194-198
• /
• 2011

In this paper, we obtained the path loss characteristics in the 850 MHz for Russia area by using the free space path loss model and Okumura-Hata path loss model. In order to extract the additional path loss model parameter from the new Russian regional properties, the mean square error technique is used to obtain the correction factor. According to the obtained correction factor, the differences for the free space and Hata path loss model are 17, 6 dB in the 5 ~ 10 Km, 28, 14 dB in the 10 ~ 15 Km, and 35, 18 dB in the 15 ~ 20 Km. By applying the correction factors, the appropriate partial path loss models for the measured Russain area are proposed.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.4
• /
• pp.12-18
• /
• 2012

This study was performed to found out the deviations for clamp-on type ultrasonic flowmeter installed in downstream of valves. It was selected three types of two-path flowmeter mainly used for K-water as test. Experiment carried out to confirmed characteristics of deviation depending on the sensor location, straight pipe length and maker for 1-path, 2-path and 4-path combined 2-path flowmeter. It was selected two kinds of valves with 100 % and 50 % opening, butterfly valves and gate valves, for flow disturbance factor. Finally, we suggested number of sensors by maker, straight pipe length and installed location of sensors satisfying the tolerance depending on the experiment results.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.4
• /
• pp.511-521
• /
• 2010

This paper presents a new algorithm to determine accurate bus-wise transmission loss allocation utilizing path-integrals dictated by the transaction strategy. For any transaction strategy, the total sum of the allocated transmission losses of all buses is equal to the actual loss given by the AC power-flow calculation considering the distributed slack. In this paper, the bus-wise allocation of the transmission loss is calculated by integrating the differential loss along a path determined by the transaction strategy. The proposed algorithm is also compared with Galiana's method, which is the well-known transmission loss allocation algorithm based on integration. The performance of the proposed algorithm is evaluated by case studies carried out on the WSCC 9-bus, IEEE 14-bus, New England 39-bus, and IEEE 118-bus systems. The simulation results show that the proposed algorithm is fast and accurate with a large step size.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.83-91
• /
• 2011

The route finding analysis is an essential geo-related decision support tool in a LBS(Location based Services) and previous researches related to route guidance have been mainly focused on route guidances for vehicles. However, due to the recent spread of personal computing devices such as PDA, PMP and smart phone, route guidance for pedestrians have been increasingly in demand. The pedestrian route guidance is different from vehicle route guidance because pedestrians are affected more surrounding environment than vehicles. Therefore, pedestrian path finding needs considerations of factors affecting walking. This paper aimed to extract factors affecting walking and charting the factors for application factors affecting walking to pedestrian path finding. In this paper, we found various factors about environment of road for pedestrian and extract the factors affecting walking. Factors affecting walking consist of 4 categories traffic, sidewalk, network, safety facility. We calculated weights about each factor using analytic hierarchy process (AHP). Based on weights we calculated scores about each factor's attribute. The weight is maximum score of factor. These scores of factor are used to optimal pedestrian path finding as path finding cost with distance, accessibility.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• Journal of the Korean Society of Safety
• /
• v.30 no.6
• /
• pp.139-147
• /
• 2015

This study deals with actual commuting distance and influence of risk factors depending on commuting distance and mode in order to reestablish actual commuting zone of primary school students. Data mining analysis(CHAID) was applied for this reestablishment using survey results from 6,927 primary school students in Seoul Metro. Six risk factors; convenience level of commuting path condition, convenience level of road crossing condition, vehicle speed on commuting path, segregation level between commuter and vehicle, congestion level of commuting path, and public security level and two mode; walking and cycle are considered in the analysis. As the results of CHAID analysis, commuting distance was divided into four zones; Internal Zone(0.491km under), External Zone(0.492 ~ 1.492km, 1.493 ~ 2.699km), Commutable Zone(2.70km over), and awareness level on safety is declined as commuting distance is increased. The risk factor affecting on safety is recognized differently by students depending on commuting distance and mode. For students commuting by walking, vehicle speed on commuting path and convenience level of commuting path condition are recognized as the prime risk factor within Internal Zone and Commutable Zone, respectively. For students commuting by cycle, convenience level of road crossing condition and vehicle speed on commuting path are recognized as the prime risk factor within Commutable Zone. Analysis results show that improved plan and program for commuting path for primary school students are required considering actual commuting distance and method.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.10 no.1
• /
• pp.187-194
• /
• 2002

It has been reported that cracks in mechanical joints is generally under mixed-mode and there is critical inclined angle at which mode I stress intensity factor becomes maximum. The crack propagates in arbitrary direction and thus the prediction of crack growth path is needed to provide against crack propagation or examine safety. In order to evaluate the fatigue life of cracks in mechanical joints, horizontal crack normal to the applied load and located on minimum cross section is major concern but critical inclined crack must also be considered. In this paper mixed-mode fatigue crack growth test is performed far horizontal crack and critical inclined crack in mechanical joints. Fatigue crack growth path is predicted by maximum tangential stress criterion using stress intensity factor obtained from weight function method, and fatigue crack growth rates of horizontal and inclined crack are compared.