• Title/Summary/Keyword: Travel Information

Search Result 1,063, Processing Time 0.024 seconds

Study on Industrial Fatigue of Working Girls in a Spinning and Weaving Industry (근로여성과 산업피로에 관한 조사연구)

  • 김광자
    • Journal of Korean Academy of Nursing
    • /
    • v.2 no.1
    • /
    • pp.87-96
    • /
    • 1971
  • This Study was undertaken to evaluate the present health status and fatigue of the workers in T. Industrial Company in Pusan in Jan. 1971. The results were based on a question are from 354 working girls. The results of this study are as follows: 1. The largest portion of the workers, 20.2% of the questioned employees, were observed to lie at age 20. 2. Regarding their formal education, 76.0% of them had completed middle school. while only 7. 1% had graduated from high school, . 3. 63.0% receive 7-8 hrs. of sleep a day while 18.4% receive S-6 hrs. of sleep a day. 4. 36.4% spend leisure time reading: while 15.5% spend it resting and thinking. 5. 53.8% of them live in the company′s dormitory and 31.6% live at home. 6. Time spent in travel to work: 32.8% spent 40-49 min., 23.6% spent 10-29 min. 7. The shift times were reported as: 44.1% wonting from 8 A.M. to 4 P.M. and 33.9% working from 6. A.M. to 2. P.M. which is what they are doing now. 8. Regarding symptoms of fatigue: 1) Physical symptoms were: 48.3% complained of "feeling bean in the legs, ", and 39.3% complained of "general exhaustion. " 2) Psychological symptoms were: 37.6% said that "it is boring to talk"and 26.3% said" they had a desire to be alone". 3) Nitrogenic symptoms were 49.7% complained of "asthenopia"and 37.0% complained of"vertigo and "staggering legs". 9. When asked about the most fatiguing time during work, the following information was reported: 25.2% felt the first hour in the morning was most fatiguing while 22.9% felt the sixth hour in the evening, and 22.8% eelt the fifth hour at night was. 10. 38.4% complained of sleepiness at 3 A.M. and 35.0% at 4 A.M. during night work. 11. 38.1% found Sunday the most fatiguing work day and 20.% found Monday. 12. The results of the effects of their work on certain diseases: 51.1% showed those with anemia as most effected by work. 13. In their Response to the question, "do you eat breakfast\ulcorner"57.0%, the largest portion, answered, " none at all ": 36.3%, enough. 14. Regarding the accident rate relating to the length of time employed at the company 28.5% was the highest accident rate from 5year to 6 year. As a result of this study, it could be concluded that the employer should consider the following points: 1. employ according to the worker′s vocational aptitude. 2. adjust the shifts. 3. offer rest time and off days, and establish recreational facilities. In the end we can contribute to the promotion of the workers of the workers and to the prevention of accidents due to industrial fatigue.

  • PDF

