Miracle-dz/UniFAR-FTUs huggingface dataset:
A Light-weight and Unsupervised Method for Near Real-time Behavioral Analysis using Operational Data Measurement

Monitoring the status of large computing systems is essential to identify unexpected behavior and improve their performance and uptime. However, due to the large-scale and distributed design of such computing systems as well as a large number of monitoring parameters, automated monitoring methods should be applied. Such automatic monitoring methods should also have the ability to adapt themselves to the continuous changes in the computing system. In addition, they should be able to identify behavioral anomalies in useful time, to perform appropriate reactions. This work proposes a general lightweight and unsupervised method for near real-time anomaly detection using operational data measurement on large computing systems. The proposed model requires as little as 4 hours of data and 50 epochs for each training process to accurately resemble the behavioral pattern of computing systems.
Ultra-Short Pulse Biphoton Source in Lithium Niobate Nanophotonics at 2 \textmu m

Photonics offers unique capabilities for quantum information processing (QIP) such as room-temperature operation, the scalability of nanophotonics, and access to ultrabroad bandwidths and consequently ultrafast operation. Ultrashort-pulse sources of quantum states in nanophotonics are an important building block for achieving scalable ultrafast QIP, however, their demonstrations so far have been sparse. Here, we demonstrate a femtosecond biphoton source in dispersion-engineered periodically poled lithium niobate nanophotonics. We measure 17 THz of bandwidth for the source centered at 2.09 \textmu m, corresponding to a few optical cycles, with a brightness of 8.8 GHz/mW. Our results open new paths towards realization of ultrafast nanophotonic QIP.
Towards Understanding Inductive Bias in Transformers: A View From Infinity

We study inductive bias in Transformers in the infinitely over-parameterized Gaussian process limit and argue transformers tend to be biased towards more permutation symmetric functions in sequence space. We show that the representation theory of the symmetric group can be used to give quantitative analytical predictions when the dataset is symmetric to permutations between tokens. We present a simplified transformer block and solve the model at the limit, including accurate predictions for the learning curves and network outputs. We show that in common setups, one can derive tight bounds in the form of a scaling law for the learnability as a function of the context length. Finally, we argue WikiText dataset, does indeed possess a degree of permutation symmetry.
Impacts of Solid Waste Management Practices on Environment and Public Health: A Case of Bahawalpur City, Pakistan

Safe and secure disposal of solid waste is now becoming a major issue for most of developing countries with accelerating urbanization and increasing pressure of populations. A study was conducted in Bahawalpur City; Pakistan. The main objective of the study was to investigate the sources and impacts of solid waste management practices on the surrounding environment and public health. This was achieved by specifically identifying the sources and types of solid waste in the city by identifying the different solid waste management practices and their impacts on the environment and human health. Data about solid waste generation, collection, disposal and their impacts on human health and environment was collected in Model Town C using a structured questionnaire from 80 randomly sampled respondents as well as by field observations. Secondary data from institutional records was also collected. Statistical analysis in the form of descriptive statistics and chi-square test were applied to the data. It was found that the environment in study area was highly polluted with open dumping of solid waste in open spaces and vacant plots. Households contributed the most solid waste generation and open dumping. The solid waste generated at household level consisted of organic waste, plastics and polythene bags. Institutionally, Tehsil Municipal Administration (TMA) and later Bahawalpur Waste Management Company (BWMC) were found to be responsible for solid waste management in the city but the overall situation is not satisfactory. The impacts of poor solid waste management practices were found to be: land degradation, creation of breeding grounds for disease carrying vectors such as mosquitoes, rats, rodents, decrease in land values; and different severe diseases. Furthermore, it was found by statistical analysis, that there was a significant relationship between the poor solid waste management practices and environmental and health problems faced by the community.
Domain-Agnostic Hardware Fingerprinting-Based Device Identifier for Zero-Trust IoT Security

