Miracle-dz/UniFAR-FTUs huggingface dataset:
Silences, spikes and bursts: Three‐part knot of the neural code

When a neuron breaks silence, it can emit action potentials in a number of patterns. Some responses are so sudden and intense that electrophysiologists felt the need to single them out, labelling action potentials emitted at a particularly high frequency with a metonym – bursts. Is there more to bursts than a figure of speech? After all, sudden bouts of high‐frequency firing are expected to occur whenever inputs surge. The burst coding hypothesis advances that the neural code has three syllables: silences, spikes and bursts. We review evidence supporting this ternary code in terms of devoted mechanisms for burst generation, synaptic transmission and synaptic plasticity. We also review the learning and attention theories for which such a triad is beneficial.
Detection-Recovery Gap for Planted Dense Cycles

Planted dense cycles are a type of latent structure that appears in many applications, such as small-world networks in social sciences and sequence assembly in computational biology. We consider a model where a dense cycle with expected bandwidth $n \tau$ and edge density $p$ is planted in an Erd\H{o}s-R\'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree polynomial algorithms. In particular, a gap exists between the two thresholds in a certain regime of parameters. For example, if $n^{-3/4} \ll \tau \ll n^{-1/2}$ and $p = C q = \Theta(1)$ for a constant $C>1$, the detection problem is computationally easy while the recovery problem is hard for low-degree algorithms.
Sequential Estimation of Multivariate Factor Stochastic Volatility Models

We provide a simple method to estimate the parameters of multivariate stochastic volatility models with latent factor structures. These models are very useful as they alleviate the standard curse of dimensionality, allowing the number of parameters to increase only linearly with the number of the return series. Although theoretically very appealing, these models have only found limited practical application due to huge computational burdens. Our estimation method is simple in implementation as it consists of two steps: first, we estimate the loadings and the unconditional variances by maximum likelihood, and then we use the efficient method of moments to estimate the parameters of the stochastic volatility structure with GARCH as an auxiliary model. In a comprehensive Monte Carlo study we show the good performance of our method to estimate the parameters of interest accurately. The simulation study and an application to real vectors of daily returns of dimensions up to 148 show the method's computation advantage over the existing estimation procedures.
Dynamical-Microphysical Evolution of a Convective Storm in a Weakly-Sheared Environment. Part I: Microphysical Observations and Interpretation

Abstract Aircraft measurements of microphysical thermodynamic, and vertical air motion properties supplemented by radar measurements of reflectivity structure are used to investigate precipitation development throughout much of the life cycle of a moderately intense convective storm in northeast Colorado. There was considerable variability of cloud properties such as updraft speed at scales of a few hundred meters early in the life of the storm. Greater organization was evident in the later, more mature stage. The earliest radar return from a major cell came from particles larger than 1 mm diameter in concentrations less than 10 m−3. It is suggested that these particles must have already followed complicated growth trajectories even at this early stage of the storm, including more than one ascent in updraft. In the more mature stage of the storm millimetric water drops and partially melted and refreezing ice particles were observed at 1 to 2 km above cloud base in both mixed and unmixed regions of the mai.
Lightsolver challenges a leading deep learning solver for Max-2-SAT problems

Maximum 2-satisfiability (MAX-2-SAT) is a type of combinatorial decision problem that is known to be NP-hard. In this paper, we compare LightSolver's quantum-inspired algorithm to a leading deep-learning solver for the MAX-2-SAT problem. Experiments on benchmark data sets show that LightSolver achieves significantly smaller time-to-optimal-solution compared to a state-of-the-art deep-learning algorithm, where the gain in performance tends to increase with the problem size.
An Innovative Method for Measuring Instrument Data Acquisition using Image Processing Techniques

