bluuebunny/crossref_metadata_2025_split huggingface dataset:
New International Regime for Orderly Movements of People: What will it Look Like?
Authors: Ghosh Bimal 
Published: November 2023

Abstract
It has been argued in Chapter 1 that in order to be politically acceptable and operationally viable, a new multilateral regime for movements of people must be based on the principle of regulated openness. The first section of this concluding chapter spells out the implications of this concept by discerning the general configuration and salient features of the regime. The next section takes up the question as to what exactly individual countries and the world society can gain from the adoption of such a regime.
Elite Transforn1ation and Modes of Representation since the Mid-Nineteenth Century: Some Theoretical Considerations
Authors: Best Heinrich , Cotta Maurizio 
Published: November 2023

Abstract
It is now approximately thirty years since Stein Rokkan developed his theoretical framework and empirical grid for a comparative study of nation building and state formation in Western Europe. His systematizations became the intellectual guideline for several generations of sociologists and political scientists and the point of departure for numerous research projects in comparative political sociology. In Rokkan’s conceptual framework, political elites formed a central object of interest because their structure sets the stage for the formation of sociopolitical coalitions, which are in turn the decisive, explanatory factor for the variations among European party systems. In his initial proposal for a grid of indicators for the comparative study of political development, there was already a section on the recruitment of elite groups. Recruitment patterns were of particular interest for Rokkan because he maintained that the changing composition of elites reflects the processes of social and political mobilization, of societal integration, and the establishment of rules for access to positions and resources in a society (Rokkan 1967).
Aspects of Approximation with Emphasis on the Univariate Case
Authors: Watson G A 
Published: November 2023

Abstract
This paper focusses on some aspects of approximation which are seen to be important from the numerical analysis point of view, and which have seen activity in the last 10 years. Its emphasis is on univariate approximation, which is an extensive area, and many topics could be covered. Perhaps the development which has stimulated most interest over this period is that of wavelets. This subject has expanded extremely rapidly, there have been many theoretical advances, and it has been the focus of many potential and actual applications. It is clearly not possible to do justice to all of this here, particularly for a non-specialist audience: we content ourselves by providing an introduction to the topic which we hope will stimulate further interest. Of course, wavelets can also be multivariate, although we will not consider those here. For some approximation problems, the number of independent variables is actually not very important, and this is certainly true of some of the topics considered in the rest of the paper. However, what they all have in common is that they are not inherently multivariate, and so do not fit naturally into that category.
Methods for Nonlinear Constraints in Optimization Calculations
Authors: Conn Andrew R , Gould Nicholas I M , † Philippe L Toint 
Published: November 2023

Abstract
Ten years ago, the broad consensus among researchers in constrained optimization was that sequential quadratic programming (SQP) methods were the methods of choice. While, in the long term, this position may be justified, the past ten years have exposed a number of difficulties with the SQP approach. Moreover, alternative methods have shown themselves capable of solving large-scale problems. In this paper, we shall outline the defects with SQP methods, and discuss the alternatives. In particular, we shall indicate how our understanding of the subproblems which inevitably arise in constrained optimization calculations has improved. We shall also consider the impact of interior-point methods for inequality constrained problems, described elsewhere in this volume, and argue that these methods likely provide a more useful Newton model for such problems than do traditional SQP methods. Finally, we shall consider trust-region methods for constrained problems, and the impact of automatic differentiation on algorithm design.
Worst-case identification of functions
Authors: Partington Jonathan R 
Published: November 2023

Abstract
This chapter is the first one devoted largely to applications of the general theory of interpolation and recovery. After giving a brief summary of some of the ideas behind systems theory, we shall set up the standard worst-case identification problem, as formulated by Helmicki, Jacobson, and Nett, and relate it to the ideas developed in the previous chapters.
Combinatorial Designs and Tournaments
Authors: Anderson Ian 
Published: November 2023

