Miracle-dz/UniFAR-FTUs huggingface dataset:
SwinTextSpotter v2: Towards Better Synergy for Scene Text Spotting

End-to-end scene text spotting, which aims to read the text in natural images, has garnered significant attention in recent years. However, recent state-of-the-art methods usually incorporate detection and recognition simply by sharing the backbone, which does not directly take advantage of the feature interaction between the two tasks. In this paper, we propose a new end-to-end scene text spotting framework termed SwinTextSpotter v2, which seeks to find a better synergy between text detection and recognition. Specifically, we enhance the relationship between two tasks using novel Recognition Conversion and Recognition Alignment modules. Recognition Conversion explicitly guides text localization through recognition loss, while Recognition Alignment dynamically extracts text features for recognition through the detection predictions. This simple yet effective design results in a concise framework that requires neither an additional rectification module nor character-level annotations for the arbitrarily-shaped text. Furthermore, the parameters of the detector are greatly reduced without performance degradation by introducing a Box Selection Schedule. Qualitative and quantitative experiments demonstrate that SwinTextSpotter v2 achieved state-of-the-art performance on various multilingual (English, Chinese, and Vietnamese) benchmarks. The code will be available at \href{https://github.com/mxin262/SwinTextSpotterv2}{SwinTextSpotter v2}.
CANDLE: Iterative Conceptualization and Instantiation Distillation from Large Language Models for Commonsense Reasoning

The sequential process of conceptualization and instantiation is essential to generalizable commonsense reasoning as it allows the application of existing knowledge to unfamiliar scenarios. However, existing works tend to undervalue the step of instantiation and heavily rely on pre-built concept taxonomies and human annotations to collect both types of knowledge, resulting in a lack of instantiated knowledge to complete reasoning, high cost, and limited scalability. To tackle these challenges, we introduce CANDLE, a distillation framework that iteratively performs contextualized conceptualization and instantiation over commonsense knowledge bases by instructing large language models to generate both types of knowledge with critic filtering. By applying CANDLE to ATOMIC, we construct a comprehensive knowledge base comprising six million conceptualizations and instantiated commonsense knowledge triples. Both types of knowledge are firmly rooted in the original ATOMIC dataset, and intrinsic evaluations demonstrate their exceptional quality and diversity. Empirical results indicate that distilling CANDLE on student models provides benefits across four downstream tasks. Our code, data, and models are publicly available at https://github.com/HKUST-KnowComp/CANDLE.
Ultra-broadband Optical Diffraction Tomography

Optical diffraction tomography (ODT) is a powerful non-invasive 3D imaging technique, but its combination with broadband light sources is difficult. In this study, we introduce ultrabroadband ODT, covering over 150 nm of visible spectral bandwidth with a lateral spatial resolution of 150 nm. Our work addresses a critical experimental gap by enabling the measurement of broadband refractive index changes in 3D samples, a crucial information that is difficult to assess with existing methodologies. We present spectrally resolved ODT images of HeLa cells, obtained via pulse-shaping based Fourier transform spectroscopy. We, further, conduct comparative experiments using gold-nanoparticle incubated as well as non-incubated cells. The spectral observations enabled by ultrabroadband ODT, combined with material-dependent refractive index responses, allow for precise three-dimensional identification of the nano-particles within cellular structures. Our work represents a crucial step towards spectrally and time-resolved tomography of complex 3D structures with implications for life and materials science applications.
Little Sac River Watershed: Fecal Coliform Total Maximum Daily Load

The Environmental Protection Agency Region 7 through the Missouri Department of Natural Resources has provided partial funding for this project under Section 319 of the Clean Water Act through a grant entitled “Integrated analysis of the Little Sac Watershed”. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the authors and do not necessarily reflect the view of the Missouri Department of Natural Resources or the U.S. Environmental Protection Agency.
Nanoantennas and Nanoradars: The Future of Integrated Sensing and Communication at the Nanoscale

Nanoantennas, operating at optical frequencies, are a transformative technology with broad applications in 6G wireless communication, IoT, smart cities, healthcare, and medical imaging. This paper explores their fundamental aspects, applications, and advancements, aiming for a comprehensive understanding of their potential in various applications. It begins by investigating macroscopic and microscopic Maxwell's equations governing electromagnetic wave propagation at different scales. The study emphasizes the critical role of Surface Plasmon Polariton (SPP) wave propagation in enhancing light-matter interactions, contributing to high data rates, and enabling miniaturization. Additionally, it explores using two-dimensional materials like graphene for enhanced control in terahertz communication and sensing. The paper also introduces the employment of nanoantennas as the main building blocks of Nano-scale Radar (NR) systems for the first time in the literature. NRs, integrated with communication signals, promise accurate radar sensing for nanoparticles inside a nano-channel, making them a potential future application in integrated sensing and communication (ISAC) systems. These nano-scale radar systems detect and extract physical or electrical properties of nanoparticles through transmitting, receiving, and processing electromagnetic waves at ultra-high frequencies in the optical range. This task requires nanoantennas as transmitters/receivers/transceivers, sharing the same frequency band and hardware for high-performance sensing and resolution.
Peramalan Harga Saham Jakarta Islamic Index Menggunakan Metode Vector Autoregressive

Saham merupakan instrumen investasi yang banyak dipilih para investor, karena saham mampu memberikan tingkat keuntungan yang menarik. Sejak 12 Mei 2011, Bursa Efek Indonesia (BEI) mempunyai dua indeks harga saham Syariah, yaitu Indeks Saham Syariah Indonesia (ISSI) dan Jakarta Islamic Index (JII). Saham-saham dalam indeks ini mempunyai keistimewaan yaitu memiliki tingkat hutang yang rendah, sehingga risiko dalam berinvestasi semakin terkendali [1]. Terdapat 8 sektor di dalam indeks JII salah satunya adalah sektor properti. Perkembangan industri properti dan real estate menunjukkan pertumbuhan yang sangat pesat. Hal ini ditandai dengan maraknya pembangunan perumahan, apertemen, perkantoran dan perhotelan di kota-kota besar. fluktuasi harga saham sektor properti merupakan salah satu masalah bagi investor dalam menjual atau membeli saham sehingga diperlukan analisis untuk meramalkan harga saham guna meminimalkan risiko yang diperoleh. Metode VAR adalah metode yang digunakan untuk meramalkan data dua variabel atau lebih yang memiliki hubungan timbal balik. Berdasarkan analisis peramalan harga saham sub sektor properti dan real estate dengan metode VAR maka dapat diketahui model akhir yang terbentuk adalah VARX (1,1) dengan RMSE 3 periode ke depan variabel ASRI sebesar 6,2, BSDE sebesar 22,4, LPKR sebesar 22,7, PWON sebesar 12,8, dan SMRA sebesar 14,2
Promptly Predicting Structures: The Return of Inference

Prompt-based methods have been used extensively across NLP to build zero- and few-shot label predictors. Many NLP tasks are naturally structured: that is, their outputs consist of multiple labels which constrain each other. Annotating data for such tasks can be cumbersome. Can the promise of the prompt-based paradigm be extended to such structured outputs? In this paper, we present a framework for constructing zero- and few-shot linguistic structure predictors. Our key insight is that we can use structural constraints -- and combinatorial inference derived from them -- to filter out inconsistent structures predicted by large language models. We instantiated this framework on two structured prediction tasks, and five datasets. Across all cases, our results show that enforcing consistency not only constructs structurally valid outputs, but also improves performance over the unconstrained variants.
An Infinite Double Bubble Theorem

The classical double bubble theorem characterizes the minimizing partitions of $\mathbb{R}^n$ into three chambers, two of which have prescribed finite volume. In this paper we prove a variant of the double bubble theorem in which two of the chambers have infinite volume. Such a configuration is an example of a (1,2)-cluster, or a partition of $\mathbb{R}^n$ into three chambers, two of which have infinite volume and only one of which has finite volume. A $(1,2)$-cluster is locally minimizing with respect to a family of weights $\{c_{jk}\}$ if for any $B_r(0)$, it minimizes the interfacial energy $\sum_{j<k} c_{jk} \mathscr{H}^n(\partial \mathscr{X}(j) \cap \partial\mathscr{X}(k) \cap B_r(0))$ among all variations with compact support in $B_r(0)$ which preserve the volume of $\mathscr{X}(1)$. For $(1,2)$ clusters, the analogue of the weighted double bubble is the weighted lens cluster, and we show that it is locally minimizing. Furthermore, under a symmetry assumption on $\{c_{jk}\}$ that includes the case of equal weights, the weighted lens cluster is the unique local minimizer in $\mathbb{R}^n$ for $n\leq 7$, with the same uniqueness holding in $\mathbb{R}^n$ for $n\geq 8$ under a natural growth assumption. We also obtain a closure theorem for locally minimizing $(N,2)$-clusters.
Cross Domain Early Crop Mapping using CropGAN and CNN Classifier

Driven by abundant satellite imagery, machine learning-based approaches have recently been promoted to generate high-resolution crop cultivation maps to support many agricultural applications. One of the major challenges faced by these approaches is the limited availability of ground truth labels. In the absence of ground truth, existing work usually adopts the"direct transfer strategy"that trains a classifier using historical labels collected from other regions and then applies the trained model to the target region. Unfortunately, the spectral features of crops exhibit inter-region and inter-annual variability due to changes in soil composition, climate conditions, and crop progress, the resultant models perform poorly on new and unseen regions or years. This paper presents the Crop Generative Adversarial Network (CropGAN) to address the above cross-domain issue. Our approach does not need labels from the target domain. Instead, it learns a mapping function to transform the spectral features of the target domain to the source domain (with labels) while preserving their local structure. The classifier trained by the source domain data can be directly applied to the transformed data to produce high-accuracy early crop maps of the target domain. Comprehensive experiments across various regions and years demonstrate the benefits and effectiveness of the proposed approach. Compared with the widely adopted direct transfer strategy, the F1 score after applying the proposed CropGAN is improved by 13.13% - 50.98%
Reinforcement Learning from LLM Feedback to Counteract Goal Misgeneralization

We introduce a method to address goal misgeneralization in reinforcement learning (RL), leveraging Large Language Model (LLM) feedback during training. Goal misgeneralization, a type of robustness failure in RL occurs when an agent retains its capabilities out-of-distribution yet pursues a proxy rather than the intended one. Our approach utilizes LLMs to analyze an RL agent's policies during training and identify potential failure scenarios. The RL agent is then deployed in these scenarios, and a reward model is learnt through the LLM preferences and feedback. This LLM-informed reward model is used to further train the RL agent on the original dataset. We apply our method to a maze navigation task, and show marked improvements in goal generalization, especially in cases where true and proxy goals are somewhat distinguishable and behavioral biases are pronounced. This study demonstrates how the LLM, despite its lack of task proficiency, can efficiently supervise RL agents, providing scalable oversight and valuable insights for enhancing goal-directed learning in RL through the use of LLMs.
SemEval-2017 Task 4: Sentiment Analysis in Twitter using BERT

This paper uses the BERT model, which is a transformer-based architecture, to solve task 4A, English Language, Sentiment Analysis in Twitter of SemEval2017. BERT is a very powerful large language model for classification tasks when the amount of training data is small. For this experiment, we have used the BERT{\textsubscript{\tiny BASE}} model, which has 12 hidden layers. This model provides better accuracy, precision, recall, and f1 score than the Naive Bayes baseline model. It performs better in binary classification subtasks than the multi-class classification subtasks. We also considered all kinds of ethical issues during this experiment, as Twitter data contains personal and sensible information. The dataset and code used in our experiment can be found in this GitHub repository.
Study Features via Exploring Distribution Structure

In this paper, we present a novel framework for data redundancy measurement based on probabilistic modeling of datasets, and a new criterion for redundancy detection that is resilient to noise. We also develop new methods for data redundancy reduction using both deterministic and stochastic optimization techniques. Our framework is flexible and can handle different types of features, and our experiments on benchmark datasets demonstrate the effectiveness of our methods. We provide a new perspective on feature selection, and propose effective and robust approaches for both supervised and unsupervised learning problems.
CAC 2.0: A Corrupt and Correct Logic Locking Technique Resilient to Structural Analysis Attacks

Logic locking proposed to protect integrated circuits from serious hardware threats has been studied extensively over a decade. In these years, many efficient logic locking techniques have been proven to be broken. The state-of-the-art logic locking techniques, including the prominent corrupt and correct (CAC) technique, are resilient to satisfiability (SAT)-based and removal attacks, but vulnerable to structural analysis attacks. To overcome this drawback, this paper introduces an improved version of CAC, called CAC 2.0, which increases the search space of structural analysis attacks using obfuscation. To do so, CAC 2.0 locks the original circuit twice, one after another, on different nodes with different number of protected primary inputs using CAC, while hiding original protected primary inputs among decoy primary inputs. This paper also introduces an open source logic locking tool, called HIID, equipped with well-known techniques including CAC 2.0. Our experiments show that CAC 2.0 is resilient to existing SAT-based, removal, and structural analysis attacks. To achieve this, it increases the number of key inputs at most 4x and the gate-level area between 30.2% and 0.8% on circuits with low and high complexity with respect to CAC.
Multiple frequency steps in synthetic antiferromagnet based double spin josephson junctions using CoFeB and Fe3Sn

Superconducting quantum interference device (SQUID) which is made of two parallel Josephson junctions has applications in magnetometry. A similar spin-based device is proposed here where spin superfluid in ferromagnet (FM) mimics the superconducting state. Two materials CoFeB and Fe3Sn are used for spin superfluid-based SQUID like device where easy plane anisotropy in CoFeB can be engineered and Fe3Sn has inherent easy plane anisotropy. Frequency varies in spin based proposed devices. Frequency increases and again decreases with the increase in both applied magnetic field and applied spin current. The proposed device can be used as nano oscillator and detector. The frequency in the proposed device shows multiple frequency steps which can be used for neuromorphic applications.
Inference for Synthetic Controls via Refined Placebo Tests

The synthetic control method is often applied to problems with one treated unit and a small number of control units. A common inferential task in this setting is to test null hypotheses regarding the average treatment effect on the treated. Inference procedures that are justified asymptotically are often unsatisfactory due to (1) small sample sizes that render large-sample approximation fragile and (2) simplification of the estimation procedure that is implemented in practice. An alternative is permutation inference, which is related to a common diagnostic called the placebo test. It has provable Type-I error guarantees in finite samples without simplification of the method, when the treatment is uniformly assigned. Despite this robustness, the placebo test suffers from low resolution since the null distribution is constructed from only $N$ reference estimates, where $N$ is the sample size. This creates a barrier for statistical inference at a common level like $\alpha = 0.05$, especially when $N$ is small. We propose a novel leave-two-out procedure that bypasses this issue, while still maintaining the same finite-sample Type-I error guarantee under uniform assignment for a wide range of $N$. Unlike the placebo test whose Type-I error always equals the theoretical upper bound, our procedure often achieves a lower unconditional Type-I error than theory suggests; this enables useful inference in the challenging regime when $\alpha<1/N$. Empirically, our procedure achieves a higher power when the effect size is reasonably large and a comparable power otherwise. We generalize our procedure to non-uniform assignments and show how to conduct sensitivity analysis. From a methodological perspective, our procedure can be viewed as a new type of randomization inference different from permutation or rank-based inference, which is particularly effective in small samples.
Understanding Nonlinear Collaboration between Human and AI Agents: A Co-design Framework for Creative Design

Creative design is a nonlinear process where designers generate diverse ideas in the pursuit of an open-ended goal and converge towards consensus through iterative remixing. In contrast, AI-powered design tools often employ a linear sequence of incremental and precise instructions to approximate design objectives. Such operations violate customary creative design practices and thus hinder AI agents' ability to complete creative design tasks. To explore better human-AI co-design tools, we first summarize human designers' practices through a formative study with 12 design experts. Taking graphic design as a representative scenario, we formulate a nonlinear human-AI co-design framework and develop a proof-of-concept prototype, OptiMuse. We evaluate OptiMuse and validate the nonlinear framework through a comparative study. We notice a subconscious change in people's attitudes towards AI agents, shifting from perceiving them as mere executors to regarding them as opinionated colleagues. This shift effectively fostered the exploration and reflection processes of individual designers.
Towards Effective Image Forensics via A Novel Computationally Efficient Framework and A New Image Splice Dataset

Splice detection models are the need of the hour since splice manipulations can be used to mislead, spread rumors and create disharmony in society. However, there is a severe lack of image splicing datasets, which restricts the capabilities of deep learning models to extract discriminative features without overfitting. This manuscript presents two-fold contributions toward splice detection. Firstly, a novel splice detection dataset is proposed having two variants. The two variants include spliced samples generated from code and through manual editing. Spliced images in both variants have corresponding binary masks to aid localization approaches. Secondly, a novel Spatio-Compression Lightweight Splice Detection Framework is proposed for accurate splice detection with minimum computational cost. The proposed dual-branch framework extracts discriminative spatial features from a lightweight spatial branch. It uses original resolution compression data to extract double compression artifacts from the second branch, thereby making it 'information preserving. ' Several CNNs are tested in combination with the proposed framework on a composite dataset of images from the proposed dataset and the CASIA v2.0 dataset. The best model accuracy of 0.9382 is achieved and compared with similar state-of-the-art methods, demonstrating the superiority of the proposed framework.
A tensor Alternating Anderson-Richardson method for solving multilinear systems with M-tensors

It is well-known that a multilinear system with a nonsingular M-tensor and a positive right-hand side has a unique positive solution. Tensor splitting methods generalizing the classical iterative methods for linear systems have been proposed for finding the unique positive solution. The Alternating Anderson-Richardson (AAR) method is an effective method to accelerate the classical iterative methods. In this study, we apply the idea of AAR for finding the unique positive solution quickly. We first present a tensor Richardson method based on tensor regular splittings, then apply Anderson acceleration to the tensor Richardson method and derive a tensor Anderson-Richardson method, finally, we periodically employ the tensor Anderson-Richardson method within the tensor Richardson method and propose a tensor AAR method. Numerical experiments show that the proposed method is effective in accelerating tensor splitting methods.
Predicting Next Useful Location With Context-Awareness: The State-Of-The-Art

Predicting the future location of mobile objects reinforces location-aware services with proactive intelligence and helps businesses and decision-makers with better planning and near real-time scheduling in different applications such as traffic congestion control, location-aware advertisements, and monitoring public health and well-being. The recent developments in the smartphone and location sensors technology and the prevalence of using location-based social networks alongside the improvements in artificial intelligence and machine learning techniques provide an excellent opportunity to exploit massive amounts of historical and real-time contextual information to recognise mobility patterns and achieve more accurate and intelligent predictions. This survey provides a comprehensive overview of the next useful location prediction problem with context-awareness. First, we explain the concepts of context and context-awareness and define the next location prediction problem. Then we analyse nearly thirty studies in this field concerning the prediction method, the challenges addressed, the datasets and metrics used for training and evaluating the model, and the types of context incorporated. Finally, we discuss the advantages and disadvantages of different approaches, focusing on the usefulness of the predicted location and identifying the open challenges and future work on this subject by introducing two potential use cases of next location prediction in the automotive industry.