bluuebunny/crossref_metadata_2025_split huggingface dataset:
Phenomenological treatments of transport coefficients
Authors: Egelstaff P A 
Published: November 2023

Abstract
It will have been noticed that the diffusion constant was expressed frequently in terms of velocities, distances, and times rather than in terms of the pair potential and the pair correlation function. The method of calculation adopted in the last two chapters has differed from that used earlier, in that statistical mechanics was not used extensively. This points out a basic difference between the usual methods of calculating the equilibrium properties and the transport properties. As an illustration of these differences, Fig. 13.1 shows the main steps in the mathematical procedures. For equilibrium properties, classical mechanics and the pair potential provide the starting point and the calculation proceeds via equilibrium statistical mechanics. Along this route the information regarding the time variation of positions is lost. In contrast, for transport coefficients the calculation proceeds via a detailed molecular dynamics method. Such a calculation may be accomplished in one of two ways: either the equations of motion for each atom may be written down and solved (nearly) continuously on a large computer (Chapter 6); or a model for the liquid may be assumed and the dynamical consequences of the model worked out. Several examples of the latter method were given in Chapters 11 and 12.
The difficult years 1665–7
Authors: Hall Marie Boas 
Published: November 2023

Abstract
The hard winter of 1664–5 brought with it a series of catastrophes for England and immense difficulties for Oldenburg personally, most of them arising directly from the national disasters. Those years were so full of dire events that many invoked the milleniarist tradition of prophetic numerology that turned the year 1666 (1000 + 666) into the herald of, possibly, the end of the world foretold in the Book of Daniel, and at least presaged great turmoil and chaos in the social and political world. Certainly England was to be beset with enough catastrophes to satisfy the prophets: a lengthy and on the whole disastrous war, a devastating outbreak of plague, and the Great Fire of London. And all these in different ways affected Oldenburg himself if not disastrously at least for the worse.
Causality and graphical models in time series analysis
Authors: Dahlhaus Rainer , Eichler Michael 
Published: November 2023

Abstract
Over the last few years there has been growing interest in graphical models and in particular in those based on directed acyclic graphs as a general framework to describe and infer causal relations (Pearl 1995, 2000; Dawid 2000; Lauritzen 2001). This new graphical approach is related to other approaches to formalize the concept of causality, such as Neyman and Rubin’s potential-response model (Neyman 1935; Rubin 1974; Robins 1986) and path analysis or structural equation models (Wright 1921; Haavelmo 1943). The latter concept has been applied in particular by economists to describe the equilibrium distributions of systems that typically evolve over time.
Spatial hierarchical Bayesian models in ecological applications
Authors: Penttinen Antti , Divino Fabio , Riiali Anne 
Published: November 2023

Abstract
The spatial distribution of species, the suitability of sites, and association between species are matters of importance in biological and ecological research. These issues have entered also into modern forest research where the objectives of planning strategies are not only in timber production but increasingly in the multi-purpose use of forest areas, including the ability to host plant and animal species.
Statistical approaches to genetic mapping
Authors: Stephens David A 
Published: November 2023

Abstract
The analysis of genetic data, specifically in relation to the modelling of population-level variation in disease, is one of the most challenging areas for statisticians. Advances in molecular technology have now facilitated routine, large-scale genetic screening, and such data will provide key information in the study of diseases such as hypertension and cardiovascular disease, helping to quantify purely genetic and gene-environment components of variation and risk.
The genealogy of a neutral mutation
Authors: Griffiths R C , é Simon Tavar 
Published: November 2023

Abstract
Technological advances in molecular biology have made it possible to survey DNA sequence variation in natural populations. These data include restriction fragment length polymorphisms, microsatellite repeats, single nucleotide polymorphisms, and complete DNA sequences of many loci; for more details, we refer to Chapter 2 of Hartl and Jones (2001).
Applications of Euler’s formula
Authors: Wilson Robert A 
Published: November 2023

Abstract
You may have met Euler’s formula for regular polyhedra: if &lt;V is the number of vertices, E the number of edges, and &lt;F the number of faces, then &lt;V −E +&lt;F = 2. There are five such regular polyhedra, and you can check this equation in the five cases (see Table 3.1).
Kempe’s approach
Authors: Wilson Robert A 
Published: November 2023

Abstract
Kempe (pronounced ‘kemp’) published his ‘proof’ of the four-colour theorem in 1879, and for a decade it was accepted as a valid proof, and an ingenious solution to the problem. It contained several clever ideas, which we now present. For historical reasons, we describe his arguments in the face-colouring form, as Kempe himself did. He also mentioned duality and the translation of the problem into the vertex-colouring form. We discuss this translation in Section 4.4.
Kuratowski’s theorem
Authors: Wilson Robert A 
Published: November 2023

