• Title/Summary/Keyword: Traveler

Search Result 144, Processing Time 0.027 seconds

WiBEEM Addressing Scheme Based on NAA Algorithm for High-Speed Mobility of USN Devices

  • Jeon, Ho-In
    • Journal of Ubiquitous Convergence Technology
    • /
    • v.1 no.1
    • /
    • pp.42-46
    • /
    • 2007
  • In this paper, we proposed an efficient short address allocation mechanism for WiBEEM devices using NAA(Next Address Available) algorithm. The proposed addressing mechanism is based upon the NAA information that is delivered over the beacons every time it is transmitted at the beginning of each super-frame. The NAA-based addressing mechanism is not a systematic way of allocating short addresses to newly joining devices and thus tree-routing cannot be supported. However, it has great advantages when U-City core services including U-Parking Lot System or ATIS(Advanced Traveler Information System) services that require high-speed mobility are considered. Moreover, the proposed addressing mechanism can provide significant expandability of the wireless network to various applications and fast device discovery.

  • PDF

Train Scheduling and Rescheduling In Pakistan

  • Abid, Malik Muneeb;Khan, Muhammad Babar
    • International Journal of Railway
    • /
    • v.6 no.1
    • /
    • pp.7-12
    • /
    • 2013
  • This paper provides an overview of Pakistan Railways scheduling and rescheduling. First of all, Pakistan Railways is introduced with its brief history and importance in this country. Assets of this network with passengers and freight using this are given. Current hope less situation is leading to privatization of this system as well as promoting short distance traveler to use road and Government efforts to retain is also presented. Train scheduling in Pakistan is being done manually, based on manual time distance graph preparation and resolution of conflicts based on manager's experience and ability. In Real-time management of this traffic Lahore head office is connected with six control stations in the Pakistan, decision for resolution of any disturbance is coordinated among them. It is recommended that computer aided tools must be developed for this system to help traffic managers and it is needed to invest on the segments to increase their speed limits which might attract passengers to use this mode of transportation with high priority.

Intelligent Immigration Control System by Using Passport Recognition and Face Verification

  • Kim, Kwang-Beak
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.240-246
    • /
    • 2006
  • This paper proposes the intelligent immigration control system that authorizes the traveler through immigration and detects forged passports by using automatic recognition of passport codes, the passport photo and face verification. The proposed system extracts and deskewes the areas of passport codes from the passport image. This paper proposes the novel ART algorithm creating the adaptive clusters to the variations of input patterns and it is applied to the extracted code areas for the code recognition. After compensating heuristically the recognition result, the detection of forged passports is achieved by using the picture and face verification between the passport photo extracted from the passport image and the picture retrieved from the database based on the recognized codes. Due to the proposed ART algorithm and the heuristic refinement, the proposed system relatively shows better performance.

A Hybrid Model of $A^*$ Search and Genetic Algorithms for ATIS under Multiple Objective Environment (다목적 환경에서의 ATIS 운영을 위한 $A^*$ 탐색 알고리듬과 유전자 알고리듬의 혼합모형)

  • Chang, In-Seong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.421-430
    • /
    • 2000
  • This paper presents a new approach which uses $A^*$ search and genetic algorithms for solving large scale multi-objective shortest path problem. The focus of this paper is motivated by the problem of finding Pareto optimal paths for an advanced traveler information system(ATIS) in the context of intelligent transportation system(ITS) application. The individual description, the decoding rule, the selection strategy and the operations of crossover and mutation are proposed for this problem. The keynote points of the algorithm are how to represent individuals and how to calculate the fitness of each individual. The high performance of the proposed algorithm is demonstrated by computer simulations.

  • PDF

