To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Combinatorial games are the strategy games that people like to play, for example chess, Hex, and Go. They differ from economic games in that there are two players who play alternately with no hidden cards and no dice. These games have a mathematical structure that allows players to analyse them in the abstract. Games of No Chance 4 contains the first comprehensive explorations of misère (last player to move loses) games, extends the theory for some classes of normal-play (last player to move wins) games and extends the analysis for some specific games. It includes a tutorial for the very successful approach to analysing misère impartial games and the first attempt at using it for misère partisan games. Hex and Go are featured, as well as new games: Toppling Dominoes and Maze. Updated versions of Unsolved Problems in Combinatorial Game Theory and the Combinatorial Games Bibliography complete the volume.
Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.
In this paper, we study discrepancy questions for spanning subgraphs of $k$-uniform hypergraphs. Our main result is that, for any integers $k \ge 3$ and $r \ge 2$, any $r$-colouring of the edges of a $k$-uniform $n$-vertex hypergraph $G$ with minimum $(k-1)$-degree $\delta (G) \ge (1/2+o(1))n$ contains a tight Hamilton cycle with high discrepancy, that is, with at least $n/r+\Omega (n)$ edges of one colour. The minimum degree condition is asymptotically best possible and our theorem also implies a corresponding result for perfect matchings. Our tools combine various structural techniques such as Turán-type problems and hypergraph shadows with probabilistic techniques such as random walks and the nibble method. We also propose several intriguing problems for future research.
Variable topological space robots are essential for providing adaptability and flexibility, enabling the robot to adjust its morphology to perform a range of tasks in the unstructured environment of space. However, impact is a common consequence of topology transformation in space robotics, which may lead to irreversible damage, such as the shedding of solid lubrication on joints. Nevertheless, determining the precise force-time relationships of such impacts poses significant challenges, especially when accounting for various connection mechanisms. In this work, a docking strategy that optimizes the manipulator’s joint angle configuration to minimize the impulse when the topology changes is proposed. First, an estimation technique is developed to quantify the impulse generated by topology transformation, employing spatial operator algebra and generalized momentum balance equations. Based on this model, the impulse minimization is modelled as a bilevel optimization problem, which decomposes a complex multipolar problem into two simpler subproblems. Although this optimization model may compromise computational efficiency, it increases the probability of achieving an optimal solution. To address this, a bilevel solution strategy based on a heuristic algorithm is proposed. In this framework, the lower level uses particle swarm optimization to determine the global optimum, while the upper level adopts simulated annealing to enhance computational speed. Finally, simulations are conducted to validate the proposed approach. Results demonstrate that the proposed method substantially reduces impulse.
Mobile systems, whose components communicate and change their structure, now pervade the informational world and the wider world of which it is a part. The science of mobile systems is as yet immature, however. This book presents the pi-calculus, a theory of mobile systems. The pi-calculus provides a conceptual framework for understanding mobility, and mathematical tools for expressing systems and reasoning about their behaviours. The book serves both as a reference for the theory and as an extended demonstration of how to use pi-calculus to describe systems and analyse their properties. It covers the basic theory of pi-calculus, typed pi-calculi, higher-order processes, the relationship between pi-calculus and lambda-calculus, and applications of pi-calculus to object-oriented design and programming. The book is written at the graduate level, assuming no prior acquaintance with the subject, and is intended for computer scientists interested in mobile systems.
This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known names in the field, such as Elwyn Berlekamp and John Conway, plus other researchers in mathematics and computer science, together with some top game players. The articles run the gamut from theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with a bibliography by A. Fraenkel and a list of combinatorial game theory problems by R. K. Guy. Like its predecessor, Games of No Chance, this should be on the shelf of all serious combinatorial games enthusiasts.
The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory. Written by a leading expert in the field, this book presents a theory for constructing such hard tautologies. It introduces the theory step by step, starting with the historic background and a motivational problem in bounded arithmetic, before taking the reader on a tour of various vistas of the field. Finally, it formulates several research problems to highlight new avenues of research.
Due to the effects of tolerance, design, and manufacturing deviations, there are clearances in the revolute joints of mechanical arms. These clearances can easily lead to system impacts and vibrations, resulting in a decrease in dynamic performance and affecting the trajectory tracking accuracy of the end effector. The existing dynamic models of mechanisms with clearance in revolute joints lack comprehensiveness, universality, and systematicity, and have not addressed the impact of joint reaction forces within clearance revolute joints on the system. The impact collision problem of the revolute joints with clearance was systematically, accurately, and comprehensively modeled and simulated in this study based on multibody dynamics theory. Based on Hertz’s elastic theory, the LuGre friction model, and joint reaction forces, this paper constructs constraint and mechanical models of revolute joints with clearance based on the theory of multibody dynamics. To facilitate multibody dynamics analysis, the collision impact direction matrix is proposed and used for the first time to transform the mechanical model of revolute joints with clearance into external forces. The dynamic models of mobile parallel and double serial manipulators are then constructed. Through numerical simulations on different clearance amounts, tracking trajectories, and load parameters, the impact of revolute joint clearances on system dynamic performance is analyzed. The engineering significance of this research in dynamic analysis of mobile parallel manipulators under imperfect revolute joint conditions is also discussed.
Limited research has examined the quality of language MOOCs and no existing instrument has been developed to gauge learners’ evaluation of LMOOC quality. This study develops an LMOOC Quality Evaluation Scale (LQES) and validates it in the Chinese context, which has the largest number of LMOOC learners in the world. The data were collected from 2,315 LMOOC learners in China using a mixed-method approach. Development and validation of the scale involved (1) generation of an initial item pool based on a semi-structured interview and literature review, (2) refinement of scale items through consultation of LMOOC experts and a focus group interview, (3) exploration of the factor structure of the scale using exploratory factor analysis, and (4) validation and confirmation of the final scale using confirmatory factor analysis. A four-factor model, comprising Instructional Design, L2 Teachers’ Competence, Teaching Implementation, and Technical Support, emerged and was validated. The 26-item LQES provides an original and comprehensive framework for understanding the complexities of LMOOC quality. This study highlights the critical factors underpinning the evaluation of LMOOC quality and paves the way for further refining of the instrument in future research.
In this paper, the notion of structural completeness is explored in the context of a generalized class of superintuitionistic logics that also involve systems that are not closed under uniform substitution. We just require that each logic must be closed under $D$-substitutions assigning to atomic formulas only $\vee$-free formulas. For these systems, we introduce four different notions of structural completeness and study how they are related. We focus on superintuitionistic inquisitive logics that validate a schema called Split and have the disjunction property. In these logics, disjunction can be interpreted in the sense of inquisitive semantics as a question-forming operator. It is shown that a logic is structurally complete with respect to $D$-substitutions if and only if it validates Split. Various consequences of this result are explored. For example, it is shown that every superintuitionistic inquisitive logic can be characterized by a Kripke model built from $D$-substitutions. We also formulate an algebraic counterpart of this result that says that the Lindenbaum–Tarski algebra ${\mathscr{H}}$ of any inquisitive logic can be embedded into the Heyting algebra formed from left ideals of endomorphisms on ${\mathscr{H}}$. Additionally, we resolve a conjecture concerning superintuitionistic inquisitive logics due to Miglioli et al. and show that a false conjecture about superintuitionistic logics due to Minari and Wroński becomes true in the broader space of regular generalized superintuitionistic logics.
Exception handling has been successfully proposed in the past years as a simple yet powerful software engineering tool to promote modularity and decoupling, while also preserving robustness. Multi-agent systems (MAS) and organizations (MAOs), in turn, offer powerful abstractions to build distributed systems; current models and methodologies, however, fall short in addressing exception handling in a systematic way, not considering exceptions as part of their design. Thus, the problem is usually approached by ad hoc solutions that hamper code modularization and decoupling. In this work, we outline a vision of how exception handling in MAS can be granted by design. We present an extension of the organizational model and infrastructure adopted in JaCaMo, that explicitly encompasses the notion of exception as a first-class element in the design of an organization. Relying on such a model, we propose an exception handling mechanism that is seamlessly integrated with organizational concepts, such as responsibilities, goals, and norms. In an organization, besides responsibilities for organizational goals, we propose to specify also responsibilities for managing exceptions, that is, for providing feedback about the context in which exceptions occur, and for handling it.
In this paper, an improved U-net welding engineering drawing segmentation model is proposed for the automatic segmentation and extraction of sheet metal engineering drawings in the process of mechanical manufacturing, to improve the cutting efficiency of sheet metal parts. To construct a high-precision segmentation model for sheet metal engineering drawings, this paper proposes a U-net jump structure with an attention mechanism based on the Convolutional Attention Module (CBAM) attention mechanism. At the same time, this paper also designs an encoder jump structure with vertical double pooling convolution, which fuses the features after maximum pooling+convolution of the high-dimensional encoder with the features after average pooling+convolution of the low-dimensional encoder. The method in this paper not only improves the global semantic feature extraction ability of the model but also reduces the dimensionality difference between the low-dimensional encoder and the high-dimensional decoder. Using Vgg16 as the backbone network, experiments verify that the IoU, mAP, and Accu indices of this paper’s method in the welding engineering drawing dataset segmentation task are 84.72%, 86.84%, and 99.42%, respectively, which are 22.10, 19.09 and 0.05 percentage points higher compared to the traditional U-net model, and it has a relatively excellent value in engineering applications.
This research proposes an adaptive human-robot interaction (HRI) that combines voice recognition, emotional context detection, decision-making, and self-learning. The aim is to overcome challenges in dynamic and noisy environments while achieving real-time and scalable performance. The architecture is based on a three-stage HRI system: voice input acquisition, feature extraction, and adaptive decision-making. For voice recognition, modern pre-processing techniques and mel-frequency cepstral coefficients are used to robustly implement the commands. Emotional context detection is governed by neural network classification on pitch, energy, and jitter features. Decision-making uses reinforcement learning where actions are taken and then the user is prompted to provide feedback that serves as a basis for re-evaluation. Iterative self-learning mechanisms are included, thereby increasing the adaptability as stored patterns and policies are updated dynamically. The experimental results show substantial improvements in recognition accuracy along with task success rates and emotional detection. The proposed system achieved 95% accuracy and a task success rate of 96%, even against challenging noise conditions. It is apparent that emotional detection achieves a high F1-score of 92%. Real-world validation showed the system’s ability to dynamically adapt, thus mitigating 15% latency through self-learning. The proposed system has potential applications in assistive robotics, interactive learning systems, and smart environments, addressing scalability and adaptability for real-world deployment. Novel contributions to adaptive HRI arise from the integration of voice recognition, emotional context detection, and self-learning mechanisms. The findings act as a bridge between the theoretical advancements and the practical utility of further system improvements in human-robot collaboration.
This chapter examines the critical role of evaluation within the framework of recommender systems, highlighting its significance alongside system construction. We identify three key aspects of evaluation: the impact of metrics on optimization quality, the collaborative nature of evaluation efforts across teams, and the alignment of chosen metrics with organizational goals. Our discussion spans a comprehensive range of evaluation techniques, from offline methods to online experiments. We explore offline evaluation methods and metrics, offline simulation through replay, online A/B testing, and fast online evaluation via interleaving. Ultimately, we propose a multilayer evaluation architecture that integrates these diverse methods to enhance the scientific rigor and efficiency of recommender system assessments.
The introduction of advanced deep learning models such as Microsoft’s Deep Crossing, Google’s Wide&Deep, and others like FNN and PNN in 2016 marked a significant shift in the field of recommender systems and computational advertising, establishing deep learning as the dominant approach. This chapter discusses the evolution of traditional recommendation models and highlights two main advancements in deep learning models: enhanced expressivity for uncovering hidden data patterns and flexible model structures tailored to specific business use cases. Drawing on techniques from computer vision, speech, and natural language processing, deep learning recommendation models have rapidly evolved. The chapter summarizes several influential deep learning models and constructs an evolution map. These models are selected based on their industry impact and their role in advancing deep learning recommender systems. Additionally, the chapter will introduce applications of Large Language Models (LLMs) in recommender systems, exploring how these models further enhance recommendation technologies.
This chapter explores the integration of deep learning in recommender systems, highlighting its significance as a leading application area with substantial business value. We examine notable advancements driven by industry leaders like Meta, Google, Airbnb, and Alibaba. These innovations mark a transformative shift toward deep learning in recommender systems, evidenced by Alibaba’s ongoing innovations in e-commerce and Airbnb’s applications in search and recommendation. For aspiring recommender system engineers, the current era of open-source code and knowledge sharing provides unparalleled access to cutting-edge applications and insights from industry pioneers. This chapter aims to build a foundational understanding of deep learning recommender systems developed by Meta, Airbnb, YouTube, and Alibaba, encouraging readers to focus on technical details and engineering practices for practical application.
This concluding chapter revisits the overarching architecture of recommender systems, encouraging readers to synthesize the technical details discussed throughout the book into a cohesive knowledge framework. Initially introduced in Chapter 1, the technical architecture diagram serves as a foundational reference for understanding the field. With a comprehensive overview of each module now complete, readers are invited to refine their interpretations of the architecture. Establishing a personal knowledge framework is crucial for identifying gaps, appreciating details, and maintaining a holistic view of the subject.