Abstract
We have looked at problems of colouring graphs of different genus, but how do we know what genus a given graph has? In general, this is a hard problem. The genus O case is obviously of special interest to us, as a good characterization of genus O (i.e. planar) graphs might help us to attack the four-colour theorem. The most famous characterization of planar graphs is Kuratowski’s theorem, which gives us a practical way of showing that a given graph is non-planar. On the other hand, the easiest way to show that a given graph is planar is to draw a plane graph which is isomorphic to it.
Common mechanisms in perception and action Introductory remarks
Authors: Prinz Wolfgang , Hommel Bernhard 
Published: November 2023

Abstract
The contributions to this volume discuss a classical theme in human-performance research, and they do so under some new perspectives that have emerged in recent years. The classical theme refers to the interplay between perception and action—a theme that is, and has ever been, one of the core issues in the 1eld of attention and performance. For instance, in the classical work inspired by linear stage theory, notions like stimulus–response translation and/or response selection have been introduced to account for putative operations underlying the transition from stimulusto response-related processing, and a number of factors affecting these operations have been identi1ed. Yet, despite their supposed central function, the study of translation mechanisms has always played a somewhat marginal role. Instead, research has tended to emphasize stimulusover response-related processing, and there has been rather little interest in response-related processing mechanisms and the way they are linked to those dealing with stimulus information.
Several ‘vision for action’ systems: a guide to dissociating and integrating dorsal and ventral functions (Tutorial)
Authors: Rossetti Yves , Pisella Laure 
Published: November 2023

Abstract
Abstract. There is a well-established argument for a double-dissociation between vision for action and vision for conscious identi1cation. The distinction between these two visual systems applies to both the attributes being processed and the outputs of the processing. However, numerous direct and indirect interconnections and convergence have been described between cortical and subcortical visual pathways as well as between the dorsal and the ventral streams.
The perception and representation of human locomotion
Authors: Rieser John J , Pick Herbert L 
Published: November 2023

Abstract
Abstract. Locomotion is both a class of actions and a class of perceptible events. As a class of actions it is embedded in its environmental context and participates in 1ght, 2ight, and many functional behaviors. As a class of perceptible events, it is central to dynamic spatial orientation, that is, keeping up-to-date on the changes in self-to-object distances and directions that occur during locomotion. This chapter is focused on locomotion and on spatial orientation when people walk without vision and without access to nonvisual information about their surroundings. The thesis is that even when walking without vision, people perceive their locomotion relative to the remembered environment as a frame of reference. This environment-centered perception of locomotion accounts for how they keep up-to-date on their changing spatial orientation relative to features of the remembered surroundings. And the resulting representation is used to steer their ongoing locomotion and control all other environmentally directed actions.
Interaction between feature binding in perception and action
Authors: Stoet Gijsbert , Hommel Bernhard 
Published: November 2023

Abstract
Abstract. To explain how coherent representations can be formed of information that is distributed throughout the brain, binding mechanisms have been hypothesized that temporarily hold together or bind such distributed information. Evidence of temporary feature binding has been reported from tasks requiring perceptual integration and action planning, and there is some evidence that action planning affects perception. The present study provides further evidence that binding-related effects cross borders between perceptual and motor domains by demonstrating that perceptual integration affects action planning. Results from 3 psychophysical experiments suggest that if a particular perceptual feature is bound into an object representation, it is less accessible for concurrent action planning. Furthermore, our results support the idea that the formation of object representations goes through two phases: feature activation and feature integration. Feature sharing between perception and action is bene1cial during the feature activation, but leads to mutual interferences in feature integration. Wider implications of these 1ndings are discussed, especially with regard to feature binding as a general mechanism of cognitive representation as well as the relationship between perception and action.
Selection-for-perception and selection-forspatial-motor-action are coupled by visual attention: a review of recent findings and new evidence from stimulus-driven saccade control
Authors: Schneider Werner X , Deubel Heiner 
Published: November 2023

