bluuebunny/crossref_metadata_2025_split huggingface dataset:
Petrous bones versus tooth cementum for genetic analysis of aged skeletal remains
Authors: Zupanič Pajnič Irena , Jeromelj Tonja , Leskovar Tamara 
Published: October 2024

Abstract
A proper sampling strategy is important to obtain sufficient DNA for successful identification of aged skeletal remains. The petrous bone is the highest DNA-yielding bone in the human body. Because DNA extraction from the petrous bone is very destructive, the demand for other DNA sources is significant. When investigating aged skeletal remains, teeth are usually preserved, and recent studies have shown that DNA in teeth can be best preserved in the dental cementum that surrounds the surface of the tooth root. To extract DNA from the surface of the tooth root, a nondestructive method without grinding was used. Petrous bones and teeth from 60 archaeological adult skeletons were analyzed. The DNA yield, degree of DNA degradation, and STR typing success were compared, and the results showed higher DNA yield and higher amplification success in petrous bones, despite higher degradation of petrous bones’ DNA. The greater success of petrous bones is associated with poorly preserved DNA in a quarter of the teeth analyzed. When teeth with badly preserved DNA were excluded from the statistical analysis, no differences in the success of STR loci amplification were observed even if DNA yield was higher in petrous bones, which can be explained by greater degradation of petrous bones’ DNA. When teeth are well preserved, they can be used for genetically analyzing aged skeletal remains instead of petrous bones, and a rapid nondestructive extraction method can be applied to shorten the identification process and to physically preserve the biological specimen.
Energy Constrained Depth First Search
Authors: Das Shantanu , Dereniowski Dariusz , Uznański Przemysław 
Published: October 2024

AbstractDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such a route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due to limited energy resources of the searcher). The objective is to cover all the edges of a tree T using the minimum number of routes, each starting and ending at the root and each being of length at most B. To this end, we analyze the following natural greedy tree traversal process that is based on decomposing a depth first search traversal into a sequence of limited length routes. Given any arbitrary depth first search traversal R of the tree T, we cover R with routes $$R_1,\ldots ,R_l$$

R
1

,
…
,

R
l

, each of length at most B such that: $$R_i$$

R
i

starts at the root, reaches directly the farthest point of R visited by $$R_{i-1}$$

R

i
-
1

, then $$R_i$$

R
i

continues along the path R as far as possible, and finally $$R_i$$

R
i

returns to the root. We call the above algorithm piecemeal-DFS and we prove that it achieves the asymptotically minimal number of routes l, regardless of the choice of R. Our analysis also shows that the total length of the traversal (and thus the traversal time) of piecemeal-DFS is asymptotically minimum over all energy-constrained exploration strategies. The fact that R can be chosen arbitrarily means that the exploration strategy can be constructed in an online fashion when the input tree T is not known in advance. Each route $$R_i$$

R
i

can be constructed without any knowledge of the yet unvisited part of T. Surprisingly, our results show that depth first search is efficient for energy constrained exploration of trees, even though it is known that the same does not hold for energy constrained exploration of arbitrary graphs.
On Scheduling Mechanisms Beyond the Worst Case
Authors: Gao Yansong , Zhang Jie 
Published: October 2024