Abstract
The mathematics of tournament design are surprisingly subtle, and this book, an extensively revised version of Ellis Horwood's popular Combinatorial Designs: Construction Methods, provides a thorough introduction. It includes a new chapter on league schedules, which discusses round robin tournaments, venue sequences, and carry-over effects. It also discusses balanced tournament designs, double schedules, and bridge and whist tournament design. Readable and authoritative, the book emphasizes throughout the historical development of the material and includes numerous examples and exercises giving detailed constructions.
Self-orthogonal Latin sqnares
Authors: Anderson Ian 
Published: November 2023

Abstract
In the previous chapter we presented a proof of the fact that, if n ≠ 2 or 6, two MOLS of order n exist. This result, the culmination of a great deal of effort spurred on by a conjecture almost 200 years old, is not, however, the end of the story. However, another remarkable development will be dealt with in this chapter: it will be shown that, for every n ≠ 2, 3, or 6, there exists a Latin square of order n which is orthogonal to its transpose! Such Latin squares are useful in the construction of other combinatorial structures such as whist tournaments.
League schedules
Authors: Anderson Ian 
Published: November 2023

Abstract
In a round robin tournament, every team plays every other team once. If there are 2n teams, and the n(2n -1) games are to be arranged into 2n -l rounds, with each team playing in one game in each round, we seek a resolvable (2n,2, 1) design. As we have already seen in sections 1.2 and 2.3, such league schedules can be obtained elegantly by the ‘circle method’ and, more generally, by the use of a difference system. For example, the Scottish Rugby Union used the design of Example 1.2.3 for its 1995 premier league, altering the home and away venues slightly (we shall discuss this further in section 8.2).
Completion
Authors: Lowen R 
Published: November 2023

Abstract
The fact that AP contains both TOP and pMET𝒯 as full and isomorphism-closed subconstructs implies that we have to consider both the notions of completion and of compactification, at least for uniform approach spaces. In the present chapter we construct a completion which coincides with the usual completion in the case of p-metric spaces and which is an epireflection from the subconstruct of Hausdorff uniform approach spaces to the subconstruct of complete Hausdorff uniform approach spaces. In the second section we look at the relationship between the pMET𝒯 -coreflection of this completion and the usual metric completion in the special case of function spaces.
A-DNA duplexes in the crystal
Authors: Whhl Markus C , Sundaralingam Muttaiya 
Published: November 2023

Abstract
More than four decades after the first crystallographic evidence for A-DNA (1), we are now confronted with a large number of single-crystal structures of short A-DNA duplexes, through which we are able to begin to understand some of the principles governing their helical structure and their interaction with ligands. The stunning diversity of fine structures promotes a picture of the DNA double helix in which A- and B-forms denote the hemispheres of the right-handed structural continuum (2,3).
Twistors, Geometry, and Integrable Systems
Authors: Ward R S 
Published: November 2023

Abstract
I am delighted to be able to make this contribution to the celebration of Roger Penrose’s 65th birthday. The subject is that of integrable systems and their relation to geometry and twistor theory. When twistors were created, about thirty years ago, their creator did not have integrable systems as his primary motivation: Roger was aiming at a wider class of physical problems. In a sense, integrable systems are a cop-out: they deliberately avoid the messiest interactions and dynamics that occur in the real world. But they do provide a window onto nonlinear, coherent, nonperturbative phenomena—these become accessible, beautiful, and (if you look at them in the right way) geometrical. In the words of Mason and Woodhouse [8], “they combine tractability with nonlinearity, so they make it possible to explore nonlinear phenomena while working with explicit solutions”.
Hyperbolic 3-Manifolds
Authors: Matsuzaki Katsuhiko , Taniguchi Masahiko 
Published: November 2023

Abstract
In this chapter we give several models of the 3-dimensional hyperbolic space H3, the definition of hyperbolic 3-manifolds and the representation of them by Kleinian groups. In the last section, we briefly discuss some examples of hyperbolic 3-manifolds.
The basis of Kleinian group theory
Authors: Matsuzaki Katsuhiko , Taniguchi Masahiko 
Published: November 2023

