• Title/Summary/Keyword: 여행자

Search Result 156, Processing Time 0.034 seconds

The study of Estimation model for the short-term travel time prediction (단기 통행시간예측 모형 개발에 관한 연구)

  • LEE Seung-jae;KIM Beom-il;Kwon Hyug
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.3 no.1 s.4
    • /
    • pp.31-44
    • /
    • 2004
  • The study of Estimation model for the short-term travel time prediction. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Before providing a dynamic shortest path finding, the prediction model should be verified. To verify the prediction model, three models such as Kalman filtering, Stochastic Process, ARIMA. The ARIMA model should adjust optimal parameters according to the traffic conditions. It requires a frequent adjustment process of finding optimal parameters. As a result of these characteristics, It is difficult to use the ARIMA model as a prediction. Kalman Filtering model has a distinguished prediction capability. It is due to the modification of travel time predictive errors in the gaining matrix. As a result of these characteristics, the Kalman Filtering model is likely to have a non-accumulative errors in prediction. Stochastic Process model uses the historical patterns of travel time conditions on links. It if favorably comparable with the other models in the sense of the recurrent travel time condition prediction. As a result, for the travel time estimation, Kalman filtering model is the better estimation model for the short-term estimation, stochastic process is the better for the long-term estimation.

  • PDF

Enterotoxigenic Bacteroides fragilis-Associated Diseases and Detection (Enterotoxigenic Bacteroides fragilis에 의한 질환과 검출)

  • Gwon, Sun-Yeong;Jang, In-Ho;Rhee, Ki-Jong
    • Korean Journal of Clinical Laboratory Science
    • /
    • v.47 no.4
    • /
    • pp.161-167
    • /
    • 2015
  • These commensal intestinal bacteria can enhance the immune system and aid in nutrient absorption but can also act as opportunistic pathogens. Among these intestinal bacteria, the anaerobic Bacteroides fragilis are divided into enterotoxigenic B. fragilis (ETBF) which secrete the B. fragilis toxin (BFT) and non-enterotoxigenic B. fragilis (NTBF) which do not secrete BFT. ETBF can cause diarrhea and colitis in both humans and livestock but can also be found in asymptomatic individuals. ETBF is predominantly found in patients with inflammatory diarrheal diseases and traveller's diarrhea. Several clinical studies have also reported an increased prevalence of ETBF in human patients with inflammatory bowel disease (IBD), colitis and colorectal cancer. In small animal models (C57BL/6 wild-type mice, germ-free mice, multiple intestinal neoplasia (Min) mice, rabbits and Mongolian gerbils), ETBF have been found to initiate and/or aggravate IBD, colitis and colorectal cancer. BFT induces E-cadherin cleavage in intestinal epithelial cells resulting in loss of epithelial cell integrity. Subsequent activation of the ${\beta}$-catenin pathway leads to increased cellular proliferation. In addition, ETBF causes acute and chronic colitis in wild-type mice as well as enhances tumorigenesis in Min mice via activation of the Stat3/Th17 pathway. Currently, ETBF can be detected using a BFT toxin bioassay and by PCR. Advances in molecular biological techniques such as real-time PCR have allowed both researchers as well as clinicians to rapidly detect ETBF in clinical samples. The emergence of more sensitive techniques will likely advance molecular insight into the role of ETBF in colitis and cancer.

