Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

Search Results (123)

Search Parameters:
Keywords = non-consensus state

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
18 pages, 305 KB  
Article
Evolution, Animal Suffering, Eschatology, and Ethics: Attending and Responding to Creaturely Struggle
by Neil Messer
Religions 2026, 17(2), 136; https://doi.org/10.3390/rel17020136 - 26 Jan 2026
Viewed by 82
Abstract
This paper explores the ethical implications of an ongoing debate about evolution, animal suffering, and the goodness of God. Christopher Southgate describes a “fault-line” between those who believe the struggle, suffering, and destruction of the evolutionary process are aligned with God’s good purposes [...] Read more.
This paper explores the ethical implications of an ongoing debate about evolution, animal suffering, and the goodness of God. Christopher Southgate describes a “fault-line” between those who believe the struggle, suffering, and destruction of the evolutionary process are aligned with God’s good purposes in creation and those who regard these evolutionary “disvalues” as contrary to God’s good purposes. Recent efforts at dialogue across the fault line have not resolved this basic disagreement, but have achieved notable consensus on eschatology: both sides share the hope of eschatological fulfilment for other-than-human creatures and an end to the suffering, struggle, and destruction of the present age. One under-explored aspect of this dialogue is its ethical significance; since evolutionary theodicies are theological evaluations of the natural world, they should inform our understanding of what we must do in response to its struggle and suffering. Having outlined the present state of the dialogue, I consider its implications for three particular ethical issues: (1) Eating meat. Southgate and Bethany Sollereder consider meat-eating in itself ethically unproblematic, for reasons not unconnected with their evolutionary theodicies. By contrast, I argue that the eschatological hope they, like me, affirm mandates Christians to refrain from avoidable violence toward our fellow-creatures. For many westerners, “avoidable violence” includes the killing of animals for food. (2) Ending extinction. Southgate has called for humans to be “co-redeemers,” sharing with God in the healing of the evolutionary process, including efforts to combat both anthropogenic and non-anthropogenic species extinction. Skeptical that humans are called to be co-redeemers, I agree that reducing anthropogenic species extinction is a proper act of repentance for the sin of ecological destruction, but am more wary of human attempts to prevent non-anthropogenic extinction. (3) Responding to pain. While I agree with Southgate and Sollereder that pain is usually biologically adaptive in this world, I refer to good scientific evidence for the existence of pain that is non-adaptive and detrimental to the flourishing of both humans and other animals. There is a prima facie ethical obligation to do what is in our power to relieve such pain. Full article
25 pages, 4095 KB  
Article
Comparison of Machine Learning Methods for Marker Identification in GWAS
by Weverton Gomes da Costa, Hélcio Duarte Pereira, Gabi Nunes Silva, Aluizio Borém, Eveline Teixeira Caixeta, Antonio Carlos Baião de Oliveira, Cosme Damião Cruz and Moyses Nascimento
Int. J. Plant Biol. 2026, 17(1), 6; https://doi.org/10.3390/ijpb17010006 - 19 Jan 2026
Viewed by 135
Abstract
Genome-wide association studies (GWAS) are essential for identifying genomic regions associated with agronomic traits, but Linear Mixed Model (LMM)-based GWAS face challenges in capturing complex gene interactions. This study explores the potential of machine learning (ML) methodologies to enhance marker identification and association [...] Read more.
Genome-wide association studies (GWAS) are essential for identifying genomic regions associated with agronomic traits, but Linear Mixed Model (LMM)-based GWAS face challenges in capturing complex gene interactions. This study explores the potential of machine learning (ML) methodologies to enhance marker identification and association modeling in plant breeding. Unlike LMM-based GWAS, ML approaches do not require prior assumptions about marker–phenotype relationships, enabling the detection of epistatic effects and non-linear interactions. The research sought to assess and contrast approaches utilizing ML (Decision Tree—DT; Bagging—BA; Random Forest—RF; Boosting—BO; and Multivariate Adaptive Regression Splines—MARS) and LMM-based GWAS. A simulated F2 population comprising 1000 individuals was analyzed using 4010 SNP markers and ten traits modeled with epistatic interactions. The simulation included quantitative trait loci (QTL) counts varying between 8 and 240, with heritability levels set at 0.5 and 0.8. These characteristics simulate traits of candidate crops that represent a diverse range of agronomic species, including major cereal crops (e.g., maize and wheat) as well as leguminous crops (e.g., soybean), such as yield, with moderate heritability and a high number of QTLs, and plant height, with high heritability and an average number of QTLs, among others. To validate the simulation findings, the methodologies were further applied to a real Coffea arabica population (n = 195) to identify genomic regions associated with yield, a complex polygenic trait. Results demonstrated a fundamental trade-off between sensitivity and precision. Specifically, for the most complex trait evaluated (240 QTLs under epistatic control), Ensemble methods (Bagging and Random Forest) maintained a Detection Power (DP) exceeding 90%, significantly outperforming state-of-the-art GWAS methods (FarmCPU), which dropped to approximately 30%, and traditional Linear Mixed Models, which failed to detect signals (0%). However, this sensitivity resulted in lower precision for ensembles. In contrast, MARS (Degree 1) and BLINK achieved exceptional Specificity (>99%) and Precision (>90%), effectively minimizing false positives. The real data analysis corroborated these trends: while standard GWAS models failed to detect significant associations, the ML framework successfully prioritized consensus genomic regions harboring functional candidates, such as SWEET sugar transporters and NAC transcription factors. In conclusion, ML Ensembles are recommended for broad exploratory screening to recover missing heritability, while MARS and BLINK are the most effective methods for precise candidate gene validation. Full article
(This article belongs to the Section Application of Artificial Intelligence in Plant Biology)
Show Figures

