Miracle-dz/UniFAR-FTUs huggingface dataset:
Adaptation of the Concept of Brain Reserve for the Prediction of Stroke Outcome: Proxies, Neural Mechanisms, and Significance for Research

The prediction of stroke outcome is challenging due to the high inter-individual variability in stroke patients. We recently suggested the adaptation of the concept of brain reserve (BR) to improve the prediction of stroke outcome. This concept was initially developed alongside the one for the cognitive reserve for neurodegeneration and forms a valuable theoretical framework to capture high inter-individual variability in stroke patients. In the present work, we suggest and discuss (i) BR-proxies—quantitative brain characteristics at the time stroke occurs (e.g., brain volume, hippocampus volume), and (ii) proxies of brain pathology reducing BR (e.g., brain atrophy, severity of white matter hyperintensities), parameters easily available from a routine MRI examination that might improve the prediction of stroke outcome. Though the influence of these parameters on stroke outcome has been partly reported individually, their independent and combined impact is yet to be determined. Conceptually, BR is a continuous measure determining the amount of brain structure available to mitigate and compensate for stroke damage, thus reflecting individual differences in neural resources and a capacity to maintain performance and recover after stroke. We suggest that stroke outcome might be defined as an interaction between BR at the time stroke occurs and lesion load. BR in stroke can potentially be influenced, e.g., by modifying cardiovascular risk factors. In addition to the potential power of the BR concept in a mechanistic understanding of inter-individual variability in stroke outcome and establishing individualized therapeutic approaches, it might help to strengthen the synergy of preventive measures in stroke, neurodegeneration, and healthy aging.
Zein/Polysaccharide Nanoscale Electrostatic Complexes: Preparation, Drug Encapsulation and Antibacterial Properties

Characterization of zein aqueous solutions, as a function of the ethanol content and pH, was performed, giving information on the zein aggregation state for the construction of complexes. The aggregation state and surface charge of zein was found to depend on the mixed solvent composition and pH. Nonstoichiometric complex nanoparticles (NPECs) were prepared by electrostatically self-assembling zein, as the polycation, and sodium alginate or chondroitin sulfate, as the polyanions, at a pH of 4. A wide range of parameters were investigated: the alcohol–water content in the zein solutions, the charge molar ratios, the solution addition order and the addition rate. The resulting nanoparticles were characterized by dynamic and electrophoretic light scattering, circular dichroism and scanning electron microscopy. The smallest size for the NPECs (100 nm) was obtained when the polysaccharides acted as the titrate with an addition rate of 0.03 mL·min−1. The NPECs with the best characteristics were selected for loading with ciprofloxacin and then deposited on a cellulosic material in order to evaluate their antibacterial activity. Substantial drug encapsulation with desired drug release profiles were found together with notable antibacterial efficiency, showing the tunability of the properties for both the zein and its complexes with polysaccharides, together with their application potential in the biomedical field.
Evaluation of genetic associations with clinical phenotypes of kidney stone disease

Introduction and Objective We sought to replicate and discover genetic associations of kidney stone disease within a large-scale electronic health record (EHR) system. Methods We performed genome-wide association studies (GWASs) for nephrolithiasis from genotyped samples of 5,571 cases and 83,692 controls. Among the significant risk variants, we performed association analyses of stone composition and first-time 24-hour urine parameters. To assess disease severity, we investigated the associations of risk variants with age at first stone diagnosis, age at first procedure, and time from first to second procedure. Results The main GWAS analysis identified 10 significant loci, each located on chromosome 16 within coding regions of the UMOD gene, which codes for uromodulin, a urine protein with inhibitory activity for calcium crystallization. The strongest signal was from SNP 16:20359633-C-T (odds ratio [OR] 1.17, 95% CI 1.11-1.23), with the remaining significant SNPs having similar effect sizes. In subgroup GWASs by stone composition, 19 significant loci were identified, of which two loci were located in coding regions (brushite; NXPH1, rs79970906 and rs4725104). The UMOD SNP 16:20359633-C-T was associated with differences in 24-hour excretion of urinary calcium, uric acid, phosphorus, sulfate; and the minor allele was positively associated with calcium oxalate dihydrate stone composition (p<0.05). No associations were found between UMOD variants and disease severity. Conclusions We replicated germline variants associated with kidney stone disease risk at UMOD and reported novel variants associated with stone composition. Genetic variants of UMOD are associated with differences in 24-hour urine parameters and stone composition, but not disease severity.
Measuring Policy Distance for Multi-Agent Reinforcement Learning

