Dagstuhl News January - December 2007

"Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic

Applied Harmonic Analysis and Sparse Approximation

Efficiently analyzing functions, in particular multivariate functions, is a key problem in applied mathematics. The area of applied harmonic analysis has a significant impact on this problem by providing methodologies both for theoretical questions and for a wide range of applications in technology and science, such as image processing. Approximation theory, in particular the branch of the theory of sparse approximations, is closely intertwined with this area with a lot of recent exciting developments in the intersection of both. Research topics typically also involve related areas such as convex optimization, probability theory, and Banach space geometry. The workshop was the continuation of a first event in 2012 and intended to bring together world leading experts in these areas, to report on recent developments, and to foster new developments and collaborations

Algorithmic and Statistical Perspectives on Large-Scale Data Analysis

In recent years, ideas from statistics and scientific computing have begun to interact in increasingly sophisticated and fruitful ways with ideas from computer science and the theory of algorithms to aid in the development of improved worst-case algorithms that are useful for large-scale scientific and Internet data analysis problems. In this chapter, I will describe two recent examples---one having to do with selecting good columns or features from a (DNA Single Nucleotide Polymorphism) data matrix, and the other having to do with selecting good clusters or communities from a data graph (representing a social or information network)---that drew on ideas from both areas and that may serve as a model for exploiting complementary algorithmic and statistical perspectives in order to solve applied large-scale data analysis problems.Comment: 33 pages. To appear in Uwe Naumann and Olaf Schenk, editors, "Combinatorial Scientific Computing," Chapman and Hall/CRC Press, 201

Computational universes

Suspicions that the world might be some sort of a machine or algorithm existing ``in the mind'' of some symbolic number cruncher have lingered from antiquity. Although popular at times, the most radical forms of this idea never reached mainstream. Modern developments in physics and computer science have lent support to the thesis, but empirical evidence is needed before it can begin to replace our contemporary world view.Comment: Several corrections of typos and smaller revisions, final versio

Corporate Codes of Conduct: Is Common Environmental Content Feasible?

In a developing country context, a policy to promote adoption of common environmental content for corporate codes of conduct (COCs) aspires to meaningful results on two fronts. First, adherence to COC provisions should offer economic benefits that exceed the costs of compliance; i.e., companies must receive a price premium, market expansion, efficiency gains, subsidized technical assistance, or some combination of these benefits in return for meeting the requirements. Second, compliance should produce significant improvements in environmental outcomes; i.e., the code must impose real requirements, and monitoring and enforcement must offer sufficient incentives to prevent evasion. With those goals in mind, we explore options for establishing common environmental content in voluntary COCs. Because the benefits of a COC rest on its ability to signal information, we ground our analysis in a review of experiences with a broad range of voluntary (and involuntary) information-based programs: not only existing corporate COCs, but also the International Organization for Standardization (ISO) family of standards, ecolabels, and information disclosure programs. We find some important tradeoffs between harmonization, applicability, feasibility, and efficacy.corporate social responsibility, codes of conduct, environmental management

Quiet Supersonic Flights 2018 (QSF18) Test: Galveston, Texas Risk Reduction for Future Community Testing with a Low-Boom Flight Demonstration Vehicle

The Quiet Supersonic Flights 2018 (QSF18) Program was designed to develop tools and methods for demonstration of overland supersonic flight with an acceptable sonic boom, and collect a large dataset of responses from a representative sample of the population. Phase 1 provided the basis for a low amplitude sonic boom testing in six different climate regions that will enable international regulatory agencies to draft a noise-based standard for certifying civilian supersonic overland flight. Phase 2 successfully executed a large scale test in Galveston, Texas, developed well documented data sets, calculated dose response relationships, yielded lessons, and identified future risk reduction activities

Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning

Over the last decades, dramatic improvements in combinatorialoptimisation algorithms have significantly impacted artificialintelligence, operations research, and other areas. These advances,however, are achieved through highly sophisticated algorithms that aredifficult to verify and prone to implementation errors that can causeincorrect results. A promising approach to detect wrong results is touse certifying algorithms that produce not only the desired output butalso a certificate or proof of correctness of the output. An externaltool can then verify the proof to determine that the given answer isvalid. In the Boolean satisfiability (SAT) community, this concept iswell established in the form of proof logging, which has become thestandard solution for generating trustworthy outputs. The problem isthat there are still some SAT solving techniques for which prooflogging is challenging and not yet used in practice. Additionally,there are many formalisms more expressive than SAT, such as constraintprogramming, various graph problems and maximum satisfiability(MaxSAT), for which efficient proof logging is out of reach forstate-of-the-art techniques.This work develops a new proof system building on the cutting planesproof system and operating on pseudo-Boolean constraints (0-1 linearinequalities). We explain how such machine-verifiable proofs can becreated for various problems, including parity reasoning, symmetry anddominance breaking, constraint programming, subgraph isomorphism andmaximum common subgraph problems, and pseudo-Boolean problems. Weimplement and evaluate the resulting algorithms and a verifier for theproof format, demonstrating that the approach is practical for a widerange of problems. We are optimistic that the proposed proof system issuitable for designing certifying variants of algorithms inpseudo-Boolean optimisation, MaxSAT and beyond