• If you are citizen of an European Union member nation, you may not use this service unless you are at least 16 years old.

  • You already know Dokkio is an AI-powered assistant to organize & manage your digital files & messages. Very soon, Dokkio will support Outlook as well as One Drive. Check it out today!

View
 

TransitCampBayAreaProposedSessions

This version was saved 16 years ago View current version     Page history
Saved by Sean Savage
on February 23, 2008 at 11:49:03 am
 

TransitCamp Bay Area Proposed Sessions

Propose session ideas below for the TransitCampBayArea:

  1. Microformats & Transit brainstorming:
    1. Problem: How to markup transit tables for trains/light-rail, buses, etc, in such a way that aggregation and navigation of schedules across varying transit systems becomes possible.
    2. Solution: Does there exist a solution within microformats, and if so what would be a good practice?
    3. Reference:
      1. http://microformats.org/wiki/transit-table-examples
      2. http://microformats.org/discuss/mail/microformats-discuss/2005-October/001595.html
  2. Onboard Information:
    1. Problem: What information should be presented to passengers on board train/bus? What is the best way to present this information.
      1. For example: How to make the best use of the limited display space; How to make to most efficient use of the passenger's limited time to read/scan the information?
      2. The idea is to talk about static displays, as well as more sophisticated technological solutions which allow dynamic content (e.g., "this train currently running 15 min. late").
  3. Title: topic -- presenter, etc
  4. Bike Sharing and the "last mile:"
    1. Problem: How can we make it easier for people to get from their starting points to the nearest public transit stops, and from transit stops to their destinations? Do shared bicycles present a feasible and desirable solution? If so, what's the best way to fund such a system? (Private bike rental firms? Municipally-funded or nonprofit solutions?)
    2. Solution:

 

  1. ...
  2. ...
  3. ...