We present a search for solar axions produced through the axion-electron coupling $(g_{ae})$ using data from a novel 7-GridPix detector installed at the CERN Axion Solar Telescope (CAST). The detector, featuring ultra-thin silicon nitride windows and multiple veto systems, collected approximately 160 hours of solar tracking data between 2017-2018. Using machine learning techniques and the veto systems, we achieved a background rate of $1.06\times 10^{-5}\,\text{keV}^{-1}\text{cm}^{-2}\text{s}^{-1}$ at a signal efficiency of about $80\,\%$ in the $0.2$-$8\,\text{keV}$ range. Analysis of the data yielded no significant excess above background, allowing us to set a new upper limit on the product of the axion-electron and axion-photon couplings of g_{ae}\cdot g_{a\gamma} < 7.35\times 10^{-23}\,\text{GeV}^{-1} at $95\,\%$ confidence level. This result improves upon the previous best helioscope limit and demonstrates the potential of GridPix technology for rare event searches. Additionally, we derived a limit on the axion-photon coupling of g_{a\gamma} < 9.0\times 10^{-11}\,\text{GeV}^{-1} at $95\,\%$ CL, which, while not surpassing CAST's best limit, provides complementary constraints on axion models.

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. { The source codes are released at \url{this https URL}. }

Incomplete multi-view data classification poses significant challenges due to the common issue of missing views in real-world scenarios. Despite advancements, existing methods often fail to provide reliable predictions, largely due to the uncertainty of missing views and the inconsistent quality of imputed data. To tackle these problems, we propose a novel framework called Evidential Deep Partial Multi-View Classification (EDP-MVC). Initially, we use K-means imputation to address missing views, creating a complete set of multi-view data. However, the potential conflicts and uncertainties within this imputed data can affect the reliability of downstream inferences. To manage this, we introduce a Conflict-Aware Evidential Fusion Network (CAEFN), which dynamically adjusts based on the reliability of the evidence, ensuring trustworthy discount fusion and producing reliable inference outcomes. Comprehensive experiments on various benchmark datasets reveal EDP-MVC not only matches but often surpasses the performance of state-of-the-art methods.

The rapid expansion of the Internet of Things (IoT) has intensified security challenges, notably from Distributed Denial of Service (DDoS) attacks launched by compromised, resource-constrained devices. Traditional defenses are often ill-suited for the IoT paradigm, creating a need for lightweight, high-performance, edge-based solutions. This paper presents the design, implementation, and evaluation of an IoT security framework that leverages the extended Berkeley Packet Filter (eBPF) and the eXpress Data Path (XDP) for in-kernel mitigation of DDoS attacks. The system uses a rate-based detection algorithm to identify and block malicious traffic at the earliest stage of the network stack. The framework is evaluated using both Docker-based simulations and real-world deployment on a Raspberry Pi 4, showing over 97% mitigation effectiveness under a 100 Mbps flood. Legitimate traffic remains unaffected, and system stability is preserved even under attack. These results confirm that eBPF/XDP provides a viable and highly efficient solution for hardening IoT edge devices against volumetric network attacks.

Various types of promising techniques have come into being for influence maximization whose aim is to identify influential nodes in complex networks. In essence, real-world applications usually have high requirements on the balance between time complexity and accuracy of influential nodes identification. To address the challenges of imperfect node influence measurement and inefficient seed nodes selection mechanism in such class of foregoing techniques, this article proposes a novel approach called Cost-Effective Community-Hierarchy-Based Mutual Voting for influence maximization in complex networks. First, we develop a method for measuring the importance of different nodes in networks based on an original concept of Dual-Scale Community-Hierarchy Information that synthesizes both hierarchy structural information and community structural information of nodes. The community structural information contained in the nodes is measured by a new notion of Hierarchical-Community Entropy. Second, we develop a method named Cost-Effective Mutual-Influence-based Voting for seed nodes selection. Hereinto, a low-computational-cost mutual voting mechanism and an updating strategy called Lazy Score Updating Strategy are newly constructed for optimizing the selecting of seed nodes. Third, we develop a balance index to evaluate the performance of different methods in striking the tradeoff between time complexity and the accuracy of influential nodes identification. Finally, we demonstrate the approach performance over ten public datasets. The extensive experiments show that the proposed approach outperforms 16 state-of-the-art techniques on the balance between time complexity and accuracy of influential nodes identification. Compared with the method with the second highest value of the balance index, our approach can be improved by at most 9.29%.