Measuring instruments are vital for obtaining accurate data in various fields, including scientific research, engineering, and manufacturing. However, data acquisition can be challenging, particularly when direct cable connections are not feasible or difficult to establish. In this paper, we propose a novel method for measuring instrument data acquisition utilizing a camera to capture the instrument display and image processing techniques to extract the measured values. Our method combines computer vision and machine learning techniques to recognize and extract numerical values from the instrument display. We demonstrate the effectiveness and accuracy of this approach by applying it to capture the magnetic field of a permanent magnet using a gauss meter and webcam. Our results indicate that the proposed method offers a practical and accurate solution for data acquisition in cases where direct cable connections are not possible. This method has potential applications in scientific research, engineering, and manufacturing industries.
DiffFaceSketch: High-Fidelity Face Image Synthesis with Sketch-Guided Latent Diffusion Model

Synthesizing face images from monochrome sketches is one of the most fundamental tasks in the field of image-to-image translation. However, it is still challenging to (1)~make models learn the high-dimensional face features such as geometry and color, and (2)~take into account the characteristics of input sketches. Existing methods often use sketches as indirect inputs (or as auxiliary inputs) to guide the models, resulting in the loss of sketch features or the alteration of geometry information. In this paper, we introduce a Sketch-Guided Latent Diffusion Model (SGLDM), an LDM-based network architect trained on the paired sketch-face dataset. We apply a Multi-Auto-Encoder (AE) to encode the different input sketches from different regions of a face from pixel space to a feature map in latent space, which enables us to reduce the dimension of the sketch input while preserving the geometry-related information of local face details. We build a sketch-face paired dataset based on the existing method that extracts the edge map from an image. We then introduce a Stochastic Region Abstraction (SRA), an approach to augment our dataset to improve the robustness of SGLDM to handle sketch input with arbitrary abstraction. The evaluation study shows that SGLDM can synthesize high-quality face images with different expressions, facial accessories, and hairstyles from various sketches with different abstraction levels.
Accelerated Fuzzy C-Means Clustering Based on New Affinity Filtering and Membership Scaling

Fuzzy C-Means (FCM) is a widely used clustering method. However, FCM and its many accelerated variants have low efficiency in the mid-to-late stage of the clustering process. In this stage, all samples are involved in updating their non-affinity centers, and the membership grades of most samples, whose assignments remain unchanged, are still updated by calculating the sample-center distances. All these factors lead to the algorithms converging slowly. In this paper, a new affinity filtering technique is developed to recognize a complete set of non-affinity centers for each sample with low computations. Then, a new membership scaling technique is suggested to set the membership grades between each sample and its non-affinity centers to 0 and maintain the fuzzy membership grades for others. By integrating these two techniques, FCM based on new affinity filtering and membership scaling (AMFCM) is proposed to accelerate the whole convergence process of FCM. Numerous experimental results performed on synthetic and real-world data sets have shown the feasibility and efficiency of the proposed algorithm. Compared with state-of-the-art algorithms, AMFCM is significantly faster and more effective. For example, AMFCM reduces the number of FCM iterations by 80<inline-formula><tex-math notation="LaTeX">$\%$</tex-math><alternatives><mml:math><mml:mo>%</mml:mo></mml:math><inline-graphic xlink:href="zhou-ieq1-3273274.gif"/></alternatives></inline-formula> on average.
Laplacian Coarse Graining in Complex Networks

Complex networks can model a range of different systems, from the human brain to social connections. Some of those networks have a large number of nodes and links, making it impractical to analyze them directly. One strategy to simplify these systems is by creating miniaturized versions of the networks that keep their main properties. A convenient tool that applies that strategy is the renormalization group (RG), a methodology used in statistical physics to change the scales of physical systems. This method consists of two steps: a coarse grain, where one reduces the size of the system, and a rescaling of the interactions to compensate for the information loss. This work applies RG to complex networks by introducing a coarse-graining method based on the Laplacian matrix. We use a field-theoretical approach to calculate the correlation function and coarse-grain the most correlated nodes into super-nodes, applying our method to several artificial and real-world networks. The results are promising, with most of the networks under analysis showing self-similar properties across different scales.
Deep Non-Monotonic Reasoning for Visual Abstract Reasoning Tasks