Figure 1

25 pages, 692 KB  
Article
Decentralized Dynamic Heterogeneous Redundancy Architecture Based on Raft Consensus Algorithm
by Ke Chen and Leyi Shi
Future Internet 2026, 18(1), 20; https://doi.org/10.3390/fi18010020 - 1 Jan 2026
Viewed by 294
Abstract
Dynamic heterogeneous redundancy (DHR) architectures combine heterogeneity, redundancy, and dynamism to create security-centric frameworks that can be used to mitigate network attacks that exploit unknown vulnerabilities. However, conventional DHR architectures rely on centralized control modules for scheduling and adjudication, leading to significant single-point [...] Read more.
Dynamic heterogeneous redundancy (DHR) architectures combine heterogeneity, redundancy, and dynamism to create security-centric frameworks that can be used to mitigate network attacks that exploit unknown vulnerabilities. However, conventional DHR architectures rely on centralized control modules for scheduling and adjudication, leading to significant single-point failure risks and trust bottlenecks that severely limit their deployment in security-critical scenarios. To address these challenges, this paper proposes a decentralized DHR architecture based on the Raft consensus algorithm. It deeply integrates the Raft consensus mechanism with the DHR execution layer to build a consensus-centric control plane and designs a dual-log pipeline to ensure all security-critical decisions are executed only after global consistency via Raft. Furthermore, we define a multi-dimensional attacker model—covering external, internal executor, internal node, and collaborative Byzantine adversaries—to analyze the security properties and explicit defense boundaries of the architecture under Raft’s crash-fault-tolerant assumptions. To assess the effectiveness of the proposed architecture, a prototype consisting of five heterogeneous nodes was developed for thorough evaluation. The experimental results show that, for non-Byzantine external and internal attacks, the architecture achieves high detection and isolation rates, maintains high availability, and ensures state consistency among non-malicious nodes. For stress tests in which a minority of nodes exhibit Byzantine-like behavior, our prototype preserves log consistency and prevents incorrect state commitments; however, we explicitly treat these as empirical observations under a restricted adversary rather than a general Byzantine fault tolerance guarantee. Performance testing revealed that the system exhibits strong security resilience in attack scenarios, with manageable performance overhead. Instead of turning Raft into a Byzantine-fault-tolerant consensus protocol, the proposed architecture preserves Raft’s crash-fault-tolerant guarantees at the consensus layer and achieves Byzantine-resilient behavior at the execution layer through heterogeneous redundant executors and majority-hash validation. To support evaluation during peer review, we provide a runnable prototype package containing Docker-based deployment scripts, pre-built heterogeneous executors, and Raft control-plane images, enabling reviewers to observe and assess the representative architectural behaviors of the system under controlled configurations without exposing the internal source code. The complete implementation will be made available after acceptance in accordance with institutional IP requirements, without affecting the scope or validity of the current evaluation. Full article
(This article belongs to the Section Cybersecurity)
Show Figures

Figure 1

