• 제목/요약/키워드: Process Route

검색결과 655건 처리시간 0.025초

A Route Search of Urban Traffic Network using Fuzzy Non-Additive Control (퍼지 비가법 제어를 이용한 도시 교통망의 경로 탐색)

  • 이상훈;김성환
    • Journal of Korean Society of Transportation
    • /
    • 제21권1호
    • /
    • pp.103-113
    • /
    • 2003
  • This paper shows alternative route search and preference route search for the traffic route search, and proposes the use of the fuzzy non-additive controller by the application of AHP(analytic hierarchy process). It is different from classical route search and notices thinking method of human. Appraisal element, weight of route is extracted from basic of the opinion gathering for the driving expert and example of route model was used for the finding of practice utility. Model evaluation was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure and Choquet fuzzy integral. Finally, alternative route search was possible to real time traffic route search for the well variable traffic environment, and preference route search showed reflection of traffic route search disposition for the driver individual. This paper has five important meaning. (1)The approach is similar to the driver's route selection decision process. (2)The approach is able to control of route appraisal criteria for the multiple attribute. (3)The approach makes subjective judgement objective by a non additive. (4)The approach shows dynamic route search for the alternative route search. (5)The approach is able to consider characteristics of individual drivers attributed for the preference route search.

An algorithm for finding a watchman route with minimum links in the characteristic polygons (특성 다각형에서 최소링크의 경비원 경로를 구하는 알고리즘)

  • Ryu, Sang-Ryul
    • The KIPS Transactions:PartA
    • /
    • 제9A권4호
    • /
    • pp.595-602
    • /
    • 2002
  • The watchman routes which an watchman patrols the interior of polygon moving along the route are classified to minimum length or minimum links. The watchman route with minimum links has minimum changes of direction in process. In this paper, we present an algorithm with $O(N^2)$ time for finding the watchman route with minimum links in the weakly visible polygons which have specific property.

Mathematical Elaboration Process of the Elementary Gifted Children's Board Game Re-creation in Group Project (모둠별 게임 변형을 통한 초등수학영재들의 수학적 정교화 과정 분석)

  • Sung, Ye Won;Song, Sang Hun
    • School Mathematics
    • /
    • 제15권3호
    • /
    • pp.619-632
    • /
    • 2013
  • One area where research is especially needed is their elaboration process and how they elaborate their idea as a group in a mathematical board game re-creation project. In this research, this process was named 'Mathematical Elaboration Process'. The purpose of this research is to understand how the gifted children elaborate their idea in a small group, and which idea can be chosen for a new board game when they are exposed to a project for making new mathematical board games using the what-if-not strategy. One of the gifted children's classes was chosen in which there were twenty students, and the class was composed of four groups in an elementary school in Korea. The researcher presented a series of re-creation game projects to them during the course of five weeks. To interpret their process of elaborating, the communication of the gifted students was recorded and transcribed. Students' elaboration processes were constructed through the interaction of both the mathematical route and the non-mathematical route. In the mathematical route, there were three routes; favorable thoughts, unfavorable thoughts and a neutral route. Favorable thoughts was concluded as 'Accepting', unfavorable thoughts resulted in 'Rejecting', and finally, the neutral route lead to a 'non-mathematical route'. Mainly, in a mathematical route, the reason of accepting the rule was mathematical thinking and logical reasons. The gifted children also show four categorized non-mathematical reactions when they re-created a mathematical board game; Inconsistency, Liking, Social Proof and Authority.

  • PDF

A Study on the describability of landmarks in route communication using virtual reality (가상현실을 이용한 루트 커뮤니케이션에서의 랜드마크의 설명 용이성(Describability)에 관한 연구)

  • 정진우
    • Archives of design research
    • /
    • 제16권2호
    • /
    • pp.255-270
    • /
    • 2003
  • The main goal of this study is to find the role of landmarks in route communication process and to explore the describability of landmarks, a linguistic factor of landmarks that was not noted frequently by previous wayfinding studies. Through analysis of landmarks in this study, the describability of landmarks was identified and this study hypothesized that the describability affects to the whole process of route communication. A virtual reality (VR) simulation test was conducted to examine the effect of the describability of landmarks in route communication. The independent variable was the describability of landmarks and landmarks. As dependent variables, the total time to find final destination and the number of errors were measured. Results showed that the describability of landmarks gives positive effect to the whole of route communication processes. Consequently, this study provides the solution of wayfinding problems in route communication and suggests the usage of landmarks as a prerequisite for planning spaces having the efficiency of wayfinding.

  • PDF

