Miracle-dz/UniFAR-FTUs huggingface dataset:
The perinucleolar compartment

The perinucleolar compartment (PNC) is a distinct nuclear body that localizes to the nucleolar periphery. The PNC is predominantly found in cancer cells, and recent evidence suggests that PNC prevalence can be a pan‐cancer marker for tumors of solid tissue origin. The PNC is a heritable structure enriched with newly transcribed pol III RNAs and RNA‐binding proteins, which exchange rapidly with the surrounding nucleoplasm. The structural integrity of the PNC is dependent upon the continuous transcription of pol III RNA and an intact DNA structure. Although the complete structure and function of the PNC remains to be resolved, much progress has been made in the characterization of the PNC in recent years. Here we summarize our current understanding of the dynamics, structure and function of the PNC. J. Cell. Biochem. 107: 189–193, 2009. © 2009 Wiley‐Liss, Inc.
Alzheimer's disease microglia

Aging is a major risk factor for multiple chronic disorders in the elderly population, including Alzheimer’s disease (AD) and Osteoporosis. AD is a progressive neurodegenerative disease characterized by memory loss. In addition to dementia, several studies have shown that AD patients experience an increased rate of musculoskeletal co-morbidities, such as osteoporosis. Since tissue-specific macrophages contribute to both diseases, this study analyzed the microglia transcriptome of AD mice to determine a common gene signature involved in osteoclast biology. After comparing differentially regulated genes from GEO data sets (GSE93824 and GSE212277), there were 35 common upregulated genes and 89 common downregulated genes. Of these common genes, seven genes are known to play an important role in bone homeostasis. CSF1, SPP1, FAM20C, and Cst7 were upregulated and are associated with osteoclastogenesis and inflammation. Among the downregulated genes, LILRA6, MMP9, and COL18A1 are involved in bone formation and osteoclast regulation. We further validated some of these genes (CSF1, Cst7, and SPP1) in the cortex and the bone of AD mice models. The dysregulation of these microglial genes in AD might provide insights into the co-occurrence of AD and osteoporosis and offer potential therapeutic targets to combat disease progression.
On the generalization capacity of neural networks during generic multimodal reasoning

The advent of the Transformer has led to the development of large language models (LLM), which appear to demonstrate human-like capabilities. To assess the generality of this class of models and a variety of other base neural network architectures to multimodal domains, we evaluated and compared their capacity for multimodal generalization. We introduce a multimodal question-answer benchmark to evaluate three specific types of out-of-distribution (OOD) generalization performance: distractor generalization (generalization in the presence of distractors), systematic compositional generalization (generalization to new task permutations), and productive compositional generalization (generalization to more complex tasks structures). We found that across model architectures (e.g., RNNs, Transformers, Perceivers, etc.), models with multiple attention layers, or models that leveraged cross-attention mechanisms between input domains, fared better. Our positive results demonstrate that for multimodal distractor and systematic generalization, either cross-modal attention or models with deeper attention layers are key architectural features required to integrate multimodal inputs. On the other hand, neither of these architectural features led to productive generalization, suggesting fundamental limitations of existing architectures for specific types of multimodal generalization. These results demonstrate the strengths and limitations of specific architectural components underlying modern neural models for multimodal reasoning. Finally, we provide Generic COG (gCOG), a configurable benchmark with several multimodal generalization splits, for future studies to explore.
Tensor product algorithms for inference of contact network from epidemiological data

