Miracle-dz/UniFAR-FTUs huggingface dataset:
Nowhere dense Ramsey sets

A set of points $S$ in Euclidean space $\mathbb{R}^d$ is called \textit{Ramsey} if any finite partition of $\mathbb{R}^{\infty}$ yields a monochromatic copy of $S$. While characterization of Ramsey set remains a major open problem in the area, a stronger ``density'' concept was considered in [J. Amer. Math. Soc. 3, 1--7, 1990]: If $S$ is a $d$-dimensional simplex, then for any $\mu>0$ there is an integer $d:=d(S,\mu)$ and finite configuration $X\subseteq \mathbb{R}^d$ such that any subconfiguration $Y\subseteq X$ with $|Y|\geq \mu |X|$ contains a copy of $S$. Complementing this, here we show the existence of $\mu:=\mu(S)$ and of an infinite configuration $X\subseteq \mathbb{R}^{\infty}$ with the property that any finite coloring of $X$ yields a monochromatic copy of $S$, yet for any finite set of points $Y\subseteq X$ contains a subset $Z\subseteq Y$ of size $|Z|\geq \mu |Y|$ without a copy of $S$.
In-plane ordering and tunable magnetism in Cr-based MXenes

MXene, the two-dimensional derivatives of MAX compounds, due to their structural and compositional flexibility, is an ideal family of compounds to study a number of structure-property relations. In this work, we have investigated the tunability of magnetic properties in Cr-based MXenes that have an in-plane ordering arising out of alloying Cr with another non-magnetic transition metal atom. Using Density Functional Theory based calculations we have explored the effects of composition and surface functionalisations on the electronic and magnetic properties of these in-plane ordered MXenes known as i-MXenes. We found that the electronic and magnetic ground states are quite sensitive to the structure and composition. This provides enough tunability in these compounds so that they can be used for practical applications. Our calculated results of magnetic transition temperatures and magnetic anisotropy energies are comparable to many a established two-dimensional magnets. These put together widen the prospect of these i-MXenes for multiple usage as magnetic devices making them attractive for further investigation.
Deep Learning-Based Speech and Vision Synthesis to Improve Phishing Attack Detection through a Multi-layer Adaptive Framework

The ever-evolving ways attacker continues to im prove their phishing techniques to bypass existing state-of-the-art phishing detection methods pose a mountain of challenges to researchers in both industry and academia research due to the inability of current approaches to detect complex phishing attack. Thus, current anti-phishing methods remain vulnerable to complex phishing because of the increasingly sophistication tactics adopted by attacker coupled with the rate at which new tactics are being developed to evade detection. In this research, we proposed an adaptable framework that combines Deep learning and Randon Forest to read images, synthesize speech from deep-fake videos, and natural language processing at various predictions layered to significantly increase the performance of machine learning models for phishing attack detection.
Advanced Academic Team Worker Recommendation Models

Collaborator recommendation is an important task in academic domain. Most of the existing approaches have the assumption that the recommendation system only need to recommend a specific researcher for the task. However, academic successes can be owed to productive collaboration of a whole academic team. In this work, we propose a new task: academic team worker recommendation: with a given status: student, assistant professor or prime professor, research interests and specific task, we can recommend an academic team formed as (prime professor, assistant professor, student). For this task, we propose a model CQBG-R(Citation-Query Blended Graph-Ranking). The key ideas is to combine the context of the query and the papers with the graph topology to form a new graph(CQBG), which can target at the research interests and the specific research task for this time. The experiment results show the effectiveness of the proposed method.
Deterministic Cache-Oblivious Funnelselect

