Results 51 to 60 of about 1,423 (254)
A Review of Trans‐Dimensional Kirigami: From Compliant Mechanism to Multifunctional Robot
This review outlines recent advancements in the geometric design and mechanical properties of kirigami. The kirigami is classified into two categories from a compliant mechanism perspective, highlighting their applications in metamaterials and robotic systems. Finally, the future research directions, is explored focusing on the potential of integrating
Yang Yu +14 more
wiley +1 more source
Quantitative Analysis of Fluorescent Sensor Arrays
Fluorescent sensor arrays have great potential for the quantification of analytes in complex systems. Herein, statistical multivariate techniques and deep learning models to provide quantitative information from such arrays are reviewed. Fluorescent sensor arrays address the limitations of a single sensor by leveraging multiple sensing elements to ...
Karandeep Grover +3 more
wiley +1 more source
The natural algorithmic approach of mixed trigonometric-polynomial problems
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities of the form ∑ i = 1 n α i x p i cos q i x sin r i x > 0 $$\sum_{i=1}^{n}\alpha _{i}x^{p_{i}} \cos ^{q_{i}} x\sin ^{r_{i}} x>0 $$ by reducing them ...
Tatjana Lutovac +2 more
doaj +1 more source
Abstract This paper focuses on the issue of adaptive event‐triggered containment control for Markov jump multi‐agent systems characterized by hidden Markov jump parameters. The central objective is to design an output‐feedback controller for the Markov jump multi‐agent system by using an adaptive event‐triggered technique that not only ensures the ...
Parivallal Arumugam +3 more
wiley +1 more source
On the calculus of positively constructed formulas for authomated theorem proving
The paper deals with an expressive logic language LF and its calculus. Formulas of this language consist of some large-block structural elements, such as type quanti¯ers.
A. V. Davydov +2 more
doaj
Explaining the undecidability of first-order logic
Turing proved the unsolvability of the decision problem for first-order logic (Entscheidungsproblem) in his famous paper On Computable Numbers, with an Application to the Entscheidungsproblem.
Timm Lampert, Anderson Nakano
doaj +1 more source
The ILLTP Library for Intuitionistic Linear Logic [PDF]
Benchmarking automated theorem proving (ATP) systems using standardized problem sets is a well-established method for measuring their performance. However, the availability of such libraries for non-classical logics is very limited.
Carlos Olarte +3 more
doaj +1 more source
How Can Digital Platforms Resolve Market Failures to Foster a Circular Economy?
ABSTRACT Market failures—such as asymmetric information, incomplete markets, externalities, and market power—present major barriers to a circular economy (CE) transition. Although government intervention is traditionally proposed, this paper examines the potential of digital platforms, particularly software‐as‐a‐service (SaaS) business‐to‐business (B2B)
Ässia Boukhatmi, Wim Van Opstal
wiley +1 more source
New Andrews–Curtis trivializations for Miller–Schupp group presentations
We present recent developments in the applications of automated theorem proving in the investigation of the Andrews–Curtis conjecture. We demonstrate previously unknown trivializations of group presentations from a parametric family MSn(w∗) of trivial ...
Alexei Lisitsa
doaj +1 more source
Converting ALC Connection Proofs into ALC Sequents [PDF]
The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies written in the
Eunice Palmeira +2 more
doaj +1 more source