Abstract
Abstract. The topic of this paper is how selection-for-visual-perception (usually identified with visual attention) and selection-for-spatial-motor-action are related. The later process refers to the fact that simple actions such as grasping an object usually imply the need to select one movement target among other potential targets. In the 1rst part of the paper, a theoretical framework for understanding the relationship between selective perception and motor target selection will be introduced, namely the ‘Visual Attention Model’ (VAM, Schneider 1995). The main hypothesis of VAM is that of a tight coupling between selection-for-perception and selection-for- spatial-motor-action, which is assumed to be mediated by a common visual attention mechanism. Recent behavioral evidence supporting this claim is reviewed in the second part. The basic experimental paradigm (Deubel and Schneider 1996) required subjects to discriminate briefly presented target stimuli while they were preparing a saccadic eye movement or a manual pointing movement. The data revealed a spatially selective (possibly object-specific) coupling of motor programming and visual perception. In the third part of the paper, three new experiments are reported which investigated whether this coupling also holds when the motor action is directed in a stimulus-driven way. A discrimination judgment had to be made about a letter object that was brie2y presented during the preparation of a saccade guided by a peripheral cue. All three experiments showed a tight, spatially specific coupling between the intentionally controlled perceptual discrimination and the stimulus- driven saccade programming. Additionally, the third experiment addressed the question of whether this result is the consequence of an obligatory attraction of attention by peripheral cues per se. The data show that a nonrelevant peripheral cue attracted attention automatically only when cue and discrimination target appeared in the same hemifield. We conclude that visual attention is not obligatorily coupled to peripheral cues, rather, the spatial relationship between cue and the goal-driven attentional focusing has to be taken into account. Implications of the new findings for theories of attentional control in visual perception and motor action are discussed.
Classical Harmonic Analysis and Locally Compact Groups
Authors: Reiter Hans , Stegeman Jan D 
Published: November 2023

Abstract
A revised and expanded second edition of Reiter's classic text Classical Harmonic Analysis and Locally Compact Groups (Clarendon Press 1968). It deals with various developments in analysis centring around the fundamental work of Wiener, Carleman, and especially A. Weil. It starts with the classical theory of Fourier transforms in euclidean space, continues with a study of certain general function algebras, and then discusses functions defined on locally compact groups. The aim is, firstly, to bring out clearly the relations between classical analysis and group theory , and secondly, to study basic properties of functions on abelian and non-abelian groups. The book gives a systematic introduction to these topics and endeavours to provide tools for further research. In the new edition relevant material is added that was not yet available at the time of the first edition.
Applications of Combinatorial Mathematics
Authors: Mitchell Chris 
Published: November 2023

Abstract
In the last thirty years, combinatorial mathematics has found itself at the heart of many technological applications. The aims of the conference on which this book is based were to stimulate combinatorial mathematicians to pursue new lines of research of potential practical importance, and to uncover the breadth of applications of the subject. Topics covered include neural networks, cryptography, radio frequency assignment for mobile telecommunications, coding theory, sequences for communications applications, interconnection networks, data types, knot theory, radar, parallel processing, network reliability, formal specification of programs and protocols, and combinatorial optimisation.
The Use of Combinatorial Structures in Communication Signal Design
Authors: Golomb S W 
Published: November 2023

Abstract
For many kinds of communication channels, the optimum detection system is a correlation detector, which computes the cross-correlation between the actual (noisy) received signal and locally generated models of the various waveforms which might have been sent. The waveform with the largest correlation is the maximum likelihood estimate of what was sent. It is this fact which motivates the search for sets of signals (waveforms) which are as mutually uncorrelated as possible for use as the “codewords” in reliable communication systems, and for signals which are as uncorrelated as possible with all non-zero time-shifts of themselves for use in radar, sonar, and synchronisation applications.
Numerical Solution of Differential-Algebraic Equations
Authors: Petzold Linda R 
Published: November 2023

Abstract
Many physical systems are naturally described as systems of differential-algebraic equations (DAEs). These types of systems occur in the modeling of electrical networks, flow of incompressible fluids, control, mechanical systems subject to constraints, and in many other applications. This class of problems includes systems which are in many ways quite different from ODEs. In these notes we outline some of the theory and available software for the numerical solution of DAE systems, and explore some challenging applications.
Other classes of regular semigroups
Authors: Howie John M 
Published: November 2023

Abstract
The success of inverse semigroup theory has naturally prompted the study of more general regular semigroups, very often quite explicitly defined as generalizations. In the Exercises and in the Notes at the end of the chapter we make brief reference to one or two pieces of work of this kind, but in the text we shall confine ourselves to three fairly natural types of regular semigroup.
Free semigroups
Authors: Howie John M 
Published: November 2023

Abstract
In Chapter 1 we came across the notion of the free semigroup A+and the free monoid A* on a set A. While the emphasis of this book is unquestionably on the study of various classes of regular semigroups, it would be wrong in a general introduction not to include a short chapter on free semigroups, for in the wide and growing applications of semigroup theory to automata, languages and machines it is the free semigroups that play the major role.
Introduction
Authors: Fonseca Irene , Gangbo Wilfrid 
Published: November 2023

Abstract
The degree d( ϕ, D,p) is a tool that describes the number of solutions for the equation ϕ (x) =p in a given open set D ⊂ X, whereϕ : D ⊂ X → X is a continuous function, p ∉ ϕ( ∂D), and X is a topological space, often a metric space. As it turns out, the degree is a generalization of the winding number of [ineq] when we identify the complex plane ℂ to ℝ (see Chapter 2).
The Evolution of an Image Processing Language
Authors: Saxton W O 
Published: November 2023

