bluuebunny/crossref_metadata_2025_split huggingface dataset:
Locking in hydro-engineered pathways: the lower river Murray, Australia, 1880–1940
Authors: Cook Margaret 
Published: January 2025

Abstract
Located downstream from substantial irrigation extraction at the “end” of the Murray–Darling River system, South Australia (SA) struggles to maintain flows and the health of the rivers within its borders. Analysis of early twentieth century engineering reports reveals that this problem is not new, beginning in the 1880s with the growth of irrigation in Australia and the riparian demands of the eastern, upstream states. I use the theory of path dependency to analyse the history of the Murray–Darling Basin from a South Australian perspective to argue that the state’s current water issues stem from cultural, institutional, and technological lock-ins shaped by its geo-political position that made it vulnerable to upstream demands for water. As SA’s negotiations for a larger water allocation failed, it turned to construction of an enviro-technical network of weirs, locks and barrages designed to assist navigation, regulate the river’s flow, keep water fresh for landholders and towns, prevent the ingress of salty sea water, and mitigate the consequences of upstream irrigation. With construction of each component the state’s hydro-engineering scheme engineers warned that with increasing extraction these strategies would only buy time and bigger-scale structures would be essential in the future to alleviate accelerating problems. Within decades SA experienced the foretold problems of diminishing flows, increasing salinity, environmental degradation and declining water quality, problems that continue and with climate change are likely to grow worse. Only a fundamental shift in cultural, institutional, and technological lock-ins can change a future trajectory that could improve the health of the river.
Retrospective matched case–control comparison of Totally Robotic Sleeve Gastrectomy (RSG) during the learning curve with Laparoscopic Sleeve Gastrectomy (LSG): why is operative time different?
Authors: Vitiello Antonio , Berardi Giovanna , Calabrese Pietro , Spagnuolo Maria , Calenda Fabrizia , Salzillo Giuseppe , Peltrini Roberto , Pilone Vincenzo 
Published: January 2025

Abstract
Robotic approach is slowly rising in metabolic surgery, and laparoscopy is still considered the gold standard for Sleeve Gastrectomy. Aim of our study was to assess and compare outcomes of RSG through a matched comparison with LSG. Retrospective search of prospectively maintained database of our surgical department was carried out find all consecutive patients who underwent RSG from April 2023 to August 2024. Each subject who underwent RSG was matched one-to-one with a patient treated with LSG in the same period. Operative time (docking + console time for the robotic procedures), length of stay, need for rescue drugs, and perioperative complications were recorded calculated and compared. A total number of 50 patients (25 RSG and 25 LSG) were included in the present analysis. Operative time in the LSG group was significantly shorter than in the RSG group (57.8 ± 12.3 VS 80.6 ± 16.6 min, p < 0.01), but it was comparable to console time (57.8 ± 12.3 VS 56.9 ± 19.6, p = 0.85). Mean docking time was 23.7 ± 11 min. Length of stay, readmissions, conversion to laparoscopy/open surgery, early complications, and rescue drugs administration were comparable between the two groups. Age, sex, and BMI were not good predictors neither of laparoscopic nor robotic operative time. RSG during the learning curve proved as safe as LSG, but it was associated with longer operative time due to the duration of the docking step. Operation length may become comparable once the learning curve plateau is reached. Age, BMI, and sex are not good criteria of choice between the two approaches.
Carbon nanotube/bentonite @ polyvinylidene fluoride tri-flouro ethylene nanocomposite matrix for surpior elimination of carcinogenic dye from wastewater
Authors: Mohamed F. M. , Hashem F. S. , El-Aassar M. R. , Mekewi M. A. , Khalifa R. E. , Ibrahim O. M. , Rafea M. Abdel , Gamal M. El 
Published: January 2025

Abstract
This study examines the sorption behavior of Congo Red (CR) dye from water-based solutions using a synergistic nanocomposite made of Bentonite (BT), multi-walled carbon nanotubes (MWCNTs), and a Poly (vinylidene fluoride tri-flouroethylene) (P(VDF-TRFE)) polymer matrix with exceptional adsorption capacity for the selective removal of Congo red dye from aqueous solutions. This is done in order to address the urgent concerns surrounding the health and environmental implications of CR dye. Utilizing modern analytical technique such as FTIR, XRD, SEM, TEM, and TGA, the adsorption physicochemical interaction and nanocomposite manufacturing were carefully investigated, offering thorough insights into the composite's general properties. Nanocomposite structures of between 31 and 37 nm in diameter were discovered by TEM examination. The adsorption process was pH dependent, reaching a peak removal effectiveness of 94.5% at pH 3.0. The correlation coefficients obtained from kinetic modeling using pseudo-first-order and pseudo-second-order equations were 0.97389 and 0.96802, respectively, suggesting that the adsorption mechanism adhered to first-order rate kinetics. Thermodynamic investigation revealed an exothermic and spontaneous reaction, with a negative ΔG value between − 7.45 and − 7.95 J/mol. The nanocomposite outperformed the capacities reported for individual components in earlier investigations, with an impressive monolayer sorption capacity (qmax) of 143.88 mg/g. As a result, there is great potential for this innovative nanocomposite to be a very successful adsorbent for treating industrial wastewater.

