Miracle-dz/UniFAR-FTUs huggingface dataset:
Water Level and Velocity Characteristics of a Salt Marsh Channel in the Murderkill Estuary, Delaware

ABSTRACT Dzwonkowski, B. ; Wong, K. -C. , and Ullman, W.J., 2014. Water level and velocity characteristics of a salt marsh channel in the Murderkill estuary, Delaware. High-frequency observations of water level and velocity over one year in Murderkill estuary, a tributary estuary of Delaware Bay, are used to examine changes in tidal and subtidal flow characteristics as water propagates from the mouth of the estuary (Bowers site) into a minor channel that connects to a contiguous salt marsh (channel site), a setting where long-term continuous data sets are uncommon. These data provide insight into the flow behavior in marsh channels, the driving mechanisms of water exchange, and the potential for particle and solute exchange between tidal marshes and their adjacent estuaries. At both sites, tidal forcing is normally the dominant driving mechanism in water level and velocity signals with remote wind forcing having a limited contribution. As the tidal signal propagates from the Bowers site into the salt marsh, however, the progressive-type mixed wave is transformed into a standing wave with minor velocity distortions resulting from a reduction in the M2 tidal constituent as well as an amplification of the M4 overtide. The variability at both sites is typically well explained as a linear superposition of high-frequency tidal constituents and remotely forced wind-driven subtidal fluctuations. During storm events at intermediate to spring tides, however, both tidal and subtidal velocity characteristics in the channel are more nonlinear compared to both typical channel conditions and those at the Bowers site. During these events, in response to remote winds, tidal flow in the channel becomes progressive in form and flood dominant, while subtidal velocities are ebbward and nearly an order of magnitude stronger than typical conditions.
A simple connection from loss flatness to compressed representations in neural networks

The generalization capacity of deep neural networks has been studied in a variety of ways, including at least two distinct categories of approach: one based on the shape of the loss landscape in parameter space, and the other based on the structure of the representation manifold in feature space (that is, in the space of unit activities). Although these two approaches are related, they are rarely studied together in an explicit connection. Here, we present a simple analysis that makes such a connection. We show that, in the last phase of learning of deep neural networks, compression of the manifold of neural representations correlates with the flatness of the loss around the minima explored by SGD. We show that this is predicted by a relatively simple mathematical relationship: a flatter loss corresponds to a lower upper-bound on the compression of neural representations. Our results closely build on the prior work of Ma and Ying, who demonstrated how flatness, characterized by small eigenvalues of the loss Hessian, develops in late learning phases and contributes to robustness against perturbations in network inputs. Moreover, we show a lack of a similarly direct connection between local dimensionality and sharpness, suggesting that this property may be controlled by different mechanisms than volume and hence may play a complementary role in neural representations. Overall, we advance a dual perspective on generalization in neural networks in both parameter and feature space.
Investigation on a Novel Length-Based Local Linear Subdivision Strategy for Triangular Meshes

Triangular meshes are a widely used representation in the field of 3D modeling. In this paper, we present a novel approach for edge length-based linear subdivision on triangular meshes, along with two auxiliary techniques. We conduct a comprehensive comparison of different subdivision methods in terms of computational capabilities and mesh-enhancing abilities. Our proposed approach demonstrates improved computational efficiency and generates fewer elements with higher quality compared to existing methods. The improvement in computational efficiency and mesh augmentation capability of our method is further enhanced when working with the two auxiliary techniques presented in this paper. Our novel strategy represents a significant contribution to the field and has important implications for local mesh refinement, computer-aided design, and isotropic remeshing.
Naming Practices of Pre-Trained Models in Hugging Face

As innovation in deep learning continues, many engineers seek to adopt Pre-Trained Models (PTMs) as components in computer systems. Researchers publish PTMs, which engineers adapt for quality or performance prior to deployment. PTM authors should choose appropriate names for their PTMs, which would facilitate model discovery and reuse. However, prior research has reported that model names are not always well chosen - and are sometimes erroneous. The naming for PTM packages has not been systematically studied. In this paper, we frame and conduct the first empirical investigation of PTM naming practices in the Hugging Face PTM registry. We initiated our study with a survey of 108 Hugging Face users to understand the practices in PTM naming. From our survey analysis, we highlight discrepancies from traditional software package naming, and present findings on naming practices. Our findings indicate there is a great mismatch between engineers' preferences and practical practices of PTM naming. We also present practices on detecting naming anomalies and introduce a novel automated DNN ARchitecture Assessment technique (DARA), capable of detecting PTM naming anomalies. We envision future works on leveraging meta-features of PTMs to improve model reuse and trustworthiness.
Sneaked references: Cooked reference metadata inflate citation counts