An ergonomic evaluation of the computer car (컴퓨터차의 인간공학적 평가)

  • 권영국
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.04a
    • /
    • pp.483-492
    • /
    • 1993
  • 미래의 차의 선택사항이 될 여행정보시스템을 설치하여 그 성능의 인간공학적 조사를 수행하였다. 이 시스템을 실제로 GM자동차 Oldsmobile Toronado형 100대에 설치하여 사용자가 얼마나 쉽게, 빨리 그리고 안락하게 갈 수 있고, 어떻게 하면 좀 더 이것을 인간공학적으로 향상시킬수 있는 가를 연구하였다. 100대중 23대는 대학교에서 연구를 하고 나머지는 AAA회사의 회원권을 가진 지역사용자들에게 AAA회사와 AVIS회사를 통하여 대여를 하여 컴퓨터차(TravTek시스템)의 성능과 효율성을 시험하였다. 그 내용을 살펴보면, 차에 부착된 컴퓨터의 컬러화면으로 사용자에게 도로를 보여주고, 컴퓨터가 최단거리를 제시하여 운전자에게 컴퓨터음성과 화면으로 길을 안내한다. 그 파급효과로 도로 체증현상을 막고, 기름의 낭비도 절약하고, 밤에도 안전하게 운행할 수 있게 할 뿐만아니라 처음보는 거리라고 하더라도 컴퓨터가 안내하면서 목적지까지 무사히 도착할 수 있게 하여 준다. 이러한 시스템을 설치한 차를 타고 여행할 때, 여행자가 과연 얼마나 안락하게 여행할 수 있으며, 도로의 체증현상을 줄이고, 사고를 예방하며, 차의 설계와 목적이 인간공학적으로 합당한 가를 알아보고자 하는 연구이다. 인간공학적 평가 인자들은 (1) 운전자의 수행도, (2) 사용자 선호도, (3) 사용자 인식, (4) 운행정보등이다. 그리고 컴퓨터음성을 사용하였을 때와 사용하지 않았을 때의 두가지 경우와 (1) 움직이는 컴퓨터지도를 사용하였을 때 (2) 단순화한 도로안내를 사용하였을 때, (3) 컴퓨터 지도를 사용하지 않았을 경우(종이지도사용)에 관해 위의 4가지 인간공학적 인자들을 평가하고자 한다. 이 연구는 아직도 진행중이라 발표하고자 하는 논문역시 현재까지의 연구결과를 토대로 발표하는 것이므로 완전한 결론을 내릴 수는 없고, 진행과 정의내용과 토의사항과 잠정적인 결론을 제시하고자 한다. 의거한 작업순서 결정을 위해 우선 BB의 상한을 구하는 연구를 행했다. 이를 위해 우선 단일작업장에서 야기될 수 있는 모든 상황을 고려한 최적 작업순서 결정규칙을 연구했으며, 이의 증명을 위해 이 규칙에 의거했을 때의 보완작업량이 최소가 된다는 것을 밝혔다. 보완작업 계산의 효율성을 제고하기 위해 과부하(violation)개념을 도입하였으며, 작업유형이 증가된 상황에서도 과부하 개념이 보완작업량을 충분히 반영할 수 있음을 밝혔다. 본 연구에서 제시한 최적 작업순서 규칙에 의거했을 때 야기될 수 있는 여러가지 경우의 과부하를 모두 계산했다. 앞에서 개발된 단일작업량의 최적 작업순서 결정규칙을 이용하여 다작업장의 문제를 실험했다. 이 문제는 규모가 매우 크므로 Branch & Bound를 이용하였으며, 각 가지에서 과부하량이 최적인 경우만을 고려하는 휴리스틱을 택하여 실험자료를 이용하여 여러 회 반복실험을 행했다. 그리고 본 연구의 성과를 측정하기 위해 휴리스틱 기법시 소요되는 평균 CPU time 범위에서, 랜덤 작업순서에 따른 작업할당을 반복실험하여 이중 가장 좋은 해와 비교했다. 그러나 앞으로 다작업장 문제를 다룰 때, 각 작업장 작업순서들의 상관관계를 고려하여 보다 개선된 해를 구하기 위한 연구가 요구된다. 또한, 준비작업비용을 발생시키는 작업장의 작업순서결정에 대해서도 연구를 행하여, 보완작업비용과 준비비용을 고려한 GMMAL 작업순서문제를 해결하기 위한 연구가 수행되어야 할 것이다.로 이루어 져야 할 것이다.태를 보다 효율적으로 증진시킬 수 있는 대안이 마련되어져야 한다고 사료된다.$\ulcorner$순응$\lrcorner$의 범위를 벗어나지 않는다. 그렇기 때문에도 $\ulcorner$순응$\lrcorner$$\ulcorner$표현$\lrcorner$

  • PDF