While achieving unmatched performance on many well-defined tasks, deep learning models have also been used to solve visual abstract reasoning tasks, which are relatively less well-defined, and have been widely used to measure human intelligence. However, current deep models struggle to match human abilities to solve such tasks with minimum data but maximum generalization. One limitation is that current deep learning models work in a monotonic way, i.e., treating different parts of the input in essentially fixed orderings, whereas people repeatedly observe and reason about the different parts of the visual stimuli until the reasoning process converges to a consistent conclusion, i.e., non-monotonic reasoning. This paper proposes a non-monotonic computational approach to solve visual abstract reasoning tasks. In particular, we implemented a deep learning model using this approach and tested it on the RAVEN dataset -- a dataset inspired by the Raven's Progressive Matrices test. Results show that the proposed approach is more effective than existing monotonic deep learning models, under strict experimental settings that represent a difficult variant of the RAVEN dataset problem.
Compressibility-Aware Quantum Algorithms on Strings

Sublinear time quantum algorithms have been established for many fundamental problems on strings. This work demonstrates that new, faster quantum algorithms can be designed when the string is highly compressible. We focus on two popular and theoretically significant compression algorithms -- the Lempel-Ziv77 algorithm (LZ77) and the Run-length-encoded Burrows-Wheeler Transform (RL-BWT), and obtain the results below. We first provide a quantum algorithm running in $\tilde{O}(\sqrt{zn})$ time for finding the LZ77 factorization of an input string $T[1.n]$ with $z$ factors. Combined with multiple existing results, this yields an $\tilde{O}(\sqrt{rn})$ time quantum algorithm for finding the RL-BWT encoding with $r$ BWT runs. Note that $r = \tilde{\Theta}(z)$. We complement these results with lower bounds proving that our algorithms are optimal (up to polylog factors). Next, we study the problem of compressed indexing, where we provide a $\tilde{O}(\sqrt{rn})$ time quantum algorithm for constructing a recently designed $\tilde{O}(r)$ space structure with equivalent capabilities as the suffix tree. This data structure is then applied to numerous problems to obtain sublinear time quantum algorithms when the input is highly compressible. For example, we show that the longest common substring of two strings of total length $n$ can be computed in $\tilde{O}(\sqrt{zn})$ time, where $z$ is the number of factors in the LZ77 factorization of their concatenation. This beats the best known $\tilde{O}(n^\frac{2}{3})$ time quantum algorithm when $z$ is sufficiently small.
On solving the MAX-SAT using sum of squares

We consider semidefinite programming (SDP) approaches for solving the maximum satisfiability problem (MAX-SAT) and the weighted partial MAX-SAT. It is widely known that SDP is well-suited to approximate the (MAX-)2-SAT. Our work shows the potential of SDP also for other satisfiability problems, by being competitive with some of the best solvers in the yearly MAX-SAT competition. Our solver combines sum of squares (SOS) based SDP bounds and an efficient parser within a branch&bound scheme. On the theoretical side, we propose a family of semidefinite feasibility problems, and show that a member of this family provides the rank two guarantee. We also provide a parametric family of semidefinite relaxations for the MAX-SAT, and derive several properties of monomial bases used in the SOS approach. We connect two well-known SDP approaches for the (MAX)-SAT, in an elegant way. Moreover, we relate our SOS-SDP relaxations for the partial MAX-SAT to the known SAT relaxations.
Relaxed blue ellipticals: accretion-driven stellar growth is a key evolutionary channel for low mass elliptical galaxies