We consider a problem of inferring contact network from nodal states observed during an epidemiological process. In a black-box Bayesian optimisation framework this problem reduces to a discrete likelihood optimisation over the set of possible networks. The high dimensionality of this set, which grows quadratically with the number of network nodes, makes this optimisation computationally challenging. Moreover, the computation of the likelihood of a network requires estimating probabilities of the observed data to realise during the evolution of the epidemiological process on this network. A stochastic simulation algorithm struggles to estimate rare events of observing the data (corresponding to the ground truth network) during the evolution with a significantly different network, and hence prevents optimisation of the likelihood. We replace the stochastic simulation with solving the chemical master equation for the probabilities of all network states. This equation also suffers from the curse of dimensionality due to the exponentially large number of network states. We overcome this by approximating the probability of states in the tensor-train decomposition. This enables fast and accurate computation of small probabilities and likelihoods. Numerical simulations demonstrate efficient black-box Bayesian inference of the network.
Using a Metasurface to Enhance the Radiation Efficiency of Subterahertz Antennas Printed on Thick Substrates

This study investigates the possibility of increasing the radiation efficiency of printed antennas and arrays by suppressing their inherent surface waves using a metasurface made of quad-split rings (QSR). A symmetrical resonant microstrip dipole and a four-element series-fed dipole array printed on an infinite grounded dielectric layer (layer thickness: 0.2 mm; relative permittivity: 9.4; tan delta: 0.0005) were simulated with FEKO 2022 software. Conducted at 100-116 GHz, the numerical results revealed extremely low radiation efficiencies of approximately 31% and 40% for the studied dipole and dipole array, respectively, which resulted from the presence of surface waves in the dielectric. However, placing only one QSR near each dipole arm triggered an increase in radiation efficiency by 2.5 times (up to 75%). The use of a metasurface in the form of two small QSR arrays triggered a pronounced improvement in radiation efficiency, reaching 93.6% and 96.5% for the studied dipole and dipole array, respectively. Analysis of the electric field distribution images showed that this enhancement resulted from surface wave suppression.
An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation

We revisit the oblivious transfer (OT) capacities of noisy channels against the passive adversary, which have been identified only for a limited class of channels. In the literature, the general construction of oblivious transfer has been known only for generalized erasure channels (GECs); for other channels, we first convert a given channel to a GEC via alphabet extension and erasure emulation, and then apply the general construction for GEC. In this paper, we derive an improved lower bound on the OT capacity of the binary symmetric channel (BSC) and binary symmetric erasure channel (BSEC) by proposing a new protocol; by using interactive communication between the sender and the receiver, our protocol emulates erasure events recursively in multiple rounds. We also discuss a potential necessity of multiple rounds interactive communication to attain the OT capacity.
Multi-model learning by sequential reading of untrimmed videos for action recognition

We propose a new method for learning videos by aggregating multiple models by sequentially extracting video clips from untrimmed video. The proposed method reduces the correlation between clips by feeding clips to multiple models in turn and synchronizes these models through federated learning. Experimental results show that the proposed method improves the performance compared to the no synchronization.
Hades Again and Again: A Study on Frustration Tolerance, Physiology and Player Experience

Accurately quantifying player experience is challenging for many reasons: identifying a ground truth and building validated and reliable scales are both challenging tasks; on top of that, empirical results are often moderated by individual factors. In this article, we present a study on the rogue-like game Hades designed to investigate the impact of individual differences in the operationalisation of player experience by cross-referencing multiple modalities (i.e., questionnaires, gameplay, and heart rate) and identifying the interplay between their scales.
A RISC-V SOC for Terahertz IoT Devices: Implementation and design challenges