21 pages, 1108 KB  
Article
L1-Lp Minimization via a Distributed Smoothing Neurodynamic Approach for Robust Multi-View Three-Dimensional Space Localization
by Youran Qu, Jiao Yang, Hong Liu, You Zhao and Xuekai Wei
Appl. Sci. 2026, 16(1), 403; https://doi.org/10.3390/app16010403 - 30 Dec 2025
Viewed by 176
Abstract
This paper presents a distributed smoothing neurodynamic approach for solving the L1-Lp minimization problem, with application to robust and collaborative multi-view three-dimensional (3D) space localization. To handle the non-Lipschitz continuity gradients, a smooth approximation technique is introduced, yielding a [...] Read more.
This paper presents a distributed smoothing neurodynamic approach for solving the L1-Lp minimization problem, with application to robust and collaborative multi-view three-dimensional (3D) space localization. To handle the non-Lipschitz continuity gradients, a smooth approximation technique is introduced, yielding a distributed neurodynamic model that integrates classical smoothing neural networks with multi-agents consensus theory. Theoretical analysis guarantees the global convergence of each agent’s state to the optimal solution. The stability and convergence of the proposed approaches are rigorously proved using Lyapunov theory. Numerical experiments on multi-view 3D space localization in the presence of measurement noise demonstrate the method’s effectiveness and practical value for distributed visual computing. Full article
(This article belongs to the Section Computing and Artificial Intelligence)
Show Figures

Figure 1

45 pages, 54465 KB  
Article
Multi-Agent Cooperative Optimisation of Microwave Heating Based on Phase–Power Coordinated Control and Consensus Feedback
by Baowei Song, Biao Yang and Yuling Zhou
Appl. Sci. 2025, 15(23), 12590; https://doi.org/10.3390/app152312590 - 27 Nov 2025
Viewed by 410
Abstract
To address the key challenges of non-uniform energy distribution, local overheating, and unstable electromagnetic–thermal coupling in multi-source microwave heating systems, this paper proposes a distributed optimisation cooperative method based on phase–power coordinated control and consensus-feedback constraints. A two-stage multi-agent control mechanism, described as [...] Read more.
To address the key challenges of non-uniform energy distribution, local overheating, and unstable electromagnetic–thermal coupling in multi-source microwave heating systems, this paper proposes a distributed optimisation cooperative method based on phase–power coordinated control and consensus-feedback constraints. A two-stage multi-agent control mechanism, described as “phase leading, power following”, is constructed within a hierarchical architecture to achieve spatiotemporal collaborative optimisation from the perspectives of electromagnetic interference-field shaping and thermal feedback regulation. In the phase-regulation stage (Innovation 1), adaptive reconstruction of the interference field is achieved through relative phase specification and a two-level scanning mechanism, rapidly shaping the spatial energy distribution and enhancing the absorption efficiency of incident electromagnetic energy in the cavity–material system. In the power-regulation stage (Innovation 2), amplitude correction is performed under a stabilised interference-field background, and a consensus-feedback constrained regional energy collaboration network is established to ensure that regional energy states converge within the convex hull of the leader reference set. Power redistribution is driven by the target–region energy deviation and neighbourhood consistency relationships, enabling spatial reverse balancing of energy density, suppressing excessive heating in high-energy regions, and enhancing compensation in low-energy regions. Furthermore, a spatiotemporal dual-scale coupling consensus-optimisation framework (Innovation 3) is developed to form a cooperative loop between fast electromagnetic-field reconstruction and slow thermal-field dynamics, achieving synchronous improvement in energy utilisation efficiency and temperature-field uniformity with stable convergence. Simulation results demonstrate that, compared with conventional constant-power, single-phase, and single-power control strategies, the proposed method improves heating efficiency by 16.62–44.74%, and enhances temperature uniformity in vertical and horizontal sections by 8.84–55.87% and 11.41–40.54%, respectively. Full article
(This article belongs to the Section Applied Thermal Engineering)
Show Figures

Figure 1