Abstract
We have seen that Kleinian groups are discrete subgroups of PSL2(C) as well as properly discontinuous groups acting on the hyperbolic space H3. In Section 2.1, we state fundamental facts about the action of Kleinian groups on H3 and S. ∞
The sphere at infinity
Authors: Matsuzaki Katsuhiko , Taniguchi Masahiko 
Published: November 2023

Abstract
We have seen that a quasi-isometric automorphism of the hyperbolic space H3 extends to the quasiconformal automorphism of the sphere at infinity S ∞ (Theorem 3.22). By this fact, the interior and the boundary of a Kleinian manifold Mr are closely related; we analyze the action of r on S∞ for the investigation of deformations of the interior structure.
Algebraic and geometric convergence
Authors: Matsuzaki Katsuhiko , Taniguchi Masahiko 
Published: November 2023

Abstract
In this chapter, we discuss the geometric convergence of Kleinian groups. Algebraic convergence, which was defined in Section 4.3.1 from the natural topology of the representation space, is a basic concept of convergence; however it does not necessarily imply convergence of the corresponding Kleinian manifolds. In particular, they differ on boundaries of quasiconformal deformation spaces.
Molecular replacement techniques and direct methods
Authors: Giacovazzo Carmelo 
Published: November 2023

Abstract
The same protein, under different crystallization conditions (e.g. change of pH, change of solvent) can crystallize in different space groups. On the other hand, homologous proteins (end points of divergent evolution from a single primitive protein, but very similar in tertiary structure) often crystallize in different space groups. We can expect that the diffraction patterns of such similar proteins will be related to each other. A third case may be considered: if more than one protein molecule is packed in the same asymmetric unit a local (or non- crystallographic) axis will relate the different units.
Geometries in collision: Einstein, Klein and Riemann
Authors: Norton John D 
Published: November 2023

Abstract
Of all the achievements of modern theoretical physics, one stands out as unique. Without discernible intermediaries, the general theory of relativity completely transformed our understanding of gravitation. Gravitation ceased to be a field in space and time like the electromagnetic field; it became the geometric curvature of space-time itself. And this transformation was effected essentially by just one scientist, Albert Einstein. Nonetheless, in the eight decades that have passed since Einstein ‘s achievement, a growing chorus of voices have cried that, in spite of his unique success, Einstein never understood the foundations of his own theory. The focus of these problems is Einstein ‘s claims concerning relativity principles, covariance principles and coordinate systems. Specifically, Einstein ‘s theory is generally covariant; its equations remain unchanged in form under arbitrary transformations of the coordinates. Through this property, Einstein claimed, his theory had effected the most complete generalization of the relativity of inertial motion of the special theory to a more general relativity that embraced acceleration.
Topological Classification of Continuous-Time Linear Hyperbolic Cocycles
Authors: Cong Nguyen Dinh 
Published: November 2023

Abstract
Theorem 7.4.2 can be rephrased as follows: two linear hyperbolic cocycles are conjugate if and only if they have stable subspaces of the same dimension and their restrictions to their stable subspaces are both orientation preserving or orientation reversing with respect to a measurable choice of orientations on those stable subspaces. We remark that in our continuous-time case the continuity int of linear cocycles plays an important role. As noted by Arnold [10), in the theory of random dynamical systems the interplay of measurability and dynamics is of crucial importance. Here, in our continuous-time case, the continuity in t of linear cocycles enters the game. It allows us to reduce the number of orientation conditions for a topological conjugacy from two in the discrete-time case (see Chapter 4) to one. So, roughly speaking, in general there are fewer topological classes of continuous-time linear hyperbolic cocycles than there are for discrete- time, but there are still more than for deterministic flows.
Introduction
Authors: Karpinski Marek , Rytter Wojciech 
Published: November 2023