Terahertz (THz) communication is considered a viable approach to augmenting the communication capacity of prospective Internet-of-Things (IoT) resulting in enhanced spectral efficiency. This study first provides an outline of the design challenges encountered in developing THz transceivers. This paper introduces advanced approaches and a unique methodology known as Modified Pulse-width Modulation (MPWM) to address the issues in the THz domain. In this situation involving a transceiver that handles complex modulation schemes, the presence of a mixed signal through a high-resolution digital-to-analog converter (DAC) in the transmitter greatly contributes to the limitation in maintaining linearity at high frequencies. The utilization of Pulse-width Modulation-based Digital-to-Analog Converters (PWM-DACs) has garnered significant attention among scholars due to its efficiency and affordability. However, the converters' performance is restricted by insufficient conversion speed and precision, especially in the context of high-resolution, high-order modulation schemes for THz wireless communications. The MPWM framework offers a multitude of adjustable options, rendering the final MPWM-DAC highly adaptable for a diverse array of application scenarios. Comparative performance assessments indicate that MPWM-DACs have enhanced conversion speed compared to standard PWM-DACs, and they also provide greater accuracy in comparison to Pulse-count Modulation DACs (PCM-DACs). The study presents a comprehensive examination of the core principles, spectrum characteristics, and evaluation metrics, as well as the development and experimental validation of the MPWM method. Furthermore, we present a RISC-V System-on-Chip (SoC) that incorporates an MPWM-DAC, offering a highly favorable resolution for THz IoT communications.
Hidden Gems on a Ring: Infant Massive Clusters and Their Formation Timeline Unveiled by ALMA, HST, and JWST in NGC 3351

We study young massive clusters (YMCs) in their embedded"infant"phase with $\sim$0.1"ALMA, HST, and JWST observations targeting the central starburst ring in NGC 3351, a nearby Milky Way analog galaxy. Our new ALMA data reveal 18 bright and compact (sub-)millimeter continuum sources, of which 11 have apparent counterparts in JWST images and only 6 have counterparts in HST images. Based on the ALMA continuum and molecular line data, as well as ancillary measurements for the HST and JWST counterparts, we identify 14 sources as infant star clusters with high stellar and/or gas masses (${\sim}10^5\;\mathrm{M_\odot}$), small radii (${\lesssim}\,5\;\mathrm{pc}$), large escape velocities ($6{-}10\;\mathrm{km/s}$), and short free-fall times ($0.5{-}1\;\mathrm{Myr}$). Their multiwavelength properties motivate us to divide them into four categories, likely corresponding to four evolutionary stages from starless clumps to exposed HII region-cluster complexes. Leveraging age estimates for HST-identified clusters in the same region, we infer an evolutionary timeline going from $1{-}2\;\mathrm{Myr}$ before cluster formation as starless clumps, to $4{-}6\;\mathrm{Myr}$ after as exposed HII region-cluster complexes. Finally, we show that the YMCs make up a substantial fraction of recent star formation across the ring, exhibit an non-uniform azimuthal distribution without a very coherent evolutionary trend along the ring, and are capable of driving large-scale gas outflows.
On the Castelnuovo-Mumford regularity of curve arrangements

The Castelnuovo-Mumford regularity of the Jacobian algebra and of the graded module of derivations associated to a general curve arrangement in the complex projective plane are studied. The key result is an addition-deletion type result, similar to results obtained by H. Schenck, H. Terao, S. Tohaneanu and M. Yoshinaga, but in which no quasi homogeneity assumption is needed.
Multi-Agent Based Transfer Learning for Data-Driven Air Traffic Applications

Research in developing data-driven models for Air Traffic Management (ATM) has gained a tremendous interest in recent years. However, data-driven models are known to have long training time and require large datasets to achieve good performance. To address the two issues, this paper proposes a Multi-Agent Bidirectional Encoder Representations from Transformers (MA-BERT) model that fully considers the multi-agent characteristic of the ATM system and learns air traffic controllers' decisions, and a pre-training and fine-tuning transfer learning framework. By pre-training the MA-BERT on a large dataset from a major airport and then fine-tuning it to other airports and specific air traffic applications, a large amount of the total training time can be saved. In addition, for newly adopted procedures and constructed airports where no historical data is available, this paper shows that the pre-trained MA-BERT can achieve high performance by updating regularly with little data. The proposed transfer learning framework and MA-BERT are tested with the automatic dependent surveillance-broadcast data recorded in 3 airports in South Korea in 2019.
Rician Distribution-Based MRG Target Extract Algorithm for SAR Image