How elliptical galaxies form is a key question in observational cosmology. While the formation of massive ellipticals is strongly linked to mergers, the low mass (Mstar<10^9.5 MSun) regime remains less well explored. In particular, studying elliptical populations when they are blue, and therefore rapidly building stellar mass, offers strong constraints on their formation. Here, we study 108 blue, low-mass ellipticals (which have a median stellar mass of 10^8.7 MSun) at z<0.3 in the COSMOS field. Visual inspection of extremely deep optical HSC images indicates that less than 3 per cent of these systems have visible tidal features, a factor of 2 less than the incidence of tidal features in a control sample of galaxies with the same distribution of stellar mass and redshift. This suggests that the star formation activity in these objects is not driven by mergers or interactions but by secular gas accretion. We combine accurate physical parameters from the COSMOS2020 catalog, with measurements of local density and the locations of galaxies in the cosmic web, to show that our blue ellipticals reside in low-density environments, further away from nodes and large-scale filaments than other galaxies. At similar stellar masses and environments, blue ellipticals outnumber their normal (red) counterparts by a factor of 2. Thus, these systems are likely progenitors of not only normal ellipticals at similar stellar mass but, given their high star formation rates, also of ellipticals at higher stellar masses. Secular gas accretion, therefore, likely plays a significant (and possibly dominant) role in the stellar assembly of elliptical galaxies in the low mass regime.
Dissecting Bitcoin and Ethereum Transactions: On the Lack of Transaction Contention and Prioritization Transparency in Blockchains

In permissionless blockchains, transaction issuers include a fee to incentivize miners to include their transactions. To accurately estimate this prioritization fee for a transaction, transaction issuers (or blockchain participants, more generally) rely on two fundamental notions of transparency, namely contention and prioritization transparency. Contention transparency implies that participants are aware of every pending transaction that will contend with a given transaction for inclusion. Prioritization transparency states that the participants are aware of the transaction or prioritization fees paid by every such contending transaction. Neither of these notions of transparency holds well today. Private relay networks, for instance, allow users to send transactions privately to miners. Besides, users can offer fees to miners via either direct transfers to miners' wallets or off-chain payments -- neither of which are public. In this work, we characterize the lack of contention and prioritization transparency in Bitcoin and Ethereum resulting from such practices. We show that private relay networks are widely used and private transactions are quite prevalent. We show that the lack of transparency facilitates miners to collude and overcharge users who may use these private relay networks despite them offering little to no guarantees on transaction prioritization. The lack of these transparencies in blockchains has crucial implications for transaction issuers as well as the stability of blockchains. Finally, we make our data sets and scripts publicly available.
Painting 3D Nature in 2D: View Synthesis of Natural Scenes from a Single Semantic Mask

We introduce a novel approach that takes a single semantic mask as input to synthesize multi-view consistent color images of natural scenes, trained with a collection of single images from the Internet. Prior works on 3D-aware image synthesis either require multi-view supervision or learning category-level prior for specific classes of objects, which are inapplicable to natural scenes. Our key idea to solve this challenge is to use a semantic field as the intermediate representation, which is easier to reconstruct from an input semantic mask and then translated to a radiance field with the assistance of off-the-shelf semantic image synthesis models. Experiments show that our method outperforms baseline methods and produces photorealistic and multi-view consistent videos of a variety of natural scenes. The project website is https://zju3dv.github. io/paintingnature/.
Detection of ridges and ravines on range images and triangular meshes

Surface creases, ridges and ravines, provide us with important information about the shapes of 3D objects and can be intuitively defined as curves on a surface along which the surface bends sharply. Our mathematical description of the ridges and ravines is based on the study of sharp variation points of the surface normals or equivalently, extrema of the principal curvatures along their curvature lines. We explore similarity between image intensity edges (sharp variation points of an image intensity) and curvature extrema of a 3D surface. It allows us to adopt a basic edge detection technique for detection of the ridges and ravines on range images and smooth surfaces approximated by polygonal meshes. Because the ridges and ravines are of high-order differential nature, careful smoothing is required in order to achieve stable detection of perceptually salient ridges and ravines. To detect the ridges and ravines on a range image we use a nonlinear diffusion process acting on the image intensity surface normals. To detect the ridges and ravines on a triangular mesh we use a coupled nonlinear diffusion of mesh normals and vertices. We demonstrate feasibility of the ridges and ravines for segmentation and shape recognition purposes.
Evidence of Early Supershear Transition in the Mw 7.8 Kahramanmara\c{s} Earthquake From Near-Field Records