Abstract
The problem of scheduling unrelated machines has been studied since the inception of algorithmic mechanism design (Nisan and Ronen, Algorithmic mechanism design(extended abstract). In: Proceedings of the Thirty First Annual ACM Symposium on Theory of Computing (STOC), pp. 129–140, 1999. It is a resource allocation problem that entails assigning m tasks to n machines for execution. Machines are regarded as strategic agents who may lie about their execution costs so as to minimize their time cost. To address the situation when monetary payment is not an option to compensate the machines’ costs, Koutsoupias (Theory Comput Syst 54:375–387, 2014) devised two truthful mechanisms, K and P respectively, that achieves an approximation ratio of

$$\frac{n+1}{2}$$

n
+
1

2

and n, for social cost minimization. In addition, no truthful mechanism can achieve an approximation ratio better than

$$\frac{n+1}{2}$$

n
+
1

2

. Hence, mechanism K is optimal. While the approximation ratio provides a strong worst-case guarantee, it also limits us to a comprehensive understanding of mechanism performance on various inputs. This paper investigates these two scheduling mechanisms beyond the worst case. We first show that mechanism K achieves a smaller social cost than mechanism P on every input. That is, mechanism K is pointwise better than mechanism P. Next, for each task, when machines’ execution costs are independent and identically drawn from a task-specific distribution, we show that the average-case approximation ratio of mechanism K converges to a constant determined by the task-specific distribution. This bound is tight for mechanism K. For a better understanding of this distribution-dependent constant, on the one hand, we estimate its value by plugging in a few common distributions; on the other, we show that this converging bound improves a known bound (Zhang in Algorithmica 83(6):1638–1652, 2021)) which only captures the single-task setting. Last, we find that the average-case approximation ratio of mechanism P converges to the same constant.
An adaptive acceleration scheme for phase-field fatigue computations
Authors: Heinzmann Jonas , Carrara Pietro , Ambati Marreddy , Mirzaei Amir Mohammad , De Lorenzis Laura 
Published: October 2024

Abstract
Phase-field models of fatigue are capable of reproducing the main phenomenology of fatigue behavior. However, phase-field computations in the high-cycle fatigue regime are prohibitively expensive due to the need to resolve spatially the small length scale inherent to phase-field models and temporally the loading history for several millions of cycles. As a remedy, we propose a fully adaptive acceleration scheme based on the cycle jump technique, where the cycle-by-cycle resolution of an appropriately determined number of cycles is skipped while predicting the local system evolution during the jump. The novelty of our approach is a cycle-jump criterion to determine the appropriate cycle-jump size based on a target increment of a global variable which monitors the advancement of fatigue. We propose the definition and meaning of this variable for three general stages of the fatigue life. In comparison to existing acceleration techniques, our approach needs no parameters and bounds for the cycle-jump size, and it works independently of the material, specimen or loading conditions. Since one of the monitoring variables is the fatigue crack length, we introduce an accurate, flexible and efficient method for its computation, which overcomes the issues of conventional crack tip tracking algorithms and enables the consideration of several cracks evolving at the same time. The performance of the proposed acceleration scheme is demonstrated with representative numerical examples, which show a speedup reaching up to four orders of magnitude in the high-cycle fatigue regime with consistently high accuracy.

Graphical abstract
Effect of pre-session discrimination training on performance in a judgement bias test in dogs
Authors: Krahn Joseph , Azadian Amin , Cavalli Camila , Miller Julia , Protopopova Alexandra 
Published: October 2024

Abstract
Spatial judgement bias tests (JBTs) can involve teaching animals that a bowl provides a reward in one location but does not in another. The animal is then presented with the bowl placed between the rewarded and the unrewarded locations (i.e., ambiguous locations) and their latency to approach reflects expectation of reward or ‘optimism’. Some suggest that greater ‘optimism’ indicates better welfare. Performance in JBTs, however, may also indicate a learning history independently from welfare determinants. We hypothesized that dogs’ ‘optimism’ in a follow-up JBT may be impacted by a learning treatment involving additional trials of a different discrimination task. Once enrolled, companion dogs (n = 16) were required to complete three study phases: (1) a pre-treatment JBT, (2) a learning treatment, and (3) a post-treatment JBT. During the JBTs, dogs were presented with five locations: one rewarded, one unrewarded, and three ambiguous (all unrewarded). Dogs were randomly assigned to a trial-based learning task—a nose-touch to the palm of the hand. In the Experimental discrimination treatment phase (n = 8), dogs were presented with two hands in each trial and only rewarded for touching one specific hand. In the Control treatment phase (n = 8), dogs were presented with one hand per trial in alternating sequence and were yoked to dogs in the Experimental group to receive the same number of rewarded and unrewarded trials (to control for possible frustration). Using a repeated measures mixed model with JBT repeated within dog, we found no difference in the change in approach latency to the ambiguous locations between the dogs across treatments. ‘Optimism’ as measured in this JBT was not altered by the additional discrimination trials used in our study.
Federated learning-based natural language processing: a systematic literature review
Authors: Khan Younas , Sánchez David , Domingo-Ferrer Josep 
Published: October 2024

