Miracle-dz/UniFAR-FTUs huggingface dataset:
A Stochastic Theory of the Hierarchical Clustering. II. Halo Progenitor Mass Function and Large-scale Bias

We generalize the stochastic theory of hierarchical clustering presented in Paper I by Lapi & Danese to derive the (conditional) halo progenitor mass function and the related large-scale bias. Specifically, we present a stochastic differential equation that describes fluctuations in the mass growth of progenitor halos of given descendant mass and redshift, as driven by a multiplicative Gaussian white noise involving the power spectrum and the spherical collapse threshold of density perturbations. We demonstrate that, as cosmic time passes, the noise yields an average drift of the progenitors toward larger masses, which quantitatively renders the expectation from the standard extended Press and Schechter (EPS) theory. We solve the Fokker–Planck equation associated with the stochastic dynamics, and obtain as an exact, stationary solution, the EPS progenitor mass function. Then we introduce a modification of the stochastic equation in terms of a mass-dependent collapse threshold modulating the noise, and solve analytically the associated Fokker–Planck equation for the progenitor mass function. The latter is found to be in excellent agreement with the outcomes of N-body simulations; even more remarkably, this is achieved with the same shape of the collapse threshold used in Paper I to reproduce the halo mass function. Finally, we exploit the above results to compute the large-scale halo bias, and find it in pleasing agreement with the N-body outcomes. All in all, the present paper illustrates that the stochastic theory of hierarchical clustering introduced in Paper I can describe effectively not only halos’ abundance, but also their progenitor distribution and their correlation with the large-scale environment across cosmic times.
Computational Impact Time Guidance: A Learning-Based Prediction-Correction Approach

—This paper investigates the problem of impact-time-control and proposes a learning-based computational guidance al-gorithm to solve this problem. The proposed guidance algorithm is developed based on a general prediction-correction concept: the exact time-to-go under proportional navigation guidance with realistic aerodynamic characteristics is estimated by a deep neural network and a biased command to nullify the impact time error is developed by utilizing the emerging reinforcement learning techniques. The deep neural network is augmented into the reinforcement learning block to resolve the issue of sparse reward that has been observed in typical reinforcement learning formulation. Extensive numerical simulations are conducted to support the proposed algorithm.
Instance and Pair-Aware Dynamic Networks for Re-Identification

Re-identification (ReID) is to identify the same instance across different cameras. Existing ReID methods mostly utilize alignment-based or attention-based strategies to generate effective feature representations. However, most of these methods only extract general feature by employing single input image itself, overlooking the exploration of relevance between comparing images. To fill this gap, we propose a novel end-to-end trainable dynamic convolution framework named Instance and Pair-Aware Dynamic Networks in this paper. The proposed model is composed of three main branches where a self-guided dynamic branch is constructed to strengthen instance-specific features, focusing on every single image. Furthermore, we also design a mutual-guided dynamic branch to generate pair-aware features for each pair of images to be compared. Extensive experiments are conducted in order to verify the effectiveness of our proposed algorithm. We evaluate our algorithm in several mainstream person and vehicle ReID datasets including CUHK03, DukeMTMCreID, Market-1501, VeRi776 and VehicleID. In some datasets our algorithm outperforms state-of-the-art methods and in others, our algorithm achieves a comparable performance.
A prior-based approximate latent Riemannian metric

Stochastic generative models enable us to capture the geometric structure of a data manifold lying in a high dimensional space through a Riemannian metric in the latent space. However, its practical use is rather limited mainly due to inevitable complexity. In this work we propose a surrogate conformal Riemannian metric in the latent space of a generative model that is simple, efficient and robust. This metric is based on a learnable prior that we propose to learn using a basic energy-based model. We theoretically analyze the behavior of the proposed metric and show that it is sensible to use in practice. We demonstrate experimentally the efficiency and robustness, as well as the behavior of the new approximate metric. Also, we show the applicability of the proposed methodology for data analysis in the life sciences.
Energy-Efficient MAC for Cellular IoT: State-of-the-Art, Challenges, and Standardization

In the modern world, the connectivity-as-we-go model is gaining popularity. Internet-of-Things (IoT) envisions a future in which human beings communicate with each other and with devices that have identities and virtual personalities, as well as sensing, processing, and networking capabilities, which will allow the developing of smart environments that operate with little or no human intervention. In such IoT environments, that will have battery-operated sensors and devices, energy efficiency becomes a fundamental concern. Thus, energy-efficient (EE) connectivity is gaining significant attention from the industrial and academic communities. This work aims to provide a comprehensive state-of-the-art survey on the energy efficiency of medium access control (MAC) protocols for cellular IoT. we provide a detailed discussion on the sources of energy dissipation at the MAC layer and then propose solutions. In addition to reviewing the proposed MAC designs, we also provide insights and suggestions that can guide practitioners and researchers in designing EE MAC protocols that extend the battery life of IoT devices. Finally, we identify a range of challenging open problems that should be solved for providing EE MAC services for IoT devices, along with corresponding opportunities and future research ideas to address these challenges.
Rotation curves with the multistate Scalar Field Dark Matter model

