bluuebunny/crossref_metadata_2025_split huggingface dataset:
Green Preparation of Mn‐Doped ZnS Quantum Dots/Gelatin Composite Gel Beads and Their Applications in Detection
Authors: Chen Zongming , Zhang Haipeng , Xu Zequan , Tao Jiangtao , Luo Yuqing , Chen Yanjun , Wang Yifeng 
Published: April 2024

AbstractHerein, Mn‐doped ZnS quantum dots/gelatin (QDs‐G) composite gel beads were directly prepared by a green and novel method. The method shows a range of benefits, such as the green and convenient process, mild conditions, and simple post‐processing. The resulting QDs‐G gel beads are transparent, homogeneous and stable. These gel beads exhibit clear orange‐red fluorescence under 302 nm UV light, which is associated with Mn‐doped ZnS QDs. Additionally, the QDs‐G gel beads possess a reversible thermo‐responsive sol‐gel transition property. TEM observation shows that there are QDs in the QDs‐G gel beads, and their average particle size is 4.0 nm. The QDs‐G gel beads can be innovatively used for both fluorescent detection and colorimetric detection, which show advantages such as simple operation, direct observation (no need for instruments), wide detection range, and good anti‐interference ability. Moreover, the more accurate fluorescence detection toward Cu2+ can be conducted through QDs/gelatin solution (the detection limit is 0.16 μM) based on the thermo‐responsive sol‐gel transition property of the gel beads. Therefore, the as‐fabricated QDs‐G gel bead is a promising candidate for application in the detection field.
Highly Selective Isomerization of Glucose to Fructose through a Biphasic and Recyclable Mimetic Enzyme Catalyst
Authors: Gan Zi‐Yu , Meng Xiang‐Guang , Zhang Yu‐Lian , Yu Wen‐Wang , Li Wen , Zhou Jie 
Published: April 2024

AbstractDeveloping a biphasic catalyst is of great significance for improving reaction efficiency and its industrial application. Herein a novel biphasic catalyst containing three functional groups of chlorophenol, amino and carboxyl was synthesized and used as mimic glucose isomerase to catalyze the isomerization. The mimic enzyme exhibited excellent catalytic performance for isomerization of glucose to fructose under mild conditions. Temperature and pH of solution showed significant influence on the conversion of glucose and the selectivity of fructose. The yield and selectivity of fructose reached 32.4 % and 91.0 % after reacting 2 h, respectively, at pH 9.5 and 90 °C. The solubility of the catalyst exhibited dual sensitivity to both pH and temperature. The catalyst was in a soluble state during the reaction process and could be precipitated by reducing the pH and temperature of the reaction system. The catalyst could be reused and still maintained good catalytic activity after five consecutive cycles.
Searching long patterns with BNDM
Authors: Tarhio Jorma 
Published: April 2024

AbstractWe present new algorithms for exact string matching of long patterns. Our algorithms read ‐grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments. Many of our algorithms were faster than previous methods for English and DNA patterns between 400 and 50,000 in length. Our algorithms were still better when the preprocessing time was taken into account or when the patterns were taken from a different text of the same type.
Formation of manufacturers' supply management capability: The knowledge‐based view
Authors: Li Xiaoyun , Li Suicheng , Wu Mengchao 
Published: April 2024

AbstractAcknowledging the pivotal strategic importance of external suppliers in obtaining competitive advantages underscores the necessity for manufacturers to bolster their supply management capabilities. This involves meticulously structuring, developing, and efficiently managing the supply base to ensure alignment of suppliers with the manufacturing processes and business objectives, consequently generating value and enhancing market competitiveness. The processes of acquiring, assimilating, transforming, and exploiting pertinent supply chain knowledge are vital for continuously bridging the gap between the current knowledge and the complex requirements of supply management, consequently strengthening the purchasing department's supply management capabilities. Strategic purchasing orientation commits more strategic resources to the purchasing department, allowing manufacturers to access and assimilate a broader spectrum of knowledge within the supply network. Grounded in the knowledge‐based view, our research delves into the development process of supply management capabilities, examining the influence of strategic purchasing orientation and absorptive capacity. Through hierarchical regression analysis of data from 395 manufacturers, our findings reveal that a pronounced strategic purchasing orientation significantly enhances absorptive capacity, thereby facilitating the development of supply management capabilities. Additionally, our study identifies distinct mediating roles of potential and realized absorptive capacities in the relationship between strategic purchasing orientation and supply management capability. This research offers a novel perspective on the development of supply management capabilities, providing valuable insights for manufacturers to address the complexities of supply management by narrowing the knowledge gap. Key words: supply management capability; absorptive capacity; strategic purchasing orientation.
Ultrasound diagnosis and sialadenectomy confirming a mandibular salivary gland vegetative foreign body and chronic sialadenitis in a dog
Authors: Phillips Katherine , Guy Bethany , Prior Sebastian , Riggs Julia 
Published: April 2024