34 pages, 8174 KB  
Article
Formation Control of Underactuated AUVs Based on Event-Triggered Communication and Fractional-Order Sliding Mode Control
by Long He, Ya Zhang, Shizhong Li, Bo Li, Mengting Xie, Zehui Yuan and Chenrui Bai
Fractal Fract. 2025, 9(12), 755; https://doi.org/10.3390/fractalfract9120755 - 21 Nov 2025
Viewed by 636
Abstract
To address the challenges faced by multiple autonomous underwater vehicles (AUVs) in formation control under complex marine environments—such as model uncertainties, external disturbances, dynamic communication topology variations, and limited communication resources—this paper proposes an integrated control framework that combines robust individual control, distributed [...] Read more.
To address the challenges faced by multiple autonomous underwater vehicles (AUVs) in formation control under complex marine environments—such as model uncertainties, external disturbances, dynamic communication topology variations, and limited communication resources—this paper proposes an integrated control framework that combines robust individual control, distributed cooperative formation, and dynamic event-triggered communication. At the individual control level, a robust control method based on a fractional-order sliding mode observer (FOSMO) and a fractional-order terminal sliding mode controller (FOTSMC) is developed. The observer exploits the memory and broadband characteristics of fractional calculus to achieve high-precision estimation of lumped disturbances, while the controller constructs a non-integer-order sliding surface with an adaptive gain law to guarantee finite-time convergence of tracking errors. At the formation coordination level, a distributed trajectory generation method based on dynamic consensus is proposed to achieve reference trajectory planning and formation maintenance in a cooperative manner. At the communication level, a dynamic-threshold event-triggered mechanism is designed, where the triggering condition is adaptively adjusted according to the state errors, thereby significantly reducing communication load and energy consumption. Theoretically, Lyapunov-based analysis rigorously proves the stability and convergence of the closed-loop system. Numerical simulations confirm that the proposed method outperforms several benchmark algorithms in terms of tracking accuracy and disturbance rejection. Moreover, the integrated framework maintains precise formation under communication topology variations, achieving a communication reduction rate exceeding 65% compared to periodic protocols while preserving coordination accuracy. Full article
Show Figures

Figure 1

29 pages, 2906 KB  
Article
Robust High-Precision Time Synchronization for Distributed Sensor Systems in Challenging Environments
by Zhouji Wang, Daqian Lyu, Peiyuan Zhou, Yulong Ge, Yao Hu, Rangang Zhu, Wei Wang and Xiaoniu Yang
Remote Sens. 2025, 17(22), 3715; https://doi.org/10.3390/rs17223715 - 14 Nov 2025
Viewed by 943
Abstract
Timing and time synchronization are critical capabilities of Global Navigation Satellite Systems (GNSSs), but their performance deteriorates significantly in challenging environments like urban canyons and tunnels. To address this issue, this paper proposes the Distributed Sensor Time Synchronization architecture (DSTS), a novel architecture [...] Read more.
Timing and time synchronization are critical capabilities of Global Navigation Satellite Systems (GNSSs), but their performance deteriorates significantly in challenging environments like urban canyons and tunnels. To address this issue, this paper proposes the Distributed Sensor Time Synchronization architecture (DSTS), a novel architecture integrating Bayesian filtering with deep reinforcement learning. DSTS utilizes Bayesian filtering to fuse Time-of-Flight (ToF) measurements with Channel Impulse Response features for real-time compensation of non-linear errors and accurate path state prediction. Concurrently, the Deep Deterministic Policy Gradient (DDPG) algorithm trains each node into an intelligent agent that dynamically learns optimal synchronization weights based on local information like neighbor clock stability and link quality. This allows the architecture to adaptively amplify reliable nodes while mitigating the negative effects of unstable peers and adverse channels, ensuring high accuracy and availability. Simulation experiments based on a real-world UWB dataset demonstrate the architecture’s exceptional performance. The Bayesian filtering module effectively mitigates non-linear errors, reducing the standard deviation of ToF measurements in NLOS scenarios by up to 51.6% (over 41.2% consistently) while achieving high path state prediction accuracy (>85% static, >95% simulated dynamic). In simulated dynamic and heterogeneous networks, the DDPG algorithm achieves a synchronization accuracy better than traditional average-consensus algorithms, ultimately reaching a frequency and phase precision of 4×1010 and 5×1010 s, respectively. Full article
(This article belongs to the Special Issue GNSS and Multi-Sensor Integrated Precise Positioning and Applications)
Show Figures

Figure 1