Abstract
A graph is a useful abstraction of many real world situations. It occurs when a problem is essentially related to the structure of interconnections between some objects. For example, a road map can be viewed as a graph: the interconnected objects are cities and connections correspond to roads. The connections can be one-way or two-way, and the corresponding graph can be directed or undirected. Another real world example is a group of people, the connections between them corresponding to the relation “the person x knows the person y”. In abstract graph terminology the interconnected objects (cities, persons) are called vertices or nodes (these terms are equivalent terms in this book). The connections are called edges. In the case of relation “x knows y” we have an edge ( x, y). A graph G is formally given by a pair G = (V, E), where V is the set of vertices and E is the set of edges. The edges can be unordered pairs of different vertices: the graph is called undirected; or ordered pairs: the graph is directed. We consider only the case when all edges are undirected or all edges are directed. Also we do not allow multiple edges between the same vertices (in the directed case between the same ordered pair). We assume that V is finite and its cardinality is usually denoted by n. This is the main parameter related to the size of the graph. The second parameter is the number m of edges of a given graph.
Parallel algorithms for f-matchings
Authors: Karpinski Marek , Rytter Wojciech 
Published: November 2023

Abstract
In this chapter we present randomized and deterministic NC-algorithms for maximum and (inclusion) maximal f-matchings (which are natural generalizations of matchings). In particular each (usual) matching is a I-matching. Let G be an undirected graph with an integer capacity f(v) associated with each vertex v. A subset M of the set of edges of G is an f-matching if and only if each vertex v in G is incident to at most f(v) edges in M. An f-matching is maximal if and only if it is not properly contained in another f-matching. An example of a maximal f-matching containing 10 edges is illustrated in Figure 11.1; the maximum cardinality f-matching in this case has 11 edges. The parallel computation of a maximal f-matching is generally more difficult than that of a maximal matching. Obviously, a maximal f-matching can be computed in linear time by a greedy sequential algorithm. Unfortunately we do not know how to parallelize this algorithm. In Chapter 7 we presented an RNC¬ algorithm for maximal matchings. By generalizing this randomized algorithm we can present a simple randomized algorithm for maximal f-matching which runs in O(log3 n) time with O(n + m) processors. The deterministic NC-algorithm is much more complicated. It is based on the Israeli and Shiloach deterministic algorithm for maximal matchings, see [IS86]. It was generalized in [DGL93] to maximal f-matching.
Reminiscences of the Early Days of the Spectrum of Ocean Waves
Authors: Ursell F 
Published: November 2023

Abstract
The wave spectrum was introduced into oceanography through the work of The Admiralty Wave Group (Group W) which was set up in June 1944 to develop rules for the forecasting of waves on ocean beaches. The work of Group W showed that the propagation of ocean waves outside the storm area follows the laws of classical linear dynamics: each wave component is propagated with the appropriate group velocity. It was thus found possible to use observations on shore to trace each component in dependently back into the storm area and to correlate its amplitude with weather data in the storm area. This work has since then become the basis of modern wave forecasting. The author was a member of Group W from its earliest days to 1947, and in the present paper he comments on the early work of Group W and on some of the scientists who were members of that Group.
Homogenization of Multiple Integrals
Authors: Braides Andrea , Defranceschi Anneliese 
Published: November 2023

Abstract
The object of homogenization theory is the description of the macroscopic properties of structures with fine microstructure, covering a wide range of applications that run from the study of properties of composites to optimal design. The structures under consideration may model cellular elastic materials, fibred materials, stratified or porous media, or materials with many holes or cracks. In mathematical terms, this study can be translated in the asymptotic analysis of fast-oscillating differential equations or integral functionals. The book presents an introduction to the mathematical theory of homogenization of nonlinear integral functionals, with particular regard to those general results that do not rely on smoothness or convexity assumptions. Homogenization results and appropriate descriptive formulas are given for periodic and almost- periodic functionals. The applications include the asymptotic behaviour of oscillating energies describing cellular hyperelastic materials, porous media, materials with stiff and soft inclusions, fibered media, homogenization of HamiltonJacobi equations and Riemannian metrics, materials with multiple scales of microstructure and with multi-dimensional structure. The book includes a specifically designed, self-contained and up-to-date introduction to the relevant results of the direct methods of Gamma-convergence and of the theory of weak lower semicontinuous integral functionals depending on vector-valued functions. The book is based on various courses taught at the advanced graduate level. Prerequisites are a basic knowledge of Sobolev spaces, standard functional analysis and measure theory. The presentation is completed by several examples and exercises.
Lysosmal Cysteine Proteases
Authors: Kirschke Heidrun 
Published: November 2023