Medical image segmentation methods generally assume that the process from medical image to segmentation is unbiased, and use neural networks to establish conditional probability models to complete the segmentation task. This assumption does not consider confusion factors, which can affect medical images, such as complex anatomical variations and imaging modality limitations. Confusion factors obfuscate the relevance and causality of medical image segmentation, leading to unsatisfactory segmentation results. To address this issue, we propose a multi-causal aware modeling backdoor-intervention optimization (MAMBO-NET) network for medical image segmentation. Drawing insights from causal inference, MAMBO-NET utilizes self-modeling with multi-Gaussian distributions to fit the confusion factors and introduce causal intervention into the segmentation process. Moreover, we design appropriate posterior probability constraints to effectively train the distributions of confusion factors. For the distributions to effectively guide the segmentation and mitigate and eliminate the Impact of confusion factors on the segmentation, we introduce classical backdoor intervention techniques and analyze their feasibility in the segmentation task. To evaluate the effectiveness of our approach, we conducted extensive experiments on five medical image datasets. The results demonstrate that our method significantly reduces the influence of confusion factors, leading to enhanced segmentation accuracy.

Neural architecture search (NAS) provides a systematic framework for automating the design of neural network architectures, yet its widespread adoption is hindered by prohibitive computational requirements. Existing zero-cost proxy methods, while reducing search overhead, demonstrate inadequate performance in architecture ranking tasks, particularly for Transformer-based models where they often underperform simple parameter counting metrics. Current automated proxy discovery approaches suffer from extended search times, susceptibility to data overfitting, and structural complexity. This paper introduces a novel zero-cost proxy methodology that quantifies model capacity through efficient weight statistics computation while decomposing Transformer architectures into functionally distinct sub-modules, thereby optimizing the balance of their contributions to overall performance. Our comprehensive evaluation demonstrates the superiority of this approach, achieving a Spearman's rho of 0.76 and Kendall's tau of 0.53 on the FlexiBERT benchmark. The proposed method exhibits exceptional computational efficiency while maintaining robust performance across diverse NAS benchmark tasks, offering a practical solution for large-scale architecture search.

Integrated sensing and communications (ISAC) has emerged as a means to efficiently utilize spectrum and thereby save cost and power. At the higher end of the spectrum, ISAC systems operate at wideband using large antenna arrays to meet the stringent demands for high-resolution sensing and enhanced communications capacity. On the other hand, the overall design should satisfy energy-efficiency and hardware constraints such as operating on low resolution components for a practical scenario. Therefore, this paper presents the design of Hybrid ANalog and Digital BeAmformers with Low resoLution (HANDBALL) digital-to-analog converters (DACs). We introduce a greedy-search-based approach to design the analog beamformers for multi-user multi-target ISAC scenario. Then, the quantization distortion is taken into account in order to design the baseband beamformer with low resolution DACs. We evaluated performance of the proposed HANDBALL technique in terms of both spectral efficiency and sensing beampattern, providing a satisfactory sensing and communication performance for both one-bit and few-bit designs.

Dempster-Shafer Theory (DST) provides a powerful framework for modeling uncertainty and has been widely applied to multi-attribute classification tasks. However, traditional DST-based attribute fusion-based classifiers suffer from oversimplified membership function modeling and limited exploitation of the belief structure brought by basic probability assignment (BPA), reducing their effectiveness in complex real-world scenarios. This paper presents an enhanced attribute fusion-based classifier that addresses these limitations through two key innovations. First, we adopt a selective modeling strategy that utilizes both single Gaussian and Gaussian Mixture Models (GMMs) for membership function construction, with model selection guided by cross-validation and a tailored evaluation metric. Second, we introduce a novel method to transform the possibility distribution into a BPA by combining simple BPAs derived from normalized possibility distributions, enabling a much richer and more flexible representation of uncertain information. Furthermore, we apply the belief structure-based BPA generation method to the evidential K-Nearest Neighbors classifier, enhancing its ability to incorporate uncertainty information into decision-making. Comprehensive experiments on benchmark datasets are conducted to evaluate the performance of the proposed attribute fusion-based classifier and the enhanced evidential K-Nearest Neighbors classifier in comparison with both evidential classifiers and conventional machine learning classifiers. The results demonstrate that our proposed classifier outperforms the best existing evidential classifier, achieving an average accuracy improvement of 4.84%, while maintaining low variance, thus confirming its superior effectiveness and robustness.

In order to avoid conventional controlling methods which created obstacles due to the complexity of systems and intense demand on data density, developing modern and more efficient control methods are required. In this way, reinforcement learning off-policy and model-free algorithms help to avoid working with complex models. In terms of speed and accuracy, they become prominent methods because the algorithms use their past experience to learn the optimal policies. In this study, three reinforcement learning algorithms; DDPG, TD3 and SAC have been used to train Fetch robotic manipulator for four different tasks in MuJoCo simulation environment. All of these algorithms are off-policy and able to achieve their desired target by optimizing both policy and value functions. In the current study, the efficiency and the speed of these three algorithms are analyzed in a controlled environment.