In the multiple-selection problem one is given an unsorted array $S$ of $N$ elements and an array of $q$ query ranks $r_1<\cdots<r_q$, and the task is to return, in sorted order, the $q$ elements in $S$ of rank $r_1, \ldots, r_q$, respectively. The asymptotic deterministic comparison complexity of the problem was settled by Dobkin and Munro [JACM 1981]. In the I/O model an optimal I/O complexity was achieved by Hu et al. [SPAA 2014]. Recently [ESA 2023], we presented a cache-oblivious algorithm with matching I/O complexity, named funnelselect, since it heavily borrows ideas from the cache-oblivious sorting algorithm funnelsort from the seminal paper by Frigo, Leiserson, Prokop and Ramachandran [FOCS 1999]. Funnelselect is inherently randomized as it relies on sampling for cheaply finding many good pivots. In this paper we present deterministic funnelselect, achieving the same optional I/O complexity cache-obliviously without randomization. Our new algorithm essentially replaces a single (in expectation) reversed-funnel computation using random pivots by a recursive algorithm using multiple reversed-funnel computations. To meet the I/O bound, this requires a carefully chosen subproblem size based on the entropy of the sequence of query ranks; deterministic funnelselect thus raises distinct technical challenges not met by randomized funnelselect. The resulting worst-case I/O bound is $O\bigl(\sum_{i=1}^{q+1} \frac{\Delta_i}{B} \cdot \log_{M/B} \frac{N}{\Delta_i} + \frac{N}{B}\bigr)$, where $B$ is the external memory block size, $M\geq B^{1+\epsilon}$ is the internal memory size, for some constant $\epsilon>0$, and $\Delta_i = r_{i} - r_{i-1}$ (assuming $r_0=0$ and $r_{q+1}=N + 1$).
On short-time behavior of implied volatility in a market model with indexes

This paper investigates short-term behaviors of implied volatility of derivatives written on indexes in equity markets when the index processes are constructed by using a ranking procedure. Even in simple market settings where stock prices follow geometric Brownian motion dynamics, the ranking mechanism can produce the observed term structure of at-the-money (ATM) implied volatility skew for equity indexes. Our proposed models showcase the ability to reconcile two seemingly contradictory features found in empirical data from equity markets: the long memory of volatilities and the power law of ATM skews. Furthermore, the models allow for the capture of a novel phenomenon termed the quasi-blow-up phenomenon.
A stochastic perturbation approach to nonlinear bifurcating problems

Incorporating probabilistic terms in mathematical models is crucial for capturing and quantifying uncertainties in real-world systems. Indeed, randomness can have a significant impact on the behavior of the problem's solution, and a deeper analysis is needed to obtain more realistic and informative results. On the other hand, the investigation of stochastic models may require great computational resources due to the importance of generating numerous realizations of the system to have meaningful statistics. This makes the development of complexity reduction techniques, such as surrogate models, essential for enabling efficient and scalable simulations. In this work, we exploit polynomial chaos (PC) expansion to study the accuracy of surrogate representations for a bifurcating phenomena in fluid dynamics, namely the Coanda effect, where the stochastic setting gives a different perspective on the non-uniqueness of the solution. Then, its inclusion in the finite element setting is described, arriving to the formulation of the enhanced Spectral Stochastic Finite Element Method (SSFEM). Moreover, we investigate the connections between the deterministic bifurcation diagram and the PC polynomials, underlying their capability in reconstructing the whole solution manifold.
NFT1000: A Visual Text Dataset For Non-Fungible Token Retrieval

With the rise of 'Metaverse' and 'Web3.0', NFT ( Non-Fungible Token ) has emerged as a kind of pivotal digital asset, garnering significant attention. By the end of November 2023, more than 1.4 billion NFT tokens have been minted across various blockchain platforms. To effectively locate a satisfactory NFT token, conducting searches within the extensive array of NFT data is essential. The challenge in NFT retrieval is heightened due to the high degree of similarity among different NFT tokens, in terms of regional and semantic aspects. Achieving accurate and efficient retrieval within the large-scale, highly similar NFT data presents a formidable challenge for both the academic and industrial communities. In this paper, we will introduce a dataset named 'NFT Top1000 Visual Text Dataset'(henceforth, NFT1000), containing 7.56 million image-text pairs, and being collected from 1000 most famous PFP NFT collections by sales volume on the Ethereum blockchain. Based on the dataset, we test the CLIP (Contrastive Language-Image Pretraining) models as a baseline. Additionally, we also propose a concept of Comprehensive Variance Index (CVI in short), which is a robust metric designed to assess the similarity and retrieval difficulty of visual-text pairs data.
Consistency Matters: Explore LLMs Consistency From a Black-Box Perspective

