• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 203
  • 148
  • 35
  • 16
  • 14
  • 14
  • 9
  • 7
  • 6
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • Tagged with
  • 510
  • 92
  • 81
  • 73
  • 66
  • 60
  • 59
  • 58
  • 57
  • 55
  • 52
  • 51
  • 51
  • 50
  • 48
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Graph searching and a generalized parking function

Kostic, Dimitrije Nenad 15 May 2009 (has links)
Parking functions have been a focus of mathematical research since the mid-1970s. Various generalizations have been introduced since the mid-1990s and deep relationships between these and other areas of mathematics have been discovered. Here, we introduced a new generalization, the G-multiparking function, where G is a simple graph on a totally ordered vertex set {1, 2, . . . , n}. We give an algorithm that converts a G-multiparking function into a rooted spanning forest of G by using a graph searching technique to build a sequence F1, F2, . . . , Fn, where each Fi is a subforest of G and Fn is a spanning forest of G. We also give another algorithm that converts a rooted spanning forest of G to a G-multiparking function and prove that the resulting functions (between the sets of G-multiparking functions and rooted spanning forests of G) are bijections and inverses of each other. Each of these two algorithms relies on a choice function , which is a function from the set of pairs (F,W) (where F is a subforest of G and W is a set of some of the leaves of F) into W. There are many possible choice functions for a given graph, each giving formality to the concept of choosing how a graph searching algorithm should procede at each step (i.e. if the algorithm has reached Fi, then Fi+1 is some forest on the vertex set V (Fi)∪{(Fi,W)} for some W). We also define F-redundant edges, which are edges whose removal from G does not affect the execution of either algorithm mentioned above. This concept leads to a categorization of the edges of G, which in turn provides a new formula for the Tutte polynomial of G and other enumerative results.
12

Zoning for parking

Strauss, Max William. January 1959 (has links)
Thesis (M.P.A.)--University of Southern California, 1959. / Includes bibliographical references (leaves [44]-50).
13

A study of the parking problem at the University of Texas

Threadgill, Walton Orville 03 October 2008 (has links)
Not available / text
14

Implementing surface parking tax: Downtown Cincinnati

January 2018 (has links)
0 / SPK / specialcollections@tulane.edu
15

mm-Wave Radar-Based Indoor and Outdoor Parking Monitoring and Management

Li, Yingquan 04 April 2022 (has links)
Multistory parking can accommodate a maximum number of vehicles in a limited space. However, in multistory and outdoor busy parking, it becomes challenging for drivers to find free parking slots, and they have to search in different parking lanes and floors. This results in the wastage of fuel and time and contaminates the atmosphere. To address this issue, the state-of-the-art solution exploits an optical sensor to detect if a car is present in the parking slot or not. The solution requires an optical sensor for each parking slot, which makes the optical sensor solution expensive and complex. Moreover, such a solution fails in harsh weather conditions in outdoor parking. A low-cost mm-wave radar-based solution is proposed to detect multiple cars using only one radar and pass the corresponding information to the developed computer/mobile app. Using the app, users can view the free parking slots in advance. Our proposed solution also provides free parking slot information at the parking entrance. A driver can select one from the available ones and park his car there. In the next version, people will be able to book the parking slots from the available ones. To detect the presence of vehicle in multiple parking slots, our proposed system uses Infineon’s Postion2Go module, which is one transmit and two receive antenna frequency-modulated continuous-wave (FMCW) radar. We develop a parking model using stationary objects, clutter, and vehicles in the parking. The vehicle detection algorithm is based on background subtraction and updation. First, the background is subtracted from each received snapshot to prominent the parking slot where the latest activity has been done. Then, once the activity is stable (the vehicle is fully parked or left), the background is updated. The algorithm also uses constant-false-alarm-rate (CFAR) for adaptive detection of vehicles and thresholds to detect different activities. The method of monitoring outdoor parking is simple, while the indoor parking is more challenging. Demonstrated results show the effectiveness of the proposed system.
16

A Systematic Approach for Redesigning Parking Systems for an Urban Campus Using Discrete Event Simulation