Next-generation networks aim for comprehensive connectivity, interconnecting humans, machines, devices, and systems seamlessly. This interconnectivity raises concerns about privacy and security, given the potential network-wide impact of a single compromise. To address this challenge, the Zero Trust (ZT) paradigm emerges as a key method for safeguarding network integrity and data confidentiality. This work introduces EPS-CNN, a novel deep-learning-based wireless device identification framework designed to serve as the device authentication layer within the ZT architecture, with a focus on resource-constrained IoT devices. At the core of EPS-CNN, a Convolutional Neural Network (CNN) is utilized to generate the device identity from a unique RF signal representation, known as the Double-Sided Envelope Power Spectrum (EPS), which effectively captures the device-specific hardware characteristics while ignoring device-unrelated information. Experimental evaluations show that the proposed framework achieves over 99%, 93%, and 95% testing accuracy when tested in same-domain (day, location, and channel), cross-day, and cross-location scenarios, respectively. Our findings demonstrate the superiority of the proposed framework in enhancing the accuracy, robustness, and adaptability of deep learning-based methods, thus offering a pioneering solution for enabling ZT IoT device identification.
TASER: Temporal Adaptive Sampling for Fast and Accurate Dynamic Graph Representation Learning

Recently, Temporal Graph Neural Networks (TGNNs) have demonstrated state-of-the-art performance in various high-impact applications, including fraud detection and content recommendation. Despite the success of TGNNs, they are prone to the prevalent noise found in real-world dynamic graphs like time-deprecated links and skewed interaction distribution. The noise causes two critical issues that significantly compromise the accuracy of TGNNs: (1) models are supervised by inferior interactions, and (2) noisy input induces high variance in the aggregated messages. However, current TGNN denoising techniques do not consider the diverse and dynamic noise pattern of each node. In addition, they also suffer from the excessive mini-batch generation overheads caused by traversing more neighbors. We believe the remedy for fast and accurate TGNNs lies in temporal adaptive sampling. In this work, we propose TASER, the first adaptive sampling method for TGNNs optimized for accuracy, efficiency, and scalability. TASER adapts its mini-batch selection based on training dynamics and temporal neighbor selection based on the contextual, structural, and temporal properties of past interactions. To alleviate the bottleneck in mini-batch generation, TASER implements a pure GPU-based temporal neighbor finder and a dedicated GPU feature cache. We evaluate the performance of TASER using two state-of-the-art backbone TGNNs. On five popular datasets, TASER outperforms the corresponding baselines by an average of 2.3% in Mean Reciprocal Rank (MRR) while achieving an average of 5.1x speedup in training time.
Experimental studies of low salinity water flooding in carbonate reservoirs: A new promising approach

approach DTU Orbit (28/10/2019) Experimental studies of low salinity water flooding in carbonate reservoirs: A new promising approach Low salinity water flooding is well studied for sandstone reservoirs, both laboratory and field tests have showed improvement in the oil recovery in many cases. Up to very recently, the low salinity effect has been indeterminated for carbonates. Most recently, Saudi Aramco reported that substantial additional oil recovery can be achieved when successively flooding composite carbonate core plugs with various diluted versions of seawater. The experimental data on carbonates is very limited, so more data and better understanding of the mechanisms involved is needed to utilize this method for carbonate reservoirs. In this paper, we have experimentally investigated the oil recovery potential of low salinity water flooding for carbonate rocks. We used both reservoir carbonate and outcrop chalk core plugs. The flooding experiments were carried out initially with the seawater, and afterwards additional oil recovery was evaluated by sequential injection of various diluted seawater. The experiments applied stepwise increase in flow rate to eliminate the influence of possible capillary end effect. The total oil recovery, interaction of the different ions with the rock, and the wettability changes were studied both at ambient and high temperature. No low salinity effect was observed for the reservoir carbonate core plug at the ambient temperature, but increase of the pressure drop over the core plug was detected. On the contrary, a significant increase in oil recovery was observed under low salinity flooding of the reservoir carbonate core plugs at 90°C. An increase in pressure drop was also observed in this case, possibly related to migration of fines or dissolution reactions. The outcrop Aalborg chalk core plugs did not show any low salinity effect, both at the room and at a high temperature. In the light of experimental results, discussions are made about possible mechanisms for improving oil recovery in carbonate reservoir as a function of change in brine salinity. Copyright 2012, Society of Petroleum Engineers.
Rapid Optimization for Jailbreaking LLMs via Subconscious Exploitation and Echopraxia