Diversity plays a crucial role in improving the performance of multi-agent reinforcement learning (MARL). Currently, many diversity-based methods have been developed to overcome the drawbacks of excessive parameter sharing in traditional MARL. However, there remains a lack of a general metric to quantify policy differences among agents. Such a metric would not only facilitate the evaluation of the diversity evolution in multi-agent systems, but also provide guidance for the design of diversity-based MARL algorithms. In this paper, we propose the multi-agent policy distance (MAPD), a general tool for measuring policy differences in MARL. By learning the conditional representations of agents' decisions, MAPD can computes the policy distance between any pair of agents. Furthermore, we extend MAPD to a customizable version, which can quantify differences among agent policies on specified aspects. Based on the online deployment of MAPD, we design a multi-agent dynamic parameter sharing (MADPS) algorithm as an example of the MAPD's applications. Extensive experiments demonstrate that our method is effective in measuring differences in agent policies and specific behavioral tendencies. Moreover, in comparison to other methods of parameter sharing, MADPS exhibits superior performance.
Source Detection in Networks using the Stationary Distribution of a Markov Chain

Nowadays, the diffusion of information through social networks is a powerful phenomenon. One common way to model diffusions in social networks is the Independent Cascade (IC) model. Given a set of infected nodes according to the IC model, a natural problem is the source detection problem, in which the goal is to identify the unique node that has started the diffusion. Maximum Likelihood Estimation (MLE) is a common approach for tackling the source detection problem, but it is computationally hard. In this work, we propose an efficient method for the source detection problem under the MLE approach, which is based on computing the stationary distribution of a Markov chain. Using simulations, we demonstrate the effectiveness of our method compared to other state-of-the-art methods from the literature, both on random and real-world networks.
What Exactly is Antimatter (Gravitationally Speaking)?

There has been renewed interest in the idea of antigravity -- that matter and antimatter repel gravitationally - in lieu of the recent beautiful ALPHA-g result for the free-fall acceleration of antihydrogen of $a_{\bar{H}}=(0.75\pm 0.13~({\rm stat.+syst.})\pm 0.16~({\rm simulation}))g$. Precision tests of the Weak Equivalence Principle (WEP) have shown that binding energy (atomic, nuclear, and nucleonic) acts like matter under gravity. Whereas the contribution of atomic binding energy to the mass of antihydrogen is negligible, the majority of the mass of the antiproton comes from the gluonic binding energy. Hence, in terms of antigravity, the antiproton is mostly composed of matter and so even if the antimatter content of the antiproton is repelled by the Earth, there would still be a net attraction of the antihydrogen to the Earth because of its dominant matter content. Using recent Lattice QCD results showing that around two-thirds of the mass of the proton (and, hence, from the $CPT$ Invariance of QCD, of the antiproton) is due to gluons, I find that in the antigravity scenario the free-fall acceleration of antihydrogen would be $a_{\bar{H}}=(0.33^{+0.10}_{-0.06})g$. The fact that antinucleons are more matter than antimatter (in the gravitational sense) leads to quite different cosmological consequences than the naive antigravity scenario (where antistars are wholly antimatter). For example, it follows naturally that there is a matter-antimatter asymmetry in the universe right from the instant of the Big Bang -- but not a baryon-antibaryon asymmetry. Again, this stems simply from the fact that antibaryons are more matter than antimatter.
Initialization-Free Lie-Bracket Extremum Seeking in $\mathbb{R}^n$

Stability results for extremum seeking control in $\mathbb{R}^n$ have predominantly been restricted to local or, at best, semi-global practical stability. Extending semi-global stability results of extremum-seeking systems to unbounded sets of initial conditions often demands a stringent global Lipschitz condition on the cost function, which is rarely satisfied by practical applications. In this paper, we address this challenge by leveraging tools from higher-order averaging theory. In particular, we establish a novel second-order averaging result with \emph{global} (practical) stability implications. By leveraging this result, we characterize sufficient conditions on cost functions under which uniform global practical asymptotic stability can be established for a class of extremum-seeking systems acting on static maps. Our sufficient conditions include the case when the gradient of the cost function, rather than the cost function itself, satisfies a global Lipschitz condition, which covers quadratic cost functions. Our results are also applicable to vector fields that are not necessarily Lipschitz continuous at the origin, opening the door to non-smooth Lie-bracket ES dynamics. We illustrate all our results via different analytical and/or numerical examples.
RELIANCE: Reliable Ensemble Learning for Information and News Credibility Evaluation