Impacts of Local Land Use on Individual Modal Choice

  • Yang, Hee Jin
    • Journal of Urban Science
    • /
    • v.9 no.2
    • /
    • pp.63-68
    • /
    • 2020
  • In recent years, the planning of livable communities has emerged as a new paradigm. The concept of livable communities is related to both the spatial balance of working, playing, and living and the promotion of green modes of transportation, such as walking and biking. This study uses a disaggregate travel survey conducted by the Seoul Metropolitan Area in 2006. I applied a multi-level random intercept logit model to estimate the effects of land-use characteristics on the choice of green modes, holding a traveler's socio-demographic characteristics constant. The empirical results show that higher density and more mixed land-use development encourages people to walk and bike even when individuals have the same socio-economic characteristics. This paper demonstrates that land-use planning by itself can play a role in the creation of livable cities and the decline of greenhouse gas production.

Indirect Edification through Trans-Eurasian Travelogues: Focus on the Episodes of Carpets in the Journeys of Different Religions

  • Jin Han JEONG
    • Acta Via Serica
    • /
    • v.8 no.1
    • /
    • pp.55-70
    • /
    • 2023
  • Carpets are a useful tool for highlighting the cultural uniqueness of a region because their characteristic usage often reveals distinctive natural features of the place or the unique cultural identity of a group. Investigating anecdotes and associated patterns found in three medieval trans-Eurasian travelogues, this paper focuses on observations made by the Chinese Buddhist monk, Faxian, the Sunni pilgrim and scholar, Ibn Battuta, and Marco Polo, the Venetian merchant examining their thoughts, observations, and perspectives on carpet-related customs in their experienced contexts. In particular, this manuscript touches on the controversies, impacts, and narratives associated with carpet practices observed in each travel writer's context respectively, concluding that each traveler shows several things in common rather than showing different patterns depending on the characteristics of their religion. Overall, they observed the uses of carpets according to their jobs and travel purposes and appropriately detailed related episodes if the intended purpose and context matched the uses.

Analysis Transportation Network Using Traditional Four-step Transportation Modeling : A Case Study of Mandalay City, Myanmar (전통적인 4단계 교통수요 예측 모형을 활용한 교통망 분석 - 미얀마 만달레이시 중심으로)

  • Yoon, Byoung-Jo;WUT YEE LWIN;Lee, Sun-min
    • Proceedings of the Korean Society of Disaster Information Conference
    • /
    • 2023.11a
    • /
    • pp.259-260
    • /
    • 2023
  • The rapid urbanization and modernization observed in countries like Myanmar have led to significant concerns regarding traffic congestion, especially in urban areas. This study focuses on the analysis and revitalization of urban transport in selected areas of Myanmar. The core of urban transportation planning lies in travel forecasting, which employs models to predict future traffic patterns and guide decisions related to road capacity, transit services, and land use policies. Travel demand modeling involves a series of mathematical models that simulate traveler behavior and decision-making within a transportation system, including highways, transit options, and policies. The paper offers an overview of the traditional four-step transportation modeling system, utilizing a simplified transport network in the context of Mandalay City, Myanmar.

  • PDF

