bluuebunny/crossref_metadata_2025_split huggingface dataset:
The Design of Optimum Multifactorial Experiments
Authors: Plackett R L , Burman J P 
Published: November 2023

Abstract
A problem which often occurs in the design of an experiment in physical or industrial research is that of determining suitable tolerances for the components of a certain assembly; more generally of ascertaining, the effect of quantitative or qualitative alterations in the various components upon some measured characteristic of the complete assembly. It is sometimes possible to calculate what this effect should be; but.it is to the more general case when this is not so that the methods given below apply. In such a case it might appear to be best to vary the components independently and study separately the effect of each in turn. Such a procedure, however, is wasteful either of labour or accuracy, while to carry out a complete factorial experiment (i.e. to make up assemblies of all possible combinations of the n components) would require L n assemblies, where L is the number of values (assumed constant) at which each component can appear. For L equal to 2 this number is large for moderate n and quite impracticable for n greater than, say, 10. For larger L the situation is even worse. What is required is a selection of N assemblies from the complete factorial design which will enable the component effects to be estimated with the same accuracy as if attention had been concentrated on varying a single component throughout the N assemblies.
A general method for analysis of covariance structures
Authors: Jöreskog K G 
Published: November 2023

Abstract
It is assumed that observations on a set of variables have a multivariate normal distribution with a general parametric form of the mean vector and the variance-covariance matrix. Any parameter of the model may be fixed, free or constrained to be equal to other parameters. The free and constrained parameters are estimated by maximum likelihood. A wide range of models is obtained from the general model by imposing various specifications on the parametric structure of the general model. Examples are given of areas and problems, especially in the behavioural sciences, where the method may be useful.
E
Authors: Dodge Yadolah 
Published: November 2023

Abstract
ecologic study An investigation that examines the correlation between dis ease/event rates and exposure rates. The unit of analysis is groups rather than individuals. Therefore, it is important to note that the exposure for each individual is unknown. An example of such a study would be an investigation into the correlation between the rate of lung cancer in a group of adult males and the rate of smoking in the same group.
The slow development of a diplomat 1619–54
Authors: Hall Marie Boas 
Published: November 2023

Abstract
Henry Oldenburg was born in the ancient port and commercial city of Bremen, long a member of the Hanseatic League of trading cities and an even older Bishopric. The town had been founded on the right bank of the River Weser about fifty miles from the North Sea, with a New Town gradually developing on the left bank, the two becoming formally joined in the seventeenth century.
Other approaches to the four-colour problem
Authors: Wilson Robert A 
Published: November 2023

Abstract
There is a surprising connection between map-colouring and Hamilton cycles. We need to stay with the face-colouring version of the four-colour conjecture to make this connection explicit. A Hamilton cycle is a cycle which includes each vertex exactly once (in other words, it is a spanning cycle). A graph is called Hamiltonian if it has a Hamilton cycle. The origin of this term was Hamilton’s ‘icosian game’ of 1857, whose object was to find such a cycle on the dodecahedron (see Fig. 5.1), although the general question of whether any given polyhedron possesses such a cycle was considered slightly earlier by Kirkman (see [31,32]). The idea of a Hamilton cycle can be traced back to 1759, when Euler introduced the knight’s tour problem, though not of course in graph-theoretical language.
Maps on surfaces with holes
Authors: Wilson Robert A 
Published: November 2023

Abstract
It is a remarkable fact that although the map-colouring problem is so hard on the plane (or equivalently the sphere), it is much easier on the torus (a doughnut shape) or even on surfaces with larger numbers of holes. On the torus, for example, seven colours are necessary and sufficient. This was proved by Heawood in 1890, in the same paper in which he pointed out Kempe’s mistake.
Reducibility
Authors: Wilson Robert A 
Published: November 2023