In the era of information proliferation, discerning the credibility of news content poses an ever-growing challenge. This paper introduces RELIANCE, a pioneering ensemble learning system designed for robust information and fake news credibility evaluation. Comprising five diverse base models, including Support Vector Machine (SVM), naïve Bayes, logistic regression, random forest, and Bidirectional Long Short Term Memory Networks (BiLSTMs), RELIANCE employs an innovative approach to integrate their strengths, harnessing the collective intelligence of the ensemble for enhanced accuracy. Experiments demonstrate the superiority of RELIANCE over individual models, indicating its efficacy in distinguishing between credible and non-credible information sources. RELIANCE, also surpasses baseline models in information and news credibility assessment, establishing itself as an effective solution for evaluating the reliability of information sources.
Single-photon-assisted two-photon polymerization

Light-based additive manufacturing (AM) has revolutionized the fabrication of complex three-dimensional (3D) objects offering a cost-effective and high-speed alternative to traditional machining. One-photon polymerization is a key process in this advancement, standing out for rapid printing time, albeit with limited resolution. Two-photon polymerization (2PP) empowers AM with unprecedented resolution but is accompanied by a tradeoff of prolonged printing times. We propose combining the single-photon absorption (1PA) and 2PP to benefit from the dual capabilities, allowing for faster printing while maintaining high resolution and improved depth sectioning, respectively. In this study, we employ a blue light source to pre-excite a photocurable resin by 1PA followed by a precisely focused femtosecond (fs) beam to provide the missing energy necessary to reach the polymerization threshold to solidify the resin through two-photon absorption. First, we investigate the impact of pre-sensitization by blue light illumination on 2PP and demonstrate one order of magnitude faster printing time for a voxel size of 150 nm as compared to the same voxel size printed by 2PP only. Then, we build a custom 2PP printer utilizing blue light sensitization in a light-sheet mode and demonstrate successful 3D prints.
Fast degree-preserving rewiring of complex networks

In this paper we introduce a new fast degree-preserving network rewiring algorithm. Commonly used existing algorithms require a large number of iterations, in particular in the case of large dense networks. This can especially be problematic when we wish to study ensembles of networks. In this paper we focus on degree assortative rewiring, and overcome aforementioned scalability problems by performing a rewiring of all edges at once to achieve a very high assorativity value before rewiring samples of edges at once to reduce this high assortativity value to the target value. The proposed method performs better than existing methods by several orders of magnitude for a range of structurally diverse complex networks, both in terms of the number of iterations taken, and time taken to reach a given assortativity value. Here we test networks up to $\approx 4,000$ nodes and $\approx 88,000$ edges and find that the relative improvements in speed remain.
Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms

This paper addresses second-order stochastic optimization for estimating the minimizer of a convex function written as an expectation. A direct recursive estimation technique for the inverse Hessian matrix using a Robbins-Monro procedure is introduced. This approach enables to drastically reduces computational complexity. Above all, it allows to develop universal stochastic Newton methods and investigate the asymptotic efficiency of the proposed approach. This work so expands the application scope of secondorder algorithms in stochastic optimization.
Considerations on Approaches and Metrics in Automated Theorem Generation/Finding in Geometry

The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended). The automatic discovery of new theorems is a goal in itself, and it has been addressed in specific areas, with different methods. The separation of the"weeds", uninteresting, trivial facts, from the"wheat", new and interesting facts, is much harder, but is also being addressed by different authors using different approaches. In this paper we will focus on geometry. We present and discuss different approaches for the automatic discovery of geometric theorems (and properties), and different metrics to find the interesting theorems among all those that were generated. After this description we will introduce the first result of this article: an undecidability result proving that having an algorithmic procedure that decides for every possible Turing Machine that produces theorems, whether it is able to produce also interesting theorems, is an undecidable problem. Consequently, we will argue that judging whether a theorem prover is able to produce interesting theorems remains a non deterministic task, at best a task to be addressed by program based in an algorithm guided by heuristics criteria. Therefore, as a human, to satisfy this task two things are necessary: an expert survey that sheds light on what a theorem prover/finder of interesting geometric theorems is, and - to enable this analysis - other surveys that clarify metrics and approaches related to the interestingness of geometric theorems. In the conclusion of this article we will introduce the structure of two of these surveys - the second result of this article - and we will discuss some future work.
Forecasting Cryptocurrency Staking Rewards