A Real-time Point-to-Point Shortest Path Search Algorithm Based on Traveling Time (주행시간 기반 실시간 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.131-140
    • /
    • 2012
  • The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

OD trip matrix estimation from urban link traffic counts (comparison with GA and SAB algorithm) (링크관측교통량을 이용한 도시부 OD 통행행렬 추정 (GA와 SAB 알고리즘의 비교를 중심으로))

  • 백승걸;김현명;임용택;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.6
    • /
    • pp.89-99
    • /
    • 2000
  • To cope with the limits of conventional O-D trip matrix collecting methods, several approaches have been developed. One of them is bilevel Programming method Proposed by Yang(1995), which uses Sensitivity Analysis Based(SAB) algorithm to solve Generalized Least Square(GLS) problem. However, the SAB a1gorithm has revealed two critical short-comings. The first is that when there exists a significant difference between target O-D matrix and true O-D matrix, SAB algorithm may not produce correct solution. This stems from the heavy dependance on the historical O-D information, in special when gravel Patterns are dramatically changed. The second is the assumption of iterative linear approximation to original Problem. Because of the approximation, SAB algorithm has difficulty in converging to Perfect Stackelberg game condition. So as to avoid the Problems. we need a more robust and stable solution method. The main purpose of this Paper is to show the problem of the dependency of Previous models and to Propose an alternative solution method to handle it. The Problem of O-D matrix estimation is intrinsically nonlinear and nonconvex. thus it has multiple solutions. Therefore it is necessary to require a method for searching globa1 solution. In this paper, we develop a solution algorithm combined with genetic algorithm(GA) , which is widely used as probabilistic global searching method To compare the efficiency of the algorithm, SAB algorithm suggested by Yang et al. (1992,1995) is used. From the results of numerical example, the Proposed algorithm is superior to SAB algorithm irrespective of travel patterns.

  • PDF

A Variable Speed Limits Operation Model to Minimize Confliction at a Bottleneck Section by Cumulative Demand-Capacity Analysis (대기행렬이론을 이용한 병목지점 충돌위험 저감 가변속도제어 운영모형)

  • LEE, Junhyung;SON, Bongsoo
    • Journal of Korean Society of Transportation
    • /
    • v.33 no.5
    • /
    • pp.478-487
    • /
    • 2015
  • This study proposed a Variable Speed Limits(VSL) algorithm to use traffic information based on Cumulative Demand-Capacity Analysis and evaluated its performance. According to the analysis result, the total of delay consisted of 3 separate parts. There was no change in total travel time although the total of delay decreased. These effects was analysed theoretically and then, evaluated through VISSIM, a microscopic simulator. VISSIM simulation results show almost same as those of theoretical analysis. Furthermore in SSAM analysis with VISSIM simulation log, the number of high risk collisions decreased 36.0 %. However, the total delay decrease effect is not real meaning of decrease effect because the drivers' desired speed is same whether the VSL model is operated or not. Nevertheless this VSL model maintains free flow speed for longer and increases the cycle of traffic speed fluctuation. In other words, this is decrease of delay occurrence and scale. The decrease of speed gap between upstream and downstream stabilizes the traffic flow and leads decrease number of high risk collision. In conclusion, we can expect increase of safety through total delay minimization according to this VSL model.

An analysis on the development of a new multicasting method for telecommunication networking (텔레커뮤니케이션 네트워크상 멀티캐스팅 신기술 개발 분석)

  • Cho, Myeong-Rai
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.5 no.3
    • /
    • pp.27-45
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast routing protocol that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

Retrospective Appraisal of Cancer Patients from Vientiane Capital City, Lao People's Democratic Republic (PDR), Seeking Treatment in Thailand

  • Chaleunvong, Kongmany;Kamsa-ard, Supot;Suwanrungruang, Krittika;Wiangnon, Surapon;Sychareun, Vanphanom;Alounlangsy, Phetsamone;Durham, Jo;Promthet, Supannee
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.14 no.9
    • /
    • pp.5435-5440
    • /
    • 2013
  • Background: Recent estimates suggest that in the Lao People's Democratic Republic (Lao PDR) the burden of cancer in terms of DALYs lost is amongst the highest in South East Asia. As such, increasingly cancer is becoming an important public health concern in the country. Lao PDR however has no population-based cancer registry and only one hospital-based registry. Cancer treatment within the country is extremely limited. Patients who can, may travel to neighboring countries for treatment, but little information about this is available in the country. The aim of this study was to estimate some of the otherwise largely unknown parameters of the cancer burden in Lao PDR. Materials and Methods: This is a retrospective, descriptive study based on the records of 847 Lao cancer cases treated with surgery, radiation and chemotherapy at Srinagarind Hospital, Khon Kaen University, in Thailand between 1988 and 2010. Results: The annual rate of registration of Lao cancer cases fluctuated, but showed an increasing trend. Most cancers were diagnosed by histology (65.2%), and a combination of endoscopy and radiology (15.6%). In most cases (70.2%) the stage of cancer at diagnosis could not be determined. In those whose stage could be identified, 54.0% were at the final stage (Stage IV). Among males, the commonest cancer sites were the liver (16.1%), blood (12.3%) and nasopharynx (10.6%). Those in female patients were the cervix (22.2%), breast (14.6%) and blood (8.1%). Conclusions: This study indicates that despite some fluctuations, the number of Lao cancer patients presenting at Srinagarind Hospital, Khon Kaen, gradually increased between 1988 and 2010. The unfavorable pattern of late-stage cancer diagnosis among male and female patients suggests a need for cancer control interventions and the establishment of cancer registration and treatment facilities within Lao PDR.

Serologic Survey of Toxoplasmosis in Seoul and Jeju-do, and a Brief Review of Its Seroprevalence in Korea

  • Lim, Hyemi;Lee, Sang-Eun;Jung, Bong-Kwang;Kim, Min-Ki;Lee, Mi Youn;Nam, Ho-Woo;Shin, Jong-Gyun;Yun, Cheong-Ha;Cho, Han-Ik;Shin, Eun-Hee;Chai, Jong-Yil
    • Parasites, Hosts and Diseases
    • /
    • v.50 no.4
    • /
    • pp.287-293
    • /
    • 2012
  • Knowledge of the prevalence of human Toxoplasma gondii infection is required in the Republic of Korea. In this study, we surveyed the seroprevalence of T. gondii infection and analyzed the risk factors associated with seropositivity among residents in 2 administrative districts; Seoul and the island of Jeju-do, which have contrasting epidemiologic characteristics. Sera and blood collected from 2,150 residents (1,114 in Seoul and 1,036 in Jeju-do) were checked for IgG antibody titers using ELISA and for the T. gondii B1 gene using PCR. In addition, participants completed a questionnaire that solicited information on gender, age, occupation, eating habits, history of contact with animals, and travel abroad. The T. gondii B1 gene was not detected in all residents examined. However, ELISA showed 8.0% (89 of 1,114 sera) positive for IgG antibodies against T. gondii in Seoul and 11.3% (117 of 1,036 sera) in Jeju-do. In both districts, the positive rates were higher in males than in females, and those 40-79 years of age showed higher rates than other ages. In Seoul, residents older than 70 years of age showed the highest positive rate, 14.9%, whereas in Jeju-do the highest prevalence, 15.6%, was in those in their sixties. The higher seropositive rate in Jeju-do than in Seoul may be related to eating habits and occupations. The present results and a review of related literature are indicative of an increased seroprevalence of T. gondii in Korea in recent years.

A Study on the Optimum Design of Horizontal Collectors in Floodplain Filtration (홍수터여과에서 집수관의 최적설계 연구)

  • Pi, Seong-Min;Kim, Seung-Hyun
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.34 no.6
    • /
    • pp.430-437
    • /
    • 2012
  • In order to obtain information on the design parameters of the horizontal laterals in floodplain filtration, laboratory-scale sand-box experiments were performed where the head distributions on the laterals and the groundwater profiles were measured according to the change in parameters including lateral diameter, hydraulic conductivity of the sand, water level at the well and raw-water supply rate. Measured data were analyzed using a numerical code in order to identify the discharge intensity distribution along the laterals. It was observed from the result that the lowering of the water level at the well had minimal adverse effect on the performance of the floodplain filtration. Results also elucidated that the low conveyance of the laterals to transmit the filtrate was compensated and supplemented by a natural augmentation in horizontal conveyance through the aquifer when the raw-water supply rate exceeded the adequate recovery rate. With this mechanism, the water quality is expected to improve further since the travel distance through the aquifer is amplified. Based on these findings it can be suggested that the diameter of the lateral used in the floodplain filtration may be smaller than those in riverbank/bed filtration. It was also found that the ratio between the head loss occurring in a lateral and the total head loss in the floodplain filtration was proportional to the exit velocities of the laterals, which may be used to design and/or evaluate the lateral in floodplain filtration.

Overlay Multicast Tree Building Algorithm for MDST and MST in Complete Network (완전 연결된 네트워크에서 MDST와 MST 목적을 갖는 오버레이 멀티캐스트 트리구현 알고리즘)

  • Cho, Myeong-Rai
    • 한국벤처창업학회:학술대회논문집
    • /
    • 2010.08a
    • /
    • pp.71-89
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast tree building problem that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

Geostatistical Interpretation of Sparsely Obtained Seismic Data Combined with Satellite Gravity Data (탄성파 자료의 해양분지 구조 해석 결과 향상을 위한 인공위성 중력자료의 지구통계학적 해석)

  • Park, Gye-Soon;Oh, Seok-Hoon;Lee, Heui-Soon;Kwon, Byung-Doo;Yoo, Hai-Soo
    • Geophysics and Geophysical Exploration
    • /
    • v.10 no.4
    • /
    • pp.252-258
    • /
    • 2007
  • We have studied the feasibility of geostatistics approach to enhancing analysis of sparsely obtained seismic data by combining with satellite gravity data. The shallow depth and numerous fishing nets in The Yellow Sea, west of Korea, makes it difficult to do seismic surveys in this area. Therefore, we have attempted to use geostatistics to integrate the seismic data along with gravity data. To evaluate the feasibility of this approach, we have extracted only a few seismic profile data from previous surveys in the Yellow Sea and performed integrated analysis combining with the results from gravity data under the assumption that seismic velocity and density have a high physical correlation. First, we analyzed the correlation between extracted seismic profiles and depths obtained from gravity inversion. Next, we transferred the gravity depth to travel time using non-linear indicator transform and analyze residual values by kriging with varying local means. Finally, the reconstructed time structure map was compared with the original seismic section given in the previous study. Our geostatistical approach demonstrates relatively satisfactory results and especially, in the boundary area where seismic lines are sparse, gives us more in-depth information than previously available.