AbstractA 2‐year‐old, female, neutered dog presented with a right‐sided, non‐painful, ventral neck mass approximately 2.5 cm in diameter. Although aspirates of the mass yielded a low volume of grossly purulent exudate, there was no response to antibiotic and non‐steroidal anti‐inflammatory medications. Cervical ultrasound examination revealed a straight hyperechoic structure with no associated distal acoustic shadowing in the right mandibular salivary gland, surrounded by a small volume of anechoic fluid, most consistent with migrating foreign material and focal sialadenitis. The surrounding subcutaneous tissues were hyperechoic with interspersed anechoic fluid material, consistent with cellulitis. Vegetative material was considered most likely due to the shape of the structure and absence of distal acoustic shadowing. Right mandibular and sublingual sialadenectomy was performed and vegetative material was retrieved from the mandibular salivary gland. Histopathology revealed chronic pyogranulomatous sialadenitis secondary to foreign body migration. Surgical excision achieved clinical resolution at 8 weeks follow‐up.
Minimally invasive pancreatoduodenectomy by junior surgeon: Initial experience of the next generation
Authors: Kim Sung Hyun , Hong Seung Soo , Kang Chang Moo 
Published: April 2024

AbstractBackgroundSeveral guidelines exist for minimally invasive pancreatoduodenectomy (MIPD) regarding its prerequisites and learning curve. However, these guidelines are based on the experience of the pioneers of MIPD; minimal data exist on the experience of the next generation of surgeons. The aim of this study was to compare the two surgeon types (veteran and junior) for MIPD in terms of immediate postoperative outcomes.MethodsThe postoperative outcomes of 22 patients who underwent robot‐assisted pancreatoduodenectomy (RAPD) by a junior surgeon from July 2021 to December 2022 were retrospectively reviewed. The outcomes were compared with the initial postoperative outcomes and the contemporary postoperative outcomes of RAPD by a veteran surgeon.ResultsIn comparing the initial outcomes between the two surgeon types, the veteran surgeons showed a shorter operation time (junior surgeon vs. veteran surgeon: 606 ± 89 vs. 467 ± 77 min, p < 0.001). However, there was no significant difference in terms of postoperative outcomes, such as blood loss (300 [200–600] ml. vs. 200 [100–500] ml, p = 0.208), major complications (≥CDC IIIa: 4 (18.2%) vs. 4 (18.2%), p = 1.000), postoperative pancreatic fistula (POPF; ≥ISGPF Grade B: 2 (9.1%) vs. 3 (13.6%), p > 0.999), and length of hospital stay (18.0 ± 8.9 days vs. 18.3 ± 7.9 days, p = 0.915), between the two surgeon types. In addition, in a comparison of the contemporary outcomes, there was no significant difference in terms of postoperative outcome (complications: 4 (18.2%) vs 11 (11.1%), p = 0.580; POPF: 2 (9.1%) vs. 3 (3.0%), p = 0.484; length of hospital stay: 18.0 ± 8.9 vs. 15.0 ± 6.5 days, p = 0.065).ConclusionThe initial outcomes of MIPD by a well‐trained junior surgeon were found to be comparable to those of MIPD by a veteran surgeon.
Institutional arrangements for improving water and sanitation services in the rural villages of India: a systems thinking approach
Authors: Kanyagui Martin Kofi , Rajendrakumar S , Viswanathan Pozhamkandath Karthiayani 
Published: April 2024