A Service Level Agreement (SLA) is a formal contract between a service provider and a consumer, representing a crucial instrument to define, manage, and maintain relationships between these two parties. The SLA's ability to define the Quality of Service (QoS) expectations, standards, and accountability helps to deliver high-quality services and increase client confidence in disparate application domains, such as Cloud computing and the Internet of Things. An open research direction in this context is related to the possible integration of new metrics to address the security and privacy aspects of services, thus providing protection of sensitive information, mitigating risks, and building trust. This survey paper identifies state of the art covering concepts, approaches, and open problems of SLA management with a distinctive and original focus on the recent development of Security SLA (SecSLA). It contributes by carrying out a comprehensive review and covering the gap between the analyses proposed in existing surveys and the most recent literature on this topic, spanning from 2017 to 2023. Moreover, it proposes a novel classification criterium to organize the analysis based on SLA life cycle phases. This original point of view can help both academics and industrial practitioners to understand and properly locate existing contributions in the advancement of the different aspects of SLA technology. The present work highlights the importance of the covered topics and the need for new research improvements to tackle present and demanding challenges.

Skin lesion datasets provide essential information for understanding various skin conditions and developing effective diagnostic tools. They aid the artificial intelligence-based early detection of skin cancer, facilitate treatment planning, and contribute to medical education and research. Published large datasets have partially coverage the subclassifications of the skin lesions. This limitation highlights the need for more expansive and varied datasets to reduce false predictions and help improve the failure analysis for skin lesions. This study presents a diverse dataset comprising 12,345 dermatoscopic images with 38 subclasses of skin lesions collected in Turkiye which comprises different skin types in the transition zone between Europe and Asia. Each subgroup contains high-resolution photos and expert annotations, providing a strong and reliable basis for future research. The detailed analysis of each subgroup provided in this study facilitates targeted research endeavors and enhances the depth of understanding regarding the skin lesions. This dataset distinguishes itself through a diverse structure with 5 super classes, 15 main classes, 38 subclasses and its 12,345 high-resolution dermatoscopic images.

Cell-free massive MIMO is a key 6G technology, offering superior spectral and energy efficiency. However, its dense deployment of low-cost access points (APs) makes hardware impairments unavoidable. While narrowband impairments are well-studied, their impact in wideband systems remains unexplored. This paper provides the first comprehensive analysis of hardware impairments, such as nonlinear distortion in low-noise amplifiers, phase noise, in-phase-quadrature imbalance, and low-resolution analog-to-digital converters, on uplink spectral efficiency in cell-free massive MIMO. Using an OFDM waveform and centralized processing, APs share channel state information for joint uplink combining. Leveraging Bussgang decomposition, we derive a distortion-aware combining vector that optimizes spectral efficiency by modeling distortion as independent colored noise.

Hypothetical axions provide a compelling explanation for dark matter and could be emitted from the hot solar interior. The CERN Axion Solar Telescope (CAST) has been searching for solar axions via their back conversion to X-ray photons in a 9-T 10-m long magnet directed towards the Sun. We report on an extended run with the IAXO (International Axion Observatory) pathfinder detector, doubling the previous exposure time. The detector was operated with a xenon-based gas mixture for part of the new run, providing technical insights for future detector configurations in IAXO. No counts are detected in the 95% signal-encircling region during the new run, while 0.75 are expected. The new data improve the axion-photon coupling limit to 5.8$\times 10^{-11}\,$GeV$^{-1}$at 95$m_a \lesssim 0.02$ eV), the most restrictive experimental limit to date.

It has been previously advocated that the presence of the daily and annual modulations of the axion flux on the Earth's surface may dramatically change the strategy of the axion searches. The arguments were based on the so-called Axion Quark Nugget (AQN) dark matter model which was originally put forward to explain the similarity of the dark and visible cosmological matter densities $\Omega_{\rm dark}\sim \Omega_{\rm visible}$. In this framework, the population of galactic axions with mass $ 10^{-6} {\rm eV}\lesssim m_a\lesssim 10^{-3}{\rm eV}$and velocity$\langle v_a\rangle\sim 10^{-3} c$ will be accompanied by axions with typical velocities $\langle v_a\rangle\sim 0.6 c$ emitted by AQNs. Furthermore, in this framework, it has also been argued that the AQN-induced axion daily modulation (in contrast with the conventional WIMP paradigm) could be as large as $(10-20)\%$, which represents the main motivation for the present investigation. We argue that the daily modulations along with the broadband detection strategy can be very useful tools for the discovery of such relativistic axions. The data from the CAST-CAPP detector have been used following such arguments. Unfortunately, due to the dependence of the amplifier chain on temperature-dependent gain drifts and other factors, we could not conclusively show the presence or absence of a dark sector-originated daily modulation. However, this proof of principle analysis procedure can serve as a reference for future studies.

