Computer Science on Cambridge Core

Given the shift to technology-mediated communication, this study investigated the factors that influence Chinese EFL learners’ willingness to communicate (WTC) in the second language (L2) in MOOCs. While most previous studies conceptualized L2WTC as a unified construct, this study made a first attempt to distinguish its oral and written dimensions, thereby addressing an underexplored gap and capt…

We prove that for any for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of random -SAT formulas is given by the ‘replica symmetric solution’ predicted by physics methods [Monasson, Zecchina: Phys. Rev. Lett. 76 (1996)]. Furthermore, while the Gibbs uniqueness threshold is still not known precisely for any …

In this article, we propose a navigation approach based on a flocking algorithm for multiple agents that discover the environment with their sensors. The proposed method is able to move the agents in a flexible formation that preserves a pattern that minimizes a measure of energy, but is also able to avoid collision with obstacles while maintaining communication and visibility between agents. Con…

This paper presents a comprehensive navigation strategy aimed at enabling autonomous and collision-free motion of automated guided vehicles (AGVs) in indoor environments. The work addresses limitations of conventional AGV systems which are often restricted by static routing and inadequate adaptability to dynamic obstacles. A framework on global–local motion planning is developed, optimising (i) a…

System components usually attain marginal lifetimes with stochastic dependence in the context of load-sharing reliability structures. This study deals with the load-sharing parallel systems of two components. We prove that two marginal lifetimes are positively quadrant dependent when component lifetimes have continuous probability distributions, and such a stochastic dependence is upgraded to the…

(read ‘setlog’) was born as a Constraint Logic Programming (CLP) language where sets and binary relations are first-class citizens, thus fostering set programming. Internally, is a constraint satisfiability solver implementing decision procedures for several fragments of set theory. Hence, can be used as a declarative, set, logic programming language and as an automated theorem prover for set the…

This paper develops a logic of essence (HLE) in the framework of higher-order logic. The theory aims to provide a general framework for theorizing about the essences of objects, properties, propositions, and logical operations like conjunction, negation, quantification, etc. The first part of the paper presents the formal language and axiom system of HLE. After that, some theorems of the system a…

Fix integers and and set . Let denote the complete -partite -uniform hypergraph with parts of size . We prove that the Zarankiewicz number provided . Previously this was known only for due to Pohoata and Zakharov. Our novel approach, which uses Behrend’s construction of sets with no 3-term arithmetic progression, also applies for small values of , for example, it gives where the exponent 11/4 is …

Direct collocation (DC) methods are utilized for addressing trajectory optimization challenges in robotics due to their ability to generate dynamically consistent solutions. However, in the cable-driven robotic systems, where tension constraints impose kinodynamic restrictions, maintaining accuracy becomes significantly complex. This article addresses robot tensionability and proposes a method to…

The distinction between the proofs that only certify the truth of their conclusion and those that also display the reasons why their conclusion holds has a long philosophical history. In the contemporary literature, the grounding relation—an objective, explanatory relation which is tightly connected with the notion of reason—is receiving considerable attention in several fields of philosophy. Whi…

Two salient notions of sameness of theories are synonymy , aka definitional equivalence , and bi-interpretability . Of these two definitional equivalence is the strictest notion. In which cases can we infer synonymy from bi-interpretability? We study this question for the case of sequential theories. Our result is as follows. Suppose that two sequential theories are bi-interpretable and that the …

Anselm described god as “something than which nothing greater can be thought” [1, p. 93], and Descartes viewed him as “a supreme being” [7, p. 122]. I first capture those characterizations formally in a simple language for monadic predicate logic. Next, I construct a model class inspired by Stoic and medieval doctrines of grades of being [8, 20]. Third, I prove the models sufficient for recoverin…