Abstract
Lysosomal cysteine proteinases are proteolytic enzymes with a cysteine residue in the active site, which degrade proteins taken up by the cell or originating in other cell compartments. They catalyze the hydrolysis of peptide, amide, ester, and thiol bonds, dependent on pH and the presence of reducing compounds. This new volume in the protein profile series examines each known cathepsin in turn, examining gene structure and localization; precursors, purification, activation, and inhibition; and hydrolysis of synthetic substrates, polypeptides, and proteins. Other topics include structures and evolution, reaction with inhibitors, and physiological functions of lysosomal cysteine proteinases and their role in disease. The book also includes an extensive bibliography to assist the reader in further research.
Characters of Finite Coxeter Groups and Iwahori-Hecke Algebras
Authors: Geck Meinolf , Pfeiffer Golz 
Published: November 2023

Abstract
Finite Coxeter groups and related structures arise naturally in several branches of mathematics, for example, the theory of Lie algebras and algebraic groups. The corresponding Iwahori-Hecke algebras are obtained by a certain deformation process. They have applications in the representation theory of groups of Lie type and the theory of knots and links. The aim of this book is to develop the theory of conjugacy classes and irreducible characters, both for finite Coxeter groups and the associated Iwahori-Hecke algebras. The topics range from classical results to more recent developments and are treated in a coherent and self-contained way. This is the first book which develops these subjects both from a theoretical and an algorithmic point of view in a systematic way. All types of finite Coxeter groups are covered.
The best of alll possible worlds?
Authors: Acheson David 
Published: November 2023

Abstract
Suppose that a ray of light is reflected by a mirror from some given point A to another given point B. It is well known that the point of reflection, P, is such that the rays AP and PB make equal angles with the mirror (Fig. 8.1). But there is in fact a quite different and more intriguing way of expressing the same physical result, namely that the point of reflection P is such that the total distance AP + PB is as small as possible.
Cell assembly
Authors: Dudai Yadin 
Published: November 2023

Abstract
In 1949, Hebb published The organization of behavior, later to become the most influential book in the history of modern neuroscience (*classic). ‘In this book’, he wrote, ‘I have tried … to bridge the gap between neurophysiology and psychology’. In essence, Hebb’s monograph was about how the brain *perceives and represents the world. It has yielded important insights into brain function, as well as two major concepts.
Flashbulb memory
Authors: Dudai Yadin 
Published: November 2023

Abstract
In recent years, brain research has unveiled clues to the biological mechanisms that encode the memory of intensely emotional and consequential events. These candidate mechanisms deal with two *levels of brain organization: the circuit level and the cellular level. The circuit mechanisms are assumed to involve subcortical modulation of the *cerebral cortex, which causes certain sensory events to be *perceived as highly salient because of the concomitant activation (*coincidence detection) of neuromodulator systems such as the *acetylcholine and the *noradrenaline systems (Naor and Dudai 1996; McGaugh and Cahill 1997; Tang et al. 1997).
Generalization
Authors: Dudai Yadin 
Published: November 2023

Abstract
The functional counterpart of ‘generalization’ is ‘discrimination’, which is the ability to distinguish one stimulus or response from another. This is why it is convenient to treat these faculties together. Discrimination increases the repertoire of fine-tuned *perception and response, but places a burden on *capacity; generalization diminishes the sensitivity to input noise, but limits the degrees of freedom of the behavioural repertoire and could increase the proportion of false-positive responses. A *subject could be well capable of discriminating among two events, but still generalize its response to them if this pays off behaviourally.