Parking difficulty and parking information system technologies and costs
Bibliographic record
Abstract
Abstract Before the implementation of a parking information system, it is necessary to evaluate the parking difficulty, technology choice, and system costs. In this study, the parking problem was quantified by asking parkers to express their parking difficulties in five scaled levels from the least to the most difficult. An ordered Probit model was developed to identify the factors that influence a parker to feel the parking difficulty. The results indicate that the amount of parking information parkers had before their trips was directly related to their parking search time, which in turn, influenced their perceptions of parking difficulty. Parkers' preferences to parking information technologies were identified based on developing binary and multinomial probit models. The results indicate that personal business trips and older persons would like to use the kiosk, while the more educated and males would not. Trips with shopping and social/recreation purposes and the drivers who had visited the destination areas frequently would like to choose roadside display. Drivers who had planned their parking and had Internet access would use in‐vehicle device. The system cost was estimated based on the cost for each component of the system. The results show that providing en‐route parking search information through roadside displays is more expensive than providing pre‐trip information through a web site.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.018 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.009 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".