The Mw 7.8 Kahramanmara\c{s} Earthquake was larger and more destructive than what had been expected for the tectonic setting in Southeastern Turkey. By using near-field records we provide evidence for early supershear transition on the splay fault that hosted the nucleation and early propagation of the first rupture that eventually transitioned into the East Anatolian fault. The two stations located furthest from the epicenter show a larger fault parallel particle velocity component relative to the fault normal particle velocity component; a unique signature of supershear ruptures that has been identified in theoretical and experimental models of intersonic rupture growth. The third station located closest to the epicenter, while mostly preserving the classical sub-Rayleigh characteristics, it also features a small supershear pulse clearly propagating ahead of the original sub-Rayleigh rupture. This record provides, for the first time ever, field observational evidence for the mechanism of intersonic transition. By using the two furthest stations we estimate the instantaneous supershear rupture propagation speed to be ~ 1.55 Cs and the sub-Rayleigh to supershear transition length to be around 19.45 km, very close to the location of the station nearest to the epicenter. This early supershear transition might have facilitated the continued propagation and triggering of slip on the nearby East Anatolian Fault leading to amplification of the hazard. The complex dynamics of the Kahramanmara\c{s} earthquake warrants further studies.
A rate of convergence when generating stable invariant Hermitian random matrix ensembles

Recently, we have classified Hermitian random matrix ensembles that are invariant under the conjugate action of the unitary group and stable with respect to matrix addition. Apart from a scaling and a shift, the whole information of such an ensemble is encoded in the stability exponent determining the ``heaviness'' of the tail and the spectral measure that describes the anisotropy of the probability distribution. In the present work, we address the question how these ensembles can be generated by the knowledge of the latter two quantities. We consider a sum of a specific construction of identically and independently distributed random matrices that are based on Haar distributed unitary matrices and a stable random vectors. For this construction, we derive the rate of convergence in the supremums norm and show that this rate is optimal in the class of all stable invariant random matrices for a fixed stability exponent. As a consequence we also give the rate of convergence in the total variation distance.
Differential privacy diffusion auction of homogeneous items

Diffusion auction refers to an emerging paradigm of online marketplace where an auctioneer utilises a social network to attract potential buyers. Diffusion auction poses signiﬁcant privacy risks. From the auction outcome, it is possible to infer hidden, and potentially sensitive, preferences of buyers. To mitigate such risks, we initiate the study of differential privacy (DP) in diffusion auction mechanisms. DP is a well-established notion of privacy that protects a system against inference attacks. Achieving DP in diffusion auctions is non-trivial as the well-designed auction rules are required to incentivise the buyers to truthfully report their neighbourhood. We study the single-unit case and design two differentially private diffusion mechanisms (DPDMs): recursive DPDM and layered DPDM. We prove that these mechanisms guarantee differential privacy, incentive compatibility and individual rationality for both valuations and neighbourhood. We then empirically compare their performance on real and synthetic datasets.
Teleportation-Based Error Correction Protocol of Time–Frequency Qubit States

We present a linear optical protocol for teleporting and correcting both temporal and frequency errors in two time–frequency qubit states. The first state is the frequency (or time-of-arrival) cat qubit, which is a single photon in a superposition of two frequencies (or time-of-arrival), while the second is the time–frequency Gottesman–Kitaev–Preskill (GKP) state, which is a single photon with a frequency comb structure. The proposed optical scheme could be valuable for reducing the error rate in quantum communication protocols involving one of these qubits.