Nowadays both commercial and open-source academic LLM have become the mainstream models of NLP. However, there is still a lack of research on LLM consistency, meaning that throughout the various stages of LLM research and deployment, its internal parameters and capabilities should remain unchanged. This issue exists in both the industrial and academic sectors. The solution to this problem is often time-consuming and labor-intensive, and there is also an additional cost of secondary deployment, resulting in economic and time losses. To fill this gap, we build an LLM consistency task dataset and design several baselines. Additionally, we choose models of diverse scales for the main experiments. Specifically, in the LightGBM experiment, we used traditional NLG metrics (i.e., ROUGE, BLEU, METEOR) as the features needed for model training. The final result exceeds the manual evaluation and GPT3.5 as well as other models in the main experiment, achieving the best performance. In the end, we use the best performing LightGBM model as the base model to build the evaluation tool, which can effectively assist in the deployment of business models. Our code and tool demo are available at https://github.com/heavenhellchen/Consistency.git
Model-based deep reinforcement learning for accelerated learning from flow simulations

In recent years, deep reinforcement learning has emerged as a technique to solve closed-loop flow control problems. Employing simulation-based environments in reinforcement learning enables a priori end-to-end optimization of the control system, provides a virtual testbed for safety-critical control applications, and allows to gain a deep understanding of the control mechanisms. While reinforcement learning has been applied successfully in a number of rather simple flow control benchmarks, a major bottleneck toward real-world applications is the high computational cost and turnaround time of flow simulations. In this contribution, we demonstrate the benefits of model-based reinforcement learning for flow control applications. Specifically, we optimize the policy by alternating between trajectories sampled from flow simulations and trajectories sampled from an ensemble of environment models. The model-based learning reduces the overall training time by up to $85\%$ for the fluidic pinball test case. Even larger savings are expected for more demanding flow simulations.
Tectonic Structures of Northern Sumatra Region Based on Seismic Tomography of P and S Wave Velocity

The tectonic setting of Sumatra Island is strongly influenced by the oblique subduction of the Indo-Australian Plate, which subducts the Eurasian Plate at a speed of 52–60 mm/year. The movement of these plates resulted in the Northern Sumatra region having seismic sources from tectonic and volcanic activity. The data used in this study is in the form of seismic wave travel-time recorded by numerous seismic stations in the research area from January 2012 to December 2020. The data comes from 5,003 earthquakes recorded by the BMKG seismic network. The inversion is a simultaneous inversion between seismic velocity models (Vp and Vs) and hypocenter parameters by applying a double-difference seismic tomography algorithm. Tomogram results in parts of Aceh (Singkil and Subulussalam) and North Sumatra (Pakpak Bharat and Dairi) at a depth of 0 km show negative perturbations in Vp and Vs values and high Vp/Vs values. The anomaly is most likely related to cracks in fluid-saturated rocks. The tomograms in the south of Lake Toba at depths of 30 km and 40 km have high Vp and Vs perturbation values and low Vp/Vs values. This anomaly indicates a magma supply line that is no longer active or has cooled for a long time. Based on the seismic tomography modeling results, the subducted Indo-Australian Plate to the Eurasian Plate is visible in the study area.
RoCoIns: Enhancing Robustness of Large Language Models through Code-Style Instructions