Abstract
The image processing program Semper, still in widespread use in many laboratories across the world, was originally produced twenty years ago with very limited resources, to provide the tools that were needed to address the serious problems of image interpretation arising in high resolution electron microscopy of a range of specimens of physical, chemical and biological interest. This paper records the main stages of software development in the context of successive hardware improvements and the main applications within electron microscopy: the phase problem, image averaging, image restoration, averaging and three-dimensional reconstruction of distorted crystals, microscope control, and aperture-synthesis microscopy.
Probabilistic Resolution Criterion for Imaging in Scattering Media
Authors: Appel R K , Hopcraft K I , Somekh M G 
Published: November 2023

Abstract
This paper presents a. probabilistic resolution criterion for quantifying imaging performance in scattering media. This criterion incorporates an explicit description of the noise and is therefore superior to standard resolution criteria such as those introduced by Rayleigh and Sparrow. The probabilistic resolution criterion is applicable to imaging systems with generalised noise distributions. As an illustrative example, a simple optical imaging system is considered, whe1e the illumination is coherent and the scattering assumed to be Gaussian. The analysis requires a description of the intensity statistics at the detector plane, which in this case is described by two correlated Ricean distributions. This is derived and then used to determine the probabilistic resolution criterion. Results are presented for two variants of the probability criterion, which are modifications of the standard Sparrow and Rayleigh resolution criteria.
Truth and the foundations of mathematics. An introduction
Authors: Dales H G , Oliveri G 
Published: November 2023

Abstract
The concept of truth occupies a central position both in mathematics and in its philosophy. As we shall see in what follows, different conceptions of what it means to say of a mathematical statement that it is true give rise to different and mutually incompatible mathematical theories and to mutually exclusive positions on whether there are such things as mathematical knowledge and reality and on how these ought to be characterized.
The purpose of this introduction is to guide the reader to an appreciation of the importance of the theme of the book through: a preliminary clarification of the historical background relevant to the contemporary debate on the concept of truth in mathematics; a brief discussion of the mathematical and philosophical importance of such a concept; and a sketch of the applicability of the concept of truth in set theory.
Truth and objectivity from a verificationist point of view
Authors: Prawitz Dag 
Published: November 2023

Abstract
Truth in mathematics is a very appropriate theme for a conference on what mathematics is about. Questions of truth often work as a catalyst in bringing out contrasts between different positions concerning the nature of a given field. For instance, the question of the applicability of truth is a main issue in discussions on the position known as mathematical formalism, a position that occurs in many versions. Hilbert’s variant of formalism is based on the idea that so-called real sentences are true or false while all other sentences lack truth values. In his chapter in this volume, Dales (1998) seems to advocate a more radical formalism. Challenging the realist conception of mathematics by saying that it takes truth as a key notion but leaves unanswered how truth is established, he takes the merit of formalism to be that it accounts for the nature of mathematics without relying upon any notion of truth. The critics of such a strict formalism typically claim that in the end even the formalist account will depend on some notion of truth. I think that such a criticism can be rightly levelled also against Dales’s formalism. He proposes that a mathematical theorem is to be understood as asserting that a certain formula follows logically from certain axioms, but if fallows logically is understood as follows according to the rules of predicate calculus, then the proposal reduces mathematics to a body of truths about a certain calculus, a certain formal game if you want. This makes mathematics a science that still pursues truths, although truths of a special kind, and we are left with explaining the nature of such truths.
Truth, rigour, and common sense
Authors: Manin Yu. I 
Published: November 2023

Abstract
The main difficulty of discussing the nature of mathematical truth in 1995 as I see it is that no new insights into it have been gained since the epoch of deep discoveries crowned by Godel’s results of the late thirties.
To avoid repetition and to enliven the discourse one can try to put the matter into a broader context and add a personal note. Both solutions tend to divert the reader’s attention to vaguely related topics, and I offer my apology for choosing these dubious tactics.musings on the history of mathematics perceived as a genre of symbolic (or semiotic) games; a discussion of truth and proof in the context of contemporary research (centering on a recent controversy prompted by a letter by A.
Mathematical definability
Authors: Slaman Theodore A 
Published: November 2023

Abstract
One might fairly say that the mathematical analysis of definability began in 1931, with the appearance of Gödel’s Incompleteness Theorem (Gödel 1931). Gödel showed that, for sufficiently strong formal systems T, there exist undecidable statements φ such that there is no proof of φ or of φ within T. This theorem pointed to an intrinsic incompleteness within the formal notion of proof.
The method of computation by algorithm is more general than that of verification by formal proof. It too was shown to be incomplete, but it took some time to develop the technical apparatus needed to state this incompleteness correctly. (Kleene 1987), in his biographical memoir of Gödel, recalls this development and we summarize some of his remarks. Kleene describes the intuitive notion of an algorithm as follows.