Search Results (192)

Background/Objectives: Cancer survivors admitted to inpatient rehabilitation suffer from a complex burden of interrelated physical and psychological symptoms. While mean-level improvements during rehabilitation are well-documented, it remains unknown whether rehabilitation modifies the underlying structure of symptom interconnections—the symptom network—beyond reducing individual symptom scores. This study aimed to characterize symptom network structure at admission and discharge of a 21-day inpatient cancer rehabilitation program based on cancer-related physical symptoms and psychosocial functioning, formally compare network topology across timepoints, identify structurally central treatment targets, and assess the transdiagnostic generalizability of findings. Methods: Secondary analysis of routinely collected, electronic patient-reported outcome (PRO) data from 5066 cancer survivors (mean age 60.3 years, SD 12.2; 64.2% female; most frequent diagnoses: breast cancer = 36.9%, hematological malignancies = 10.4%; prostate cancer = 8.5%) admitted to a single-center inpatient rehabilitation program was performed between January 2017 and November 2022. The EORTC QLQ-C30 and the Hospital Anxiety and Depression Scale (HADS) questionnaires were utilized. Bayesian Gaussian Graphical Models were estimated at admission (T0) and discharge (T1) across 17 symptom and functioning domains using Bayesian Model Averaging (15,000 iterations). Edge-level change was quantified via posterior distributions of pairwise differences with 95% Highest Density Intervals. Node-level changes were assessed using Bayesian paired t-tests. Centrality was quantified by Expected Influence and Bridge Expected Influence. Results: Patients showed clinically meaningful improvements across all 17 domains during rehabilitation (all Bayes Factors >10; posterior probability of direction >99.9%). The largest standardized effects were observed for emotional functioning (Cohen’s d = 0.76), global health status (d = 0.69), and fatigue (d = 0.53). These improvements were clinically meaningful for a substantial proportion of patients: 62% improved by at least the minimal important difference in fatigue and 58% in emotional functioning, and the proportion of patients with probable anxiety fell from 15% to 6% and probable depression from 10% to 4%. Emotional functioning and anxiety were the most central domains in the symptom network—most strongly connected to the rest of patients’ symptom burden—at both admission and discharge. Despite the clinical improvements, the overall architecture of symptom interconnections changed little (83% of connections were unchanged). This indicates that the severity of symptoms was mitigated while the structure linking them together remained largely intact. The one connection that strengthened was that between impaired social functioning and financial difficulties (Δ = −0.112). Structural findings were consistent across ten cancer types (leave-one-out r > 0.80 in seven of ten). Conclusions: Over the course of inpatient cancer rehabilitation, patients showed large improvements against a background of largely stable symptom network architecture. Emotional functioning and anxiety occupy structurally central positions at both admission and discharge, identifying them as candidate domains warranting further investigation for network-informed rehabilitation. These findings provide a novel structural perspective on oncological rehabilitation and a framework for developing more targeted intervention strategies. Full article

