Suki San : Where The Cherry Blossoms Fall

https://digitalcommons.library.umaine.edu/mmb-vp/5658/thumbnail.jp

Why station areas succeed: Analyzing North America’s largest light rail network.

Master of Regional and Community PlanningDepartment of Landscape Architecture/Regional and Community PlanningGregory NewmarkLight rail networks represent a substantial public transportation investment in cities. Common planning practice suggests that the construction of these networks will lead to the construction of denser and less car dependent transit-oriented development. While this is true in most places where light rail is constructed, the development benefits are not realized near each station site. This research tests the “build it and they will come” paradigm for TOD near light rail station areas. We used the Dallas Area Rapid Transit (DART) light rail network as an exemplar for findings potentially applicable to other cities and explored it with a mixed-methods approach using interviews with experts and data modelling. Through a trial-and-error process turning on and off variables in the model, we tested planner’s hypothesis and conventional wisdom about where TOD is most likely to succeed

A method to implement fine-grained access control for personal health records through standard relational database queries

AbstractOnline personal health records (PHRs) enable patients to access, manage, and share certain of their own health information electronically. This capability creates the need for precise access-controls mechanisms that restrict the sharing of data to that intended by the patient. The authors describe the design and implementation of an access-control mechanism for PHR repositories that is modeled on the eXtensible Access Control Markup Language (XACML) standard, but intended to reduce the cognitive and computational complexity of XACML. The authors implemented the mechanism entirely in a relational database system using ANSI-standard SQL statements. Based on a set of access-control rules encoded as relational table rows, the mechanism determines via a single SQL query whether a user who accesses patient data from a specific application is authorized to perform a requested operation on a specified data object. Testing of this query on a moderately large database has demonstrated execution times consistently below 100ms. The authors include the details of the implementation, including algorithms, examples, and a test database as Supplementary materials