15 years of processing and dissemination of SPOT-VEGETATION products

Throughout the VEGETATION programme, the Flemish Institute for Technological Research (VITO) uninterruptedly hosted the prime user segment of both VEGETATION 1 and VEGETATION 2 multispectral instruments on board the Satellite Pour l’Observation de la Terre 4 (SPOT 4) and SPOT 5 satellites. Operational since the launch of SPOT 4 in March 1998, and foreseen to continue at least until the end of the SPOT 5 mission (anticipated in spring 2014), this user segment comprises a processing facility (PF), actively receiving, processing, correcting, archiving, and distributing the VEGETATION data and derived added-value products. First and foremost, the VEGETATION programme has been serving the needs of operational users – both institutional and commercial – requesting data in near-real time. However, scientific and educational users too benefited significantly, in particular from VEGETATION’s unique time series of the Earth’s land cover, and more specifically the vegetation cover. Over the years, the centralized archive houses processed data covering the equivalent of 11,000 times the Earth’s surface, and delivered more than 50 terapixels to around 10.000 users. As such, VEGETATION’s mission is a prime example of what Europe wants to achieve through the Global Monitoring for Environment and Security (GMES) initiative: truly operational services providing reliable and up-to-date information.

This article describes the processing facility, the way the data and products are archived, the different dissemination channels as well as the data policy adopted and the users served. One of the recent evolutions, the development of an entirely new product distribution facility (PDF), implemented as part of the Project for On-Board Autonomy – Vegetation (PROBA-V) user segment is discussed.     

Lightweight dynamic symmetry breaking

Symmetries in constraint problems present an opportunity for reducing search. This paper presents Lightweight Dynamic Symmetry Breaking, an automatic symmetry breaking method that is efficient enough to be used as a default, since it never yields a major slowdown while often giving major performance improvements. This is achieved by automatically exploiting certain kinds of symmetry that are common, can be compactly represented, easily and efficiently processed, automatically detected, and lead to large reductions in search. Moreover, the method is easy to implement and integrate in any constraint system. Experimental results show the method is competitive with the best symmetry breaking methods without risking poor performance.     

Toward a secure Kerberos key exchange with smart cards

Public key Kerberos (PKINIT) is a standard authentication and key establishment protocol. Unfortunately, it suffers from a security flaw when combined with smart cards. In particular, temporary access to a user’s card enables an adversary to impersonate that user for an indefinite period of time, even after the adversary’s access to the card is revoked. In this paper, we extend Shoup’s key exchange security model to the smart card setting and examine PKINIT in this model. Using this formalization, we show that PKINIT is indeed flawed, propose a fix, and provide a proof that this fix leads to a secure protocol.     

X-ray crystal structure of the dye 2-cyano-4-bromo-4′-N,N-diethylaminoazobenzene

The crystal structure and molecular conformation of 2-cyano-4-bromo-4′-N,N-diethylaminoazobenzene (C₁₇H₁₇N₄Br, mol. wt. = 357·2 a.m.u) has been determined from X-ray diffraction data; triclinic, P$\text{1}$ (No. 2), a = 10·132(11) Å, b = 12·216(16) Å, c = 6·966(11) Å, α = 104·21(9)°, β = 92·67(12)°, γ = 97·22(7)°, V = 826·5(9) ų, Z = 2, D_c = 1·436 g cm^?3, F(000) = 378, λ(MoKα) = 0·71069 Å, μ(MoKα) = 26·0 cm^?1. The structure was solved by the multiple solution direct method and refined by full-matrix least-squares to R = 0·059 for 1538 independent observed reflections. The azobenzene skeleton is planar to within 0·06 Å. Most significant bonding data are: NN, 1·290(8) Å; BrC, 1·866(6) Å; mean CN (azo) 1·380(8) Å; NNC, 113·6(4) and 115·3(4)°; NCC (cis relative to NN) 125·9(4)° and 126·7(4)°; NCC (trans) 116·8°(5)° and 116·1(4)°.     

Structural Induction and Coinduction in a Fibrational Setting

We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle for initial algebras is admissible, and dually, in the presence of quotient types, the coinduction principle for terminal coalgebras is admissible. After giving an alternative formulation of induction in terms of binary relations, we combine both principles and obtain a mixed induction/coinduction principle which allows us to reason about minimal solutionsX≅σ(X) whereXmay occur both positively and negatively in the type constructor σ. We further strengthen these logical principles to deal with contexts and prove that such strengthening is valid when the (abstract) logic we consider is contextually/functionally complete. All the main results follow from a basic result about adjunctions between “categories of algebras” (inserters).     

The Gaussian scale-space paradigm and the multiscale local jet

A representation of local image structure is proposed which takes into account both the image's spatial structure at a given location, as well as its deep structure, that is, its local behaviour as a function of scale or resolution (scale-space). This is of interest for several low-level image tasks. The proposed basis of scale-space, for example, enables a precise local study of interactions of neighbouring image intensities in the course of the blurring process. It also provides an extrapolation scheme for local image data, obtained at a given spatial location and resolution, to a finite scale-space neighbourhood. This is especially useful for the determination of sampling rates and for interpolation algorithms in a multilocal context. Another, particularly straightforward application is image enhancement or deblurring, which is an instance of data extrapolation in the high-resolution direction.A potentially interesting feature of the proposed local image parametrisation is that it captures a trade-off between spatial and scale extrapolations from a given interior point that do not exceed a given tolerance. This (rade-off suggests the possibility of a fairly coarse scale sampling at the expense of a dense spatial sampling large relative spatial overlap of scale-space kernels).The central concept developed in this paper is an equivalence class called the multiscale local jet, which is a hierarchical, local characterisation of the image in a full scale-space neighbourhood. For this local jet, a basis of fundamental polynomials is constructed that captures the scale-space paradigm at the local level up to any given order.     

Comparing notions of randomness

It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-Löf randomness. Joe Miller and André Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of injective randomness is still weaker than Martin-Löf randomness. Since in this proof some of the ideas we use are clearer, we also show the weaker theorem that permutation randomness is weaker than Martin-Löf randomness.     

Logic programming for combinatorial problems

Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for solving combinatorial problems, involving permutations and combinations, by incorporating logic programming. An overview of applied combinatorial problems in various domains is given. Such computationally hard and popular combinatorial problems as the traveling salesman problem are discussed to illustrate the usefulness of the logic programming approach. Detailed discussions of implementation of combinatorial problems with time complexity analyses are presented in Prolog, the standard language of logic programming. These programs can be easily integrated into other systems to implement logic programming in combinatorics.     

Worst case bounds on the point-wise discretization error in boundary element method for the elasticity problem

In this work, point-wise discretization error is bounded via interval approach for the elasticity problem using interval boundary element formulation. The formulation allows for computation of the worst case bounds on the boundary values for the elasticity problem. From these bounds the worst case bounds on the true solution at any point in the domain of the system can be computed. Examples are presented to demonstrate the effectiveness of the treatment of local discretization error in elasticity problem via interval methods.     

Board-Level Information Technology Governance Effects on Organizational Performance: The Roles of Strategic Alignment and Authoritarian Governance Style

ABSTRACT

We report on two empirical studies that explore key factors that help translate information technology governance by the board of directors into organizational performance. The first study shows that strategic alignment partially mediates the effect of board-level information technology governance on performance. The second study demonstrates that authoritarian governance style negatively moderates the effect of board-level information technology governance on performance. Together, these studies open up the black box between board-level information technology governance and organizational performance.