Large Language Models (LLMs) have become prevalent across diverse sectors, transforming human life with their extraordinary reasoning and comprehension abilities. As they find increased use in sensitive tasks, safety concerns have gained widespread attention. Extensive efforts have been dedicated to aligning LLMs with human moral principles to ensure their safe deployment. Despite their potential, recent research indicates aligned LLMs are prone to specialized jailbreaking prompts that bypass safety measures to elicit violent and harmful content. The intrinsic discrete nature and substantial scale of contemporary LLMs pose significant challenges in automatically generating diverse, efficient, and potent jailbreaking prompts, representing a continuous obstacle. In this paper, we introduce RIPPLE (Rapid Optimization via Subconscious Exploitation and Echopraxia), a novel optimization-based method inspired by two psychological concepts: subconsciousness and echopraxia, which describe the processes of the mind that occur without conscious awareness and the involuntary mimicry of actions, respectively. Evaluations across 6 open-source LLMs and 4 commercial LLM APIs show RIPPLE achieves an average Attack Success Rate of 91.5\%, outperforming five current methods by up to 47.0\% with an 8x reduction in overhead. Furthermore, it displays significant transferability and stealth, successfully evading established detection mechanisms. The code of our work is available at \url{https://github.com/SolidShen/RIPPLE_official/tree/official}
Effective model and $s_\pm$-wave superconductivity in trilayer nickelate La$_4$Ni$_3$O$_{10}$

The recent discovery of bulk superconductivity in trilayer nickelate La$_4$Ni$_3$O$_{10}$ with the critical temperature $T_c$ near $30$K under high pressure is attracting a new wave of research interest, after the breakthrough of bilayer La$_3$Ni$_2$O$_7$ with $T_c$ near $80$K. The similarities and differences of electronic structure and superconducting mechanism in these two systems are urgent theoretical issues. In this Letter, we study the electronic band structure and construct a minimal trilayer tight-binding model for the high-pressure phase of La$_4$Ni$_3$O$_{10}$ in terms of the nickel $3d_{x^2-y^2}$ and $3d_{3z^2-r^2}$ orbitals, and study the superconducting mechanism due to local Coulomb interactions by the unbiased functional renormalization group. We find antiferromagnetic correlations between the outer layers instead of neighboring ones, apart from the inplane correlations. The effective interaction induces Cooper pairing with the $s_\pm$-wave symmetry, which changes sign across the Fermi pockets. We find $T_c$ in La$_4$Ni$_3$O$_{10}$ is systematically lower than that in La$_3$Ni$_2$O$_7$, and electron doping can enhance $T_c$.
Time Series Diffusion in the Frequency Domain

Fourier analysis has been an instrumental tool in the development of signal processing. This leads us to wonder whether this framework could similarly benefit generative modelling. In this paper, we explore this question through the scope of time series diffusion models. More specifically, we analyze whether representing time series in the frequency domain is a useful inductive bias for score-based diffusion models. By starting from the canonical SDE formulation of diffusion in the time domain, we show that a dual diffusion process occurs in the frequency domain with an important nuance: Brownian motions are replaced by what we call mirrored Brownian motions, characterized by mirror symmetries among their components. Building on this insight, we show how to adapt the denoising score matching approach to implement diffusion models in the frequency domain. This results in frequency diffusion models, which we compare to canonical time diffusion models. Our empirical evaluation on real-world datasets, covering various domains like healthcare and finance, shows that frequency diffusion models better capture the training distribution than time diffusion models. We explain this observation by showing that time series from these datasets tend to be more localized in the frequency domain than in the time domain, which makes them easier to model in the former case. All our observations point towards impactful synergies between Fourier analysis and diffusion models.
DiffSpeaker: Speech-Driven 3D Facial Animation with Diffusion Transformer

Speech-driven 3D facial animation is important for many multimedia applications. Recent work has shown promise in using either Diffusion models or Transformer architectures for this task. However, their mere aggregation does not lead to improved performance. We suspect this is due to a shortage of paired audio-4D data, which is crucial for the Transformer to effectively perform as a denoiser within the Diffusion framework. To tackle this issue, we present DiffSpeaker, a Transformer-based network equipped with novel biased conditional attention modules. These modules serve as substitutes for the traditional self/cross-attention in standard Transformers, incorporating thoughtfully designed biases that steer the attention mechanisms to concentrate on both the relevant task-specific and diffusion-related conditions. We also explore the trade-off between accurate lip synchronization and non-verbal facial expressions within the Diffusion paradigm. Experiments show our model not only achieves state-of-the-art performance on existing benchmarks, but also fast inference speed owing to its ability to generate facial motions in parallel.
Graph Neural Network and NER-Based Text Summarization

With the abundance of data and information in todays time, it is nearly impossible for man, or, even machine, to go through all of the data line by line. What one usually does is to try to skim through the lines and retain the absolutely important information, that in a more formal term is called summarization. Text summarization is an important task that aims to compress lengthy documents or articles into shorter, coherent representations while preserving the core information and meaning. This project introduces an innovative approach to text summarization, leveraging the capabilities of Graph Neural Networks (GNNs) and Named Entity Recognition (NER) systems. GNNs, with their exceptional ability to capture and process the relational data inherent in textual information, are adept at understanding the complex structures within large documents. Meanwhile, NER systems contribute by identifying and emphasizing key entities, ensuring that the summarization process maintains a focus on the most critical aspects of the text. By integrating these two technologies, our method aims to enhances the efficiency of summarization and also tries to ensures a high degree relevance in the condensed content. This project, therefore, offers a promising direction for handling the ever increasing volume of textual data in an information-saturated world.
An Optimization-based Baseline for Rigid 2D/3D Registration Applied to Spine Surgical Navigation Using CMA-ES

A robust and efficient optimization-based 2D/3D registration framework is crucial for the navigation system of orthopedic surgical robots. It can provide precise position information of surgical instruments and implants during surgery. While artificial intelligence technology has advanced rapidly in recent years, traditional optimization-based registration methods remain indispensable in the field of 2D/3D registration.he exceptional precision of this method enables it to be considered as a post-processing step of the learning-based methods, thereby offering a reliable assurance for registration. In this paper, we present a coarse-to-fine registration framework based on the CMA-ES algorithm. We conducted intensive testing of our method using data from different parts of the spine. The results shows the effectiveness of the proposed framework on real orthopedic spine surgery clinical data. This work can be viewed as an additional extension that complements the optimization-based methods employed in our previous studies.
Exact quantum sensing limits for bosonic dephasing channels

Dephasing is a prominent noise mechanism that afflicts quantum information carriers, and it is one of the main challenges towards realizing useful quantum computation, communication, and sensing. Here we consider discrimination and estimation of bosonic dephasing channels, when using the most general adaptive strategies allowed by quantum mechanics. We reduce these difficult quantum problems to simple classical ones based on the probability densities defining the bosonic dephasing channels. By doing so, we rigorously establish the optimal performance of various distinguishability and estimation tasks and construct explicit strategies to achieve this performance. To the best of our knowledge, this is the first example of a non-Gaussian bosonic channel for which there are exact solutions for these tasks.
Spatially-Periodic Solutions for Evolution Anisotropic Variable-Coefficient Navier-Stokes Equations: I. Existence

We consider evolution (non-stationary) space-periodic solutions to the $n$-dimensional non-linear Navier-Stokes equations of anisotropic fluids with the viscosity coefficient tensor variable in space and time and satisfying the relaxed ellipticity condition. Employing the Galerkin algorithm with the basis constituted by the eigenfunctions of the periodic Bessel-potential operator, we prove the existence of a global weak solution.
Non-interpenetration of rods derived by $\Gamma$-limits

Ensuring non-interpenetration of matter is a fundamental prerequisite when modeling the deformation response of solid materials. In this contribution, we thoroughly examine how this requirement, equivalent to the injectivity of deformations within bulk structures, manifests itself in dimensional-reduction problems. Specifically, we focus on the case of rods embedded in a two-dimensional plane. Our results focus on $\Gamma$-limits of energy functionals that enforce an admissible deformation to be a homeomorphism. These $\Gamma$-limits are evaluated along a passage from the bulk configuration to the rod arrangement. The proofs rely on the equivalence between the weak and strong closures of the set of homeomorphisms from $\mathbb{R}$ to $\mathbb{R}^2$, a result that is of independent interest and that we establish in this paper, too.
Self-Alignment of Large Language Models via Monopolylogue-based Social Scene Simulation

Aligning large language models (LLMs) with human values is imperative to mitigate potential adverse effects resulting from their misuse. Drawing from the sociological insight that acknowledging all parties' concerns is a key factor in shaping human values, this paper proposes a novel direction to align LLMs by themselves: social scene simulation. To achieve this, we present MATRIX, a novel social scene simulator that emulates realistic scenes around a user's input query, enabling the LLM to take social consequences into account before responding. MATRIX serves as a virtual rehearsal space, akin to a Monopolylogue, where the LLM performs diverse roles related to the query and practice by itself. To inject this alignment, we fine-tune the LLM with MATRIX-simulated data, ensuring adherence to human values without compromising inference speed. We theoretically show that the LLM with MATRIX outperforms Constitutional AI under mild assumptions. Finally, extensive experiments validate that our method outperforms over 10 baselines across 4 benchmarks. As evidenced by 875 user ratings, our tuned 13B-size LLM exceeds GPT-4 in aligning with human values. Our project page is available at https://shuotang123.github. io/MATRIX.
Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networks

Stochastic gradient descent (SGD) optimization methods such as the plain vanilla SGD method and the popular Adam optimizer are nowadays the method of choice in the training of artificial neural networks (ANNs). Despite the remarkable success of SGD methods in the ANN training in numerical simulations, it remains in essentially all practical relevant scenarios an open problem to rigorously explain why SGD methods seem to succeed to train ANNs. In particular, in most practically relevant supervised learning problems, it seems that SGD methods do with high probability not converge to global minimizers in the optimization landscape of the ANN training problem. Nevertheless, it remains an open problem of research to disprove the convergence of SGD methods to global minimizers. In this work we solve this research problem in the situation of shallow ANNs with the rectified linear unit (ReLU) and related activations with the standard mean square error loss by disproving in the training of such ANNs that SGD methods (such as the plain vanilla SGD, the momentum SGD, the AdaGrad, the RMSprop, and the Adam optimizers) can find a global minimizer with high probability. Even stronger, we reveal in the training of such ANNs that SGD methods do with high probability fail to converge to global minimizers in the optimization landscape. The findings of this work do, however, not disprove that SGD methods succeed to train ANNs since they do not exclude the possibility that SGD methods find good local minimizers whose risk values are close to the risk values of the global minimizers. In this context, another key contribution of this work is to establish the existence of a hierarchical structure of local minimizers with distinct risk values in the optimization landscape of ANN training problems with ReLU and related activations.