Graphical Abstract
A general Volterra integral problem of Riemann–Liouville type
Authors: Jornet Marc 
Published: January 2025

Abstract
We study a Volterra convolution equation of the second kind, based on a combination of Riemann–Liouville integrals. The problem can be reformulated involving the Caputo fractional derivative, hence the equation becomes of differintegral type. The modeling interpretation is based on a non-Markovian state function, where the Riemann–Liouville multi-orders are memory coefficients that decrease hazard risks of change. We prove the validity of the reformulations with fractional-calculus theory, local existence with fixed-point tools, and global uniqueness with a Gronwall-type argumentation. We show some examples and their associated physics. We also solve the general linear equation by means of the algebraic formalism of Mikusiński operational calculus, which is superior to Laplace transforms or Picard’s iterations. Multivariate Mittag–Leffler functions play a key role. We relate the emerging closed-form solution with the fractional power series that one may expect for these types of models.
The Effect of Cooperation with Conspecifics on a Pigeon’s Behavior under the Random Ratio Schedule
Authors: Kono Masanori , Takada Takuhiro , Yokomitsu Kengo 
Published: January 2025

Abstract
Social behavior involves interactions among individuals of the same species, and the presence or behavior of other individuals plays important roles. An individual’s performance in any particular task is improved or facilitated when others are present. The phenomenon of social facilitation has been studied for over a century, and it has implications for important behaviors like substance use, gambling, or choice behavior. The present study aimed to explore how the presence of conspecifics affects the behaviors of pigeons under a random ratio schedule. Four homing pigeons were used in various conditions to analyze response rates and bout-pause patterns. Experimental conditions were set up to examine the effects of conspecifics based on the following factors: the mere presence of conspecifics, simultaneous engagement in the same task, and sharing gains. Pigeon performance in each condition was compared based on the response rate and bout-and-pause patterns of key pecking behavior. The results suggest that sharing gain would work as an abolishing operation, although it does not produce a systematic effect on bout-pause patterns.
A mini review for hydrogen production routes toward carbon neutrality
Authors: Hu Teng , Song Yihong , Zhang Xiao , Lin Saisai , Liu Peng , Zheng Chenghang , Gao Xiang 
Published: January 2025

Abstract
Hydrogen energy is essential to establishing a sustainable and reliable energy system. The continuously growing demand for hydrogen is driven by the challenges associated with greenhouse gas emissions and resource depletion. This paper investigates and summarizes some intriguing hydrogen production processes that have evolved from laboratory stages to mature commercial applications. The analysis of techno-economic, environmental effects and investment trends of these processes are included. Currently, hydrogen is dominantly produced by methods with fossil fuels as feed. These technology processes are relatively mature and account for the majority of the world's hydrogen production, around 99%. However, these results in significant carbon emissions. Around 1400 million tons of carbon dioxide are emitted into the atmosphere. To achieve carbon neutral strategy, the hydrogen production from hydrocarbon fuels needs to become clean. Equipping carbon capture, utilization, and storage system is a promising way to reduce carbon emissions. In addition, hydrogen production schemes with zero carbon emissions like electrolytic and photocatalysis are attracting increasing attention. The survey results suggest that the price of hydrogen production associated with the addition of carbon capture equipment ranges from 1.47 to 6.04 USD/kg, which is higher than the value for the price without the additional facility (1.03–2.08 USD/kg). The introduction of carbon tax is expected to narrow the cost gap between the two. Besides, the cost of electrolysis remains expensive (6.25–12.2 USD/kg), depending on the energy source and electrolytic cell equipment. The high-pressure autothermal reforming technique coupled with carbon capture and electrolytic technique powered by renewable energy are favored by global commercial investment. Finally, key challenges and opportunities for clean hydrogen production are discussed in this paper. More attention should be paid to catalyst blockage or deactivation and the cost of carbon capture equipment for fossil fuel hydrogen production. For the new zero-carbon hydrogen production method, designing efficient, economical catalysts and electrolysis materials is essential for its large-scale application.
Between Rules and Implementation: The Difficulty in Relying on International Law in Military Courts in Criminal Law
Authors: Farber Shai , Benichou Nethanel , Amer Rani 
Published: January 2025