Large Language Models (LLMs) have showcased remarkable capabilities in following human instructions. However, recent studies have raised concerns about the robustness of LLMs when prompted with instructions combining textual adversarial samples. In this paper, drawing inspiration from recent works that LLMs are sensitive to the design of the instructions, we utilize instructions in code style, which are more structural and less ambiguous, to replace typically natural language instructions. Through this conversion, we provide LLMs with more precise instructions and strengthen the robustness of LLMs. Moreover, under few-shot scenarios, we propose a novel method to compose in-context demonstrations using both clean and adversarial samples (\textit{adversarial context method}) to further boost the robustness of the LLMs. Experiments on eight robustness datasets show that our method consistently outperforms prompting LLMs with natural language instructions. For example, with gpt-3.5-turbo, our method achieves an improvement of 5.68\% in test set accuracy and a reduction of 5.66 points in Attack Success Rate (ASR).
PHNet: Patch-based Normalization for Portrait Harmonization

A common problem for composite images is the incompatibility of their foreground and background components. Image harmonization aims to solve this problem, making the whole image look more authentic and coherent. Most existing solutions predict lookup tables (LUTs) or reconstruct images, utilizing various attributes of composite images. Recent approaches have primarily focused on employing global transformations like normalization and color curve rendering to achieve visual consistency, and they often overlook the importance of local visual coherence. We present a patch-based harmonization network consisting of novel Patch-based normalization (PN) blocks and a feature extractor based on statistical color transfer. Extensive experiments demonstrate the network's high generalization capability for different domains. Our network achieves state-of-the-art results on the iHarmony4 dataset. Also, we created a new human portrait harmonization dataset based on FFHQ and checked the proposed method to show the generalization ability by achieving the best metrics on it. The benchmark experiments confirm that the suggested patch-based normalization block and feature extractor effectively improve the network's capability to harmonize portraits. Our code and model baselines are publicly available.
Quasinormal modes of the Schwarzchild black hole with a deficit solid angle and quintessence-like matter: Improved asymptotic iteration method

We study the quasinormal modes (QNM) for scalar, and electromagnetic perturbations in the Schwarzchild black hole with a deficit solid angle and quintessence-like matter. Using the sixth--order WKB approximation and the improved asymptotic iteration method (AIM) we can determine the dependence of the quasinormal modes on the parameters of the black hole and the parameters on the test fields. The values of the real part and imaginary parts of the quasi--normal modes increase with the decrease of the values of the deficit solid angle and density of quintessence-like matter. The quasinormal modes gotten by these two methods are in good agreement. Using the finite difference method, we obtain the time evolution profile of such perturbations in this Black Hole.
Political Compass or Spinning Arrow? Towards More Meaningful Evaluations for Values and Opinions in Large Language Models

Much recent work seeks to evaluate values and opinions in large language models (LLMs) using multiple-choice surveys and questionnaires. Most of this work is motivated by concerns around real-world LLM applications. For example, politically-biased LLMs may subtly influence society when they are used by millions of people. Such real-world concerns, however, stand in stark contrast to the artificiality of current evaluations: real users do not typically ask LLMs survey questions. Motivated by this discrepancy, we challenge the prevailing constrained evaluation paradigm for values and opinions in LLMs and explore more realistic unconstrained evaluations. As a case study, we focus on the popular Political Compass Test (PCT). In a systematic review, we find that most prior work using the PCT forces models to comply with the PCT's multiple-choice format. We show that models give substantively different answers when not forced; that answers change depending on how models are forced; and that answers lack paraphrase robustness. Then, we demonstrate that models give different answers yet again in a more realistic open-ended answer setting. We distill these findings into recommendations and open challenges in evaluating values and opinions in LLMs.
Distortion-Controlled Dithering with Reduced Recompression Rate

Dithering is a technique that can improve human perception of low-resolution data by reducing quantization artifacts. In this work we formalize and analytically justify two metrics for quantization artifact prominence, using them to design a novel dithering method for distortion-controlled data compression. We present theoretical entropy calculations for this dither and experimentally validate its performance on a low-rate image compression task. The result is a drastic improvement in the perceptual quality of quantized images with a lower recompression entropy than any state-of-the-art dither technique, achieving 45 points lower PIQUE at the same rate or 40% lower rate at the same PIQUE. The proposed dither is an adaptable tool applicable for use in any lossy compression system, permitting precise control of rate-distortion characteristics for both compression and recompression.
Enhancing Retrieval Processes for Language Generation with Augmented Queries