Maggelet, Nathan Philip 20 September 2013 (has links)
No description available.
17

Optimized combination model and algorithm of parking guidance information configuration

Mei, Zhenyu, Tian, Ye January 2011 (has links)
Operators of parking guidance and information (PGI) systems often have difficulty in providing the best car park availability information to drivers in periods of high demand. A new PGI configuration model based on the optimized combination method was proposed by analyzing of parking choice behavior. This article first describes a parking choice behavioral model incorporating drivers perceptions of waiting times at car parks based on PGI signs. This model was used to predict the influence of PGI signs on the overall performance of the traffic system. Then relationships were developed for estimating the arrival rates at car parks based on driver characteristics, car park attributes as well as the car park availability information displayed on PGI signs. A mathematical program was formulated to determine the optimal display PGI sign configuration to minimize total travel time. A genetic algorithm was used to identify solutions that significantly reduced queue lengths and total travel time compared with existing practices. These procedures were applied to an existing PGI system operating in Deqing Town and Xiuning City. Significant reductions in total travel time of parking vehicles with PGI being configured. This would reduce traffic congestion and lead to various environmental benefits.
18

Investigating the transferability of the Workplace Parking Levy

Burchell, Jonathan January 2015 (has links)
Traffic congestion is a significant cost to society, amounting to somewhere between 1 and 2% of GDP according to an EU-wide survey (CE Delft, 2011). To address this cost, road pricing has long been viewed as the first best solution although issues with public and political acceptance have meant the uptake of such schemes has been low. In the meantime parking policies, a second best alternative to road pricing, have become extensively used by local authorities as a means of managing congestion due to the influence the price and availability of parking can have on a motorist s decision to drive. The effectiveness of such strategies however is limited due to local authorities being unable to control privately owned parking. More specifically, free parking at the workplace is seen as contributing to congestion at peak times by incentivising drivers to commute to work by car. To address this, in the UK the Transport Act 2000 granted powers to local authorities to introduce a Workplace Parking Levy (WPL) whereby employers are required to pay a sum based on the number of parking spaces they provide for their staff with the revenue hypothecated for local transport improvements. The introduction of such powers meant the Government estimated there would be 12 schemes by 2010. To-date however, only Nottingham has introduced a WPL. The aim of this thesis therefore is to investigate the transferability of the WPL to other local authorities which is analysed through the application of the Policy Transfer Framework to the WPL in the UK context. It focuses on the views of key stakeholders with respect to the WPL at both the national and local authority level so as to understand the reasons for the low uptake as well as the design, implementation and operational considerations required to introduce such a scheme. The conclusions of this thesis are that lessons can and have been learnt with respect to introducing a WPL as the findings reveal that Nottingham City Council (NCC) drew on aspects of Policy Transfer to facilitate the introduction of the scheme. Specifically, NCC Councillors developed a vision of what a WPL could deliver and were reassured by experts from abroad whilst a staff transfer exercise allowed officers to learn lessons in terms of how the scheme should be designed, implemented and operated. What s more, lessons from a formal DfT evaluation of the pilot scheme in Nottingham following the delivery of the full WPL package will have a significant influence (either positive or negative) on the number of future schemes. More broadly, the results suggest that the WPL is transferable and the adoption of additional WPL schemes in the future is likely. This is due in no small part to the fact that the Nottingham scheme has so far enjoyed a relatively painless introduction even though it is still too early to evaluate how successful it has been in meeting its objectives. This research has made a significant contribution to knowledge in that it has explored the WPL with key stakeholders to generate a standard for introducing and operating a WPL. It has also provided an application of the Policy Transfer framework to understand the process and development of a new policy as well as the type and where lessons are learnt.
19

The privatisation of car parking facilities in Hong Kong /

Yip, Kwok-ching. January 1983 (has links)
Thesis (M. Soc. Sc.)--University of Hong Kong, 1983.
20

A review of the parking demand policy and planning in Hong Kong

Ho, Kwan-hang., 何均衡. January 2004 (has links)
published_or_final_version / abstract / toc / Transport Policy and Planning / Master / Master of Arts in Transport Policy and Planning

Page generated in 0.0474 seconds