Abstract
In the eventual proof of the four-colour theorem, the first step, logically, is to use discharging to produce the unavoidable set, and then the second step is to prove reducibility of each configuration in the unavoidable set. However, historically, many of the reducibility arguments came first, and it is easier to appreciate the subtlety of the discharging arguments if we first see what they are being used for. Indeed, if we know that certain configurations are reducible, we can try to design our discharging algorithm to produce these particular configurations.
III	Sequential effects of dimensional overlap: findings and issues
Authors: Kornblum Sylvan , Stevens Gregory 
Published: November 2023

Abstract
Abstract. We begin this chapter by outlining some of the basic principles of the dimensional overlap (DO) model (Kornblum, Hasbroucq, and Osman 1990; Kornblum, Stevens, Whipple, and Requin 1999), spelling out how these principles generate a taxonomy of tasks, and showing how, based on these principles, the structure of four of these tasks can be represented by a common processing architecture, and performance with them accounted for. We then consider the effects of stimulus and response repetitions in choice reaction time (RT) tasks and the in2uence that DO has on this repetition effect. We report data from four experiments that demonstrate this in2uence with a prime-probe, trial pair procedure in which the relevant or irrelevant stimuli in either or both trials of the pair have DO and, in the case of relevant DO, repeat either physically or conceptually. The DO model is able to account for the results by postulating that the information requirements on repeated trials are less than on non-repeated trials. We call this the Information Reduction Hypothesis. When the relevant stimuli overlap, the repetition effects are accounted for by a reduction in either the stimulus and/or the response thresholds. When the irrelevant stimuli overlap, the repetition effects are accounted for by a reduction in the time needed to distinguish between relevant and irrelevant stimuli. Thus, depending on whether the relevant or irrelevant stimulus dimension has DO, one or the other of two parameters in the DO model is modi1ed, contingent on the occurrence of a repetition. Simulations, based on this implementation of the hypothesis in the DO model, 1t the experimental results well.
Perception and action: what, how, when, and why Introduction to Section I
Authors: Humphreys Glyn W 
Published: November 2023

Abstract
Over the past decade, a good deal of evidence has accumulated that perception and action can dissociate (see Milner and Goodale 1995, for one summary). Dissociations can occur even when perception and action are tested using the same object, and even when input from the same modality is used (e.g. vision). This leads to a counter-intuitive conclusion: that the information, and the underlying brain systems, may differ when we perceive and recognize a cup (on the one hand) and when we make a grasp action to pick it up (on the other). The papers reported in this section of the book are concerned with the relations between perception and action, and they provide state-of-the-art summaries of work on this important topic. The papers detail not only how perception and action can dissociate but also how they interact. This is clearly important if we are to understand how coherent behaviour emerges, and the papers presented here provide interesting suggestions as to how forms of integration can take place.
Action, binding, and awareness
Authors: Haggard Patrick , Aschersleben Gisa , Gehrke Jörg , Prinz Wolfgang 
Published: November 2023

Abstract
Abstract. This chapter focuses on the process of intentional action, on our conscious awareness of some events occurring during that process and on the chronometry of these conscious states. We 1rst introduce the concept of efferent binding: a hypothesized neural process which links representations of intentions to act to representations of the action itself, and 1nally to representations of the external consequences of action. We then describe two experiments investigating the perceived times of actions and of associated stimulus events. Our results provide evidence for an efferent binding process which influences conscious awareness, and which amounts to a common principle for conscious coding of perception and action.
Action perception and imitation: a tutorial
Authors: Bekkering Harold , Wohlschläger Andreas 
Published: November 2023