Designing an Intelligent Advertising Business Model in Seoul's Metro Network (서울지하철의 지능형 광고 비즈니스모델 설계)

  • Musyoka, Kavoya Job;Lim, Gyoo Gun
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.4
    • /
    • pp.1-31
    • /
    • 2017
  • Modern businesses are adopting new technologies to serve their markets better as well as to improve efficiency and productivity. The advertising industry has continuously experienced disruptions from the traditional channels (radio, television and print media) to new complex ones including internet, social media and mobile-based advertising. This case study focuses on proposing intelligent advertising business model in Seoul's metro network. Seoul has one of the world's busiest metro network and transports a huge number of travelers on a daily basis. The high number of travelers coupled with a well-planned metro network creates a platform where marketers can initiate engagement and interact with both customers and potential customers. In the current advertising model, advertising is on illuminated and framed posters in the stations and in-car, non-illuminated posters, and digital screens that show scheduled arrivals and departures of metros. Some stations have digital screens that show adverts but they do not have location capability. Most of the current advertising media have one key limitation: space. For posters whether illuminated or not, one space can host only one advert at a time. Empirical literatures show that there is room for improving this advertising model and eliminate the space limitation by replacing the poster adverts with digital advertising platform. This new model will not only be digital, but will also provide intelligent advertising platform that is driven by data. The digital platform will incorporate location sensing, e-commerce, and mobile platform to create new value to all stakeholders. Travel cards used in the metro will be registered and the card scanners will have a capability to capture traveler's data when travelers tap their cards. This data once analyzed will make it possible to identify different customer groups. Advertisers and marketers will then be able to target specific customer groups, customize adverts based on the targeted consumer group, and offer a wide variety of advertising formats. Format includes video, cinemagraphs, moving pictures, and animation. Different advert formats create different emotions in the customer's mind and the goal should be to use format or combination of formats that arouse the expected emotion and lead to an engagement. Combination of different formats will be more effective and this can only work in a digital platform. Adverts will be location based, ensuring that adverts will show more frequently when the metro is near the premises of an advertiser. The advertising platform will automatically detect the next station and screens inside the metro will prioritize adverts in the station where the metro will be stopping. In the mobile platform, customers who opt to receive notifications will receive them when they approach the business premises of advertiser. The mobile platform will have indoor navigation for the underground shopping malls that will allow customers to search for facilities within the mall, products they may want to buy as well as deals going on in the underground mall. To create an end-to-end solution, the mobile solution will have a capability to allow customers purchase products through their phones, get coupons for deals, and review products and shops where they have bought a product. The indoor navigation will host intelligent mobile-based advertisement and a recommendation system. The indoor navigation will have adverts such that when a customer is searching for information, the recommendation system shows adverts that are near the place traveler is searching or in the direction that the traveler is moving. These adverts will be linked to the e-commerce platform such that if a customer clicks on an advert, it leads them to the product description page. The whole system will have multi-language as well as text-to-speech capability such that both locals and tourists have no language barrier. The implications of implementing this model are varied including support for small and medium businesses operating in the underground malls, improved customer experience, new job opportunities, additional revenue to business model operator, and flexibility in advertising. The new value created will benefit all the stakeholders.

A Simulation-Based Investigation of an Advanced Traveler Information System with V2V in Urban Network (시뮬레이션기법을 통한 차량 간 통신을 이용한 첨단교통정보시스템의 효과 분석 (도시 도로망을 중심으로))

  • Kim, Hoe-Kyoung
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.5
    • /
    • pp.121-138
    • /
    • 2011
  • More affordable and available cutting-edge technologies (e.g., wireless vehicle communication) are regarded as a possible alternative to the fixed infrastructure-based traffic information system requiring the expensive infrastructure investments and mostly implemented in the uninterrupted freeway network with limited spatial system expansion. This paper develops an advanced decentralized traveler information System (ATIS) using vehicle-to-vehicle (V2V) communication system whose performance (drivers' travel time savings) are enhanced by three complementary functions (autonomous automatic incident detection algorithm, reliable sample size function, and driver behavior model) and evaluates it in the typical $6{\times}6$ urban grid network with non-recurrent traffic state (traffic incident) with the varying key parameters (traffic flow, communication radio range, and penetration ratio), employing the off-the-shelf microscopic simulation model (VISSIM) under the ideal vehicle communication environment. Simulation outputs indicate that as the three key parameters are increased more participating vehicles are involved for traffic data propagation in the less communication groups at the faster data dissemination speed. Also, participating vehicles saved their travel time by dynamically updating the up-to-date traffic states and searching for the new route. Focusing on the travel time difference of (instant) re-routing vehicles, lower traffic flow cases saved more time than higher traffic flow ones. This is because a relatively small number of vehicles in 300vph case re-route during the most system-efficient time period (the early time of the traffic incident) but more vehicles in 514vph case re-route during less system-efficient time period, even after the incident is resolved. Also, normally re-routings on the network-entering links saved more travel time than any other places inside the network except the case where the direct effect of traffic incident triggers vehicle re-routings during the effective incident time period and the location and direction of the incident link determines the spatial distribution of re-routing vehicles.

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.