We report evidence of an undocumented method to manipulate citation counts involving 'sneaked' references. Sneaked references are registered as metadata for scientific articles in which they do not appear. This manipulation exploits trusted relationships between various actors: publishers, the Crossref metadata registration agency, digital libraries, and bibliometric platforms. By collecting metadata from various sources, we show that extra undue references are actually sneaked in at Digital Object Identifier (DOI) registration time, resulting in artificially inflated citation counts. As a case study, focusing on three journals from a given publisher, we identified at least 9% sneaked references (5,978/65,836) mainly benefiting two authors. Despite not existing in the articles, these sneaked references exist in metadata registries and inappropriately propagate to bibliometric dashboards. Furthermore, we discovered 'lost' references: the studied bibliometric platform failed to index at least 56% (36,939/65,836) of the references listed in the HTML version of the publications. The extent of the sneaked and lost references in the global literature remains unknown and requires further investigations. Bibliometric platforms producing citation counts should identify, quantify, and correct these flaws to provide accurate data to their patrons and prevent further citation gaming.
Impact of leptin deficiency on male tibia and vertebral body 3D bone architecture independent of changes in body weight

Leptin an adipokine with potent effects on energy balance and body weight plays an important role in defining bone architecture in growing mammals. However, major changes in body weight can also influence morphology of trabecular and cortical bone. Therefore, we examined the impact of leptin deficiency on tibia and vertebral body 3D bone architecture independent of changes in body weight. Furthermore, advances in computational 3D image analysis suggest that average morphological values may mask regional specific differences in trabecular bone thickness. The study utilized leptin‐deficient Ob/Ob mice (n = 8) weight‐paired to C57BL/6 (C57) control mice (n = 8) which were split into either lean or obese groups for 24 ± 2 weeks. Whole tibias and L3 vertebrae were fixed before high resolution microcomputed tomography (μCT) scanning was performed. Leptin deficiency independent of body weight reduced tibia cortical bone volume, trabecular bone volume/tissue volume, number, and mineral density. Mean tibia trabecular thickness showed no significant differences between all groups; however, significant changes in trabecular thickness were found when analyzed by region. This study demonstrates that leptin deficiency significantly impacts tibia and vertebral body trabecular and cortical bone 3D architecture independent of changes in body weight.
Improving web element localization by using a large language model

Web-based test automation heavily relies on accurately finding web elements. Traditional methods compare attributes but don't grasp the context and meaning of elements and words. The emergence of Large Language Models (LLMs) like GPT-4, which can show human-like reasoning abilities on some tasks, offers new opportunities for software engineering and web element localization. This paper introduces and evaluates VON Similo LLM, an enhanced web element localization approach. Using an LLM, it selects the most likely web element from the top-ranked ones identified by the existing VON Similo method, ideally aiming to get closer to human-like selection accuracy. An experimental study was conducted using 804 web element pairs from 48 real-world web applications. We measured the number of correctly identified elements as well as the execution times, comparing the effectiveness and efficiency of VON Similo LLM against the baseline algorithm. In addition, motivations from the LLM were recorded and analyzed for all instances where the original approach failed to find the right web element. VON Similo LLM demonstrated improved performance, reducing failed localizations from 70 to 39 (out of 804), a 44 percent reduction. Despite its slower execution time and additional costs of using the GPT-4 model, the LLMs human-like reasoning showed promise in enhancing web element localization. LLM technology can enhance web element identification in GUI test automation, reducing false positives and potentially lowering maintenance costs. However, further research is necessary to fully understand LLMs capabilities, limitations, and practical use in GUI testing.
Using Focus Group Interviews to Examine Biased Experiences in Human-Robot-Interaction

When deploying interactive agents like (social) robots in public spaces they need to be able to interact with a diverse audience, with members each having individual diversity characteristics and prior experiences with interactive systems. To cater for these various predispositions, it is important to examine what experiences citizens have made with interactive systems and how these experiences might create a bias towards such systems. To analyze these bias-inducing experiences, focus group interviews have been conducted to learn of citizens individual discrimination experiences, their attitudes towards and arguments for and against the deployment of social robots in public spaces. This extended abstract focuses especially on the method and measurement of diversity.
Distribution of shortest path lengths on trees of a given size in subcritical Erdős-Rényi networks.

