Motion Compatibility for Indoor Localization

Indoor localization -- a device's ability to determine its location within an extended indoor environment -- is a fundamental enabling capability for mobile context-aware applications. Many proposed applications assume localization information from GPS, or from WiFi access points. However, GPS fails indoors and in urban canyons, and current WiFi-based methods require an expensive, and manually intensive, mapping, calibration, and configuration process performed by skilled technicians to bring the system online for end users. We describe a method that estimates indoor location with respect to a prior map consisting of a set of 2D floorplans linked through horizontal and vertical adjacencies. Our main contribution is the notion of "path compatibility," in which the sequential output of a classifier of inertial data producing low-level motion estimates (standing still, walking straight, going upstairs, turning left etc.) is examined for agreement with the prior map. Path compatibility is encoded in an HMM-based matching model, from which the method recovers the user s location trajectory from the low-level motion estimates. To recognize user motions, we present a motion labeling algorithm, extracting fine-grained user motions from sensor data of handheld mobile devices. We propose "feature templates," which allows the motion classifier to learn the optimal window size for a specific combination of a motion and a sensor feature function. We show that, using only proprioceptive data of the quality typically available on a modern smartphone, our motion labeling algorithm classifies user motions with 94.5% accuracy, and our trajectory matching algorithm can recover the user's location to within 5 meters on average after one minute of movements from an unknown starting location. Prior information, such as a known starting floor, further decreases the time required to obtain precise location estimate

Assessment of Reinforcement Learning for Macro Placement

We provide open, transparent implementation and assessment of Google Brain's deep reinforcement learning approach to macro placement and its Circuit Training (CT) implementation in GitHub. We implement in open source key "blackbox" elements of CT, and clarify discrepancies between CT and Nature paper. New testcases on open enablements are developed and released. We assess CT alongside multiple alternative macro placers, with all evaluation flows and related scripts public in GitHub. Our experiments also encompass academic mixed-size placement benchmarks, as well as ablation and stability studies. We comment on the impact of Nature and CT, as well as directions for future research.Comment: There are eight pages and one page for reference. It includes five figures and seven tables. This paper has been invited to ISPD 202

Gaps and requirements for applying automatic architectural design to building renovation

The renovation of existing buildings provides an opportunity to change the layout to meet the needs of facilities and accomplish sustainability in the built environment at high utilisation rates and low cost. However, building renovation design is complex, and completing architectural design schemes manually needs more efficiency and overall robustness. With the use of computational optimisation, automatic architectural design (AAD) can efficiently assist in building renovation through decision-making based on performance evaluation. This paper comprehensively analyses AAD's current research status and provides a state-of-the-art overview of applying AAD technology to building renovation. Besides, gaps and requirements of using AAD for building renovation are explored from quantitative and qualitative aspects, providing ideas for future research. The research shows that there is still much work to be done to apply AAD to building renovation, including quickly obtaining input data, expanding optimisation topics, selecting design methods, and improving workflow and efficiency

Algorithms for cartographic visualization

Maps are effective tools for communicating information to the general public and help people to make decisions in, for example, navigation, spatial planning and politics. The mapmaker chooses the details to put on a map and the symbols to represent them. Not all details need to be geographic: thematic maps, which depict a single theme or attribute, such as population, income, crime rate, or migration, can very effectively communicate the spatial distribution of the visualized attribute. The vast amount of data currently available makes it infeasible to design all maps manually, and calls for automated cartography. In this thesis we presented efficient algorithms for the automated construction of various types of thematic maps. In Chapter 2 we studied the problem of drawing schematic maps. Schematic maps are a well-known cartographic tool; they visualize a set of nodes and edges (for example, highway or metro networks) in simplified form to communicate connectivity information as effectively as possible. Many schematic maps deviate substantially from the underlying geography since edges and vertices of the original network are moved in the simplification process. This can be a problem if we want to integrate the schematized network with a geographic map. In this scenario the schematized network has to be drawn with few orientations and links, while critical features (cities, lakes, etc.) of the base map are not obscured and retain their correct topological position with respect to the network. We developed an efficient algorithm to compute a collection of non-crossing paths with fixed orientations using as few links as possible. This algorithm approximates the optimal solution to within a factor that depends only on the number of allowed orientations. We can also draw the roads with different thicknesses, allowing us to visualize additional data related to the roads such as trafic volume. In Chapter 3 we studied methods to visualize quantitative data related to geographic regions. We first considered rectangular cartograms. Rectangular cartograms represent regions by rectangles; the positioning and adjacencies of these rectangles are chosen to suggest their geographic locations to the viewer, while their areas are chosen to represent the numeric values being communicated by the cartogram. One drawback of rectangular cartograms is that not every rectangular layout can be used to visualize all possible area assignments. Rectangular layouts that do have this property are called area-universal. We show that area-universal layouts are always one-sided, and we present algorithms to find one-sided layouts given a set of adjacencies. Rectangular cartograms often provide a nice visualization of quantitative data, but cartograms deform the underlying regions according to the data, which can make the map virtually unrecognizable if the data value differs greatly from the original area of a region or if data is not available at all for a particular region. A more direct method to visualize the data is to place circular symbols on the corresponding region, where the areas of the symbols correspond to the data. However, these maps, so-called symbol maps, can appear very cluttered with many overlapping symbols if large data values are associated with small regions. In Chapter 4 we proposed a novel type of quantitative thematic map, called necklace map, which overcomes these limitations. Instead of placing the symbols directly on a region, we place the symbols on a closed curve, the necklace, which surrounds the map. The location of a symbol on the necklace should be chosen in such a way that the relation between symbol and region is as clear as possible. Necklace maps appear clear and uncluttered and allow for comparatively large symbol sizes. We developed algorithms to compute necklace maps and demonstrated our method with experiments using various data sets and maps. In Chapter 5 and 6 we studied the automated creation of ow maps. Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of ow between a source and a target. Good ow maps reduce visual clutter by merging (bundling) lines smoothly and by avoiding self-intersections. We developed a new algorithm for drawing ow trees, ow maps with a single source. Unlike existing methods, our method merges lines smoothly and avoids self-intersections. Our method is based on spiral trees, a new type of Steiner trees that we introduced. Spiral trees have an angle restriction which makes them appear smooth and hence suitable for drawing ow maps. We study the properties of spiral trees and give an approximation algorithm to compute them. We also show how to compute ow trees from spiral trees and we demonstrate our approach with extensive experiments