Abstract
The West Bank, also referred to as Judea and Samaria, has been subject to belligerent occupation since 1967, and its legal framework is grounded primarily in international law. This legal foundation of belligerent occupation emanates from the international law of occupation, which regulates the legislative, judicial and executive powers of the occupying state in the occupied territory. However, the utilisation of international law in adjudicating criminal matters within military courts in this region is sporadic. The underlying reasons for this practice call for inquiry and prompt a reconsideration of the optimal configuration of the legal regime.
This article contends that despite a recent uptake in integrating international law into military court decisions, its effectiveness in addressing criminal issues within these courts is limited. Moreover, in most cases presented before military courts, international law lags behind domestic legal doctrines, including Israeli criminal law. Despite its overarching authority, international law falls short of providing a pragmatic solution to the challenges confronted by military courts. Consequently, these courts are compelled to turn to alternative legal sources. The article proposes an integrated model, advocating reliance on international law for fundamental, constitutional-level issues while deferring to the Israeli criminal justice system for specific practical criminal matters.
Semantic taxonomy, direct compositionality, and unlike nominal coordinations in Korean
Authors: Lee Juwon 
Published: January 2025

Abstract
This paper investigates Korean nominal coordination, a distant conjunct of which is semantically incompatible with the subcategorizing verb in a sentence. This type of nominal coordination is supported by both corpus-based and experimental data. Such coordinations pose a challenge to previous approaches to coordination in the literature. Specifically, any theory directly linking the subcategorizing verb to such a distant conjunct encounters the issue of semantic incompatibility. To address this issue, based on Lee (2020), I propose associating the distant conjunct with a direct hypernym of the verb. While the primary focus is on conjunctive nominal coordinations, the hypothesis also extends to disjunctive nominal coordinations. This semantic taxonomy-based account is then formally implemented in Head-driven Phrase Structure Grammar (Pollard & Sag 1994; Sag et al. 2003), adapting the generalized conjunction from Partee & Rooth (1983). Furthermore, I argue that this analysis can serve as a basis for explaining other related constructions in Korean.
Bilingual children reach early language milestones at the same age as monolingual peers
Authors: Muszyńska Karolina , Krajewski Grzegorz , Dynak Agnieszka , Garmann Nina Gram , Romøren Anna Sara H. , Łuniewska Magdalena , Alcock Katie , Katsos Napoleon , Kołak Joanna , Simonsen Hanne Gram , Hansen Pernille , Krysztofiak Magdalena , Sobota Krzysztof , Haman Ewa 
Published: January 2025

Abstract
In this longitudinal study, we compare the age of reaching early developmental milestones in bilingual and monolingual children and between the bilinguals’ two languages. We present data from 302 Polish bilinguals (living outside of Poland with various majority languages) and 302 Polish monolinguals, aged M = 12.78 months on study entry (range: 0–24 months), matched on sex, age at study entry, duration of parental reporting, and parental education. The milestones under investigation include crawling, walking, babbling, first, 10th, 50th word, and first multi-word utterances. The data was collected with a specially designed mobile app, in which parents reported their children’s development repeatedly. Using this relatively big sample and looking at a wide range of investigated milestones, we present evidence that typical bilingual development follows a trajectory similar to monolingual development. We also evaluate the feasibility and usefulness of online data collection using mobile apps to study early language development.
The Stable Model Semantics for Higher-Order Logic Programming
Authors: BOGAERTS BART , CHARALAMBIDIS ANGELOS , CHATZIAGAPIS GIANNOS , KOSTOPOULOS BABIS , POLLACI SAMUELE , RONDOGIANNIS PANOS 
Published: January 2025

AbstractWe propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfully been used to give meaning to diverse non-monotonic formalisms. The proposed semantics generalizes the classical two-valued stable model semantics of Gelfond and Lifschitz as well as the three-valued one of Przymusinski, retaining their desirable properties. Due to the use of AFT, we also get for free alternative semantics for higher-order logic programs, namely supported model, Kripke-Kleene, and well-founded. Additionally, we define a broad class of stratified higher-order logic programs and demonstrate that they have a unique two-valued higher-order stable model which coincides with the well-founded semantics of such programs. We provide a number of examples in different application domains, which demonstrate that higher-order logic programming under the stable model semantics is a powerful and versatile formalism, which can potentially form the basis of novel ASP systems.
The Semantics of Metaprogramming in Prolog
Authors: WARREN DAVID SCOTT 
Published: January 2025