Invigorating Local Festival Directing -Case Study of Namhaean Byeolsingut- (지역축제 활성화를 위한 축제의 연출 방안 모색 -남해안 별신굿을 중심으로-)

  • Lee, Ki-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.1
    • /
    • pp.128-138
    • /
    • 2014
  • Local festivals quite often give their visitors and local residents a good opportunity to experience the regional culture thoroughly. Also, the festivals empower the cultural pride and communal sociality, and create new jobs improving local economy. In Korea, more than 700 local festivals are held every year. Each festival is organized and operated upon all different purpose and mission. It is unfortunate, however, that many festivals fail to balance between making profits and accomplishing their purpose. Festival's marketing plan and content management should be cohesive, but at the same time, they also should be different depending on the festival's purpose and program. Especially in case of performance natured festivals, the role and function of festival directing should be more weighed on content management. Namhaean Byeolsingut is one of performance natured festivals, in which its archetype or primitive form is well maintained. This study observes the primitive form of NB from the director's viewpoint, and then provides a solid foundation on how those main characteristics of NB could be applied to invigorating local festival directing. The directing suggestions here are motivated by NB's ritual, performative, and play form.

An Adaptive Priority-based Sequenced Route Query Processing Method in Road Networks (도로 네트워크 환경에서 적응적 우선순위 기반의 순차적 경로 처리 기법)

  • Ryu, Hyeongcheol;Jung, Sungwon
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.12
    • /
    • pp.652-657
    • /
    • 2014
  • Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

An Approximate Shortest Path Re-Computation Method for Digital Road Map Databases in Mobile Computing Environments (모바일 컴퓨팅 환경에서의 디지털 로드맵 데이타베이스를 위한 근접 최단 경로 재계산 방법)

  • 김재훈;정성원;박성용
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.296-309
    • /
    • 2003
  • One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

Communal Ontology of Landmarks for Urban Regional Navigation (도시 지역 이동을 위한 랜드마크의 공유 온톨로지 연구)

  • Hong, Il-Young
    • Journal of the Korean Geographical Society
    • /
    • v.41 no.5 s.116
    • /
    • pp.582-599
    • /
    • 2006
  • Due to the growing popularity of mobile information technology, more people, especially in the general public, have access to computerized geospatial information systems for wayfinding tasks or urban navigation. One of the problems with the current services is that, whether the users are exploring or navigating, whether they are travelers who are totally new to a region or long-term residents who have a fair amount of regional knowledge, the same method is applied and the direction are given in the same way. However, spatial knowledge for a given urban region expands in proportion to residency. Urban navigation is highly dependent on cognitive mental images, which is developed through spatial experience and social communication. Thus, the wayfinding service for a regional community can be highly supported, using well-known regional places. This research is to develop the framework for urban navigation within a regional community. The concept of communal ontology is proposed to aid in urban regional navigation. The experimental work was implemented with case study to collect regional landmarks, develop the ontological model and represent it with formal structure. The final product of this study will provide the geographical information of a region to the other agent and be the fundamental information structure for cognitive urban regional navigation.

Increasing Transnational Threats and Terrorism and Establishment of Integrated Border Security Systems: Focused on U.S., Canada and Australia (초국가적 위협 및 테러리즘 증가와 통합국경안보체계 구축: 미국, 캐나다, 호주를 중심으로)

  • Yoon, Taeyoung
    • Convergence Security Journal
    • /
    • v.17 no.4
    • /
    • pp.69-78
    • /
    • 2017
  • Since the September 11, 2001, transnational crimes and terrorism have increased, the importance of border security has been emphasized and integrated CIQ capability has been required. The U.S., Canada, and Australia are consolidating CIQ to strengthen border security, focusing on strengthening travelers and goods immigration control and airports, ports and land border security. In 2003, the U.S. established the Customs and Border Protection(CBP) under the Department of Homeland Security. Canada also established the Canada Border Services Agency(CBSA) under the Public Safety Canada in 2003. The Australian Customs and Border Protection Service was integrated with the Department of Immigration and Border Protection(DIBP) and the Australian Border Force was established in 2015. However, Korea operates a distributed border management system for each CIQ task which is unable to respond to complex border threats such as illegal immigration, entry of terrorists, smuggling of drugs, and gun trade in the airports, ports and land borders. In order to solve this problem, it is possible to consider integrating sequentially the customs and quarantine services which have high similarities, and to integrate the entire CIQ tasks with the Korea Customs Service delegated to the immigration control duties in the mid to long term. There is also a plan to benchmark the CIQ single accountability agencies in the U.S., Canada, and Australia in accordance with the Korean situation and to establish a new integrated border security organization.

