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)°.     

Recent warming of Tonle Sap Lake,Cambodia: Implications for one of the world’s most productive inland fisheries

Tonle Sap Lake in Cambodia is arguably the world's most productive freshwater ecosystems, as well as the dominant source of animal protein for the country. The rapid rise of hydropower schemes, deforestation, land development and climate change impacts in the Mekong River Basin, however, now represent serious concerns in regard to Tonle Sap Lake's ecological health and its role in future food security. To this end, the present study identifies significant recent warming of lake temperature and discusses how each of these anthropogenic perturbations in Tonle Sap's floodplain and the Mekong River Basin may be influencing this trend. The lake's dry season monthly average temperature increased by 0.03°C/year between 1988 and 2018, being largely in synchrony with warming trends of the local air temperature and upstream rivers. The impacts of deforestation and agriculture development in the lake's floodplain also exhibited a high correlation with an increased number of warm days observed in the lake, particularly in its southeast region (agriculture R² = .61; deforestation R² = .39). A total of 79 dams, resulting in 72 km³ of volumetric water capacity, were constructed between 2003 and 2018 in the Mekong River Basin. This dam development coincided with a decreasing trend in the number of dry season warm days per year in the lower Mekong River, while Tonle Sap Lake's number of dry season warm days continued to increase during this same period. The present study revealed that Tonle Sap Lake's temperature trends are highly influenced by temperature trends in the local climate, agriculture development and deforestation of the lake's watershed. Although there were no noticeable impacts observed from upstream dam development in the Mekong River Basin, local‐to‐regional agricultural and land management of the lake's watershed appear to be effective strategies for maintaining a stable thermal regime in the lake in order to facilitate maximum ecosystem health.     

The Pupal Parasitoid Trichopria drosophilae Is Attracted to the Same Yeast Volatiles as Its Adult Host

Journal of Chemical Ecology - There is increasing evidence that microorganisms, particularly fungi and bacteria, emit volatile compounds that mediate the foraging behaviour of insects and therefore...     

Formulating the template ILP consistency problem as a constraint satisfaction problem

Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples, where both hypotheses and examples are expressed in first-order logic. In this paper we employ constraint satisfaction techniques to model and solve a problem known as template ILP consistency, which assumes that the structure of a hypothesis is known and the task is to find unification of the contained variables. In particular, we present a constraint model with index variables accompanied by a Boolean model to strengthen inference and hence improve efficiency. The efficiency of models is demonstrated experimentally.     

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.