18 pages, 2863 KB  
Article
Using Non-Lipschitz Signum-Based Functions for Distributed Optimization and Machine Learning: Trade-Off Between Convergence Rate and Optimality Gap
by Mohammadreza Doostmohammadian, Amir Ahmad Ghods, Alireza Aghasi, Zulfiya R. Gabidullina and Hamid R. Rabiee
Math. Comput. Appl. 2025, 30(5), 108; https://doi.org/10.3390/mca30050108 - 4 Oct 2025
Viewed by 782
Abstract
In recent years, the prevalence of large-scale datasets and the demand for sophisticated learning models have necessitated the development of efficient distributed machine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks. Recently, non-Lipschitz [...] Read more.
In recent years, the prevalence of large-scale datasets and the demand for sophisticated learning models have necessitated the development of efficient distributed machine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks. Recently, non-Lipschitz continuous optimization algorithms have been proposed to improve the slow convergence rate of the existing linear solutions. The use of signum-based functions was previously considered in consensus and control literature to reach fast convergence in the prescribed time and also to provide robust algorithms to noisy/outlier data. However, as shown in this work, these algorithms lead to an optimality gap and steady-state residual of the objective function in discrete-time setup. This motivates us to investigate the distributed optimization and ML algorithms in terms of trade-off between convergence rate and optimality gap. In this direction, we specifically consider the distributed regression problem and check its convergence rate by applying both linear and non-Lipschitz signum-based functions. We check our distributed regression approach by extensive simulations. Our results show that although adopting signum-based functions may give faster convergence, it results in large optimality gaps. The findings presented in this paper may contribute to and advance the ongoing discourse of similar distributed algorithms, e.g., for distributed constrained optimization and distributed estimation. Full article
Show Figures

Figure 1

18 pages, 2165 KB  
Article
Genomic Analysis of Rotavirus G8P[8] Strains Detected in the United States Through Active Surveillance, 2016–2017
by Mary C. Casey-Moore, Mathew D. Esona, Slavica Mijatovic-Rustempasic, Jose Jaimes, Rashi Gautam, Mary E. Wikswo, John V. Williams, Natasha Halasa, James D. Chappell, Daniel C. Payne, Mary Allen Staat, Geoffrey A. Weinberg and Michael D. Bowen
Viruses 2025, 17(9), 1230; https://doi.org/10.3390/v17091230 - 9 Sep 2025
Viewed by 1044
Abstract
G8 rotaviruses are primarily associated with animals and infrequently cause infections in humans. The first detection of G8 strains in humans occurred around 1979, and since then, their presence has been sporadic, particularly in the United States (U.S.). During the 2016–2017 rotavirus surveillance [...] Read more.
G8 rotaviruses are primarily associated with animals and infrequently cause infections in humans. The first detection of G8 strains in humans occurred around 1979, and since then, their presence has been sporadic, particularly in the United States (U.S.). During the 2016–2017 rotavirus surveillance season, the New Vaccine Surveillance Network (NVSN) identified 36 G8P[8] rotavirus strains across four sites in the U.S. This study presents the whole-genome characterization of these G8P[8] strains, along with comparative sequence analyses against the current vaccine strains, Rotarix and RotaTeq. Each strain exhibited a DS-1-like backbone with a consensus genotype constellation of G8P[8]-I2-R2-C2-M2-A2-N2-T2-E2-H2 and exhibited high genetic similarities to G8P[8] strains previously detected in Europe and Asia. Clinical analysis revealed no significant differences in hospitalization rates, length of stay, or severity scores between G8P[8] RVA-positive and non-G8P[8] RVA-positive subjects. Additionally, phylodynamic analysis determined the evolutionary rates and the most recent common ancestor for these strains, highlighting the importance of ongoing monitoring of rotavirus genotypes to assess the spread of these emerging G8P[8] strains. Full article
(This article belongs to the Section Human Virology and Viral Diseases)
Show Figures

Figure 1

22 pages, 1868 KB  
Article
Selection of Animal Welfare Indicators for Primates in Rescue Centres Using the Delphi Method: Cebus albifrons as a Case Study
by Victoria Eugenia Pereira Bengoa and Xavier Manteca
Animals 2025, 15(17), 2473; https://doi.org/10.3390/ani15172473 - 22 Aug 2025
Viewed by 1625
Abstract
Wildlife rescue centres face considerable challenges in promoting animal welfare and enhancing the care and housing conditions of animals under professional supervision. These challenges are further compounded by the diversity of species admitted, each with distinct specific needs. In Colombia and other Latin [...] Read more.
Wildlife rescue centres face considerable challenges in promoting animal welfare and enhancing the care and housing conditions of animals under professional supervision. These challenges are further compounded by the diversity of species admitted, each with distinct specific needs. In Colombia and other Latin American countries, primates are among the most frequently rescued and behaviourally complex mammalian taxa, requiring particular attention. In response, this study aimed to assess the content validity of proposed animal welfare indicators for Cebus albifrons through a Delphi consultation process and to develop two species-specific assessment protocols: a daily-use tool for keepers and a comprehensive protocol for professional audits. A panel of 23 experts in primate care and rehabilitation participated in two consultation rounds to evaluate and prioritise the indicators based on their content validity, perceived reliability, and practicality. Indicators were classified as either animal-based (direct measures) or resource- and management-based (indirect measures). After each round, experts received summarised feedback to refine their responses and facilitate consensus building. Of the 39 initially proposed indicators, 28 were validated for inclusion in the extended protocol and 10 selected for the daily-use checklist. Among these, 20 indicators in the extended protocol and 6 in the daily protocol were resource- or management-based—such as adequate food provision, physical enrichment, and habitat dimensions—highlighting their practical applicability and relevance in identifying welfare issues and risk factors. Although these indirect indicators were more numerous, the top-ranked indicators in both protocols were animal-based, including signs of pain, affiliative behaviours, and abnormal repetitive behaviours. These are essential for accurately reflecting the animals’ welfare state and are therefore critical components of welfare assessment in captive non-human primates. This study demonstrates that welfare assessment tools can be effectively tailored to the specific needs of wildlife rescue centres, providing a robust foundation for enhancing welfare practices. These protocols not only offer practical approaches for assessing welfare but also underscore the importance of embedding animal welfare as a priority alongside conservation efforts. Future research should aim to refine these tools further, assess their implementation, and evaluate inter- and intra-observer reliability to ensure consistency across different settings. Full article
(This article belongs to the Section Animal Welfare)
Show Figures