We use the concept of co-added rotation curves of Salucci et al. to investigate the properties of axi-symmetric multistate Scalar Field Dark Matter halos in low surface brightness galaxies and dwarf disc galaxies. We fit their rotation curves in two-state configurations and we find that all of these can be well fitted with a particle mass $\mu \sim (10^{-23} - 10^{-24})\rm{eV}/c^2$. Comparing our results with the standard cosmological model, the well-known $\Lambda$-cold dark matter, by using the Bayesian information criterion and the Akaike information criterion, we found that our two-state model seemed to be preferred.
Generative Transition Mechanism to Image-to-Image Translation via Encoded Transformation

In this paper, we revisit the Image-to-Image (I2I) translation problem with transition consistency, namely the consistency defined on the conditional data mapping between each data pairs. Explicitly parameterizing each data mappings with a transition variable $t$, i.e., $x \overset{t(x,y)}{\mapsto}y$, we discover that existing I2I translation models mainly focus on maintaining consistency on results, e.g., image reconstruction or attribute prediction, named result consistency in our paper. This restricts their generalization ability to generate satisfactory results with unseen transitions in the test phase. Consequently, we propose to enforce both result consistency and transition consistency for I2I translation, to benefit the problem with a closer consistency between the input and output. To benefit the generalization ability of the translation model, we propose transition encoding to facilitate explicit regularization of these two {kinds} of consistencies on unseen transitions. We further generalize such explicitly regularized consistencies to distribution-level, thus facilitating a generalized overall consistency for I2I translation problems. With the above design, our proposed model, named Transition Encoding GAN (TEGAN), can poss superb generalization ability to generate realistic and semantically consistent translation results with unseen transitions in the test phase. It also provides a unified understanding of the existing GAN-based I2I transition models with our explicitly modeling of the data mapping, i.e., transition. Experiments on four different I2I translation tasks demonstrate the efficacy and generality of TEGAN.
Optical Recording Properties of Styryl Derivatives for Digital Versatile Disc-Recordable (DVD-R)

Abstract New styryl dyes for the recording layer of digital versatile disc-recordable (DVD-R) were synthesized and analyzed by UV-vis spectroscopy and thermal analyzer. Using these dyes, we prepared two-type DVD-R discs, with/without metallic thin film between substrate and organic buffer layer. The metal-polymer deformation 4.7 GB DVD-R discs were recorded by high-power 658nm-wavelength laser diode and their recording characteristics were evaluated at 650nm wavelength. The optimum writing power and jitter value was in the range of 10 mW and 12∽13 %, respectively.
A Cascaded Multi-IRSs Beamforming Method in mmWave Communication Systems

In this paper, we study how to jointly design the phase shift of cascaded multi-IRSs and the precoding vector of the BS to improve the coverage in dense urban areas. We aim to maximize the signal-to-noise ratio (SNR) of the user equipment (UE) received signal by employing this method. However, it is a constrained non-convex optimization problem and is NP-hard. In order to solve this problem, we simplify it by utilizing the characteristic of the mmWave wireless system to decompose the optimization problem into multiple sub-optimization problems. By employing the asymptotic orthogonality of wireless channel in mmWave system to solve the sub-optimization problems, we finally yield a closed-form sub-optimal solution. The simulation results verify that our solution can effectively improve the coverage of deep dense urban areas.
High-current CNT films grown directly on commercially available 2.5D substrates for low-voltage field-emission electron sources

Carbon nanotube (CNT) based electronic devices are promising for beyond-silicon solid-state electronics and vacuum micro-nano-electronics. Despite rapid progress in CNT field-effect transistor related solid-state electronics, the development of CNT-based vacuum nanoelectronic devices is substantially blocked by the longstanding challenges in demanding high-current field-emission (FE) electron sources at low operating voltage. In addition to CNTs’ properties, FE characteristics are also affected by substrate morphology and interface state. This work demonstrates high-current FE characteristics at relatively low operating voltage by using CNT films grown directly on commercially available 2.5D substrates with matched feature size and improved interface contact. Simulation results indicate that the commercially available 2.5D substrate including nickel foam (NiF) and carbon cloth (CC) with appropriate feature size would dramatically help to enhance emission current at a relatively lower voltage. Modified fabrication process results in improved contact between CNTs and the underlying 2.5D substrates. Twenty times higher emission current density with halved lower turn-on electric field achieved by CNTs grown directly on randomly picked NiF shows the potential of 2.5D substrate with good contact in improving FE characteristics. Finally, a high emission current (6 mA) with approximately 75% decrease in turn-on electric field was realized by matching the feature size of 2.5D substrate with that of CNTs, bringing us significantly closer to reliable high-current and low-voltage FE electron sources for practical applications.
Advances in Inference and Representation for Simultaneous Localization and Mapping