AbstractThis paper describes a semantics for pure Prolog programs with negation that provides meaning to metaprograms. Metaprograms are programs that construct and use data structures as programs. In Prolog a primary mataprogramming construct is the use of a variable as a literal in the body of a clause. The traditional Prolog 3-line metainterpreter is another example of a metaprogram. The account given here also supplies a meaning for clauses that have a variable as head, even though most Prolog systems do not support such clauses. This semantics naturally includes such programs, giving them their intuitive meaning. Ideas from Denecker and his colleagues form the basis of this approach. The key idea is to notice that if we give meanings to all propositional programs and treat Prolog rules with variables as the set of their ground instances, then we can give meanings to all programs. We must treat Prolog rules (which may be metarules) as templates for generating ground propositional rules, and not as first-order formulas, which they may not be. We use parameterized inductive definitions to give propositional models to Prolog programs, in which the propositions are expressions. Then the set of expressions of a propositional model determine a first-order Herbrand Model, providing a first-order logical semantics for all (pure) Prolog programs, including metaprograms. We give examples to show the applicability of this theory. We also demonstrate how this theory makes proofs of some important properties of metaprograms very straightforward.
Abstract Environment Trimming
Authors: JURJO-RIVAS DANIEL , MORALES JOSE F. , LÓPEZ-GARCÍA PEDRO , HERMENEGILDO MANUEL V. 
Published: January 2025

AbstractVariable sharing is a fundamental property in the static analysis of logic programs, since it is instrumental for ensuring correctness and increasing precision while inferring many useful program properties. Such properties include modes, determinacy, non-failure, cost, etc. This has motivated significant work on developing abstract domains to improve the precision and performance of sharing analyses. Much of this work has centered around the family of set-sharing domains, because of the high precision they offer. However, this comes at a price: their scalability to a wide set of realistic programs remains challenging and this hinders their wider adoption. In this work, rather than defining new sharing abstract domains, we focus instead on developing techniques which can be incorporated in the analyzers to address aspects that are known to affect the efficiency of these domains, such as the number of variables, without affecting precision. These techniques are inspired in others used in the context of compiler optimizations, such as expression reassociation and variable trimming. We present several such techniques and provide an extensive experimental evaluation of over 1100 program modules taken from both production code and classical benchmarks. This includes the Spectector cache analyzer, the s(CASP) system, the libraries of the Ciao system, the LPdoc documenter, the PLAI analyzer itself, etc. The experimental results are quite encouraging: we have obtained significant speedups, and, more importantly, the number of modules that require a timeout was cut in half. As a result, many more programs can be analyzed precisely in reasonable times.
On Lower Bounding Minimal Model Count
Authors: KABIR MOHIMENUL , MEEL KULDEEP S 
Published: January 2025

AbstractMinimal models of a Boolean formula play a pivotal role in various reasoning tasks. While previous research has primarily focused on qualitative analysis over minimal models; our study concentrates on the quantitative aspect, specifically counting of minimal models. Exact counting of minimal models is strictly harder than
$\#\mathsf{P}$
, prompting our investigation into establishing a lower bound for their quantity, which is often useful in related applications. In this paper, we introduce two novel techniques for counting minimal models, leveraging the expressive power of answer set programming: the first technique employs methods from knowledge compilation, while the second one draws on recent advancements in hashing-based approximate model counting. Through empirical evaluations, we demonstrate that our methods significantly improve the lower bound estimates of the number of minimal models, surpassing the performance of existing minimal model reasoning systems in terms of runtime.
Towards Probabilistic Inductive Logic Programming with Neurosymbolic Inference and Relaxation
Authors: HILLERSTRÖM FIEKE , BURGHOUTS GERTJAN 
Published: January 2025

AbstractMany inductive logic programming (ILP) methods are incapable of learning programs from probabilistic background knowledge, for example, coming from sensory data or neural networks with probabilities. We propose Propper, which handles flawed and probabilistic background knowledge by extending ILP with a combination of neurosymbolic inference, a continuous criterion for hypothesis selection (binary cross-entropy) and a relaxation of the hypothesis constrainer (NoisyCombo). For relational patterns in noisy images, Propper can learn programs from as few as 8 examples. It outperforms binary ILP and statistical models such as a graph neural network.
The use of facial recognition for targeting under international law
Authors: Rosenzweig Ido , Pacholska Magdalena 
Published: January 2025

Abstract
In the quest for “identity dominance” over the enemy, armed forces are increasingly leveraging biometrics for a variety of purposes. This paper focuses on the combat employment of one of them – facial recognition, which, unlike other biometrics, does not appear to have been widely utilized for targeting purposes yet. With the purchasing patterns of advanced militaries suggesting that such a development is around the corner, this paper assesses the compliance with international humanitarian law (IHL) of the use of facial recognition technologies for targeting purposes. It peruses the applicable legal framework to demonstrate that IHL is neutral towards the use of new technologies and that the right to privacy under international human rights law does not preclude the use of biometrics in hostilities. The analysis zooms in on two specific use cases in which facial recognition is likely to be employed on the battlefield, namely (1) targeted killings against combatants and (2) targeted killings against civilians directly participating in hostilities. The paper closes with an acknowledgment that while facial recognition does have obvious operational benefits, it also has the potential to exacerbate targeting practices that stretch the limits of IHL.