JPL preferred parts list: Reliable electronic components

The JPL Preferred Parts List was prepared to provide a basis for selection of electronic parts for JPL spacecraft programs. Supporting tests for the listed parts were designed to comply with specific spacecraft environmental requirements. The list tabulates the electronic, magnetic, and electromechanical parts applicable to all JPL electronic equipment wherein reliability is a major concern. The parts listed are revelant to equipment supplied by subcontractors as well as fabricated at the laboratory

Investigation of Ottoman period fountains in İzmir/Çeşme for their preservation

Thesis (Master)--Izmir Institute of Technology, Architectural Restoration, Izmir, 2011Includes bibliographical references (leaves: 206-209)Text in English; Abstract: Turkish and Englishxvii, 229 leavesConstruction of waterways in Anatolia dates back to the 11th century. Especially from the 16th century, the construction of water engineering structures increased rapidly The most prominent structures are seen in İstanbul which was the capital of the Ottoman Empire. Fountains being the final portion of these huge works embellished the towns and supplied inhabitants with clean and running potable water, which is important in Islam. In this respect, the town of Çeşme had plenty of fountains in the past likely took its name from the fountain called çeşme in Turkish. However, the number of existing fountains does not reflect the richness in the past. The study aimed at an intensive inventory for the existing historic fountains. Those existing, but unknown, and those missing already but known by their names and approximate locations were deciphered. In addition to the detailed documentation, the evaluation of the alterations that the fountains have undergone for years, a guideline for their preservation are also presented. The fountains that are studied, but not listed in the architectural heritage list of Çeşme are also proposed to be listed

Area-Universal Rectangular Layouts

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it might hence be desirable if one rectangular layout can represent several area assignments. A layout is area-universal if any assignment of areas to rectangles can be realized by a combinatorially equivalent rectangular layout. We identify a simple necessary and sufficient condition for a rectangular layout to be area-universal: a rectangular layout is area-universal if and only if it is one-sided. More generally, given any rectangular layout L and any assignment of areas to its regions, we show that there can be at most one layout (up to horizontal and vertical scaling) which is combinatorially equivalent to L and achieves a given area assignment. We also investigate similar questions for perimeter assignments. The adjacency requirements for the rectangles of a rectangular layout can be specified in various ways, most commonly via the dual graph of the layout. We show how to find an area-universal layout for a given set of adjacency requirements whenever such a layout exists.Comment: 19 pages, 16 figure

Interactive Visual Analysis of Networked Systems: Workflows for Two Industrial Domains

We report on a first study of interactive visual analysis of networked systems. Working with ABB Corporate Research and Ericsson Research, we have created workflows which demonstrate the potential of visualization in the domains of industrial automation and telecommunications. By a workflow in this context, we mean a sequence of visualizations and the actions for generating them. Visualizations can be any images that represent properties of the data sets analyzed, and actions typically either change the selection of data visualized or change the visualization by choice of technique or change of parameters

Example-based Validation of Domain-Specific Visual Languages

This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in SLE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, http://dx.doi.org/10.1145/10.1145/2814251.2814256The definition of Domain-Specific Languages (DSLs) is a recurrent activity in Model-Driven Engineering. However, their construction is many times an ad-hoc process, partly due to the lack of tools enabling a proper engineering of DSLs and promoting domain experts to play an active role. The focus of this paper is on the validation of meta- models for visual DSLs. For this purpose, we propose a language and tool support for describing properties that in- stances of meta-models should (or should not) meet. Then, our system uses a model finder to produce example models, enriched with a graphical concrete syntax, that confirm or refute the assumptions of the meta-model developer. Our language complements metaBest, a framework for the validation and verification of meta-models that includes two other languages for unit testing and specification-based test- ing of meta-models. A salient feature of our approach is that it fosters interaction with domain experts by the use, process- ing and creation of informal drawings constructed in editors liked yED or Dia. We assess the usefulness of the approach in the validation of a DSL for house blueprints, with the par- ticipation of 26 4th year computer science students.Work supported by the Spanish MINECO (TIN2011-24139 and TIN2014-52129-R), the R&D programme of the Madrid Region (S2013/ICE-3006), and the EU commission (FP7-ICT-2013-10, #611125)

Efficient Algorithms for Ortho-Radial Graph Drawing

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the existence of an orthogonal representation that allows to describe such drawings purely combinatorially by only listing the angles between the edges around each vertex and the directions of bends on the edges, but neglecting any kind of geometric information such as vertex coordinates or edge lengths. Barth et al. [2017] have established the existence of an analogous ortho-radial representation for ortho-radial drawings, which are embeddings into an ortho-radial grid, whose gridlines are concentric circles around the origin and straight-line spokes emanating from the origin but excluding the origin itself. While any orthogonal representation admits an orthogonal drawing, it is the circularity of the ortho-radial grid that makes the problem of characterizing valid ortho-radial representations all the more complex and interesting. Barth et al. prove such a characterization. However, the proof is existential and does not provide an efficient algorithm for testing whether a given ortho-radial representation is valid, let alone actually obtaining a drawing from an ortho-radial representation. In this paper we give quadratic-time algorithms for both of these tasks. They are based on a suitably constrained left-first DFS in planar graphs and several new insights on ortho-radial representations. Our validity check requires quadratic time, and a naive application of it would yield a quartic algorithm for constructing a drawing from a valid ortho-radial representation. Using further structural insights we speed up the drawing algorithm to quadratic running time

A Commercial Apartment Complex

Within this project the similarities and differences of new and used heating, cooling, and plumbing systems and equipment will be compared and contrasted in depth. Doing so would help further knowledge and understanding of the design field and help to foster quicker decision making in an educated way. The questions to be answered are: in which stage of this project did the client have the best equipment (the high-end outcome) and why, in which stage did they have the cheapest equipment (the low-end outcome) and why, in which stage did they have the best equipment while also being cost efficient (the cost efficient outcome) and why, and how can an engineer give the best offer to a client to ensure their needs are met. The motivation for this work would be to truly learn the advantages and disadvantages of different systems and re-using or buying new equipment in order to give future clientele exactly what they need and are looking for. Hopefully this will lead to being a more productive employee, a better consulting engineer, and more likely to receive and volunteer for more projects where the equipment studied is used

Efficient Generation of Rectangulations via Permutation Languages

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a large variety of different classes of generic rectangulations. Our algorithms work under very mild assumptions, and apply to a large number of rectangulation classes known from the literature, such as generic rectangulations, diagonal rectangulations, 1-sided/area-universal, block-aligned rectangulations, and their guillotine variants. They also apply to classes of rectangulations that are characterized by avoiding certain patterns, and in this work we initiate a systematic investigation of pattern avoidance in rectangulations. Our generation algorithms are efficient, in some cases even loopless or constant amortized time, i.e., each new rectangulation is generated in constant time in the worst case or on average, respectively. Moreover, the Gray codes we obtain are cyclic, and sometimes provably optimal, in the sense that they correspond to a Hamilton cycle on the skeleton of an underlying polytope. These results are obtained by encoding rectangulations as permutations, and by applying our recently developed permutation language framework