Simultaneous localization and mapping (SLAM) is the process of constructing a global model of an environment from local observations of it; this is a foundational capability for mobile robots, supporting such core functions as planning, navigation, and control. This article reviews recent progress in SLAM, focusing on advances in the expressive capacity of the environmental models used in SLAM systems (representation) and the performance of the algorithms used to estimate these models from data (inference). A prominent theme of recent SLAM research is the pursuit of environmental representations (including learned representations) that go beyond the classical attributes of geometry and appearance to model properties such as hierarchical organization, affordance, dynamics, and semantics; these advances equip autonomous agents with a more comprehensive understanding of the world, enabling more versatile and intelligent operation. A second major theme is a revitalized interest in the mathematical properties of the SLAM estimation problem itself (including its computational and information-theoretic performance limits); this work has led to the development of novel classes of certifiable and robust inference methods that dramatically improve the reliability of SLAM systems in real-world operation. We survey these advances with an emphasis on their ramifications for achieving robust, long-duration autonomy, and conclude with a discussion of open challenges and a perspective on future research directions.
MetaCorrection: Domain-aware Meta Loss Correction for Unsupervised Domain Adaptation in Semantic Segmentation

Unsupervised domain adaptation (UDA) aims to transfer the knowledge from the labeled source domain to the unlabeled target domain. Existing self-training based UDA approaches assign pseudo labels for target data and treat them as ground truth labels to fully leverage unlabeled target data for model adaptation. However, the generated pseudo labels from the model optimized on the source domain inevitably contain noise due to the domain gap. To tackle this issue, we advance a MetaCorrection framework, where a Domain-aware Meta-learning strategy is devised to benefit Loss Correction (DMLC) for UDA semantic segmentation. In particular, we model the noise distribution of pseudo labels in target domain by introducing a noise transition matrix (NTM) and construct meta data set with domain-invariant source data to guide the estimation of NTM. Through the risk minimization on the meta data set, the optimized NTM thus can correct the noisy issues in pseudo labels and enhance the generalization ability of the model on the target data. Considering the capacity gap between shallow and deep features, we further employ the proposed DMLC strategy to provide matched and compatible supervision signals for different level features, thereby ensuring deep adaptation. Extensive experimental results highlight the effectiveness of our method a against existing state-of-the-art methods on three benchmarks.
No 
H0
 assistance from assisted quintessence

Early dark energy, as a proposed solution to the Hubble tension, faces an additional “why now” problem. Why should dark energy emerge just prior to recombination, billions of years before the onset of cosmic acceleration? Assisted quintessence explains this connection by positing that multiple scaling fields build up over time to drive the present-day cosmic acceleration. In this framework, early dark energy is inevitable. Yet, we show that scaling also leads to the demise of the scenario: the same feature that solves the coincidence problem then spoils a concordance of the Hubble constant inferred from the cosmic microwave background with that from the local distance ladder. The failure of the model offers a novel lesson on the ability of new physics to resolve the Hubble tension.
unzipFPGA: Enhancing FPGA-based CNN Engines with On-the-Fly Weights Generation

Single computation engines have become a popular design choice for FPGA-based convolutional neural networks (CNNs) enabling the deployment of diverse models without fabric reconfiguration. This flexibility, however, often comes with significantly reduced performance on memory-bound layers and resource underutilisation due to suboptimal mapping of certain layers on the engine’s fixed configuration. In this work, we investigate the implications in terms of CNN engine design for a class of models that introduce a pre-convolution stage to decompress the weights at run time. We refer to these approaches as on-the-fly. To minimise the negative impact of limited bandwidth on memory-bound layers, we present a novel hardware component that enables the on-chip on-the-fly generation of weights. We further introduce an input selective processing element (PE) design that balances the load between PEs on suboptimally mapped layers. Finally, we present unzipFPGA, a framework to train on-the-fly models and traverse the design space to select the highest performing CNN engine configuration. Quantitative evaluation shows that unzipFPGA yields an average speedup of 2.14× and 71% over optimised status-quo and pruned CNN engines under constrained bandwidth and up to 3.69× higher performance density over the state-of-the-art FPGA-based CNN accelerators.
Challenges for Reinforcement Learning in Healthcare