Abstract
Abstract. Currently, imitation, or performing an act after perceiving it, is in the focus of attention of researchers from many different disciplines. Although this tutorial attempts to provide some interdisciplinary background, it will concentrate on possible cognitive mechanisms that underlie imitation performance in human beings. First, the importance of imitation in the 1eld of social and developmental psychology will be stressed. Then, some important notions are introduced about what imitation is and who can and cannot imitate. In the second part of this tutorial, some of the currently most widely cited theories of imitation will be described. The third section gives an overview of the major 1ndings that have led to a new view on the mechanisms underlying imitation—the so-called goal-directed theory of imitation. The concluding remarks start with a discussion about the confusion of the goal concept and a taxonomical suggestion is made to capture the different meanings of the word ‘goal’. Finally, a functional model is proposed that describes the sensorimotor processes that transform action goals into the execution of movements, and vice versa, the transformation from movement perception into the recognition of action goals.
Does stimulus-driven response activation underlie the Simon effect?
Authors: Valle-Inclán Fernando , Hackley Steven A , Labra Carmen de 
Published: November 2023

Abstract
Abstract. The most influential explanations of the Simon effect assume that a spatial stimulus code automatically activates the spatially compatible response. However, the degree to which activation of the compatible response should be considered as an automatic, stimulus-driven process is uncertain. To assess this presumed automaticity we conducted two experiments to analyze the in2uence on the Simon effect of repetitions versus alternations of stimulus, response, and stimulus–response compatibility (SRC). The results indicate that the Simon effect is produced only when the previous trial is compatible. Furthermore, the lateralized readiness potential showed clear signs of incorrect response activation on incompatible trials when previous trial was compatible, but not when the previous trial was incompatible. These results indicate that SRC sequences are critical for the appearance of the Simon effect and that the stimulus spatial code alone does not automatically activate the spatially corresponding response.
Response features in the coordination of perception and action
Authors: Logan Gordon D , Zbrodoff N Jane 
Published: November 2023

Abstract
Abstract. Theories of congruency effects in Stroop, Simon, and S–R compatibility tasks often start with a node that represents a stimulus category and end with a node that represents a response category. We ask how a stimulus can activate a node and how a node can activate a response and suggest that congruency effects may stem from these prior and subsequent processes. Theories of word recognition propose several interacting stages between stimulus presentation and activation of a word node. Theories of speaking and typing propose several interacting stages between activation of a word node and the execution of a response. We focus on the response end, and show that the Stroop effect depends on individual features of the response ‘downstream’ from the response node. We show that the time for a vocal response depends on the speci1c phonemes that are activated by the Stroop distractor, whereas the time for a typewritten response depends on the speci1c 1nger movements that are evoked by the Stroop distractor. These results call for a theory of congruency effects that links current theories of word recognition with current theories of speaking and typing. Congruency effects may re2ect stimulus-driven interactions among response features.
Degree Theory in Analysis and Applications
Authors: Fonseca Irene , Gangbo Wilfrid 
Published: November 2023