Figure 1

29 pages, 1150 KB  
Review
What Helps or Hinders Annual Wellness Visits for Detection and Management of Cognitive Impairment Among Older Adults? A Scoping Review Guided by the Consolidated Framework for Implementation Research
by Udoka Okpalauwaekwe, Hannah Franks, Yong-Fang Kuo, Mukaila A. Raji, Elise Passy and Huey-Ming Tzeng
Nurs. Rep. 2025, 15(8), 295; https://doi.org/10.3390/nursrep15080295 - 12 Aug 2025
Viewed by 1616
Abstract
Background: The U.S. Medicare Annual Wellness Visit (AWV) offers a structured opportunity for cognitive screening and personalized prevention planning among older adults. Yet, implementation of AWVs, particularly for individuals with cognitive impairment, remains inconsistent across primary care or other diverse care settings. Methods: [...] Read more.
Background: The U.S. Medicare Annual Wellness Visit (AWV) offers a structured opportunity for cognitive screening and personalized prevention planning among older adults. Yet, implementation of AWVs, particularly for individuals with cognitive impairment, remains inconsistent across primary care or other diverse care settings. Methods: We conducted a scoping review using the Consolidated Framework for Implementation Research (CFIR) to explore multilevel factors influencing the implementation of the Medicare AWV’s cognitive screening component, with a focus on how these processes support the detection and management of cognitive impairment among older adults. We searched four databases and screened peer-reviewed studies published between 2011 and March 2025. Searches were conducted in Ovid MEDLINE, PubMed, EBSCOhost, and CINAHL databases. The initial search was completed on 3 January 2024 and updated monthly through 30 March 2025. All retrieved citations were imported into EndNote 21, where duplicates were removed. We screened titles and abstracts for relevance using the predefined inclusion criteria. Full-text articles were then reviewed and scored as either relevant (1) or not relevant (0). Discrepancies were resolved through consensus discussions. To assess the methodological quality of the included studies, we used the Joanna Briggs Institute critical appraisal tools appropriate to each study design. These tools evaluate rigor, trustworthiness, relevance, and risk of bias. We extracted the following data from each included study: Author(s), year, title, and journal; Study type and design; Data collection methods and setting; Sample size and population characteristics; Outcome measures; Intervention details (AWV delivery context); and Reported facilitators, barriers, and outcomes related to AWV implementation. The first two authors independently coded and synthesized all relevant data using a table created in Microsoft Excel. The CFIR guided our data analysis, thematizing our findings into facilitators and barriers across its five domains, viz: (1) Intervention Characteristics, (2) Outer Setting, (3) Inner Setting, (4) Characteristics of Individuals, and (5) Implementation Process. Results: Among 19 included studies, most used quantitative designs and secondary data. Our CFIR-based synthesis revealed that AWV implementation is shaped by interdependent factors across five domains. Key facilitators included AWV adaptability, Electronic Health Record (EHR) integration, team-based workflows, policy alignment (e.g., Accountable Care Organization participation), and provider confidence. Barriers included vague Centers for Medicare and Medicaid Services (CMS) guidance, limited reimbursement, staffing shortages, workflow misalignment, and provider discomfort with cognitive screening. Implementation strategies were often poorly defined or inconsistently applied. Conclusions: Effective AWV delivery for older adults with cognitive impairment requires more than sound policy and intervention design; it demands organizational readiness, structured implementation, and engaged providers. Tailored training, leadership support, and integrated infrastructure are essential. These insights are relevant not only for U.S. Medicare but also for global efforts to integrate dementia-sensitive care into primary health systems. Our study has a few limitations that should be acknowledged. First, our scoping review synthesized findings predominantly from quantitative studies, with only two mixed-method studies and no studies using strictly qualitative methodologies. Second, few studies disaggregated findings by race, ethnicity, or geography, reducing our ability to assess equity-related outcomes. Moreover, few studies provided sufficient detail on the specific cognitive screening instruments used or on the scope and delivery of educational materials for patients and caregivers, limiting generalizability and implementation insights. Third, grey literature and non-peer-reviewed sources were not included. Fourth, although CFIR provided a comprehensive analytic structure, some studies did not explicitly fit in with our implementation frameworks, which required subjective mapping of findings to CFIR domains and may have introduced classification bias. Additionally, although our review did not quantitatively stratify findings by year, we observed that studies from more recent years were more likely to emphasize implementation facilitators (e.g., use of templates, workflow integration), whereas earlier studies often highlighted systemic barriers such as time constraints and provider unfamiliarity with AWV components. Finally, while our review focused specifically on AWV implementation in the United States, we recognize the value of comparative analysis with international contexts. This work was supported by a grant from the National Institute on Aging, National Institutes of Health (Grant No. 1R01AG083102-01; PIs: Tzeng, Kuo, & Raji). Full article
(This article belongs to the Section Nursing Care for Older People)
Show Figures