In the rapidly changing world of smart technology, searching for documents has become more challenging due to the rise of advanced language models. These models sometimes face difficulties, like providing inaccurate information, commonly known as"hallucination. "This research focuses on addressing this issue through Retrieval-Augmented Generation (RAG), a technique that guides models to give accurate responses based on real facts. To overcome scalability issues, the study explores connecting user queries with sophisticated language models such as BERT and Orca2, using an innovative query optimization process. The study unfolds in three scenarios: first, without RAG, second, without additional assistance, and finally, with extra help. Choosing the compact yet efficient Orca2 7B model demonstrates a smart use of computing resources. The empirical results indicate a significant improvement in the initial language model's performance under RAG, particularly when assisted with prompts augmenters. Consistency in document retrieval across different encodings highlights the effectiveness of using language model-generated queries. The introduction of UMAP for BERT further simplifies document retrieval while maintaining strong results.
LLM-based Privacy Data Augmentation Guided by Knowledge Distillation with a Distribution Tutor for Medical Text Classification

As sufficient data are not always publically accessible for model training, researchers exploit limited data with advanced learning algorithms or expand the dataset via data augmentation (DA). Conducting DA in private domain requires private protection approaches (i.e. anonymization and perturbation), but those methods cannot provide protection guarantees. Differential privacy (DP) learning methods theoretically bound the protection but are not skilled at generating pseudo text samples with large models. In this paper, we transfer DP-based pseudo sample generation task to DP-based generated samples discrimination task, where we propose a DP-based DA method with a LLM and a DP-based discriminator for text classification on private domains. We construct a knowledge distillation model as the DP-based discriminator: teacher models, accessing private data, teaches students how to select private samples with calibrated noise to achieve DP. To constrain the distribution of DA's generation, we propose a DP-based tutor that models the noised private distribution and controls samples' generation with a low privacy cost. We theoretically analyze our model's privacy protection and empirically verify our model.
SmartTrim: Adaptive Tokens and Attention Pruning for Efficient Vision-Language Models

Despite achieving remarkable performance on various vision-language tasks, Transformer-based Vision-Language Models (VLMs) suffer from redundancy in inputs and parameters, significantly hampering their efficiency in real-world applications. Moreover, the degree of redundancy in token representations and model parameters, such as attention heads, varies significantly for different inputs. In light of the challenges, we propose SmartTrim, an adaptive acceleration framework for VLMs, which adjusts the computational overhead per instance. Specifically, we integrate lightweight modules into the original backbone to identify and prune redundant token representations and attention heads within each layer. Furthermore, we devise a self-distillation strategy to enhance the consistency between the predictions of the pruned model and its fully-capacity counterpart. Experimental results across various vision-language tasks consistently demonstrate that SmartTrim accelerates the original model by 2-3 times with minimal performance degradation, highlighting the effectiveness and efficiency compared to previous approaches. Code will be available at https://github.com/kugwzk/SmartTrim.
A Piece of Theatre: Investigating How Teachers Design LLM Chatbots to Assist Adolescent Cyberbullying Education

Cyberbullying harms teenagers' mental health, and teaching them upstanding intervention is crucial. Wizard-of-Oz studies show chatbots can scale up personalized and interactive cyberbullying education, but implementing such chatbots is a challenging and delicate task. We created a no-code chatbot design tool for K-12 teachers. Using large language models and prompt chaining, our tool allows teachers to prototype bespoke dialogue flows and chatbot utterances. In offering this tool, we explore teachers' distinctive needs when designing chatbots to assist their teaching, and how chatbot design tools might better support them. Our findings reveal that teachers welcome the tool enthusiastically. Moreover, they see themselves as playwrights guiding both the students' and the chatbot's behaviors, while allowing for some improvisation. Their goal is to enable students to rehearse both desirable and undesirable reactions to cyberbullying in a safe environment. We discuss the design opportunities LLM-Chains offer for empowering teachers and the research opportunities this work opens up.