Celestial observations often exhibit inexplicable planetary dependencies when the timing of an observable is projected onto planetary heliocentric positions. This is possible only for incident, non-relativistic streams. Notably, the celebrated dark matter (DM) in the Universe can form streams in our vicinity with speeds of about 240 km/s. Since gravitational impact scales with $1/(\text{velocity})^2$, all solar system objects, including the Sun and the Moon, act as strong gravitational lenses, with their focal planes located within the solar system. Even the Moon can focus penetrating particles toward the Earth at speeds of up to approximately 400 km/s, covering a large portion of the phase space of DM constituents. Consequently, the unexpected planetary dependencies of solar system observables may provide an alternative to Zwicky's tension regarding the overestimated visible cosmic mass. In this work, an overlooked but unexpected planetary dependency of any local observable serves as an analogue to Zwicky's cosmic measurements, particularly if a similar mysterious behavior has been previously noted. Thus, a persistent, unexpected planetary dependency represents a new tension between observation and expectation. The primary argument supporting DM in line with Zwicky's paradigm is this planetary dependency, which, on a local scale, constitutes the novel tension between observation and expectation. In particular, the recurrent planetary dependency of diverse observables mirrors Zwicky's cosmic tension with the overestimated visible mass. No other approach accounts for so many otherwise striking and mysterious observations in physics and medicine.

This paper considers the linear objective function optimization with respect to a more general class of bipolar fuzzy relational equations, where the fuzzy compositions are defined by an arbitrary continuous Archimedean t-norm. In addition, a faster method for finding a global optimum is proposed that, unlike the previous work, does not require obtaining all local optimal solutions and classifying the constraints. Analytical concepts and properties of the Archimedean bipolar fuzzy equations are investigated and two necessary conditions are presented to conceptualize the feasibility of the problem. It is shown that the feasible solution set can be resulted by a union of the finite number of compact sets, where each compact set is obtained by a function. Moreover, to accelerate identification of the mentioned compact sets (and therefore, to speed up solution finding), four simplification techniques are presented, which are based on either omitting redundant constraints and/or eliminating unknowns by assigning them a fixed value. Also, three additional simplification techniques are given to reduce the search domain by removing some parts of the feasible region that do not contain optimal solutions. Subsequently, a method is proposed to find an optimal solution for the current linear optimization problems. The proposed method consists of two accelerative strategies that are used during the problem solving process. By the first strategy, the method neglects some candidate solutions that are not optimal, by considering only a subset of admissible functions. As for the second strategy, a branch-and-bound method is used to delete non-optimal branches. Then, the method is summarized in an algorithm that represents all essential steps of the solution and finally, the whole method is applied in an example that has been chosen in such a way that the various situations are illustrated.

Extracting medical history entities (MHEs) related to a patient's chief complaint (CC), history of present illness (HPI), and past, family, and social history (PFSH) helps structure free-text clinical notes into standardized EHRs, streamlining downstream tasks like continuity of care, medical coding, and quality metrics. Fine-tuned clinical large language models (cLLMs) can assist in this process while ensuring the protection of sensitive data via on-premises deployment. This study evaluates the performance of cLLMs in recognizing CC/HPI/PFSH-related MHEs and examines how note characteristics impact model accuracy. We annotated 1,449 MHEs across 61 outpatient-related clinical notes from the MTSamples repository. To recognize these entities, we fine-tuned seven state-of-the-art cLLMs. Additionally, we assessed the models' performance when enhanced by integrating, problems, tests, treatments, and other basic medical entities (BMEs). We compared the performance of these models against GPT-4o in a zero-shot setting. To further understand the textual characteristics affecting model accuracy, we conducted an error analysis focused on note length, entity length, and segmentation. The cLLMs showed potential in reducing the time required for extracting MHEs by over 20%. However, detecting many types of MHEs remained challenging due to their polysemous nature and the frequent involvement of non-medical vocabulary. Fine-tuned GatorTron and GatorTronS, two of the most extensively trained cLLMs, demonstrated the highest performance. Integrating pre-identified BME information improved model performance for certain entities. Regarding the impact of textual characteristics on model performance, we found that longer entities were harder to identify, note length did not correlate with a higher error rate, and well-organized segments with headings are beneficial for the extraction.