Search

The healthcare sector has experienced a rapid accumulation of digital data recently, especially in the form of electronic health records (EHRs). EHRs constitute a precious resource that IS researchers could utilize for clinical applications (e.g., morbidity prediction). Deep learning seems like the obvious choice to exploit this surfeit of data. However, numerous studies have shown that deep learning does not enjoy the same kind of success on EHR data as it has in other domains; simple models like logistic regression are frequently as good as sophisticated deep learning ones. Inspired by this observation, we develop a novel model called rational logistic regression (RLR) that has standard logistic regression (LR) as its special case (and thus inherits LR's inductive bias that aligns with EHR data). RLR has rational series as its theoretical underpinnings, works on longitudinal time-series data, and learns interpretable patterns. Empirical comparisons on real-world clinical tasks demonstrate RLR's efficacy., Comment: ICIS 2021 Proceedings ( see https://aisel.aisnet.org/icis2021/is_health/is_health/18 )

Artificial intelligence (AI)-based decision support systems hold promise for enhancing diagnostic accuracy and efficiency in computational pathology. However, human-AI collaboration can introduce and amplify cognitive biases, such as confirmation bias caused by false confirmation when erroneous human opinions are reinforced by inaccurate AI output. This bias may worsen when time pressure, ubiquitously present in routine pathology, strains practitioners' cognitive resources. We quantified confirmation bias triggered by AI-induced false confirmation and examined the role of time constraints in a web-based experiment, where trained pathology experts (n=28) estimated tumor cell percentages. Our results suggest that AI integration may fuel confirmation bias, evidenced by a statistically significant positive linear-mixed-effects model coefficient linking AI recommendations mirroring flawed human judgment and alignment with system advice. Conversely, time pressure appeared to weaken this relationship. These findings highlight potential risks of AI use in healthcare and aim to support the safe integration of clinical decision support systems.

Fabrication of quantum processors in advanced 300 mm wafer-scale complementary metal-oxide-semiconductor (CMOS) foundries provides a unique scaling pathway towards commercially viable quantum computing with potentially millions of qubits on a single chip. Here, we show precise qubit operation of a silicon two-qubit device made in a 300 mm semiconductor processing line. The key metrics including single- and two-qubit control fidelities exceed 99% and state preparation and measurement fidelity exceeds 99.9%, as evidenced by gate set tomography (GST). We report coherence and lifetimes up to $T_\mathrm{2}^{\mathrm{*}} = 30.4$ $\mu$s, $T_\mathrm{2}^{\mathrm{Hahn}} = 803$ $\mu$s, and $T_1 = 6.3$ s. Crucially, the dominant operational errors originate from residual nuclear spin carrying isotopes, solvable with further isotopic purification, rather than charge noise arising from the dielectric environment. Our results answer the longstanding question whether the favourable properties including high-fidelity operation and long coherence times can be preserved when transitioning from a tailored academic to an industrial semiconductor fabrication technology., Comment: 10 pages, 4 figures, 4 extended data figures

Pulsar timing arrays can detect continuous nanohertz gravitational waves emitted by individual supermassive black hole binaries. The data analysis procedure can be formulated within a time-domain, state-space framework, in which the radio timing observations are related to a temporal sequence of latent states, namely the intrinsic pulsar spin frequency. The achromatic wandering of the pulsar spin frequency is tracked using a Kalman filter concurrently with the pulse frequency modulation induced by a gravitational wave from a single source. The modulation is the sum of terms proportional to the gravitational wave strain at the Earth and at every pulsar in the array. Here we generalize previous state-space formulations of the pulsar timing array problem to include the pulsar terms; that is, we copy the pulsar terms from traditional, non-state-space analyses over to the state-space framework. The performance of the generalized Kalman filter is tested using astrophysically representative software injections in Gaussian measurement noise. It is shown that including the pulsar terms corrects for previously identified biases in the parameter estimates (especially the sky position of the source) which also arise in traditional matched-filter analyses that exclude the pulsar terms. Additionally, including the pulsar terms decreases the minimum detectable strain by $14\%$. Overall, the study verifies that the pulsar terms do not raise any special extra impediments for the state-space framework, beyond those studied in traditional analyses. The inspiral-driven evolution of the wave frequency at the Earth and at the retarded time at every pulsar in the array is also investigated., Comment: 24 pages, 13 figures. Accepted for publication in MNRAS. arXiv admin note: text overlap with arXiv:2409.14613

Human motion capture from monocular videos has made significant progress in recent years. However, modern approaches often produce temporal artifacts, e.g. in form of jittery motion and struggle to achieve smooth and physically plausible motions. Explicitly integrating physics, in form of internal forces and exterior torques, helps alleviating these artifacts. Current state-of-the-art approaches make use of an automatic PD controller to predict torques and reaction forces in order to re-simulate the input kinematics, i.e. the joint angles of a predefined skeleton. However, due to imperfect physical models, these methods often require simplifying assumptions and extensive preprocessing of the input kinematics to achieve good performance. To this end, we propose a novel method to selectively incorporate the physics models with the kinematics observations in an online setting, inspired by a neural Kalman-filtering approach. We develop a control loop as a meta-PD controller to predict internal joint torques and external reaction forces, followed by a physics-based motion simulation. A recurrent neural network is introduced to realize a Kalman filter that attentively balances the kinematics input and simulated motion, resulting in an optimal-state dynamics prediction. We show that this filtering step is crucial to provide an online supervision that helps balancing the shortcoming of the respective input motions, thus being important for not only capturing accurate global motion trajectories but also producing physically plausible human poses. The proposed approach excels in the physics-based human pose estimation task and demonstrates the physical plausibility of the predictive dynamics, compared to state of the art. The code is available on https://github.com/cuongle1206/OSDCap, Comment: 17 pages, 7 figure, accepted to NeurIPS 2024

Continuous nanohertz gravitational waves from individual supermassive black hole binaries may be detectable with pulsar timing arrays. A novel search strategy is developed, wherein intrinsic achromatic spin wandering is tracked simultaneously with the modulation induced by a single gravitational wave source in the pulse times of arrival. A two-step inference procedure is applied within a state-space framework, such that the modulation is tracked with a Kalman filter, which then provides a likelihood for nested sampling. The procedure estimates the static parameters in the problem, such as the sky position of the source, without fitting for ensemble-averaged statistics such as the power spectral density of the timing noise, and therefore complements traditional parameter estimation methods. It also returns the Bayes factor relating a model with a single gravitational wave source to one without, complementing traditional detection methods. It is shown via astrophysically representative software injections in Gaussian measurement noise that the procedure distinguishes a gravitational wave from pure noise down to a characteristic wave strain of $h_0 \approx 2 \times 10^{-15}$. Full posterior distributions of model parameters are recovered and tested for accuracy. There is a bias of $\approx 0.3$ rad in the marginalised one-dimensional posterior for the orbital inclination $\iota$, introduced by dropping the so-called `pulsar terms'. Smaller biases $\lesssim 10 \%$ are also observed in other static parameters., Comment: 26 pages, 11 figures. Accepted for publication in MNRAS

The state-of-the-art tensor network Kalman filter lifts the curse of dimensionality for high-dimensional recursive estimation problems. However, the required rounding operation can cause filter divergence due to the loss of positive definiteness of covariance matrices. We solve this issue by developing, for the first time, a tensor network square root Kalman filter, and apply it to high-dimensional online Gaussian process regression. In our experiments, we demonstrate that our method is equivalent to the conventional Kalman filter when choosing a full-rank tensor network. Furthermore, we apply our method to a real-life system identification problem where we estimate $4^{14}$ parameters on a standard laptop. The estimated model outperforms the state-of-the-art tensor network Kalman filter in terms of prediction accuracy and uncertainty quantification.

We present a lightweight magnetic field simultaneous localisation and mapping (SLAM) approach for drift correction in odometry paths, where the interest is purely in the odometry and not in map building. We represent the past magnetic field readings as a one-dimensional trajectory against which the current magnetic field observations are matched. This approach boils down to sequential loop-closure detection and decision-making, based on the current pose state estimate and the magnetic field. We combine this setup with a path estimation framework using an extended Kalman smoother which fuses the odometry increments with the detected loop-closure timings. We demonstrate the practical applicability of the model with several different real-world examples from a handheld iPad moving in indoor scenes., Comment: To appear in International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI) 2024

Layered 2D halide perovskites are chemically synthesized realizations of quantum well stacks with giant exciton oscillator strengths, tunable emission spectra and very large exciton binding energies. While these features render 2D halide perovskites a promising platform for room-temperature polaritonics, bosonic condensation and polariton lasing in 2D perovskites have so far remained elusive at ambient conditions. Here, we demonstrate room-temperature cavity exciton-polariton condensation in mechanically exfoliated crystals of the 2D Ruddlesden-Popper iodide perovskite $(BA)_{2}(MA)_{2}Pb_{3}I_{10}$ in an open optical microcavity. We observe a polariton condensation threshold of $P_{th}=6.76 fJ$ per pulse and detect a strong non-linear response. Interferometric measurements confirm the spontaneous emergence of spatial coherence across the condensate with an associated first-order autocorrelation reaching $g^{(1)}\approx 0.6$. Our results lay the foundation for a new class of room-temperature polariton lasers based on 2D halide perovskites with great potential for hetero-integration with other van-der-Waals materials and combination with photonic crystals or waveguides., Comment: 21 pages, 8 figures

This paper deals with a Tikhonov regularized second-order plus first-order primal-dual dynamical system with time scaling for separable convex optimization problems with linear equality constraints. This system consists of two second-order ordinary differential equations for the primal variables and one first-order ordinary differential equation for the dual variable.By utilizing the Lyapunov analysis approach, we obtain the convergence properties of the primal-dual gap, the objective function error, the feasibility measure and the gradient norm of the objective function along the trajectory. We also establish the strong convergence of the primal trajectory generated by the dynamical system towards the minimal norm solution of the separable convex optimization problem. Furthermore, we give numerical experiments to illustrate the theoretical results, showing that our dynamical system performs better than those in the literature in terms of convergence rates.

We discuss the geometric formulation of continuum defects consisting of dislocations and disclinations. After reviewing the metric affine geometry and the present geometric formulation of dislocation and disclination written in terms of torsion and full curvature (together with vanishing non-metricity), we give a new theory of them in a novel way in terms of torsion and non-metricity (together with vanishing full curvature), the so-called general teleparallel geometry. All calculations are performed by using the exterior algebra. We obtain continuity equations explicitly for dislocation density and disclination density.

Floquet engineering of topological phase transitions driven by a high-frequency time-periodic field is a promising approach to realizing new topological phases of matter distinct from static states. Here, we theoretically investigate Floquet engineering topological phase transitions in the quantum spin Hall $\alpha$-$T_{3}$ system driven by an off-resonant circularly polarized light. In addition to the quantum spin (anomalous) Hall insulator phase with multiple helical (chiral) edge states, spin-polarized topological metallic phases are observed, where the bulk topological band gap of one spin sub-band overlaps with the other gapless spin sub-band. Moreover, with a staggered potential, the topological invariants of the system depend on whether the middle band is occupied because of the breaking of particle-hole symmetry. Our work highlights the significance of Floquet engineering in realizing new topological phases in $\alpha$-$T_{3}$ lattices., Comment: 11 pages, 6 figures

Ultrafast all-optical logic devices based on nonlinear light-matter interactions hold the promise to overcome the speed limitations of conventional electronic devices. Strong coupling of excitons and photons inside an optical resonator enhances such interactions and generates new polariton states which give access to unique nonlinear phenomena, such as Bose-Einstein condensation, used for all-optical ultrafast polariton transistors. However, the pulse energies required to pump such devices range from tens to hundreds of pJ, making them not competitive with electronic transistors. Here we introduce a new paradigm for all-optical switching based on the ultrafast transition from the strong to the weak coupling regime in microcavities embedding atomically thin transition metal dichalcogenides. Employing single and double stacks of hBN-encapsulated MoS$_2$ homobilayers with high optical nonlinearities and fast exciton relaxation times, we observe a collapse of the 55-meV polariton gap and its revival in less than one picosecond, lowering the threshold for optical switching below 4 pJ per pulse, while retaining ultrahigh switching frequencies. As an additional degree of freedom, the switching can be triggered pumping either the intra- or the interlayer excitons of the bilayers at different wavelengths, speeding up the polariton dynamics, owing to unique interspecies excitonic interactions. Our approach will enable the development of compact ultrafast all-optical logical circuits and neural networks, showcasing a new platform for polaritonic information processing based on manipulating the light-matter coupling.

Nowadays, cyberattacks are growing exponentially, causing havoc to Internet users. In particular, authentication attacks constitute the major attack vector where intruders impersonate legitimate users to maliciously access systems or resources. Traditional single-factor authentication (SFA) protocols are often bypassed by side-channel and other attack techniques, hence they are no longer sufficient to the current authentication requirements. To alleviate this problem, multi-factor authentication (MFA) protocols have been widely adopted recently, which helps to raise the security bar against imposters. Although MFA is generally considered more robust and secure than SFA, it may not always guarantee enhanced security and efficiency. This is because, critical security vulnerabilities and performance problems may still arise due to design or implementation flaws of the protocols. Such vulnerabilities are often left unnoticed until they are exploited by attackers. Therefore, the main objective of this work is identifying such vulnerabilities in existing MFA protocols by systematically analysing their designs and constructions. To this end, we first form a set of security evaluation criteria, encompassing both existing and newly introduced ones, which we believe are very critical for the security of MFA protocols. Then, we thoroughly review several MFA protocols across different domains. Subsequently, we revisit and thoroughly analyze the design and construction of the protocols to identify potential vulnerabilities. Consequently, we manage to identify critical vulnerabilities in ten of the MFA protocols investigated. We thoroughly discuss the identified vulnerabilities in each protocol and devise relevant mitigation strategies. We also consolidate the performance information of those protocols to show the runtime and storage cost when employing varying number of authentication factors.

Deep Neural Networks (DNNs) are vulnerable to backdoor poisoning attacks, with most research focusing on digital triggers, special patterns digitally added to test-time inputs to induce targeted misclassification. In contrast, physical triggers, which are natural objects within a physical scene, have emerged as a desirable alternative since they enable real-time backdoor activations without digital manipulation. However, current physical attacks require that poisoned inputs have incorrect labels, making them easily detectable upon human inspection. In this paper, we collect a facial dataset of 21,238 images with 7 common accessories as triggers and use it to study the threat of clean-label backdoor attacks in the physical world. Our study reveals two findings. First, the success of physical attacks depends on the poisoning algorithm, physical trigger, and the pair of source-target classes. Second, although clean-label poisoned samples preserve ground-truth labels, their perceptual quality could be seriously degraded due to conspicuous artifacts in the images. Such samples are also vulnerable to statistical filtering methods because they deviate from the distribution of clean samples in the feature space. To address these issues, we propose replacing the standard $\ell_\infty$ regularization with a novel pixel regularization and feature regularization that could enhance the imperceptibility of poisoned samples without compromising attack performance. Our study highlights accidental backdoor activations as a key limitation of clean-label physical backdoor attacks. This happens when unintended objects or classes accidentally cause the model to misclassify as the target class., Comment: 36 pages, 18 figures, 18 papers, submitted to NeurIPS 2024

Deep neural networks are vulnerable to backdoor attacks, a type of adversarial attack that poisons the training data to manipulate the behavior of models trained on such data. Clean-label attacks are a more stealthy form of backdoor attacks that can perform the attack without changing the labels of poisoned data. Early works on clean-label attacks added triggers to a random subset of the training set, ignoring the fact that samples contribute unequally to the attack's success. This results in high poisoning rates and low attack success rates. To alleviate the problem, several supervised learning-based sample selection strategies have been proposed. However, these methods assume access to the entire labeled training set and require training, which is expensive and may not always be practical. This work studies a new and more practical (but also more challenging) threat model where the attacker only provides data for the target class (e.g., in face recognition systems) and has no knowledge of the victim model or any other classes in the training set. We study different strategies for selectively poisoning a small set of training samples in the target class to boost the attack success rate in this setting. Our threat model poses a serious threat in training machine learning models with third-party datasets, since the attack can be performed effectively with limited information. Experiments on benchmark datasets illustrate the effectiveness of our strategies in improving clean-label backdoor attacks.

Federated Class-Incremental Learning (FCIL) increasingly becomes important in the decentralized setting, where it enables multiple participants to collaboratively train a global model to perform well on a sequence of tasks without sharing their private data. In FCIL, conventional Federated Learning algorithms such as FedAVG often suffer from catastrophic forgetting, resulting in significant performance declines on earlier tasks. Recent works, based on generative models, produce synthetic images to help mitigate this issue across all classes, but these approaches' testing accuracy on previous classes is still much lower than recent classes, i.e., having better plasticity than stability. To overcome these issues, this paper presents Federated Global Twin Generator (FedGTG), an FCIL framework that exploits privacy-preserving generative-model training on the global side without accessing client data. Specifically, the server trains a data generator and a feature generator to create two types of information from all seen classes, and then it sends the synthetic data to the client side. The clients then use feature-direction-controlling losses to make the local models retain knowledge and learn new tasks well. We extensively analyze the robustness of FedGTG on natural images, as well as its ability to converge to flat local minima and achieve better-predicting confidence (calibration). Experimental results on CIFAR-10, CIFAR-100, and tiny-ImageNet demonstrate the improvements in accuracy and forgetting measures of FedGTG compared to previous frameworks.

Despite the promise of Federated Learning (FL) for privacy-preserving model training on distributed data, it remains susceptible to backdoor attacks. These attacks manipulate models by embedding triggers (specific input patterns) in the training data, forcing misclassification as predefined classes during deployment. Traditional single-trigger attacks and recent work on cooperative multiple-trigger attacks, where clients collaborate, highlight limitations in attack realism due to coordination requirements. We investigate a more alarming scenario: non-cooperative multiple-trigger attacks. Here, independent adversaries introduce distinct triggers targeting unique classes. These parallel attacks exploit FL's decentralized nature, making detection difficult. Our experiments demonstrate the alarming vulnerability of FL to such attacks, where individual backdoors can be successfully learned without impacting the main task. This research emphasizes the critical need for robust defenses against diverse backdoor attacks in the evolving FL landscape. While our focus is on empirical analysis, we believe it can guide backdoor research toward more realistic settings, highlighting the crucial role of FL in building robust defenses against diverse backdoor threats. The code is available at \url{https://anonymous.4open.science/r/nba-980F/}.

Federated Learning (FL) is a distributed machine learning approach that maintains data privacy by training on decentralized data sources. Similar to centralized machine learning, FL is also susceptible to backdoor attacks, where an attacker can compromise some clients by injecting a backdoor trigger into local models of those clients, leading to the global model's behavior being manipulated as desired by the attacker. Most backdoor attacks in FL assume a predefined target class and require control over a large number of clients or knowledge of benign clients' information. Furthermore, they are not imperceptible and are easily detected by human inspection due to clear artifacts left on the poison data. To overcome these challenges, we propose Venomancer, an effective backdoor attack that is imperceptible and allows target-on-demand. Specifically, imperceptibility is achieved by using a visual loss function to make the poison data visually indistinguishable from the original data. Target-on-demand property allows the attacker to choose arbitrary target classes via conditional adversarial training. Additionally, experiments showed that the method is robust against state-of-the-art defenses such as Norm Clipping, Weak DP, Krum, Multi-Krum, RLR, FedRAD, Deepsight, and RFLBAT. The source code is available at https://github.com/nguyenhongson1902/Venomancer.

Let $1 \le k \le n,$ and let $v_1,\ldots,v_k$ be integral vectors in $\mathbb{Z}^n$. We consider the wedge map $\alpha_{n,k} : (\mathbb{Z}^n)^k /SL_k(\mathbb{Z}) \rightarrow \wedge^k(\mathbb{Z}^n)$, $(v_1,\ldots,v_k) \rightarrow v_1 \wedge \cdots \wedge v_k $. In his Disquisitiones, Gauss proved that $\alpha_{n,2}$ is injective when restricted to a primitive system of vectors when defining his composition law for binary quadratic forms. He also gave an algorithm for inverting $\alpha_{3,2}$ in a different context on the representation of integers by ternary quadratic forms. We give here an explicit algorithm for inverting $\alpha_{n,2}$, and observe via Bhargava's composition law for $\mathbb{Z}^2 \otimes \mathbb{Z}^2 \otimes \mathbb{Z}^2 $ cube that inverting $\alpha_{4,2}$ is the main algorithmic step in Gauss's composition law for binary quadratic forms. This places Gauss's composition as a special case of the geometric problem of inverting a wedge map which may be of independent interests. We also show that a given symmetric positive definite matrix $A$ induces a natural metric on the integral Grassmannian $G_{n,k}(\mathbb{Z})$ so that the map $X \rightarrow X^TAX$ becomes norm preserving., Comment: 10 pages

We develop a microscopic theory for nonlinear optical response of moir\'e exciton-polaritons in bilayers of transition metal dichalcogenides (TMDs). Our theory allows to study the tunnel-coupled intralayer and interlayer excitonic modes for a wide range of twist angles ($\theta$), external electric field, and light-matter coupling, providing insights into the hybridization regime inaccessible before. Specifically, we account for the Umklapp scattering processes of two exciton-polaritons responsible for enhanced nonlinearity, and show that it is crucial for describing interactions at strong hybridization. We reveal a regime of attractive nonlinearity for moir\'e polaritons, stemming from the anisotropic Coulomb interactions, which can explain some of experimental features of optical response in TMD bilayers. Furthermore, within our theory we demonstrate that the attractive nonlinearity can be tuned into repulsive by applying an external electric field. Our findings show that nonlinear moir\'e polaritons offer a controllable platform nonlinear polaritonic devices., Comment: main text: 8 pages and 3 figures, supplemental material: 5 pages and 1 figure

Deep Learning (DL) powered by Deep Neural Networks (DNNs) has revolutionized various domains, yet understanding the intricacies of DNN decision-making and learning processes remains a significant challenge. Recent investigations have uncovered an interesting memorization phenomenon in which DNNs tend to memorize specific details from examples rather than learning general patterns, affecting model generalization, security, and privacy. This raises critical questions about the nature of generalization in DNNs and their susceptibility to security breaches. In this survey, we present a systematic framework to organize memorization definitions based on the generalization and security/privacy domains and summarize memorization evaluation methods at both the example and model levels. Through a comprehensive literature review, we explore DNN memorization behaviors and their impacts on security and privacy. We also introduce privacy vulnerabilities caused by memorization and the phenomenon of forgetting and explore its connection with memorization. Furthermore, we spotlight various applications leveraging memorization and forgetting mechanisms, including noisy label learning, privacy preservation, and model enhancement. This survey offers the first-in-kind understanding of memorization in DNNs, providing insights into its challenges and opportunities for enhancing AI development while addressing critical ethical concerns.

Spontaneous brain activity in the absence of external stimuli is not random but contains complex dynamical structures such as neuronal avalanches with power-law duration and size distributions. These experimental observations have been interpreted as supporting evidence for the hypothesis that the brain is operating at criticality and attracted much attention. Here, we show that an entire state of coherent bursting, with power-law distributed avalanches and features as observed in experiments, emerges in networks of adaptive neurons with stochastic input when excitation is sufficiently strong and balanced by adaptation. We demonstrate that these power-law distributed avalanches are direct consequences of stochasticity and the oscillatory population firing rate arising from coherent bursting, which in turn is the result of the balance between excitation and adaptation, and criticality does not play a role.

Federated Learning (FL) is a promising paradigm that offers significant advancements in privacy-preserving, decentralized machine learning by enabling collaborative training of models across distributed devices without centralizing data. However, the practical deployment of FL systems faces a significant bottleneck: the communication overhead caused by frequently exchanging large model updates between numerous devices and a central server. This communication inefficiency can hinder training speed, model performance, and the overall feasibility of real-world FL applications. In this survey, we investigate various strategies and advancements made in communication-efficient FL, highlighting their impact and potential to overcome the communication challenges inherent in FL systems. Specifically, we define measures for communication efficiency, analyze sources of communication inefficiency in FL systems, and provide a taxonomy and comprehensive review of state-of-the-art communication-efficient FL methods. Additionally, we discuss promising future research directions for enhancing the communication efficiency of FL systems. By addressing the communication bottleneck, FL can be effectively applied and enable scalable and practical deployment across diverse applications that require privacy-preserving, decentralized machine learning, such as IoT, healthcare, or finance.

Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of $\lambda$-{\sf ADD}-codes, studying such codes with certain distance $d$ and codelength $n$. When $d$ is constant, we provide explicit code constructions with rates close to $1/2$. When $d$ is proportional to $n$, we provide a GV-type lower bound whose rates are efficiently computable. Upper bounds for such codes are also studied., Comment: To appear in ISIT 2024 Proceedings

Previously, a class of regular and asymptotically flat gravitating scalar solitons (scalarons) has been constructed in the Einstein--Klein--Gordon (EKG) theory by adopting a phantom field with Higgs-like potential where the kinetic term has the wrong sign and the scalaron possesses the negative Arnowitt--Deser--Misner (ADM) mass as a consequence. In this paper, we demonstrate that the use of the phantom field can be avoided by inverting the Higgs-like potential in the EKG system when the kinetic term has a proper sign, such that the corresponding gravitating scalaron can possess the positive ADM mass. We systematically study the basic properties of the gravitating scalaron, such as the ADM mass, the energy conditions, the geodesics of test particles, etc. Moreover, we find that it can be smoothly connected to the counterpart hairy black hole solutions from our recent work in the small horizon limit., Comment: 18 pages with 9 figures. Special Issue of the Universe (MDPI): Compact Objects (invited contribution)

Moon is an auspicious environment for the study of Galactic cosmic rays (GCR) and Solar particle events (SEP) due to the absence of magnetic field and atmosphere. The same characteristics raise the radiation risk for human presence in orbit around it or at the lunar surface. The secondary (albedo) radiation resulting from the interaction of the primary radiation with the lunar soil adds an extra risk factor, because neutrons are produced, but also it can be exploited to study the soil composition. In this paper, the design of a comprehensive radiation monitor package tailored to the lunar environment is presented. The detector, named LURAD, will perform spectroscopic measurements of protons, electrons, heavy ions, as well as gamma-rays, and neutrons. A microdosimetry monitor subsystem is foreseen which can provide measurements of LET(Si) spectra in a wide dynamic range of LET(Si) and flux for SPE and GCR, detection of neutrons and biological dose for radiation protection of astronauts. The LURAD design leverages on the following key enabling technologies: (a) Fully depleted Si monolithic active pixel sensors; (b) Scintillators read by silicon photomultipliers (SiPM); (c) Silicon on Insulator (SOI) microdosimetry sensors; These technologies promise miniaturization and mass reduction with state-of-the-art performance. The instrument's design is presented, and the Monte Carlo study of the feasibility of particle identification and kinetic energy determination is discussed, Comment: 28 pages, 14 figures

Every publicly traded company in the US is required to file an annual 10-K financial report, which contains a wealth of information about the company. In this paper, we propose an explainable deep-learning model, called FinBERT-XRC, that takes a 10-K report as input, and automatically assesses the post-event return volatility risk of its associated company. In contrast to previous systems, our proposed model simultaneously offers explanations of its classification decision at three different levels: the word, sentence, and corpus levels. By doing so, our model provides a comprehensive interpretation of its prediction to end users. This is particularly important in financial domains, where the transparency and accountability of algorithmic predictions play a vital role in their application to decision-making processes. Aside from its novel interpretability, our model surpasses the state of the art in predictive accuracy in experiments on a large real-world dataset of 10-K reports spanning six years., Comment: ICIS 2023 Proceedings. 3. https://aisel.aisnet.org/icis2023/blockchain/blockchain/3

In recent years, the supply and demand of electricity has significantly increased. As a result, the interconnecting grid infrastructure has required (and will continue to require) further expansion, while allowing for rapid resolution of unforeseen failures. Energy grid operators strive for networks that satisfy different levels of security requirements. In the case of N-1 security for medium voltage networks, the goal is to ensure the continued provision of electricity in the event of a single-link failure. However, the process of determining if networks are N-1 secure is known to scale polynomially in the network size. This poses restrictions if we increase our demand of the network. In that case, more computationally hard cases will occur in practice and the computation time also increases significantly. In this work, we explore the potential of quantum computers to provide a more scalable solution. In particular, we consider gate-based quantum computing, quantum annealing, and photonic quantum computing.

Optical imaging quality can be severely degraded by system and sample induced aberrations. Existing adaptive optics systems typically rely on iterative search algorithm to correct for aberrations and improve images. This study demonstrates the application of convolutional neural networks to characterise the optical aberration by directly predicting the Zernike coefficients from two to three phase-diverse optical images. We evaluated our network on 600,000 simulated Point Spread Function (PSF) datasets randomly generated within the range of -1 to 1 radians using the first 25 Zernike coefficients. The results show that using only three phase-diverse images captured above, below and at the focal plane with an amplitude of 1 achieves a low RMSE of 0.10 radians on the simulated PSF dataset. Furthermore, this approach directly predicts Zernike modes simulated extended 2D samples, while maintaining a comparable RMSE of 0.15 radians. We demonstrate that this approach is effective using only a single prediction step, or can be iterated a small number of times. This simple and straightforward technique provides rapid and accurate method for predicting the aberration correction using three or less phase-diverse images, paving the way for evaluation on real-world dataset., Comment: 12 pages, 6 figures, 4 tables

Virtual experiments (VEs), a modern tool in metrology, can be used to help perform an uncertainty evaluation for the measurand. Current guidelines in metrology do not cover the many possibilities to incorporate VEs into an uncertainty evaluation, and it is often difficult to assess if the intended use of a VE complies with said guidelines. In recent work, it was shown that a VE can be used in conjunction with real measurement data and a Monte Carlo procedure to produce equal results to a supplement of the Guide to the Expression of Uncertainty in Measurement. However, this was shown only for linear measurement models. In this work, we extend this Monte Carlo approach to a common class of non-linear measurement models and more complex VEs, providing a reference approach for suitable uncertainty evaluations involving VEs. Numerical examples are given to show that the theoretical derivations hold in a practical scenario., Comment: Conference proceeding submitted to XXIV IMEKO World Congress 2024

Domain shift is a formidable issue in Machine Learning that causes a model to suffer from performance degradation when tested on unseen domains. Federated Domain Generalization (FedDG) attempts to train a global model using collaborative clients in a privacy-preserving manner that can generalize well to unseen clients possibly with domain shift. However, most existing FedDG methods either cause additional privacy risks of data leakage or induce significant costs in client communication and computation, which are major concerns in the Federated Learning paradigm. To circumvent these challenges, here we introduce a novel architectural method for FedDG, namely gPerXAN, which relies on a normalization scheme working with a guiding regularizer. In particular, we carefully design Personalized eXplicitly Assembled Normalization to enforce client models selectively filtering domain-specific features that are biased towards local data while retaining discrimination of those features. Then, we incorporate a simple yet effective regularizer to guide these models in directly capturing domain-invariant representations that the global model's classifier can leverage. Extensive experimental results on two benchmark datasets, i.e., PACS and Office-Home, and a real-world medical dataset, Camelyon17, indicate that our proposed method outperforms other existing methods in addressing this particular problem.

In this paper, we generalise the construction of the functorial pullback of refined unramified cohomology between smooth schemes, by following the ideas of Fulton's intersection theory and Rost's cycle modules. We also define standard actions of algebraic cycles on the refined unramified cohomology groups of smooth proper schemes avoiding Chow's moving lemma, which coincide with Schreieder's constructions for smooth projective schemes. As applications, we prove the projective bundle and blow-up formulas for refined unramified cohomology groups and we reduce the Rost nilpotence principle in characteristic zero to a statement concerning certain refined unramified cohomology groups. Moreover, we compute the refined unramified cohomology for smooth proper linear varieties and show that Rost's nilpotence principle holds for these varieties in characteristic zero., Comment: 35 pages, comments are welcome

Machine Learning (ML) has replaced traditional handcrafted methods for perception and prediction in autonomous vehicles. Yet for the equally important planning task, the adoption of ML-based techniques is slow. We present nuPlan, the world's first real-world autonomous driving dataset, and benchmark. The benchmark is designed to test the ability of ML-based planners to handle diverse driving situations and to make safe and efficient decisions. To that end, we introduce a new large-scale dataset that consists of 1282 hours of diverse driving scenarios from 4 cities (Las Vegas, Boston, Pittsburgh, and Singapore) and includes high-quality auto-labeled object tracks and traffic light data. We exhaustively mine and taxonomize common and rare driving scenarios which are used during evaluation to get fine-grained insights into the performance and characteristics of a planner. Beyond the dataset, we provide a simulation and evaluation framework that enables a planner's actions to be simulated in closed-loop to account for interactions with other traffic participants. We present a detailed analysis of numerous baselines and investigate gaps between ML-based and traditional methods. Find the nuPlan dataset and code at nuplan.org., Comment: ICRA 2024 camera ready incl. supplementary material

The Ramsey numbers $R(T_n,W_8)$ are determined for each tree graph $T_n$ of order $n\geq 7$ and maximum degree $\Delta(T_n)$ equal to either $n-4$ or $n-5$. These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $R(T_n,W_m) = 2n-1$ for each tree graph $T_n$ of order $n\geq m-1$ with $\Delta(T_n)\leq n-m+2$ when $m\geq 4$ is even.