AbstractFederated learning (FL) is a decentralized machine learning (ML) framework that allows models to be trained without sharing the participants’ local data. FL thus preserves privacy better than centralized machine learning. Since textual data (such as clinical records, posts in social networks, or search queries) often contain personal information, many natural language processing (NLP) tasks dealing with such data have shifted from the centralized to the FL setting. However, FL is not free from issues, including convergence and security vulnerabilities (due to unreliable or poisoned data introduced into the model), communication and computation bottlenecks, and even privacy attacks orchestrated by honest-but-curious servers. In this paper, we present a systematic literature review (SLR) of NLP applications in FL with a special focus on FL issues and the solutions proposed so far. Our review surveys 36 recent papers published in relevant venues, which are systematically analyzed and compared from multiple perspectives. As a result of the survey, we also identify the most outstanding challenges in the area.
Trustworthy human computation: a survey
Authors: Kashima Hisashi , Oyama Satoshi , Arai Hiromi , Mori Junichiro 
Published: October 2024

AbstractHuman computation is an approach to solving problems that prove difficult using AI only, and involves the cooperation of many humans. Because human computation requires close engagement with both “human populations as users” and “human populations as driving forces,” establishing mutual trust between AI and humans is an important issue to further the development of human computation. This survey lays the groundwork for the realization of trustworthy human computation. First, the trustworthiness of human computation as computing systems, that is, trust offered by humans to AI, is examined using the RAS (reliability, availability, and serviceability) analogy, which define measures of trustworthiness in conventional computer systems. Next, the social trustworthiness provided by human computation systems to users or participants is discussed from the perspective of AI ethics, including fairness, privacy, and transparency. Then, we consider human–AI collaboration based on two-way trust, in which humans and AI build mutual trust and accomplish difficult tasks through reciprocal collaboration. Finally, future challenges and research directions for realizing trustworthy human computation are discussed.
Statistical inference for Hicks–Moorsteen productivity indices
Authors: Simar Léopold , Zelenyuk Valentin , Zhao Shirong 
Published: October 2024

AbstractThe statistical framework for the Malmquist productivity index (MPI) is now well-developed and emphasizes the importance of developing such a framework for its alternatives. In this paper, we try to fill this gap in the literature for another popular measure, known as the Hicks–Moorsteen productivity index (HMPI). Unlike MPI, the HMPI has a total factor productivity interpretation in the sense of measuring productivity as the ratio of aggregated outputs to aggregated inputs and has other useful advantages over MPI. In this work, we develop a novel framework for statistical inference for HMPI in various contexts: when its components are known or when they are replaced with non-parametric envelopment estimators. This will be done for a particular firm’s HMPI as well as for the simple mean (unweighted) HMPI and the aggregate (weighted) HMPI. Our results further enrich the recent theoretical developments of nonparametric envelopment estimators for the various efficiency and productivity measures. We also examine the performance of these theoretical results for both the unweighted and weighted mean of HMPI for a finite sample, using Monte-Carlo simulations and also provide an empirical illustration along with the computation code.
Dynamic event-triggered integrated task and motion planning for process-aware source seeking
Authors: Li Yingke , Hou Mengxue , Zhou Enlu , Zhang Fumin 
Published: October 2024

AbstractThe process-aware source seeking (PASS) problem in flow fields aims to find an informative trajectory to reach an unknown source location while taking the energy consumption in the flow fields into consideration. Taking advantage of the dynamic flow field partition technique, this paper formulates this problem as a task and motion planning (TAMP) problem and proposes a bi-level hierarchical planning framework to decouple the planning of inter-region transition and inner-region trajectory by introducing inter-region junctions. An integrated strategy is developed to enable efficient upper-level planning by investigating the optimal solution of the lower-level planner. In order to leverage the information acquisition and computational burden, a dynamic event-triggered mechanism is introduced to enable asynchronized estimation, region partitioning and re-plans. The proposed algorithm provides guaranteed convergence of the trajectory, and achieves automatic trade-offs of both exploration-exploitation and accuracy-efficiency. Simulations in a highly complicated and realistic ocean surface flow field validate the merits of the proposed algorithm, which demonstrates a significant reduction in computational burden without compromising planning optimality.
Continuous planning for inertial-aided systems
Authors: Usayiwevu Mitchell , Sukkar Fouad , Yoo Chanyeol , Fitch Robert , Vidal-Calleja Teresa 
Published: October 2024