In the subcritical regime Erdős-Rényi (ER) networks consist of finite tree components, which are nonextensive in the network size. The distribution of shortest path lengths (DSPL) of subcritical ER networks was recently calculated using a topological expansion [E. Katzav, O. Biham, and A. K. Hartmann, Phys. Rev. E 98, 012301 (2018)2470-004510.1103/PhysRevE.98. 012301]. The DSPL, which accounts for the distance ℓ between any pair of nodes that reside on the same finite tree component, was found to follow a geometric distribution of the form P(L=ℓ|L<∞)=(1-c)c^{ℓ-1}, where 0<c<1 is the mean degree of the network. This result includes the contributions of trees of all possible sizes and topologies. Here we calculate the distribution of shortest path lengths P(L=ℓ|S=s) between random pairs of nodes that reside on the same tree component of a given size s. It is found that P(L=ℓ|S=s)=ℓ+1/s^{ℓ}(s-2)! /(s-ℓ-1)! Surprisingly, this distribution does not depend on the mean degree c of the network from which the tree components were extracted. This is due to the fact that the ensemble of tree components of a given size s in subcritical ER networks is sampled uniformly from the set of labeled trees of size s and thus does not depend on c. The moments of the DSPL are also calculated. It is found that the mean distance between random pairs of nodes on tree components of size s satisfies E[L|S=s]∼sqrt[s], unlike small-world networks in which the mean distance scales logarithmically with s.
Small solutions to homogeneous and inhomogeneous cubic equations

We study the solubility of cubic equations over the integers. Assuming a necessary congruence condition, the existence of such solutions is established when the $h$-invariant of $C$ is at least $14$, improving on work of Davenport-Lewis and generalizing the method from Heath-Brown's seminal work in the homogeneous case. We also provide an upper bound on the smallest solution, polynomially in the height of the coefficients. The method also yields new results in the homogeneous case where we generalize and improve on previous work of Browning, Dietmann and Elliott.
Risk and Threat Mitigation Techniques in Internet of Things (IoT) Environments: A Survey

Security in the Internet of Things (IoT) remains a predominant area of concern. Although several other surveys have been published on this topic in recent years, the broad spectrum that this area aims to cover, the rapid developments and the variety of concerns make it impossible to cover the topic adequately. This survey updates the state of the art covered in previous surveys and focuses on defences and mitigations against threats rather than on the threats alone, an area that is less extensively covered by other surveys. This survey has collated current research considering the dynamicity of the IoT environment, a topic missed in other surveys and warrants particular attention. To consider the IoT mobility, a life-cycle approach is adopted to the study of dynamic and mobile IoT environments and means of deploying defences against malicious actors aiming to compromise an IoT network and to evolve their attack laterally within it and from it. This survey takes a more comprehensive and detailed step by analysing a broad variety of methods for accomplishing each of the mitigation steps, presenting these uniquely by introducing a “defence-in-depth” approach that could significantly slow down the progress of an attack in the dynamic IoT environment. This survey sheds a light on leveraging redundancy as an inherent nature of multi-sensor IoT applications, to improve integrity and recovery. This study highlights the challenges of each mitigation step, emphasises novel perspectives, and reconnects the discussed mitigation steps to the ground principles they seek to implement.
Stack Attention: Improving the Ability of Transformers to Model Hierarchical Patterns

Attention, specifically scaled dot-product attention, has proven effective for natural language, but it does not have a mechanism for handling hierarchical patterns of arbitrary nesting depth, which limits its ability to recognize certain syntactic structures. To address this shortcoming, we propose stack attention: an attention operator that incorporates stacks, inspired by their theoretical connections to context-free languages (CFLs). We show that stack attention is analogous to standard attention, but with a latent model of syntax that requires no syntactic supervision. We propose two variants: one related to deterministic pushdown automata (PDAs) and one based on nondeterministic PDAs, which allows transformers to recognize arbitrary CFLs. We show that transformers with stack attention are very effective at learning CFLs that standard transformers struggle on, achieving strong results on a CFL with theoretically maximal parsing difficulty. We also show that stack attention is more effective at natural language modeling under a constrained parameter budget, and we include results on machine translation.
Self-Supervised High Dynamic Range Imaging with Multi-Exposure Images in Dynamic Scenes

Merging multi-exposure images is a common approach for obtaining high dynamic range (HDR) images, with the primary challenge being the avoidance of ghosting artifacts in dynamic scenes. Recent methods have proposed using deep neural networks for deghosting. However, the methods typically rely on sufficient data with HDR ground-truths, which are difficult and costly to collect. In this work, to eliminate the need for labeled data, we propose SelfHDR, a self-supervised HDR reconstruction method that only requires dynamic multi-exposure images during training. Specifically, SelfHDR learns a reconstruction network under the supervision of two complementary components, which can be constructed from multi-exposure images and focus on HDR color as well as structure, respectively. The color component is estimated from aligned multi-exposure images, while the structure one is generated through a structure-focused network that is supervised by the color component and an input reference (\eg, medium-exposure) image. During testing, the learned reconstruction network is directly deployed to predict an HDR image. Experiments on real-world images demonstrate our SelfHDR achieves superior results against the state-of-the-art self-supervised methods, and comparable performance to supervised ones. Codes are available at https://github.com/cszhilu1998/SelfHDR
Harnessing Pre-Trained Sentence Transformers for Offensive Language Detection in Indian Languages

