3D Ordering at the Liquid–Solid Polar Interface of Nanowires

The nature of the liquid–solid interface determines the characteristics of a variety of physical phenomena, including catalysis, electrochemistry, lubrication, and crystal growth. Most of the established models for crystal growth are based on macroscopic thermodynamics, neglecting the atomistic nature of the liquid–solid interface. Here, experimental observations and molecular dynamics simulations are employed to identify the 3D nature of an atomic-scale ordering of liquid Ga in contact with solid GaAs in a nanowire growth configuration. An interplay between the liquid ordering and the formation of a new bilayer is revealed, which, contrary to the established theories, suggests that the preference for a certain polarity and polytypism is influenced by the atomic structure of the interface. The conclusions of this work open new avenues for the understanding of crystal growth, as well as other processes and systems involving a liquid–solid interface.     

Fatigue response up to 109 cycles of a structural epoxy adhesive

In the present paper, the very‐high‐cycle fatigue (VHCF) response of a structural adhesive used for automotive applications, Betaforce 4600G modified with microspheres, has been experimentally assessed. Ultrasonic fully reversed tension–compression tests up to 10⁹ cycles have been carried out with the testing machine developed by the authors on adhesives without macroscopic defects and on adhesives with artificial defects, inserted during the butt‐joint preparation. Fracture surfaces have been observed with the optical microscope and the P‐S‐N curves estimated. Experimental results have shown that defect location significantly affects the VHCF strength and fracture surfaces exhibit a peculiar morphology with three distinct characteristic regions.     

Fluorescent labelled thiourea-bridged glycodendrons

GlcNAc-coated glycodendrimers, which are polyvalent glycomimetics, display strong in vitro affinity for the rat natural killer cell protein-1A (NKR-P1A), a C-type lectin-like receptor of natural killer (NK) cells in rats, humans and some strains of mice. Administration of these compounds in vivo results in a substantial increase in the antitumour activity with involvement of the natural cell immunity. To clarify the in vitro and in vivo fate of these molecules, we synthesized labelled glycodendron analogues of the previously studied glycodendrimers. Labelling with fluorescent tags enabled the localization of the glycodendrons in white blood cells, tumours and other tissues by using different imaging techniques such as fluorescence and confocal microscopy. These studies are useful for probing the mechanism of action and fate of artificial ligands and the cell receptors involved.     

Towards a Quantitative Analysis of Security Protocols

This paper contributes to further closing the gap between formal analysis and concrete implementations of security protocols by introducing a quantitative extension of the usual Dolev-Yao intruder model. This extended model provides a basis for considering protocol attacks that are possible when the intruder has a reasonable amount of computational power, in particular when he is able, with a certain probability, to guess encryption keys or other particular kind of data such as the body of a hashed message. We also show that these extensions do not augment the computational complexity of the protocol insecurity problem in the case of a finite number of interleaved protocol sessions.     

Preface: Volume 52, Issue 1

This volume contains the Proceedings of the Eighth International Workshop on Expressiveness in Concurrency (EXPRESS'01). The Workshop was held in Aalborg, Denmark on August 20, 2001, as satellite event to CONCUR 2001.The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, rewrite systems etc.) on the basis of their relative expressive power.The EXPRESS workshops were originally held as meetings of the HCM project EXPRESS, which was active with the same focus from January 1994 till December 1997. The first three workshops were held respectively in Amsterdam (1994, chaired by Frits Vaandrager), Tarquinia (1995, chaired by Rocco De Nicola), and Dagstuhl (1996, co-chaired by Ursula Goltz and Rocco De Nicola). The workshop in 1997, which took place in Santa Margherita Ligure and was co-chaired by Catuscia Palamidessi and Joachim Parrow, was organized as a conference with a call for papers and a significant attendance from outside the project. The 1998 workshop was held as a satellite workshop of the CONCUR'98 conference in Nice, co-chaired by Ilaria Castellani and Catuscia Palamidessi, and like on that occasion EXPRESS'99 was hosted by the CONCUR'99 conference in Eindhoven, co-chaired by Ilaria Castellani and Björn Victor. The EXPRESS'00 workshop was again held as a satellite workshop of CONCUR 2000, Pennsylvania State University, USA, co-chaired by Luca Aceto and Björn Victor.The papers in this volume were reviewed by the program committee consisting, besides the editors, of

Franck van Breugel	(Department of Computer Science, York University)
Ilaria Castellani	(INRIA, Sophia-Antipolis)
Rance Cleaveland	(Department of Computer Science, SUNY at Stony Brook)
Philippa Gardner	(Department of Computing, Imperial College)
Jan Friso Groote	(Department of Computer Science, Eindhoven University of Technology)
Faron Moller	(Department of Computer Science, University of Wales Swansea)
Joachim Parrow	(KTH Teleinformatik, Royal Institute of Technology)
Julian Rathke	(School of Cognitive and Computing Sciences, University of Sussex)
Roberto Segala	(Dipartimento di Informatica, Università di Verona)

Full-size table

This volume will be published as volume 52 in the series Electronic Notes in Theoretical Computer Science (ENTCS). This series is published electronically through the facilities of Elsevier Science B.V. and its auspices. The volumes in the ENTCS series can be accessed at the URL http://www.elsevier.nl/locate/entcsWe are very grateful to the following persons, whose help has been crucial for the success of EXPRESS'01: Hans Hüttel and Anna Ingólfsdóttir for their help with the organization of the Workshop as satellite event of CONCUR 2001; Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files; Uffe Engberg for his great help in the production of the preliminary version of these Proceedings for distribution at the Workshop. Thanks are also due to BRICS (Basic Research in Computer Science), a centre of the Danish National Research Foundation, which has supplied financial support to cover the printing costs.December 20, 2001Luca Aceto and Prakash Panangaden     

Labelled Modal Logics: Quantifiers

In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes K, D, T, B, S4, S4.2, KD45, and S5. Here we extend this approach to quantified modal logics, providing formalizations for logics with varying, increasing, decreasing, or constant domains. The result is modular with respect to both properties of the accessibility relation in the Kripke frame and the way domains of individuals change between worlds. Our approach has a modular metatheory too; soundness, completeness and normalization are proved uniformly for every logic in our class. Finally, our work leads to a simple implementation of a modal logic theorem prover in a standard logical framework.     

A new characteristic property of rich words

Originally introduced and studied by the third and fourth authors together with J. Justin and S. Widmer (2008), rich words constitute a new class of finite and infinite words characterized by containing the maximal number of distinct palindromes. Several characterizations of rich words have already been established. A particularly nice characteristic property is that all ‘complete returns’ to palindromes are palindromes. In this note, we prove that rich words are also characterized by the property that each factor is uniquely determined by its longest palindromic prefix and its longest palindromic suffix.     

Generalized bang-bang control for feedforward constrained regulation

In the behavioral framework for continuous-time linear scalar systems, simple sufficient conditions for the solution of the minimum-time rest-to-rest feedforward constrained control problem are provided. The investigation of the time-optimal input-output pair reveals that the input or the output saturates on the assigned constraints at all times except for a set of zero measure. The resulting optimal input is composed of sequences of bang-bang functions and linear combinations of the modes associated to the zero dynamics. This signal behavior constitutes a generalized bang-bang control that can be fruitfully exploited for feedforward constrained regulation. Using discretization, an arbitrarily good approximation of the optimal generalized bang-bang control is found by solving a sequence of linear programming problems. Numerical examples are included.