The Development of Travel Demand Nowcasting Model Based on Travelers' Attention: Focusing on Web Search Traffic Information (여행자 관심 기반 스마트 여행 수요 예측 모형 개발: 웹검색 트래픽 정보를 중심으로)

  • Park, Do-Hyung
    • The Journal of Information Systems
    • /
    • v.26 no.3
    • /
    • pp.171-185
    • /
    • 2017
  • Purpose Recently, there has been an increase in attempts to analyze social phenomena, consumption trends, and consumption behavior through a vast amount of customer data such as web search traffic information and social buzz information in various fields such as flu prediction and real estate price prediction. Internet portal service providers such as google and naver are disclosing web search traffic information of online users as services such as google trends and naver trends. Academic and industry are paying attention to research on information search behavior and utilization of online users based on the web search traffic information. Although there are many studies predicting social phenomena, consumption trends, political polls, etc. based on web search traffic information, it is hard to find the research to explain and predict tourism demand and establish tourism policy using it. In this study, we try to use web search traffic information to explain the tourism demand for major cities in Gangwon-do, the representative tourist area in Korea, and to develop a nowcasting model for the demand. Design/methodology/approach In the first step, the literature review on travel demand and web search traffic was conducted in parallel in two directions. In the second stage, we conducted a qualitative research to confirm the information retrieval behavior of the traveler. In the next step, we extracted the representative tourist cities of Gangwon-do and confirmed which keywords were used for the search. In the fourth step, we collected tourist demand data to be used as a dependent variable and collected web search traffic information of each keyword to be used as an independent variable. In the fifth step, we set up a time series benchmark model, and added the web search traffic information to this model to confirm whether the prediction model improved. In the last stage, we analyze the prediction models that are finally selected as optimal and confirm whether the influence of the keywords on the prediction of travel demand. Findings This study has developed a tourism demand forecasting model of Gangwon-do, a representative tourist destination in Korea, by expanding and applying web search traffic information to tourism demand forecasting. We compared the existing time series model with the benchmarking model and confirmed the superiority of the proposed model. In addition, this study also confirms that web search traffic information has a positive correlation with travel demand and precedes it by one or two months, thereby asserting its suitability as a prediction model. Furthermore, by deriving search keywords that have a significant effect on tourism demand forecast for each city, representative characteristics of each region can be selected.

A Study of Driver's Response to Variable Message Sign Using Evolutionary Game Theory (진화 게임을 이용한 VMS 정보에 따른 운전자의 행태 연구)

  • Kim, Joo Young;Na, Sung Yong;Lee, Seungjae;Kim, Youngho
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.5
    • /
    • pp.554-566
    • /
    • 2014
  • An objective of VMS(Variable Message Signs) is to make transportation system effective specifically for driver's path selection. The traffic solutions including a VMS problem can be modeled through Game Theory, however, the majority of the studies can not model various driver's response according to VMS information in game theory. So, this paper tries to analyze a driver's response according to VMS traffic informations through evolutionary game theory. We apply a behavior characteristics of driver to evolutionary game theory, then finds drivers are only accepting in case of the biggest pay-off, and if a traffic flow finds a balance over time, ratio of accepting information is converged as an evolutionary stable state gradually. Consequently, the strategy of the other drivers such as traffic problems can not be predicted accurately. In case, drivers repeat between groups and reasonable judgment by the experience, we expect that VMS can provide strategic information through evolutionary game theory.