We consider nearapproaching, a simple generalisation of pseudonearness and approach distances. The central idea in an approach space $(X,d)$ in the sense of Lowen is that of a distance d, which is a function on $X\times 2^X$ to $[0,\infty ]$. Of fundamental importance is the fact that such a distance can be defined not only in metric spaces, but also in topological spaces, uniform spaces, and related structures. Pseudonearness structures on a set X consist of pairs $({\mathcal{B}}^X,N)$, where ${\mathcal{B}}^X$ is a bornology and N is a nearoperator from ${\mathcal{B}}^X$ to $\underline{P}\left(\underline{P}\left(\underline{P}X\right)\right)$, satisfying certain near axioms. In this framework, bornologies, generalised Kuratowski operators, pseudoproximity structures, and, last but not least, classical nearness spaces can all be unified within a single setting. In our treatment of approaching, we define the corresponding spaces by focusing on functions $\tau$ from $CX\subset \underline{P}(\underline{P}\left(X\right)$ into the set of functions from ${\mathcal{B}}^X$ into the closed interval $[0,\infty ]$, known as targets, which we compare setwise, where ${\mathcal{B}}^X$ is a boundedness structure. Thus, a target can be regarded as a map that measures how close a collection $\mathcal{S}\in CX$ is to a bounded set $B\in {\mathcal{B}}^X$. Full article

The intersection area between two arbitrarily rotated ellipses is a recurring geometric primitive in imaging, computer vision, and robotics. In the general case, its evaluation is often associated with intersection-point recovery, topology-dependent case handling, adaptive refinement, or dense boundary approximation. This study presents a fixed-cost computational framework for ellipse–ellipse intersection based on a rotated-frame slice formulation. A coordinate-frame rotation expresses one ellipse in axis-aligned form while representing the second as a general conic. This yields a hybrid formulation that reduces the intersection area to a one-dimensional overlap integral of vertical slice height over the admissible horizontal interval. The integral is evaluated using fixed-order quadrature, with optional sine mapping to improve conditioning near grazing configurations. Numerical evaluation on 100,000 synthetic ellipse pairs shows that the proposed formulation reaches a low-error regime earlier than polygonal approximation while remaining substantially faster across the tested range. The formulation is further examined through a tree-crown delineation case study on the BAMFORESTS dataset, a benchmark forest dataset of very-high-resolution UAV imagery. In this case study, ellipse proxies derived from axis-aligned and oriented bounding box detections are used for overlap computation during non-maximum suppression (NMS). Using ellipse-proxy overlap during NMS preserves nearly the same peak F1 score of 0.785 while modestly shifting NMS behavior toward lower thresholds and producing slightly broader near-peak intervals. Full article

Against the backdrop of the advancing Transportation Power Strategy, long and large tunnels face critical challenges in ensuring the safety and efficiency of transportation scheduling due to their harsh environment, complex traffic network, and the need for coordination among multiple types of vehicles. Addressing the shortcomings of existing research—such as the disconnection between path planning and dynamic environments, insufficient coordination between timetables and paths, and incomplete conflict management—this paper constructs a comprehensive optimization model for the scheduling of construction vehicles in tunnel traffic networks. Firstly, integrating the improved social force model with the BPR function, an adaptive social force-BPR path planning model with a collision compensation mechanism is proposed, and the weights of sub-items are optimized using the improved AHP algorithm. Secondly, a constraint system covering paths, spatio-temporal logic, and three types of conflicts (crossing conflicts, head-on conflicts, and congestion conflicts) is established, and a bi-objective function of “minimum total scheduling time” and “minimum number of conflicts” is designed. Combined with the improved NSGA-II algorithm, the collaborative optimization of departure intervals and paths is realized. In particular, a conflict entropy repair operator is introduced to quantify the conflict chaos through node conflict entropy and vehicle conflict entropy, and the scheduling strategy is accurately adjusted based on the logic of “priority ranking-dynamic delay” to balance conflict resolution and efficiency loss. Finally, a case verification is carried out relying on a tunnel topological network with 30 nodes and 41 edges. The experimental results show that the optimal repulsion coefficient k_f of the social force model is 20, and the maximum departure interval of 8 min is the best configuration after introducing the repair operator. At this time, the total scheduling time is 136 min, and the total number of conflicts is only 2, completely avoiding high-risk head-on conflicts and congestion conflicts. The research outputs a vehicle scheduling scheme, enriches the theory of tunnel traffic scheduling, and provides scientific and feasible technical support for the coordinated scheduling of construction vehicles in long and large tunnels. Full article

Low-frequency sound insulation remains a major challenge for conventional passive materials, as improved attenuation is usually achieved at the expense of increased thickness and mass. In this work, a smooth fixed third-order ring-curve fractal-maze acoustic metamaterial is proposed for compact low-frequency sound insulation, and a physics-guided long short-term memory–physics prediction surrogate network (LSTM–PPS-Net) tandem framework is developed for its full-spectrum inverse design. Different from conventional Hilbert-type, right-angled, or sharply folded labyrinthine structures, the proposed topology uses recursively arranged curved channels to extend the effective acoustic propagation path and enhance phase accumulation within a limited space. Based on this mechanism, four physically meaningful parameters, namely slit width d, characteristic radius R₃, wall thickness t_w, and inter-column spacing l_E, are selected to construct a low-dimensional design space. A COMSOL–MATLAB automated finite-element method (FEM) workflow is established to generate 1000 valid transmission-loss (TL) spectra over 100–1700 Hz with a 5 Hz interval. For forward prediction, PPS-Net is developed by integrating geometry encoding, frequency-conditioned spectral decoding, and peak-weighted learning. The proposed PPS-Net achieves the best prediction accuracy among the tested models, with a mean absolute error (MAE) of 0.75 dB, a root mean square error (RMSE) of 1.88 dB, and a coefficient of determination (R²) of 0.96, outperforming multi-layer perceptron (MLP), convolutional neural network (CNN) and Transformer models under the same dataset and training protocol. For inverse design, the LSTM encoder extracts frequency-ordered spectral features from the target TL curve, while the frozen PPS-Net decoder provides differentiable acoustic-response feedback, thereby addressing the non-unique mapping from acoustic response to structural parameters. Furthermore, a compactness-oriented optimization strategy is introduced to balance spectral consistency, peak alignment, bandwidth preservation, and occupied-area reduction. In two representative cases, the optimized designs reduce the occupied area by approximately 21% in both representative cases, while maintaining the target attenuation characteristics after FEM verification. These results demonstrate that the proposed framework provides an efficient and physically interpretable route for the full-spectrum inverse design and compact optimization of low-frequency acoustic metamaterials. Full article

The rapid proliferation of low-altitude unmanned aerial vehicle (UAV) applications has made autonomous identification technology critical for flight safety and collaborative operations. In this paper, we propose and systematically analyze an autonomous identification scheme based on Bluetooth Low Energy (BLE) technology. We formulate a comprehensive system model that integrates link budget, packet collision, identification success probability, and power consumption. By incorporating safety interval constraints and a three-channel integrated reception probability, we employ an exhaustive search algorithm to optimize monitoring strategy parameters, thereby achieving an optimal trade-off between the Recognition Success Rate (RSR) and power consumption. Simulation results indicate that, at a PHY 1 Mbps rate, the optimal monitoring strategy theoretically approaches the Target Level of Safety (TLS) requirements for civil UAVs under the defined model assumptions, with a power consumption of 19.24 mW and an Average First Identification Delay (AFID) of 105 ms. Furthermore, simulation analysis verifies the scheme’s feasibility under dynamic topology, interference, and multi-UAV scenarios, providing a solid theoretical and technical reference for the practical implementation of autonomous UAV identification. Full article

We show that a single Hodgkin–Huxley (HH) neuron with Pyragas-type delayed feedback control (DFC) can store multiple symbols as stable periodic orbits, where the specific orbit is selected by tuning the DFC gain K and time delay $\tau$. Sweeping the $(K,\tau )$ parameter plane at fixed bias current $I_{\mathrm{bias}}$ = 10.0 μA/cm² reveals 207 orbit types across 12 topological categories, with inter-spike interval (ISI) means from 5.9 to 56.9 ms. We establish: (i) a write protocol that reliably locks orbits with 13.9 ms median settling time; (ii) a novel Pattern-Oriented Limit-cycle Decoder (POLD) that reads orbits at 100% accuracy from only five observed ISIs (1200 trials across 12 orbits; Wilson 95% CI: 99.7–100%); (iii) a complete single-symbol write–read–erase (W–R–E) cycle with 100% read accuracy, 92% erase verification, and no decay over hold durations up to 50 s; and (iv) a fully validated 12-symbol memory capacity with a read-discriminable upper bound of 67 symbols (11.2× over rate coding; write viability confirmed only for the conservative 12-symbol subset). Reliable orbit addressing needs delay precision of ±2%, which constitutes a write-precision specification and not a fundamental capacity limit. These findings show that parametric delayed feedback is a viable mechanism for limit-cycle-based information storage in conductance-based spiking neurons. The biological interpretation is analogical, not direct: the ±2% delay-precision requirement exceeds what has been demonstrated for biological autaptic variability, and the orbit-coded memory framing is best understood as a computational proof-of-principle aimed at neuromorphic engineering, not as a claim about biological working memory. Full article

This study aims to define the space of interval-valued Riesz convergent sequences and to provide a detailed analysis of its structural properties. The classical concept of Riesz convergence is generalized to sequences whose terms consist of closed and bounded intervals rather than real numbers. An appropriate metric structure is established on this space, and it is rigorously proven that the space is complete with respect to this metric. Furthermore, the quasilinear structure, certain topological properties, and the inclusion relations of this space with other related spaces are systematically investigated. Full article

Due to the influence of the control strategy of the battery energy storage station (BESS), the degree of voltage sag, and the battery state of charge (SOC), the fault current characteristics of the BESS outlet line differ significantly. Traditional overcurrent protection faces the risk of failure to operate. To evaluate the operational performance of overcurrent protection of outlet line connecting BESS, this work first analyzes the topological structure and control strategy of BESS and further investigates the fault current characteristics of its outlet line. Based on this, the operational performance of overcurrent protection relay is studied. In addition, an overcurrent protection method of outlet line connecting BESS considering the battery SOC is proposed. By calculating and setting the SOC boundary, reliable protection of outlet line within different SOC intervals is achieved. Finally, a grid-connected model of BESS is built based on an electromagnetic transient simulation software to verify the operational characteristics of the proposed method. Full article

After a severe outage occurs, restoring a distribution network can take from several hours to days, making the secure and stable operation of restoration areas (RAs) critical. During a post-disaster partitioned operation, asymmetric controllable distributed generator (CDG) regulation capacity, non-controllable distributed generator (NDG) fluctuation risks, and concentrated high-value loads cause significant inter-area power imbalances. Soft open points bridge this resource gap by integrating electric vehicle charging directly into soft open points via vehicle-to-grid (V2G) technology; the resulting electric vehicle-embedded soft open points (EV-SOPs) acquire storage-like energy transfer capability. This paper proposes a boundary–node coordinated optimization strategy for post-disaster RA operation, which integrates CDGs, NDGs, smart switches, and EV-SOPs. Firstly, the boundary dynamic updating model with a multi-homogeneity indicator—load importance, NDG fluctuation risk, and CDG flexibility—enables adaptive resource allocation. Secondly, the optimal operational model of RA is formulated considering the various characteristics of facilities and topology constraints. Thirdly, EV-SOP uncertainties in response reliability, discharge power, and energy capacity are characterized by Bernoulli, log-normal, and truncated normal distributions, reformulated into a tractable mixed-integer quadratically constrained programming via chance-constraint interval linear transformation, and solved by a sequential weight-based priority search with hot-start strategy. Case studies on the IEEE 123-bus system verify the effectiveness of the proposed method. Specifically, the dynamic boundary strategy reduces the comprehensive weighted index by up to 29.10%; physical feasibility truncation reduces EV-driven load loss from 3.2073 MW to 3.1038 MW; and the sequential weight-based priority search with hot-start strategy achieves a cone constraint satisfaction measure of 9.3175 × 10⁻⁷, confirming robust convergence. Full article

Embedding large language model (LLM) coordinators in production electronic systems, connected vehicles, multi-robot fabrics, IoT control loops, telecommunications orchestration, demands a pre-delivery filter stage that preserves ethical guarantees under adversarial influence at deployment scale. We present a constitutional governance layer that filters compiled influence policies before they reach a heterogeneous population of grounded LLM agents whose hybrid decision model combines a game-theoretic base probability with an LLM-evaluated narrative shift attenuated by per-agent resistance. Four experiments on a Barabási–Albert scale-free network of 30 agents powered by Llama-3.3-70B-Instruct show that the filter holds an Ethical Cooperation Score (ECS) of $0.176$ (multi-seed mean $0.163$, 95% confidence interval (CI) $[0.150,0.174]$) against an unconstrained baseline of $\mathrm{ECS}=0$, enforced by a hard integrity gate ($1.000$ vs. $0.000$). We surface an autonomy paradox in which unconstrained agents resist manipulation more forcefully ($0.856$ vs. $0.728$) yet collapse to $\mathrm{ECS}=0$, establishing that system-level integrity cannot be delegated to agent-level defence. The advantage is monotonic in resistance ($+0.174$ to $+0.183$), seed-stable (Cliff’s $\delta =1.0$, complete separation), topology- and backbone-invariant across five contemporary LLMs, robust to alternative ECS formulations, and reproduces at N = 100. Against constitutional artificial intelligence (CAI) critique-revise and LlamaGuard-style safety-classifier baselines, the framework matches the integrity floor and adds a measurable margin on the secondary risk surface (burst timing, composite manipulation risk). The filter runs at 0.78 μs/call ($\approx 1.3\times {10}^6$ decisions/s/core), supporting always-on deployment as a stateless, model-agnostic component of LLM agent pipelines in adversarially contested electronic systems. Full article

Accurate prediction of steady-state relative permeability via pore-scale modeling is fundamental to understanding multiphase flow processes in diverse engineering applications. However, the stochastic nature of the initial fluid distribution (IFD) in simulations is frequently overlooked, creating uncertainties that may obscure the physical influence of critical parameters on transport behavior. In this study, a color-gradient lattice Boltzmann method was employed to conduct extensive steady-state simulations across two porous media of varying geometric complexity. The investigation focused on evaluating three representative IFD patterns across different capillary numbers (Ca) and viscosity ratios (M). By introducing the coefficient of variation (CV) and distribution interval overlap analysis, the IFD-induced uncertainty was systematically quantified. The results demonstrate that the IFD is a primary source of statistical variance in relative permeability, exhibiting a strong nonlinear coupling with Ca, M, and structural complexity. CV analysis reveals that uncertainty peaks within specific saturation windows, which shift according to the pore geometry. Specifically, the peak uncertainty window for total relative permeability shifts from S_w$\in$ [0.5, 0.7] in the simple model to S_w$\in$ [0.3, 0.5] in the heterogeneous model. Notably, the wetting phase exhibits pronounced instability in the low-saturation regime, with the wetting-phase CV reaching its maximum at S_w = 0.3 in the simple model. At low Ca conditions, IFD-induced errors can entirely mask the physical sensitivity of relative permeability to Ca and M within certain saturation intervals. Furthermore, variations in initial configurations lead to divergent evolutions of the fluid-fluid interfacial area relative to wetting saturation, highlighting the role of microscopic topological memory in governing flow behavior. This research provides a quantitative foundation for IFD sensitivity in pore-scale modeling and proposes the integration of a CV-based uncertainty framework into macro-scale models to enhance the robustness and reliability of multiphase flow predictions. Full article

Background/Objectives: The integration of Artificial Intelligence (AI) into clinical workflows raises critical questions regarding decision-making responsibility, as fully autonomous systems inevitably carry a margin of error that can be fatal in high-stakes fields like surgery. This study addresses this challenge by evaluating a “Human-in-the-Loop” (HITL) workflow, using intraoperative Optical Coherence Tomography (OCT) for glioma detection. We aimed to determine if integrating Machine Learning (ML)-generated segmentation maps with human contextual analysis resolves the tension between automation and clinical responsibility, yielding superior diagnostic reliability compared to structural or quantitative imaging alone. Methods: We retrospectively analyzed 86 intraoperative OCT scans from 27 patients. Five neurosurgeons blindly assessed the data across three progressive levels of processing: (1) structural scans, (2) physics-based parametric maps, and (3) SVM-based generated segmentation maps. Crucially, the HITL inference performance on segmentation maps was benchmarked against “models-only” inference pipeline: a SVM and a state-of-the-art multimodal reasoning model, Gemini 3.1 Pro. To evaluate interpretability and the operator’s ability to confidently exercise their authority, we measured inter-rater consistency alongside diagnostic performance. Results: The results demonstrate that, while quantitative parametric maps improved Global Accuracy (87% [95% CI: 82–92%]) compared to structural scans (80% [95% CI: 73–86%]), they suffered from an “interpretability gap,” resulting in a moderate inter-rater consistency of 0.68 [95% CI: 0.59–0.78]. In contrast, the HITL approach using segmentation maps maximized consensus to 0.98 [95% CI: 0.95–1.00] and achieved the highest performance (Accuracy 94% [95% CI: 88–98%] and Sensitivity 98% [95% CI: 92–100%]). Compared to the standalone models, the HITL approach significantly outperformed the SVM baseline (Accuracy 84% [95% CI: 81–87%]; Sensitivity 83% [95% CI: 78–88%]). Furthermore, it surpassed the SOTA Gemini 3.1 Pro model (Accuracy 90% [95% CI: 83–95%]; Sensitivity 86% [95% CI: 74–95%]). While the HITL sensitivity demonstrated a definitive and statistically significant edge over the Gemini model, the accuracy improvement fell just slightly short of undisputed statistical significance due to overlapping confidence intervals. Conclusions: By utilizing their clinical domain knowledge of tumor invasion patterns and topological priors, surgeons effectively filtered algorithmic noise—overriding ML errors in 69% (9 out of 13) false positive cases that models alone could not resolve. This demonstrates exactly how and where HITL optimally utilizes human contextual intelligence to outperform autonomous “models-only” pipelines, confirming a human-ML synergy that augments the objectivity of machine learning with human domain knowledge. This paradigm ensures that the ultimate responsibility for diagnostic inference remains safely and practically in human hands. Open Data Initiative: To ensure essential reproducibility, enable independent multi-center validation and support open science, all examples of intraoperative in vivo OCT brain scans used in this study are made publicly available. To the best of our knowledge, this represents the first open-access data of its kind globally. Full article

This paper proposes an energy-efficient LiDAR receiver topology based on a time-to-voltage converter (TVC) followed by a 5-bit SAR ADC. By converting the time-interval between START and STOP signals into the voltage domain, the proposed topology avoids the complexity of conventional TDC-based designs and enables the use of a moderate-speed, energy-efficient SAR ADC. The proposed TVC in the proposed LiDAR receiver consists of an on-chip avalanche photodiode (APD), a CMOS transimpedance-limiting amplifier (CTLA), a time-gating circuit, a ramp generator, and a peak-and-hold (PDH) block. Thereafter, the converted voltages are digitized by a VCM-based single-ended SAR ADC with a binary-weighted CDAC, a strong-arm latch comparator, and custom digital logic. A reset generator is also incorporated to coordinate the sampling, comparison, and settling phases. The proposed LiDAR receiver is implemented in a 180 nm CMOS process, where the TVC occupies an area of 171 μm × 98.8 μm, while the TVC-SAR receiver occupies 417 μm × 356 μm, respectively. The proposed LiDAR receiver consumes 13 mW from a single 1.8 V supply, in which the SAR ADC consumes 3.68 mW only. The TVC-SAR receiver resolves the time-intervals ranging from 7 ns to 32.1 ns with a resolution of 0.81 ns. Hence, the proposed topology provides an energy-efficient solution along with its reduced circuit complexity and chip implementation for short-range LiDAR applications. Full article

Abrupt maritime-energy disruption can generate system-wide production losses before firms and policymakers can adjust. Existing assessments usually emphasize direct exposure or long-run equilibrium responses, which makes them less suitable for short-run risk assessment in energy-dependent production systems. We develop a threshold-cascade framework that combines dual-track dependence topology, edge-level inventories, smooth operability bands, and a separate price-validation step to identify the blockade intensity at which a localized chokepoint shock becomes systemic production loss. The framework is evaluated against the March 2021 Suez blockage and the 2022 Russia–Ukraine producer-price episode, and then applied to a 2026 Strait of Hormuz stress scenario using the Organisation for Economic Co-operation and Development (OECD) Inter-Country Input-Output (ICIO) tables, 2025 edition, with the 2022 benchmark year. Under the baseline 150-day horizon, terminal loss first reaches 50% at about 32% blockade intensity, with a broader calibrated threshold band of 32–46%. Losses spread beyond the point of origin and become concentrated in East and Southeast Asian manufacturing supply chains and in downstream consumer markets after inventories at connected hubs are depleted. Policy experiments show that single-channel interventions shift the threshold only modestly, whereas an integrated package that relaxes logistics, inventories, and upstream scarcity moves the threshold to about 46% in this calibration. The analysis targets the weeks-to-months interval before substitution, contract renegotiation, and broader market adjustments dominate. Within that interval, the model identifies when buffers fail, how production losses spread, and which intervention packages delay systemic disruption. Full article