AbstractThis study examines the impact of institutional arrangements on water and sanitation (WATSAN) services in a village context in India. Data from households in Nagla Chandi village in Uttar Pradesh state were used to assess the situation. A systems thinking approach was employed to identify intervention points and improve access. The study identified under‐resourced local institutions, a lack of village‐level WATSAN rules and regulations, a lack of participation by both public institutions and communities, and trust issues as the critical barriers to accessing WATSAN services. It advocates for setting up a local WATSAN fund to ensure sustainable service delivery and a better understanding of the broader governance environment for sustainable WATSAN delivery in rural communities.
From Rewrite Rules to Axioms in the $$\lambda \varPi $$-Calculus Modulo Theory
Authors: Blot Valentin , Dowek Gilles , Traversié Thomas , Winterhalter Théo 
Published: April 2024

AbstractThe $$\lambda \varPi $$

λ
Π

-calculus modulo theory is an extension of simply typed $$\lambda $$
λ
-calculus with dependent types and user-defined rewrite rules. We show that it is possible to replace the rewrite rules of a theory of the $$\lambda \varPi $$

λ
Π

-calculus modulo theory by equational axioms, when this theory features the notions of proposition and proof, while maintaining the same expressiveness. To do so, we introduce in the target theory a heterogeneous equality, and we build a translation that replaces each use of the conversion rule by the insertion of a transport. At the end, the theory with rewrite rules is a conservative extension of the theory with axioms.
Dimension-Minimality and Primality of Counter Nets
Authors: Almagor Shaull , Avni Guy , Sinclair-Banks Henry , Yeshurun Asaf 
Published: April 2024

Abstract
A k-Counter Net (k-CN) is a finite-state automaton equipped with k integer counters that are not allowed to become negative, but do not have explicit zero tests. This language-recognition model can be thought of as labelled vector addition systems with states, some of which are accepting. Certain decision problems for k-CNs become easier, or indeed decidable, when the dimension k is small. Yet, little is known about the effect that the dimension k has on the class of languages recognised by k-CNs. Specifically, it would be useful if we could simplify algorithmic reasoning by reducing the dimension of a given CN.To this end, we introduce the notion of dimension-primality for k-CN, whereby a k-CN is prime if it recognises a language that cannot be decomposed into a finite intersection of languages recognised by d-CNs, for some $$d<k$$

d
<
k

. We show that primality is undecidable. We also study two related notions: dimension-minimality (where we seek a single language-equivalent d-CN of lower dimension) and language regularity. Additionally, we explore the trade-offs in expressiveness between dimension and non-determinism for CN.
Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability
Authors: Guillou Lucie , Mascle Corto , Waldburger Nicolas 
Published: April 2024

Abstract
We consider the parameterized verification of networks of agents which communicate through unreliable broadcasts. In this model, agents have local registers whose values are unordered and initially distinct and may therefore be thought of as identifiers. When an agent broadcasts a message, it appends to the message the value stored in one of its registers. Upon reception, an agent can store the received value or test it for equality against one of its own registers. We consider the coverability problem, where one asks whether a given state of the system may be reached by at least one agent. We establish that this problem is decidable, although non-primitive recursive. We contrast this with the undecidability of the closely related target problem where all agents must synchronize on a given state. On the other hand, we show that the coverability problem is NP-complete when each agent only has one register.
Light Genericity
Authors: Accattoli Beniamino , Lancelot Adrienne 
Published: April 2024

AbstractTo better understand Barendregt’s genericity for the untyped call-by-value $$\lambda $$
λ
-calculus, we start by first revisiting it in call-by-name, adopting a lighter statement and establishing a connection with contextual equivalence. Then, we use it to give a new, lighter proof of maximality of head contextual equivalence, i.e. that $$\mathcal {H}^*$$

H

∗

is a maximal consistent equational theory. We move on to call-by-value, where we adapt these results and also introduce a new notion dual to light genericity, that we dub co-genericity. Lastly, we give alternative proofs of (co-)genericity based on applicative bisimilarity.
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems
Authors: Geatti Luca , Mansutti Alessio , Montanari Angelo 
Published: April 2024

AbstractThis paper focuses on succinctness results for fragments of Linear Temporal Logic with Past ($$\textsf{LTL}$$
LTL
) devoid of binary temporal operators like until, and provides methods to establish them. We prove that there is a family of cosafety languages $$(\mathcal {L}_n)_{n \ge 1}$$

(

L
n

)

n
≥
1

such that $$\mathcal {L}_n$$

L
n