Structural design considerations for super-tall buttressed core structure - the Burj Khalifa

Master of ScienceDepartment of Architectural Engineering and Construction ScienceMajor Professor Not ListedThe intent of this report is to illustrate the design and feasibility considerations for super-tall buttressed core structures in respect to the Burj Khalifa. Utilizing the latest construction surveying equipment and engineering practices has led to taller structures and more sophisticated methods of analysis. With realization of such heights, the Burj Khalifa poses as a benchmark for structural analysis methods and future structures. Dynamic considerations for structures vary from many factors such as overall stiffness, damping, and mass. For better understanding of global behaviors, early integration of aerodynamic shaping and wind engineering played a major role in mitigating and taming the dynamic wind effects. Understanding the structural and foundation system behaviors of the tower were the key fundamental drivers for the development and execution of a state-of-the-art survey and structural health monitoring programs. These programs will be further described as well as their ability to measure accelerations, deflections, strains, concrete shortening, and settlements of structural members. Furthermore, this report describes the foundation design process adopted for the Burj Khalifa. The foundation system is a compensated piled raft, founded on very heterogenous soil deposits. Geotechnical investigations, field and laboratory testing programs, and the design process will all discuss how various design issues were addressed. The various design issues addressed include: ultimate capacity, overall stability under wind and seismic loadings, and settlement and differential settlements

A generic housing grammar for the generation of different housing languages: a generic housing shape grammar for Palladian villas, Prairie and Malagueira houses

Shape grammars have traditionally described a design language and replicated it using a procedure. In the majority of existing studies, one language corresponded to one grammar and vice versa; the generative procedure was univocal and language specific. Generic grammars, which are capable of describing multiple design languages, potentially allow greater flexibility and help describe not only languages but relationships between languages. This study proposes a generic housing process based on a parametric shape grammar, and uses this to investigate relationships between several grammars or families of designs. A study case of three single housing grammars was selected using the Palladian villas, Prairie and Malagueira houses. Specific parameterisation confers the sense of style required to define a language. From the generated corpora two methods were exercised to explore two research questions: 1. A qualitative method tested how the parametric space of a shape grammar corresponded with our intuition of similarities and differences amongst designs. This was performed using a set of questionnaires posed to both laymen and expert observers. 2. A quantitative method was used to test how well the parametric space of a shape grammar coincided with the design space expressed by the different corpora. Principal Components Analysis was used to inform if the set of parameters used to design the solutions would group into clusters. Results indicate that the expected relationships between individual designs are captured by the generic grammar. The design solutions generated by the generic grammar were also naturally perceived by observers and clustering was identified amongst language related design solutions. A tool such as a generic shape grammar captures the principles of design as described by the generative shape rules and its parameterisation, which can be used in academia, practice or analysis to explore design

Wide-Area Surveillance System using a UAV Helicopter Interceptor and Sensor Placement Planning Techniques

This project proposes and describes the implementation of a wide-area surveillance system comprised of a sensor/interceptor placement planning and an interceptor unmanned aerial vehicle (UAV) helicopter. Given the 2-D layout of an area, the planning system optimally places perimeter cameras based on maximum coverage and minimal cost. Part of this planning system includes the MATLAB implementation of Erdem and Sclaroff’s Radial Sweep algorithm for visibility polygon generation. Additionally, 2-D camera modeling is proposed for both fixed and PTZ cases. Finally, the interceptor is also placed to minimize shortest-path flight time to any point on the perimeter during a detection event. Secondly, a basic flight control system for the UAV helicopter is designed and implemented. The flight control system’s primary goal is to hover the helicopter in place when a human operator holds an automatic-flight switch. This system represents the first step in a complete waypoint-navigation flight control system. The flight control system is based on an inertial measurement unit (IMU) and a proportional-integral-derivative (PID) controller. This system is implemented using a general-purpose personal computer (GPPC) running Windows XP and other commercial off-the-shelf (COTS) hardware. This setup differs from other helicopter control systems which typically use custom embedded solutions or micro-controllers. Experiments demonstrate the sensor placement planning achieving \u3e90% coverage at optimized-cost for several typical areas given multiple camera types and parameters. Furthermore, the helicopter flight control system experiments achieve hovering success over short flight periods. However, the final conclusion is that the COTS IMU is insufficient for high-speed, high-frequency applications such as a helicopter control system