In our increasingly interconnected digital world, social media platforms have emerged as powerful channels for the dissemination of hate speech and offensive content. This work delves into the domain of hate speech detection, placing specific emphasis on three low-resource Indian languages: Bengali, Assamese, and Gujarati. The challenge is framed as a text classification task, aimed at discerning whether a tweet contains offensive or non-offensive content. Leveraging the HASOC 2023 datasets, we fine-tuned pre-trained BERT and SBERT models to evaluate their effectiveness in identifying hate speech. Our findings underscore the superiority of monolingual sentence-BERT models, particularly in the Bengali language, where we achieved the highest ranking. However, the performance in Assamese and Gujarati languages signifies ongoing opportunities for enhancement. Our goal is to foster inclusive online spaces by countering hate speech proliferation.
VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores

The increasing success and scaling of Deep Learning models demands higher computational efficiency and power. Sparsification can lead to both smaller models as well as higher compute efficiency, and accelerated hardware is becoming available. However, exploiting it efficiently requires kernel implementations, pruning algorithms, and storage formats, to utilize hardware support of specialized sparse vector units. An example of those are the NVIDIA's Sparse Tensor Cores (SPTCs), which promise a 2× speedup. However, SPTCs only support the 2:4 format, limiting achievable sparsity ratios to 50%. We present the V:N:M format, which enables the execution of arbitrary N:M ratios on SPTCs. To efficiently exploit the resulting format, we propose Spatha, a high-performance sparse-library for DL routines. We show that Spatha achieves up to 37× speedup over cuBLAS. We also demonstrate a second-order pruning technique that enables sparsification to high sparsity ratios with V:N:M and little to no loss in accuracy in modern transformers.
Solving Two-Player General-Sum Games Between Swarms

Hamilton-Jacobi-Isaacs (HJI) PDEs are the governing equations for the two-player general-sum games. Unlike Reinforcement Learning (RL) methods, which are data-intensive methods for learning value function, learning HJ PDEs provide a guaranteed convergence to the Nash Equilibrium value of the game when it exists. However, a caveat is that solving HJ PDEs becomes intractable when the state dimension increases. To circumvent the curse of dimensionality (CoD), physics-informed machine learning methods with supervision can be used and have been shown to be effective in generating equilibrial policies in two-player general-sum games. In this work, we extend the existing work on agent-level two-player games to a two-player swarm-level game, where two sub-swarms play a general-sum game. We consider the \textit{Kolmogorov forward equation} as the dynamic model for the evolution of the densities of the swarms. Results show that policies generated from the physics-informed neural network (PINN) result in a higher payoff than a Nash Double Deep Q-Network (Nash DDQN) agent and have comparable performance with numerical solvers.
Spectral operator learning for parametric PDEs without data reliance

In this paper, we introduce the Spectral Coefficient Learning via Operator Network (SCLON), a novel operator learning-based approach for solving parametric partial differential equations (PDEs) without the need for data harnessing. The cornerstone of our method is the spectral methodology that employs expansions using orthogonal functions, such as Fourier series and Legendre polynomials, enabling accurate PDE solutions with fewer grid points. By merging the merits of spectral methods - encompassing high accuracy, efficiency, generalization, and the exact fulfillment of boundary conditions - with the prowess of deep neural networks, SCLON offers a transformative strategy. Our approach not only eliminates the need for paired input-output training data, which typically requires extensive numerical computations, but also effectively learns and predicts solutions of complex parametric PDEs, ranging from singularly perturbed convection-diffusion equations to the Navier-Stokes equations. The proposed framework demonstrates superior performance compared to existing scientific machine learning techniques, offering solutions for multiple instances of parametric PDEs without harnessing data. The mathematical framework is robust and reliable, with a well-developed loss function derived from the weak formulation, ensuring accurate approximation of solutions while exactly satisfying boundary conditions. The method's efficacy is further illustrated through its ability to accurately predict intricate natural behaviors like the Kolmogorov flow and boundary layers. In essence, our work pioneers a compelling avenue for parametric PDE solutions, serving as a bridge between traditional numerical methodologies and cutting-edge machine learning techniques in the realm of scientific computation.