This research explores a relatively unexplored area of predicting cryptocurrency staking rewards, offering potential insights to researchers and investors. We investigate two predictive methodologies: a) a straightforward sliding-window average, and b) linear regression models predicated on historical data. The findings reveal that ETH staking rewards can be forecasted with an RMSE within 0.7% and 1.1% of the mean value for 1-day and 7-day look-aheads respectively, using a 7-day sliding-window average approach. Additionally, we discern diverse prediction accuracies across various cryptocurrencies, including SOL, XTZ, ATOM, and MATIC. Linear regression is identified as superior to the moving-window average for perdicting in the short term for XTZ and ATOM. The results underscore the generally stable and predictable nature of staking rewards for most assets, with MATIC presenting a noteworthy exception.
Extremely strong spin-orbit coupling effect in light element altermagnetic materials

Spin-orbit coupling is a key to realize many novel physical effects in condensed matter physics, but the mechanism to achieve strong spin-orbit coupling effect in light element antiferromagnetic compounds has not been explored. In this work, based on symmetry analysis and the first-principles electronic structure calculations, we demonstrate that strong spin-orbit coupling effect can be realized in light element altermagnetic materials, and propose a mechanism for realizing the corresponding effective spin-orbit coupling. This mechanism reveals the cooperative effect of crystal symmetry, electron occupation, electronegativity, electron correlation, and intrinsic spin-orbit coupling. Our work not only promotes the understanding of light element compounds with strong spin-orbit coupling effect, but also provides an alternative for realizing light element compounds with an effective strong spin-orbit coupling.
Third-Party Developers and Tool Development For Community Management on Live Streaming Platform Twitch

Community management is critical for stakeholders to collaboratively build and sustain communities with socio-technical support. However, most of the existing research has mainly focused on the community members and the platform, with little attention given to the developers who act as intermediaries between the platform and community members and develop tools to support community management. This study focuses on third-party developers (TPDs) for the live streaming platform Twitch and explores their tool development practices. Using a mixed method with in-depth qualitative analysis, we found that TPDs maintain complex relationships with different stakeholders (streamers, viewers, platform, professional developers), and the multi-layered policy restricts their agency regarding idea innovation and tool development. We argue that HCI research should shift its focus from tool users to tool developers with regard to community management. We propose designs to support closer collaboration between TPDS and the platform and professional developers and streamline TPDs' development process with unified toolkits and policy documentation.
Meta-PINN: Meta learning for improved neural network wavefield solutions

Physics-informed neural networks (PINNs) provide a flexible and effective alternative for estimating seismic wavefield solutions due to their typical mesh-free and unsupervised features. However, their accuracy and training cost restrict their applicability. To address these issues, we propose a novel initialization for PINNs based on meta learning to enhance their performance. In our framework, we first utilize meta learning to train a common network initialization for a distribution of medium parameters (i.e. velocity models). This phase employs a unique training data container, comprising a support set and a query set. We use a dual-loop approach, optimizing network parameters through a bidirectional gradient update from the support set to the query set. Following this, we use the meta-trained PINN model as the initial model for a regular PINN training for a new velocity model in which the optimization of the network is jointly constrained by the physical and regularization losses. Numerical results demonstrate that, compared to the vanilla PINN with random initialization, our method achieves a much fast convergence speed, and also, obtains a significant improvement in the results accuracy. Meanwhile, we showcase that our method can be integrated with existing optimal techniques to further enhance its performance.
On the impact of robot personalization on human-robot interaction: A review

This study reviews the impact of personalization on human-robot interaction. Firstly, the various strategies used to achieve personalization are briefly described. Secondly, the effects of personalization known to date are discussed. They are presented along with the personalized parameters, personalized features, used technology, and use case they relate to. It is observed that various positive effects have been discussed in the literature while possible negative effects seem to require further investigation.
A Deep Learning Approach for Selective Relevance Feedback

Pseudo-relevance feedback (PRF) can enhance average retrieval effectiveness over a sufficiently large number of queries. However, PRF often introduces a drift into the original information need, thus hurting the retrieval effectiveness of several queries. While a selective application of PRF can potentially alleviate this issue, previous approaches have largely relied on unsupervised or feature-based learning to determine whether a query should be expanded. In contrast, we revisit the problem of selective PRF from a deep learning perspective, presenting a model that is entirely data-driven and trained in an end-to-end manner. The proposed model leverages a transformer-based bi-encoder architecture. Additionally, to further improve retrieval effectiveness with this selective PRF approach, we make use of the model's confidence estimates to combine the information from the original and expanded queries. In our experiments, we apply this selective feedback on a number of different combinations of ranking and feedback models, and show that our proposed approach consistently improves retrieval effectiveness for both sparse and dense ranking models, with the feedback models being either sparse, dense or generative.