A Node-Disjoint Multi-Path Routing Protocol in AODV-based Mobile Ad-hoc Networks (AODV 기반 모바일 Ad-hoc 네트워크의 노드 Disjoint 다중경로 라우팅 프로토콜)

  • Kim, Tae-Hun;Chung, Shang-Hwa;Kang, Su-Young;Yoo, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제34권12B호
    • /
    • pp.1371-1379
    • /
    • 2009
  • In this paper, we propose a new multi-path routing protocol to provide reliable and stable data transmission in MANET that is composed of high-mobility nodes. The new multi-path routing establishes the main route by the mechanism based on AODV, and then finds the backup route that node-disjoint from the main route by making add nodes in the main route not participate in it. The data transmission starts immediately after finding the main route. And the backup route search process is taking place while data is transmitted to reduce the transmission delay. When either of the main route or the backup route is broken, data is transmitted continuously through the other route and the broken route is recovered to node-disjoint route by the route maintenance process. The result of the simulation based on the Qualnet simulator shows that the backup route exists 62.5% of the time when the main route is broken. And proposed routing protocol improved the packet transmission rate by 2~3% and reduced the end-to-end delay by 10% compared with AODV and AODV-Local Repair.

Analysis of Densification Process of Carbon/Carbon Composites with Pitch as an Impregnant

  • Oh, Seh-Min;Park, Yang-Duk
    • The Korean Journal of Ceramics
    • /
    • 제4권3호
    • /
    • pp.240-244
    • /
    • 1998
  • The analytical method was developed to calculate efficiency of densifying carbon/carbon (C/C) composites using coal tar pitch as a matrix precursor at each cyle. Three factors were defined in analyzing the densification process: impregnation efficiency, retention efficiency, and overall densification efficiency. The relationships developed were applied to the experimental results for three densification cycles of C/C composites with pitches as an impregnant to evaluate the factors which may depend on the impregnant and on the route of carbonization. The impregnation efficiency increased with the repeated process cycles whereas the retention efficiency decreased irrespective of the impregnant and carbonization route. Carbonization route P+A+G, in which pressure carbonizationl (P) and graphitization (G) were done before after atmospheric pressure carboniztion (A) respectively, using impregnant of high carbon yields was the most effective method in densifying C/C composites.

  • PDF

Digital Signage User Satisfaction Model: The Dual Effect of Technological Complexity

  • Lee, Mi-ah;Lee, Sooyeon;Ko, Eunju
    • Asia Marketing Journal
    • /
    • 제23권1호
    • /
    • pp.5-27
    • /
    • 2021
  • This paper seeks to suggest user satisfaction model of digital signage to see how new in-store technology can effectively lead to customers' shopping satisfaction in fashion retails. Authors in particular focus on technological complexity, which is expected to serve a subtle role in using digital signage. This study employed a scenario-based online survey. Interactive digital signage with virtual try-on and video-captures functions was used as stimuli. Data were collected from 320 respondents and 307 useable responses were analyzed to examine a proposed model. Research model compares dual paths of motivators: the extrinsic motivation route that leads from usefulness to shopping outcome satisfaction and intrinsic motivation route that leads from enjoyment to shopping process satisfaction. Technological complexity of digital signage indirectly and negatively influences shopping outcome and process satisfaction, mediated by usefulness and enjoyment, but directly and positively affects shopping process satisfaction. In omni-channel environments, the findings have implications for fashion retail managers in using digital signage to maximize customer satisfaction and to counterbalance the advantages and disadvantages of technological complexity.

A New Route Guidance Method Considering Pedestrian Level of Service using Multi-Criteria Decision Making Technique

  • Joo, Yong-Jin;Kim, Soo-Ho
    • Spatial Information Research
    • /
    • 제19권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.

A Study on Current Operating System and Development Process of Remote Island Public Service Route (낙도보조항로의 운영실태 및 발달과정 고찰)

  • Noh, Chang-Kyun;Jeong, Meoung-Seon
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • 제11권1호
    • /
    • pp.83-88
    • /
    • 2005
  • This study is about current operating system and development process if remote island route. 14 companies are providing safe transportation service for remote island residents with total 30 boots on Z7 routes. Each route transit analysis shows tint the number of passenger tends to increase every year. In order to enhance customer satisfaction, more constructive improvement is demanded, such as implementing operation evaluation on each charter service provider.1he result obtained from this study is to be utilized as basic document for remote island route development process in semi-long run basis.

  • PDF

PERFORMANCE ANALYSES OF PATH RECOVERY ROUTING PROTOCOLS IN AD HOC NETWORKS

  • Wu, Mary;Kim, Chong-Gun
    • Journal of applied mathematics & informatics
    • /
    • 제26권1_2호
    • /
    • pp.235-249
    • /
    • 2008
  • On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

  • PDF