Figure 1

14 pages, 917 KB  
Article
Deep Learning Treatment Recommendations for Patients Diagnosed with Non-Metastatic Castration-Resistant Prostate Cancer Receiving Androgen Deprivation Treatment
by Chunyang Li, Julia Bohman, Vikas Patil, Richard Mcshinsky, Christina Yong, Zach Burningham, Matthew Samore and Ahmad S. Halwani
BioMedInformatics 2025, 5(3), 42; https://doi.org/10.3390/biomedinformatics5030042 - 4 Aug 2025
Viewed by 1586
Abstract
Background: Prostate cancer (PC) is the second leading cause of cancer-related death in men in the United States. A subset of patients develops non-metastatic, castration-resistant PC (nmCRPC), for which management requires a personalized consideration for appropriate treatment. However, there is no consensus regarding [...] Read more.
Background: Prostate cancer (PC) is the second leading cause of cancer-related death in men in the United States. A subset of patients develops non-metastatic, castration-resistant PC (nmCRPC), for which management requires a personalized consideration for appropriate treatment. However, there is no consensus regarding when to switch from androgen deprivation therapy (ADT) to more aggressive treatments like abiraterone or enzalutamide. Methods: We analyzed 5037 nmCRPC patients and employed a Weibull Time to Event Recurrent Neural Network to identify patients who would benefit from switching from ADT to abiraterone/enzalutamide. We evaluated this model using differential treatment benefits measured by the Kaplan–Meier estimation and milestone probabilities. Results: The model achieved an area under the curve of 0.738 (standard deviation (SD): 0.057) for patients treated with abiraterone/enzalutamide and 0.693 (SD: 0.02) for patients exclusively treated with ADT at the 2-year milestone. The model recommended 14% of ADT patients switch to abiraterone/enzalutamide. Analysis showed a statistically significant absolute improvement using model-recommended treatments in progression-free survival (PFS) of 0.24 (95% confidence interval (CI): 0.23–0.24) at the 2-year milestone (PFS rate increasing from 0.50 to 0.74) with a hazard ratio of 0.44 (95% CI: 0.39–0.50). Conclusions: Our model successfully identified nmCRPC patients who would benefit from switching to abiraterone/enzalutamide, demonstrating potential outcome improvements. Full article
Show Figures

Figure 1