Abstract
In this book we study the degree theory and some of its applications in analysis. It focuses on the recent developments of this theory for Sobolev functions, which distinguishes this book from the currently available literature. We begin with a thorough study of topological degree for continuous functions. The contents of the book include: degree theory for continuous functions, the multiplication theorem, Hopf`s theorem, Brower`s fixed point theorem, odd mappings, Jordan`s separation theorem. Following a brief review of measure theory and Sobolev functions and study local invertibility of Sobolev functions. These results are put to use in the study variational principles in nonlinear elasticity. The Leray-Schauder degree in infinite dimensional spaces is exploited to obtain fixed point theorems. We end the book by illustrating several applications of the degree in the theories of ordinary differential equations and partial differential equations.
Properties Of The Degree For Sobolev Functions
Authors: Fonseca Irene , Gangbo Wilfrid 
Published: November 2023

Abstract
In this chapter we present a generalization of Sard’s Lemma for Sobolev functions and the following change of variables formulae. Let D ⊂ ℝ𝒩 be open and bounded and assume that either p &gt;N or N −1 &lt; p ≤ N and Jϕ (x) &gt; 0 ℒN a.e. x ∈ D.
Restoration of 3D Real Images using Projection onto Convex Sets
Authors: Razaz M , Lee R A , Shaw P J 
Published: November 2023

Abstract
The projection onto convex sets (POCS) is a powerful iterative approach for the solution of inverse problems. One can easily incorporate into this approach a variety of useful constraints for image restoration which would otherwise be difficult to implement using the traditional image restoration techniques. We present the application of POCS for restoration of 3D real images. The underlying principle of the method is discussed in detail, and optical microscopy images restored by this method are presented and analysed. It will be shown that POCS is a versatile image restoration method and can produce high quality 1estored images if an appropriate set of constraints are used.
Analysis of Colour-Level Distribution 1n Filter Backwashing Videos
Authors: Fitzpatrick C S D 
Published: November 2023

Abstract
Granular media filters used in water treatment become dogged due to the accumulation of removed particles on the media grains. Periodic cleaning is required and is achieved by backwashing the filter with upflowing water with or without air scour. Backwashing efficiency can be improved by increasing bed agitation and reducing clean water consumption during cleaning. This is achieved using combined air and water upflow.
Axisymmetric Black-Hole Collisions At The Speed Of Light: Reduction To Two Independent Variables And Calculation Of The Second-Order News Function
Authors: D'eath P D 
Published: November 2023

Abstract
Here further progress will be described concerning the gravitational radiation emitted in the axisymmetric collision of two black holes at the speed of light. The preceding chapter was concerned with describing the problem and with setting up an analytical treatment using a perturbation approach. In this chapter we describe analytical simplifications which make feasible the numerical calculation of the second-order news function, which gives partial information about the angular distribution of gravitational radiation. Results and conclusions concerning the radiation emitted and consequent mass loss are presented in Chapter 8.
Eilenberg-Mac Lane and Moore Functors
Authors: Baues Hans-Joachim 
Published: November 2023

Abstract
We consider three types of Eilenberg–Mac Lane functors given by homology, cohomology, and pseudo-homology of Eilenberg–Mac Lane spaces. While the homology and cohomology of Eilenberg-Mac Lane spaces is extensively studied (see Eilenberg and Mac Lane [I], [II], Cartan [HC], and Decker [IH]), the pseudo-homology of Eilenberg-Mac Lane spaces is not treated in the literature. In our theory of boundary invariants, however, the pseudohomology arises naturally in the same way as the cohomology in the theory of k-invariants. For this reason we describe the cohomology and pseudohomology of Eilenberg- Mac Lane spaces along parallel lines.
Compactness
Authors: Meise Reinhold , Vogt Dietmar 
Published: November 2023

Abstract
In this chapter we shall consider the notion of compactness in topological spaces. In particular, we shall characterize compact subsets in metric spaces. Also, for later application, we will present the Arzelà-Ascoli, Stone-Weierstrass and Tychonoff theorems. The reader could skip this chapter and return to it when needed.
The Banach spaces Lp(X, µ) and C(X)′;
Authors: Meise Reinhold , Vogt Dietmar 
Published: November 2023

Abstract
In this chapter we will use the notations and statements from integration theory presented in Appendix A. Unless otherwise stated, we agree that in the sequel X is a locally compact, σ-compact, topological space andµ is a measure on X. Thus we considerµ on one side as a positive linear functional on Cc(X, ℝ) and on the other as a σ-additive set function on the σ-algebra :F of µ-measurable subsets of X (cf. A.25 and A.26). Further, we denote by ℳ, ℳ (X), L1 resp.Nall 𝕂-valued functions on X which are µ-measurable, Borel measurable, µ-integrable, resp. µ-null functions.
Unbounded operators between Hilbert spaces
Authors: Meise Reinhold , Vogt Dietmar 
Published: November 2023

Abstract
The spectral theory of normal and self-adjoint operators in Hilbert spaces treated thus far has a manifold of beautiful applications in dealing with integral equations. However, it is not suitable for dealing with (partial) differential equations and as a framework for classical quantum mechanics. The theory presented in the following three chapters will achieve this.
Projective and injective topologies
Authors: Meise Reinhold , Vogt Dietmar 
Published: November 2023

Abstract
In this chapter we shall generate new locally convex spaces from given ones. For this we shall familiarize ourselves with new concepts and the first applications of the duality theory. In particular, we generalize the closed graph and open mapping theorems of chapter 8. We begin with the two simplest situations, namely the product and the direct sum of locally convex spaces.
Codes
Authors: Curtis Robert T , Morris Tony R 
Published: November 2023

Abstract
In this chapter adjacency matrices of graphs are used to generate binary codes. By placing suitable conditions on the graph, we can ensure that the resulting code has certain desirable properties. In particular, we use the method to construct explicitly all binary self-dual doubly-even codes of length less than or equal to 24. In a recent paper [4], it was shown how the binary Golay code can be obtained from the graph of the icosahedron. In this chapter we exploit the technique of generating codes from graphs and show how, by imposing various conditions on the graph, we can ensure that the resulting code has certain desirable properties. In particular, we are able to produce all self-dual doubly-even binary codes of lengths 8, 12 and 24, simply by writing down a collection of graphs satisfying the conditions.
Topology
Authors: Beineke Lowell W 
Published: November 2023

Abstract
The primary focus of this chapter involves putting graphs on surfaces. Questions that we discuss include the following. Which graphs are planar; that is, which graphs can be drawn in the plane without any edges crossing? If a graph is not planar, what is the smallest number of crossings in any drawing of it? How many planar graphs are needed to form a given graph? In what surfaces can a non-planar graph be embedded? There are many links between graph theory and topology, but the strongest is that of drawings and embeddings of graphs on surfaces. Our survey of this area of mathematics is divided into two parts, the first (Sections 11.2-11.4) on graphs in the plane, including the topics of crossing number and thickness, and the second (Sections 11.5-11.8) on embeddings in other surfaces, both orientable and non-orientable.
Artificial Neural Networks
Authors: Anthony Martin 
Published: November 2023

Abstract
‘Artificial neural networks’ are machines (or models of computation) based loosely on the ways in which the brain is believed to work. In this chapter, we discuss some links between graph theory and artificial neural networks. We describe how some combinatorial optimization tasks may be approached by using a type of artificial neural network known as a Boltzmann machine. We then discuss ‘learning’ in neural networks, where we focus on the amount of training data required and the computational complexity. There has recently been intense, and fast-growing, interest in ‘artificial neural networks’. These are machines (or models of computation) based loosely on the ways in which the brain is believed to work. Neurobiologists are interested in using these machines as a means of modelling biological brains, but much of the impetus comes from their applications. For example, engineers wish to create machines that can perform ‘cognitive’ tasks, such as speech recognition, and economists are interested in financial time series prediction using such machines. Inevitably, there is a certain amount of hype associated with the subject, particularly in relation to neurobiological modelling.
Fungal Populations and Species
Authors: Burnett John 
Published: November 2023

Abstract
Recognizing and discriminating between fungal populations and the genetical processes that accompany them, including speciation is now a rapidly developing field that is heavily dependent upon the use of molecular markers. There was no basic text on this subject, John Burnett has provided such an account. The text describes the methodologies employed and, for the benefit of those without a background in mycology, a brief introduction to basic fungal biology. Recent findings relating to processes in fungal populations—mutation, migration, recombination, heterokaryosis, hybridization, polyploidy, and the operation of selective forces are combined with traditional fungal biology. Finally the taxonomic problems raised by fungal species are discussed, together with the processes of speciation.
Change in gene frequency in fungal populations-I. General considerations: selection for oligogenically determined traits
Authors: Burnett John 
Published: November 2023

Abstract
No organisms, fungi included, are exempt from the process of natural selection (Darwin 1859). The ways in which selection operates and affects fungal populations will be considered in this and the next chapter. Direct evidence of selection operating in natural situations is sparse, although some information is available from agricultural situations and experimental investigations of economically important characters of pathogens of crop plants in growth rooms, glasshouses or, less frequently, the field.