AbstractInertial-aided systems require continuous motion excitation among other reasons to characterize the measurement biases that will enable accurate integration required for localization frameworks. This paper proposes the use of informative path planning to find the best trajectory for minimizing the uncertainty of IMU biases and an adaptive traces method to guide the planner towards trajectories that aid convergence. The key contribution is a novel regression method based on Gaussian Process (GP) to enforce continuity and differentiability between waypoints from a variant of the $$\hbox {RRT}^*$$

RRT
∗

planning algorithm. We employ linear operators applied to the GP kernel function to infer not only continuous position trajectories, but also velocities and accelerations. The use of linear functionals enable velocity and acceleration constraints given by the IMU measurements to be imposed on the position GP model. The results from both simulation and real-world experiments show that planning for IMU bias convergence helps minimize localization errors in state estimation frameworks.
A landscape-based approach to design flower blocks may reduce mammalian predator activity and protect ground-nesting farmland birds
Authors: Laux Amelie , Waltert Matthias , Gottschalk Eckhard 
Published: October 2024

AbstractHigh predation rates threaten many ground-nesting farmland birds and are difficult to address through conventional measures such as lethal predator control or fencing. Landscape-based approaches for conservation measures promise an alternative by reducing predator - bird encounters, but require detailed knowledge of landscape effects on predation risk. Different habitat elements attractive to predators could have opposing effects on neighbouring nesting habitats, with implications for conservation: Increased predation risk due to higher predator activity (A) or reduced predation risk by distracting predators (B). Here we focus on the placement of conservation measures using flower blocks targeted at Grey Partridges in a Central European Farmland. Based on a three-year camera trap dataset, we investigated effects of landscape structure and composition on mammalian predator activity within flower blocks at two scales (100 m and 500 m radius around the camera) with generalized linear mixed models. Length of linear edge structures, i.e., field block borders, was most important, with a greater availability of linear edge structures leading to a decrease in predator activity at both scales (hypothesis B). Conversely, predator captures at both scales increased with increasing extensive vegetation area (i.e., permanent grassland, flower blocks and fallows) and in proximity to roads, indicating that these may attract predators and increase predator densities (hypothesis A). Our results suggest that a landscape-based approach can mitigate predation risk for ground-nesting birds in flower blocks and analogous conservation measures. Highly structured, small-scale agricultural landscapes seem to be particularly important for reducing mammalian predator activity in flower blocks.
ECHO-MPS, a dual modality strategy of cardiac imaging to identify myocardial ischemia
Authors: Szmigielski Cezary A. , Sabharwal Nikant , Newton James D. , Becher Harald 
Published: October 2024

Abstract
Purpose
We aimed to evaluate an approach with resting echocardiography (TTE) and stress myocardial perfusion scintigraphy (MPS) compared to standard MPS in patients with stable angina and normal left ventricle (LV). We hypothesized that normal LV on TTE may allow for the elimination of rest MPS without compromising accuracy and offering an efficient diagnostic pathway with reduced radiation exposure.

Methods
In a prospective, non-randomized study TTE was performed prior to MPS in patients (pts) referred for assessment of coronary artery disease (CAD). In pts with normal LV assessment was performed using the hybrid and the standard approach. TTE and MPS were interpreted by two TTE readers (ER1-2) and two MPS readers (NR1-2). ECHO-MPS was compared with standard MPS for diagnostic accuracy.

Results
103 patients, mean age 61 ± 12 year, (63 M, 40 W) were recruited. Standard MPS were normal in 75 patients and abnormal in 28 patients, with the hybrid approach 79 studies were reported as normal and 24 studies as abnormal. Kappa values were 0.580, (p < 0.001) for large, 0.394, (p < 0.001) for medium, and 0.298 (p = 0.002) for small defects. With standard MPS as a reference, sensitivity for detection of perfusion defects by ECHO-MPS was 75% (95% CI 0.67–0.83) [NR2] and 78% (95% CI 0.70–0.86)[NR1]. Specificity was 95% (95% CI 0.90–0.99) [NR2] and 95% (CI 95%CI 0.90–0.99) [NR1].