can be expressed with a pure future formula of size $$\mathcal {O}(n)$$

O
(
n
)

, but it requires formulae of size $$2^{\varOmega (n)}$$

2

Ω
(
n
)

to be captured with past formulae. As a by-product, such a succinctness result shows the optimality of the pastification algorithm proposed in [Artale et al., KR, 2023].We show that, in the considered case, succinctness cannot be proven by relying on the classical automata-based method introduced in [Markey, Bull. EATCS, 2003]. In place of this method, we devise and apply a combinatorial proof system whose deduction trees represent $$\textsf{LTL}$$
LTL
formulae. The system can be seen as a proof-centric (one-player) view on the games used by Adler and Immerman to study the succinctness of $$\textsf{CTL}$$
CTL
.
A Resolution-Based Interactive Proof System for UNSAT
Authors: Czerner Philipp , Esparza Javier , Krasotin Valentin 
Published: April 2024

AbstractModern SAT or QBF solvers are expected to produce correctness certificates. However, certificates have worst-case exponential size (unless $$\textsf{NP}=\textsf{coNP}$$

NP
=
coNP

), and at recent SAT competitions the largest certificates of unsatisfiability are starting to reach terabyte size.Recently, Couillard, Czerner, Esparza, and Majumdar have suggested to replace certificates with interactive proof systems based on the $$\textsf {IP}=\textsf {PSPACE}$$

IP
=
PSPACE

theorem. They have presented an interactive protocol between a prover and a verifier for an extension of QBF. The overall running time of the protocol is linear in the time needed by a standard BDD-based algorithm, and the time invested by the verifier is polynomial in the size of the formula. (So, in particular, the verifier never has to read or process exponentially long certificates). We call such an interactive protocol competitive with the BDD algorithm for solving QBF.While BDD-algorithms are state-of-the-art for certain classes of QBF instances, no modern (UN)SAT solver is based on BDDs. For this reason, we initiate the study of interactive certification for more practical SAT algorithms. In particular, we address the question whether interactive protocols can be competitive with some variant of resolution. We present two contributions. First, we prove a theorem that reduces the problem of finding competitive interactive protocols to finding an arithmetisation of formulas satisfying certain commutativity properties. (Arithmetisation is the fundamental technique underlying the $$\textsf {IP}=\textsf {PSPACE}$$

IP
=
PSPACE

theorem.) Then, we apply the theorem to give the first interactive protocol for the Davis-Putnam resolution procedure.
Clones, closed categories, and combinatory logic
Authors: Saville Philip 
Published: April 2024

AbstractWe explain how to recast the semantics of the simply-typed $$\uplambda $$
λ
-calculus, and its linear and ordered variants, using multi-ary structures. We define universal properties for multicategories, and use these to derive familiar rules for products, tensors, and exponentials. Finally we outline how to recover both the category-theoretic syntactic model and its semantic interpretation from the multi-ary framework. We then use these ideas to study the semantic interpretation of combinatory logic and the simply-typed $$\uplambda $$
λ
-calculus without products. We introduce extensional SK-clones and show these are sound and complete for both combinatory logic with extensional weak equality and the simply-typed $$\uplambda $$
λ
-calculus without products. We then show such SK-clones are equivalent to a variant of closed categories called SK-categories, so the simply-typed $$\uplambda $$
λ
-calculus without products is the internal language of SK-categories.
Fuzzy quantitative attack tree analysis
Authors: Dang Thi Kim Nhung , Lopuhaä-Zwakenberg Milan , Stoelinga Mariëlle 
Published: April 2024

AbstractAttack trees are important for security, as they help to identify weaknesses and vulnerabilities in a system. Quantitative attack tree analysis supports a number security metrics, which formulate important KPIs such as the shortest, most likely and cheapest attacks.A key bottleneck in quantitative analysis is that the values are usually not known exactly, due to insufficient data and/or lack of knowledge. Fuzzy logic is a prominent framework to handle such uncertain values, with applications in numerous domains. While several studies proposed fuzzy approaches to attack tree analysis, none of them provided a firm definition of fuzzy metric values or generic algorithms for computation of fuzzy metrics.In this work, we define a generic formulation for fuzzy metric values that applies to most quantitative metrics. The resulting metric value is a fuzzy number obtained by following Zadeh’s extension principle, obtained when we equip the basis attack steps, i.e., the leaves of the attack trees, with fuzzy numbers. In addition, we prove a modular decomposition theorem that yields a bottom-up algorithm to efficiently calculate the top fuzzy metric value.
Can ChatGPT support software verification?
Authors: Janßen Christian , Richter Cedric , Wehrheim Heike 
Published: April 2024