18 pages, 622 KB  
Article
Distributed Diffusion Multi-Distribution Filter with IMM for Heavy-Tailed Noise
by Guannan Chang, Changwu Jiang, Wenxing Fu, Tao Cui and Peng Dong
Signals 2025, 6(3), 37; https://doi.org/10.3390/signals6030037 - 1 Aug 2025
Viewed by 655
Abstract
With the diversification of space applications, the tracking of maneuvering targets has gradually gained attention. Issues such as their wide range of movement and observation outliers caused by human operation are worthy of in-depth discussion. This paper presents a novel distributed diffusion multi-noise [...] Read more.
With the diversification of space applications, the tracking of maneuvering targets has gradually gained attention. Issues such as their wide range of movement and observation outliers caused by human operation are worthy of in-depth discussion. This paper presents a novel distributed diffusion multi-noise Interacting Multiple Model (IMM) filter for maneuvering target tracking in heavy-tailed noise. The proposed approach leverages parallel Gaussian and Student-t filters to enhance robustness against non-Gaussian process and measurement noise. This hybrid filter is implemented as a node within a distributed network, where the diffusion algorithm leads to the global state asymptotically reaching consensus as the filtering time progresses. Furthermore, a fusion of multiple motion models within the IMM algorithm enables robust tracking of maneuvering targets across the distributed network and process outlier caused by maneuver compared to previous studies. Simulation results demonstrate the effectiveness of the proposed filter in tracking maneuvering targets. Full article
Show Figures

Figure 1

25 pages, 1507 KB  
Article
DARN: Distributed Adaptive Regularized Optimization with Consensus for Non-Convex Non-Smooth Composite Problems
by Cunlin Li and Yinpu Ma
Symmetry 2025, 17(7), 1159; https://doi.org/10.3390/sym17071159 - 20 Jul 2025
Viewed by 604
Abstract
This paper proposes a Distributed Adaptive Regularization Algorithm (DARN) for solving composite non-convex and non-smooth optimization problems in multi-agent systems. The algorithm employs a three-phase iterative framework to achieve efficient collaborative optimization: (1) a local regularized optimization step, which utilizes proximal mappings to [...] Read more.
This paper proposes a Distributed Adaptive Regularization Algorithm (DARN) for solving composite non-convex and non-smooth optimization problems in multi-agent systems. The algorithm employs a three-phase iterative framework to achieve efficient collaborative optimization: (1) a local regularized optimization step, which utilizes proximal mappings to enforce strong convexity of weakly convex objectives and ensure subproblem well-posedness; (2) a consensus update based on doubly stochastic matrices, guaranteeing asymptotic convergence of agent states to a global consensus point; and (3) an innovative adaptive regularization mechanism that dynamically adjusts regularization strength using local function value variations to balance stability and convergence speed. Theoretical analysis demonstrates that the algorithm maintains strict monotonic descent under non-convex and non-smooth conditions by constructing a mixed time-scale Lyapunov function, achieving a sublinear convergence rate. Notably, we prove that the projection-based update rule for regularization parameters preserves lower-bound constraints, while spectral decay properties of consensus errors and perturbations from local updates are globally governed by the Lyapunov function. Numerical experiments validate the algorithm’s superiority in sparse principal component analysis and robust matrix completion tasks, showing a 6.6% improvement in convergence speed and a 51.7% reduction in consensus error compared to fixed-regularization methods. This work provides theoretical guarantees and an efficient framework for distributed non-convex optimization in heterogeneous networks. Full article
(This article belongs to the Section Mathematics)
Show Figures

Figure 1

21 pages, 1362 KB  
Article
Decentralized Consensus Protocols on SO(4)N and TSO(4)N with Reshaping
by Eric A. Butcher and Vianella Spaeth
Entropy 2025, 27(7), 743; https://doi.org/10.3390/e27070743 - 11 Jul 2025
Cited by 1 | Viewed by 806
Abstract
Consensus protocols for a multi-agent networked system consist of strategies that align the states of all agents that share information according to a given network topology, despite challenges such as communication limitations, time-varying networks, and communication delays. The special orthogonal group [...] Read more.
Consensus protocols for a multi-agent networked system consist of strategies that align the states of all agents that share information according to a given network topology, despite challenges such as communication limitations, time-varying networks, and communication delays. The special orthogonal group SO(n) plays a key role in applications from rigid body attitude synchronization to machine learning on Lie groups, particularly in fields like physics-informed learning and geometric deep learning. In this paper, N-agent consensus protocols are proposed on the Lie group SO(4) and the corresponding tangent bundle TSO(4), in which the state spaces are SO(4)N and TSO(4)N, respectively. In particular, when using communication topologies such as a ring graph for which the local stability of non-consensus equilibria is retained in the closed loop, a consensus protocol that leverages a reshaping strategy is proposed to destabilize non-consensus equilibria and produce consensus with almost global stability on SO(4)N or TSO(4)N. Lyapunov-based stability guarantees are obtained, and simulations are conducted to illustrate the advantages of these proposed consensus protocols. Full article
(This article belongs to the Special Issue Lie Group Machine Learning)
Show Figures

Figure 1

Back to TopTop