Conclusions
ECHO-MPS protocol provides similar diagnostic accuracy as standard stress-rest MPS. In patients with normal systolic LV function in TTE, performing only stress MPS provides similar information as standard rest and stress MPS.
Dynamic contrast-enhanced MRA of the aorta using a Golden-angle RAdial Sparse Parallel (GRASP) sequence: comparison with conventional time-resolved cartesian MRA (TWIST)
Authors: Calastra Camilla Giulia , Kleban Elena , Helfenstein Fabrice Noël , Haupt Fabian , Peters Alan Arthur , Huber Adrian , von Tengg-Kobligk Hendrik , Jung Bernd 
Published: October 2024

Abstract
Purpose
To compare the application of two contrast-enhanced time-resolved magnetic resonance angiography sequences on an aortic disease patient cohort: the conventional Cartesian-sampling-based, Time-resolved angiography With Interleaved Stochastic Trajectories (TWIST) sequence, and the radial-sampling-based Golden-angle RAdial Sparse Parallel (GRASP) sequence. TWIST is highly sensitive to patient movement, which can lead to blurring and reduced sharpness of vascular structures, particularly in dynamic regions like the aorta. Such motion artifacts can compromise diagnostic accuracy. Radial-sampling-based techniques are less sensitive to motion than cartesian sampling and are expected to improve the image quality in body parts subjected to motion.

Methods
30 patients (60.9 ± 16.1y.o.) with various aortic diseases underwent a 1.5T magnetic resonance angiography examination. Assessment of image quality in the ascending aorta (AA), descending aorta (DA), and abdominal aorta (AbA) on a 4-point Likert scale (1 = excellent, 4 = non-diagnostic) as well as max. aortic diameters (Dmax) were performed. T-test and multilevel mixed-effect proportional-odds models were used for the image analysis.

Results
GRASP offered superior depiction of vascular structures in terms of vascular contrast for qualitative analysis (TWIST, reader 1: 1.6 ± 0.5; reader 2: 1.9 ± 0.4; reader 3: 1.1 ± 0.4; GRASP, reader 1: 1.5 ± 0.5; reader 2: 1.4 ± 0.5; reader 3: 1.0 ± 0.2) and vessel sharpness for qualitative (TWIST, reader 1: 1.9 ± 0.6; reader 2: 1.6 ± 0.6; reader 3: 2.0 ± 0.3; GRASP, reader 1: 1.4 ± 0.6; reader 2: 1.2 ± 0.4; reader 3: 1.3 ± 0.6) and quantitative analysis (TWIST, AA = 0.12 ± 0.04, DA = 0.12 ± 0.03, AbA = 0.11 ± 0.03; GRASP, AA = 0.20 ± 0.05, DA = 0.22 ± 0.06, AbA=0.20 ± 0.05). Streaking artefacts of GRASP were more visible compared to TWIST (TWIST, reader 1: 2.2 ± 0.6; reader 2: 1.9 ± 0.3; reader 3: 2.0 ± 0.5; GRASP, reader 1: 2.6 ± 0.6; reader 2: 2.3 ± 0.5; reader 3: 2.8 ± 0.6). Aortic Dmax comparison among the sequence showed no clinical relevance.

Conclusion
GRASP outperformed TWIST in SNR, vessel sharpness, and reduction in image blurring; streaking artefacts were stronger with GRASP, but did not affect diagnostic image quality.
The repugnant resolution: has Coghlan & Cox resolved the Gamer’s Dilemma?
Authors: Montefiore Thomas , Luck Morgan 
Published: October 2024

AbstractCoghlan and Cox (Between death and suffering: Resolving the gamer’s dilemma. Ethics and Information Technology) offer a new resolution to the Gamer’s Dilemma (Luck, The Gamer’s Dilemma. Ethics and Information Technology). They argue that, while it is fitting for a person committing virtual child molestation to feel self-repugnance, it is not fitting for a person committing virtual murder to feel the same, and the fittingness of this feeling indicates each act’s moral permissibility. The aim of this paper is to determine whether this resolution – the repugnant resolution – successfully resolves the Gamer’s Dilemma. We argue that it does not.