AbstractLarge language models have become increasingly effective in software engineering tasks such as code generation, debugging and repair. Language models like ChatGPT can not only generate code, but also explain its inner workings and in particular its correctness. This raises the question whether we can utilize ChatGPT to support formal software verification.In this paper, we take some first steps towards answering this question. More specifically, we investigate whether ChatGPT can generate loop invariants. Loop invariant generation is a core task in software verification, and the generation of valid and useful invariants would likely help formal verifiers. To provide some first evidence on this hypothesis, we ask ChatGPT to annotate 106 C programs with loop invariants. We check validity and usefulness of the generated invariants by passing them to two verifiers, Frama-C and CPAchecker. Our evaluation shows that ChatGPT is able to produce valid and useful invariants allowing Frama-C to verify tasks that it could not solve before. Based on our initial insights, we propose ways of combining ChatGPT (or large language models in general) and software verifiers, and discuss current limitations and open issues.
Combining Deductive Verification with Shape Analysis
Authors: Bernier Téo , Ziani Yani , Kosmatov Nikolai , Loulergue Frédéric 
Published: April 2024

AbstractDeductive verification tools can prove a large range of program properties, but often face issues on recursive data structures. Abstract interpretation tools based on separation logic and shape analysis can efficiently reason about such structures but cannot deal with so large classes of properties. This short paper presents an ongoing work on combining both techniques. We show how a deductive verifier for C programs, Frama-C/Wp, can benefit from a shape analysis tool, MemCAD, where structural and separation properties proved in the latter become assumptions for the former. A case study on selected functions of the tpm2-tss library using linked lists confirms the interest of the approach.
First Steps towards Deductive Verification of LLVM IR
Authors: van Oorschot Dré , Huisman Marieke , Şakar Ömer 
Published: April 2024

AbstractOver the last years, deductive program verifiers have substantially improved, and their applicability on non-trivial applications has been demonstrated. However, a major bottleneck is that for every new programming language, a new deductive verifier has to be built.This paper describes the first steps in a project that aims to address this problem, by language-agnostic support for deductive verification: Rather than building a deductive program verifier for every programming language, we develop deductive program verification technology for a widely-used intermediate representation language (LLVM IR), such that we eventually get verification support for any language that can be compiled into the LLVM IR format.Concretely, this paper describes the design of VCLLVM, a prototype tool that adds LLVM IR as a supported language to the VerCors verifier. We discuss the challenges that have to be addressed to develop verification support for such a low-level language. Moreover, we also sketch how we envisage to build verification support for any specified source program that can be compiled into LLVM IR on top of VCLLVM.
FDSE: Enhance Symbolic Execution by Fuzzing-based Pre-Analysis (Competition Contribution)
Authors: Zhang Guofeng , Shuai Ziqi , Ma Kelin , Liu Kunlin , Chen Zhenbang , Wang Ji 
Published: April 2024

Abstract serves as an automatic test generation tool designed for C programs based on symbolic execution. employs fuzzing-based pre-analysis and combines static symbolic execution and dynamic symbolic execution to improve the effectiveness of test generation. achieves 5132 scores and is ranked 4th in the branch coverage track of Test-Comp 2024.
KLEEF: Symbolic Execution Engine (Competition Contribution)
Authors: Misonizhnik Aleksandr , Morozov Sergey , Kostyukov Yurii , Kalugin Vladislav , Babushkin Aleksei , Mordvinov Dmitry , Ivanov Dmitry 
Published: April 2024

AbstractKLEEF is a complete overhaul of the KLEE symbolic execution engine for LLVM, fine-tuned for a robust analysis of industrial C/C++ code. KLEEF natively handles complex data structures, such as trees, linked lists, and dynamically allocated arrays, via lazy initialization and symcrete values. KLEEF has fine-tuned modes for both maximal test coverage generation and reproducing error traces, in particular reaching a specific point in the program. In the paper, we describe the above features and a competition configuration of KLEEF.