Due to SAR image inherent characteristics of multiplicative noise and statistical properties of non-constant false-alarm rate(CFAR),target extraction in synthetic aperture radar(SAR) images is extremely difficult.In this paper,a new target extractor for SAR images named MRG is proposed.First,the MRF-ICM model is used for recovering SAR backscattering coefficients.Second,by selecting the optimal filter parameters based on the outputs of Rician distribution,a Gabor filter is introduced to extract targets from the complex SAR images composed of recovered amplitudes superposed by phases.Compared with the previous methods,the MRG target extractor makes full use of the SAR amplitude and phase features simultaneously.Experimental results indicate that our method achieves satisfied effect of target detection,and the extracted target forms are more true and accurate.Meanwhile,the MRG extractor also has an advantage of strong versatility.
Incremental Affinity Propagation based on Cluster Consolidation and Stratification

Modern data mining applications require to perform incremental clustering over dynamic datasets by tracing temporal changes over the resulting clusters. In this paper, we propose A-Posteriori affinity Propagation (APP), an incremental extension of Affinity Propagation (AP) based on cluster consolidation and cluster stratification to achieve faithfulness and forgetfulness. APP enforces incremental clustering where i) new arriving objects are dynamically consolidated into previous clusters without the need to re-execute clustering over the entire dataset of objects, and ii) a faithful sequence of clustering results is produced and maintained over time, while allowing to forget obsolete clusters with decremental learning functionalities. Four popular labeled datasets are used to test the performance of APP with respect to benchmark clustering performances obtained by conventional AP and Incremental Affinity Propagation based on Nearest neighbor Assignment (IAPNA) algorithms. Experimental results show that APP achieves comparable clustering performance while enforcing scalability at the same time.
The Machine Vision Iceberg Explained: Advancing Dynamic Testing by Considering Holistic Environmental Circumstances

Are we heading for an iceberg with the current testing of machine vision? This work delves into the landscape of Machine Vision (MV) testing, which is heavily required in Highly Automated Driving (HAD) systems. Utilizing the metaphorical notion of navigating towards an iceberg, we discuss the potential shortcomings concealed within current testing strategies. We emphasize the urgent need for a deeper understanding of how to deal with the opaque functions of MV in development processes. As overlooked considerations can cost lives. Our main contribution is the hierarchical level model, which we call Granularity Grades. The model encourages a refined exploration of the multi-scaled depths of understanding about the circumstances of environments in which MV is intended to operate. This model aims to provide a holistic overview of all entities that may impact MV functions, ranging from relations of individual entities like object attributes to entire environmental scenes. The application of our model delivers a structured exploration of entities in a specific domain, their relationships and assigning results of a MV-under-test to construct an entity-relationship graph. Through clustering patterns of relations in the graph general MV deficits are arguable. In Summary, our work contributes to a more nuanced and systematized identification of deficits of a MV test object in correlation to holistic circumstances in HAD operating domains.
Topology-Aware Exploration of Energy-Based Models Equilibrium: Toric QC-LDPC Codes and Hyperbolic MET QC-LDPC Codes

This paper presents a method for achieving equilibrium in the ISING Hamiltonian when confronted with unevenly distributed charges on an irregular grid. Employing (Multi-Edge) QC-LDPC codes and the Boltzmann machine, our approach involves dimensionally expanding the system, substituting charges with circulants, and representing distances through circulant shifts. This results in a systematic mapping of the charge system onto a space, transforming the irregular grid into a uniform configuration, applicable to Torical and Circular Hyperboloid Topologies. The paper covers fundamental definitions and notations related to QC-LDPC Codes, Multi-Edge QC-LDPC codes, and the Boltzmann machine. It explores the marginalization problem in code on the graph probabilistic models for evaluating the partition function, encompassing exact and approximate estimation techniques. Rigorous proof is provided for the attainability of equilibrium states for the Boltzmann machine under Torical and Circular Hyperboloid, paving the way for the application of our methodology. Practical applications of our approach are investigated in Finite Geometry QC-LDPC Codes, specifically in Material Science. The paper further explores its effectiveness in the realm of Natural Language Processing Transformer Deep Neural Networks, examining Generalized Repeat Accumulate Codes, Spatially-Coupled and Cage-Graph QC-LDPC Codes. The versatile and impactful nature of our topology-aware hardware-efficient quasi-cycle codes equilibrium method is showcased across diverse scientific domains without the use of specific section delineations.
Declassification Policy for Program Complexity Analysis

