Spatial transformations in urban areas during the past 50 years

This research examines the dynamics of spatial transformations in highly urbanized areas and in particular the urban agglomeration of Ghent (Belgium). To this end we go back 50 years in time (1963-2013). The hypothesis is assumed that three major spatial transformations take place during this period: (1) the population increase leads to sub-urbanization or the spreading of functions around the city center until the 1980s and (2) is followed by a period of compaction processes in which remaining open areas are filled within the suburban area. It is mainly about new construction. This condensed nebula - which presents itself as a city edge – (3) finally, together with the city core, transforms both in nature and in use of the existing built-up tissue. This mainly concerns renovation and reuse. The dynamics of these processes can be reconstructed on the basis of building and allotment permits. Based on this, neighborhoods can be distinguished with low or high dynamics regarding transformations. Finally, it will be investigated where transformations will occur in the future. Socio-economic characteristics of starters on the residential market can be an indication of expected transformations in the future in other neighborhoods. The article introduces the concept of Napoleon plots to carry out statistical and spatial analysis. Dynamics and patterns are mapped

New off-lattice Pattern Recognition Scheme for off-lattice kinetic Monte Carlo Simulations

We report the development of a new pattern-recognition scheme for the off- lattice self-learning kinetic Monte Carlo (KMC) method that is simple and flex ible enough that it can be applied to all types of surfaces. In this scheme, to uniquely identify the local environment and associated processes involving three-dimensional (3D) motion of an atom or atoms, 3D space around a central atom or leading atom is divided into 3D rectangular boxes. The dimensions and the number of 3D boxes are determined by the type of the lattice and by the ac- curacy with which a process needs to be identified. As a test of this method we present the application of off-lattice KMC with the pattern-recognition scheme to 3D Cu island decay on the Cu(100) surface and to 2D diffusion of a Cu monomer and a dimer on the Cu (111) surface. We compare the results and computational efficiency to those available in the literature.Comment: 25 pages, 12 figure

Stable and actionable explanations of black-box models through factual and counterfactual rules

Recent years have witnessed the rise of accurate but obscure classification models that hide the logic of their internal decision processes. Explaining the decision taken by a black-box classifier on a specific input instance is therefore of striking interest. We propose a local rule-based model-agnostic explanation method providing stable and actionable explanations. An explanation consists of a factual logic rule, stating the reasons for the black-box decision, and a set of actionable counterfactual logic rules, proactively suggesting the changes in the instance that lead to a different outcome. Explanations are computed from a decision tree that mimics the behavior of the black-box locally to the instance to explain. The decision tree is obtained through a bagging-like approach that favors stability and fidelity: first, an ensemble of decision trees is learned from neighborhoods of the instance under investigation; then, the ensemble is merged into a single decision tree. Neighbor instances are synthetically generated through a genetic algorithm whose fitness function is driven by the black-box behavior. Experiments show that the proposed method advances the state-of-the-art towards a comprehensive approach that successfully covers stability and actionability of factual and counterfactual explanations

General fixed points of quasi-local frustration-free quantum semigroups: from invariance to stabilization

We investigate under which conditions a mixed state on a finite-dimensional multipartite quantum system may be the unique, globally stable fixed point of frustration-free semigroup dynamics subject to specified quasi-locality constraints. Our central result is a linear-algebraic necessary and sufficient condition for a generic (full-rank) target state to be frustration-free quasi-locally stabilizable, along with an explicit procedure for constructing Markovian dynamics that achieve stabilization. If the target state is not full-rank, we establish sufficiency under an additional condition, which is naturally motivated by consistency with pure-state stabilization results yet provably not necessary in general. Several applications are discussed, of relevance to both dissipative quantum engineering and information processing, and non-equilibrium quantum statistical mechanics. In particular, we show that a large class of graph product states (including arbitrary thermal graph states) as well as Gibbs states of commuting Hamiltonians are frustration-free stabilizable relative to natural quasi-locality constraints. Likewise, we provide explicit examples of non-commuting Gibbs states and non-trivially entangled mixed states that are stabilizable despite the lack of an underlying commuting structure, albeit scalability to arbitrary system size remains in this case an open question.Comment: 44 pages, main results are improved, several proofs are more streamlined, application section is refine

Report from the MPP Working Group to the NASA Associate Administrator for Space Science and Applications

NASA's Office of Space Science and Applications (OSSA) gave a select group of scientists the opportunity to test and implement their computational algorithms on the Massively Parallel Processor (MPP) located at Goddard Space Flight Center, beginning in late 1985. One year later, the Working Group presented its report, which addressed the following: algorithms, programming languages, architecture, programming environments, the way theory relates, and performance measured. The findings point to a number of demonstrated computational techniques for which the MPP architecture is ideally suited. For example, besides executing much faster on the MPP than on conventional computers, systolic VLSI simulation (where distances are short), lattice simulation, neural network simulation, and image problems were found to be easier to program on the MPP's architecture than on a CYBER 205 or even a VAX. The report also makes technical recommendations covering all aspects of MPP use, and recommendations concerning the future of the MPP and machines based on similar architectures, expansion of the Working Group, and study of the role of future parallel processors for space station, EOS, and the Great Observatories era