SONIC - System of Network Incremental Connections
2016-07-13
Loading...
Persistent link to this item
Statistics
View StatisticsKeywords
Collection period
Date completed
Date updated
Time period coverage
1960-2004
Geographic coverage
Minneapolis, MN CBD
Source information
Journal Title
Journal ISSN
Volume Title
Title
SONIC - System of Network Incremental Connections
Published Date
2016-07-13
Authors
Author Contact
Levinson, David M
dlevinson@umn.edu
dlevinson@umn.edu
Type
Dataset
Software Code
Software Code
Abstract
The software contains a network-growth simulation model. The logic is based on the strongest-link assumption (ie for a link to be constructed, it must be ranked the highest in terms of increasing accessibility between the two blocks it connects).
Description
This is an applet that runs in Java, and the code and data files are included in a single zipped folder. To run the package, import the files as a project into Eclipse or another java platform. Run the main class, sonic.java, as an applet.
Referenced by
Corbett, Michael, Feng Xie, and David Levinson (2009) Evolution of the Second-Story City: The Minneapolis Skyway System. Environment and Planning b 36(4) 711-724
http://dx.doi.org/10.1068/b34066
http://hdl.handle.net/11299/179993
http://dx.doi.org/10.1068/b34066
http://hdl.handle.net/11299/179993
Related to
Replaces
item.page.isreplacedby
Publisher
Funding information
item.page.sponsorshipfunderid
item.page.sponsorshipfundingagency
item.page.sponsorshipgrant
Previously Published Citation
Other identifiers
Suggested citation
Xie, Feng; Levinson, David M. (2016). SONIC - System of Network Incremental Connections. Retrieved from the Data Repository for the University of Minnesota (DRUM), http://doi.org/10.13020/D6ZW2T.
View/Download File
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.