In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in polynomial time. These characterizations are also extensionally complete -- they capture all functions -- but are not intensionally complete as some polytime algorithms are rejected. This impact on expressive power is an unavoidable cost of achieving a tractable characterization. To overcome this issue, an avenue arising from security applications is to find a relaxation of noninterference based on a declassification mechanism that allows critical data to be released in a safe and controlled manner. Following this path, we present a new and intuitive declassification policy preserving FP-soundness and capturing strictly more programs than existing noninterference-based systems. We show the versatility of the approach: it also provides a new characterization of the class BFF of second-order polynomial time computable functions in a second-order imperative language, with first-order procedure calls. Type inference is tractable: it can be done in polynomial time.
Graph fission and cross-validation

We introduce a technique called graph fission which takes in a graph which potentially contains only one observation per node (whose distribution lies in a known class) and produces two (or more) independent graphs with the same node/edge set in a way that splits the original graph's information amongst them in any desired proportion. Our proposal builds on data fission/thinning, a method that uses external randomization to create independent copies of an unstructured dataset. We extend this idea to the graph setting where there may be latent structure between observations. We demonstrate the utility of this framework via two applications: inference after structural trend estimation on graphs and a model selection procedure we term"graph cross-validation".
Structure in Communication Complexity and Constant-Cost Complexity Classes

Several theorems and conjectures in communication complexity state or speculate that the complexity of a matrix in a given communication model is controlled by a related analytic or algebraic matrix parameter, e.g., rank, sign-rank, discrepancy, etc. The forward direction is typically easy as the structural implications of small complexity often imply a bound on some matrix parameter. The challenge lies in establishing the reverse direction, which requires understanding the structure of Boolean matrices for which a given matrix parameter is small or large. We will discuss several research directions that align with this overarching theme.
Turn-taking and Backchannel Prediction with Acoustic and Large Language Model Fusion

We propose an approach for continuous prediction of turn-taking and backchanneling locations in spoken dialogue by fusing a neural acoustic model with a large language model (LLM). Experiments on the Switchboard human-human conversation dataset demonstrate that our approach consistently outperforms the baseline models with single modality. We also develop a novel multi-task instruction fine-tuning strategy to further benefit from LLM-encoded knowledge for understanding the tasks and conversational contexts, leading to additional improvements. Our approach demonstrates the potential of combined LLMs and acoustic models for a more natural and conversational interaction between humans and speech-enabled AI agents.
Fast Long-Term Multi-Scenario Prediction for Maneuver Planning at Unsignalized Intersections

Motion prediction for intelligent vehicles typically focuses on estimating the most probable future evolutions of a traffic scenario. Estimating the gap acceptance, i.e., whether a vehicle merges or crosses before another vehicle with the right of way, is often handled implicitly in the prediction. However, an infrastructure-based maneuver planning can assign artificial priorities between cooperative vehicles, so it needs to evaluate many more potential scenarios. Additionally, the prediction horizon has to be long enough to assess the impact of a maneuver. We, therefore, present a novel long-term prediction approach handling the gap acceptance estimation and the velocity prediction in two separate stages. Thereby, the behavior of regular vehicles as well as priority assignments of cooperative vehicles can be considered. We train both stages on real-world traffic observations to achieve realistic prediction results. Our method has a competitive accuracy and is fast enough to predict a multitude of scenarios in a short time, making it suitable to be used in a maneuver planning framework.