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.
In this chapter we introduce the main subject of the book, which is automatic sequences. Roughly speaking, an automatic sequence is a sequence over a finite alphabet whose nth term can be computed by a finite automaton reading a representation for n in a regular numeration system (Section 6.4).
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are replaced by string diagrams, topological entities that can be intuitively thought of as diagrams of wires and boxes. Recently, string diagrams have become increasingly popular as a graphical syntax to reason about computational models across diverse fields, including programming language semantics, circuit theory, quantum mechanics, linguistics, and control theory. In applications, it is often convenient to implement the equations appearing in SMTs as rewriting rules. This poses the challenge of extending the traditional theory of term rewriting, which has been developed for algebraic theories, to string diagrams. In this paper, we develop a mathematical theory of string diagram rewriting for SMTs. Our approach exploits the correspondence between string diagram rewriting and double pushout (DPO) rewriting of certain graphs, introduced in the first paper of this series. Such a correspondence is only sound when the SMT includes a Frobenius algebra structure. In the present work, we show how an analogous correspondence may be established for arbitrary SMTs, once an appropriate notion of DPO rewriting (which we call convex) is identified. As proof of concept, we use our approach to show termination of two SMTs of interest: Frobenius semi-algebras and bialgebras.
Although the automatic sequences form a large and interesting class, one drawback is that they need to take their values in a finite set. But many interesting sequences, such as (s2(n))n.0 (counting the sum of the bits in the base-2 representation of n), take their values in N (or Z, or any semiring). We would like to find a generalization that allows this.
Up to now our logical formulas have allowed us to state formulas concerning a single automatic sequence, or perhaps two at the same time (as in Section 8.9.3). In some cases, however, it’s possible to use our approach to prove results about infinitely many sequences (even uncountably many sequences) at once!
Due to the efficient and flexible flight ability of bats, bat-like robots have become the focus of research in the field of bionic robots. Aerodynamic calculation is an important part of the research field of bat-like robot, which is the basis of the structure design and flight controller design of bat-like robot. However, due to the complex flight mechanism of bats, there is no mature theoretical method to calculate the flight aerodynamic force of bat-like robots. To solve this problem, this paper takes the membrane of a bat-like robot as the research object and analyzes in detail the effects of wing folding and unfolding and flexible deformation of the membrane on the chord length, passive torsion angle and relative velocity. Based on quasi-steady state model and blade element method, a set of aerodynamic calculation method for flexible deformed wing is established. In order to verify the effectiveness of the proposed method, the theoretical calculation results and the results of the fluid-structure interaction simulation are compared and analyzed under various working conditions. The two results are in good agreement under each working condition, and the errors are all within reasonable range, which proves the effectiveness of the method. This study can provide a theoretical basis for rational structure design and precise flight control of bat-like robot.
The lower extremity rehabilitation exoskeleton is mainly used to help patients with movement disorders complete rehabilitation training. For the human-machine interaction problem of the lower limb rehabilitation exoskeleton, a fuzzy radial-based impedance (RBF-FVI) controller is proposed in this study. A six degree of freedom (DOF) lower extremity rehabilitation exoskeleton was developed, and the human-machine coupling dynamics model was established. To realize the compliance control of the human-machine coupling system, a novel RBF-FVI controller is designed, which includes an inner-loop fuzzy position control module and an outer-loop impedance control module. The inner-loop fuzzy position control module is mainly used to achieve the tracking control of the desired training trajectory and position adjustment amount. The outer-loop impedance control module regulates the impedance parameters and compensates for the uncertainty terms. The superiority of the proposed controller in trajectory following is verified through simulation and comparison tests. The hardware test of the human-machine coupling system was carried out, and the test results showed that the subject and the exoskeleton system could realize a coordinated and smooth movement.
Hydrogen sulfide (H2S, “sulfide”) is a naturally occurring component of the marine sediment. Eutrophication of coastal waters, however, can lead to an excess of sulfide production that can prove toxic to seagrasses. We used stable sulfur isotope ratio (δ34S) measurements to assess sulfide intrusion in the seagrass Halodule wrightii, a semi-tropical species found throughout the Gulf of Mexico, Caribbean Sea, and both western and eastern Atlantic coasts. We found a gradient in δ34S values (−5.58 ± 0.54‰+13.58 ± 0.30‰) from roots to leaves, in accordance with prior observations and those from other species. The results may also represent the first values reported for H. wrightii rhizome tissue. The presence of sulfide-derived sulfur in varying proportions (15–55%) among leaf, rhizome, and root tissues suggests H. wrightii is able to assimilate sedimentary H2S into non-toxic forms that constitute a significant portion of the plant’s total sulfur content.
We describe quantum circuits generating four-qubit maximally entangled states, the amount of entanglement being quantified by using the absolute value of the Cayley hyperdeterminant as an entanglement monotone. More precisely we show that this type of four-qubit entangled states can be obtained by the action of a family of $\mathtt{CNOT}$ circuits on some special states of the LU orbit of the state $|0000\rangle$.
This article uses a “mystery client” approach and visits the websites of National Statistical Offices and international microdata libraries to assess whether foundational microdata sets for countries in the Middle East and North Africa region are collected, up to date, and made available to researchers. The focus is on population and economic censuses, price data and consumption, labor, health, and establishment surveys. The results show that about half of the expected core data sets are being collected and that only a fraction is made available publicly. As a consequence, many summary statistics, including national accounts and welfare estimates, are outdated and of limited relevance to decision-makers. Additional investments in microdata collection and publication of the data once collected are strongly advised.
Taking the perspective of users and stakeholders can help designers incorporate human-centricity in their practice. However, we know relatively little of the dynamics of perspective taking – a cognitive facet of empathy – in design processes as a situated cognitive and behavioural activity, rather than as an overall orientation. To illuminate how perspective taking is used in design, we carried out a longitudinal multiple case study of 49-month-long graduate-level product and service design projects, exploring differences between high and midscale performance in different design phases. Through thematic analysis of review session discussions, we find that perspective taking in high-performing sessions involves three aggregate dimensions: gathering data to form perspectives, scoping and making sense of perspectives and using perspectives in creative processing. We identify phase-dependent characteristics for the scope and emphasis of perspective taking in concept development, system design and detailed design. We also describe different ways in which novice teams struggled to create and apply user perspectives. As a result, the current study sheds light on perspective taking and the changing nature of effective perspective taking across the design process.
The 2014 Research Excellence Framework (REF) assessed the quality of university research in the UK. 20% of the assessment was allocated according to peer review of the impact of research, reflecting the growing importance of impact in UK government policy. Beyond academia, impact is defined as a change or benefit to the economy, society, culture, public policy or services, health, the environment, or quality of life. Each institution submitted a set of four-page impact case studies. These are predominantly free-form descriptions and evidences of the impact of study. Numerous analyses of these case studies have been conducted, but they have utilised either qualitative methods or primary forms of text searching. These approaches have limitations, including the time required to manually analyse the data and the frequently inferior quality of the answers provided by applying computational analysis to unstructured, context-less free text data. This paper describes a new system to address these problems. At its core is a structured, queryable representation of the case study data. We describe the ontology design used to structure the information and how semantic web related technologies are used to store and query the data. Experiments show that this gives two significant advantages over existing techniques: improved accuracy in question answering and the capability to answer a broader range of questions, by integrating data from external sources. Then we investigate whether machine learning can predict each case study’s grade using this structured representation. The results provide accurate predictions for computer science impact case studies.
Graph embedding is a transformation of nodes of a network into a set of vectors. A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information about the graph, its subgraphs, and nodes themselves. If these objectives are achieved, an embedding is a meaningful, understandable, and often compressed representation of a network. Unfortunately, selecting the best embedding is a challenging task and very often requires domain experts. In this paper, we extend the framework for evaluating graph embeddings that was recently introduced in [15]. Now, the framework assigns two scores, local and global, to each embedding that measure the quality of an evaluated embedding for tasks that require good representation of local and, respectively, global properties of the network. The best embedding, if needed, can be selected in an unsupervised way, or the framework can identify a few embeddings that are worth further investigation. The framework is flexible and scalable and can deal with undirected/directed and weighted/unweighted graphs.
The concept of a synchronizing word is a very important notion in the theory of finite automata. We consider the associated decision problem to decide if a given DFA possesses a synchronizing word of length at most k, where k is the standard parameter. We show that this problem DFA-SW is equivalent to the problem Monoid Factorization introduced by Cai, Chen, Downey, and Fellows. Apart from the known $\textsf{W}[2]$-hardness results, we show that these problems belong to $\textsf{A}[2]$, $\textsf{W}[\textsf{P}],$ and $\textsf{WNL}$. This indicates that DFA-SW is not complete for any of these classes, and hence, we suggest a new parameterized complexity class $\textsf{W}[\textsf{Sync}]$ as a proper home for these (and more) problems. We present quite a number of problems that belong to $\textsf{W}[\textsf{Sync}]$ or are hard or complete for this new class.
Transbronchial lung biopsy is an effective and less-invasive treatment for the early diagnosis of lung cancer. However, the limited dexterity of existing endoscopic instruments and the complexity of bronchial access prevent the application of such procedures mainly for biopsy and diagnosis. This paper proposes a flexible robot for transbronchial lung biopsy with a cable-driven mechanism-based flexible manipulator. The robotic system of transbronchial lung biopsy is presented in detail, including the snake-bone end effector, the flexible catheters and the actuation unit. The kinematic analysis of the snake-bone end effector is conducted for the master-slave control. The experimental results show that the end effector reaches the target nodule through a narrow and tortuous pathway in a bronchial model. In conclusion, the proposed robotic system contributes to the field of advanced endoscopic surgery with high flexibility and controllability.
Robots with human-like appearances and structures are usually well accepted in the human–robot interaction. However, compared with human-like appearances and structures, the human-like motion plays a much more critical role in improving the efficiency and safety of the human–robot interaction. This paper develops a human-like motion planner based on human arm motion patterns (HAMPs) to fulfill the human–robot object handover tasks. First, a handover task is divided into two sub-tasks, that is, pick-up and delivery, and HAMPs are extracted for these two sub-tasks separately. The resulting HAMPs are analyzed, and a method is proposed to select HAMPs that can represent the characteristics of the human arm motion. Then the factors affecting the duration of the movement primitives are analyzed, and the relationship between the duration of the movement primitives and these factors is determined. Based on the selected HAMP and the computed duration of the movement primitives, a human-like motion planning framework is developed to generate the human-like motion for the robotic arms. Finally, this motion planner is verified by the human–robot handover experiments using a KUKA IIWA robot. It shows that the resulting trajectories can correctly reflect the relative relationship between the joints in the human arm motion and are very close to the recorded human arm trajectories. Furthermore, the proposed motion planning method is compared with the motion planning method based on minimum total potential energy. The results show that the proposed method can generate more human-like motion.
In this paper, we study asymmetric Ramsey properties of the random graph $G_{n,p}$. Let $r \in \mathbb{N}$ and $H_1, \ldots, H_r$ be graphs. We write $G_{n,p} \to (H_1, \ldots, H_r)$ to denote the property that whenever we colour the edges of $G_{n,p}$ with colours from the set $[r] \,{:\!=}\, \{1, \ldots, r\}$ there exists $i \in [r]$ and a copy of $H_i$ in $G_{n,p}$ monochromatic in colour $i$. There has been much interest in determining the asymptotic threshold function for this property. In several papers, Rödl and Ruciński determined a threshold function for the general symmetric case; that is, when $H_1 = \cdots = H_r$. A conjecture of Kohayakawa and Kreuter from 1997, if true, would fully resolve the asymmetric problem. Recently, the $1$-statement of this conjecture was confirmed by Mousset, Nenadov and Samotij.
Building on work of Marciniszyn, Skokan, Spöhel and Steger from 2009, we reduce the $0$-statement of Kohayakawa and Kreuter’s conjecture to a certain deterministic subproblem. To demonstrate the potential of this approach, we show this subproblem can be resolved for almost all pairs of regular graphs. This therefore resolves the $0$-statement for all such pairs of graphs.
“Return-to-player” information is used in several jurisdictions to display the long-run cost of gambling, but previous evidence suggests that these messages are frequently misunderstood by gamblers. Two ways of improving the communication of return-to-player information have been suggested: switching to an equivalent “house-edge” format, or via the use of a “volatility warning,” clarifying that the information applies only in the statistical long run. In this study, Australian participants (N = 603) were presented with either a standard return-to-player message, the same message supplemented with a volatility warning, or a house-edge message. The return-to-player plus volatility warning message was understood correctly more frequently than the return-to-player message, but the house-edge message was understood best of all. Participants perceived the lowest chance of winning in the return-to-player plus volatility warning condition. These findings contribute data on the relative merits of two proposed approaches in the design of improved gambling information.