06365nam 22008055 450 99646606860331620230221160430.03-540-74839-310.1007/978-3-540-74839-7(CKB)1000000000490619(SSID)ssj0000317988(PQKBManifestationID)11211930(PQKBTitleCode)TC0000317988(PQKBWorkID)10307855(PQKB)10707962(DE-He213)978-3-540-74839-7(MiAaPQ)EBC3068137(PPN)123731593(EXLCZ)99100000000049061920100301d2007 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers /edited by Andreas Brandstädt, Dieter Kratsch, Haiko Müller1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (XIII, 344 p.) Theoretical Computer Science and General Issues,2512-2029 ;4769Bibliographic Level Mode of Issuance: Monograph3-540-74838-5 Includes bibliographical references and index.Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs -- Recognizing Bipartite Tolerance Graphs in Linear Time -- Graph Searching in a Crime Wave -- Monotonicity of Non-deterministic Graph Searching -- Tree-Width and Optimization in Bounded Degree Graphs -- On Restrictions of Balanced 2-Interval Graphs -- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions -- The Clique-Width of Tree-Power and Leaf-Power Graphs -- NLC-2 Graph Recognition and Isomorphism -- A Characterisation of the Minimal Triangulations of Permutation Graphs -- The 3-Steiner Root Problem -- On Finding Graph Clusterings with Maximum Modularity -- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs -- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs -- Approximation Algorithms for Geometric Intersection Graphs -- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem -- Mixing 3-Colourings in Bipartite Graphs -- Minimum-Weight Cycle Covers and Their Approximability -- On the Number of ?-Orientations -- Complexity and Approximation Results for the Connected Vertex Cover Problem -- Segmenting Strings Homogeneously Via Trees -- Characterisations and Linear-Time Recognition of Probe Cographs -- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete -- Proper Helly Circular-Arc Graphs -- Pathwidth of Circular-Arc Graphs -- Characterization and Recognition of Digraphs of Bounded Kelly-width -- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms -- Obtaining a Planar Graph by Vertex Deletion -- Mixed Search Number and Linear-Width of Interval and Split Graphs -- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation -- The Complexity of Bottleneck Labeled Graph Problems.The 33rd International Conference “Workshop on Graph-Theoretic Concepts in Computer Science” (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21–23,2007.Theapproximately80 participants came from various countries all over the world, among them Brazil, Canada, the Czech Republic, France, UK, Greece, Hungary, Italy, Japan, The Netherlands, Norway, Sweden, Taiwan, and the USA. WG 2007 continued the series of 32 previous WG conferences. Since 1975, the WG conference has taken place 20 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France and in Norway. The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research. Thecontinuinginterestinthe WGconferenceswasre?ectedin thehighn- ber of submissions; 99 papers were submitted and in an evaluation process with four reports per submission, 30 papers were accepted by the Program Comm- tee for the conference. Due to the high number of submissions and the limited schedule of 3 days, various good papers could not be accepted. There were invited talks by Ming-Yang Kao (Evanston, Illinois) on algori- mic DNA assembly, and by Klaus Jansen (Kiel, Germany) on approximation algorithms for geometric intersection graphs.Theoretical Computer Science and General Issues,2512-2029 ;4769Computer scienceComputer simulationAlgorithmsComputer science—MathematicsDiscrete mathematicsNumerical analysisArtificial intelligence—Data processingTheory of ComputationComputer ModellingAlgorithmsDiscrete Mathematics in Computer ScienceNumerical AnalysisData ScienceComputer science.Computer simulation.Algorithms.Computer science—Mathematics.Discrete mathematics.Numerical analysis.Artificial intelligence—Data processing.Theory of Computation.Computer Modelling.Algorithms.Discrete Mathematics in Computer Science.Numerical Analysis.Data Science.004.0151Brandstädt Andreasedthttp://id.loc.gov/vocabulary/relators/edtKratsch Dieteredthttp://id.loc.gov/vocabulary/relators/edtMüller Haikoedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466068603316Graph-Theoretic Concepts in Computer Science2569248UNISA06298nam 2200697 450 991013162190332120230807221714.01-118-89921-01-119-14968-11-118-89926-1(CKB)3710000000468821(EBL)2006105(SSID)ssj0001543429(PQKBManifestationID)16135220(PQKBTitleCode)TC0001543429(PQKBWorkID)13612922(PQKB)11425884(PQKBManifestationID)15113589(PQKBWorkID)13245980(PQKB)24435694(MiAaPQ)EBC4039657(DLC) 2015025295(MiAaPQ)EBC2006105(Au-PeEL)EBL4039657(CaPaEBR)ebr11113138(CaONFJC)MIL826449(OCoLC)911921073(Au-PeEL)EBL2006105(EXLCZ)99371000000046882120151110h20152015 uy 0engur|n|---|||||txtccrData-driven design and construction 25 strategies for capturing, analyzing, and applying building data /Randy Deutsch, AIA, LEED AP1st ed.Hoboken, New Jersey :Wiley,2015.©20151 online resource (385 p.)Includes index.1-118-89870-2 Data-Driven Design and Construction; Contents; Foreword; Preface; Acknowledgments; Introduction: Measuring the Immeasurable, Validating the Ineffable; Not One More Thing; Strategies for Practice; Benefits of Gathering, Analyzing, and Applying Building Data; Challenges of Gathering, Analyzing, and Applying Building Data; Strategy No. 1: Hone in on Key Information; Strategy No. 2: Demonstrating Works, Explaining Doesn't; PART I Why Data, Why Now?; Chapter 1 The Data Turn; Five Factors Leading to the Leveraging of Data and Industry Change; Strategy No. 3: Look Outside the IndustryCase Study Interview with Robert YoriStrategy No. 4: Not Big Data, Smart Data; Case Study Interview with Sean D. Burke; Data versus Documents; Case Study Interview with Jonatan Schumacher; Chapter 2 A Data-Driven Design Approach for Buildings; Five Trends Leading to the Rise of Data in the AECO Industry; Strategy No. 5: Eight Questions to Ask for Data Preparedness; Case Study Interview with Zigmund Rubel; Data-Centric Approaches; Case Study Interview with Andrew Heumann; Strategy No. 6: Four Steps toward Making the Change to Be More Data-Centric; Strategy No. 7: Ask Good QuestionsCase Study Interview with Jonathon BroughtonChapter 3 Learning from Data; Five Factors Ensuring Data Preparedness; Training, Learning, and Working with Data; Case Study Interview with Brian Ringley; Strategy No. 8: Play with Data; Case Study Interview with Toru Hasegawa; Case Study Interview with Aimee Buccellato; PART II Capturing, Analyzing, and Applying Building Data; Chapter 4 Capturing and Mining Project Data; Public Sources of Data; Case Study Interview with Ryan Mullenix; Private Data Sources; Case Study Interview with Sam Miller; Having a Data Collection StrategyStrategy No. 9: Create a Data Collection StrategyCase Study Interview with Gregory Janks; Strategy No. 10: First Steps to Becoming Data-Centric; Chapter 5 Analyzing Data; Analysis versus Analytics; Strategy No. 11: First Steps in Applying Data Analysis; Predictive Analytics; Case Study Interview with Mads Jensen; Strategy No. 12: Two Ways to Think about Energy Analysis; Strategy No. 13: Analysis for Sustainable Design; Case Study Interview with Chris Pyke, PhD; Strategy No. 14: How Analysis Informs Decision Making; Strategy No. 15: Start Simple, Technology OptionalStrategy No. 16: Leverage Data as Means to an EndCase Study Interview with Brendon Levitt; Dhour Case Study; Chapter 6 Applying Data; First Steps; Strategy No. 17: First Steps Before Applying Data; Strategy No. 18: Plan for the Data; Case Study Interview with Billie Faircloth; Data-Enabled Project Teams; Strategy No. 19: Should the Data Team Be Integrated or Stationed in the Corner?; Case Study Interview with Andrew Witt; Data-Intensive Roles; Strategy No. 20: Computer Scientist vs. Emerging Professional; Case Study Interview with Greig Paterson; Leadership in DataPART III What Data Means for You, Your Firm, Profession, and Industry""In this comprehensive book, Professor Randy Deutsch has unlocked and laid bare the twenty-first century codice nascosto of architecture. It is data. Big data. Data as driver.This book offers us the chance to become informed and knowledgeable pursuers of data and the opportunities it offers to making architecture a wonderful, useful, and smart art form." --From the Foreword by James Timberlake, FAIA Written for architects, engineers, contractors, owners, and educators, and based on today's technology and practices, Data-Driven Design and Construction: 25 Strategies for Capturing, Applying and Analyzing Building Data addresses how innovative individuals and firms are using data to remain competitive while advancing their practices. seeks to address and rectify a gap in our learning, by explaining to architects, engineers, contractors and owners--and students of these fields--how to acquire and use data to make more informed decisions. documents how data-driven design is the new frontier of the convergence between BIM and architectural computational analyses and associated tools. is a book of adaptable strategies you and your organization can apply today to make the most of the data you have at your fingertips. Data-Driven Design and Construction was written to help design practitioners and their project teams make better use of BIM, and leverage data throughout the building lifecycle"--Provided by publisher.BuildingData processingBuildingData processing.720.285ARC015000bisacshDeutsch Randy906872MiAaPQMiAaPQMiAaPQBOOK9910131621903321Data-driven design and construction2028542UNINA