A MORE COMPLETE STREET A STREET FOR EVERYONE TO ENJOY, NORTH EAST STREET, FREDERICK, MARYLAND – A DESIGN INVESTIGATION OF DIFFERENT STREET DESIGN THEORIES

This design-research thesis suggests that the improvement of North East Street performances by using Complete Streets, Green Street, Place Making and Context Sensitive Solution principles and practices. Heavily used by a variety of users, often conflicting with one another, University of Maryland Campus Drive would benefit from a major planning and design amelioration to meet the increasing demands of serving as a city main street. The goal of this thesis project is to prioritize the benefits for pedestrians in the right-of-way and improve the pedestrian experience. This goal also responds to the recent North East Street Extension Phrase I of economic renaissances. The goal of this design-research thesis will be achieved focusing on four aspects. First, the plans and designs will suggest to building mixed use blocks, increase the diversity of street economic types and convenience of people’s living. Second, design and plans will propose bike lanes, separate driving lanes from sidewalks and bike lanes by street tree planters, and narrow driving lanes to reduce vehicular traffic volume and speed in order to reduce pedestrian and vehicle conflicts. Third, plans and designs will introduce bioswales, living walls and raingardens to treat and reuse rain water. Finally, the plans and designs will seek to preserve local culture and history by adding murals and farmers market. The outcome of the design-research thesis project is expected to serve as an example of implementing Complete Streets, Green Street, Place Making and Context Sensitive Solution principles and practices in urban landscape, where transportation, environment and social needs interact with each other.

BUILDING EFFICIENT AND COST-EFFECTIVE CLOUD-BASED BIG DATA MANAGEMENT SYSTEMS

In today’s big data world, data is being produced in massive volumes, at great velocity and from a variety of different sources such as mobile devices, sensors, a plethora of small devices hooked to the internet (Internet of Things), social networks, communication networks and many others. Interactive querying and large-scale analytics are being increasingly used to derive value out of this big data. A large portion of this data is being stored and processed in the Cloud due the several advantages provided by the Cloud such as scalability, elasticity, availability, low cost of ownership and the overall economies of scale. There is thus, a growing need for large-scale cloud-based data management systems that can support real-time ingest, storage and processing of large volumes of heterogeneous data. However, in the pay-as-you-go Cloud environment, the cost of analytics can grow linearly with the time and resources required. Reducing the cost of data analytics in the Cloud thus remains a primary challenge. In my dissertation research, I have focused on building efficient and cost-effective cloud-based data management systems for different application domains that are predominant in cloud computing environments. In the first part of my dissertation, I address the problem of reducing the cost of transactional workloads on relational databases to support database-as-a-service in the Cloud. The primary challenges in supporting such workloads include choosing how to partition the data across a large number of machines, minimizing the number of distributed transactions, providing high data availability, and tolerating failures gracefully. I have designed, built and evaluated SWORD, an end-to-end scalable online transaction processing system, that utilizes workload-aware data placement and replication to minimize the number of distributed transactions that incorporates a suite of novel techniques to significantly reduce the overheads incurred both during the initial placement of data, and during query execution at runtime. In the second part of my dissertation, I focus on sampling-based progressive analytics as a means to reduce the cost of data analytics in the relational domain. Sampling has been traditionally used by data scientists to get progressive answers to complex analytical tasks over large volumes of data. Typically, this involves manually extracting samples of increasing data size (progressive samples) for exploratory querying. This provides the data scientists with user control, repeatable semantics, and result provenance. However, such solutions result in tedious workflows that preclude the reuse of work across samples. On the other hand, existing approximate query processing systems report early results, but do not offer the above benefits for complex ad-hoc queries. I propose a new progressive data-parallel computation framework, NOW!, that provides support for progressive analytics over big data. In particular, NOW! enables progressive relational (SQL) query support in the Cloud using unique progress semantics that allow efficient and deterministic query processing over samples providing meaningful early results and provenance to data scientists. NOW! enables the provision of early results using significantly fewer resources thereby enabling a substantial reduction in the cost incurred during such analytics. Finally, I propose NSCALE, a system for efficient and cost-effective complex analytics on large-scale graph-structured data in the Cloud. The system is based on the key observation that a wide range of complex analysis tasks over graph data require processing and reasoning about a large number of multi-hop neighborhoods or subgraphs in the graph; examples include ego network analysis, motif counting in biological networks, finding social circles in social networks, personalized recommendations, link prediction, etc. These tasks are not well served by existing vertex-centric graph processing frameworks whose computation and execution models limit the user program to directly access the state of a single vertex, resulting in high execution overheads. Further, the lack of support for extracting the relevant portions of the graph that are of interest to an analysis task and loading it onto distributed memory leads to poor scalability. NSCALE allows users to write programs at the level of neighborhoods or subgraphs rather than at the level of vertices, and to declaratively specify the subgraphs of interest. It enables the efficient distributed execution of these neighborhood-centric complex analysis tasks over largescale graphs, while minimizing resource consumption and communication cost, thereby substantially reducing the overall cost of graph data analytics in the Cloud. The results of our extensive experimental evaluation of these prototypes with several real-world data sets and applications validate the effectiveness of our techniques which provide orders-of-magnitude reductions in the overheads of distributed data querying and analysis in the Cloud.

Obsolescence and Renewal: Transformation of Post War Concrete Buildings

In this thesis I investigate issues of post-war concrete buildings and how we can both add value and make adaptable what we have traditionally defined as not valuable and not adaptable. 55% of United States’ commercial building stock was built between the years of 1960 and 1980, leaving 36 billion square feet of building material to be adaptively reused or at the bottom of a landfill. Currently, our culture does not value many character defining features of these buildings making the preservation of these buildings difficult, especially at this 50 year critical moment of both the attribution of a “historic” status and time when major renovation of these buildings needs to occur. How can architects add value to a building type, sometimes called “brutalist”, that building culture currently under values and thinks is “obsolete”? I tested this hypothesis using the James Forrestal Building in Washington D.C. After close study of the obsolescence, value,history and existing conditions, I propose a design that adds value to Southwest Washington D.C. and may serve as an example for post-war renewal around the country.