Many healthcare decisions involve navigating through a multitude of treatment options in a sequential and iterative manner to find an optimal treatment pathway with the goal of an optimal patient outcome. Such optimization problems may be amenable to reinforcement learning. A reinforcement learning agent could be trained to provide treatment recommendations for physicians, acting as a decision support tool. However, a number of difficulties arise when using RL beyond benchmark environments, such as specifying the reward function, choosing an appropriate state representation and evaluating the learned policy.
Exponential Modalities and Complementarity (extended abstract)

The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics. The paper uses a formulation of quantum systems based on dagger-linear logic, whose categorical semantics lies in mixed unitary categories, and a formulation of measurement therein. The main result exhibits a complementary system as the result of measurements on free exponential modalities. Recalling that, in linear logic, exponential modalities have two distinct but dual components, ! and ? , this shows how these components under measurement become"compacted"into the usual notion of complementary Frobenius algebras from categorical quantum mechanics.
Efficient Multi-Stage Video Denoising with Recurrent Spatio-Temporal Fusion

In recent years, denoising methods based on deep learning have achieved unparalleled performance at the cost of large computational complexity. In this work, we propose an Efficient Multi-stage Video Denoising algorithm, called EMVD, to drastically reduce the complexity while maintaining or even improving the performance. First, a fusion stage reduces the noise through a recursive combination of all past frames in the video. Then, a denoising stage removes the noise in the fused frame. Finally, a refinement stage restores the missing high frequency in the denoised frame. All stages operate on a transform-domain representation obtained by learnable and invertible linear operators which simultaneously increase accuracy and decrease complexity of the model. A single loss on the final output is sufficient for successful convergence, hence making EMVD easy to train. Experiments on real raw data demonstrate that EMVD outperforms the state of the art when complexity is constrained, and even remains competitive against methods whose complexities are several orders of magnitude higher. Further, the low complexity and memory requirements of EMVD enable real-time video denoising on commercial SoC in mobile devices.
Portfolio risk allocation through Shapley value

We argue that using the Shapley value of cooperative game theory as the scheme for risk allocation among non-orthogonal risk factors is a natural way of interpreting the contribution made by each of such factors to overall portfolio risk. We discuss a Shapley value scheme for allocating risk to non-orthogonal greeks in a portfolio of derivatives. Such a situation arises, for example, when using a stochastic volatility model to capture option volatility smile. We also show that Shapley value allows for a natural method of interpreting components of enterprise risk measures such as VaR and ES. For all applications discussed, we derive explicit formulas and/or numerical algorithms to calculate the allocations.
Application of Transfer Learning to Sign Language Recognition using an Inflated 3D Deep Convolutional Neural Network

Sign language is the primary language for people with a hearing loss. Sign language recognition (SLR) is the automatic recognition of sign language, which represents a challenging problem for computers, though some progress has been made recently using deep learning. Huge amounts of data are generally required to train deep learning models. However, corresponding datasets are missing for the majority of sign languages. Transfer learning is a technique to utilize a related task with an abundance of data available to help solve a target task lacking sufficient data. Transfer learning has been applied highly successfully in computer vision and natural language processing. However, much less research has been conducted in the field of SLR. This paper investigates how effectively transfer learning can be applied to isolated SLR using an inflated 3D convolutional neural network as the deep learning architecture. Transfer learning is implemented by pre-training a network on the American Sign Language dataset MS-ASL and subsequently fine-tuning it separately on three different sizes of the German Sign Language dataset SIGNUM. The results of the experiments give clear empirical evidence that transfer learning can be effectively applied to isolated SLR. The accuracy performances of the networks applying transfer learning increased substantially by up to 21% as compared to the baseline models that were not pre-trained on the MS-ASL dataset.
Use square root affinity to regress labels in semantic segmentation

Semantic segmentation is a basic but non-trivial task in computer vision. Many previous work focus on utilizing affinity patterns to enhance segmentation networks. Most of these studies use the affinity matrix as a kind of feature fusion weights, which is part of modules embedded in the network, such as attention models and non-local models. In this paper, we associate affinity matrix with labels, exploiting the affinity in a supervised way. Specifically, we utilize the label to generate a multi-scale label affinity matrix as a structural supervision, and we use a square root kernel to compute a non-local affinity matrix on output layers. With such two affinities, we define a novel loss called Affinity Regression loss (AR loss), which can be an auxiliary loss providing pair-wise similarity penalty. Our model is easy to train and adds little computational burden without run-time inference. Extensive experiments on NYUv2 dataset and Cityscapes dataset demonstrate that our proposed method is sufficient in promoting semantic segmentation networks.