Miracle-dz/UniFAR-FTUs huggingface dataset:
Covering Rectilinear Polygons with Area-Weighted Rectangles

Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned rectangles such that the total weight of the rectangles in the cover is minimized. Already the unit-weight case is known to be NP-hard and the general problem has, to the best of our knowledge, not been studied experimentally before. We show a new basic property of optimal solutions of the weighted problem. This allows us to speed up existing algorithms for the unit-weight case, obtain an improved ILP formulation for both the weighted and unweighted problem, and develop several approximation algorithms and heuristics for the weighted case. All our algorithms are evaluated in a large experimental study on 186 837 polygons combined with six cost functions, which provides evidence that our algorithms are both fast and yield close-to-optimal solutions in practice.
DVQI: A Multi-task, Hardware-integrated Artificial Intelligence System for Automated Visual Inspection in Electronics Manufacturing

As electronics manufacturers continue to face pressure to increase production efficiency amid difficulties with supply chains and labour shortages, many printed circuit board assembly (PCBA) manufacturers have begun to invest in automation and technological innovations to remain competitive. One such method is to leverage artificial intelligence (AI) to greatly augment existing manufacturing processes. In this paper, we present the DarwinAI Visual Quality Inspection (DVQI) system, a hardware-integration artificial intelligence system for the automated inspection of printed circuit board assembly defects in an electronics manufacturing environment. The DVQI system enables multi-task inspection via minimal programming and setup for manufacturing engineers while improving cycle time relative to manual inspection. We also present a case study of the deployed DVQI system's performance and impact for a top electronics manufacturer.
Low-rank constrained multichannel signal denoising considering channel-dependent sensitivity inspired by self-supervised learning for optical fiber sensing

Optical fiber sensing is a technology wherein audio, vibrations, and temperature are detected using an optical fiber; especially the audio/vibrations-aware sensing is called distributed acoustic sensing (DAS). In DAS, observed data, which is comprised of multichannel data, has suffered from severe noise levels because of the optical noise or the installation methods. In conventional methods for denoising DAS data, signal-processing- or deep-neural-network (DNN)-based models have been studied. The signal-processing-based methods have the interpretability, i.e., non-black box. The DNN-based methods are good at flexibility designing network architectures and objective functions, that is, priors. However, there is no balance between the interpretability and the flexibility of priors in the DAS studies. The DNN-based methods also require a large amount of training data in general. To address the problems, we propose a DNN-structure signal-processing-based denoising method in this paper. As the priors of DAS, we employ spatial knowledge; low rank and channel-dependent sensitivity using the DNN-based structure. The result of fiber-acoustic sensing shows that the proposed method outperforms the conventional methods and the robustness to the number of the spatial ranks. Moreover, the optimized parameters of the proposed method indicate the relationship with the channel sensitivity; the interpretability.
Probably approximately correct stability of allocations in uncertain coalitional games with private sampling

We study coalitional games with exogenous uncertainty in the coalition value, in which each agent is allowed to have private samples of the uncertainty. As a consequence, the agents may have a different perception of stability of the grand coalition. In this context, we propose a novel methodology to study the out-of-sample coalitional rationality of allocations in the set of stable allocations (i.e., the core). Our analysis builds on the framework of probably approximately correct learning. Initially, we state a priori and a posteriori guarantees for the entire core. Furthermore, we provide a distributed algorithm to compute a compression set that determines the generalization properties of the a posteriori statements. We then refine our probabilistic robustness bounds by specialising the analysis to a single payoff allocation, taking, also in this case, both a priori and a posteriori approaches. Finally, we consider a relaxed $\zeta$-core to include nearby allocations and also address the case of empty core. For this case, probabilistic statements are given on the eventual stability of allocations in the $\zeta$-core.
Boundary value problems for adjoint pairs of operators

The notion of quasi boundary triples and their Weyl functions from extension theory of symmetric operators is extended to the general framework of adjoint pairs of operators under minimal conditions on the boundary maps. With the help of the corresponding abstract Titchmarsh-Weyl $M$-functions sufficient conditions for the unique solvability of the related boundary value problems are obtained and the solutions are expressed via Krein-type resolvent formulae. The abstract theory developed in this manuscript can be applied to a large class of elliptic differential operators.
Revisiting Depth Completion from a Stereo Matching Perspective for Cross-domain Generalization

This paper proposes a new framework for depth completion robust against domain-shifting issues. It exploits the generalization capability of modern stereo networks to face depth completion, by processing fictitious stereo pairs obtained through a virtual pattern projection paradigm. Any stereo network or traditional stereo matcher can be seamlessly plugged into our framework, allowing for the deployment of a virtual stereo setup that is future-proof against advancement in the stereo field. Exhaustive experiments on cross-domain generalization support our claims. Hence, we argue that our framework can help depth completion to reach new deployment scenarios.
Exploration of visual prompt in Grounded pre-trained open-set detection

Text prompts are crucial for generalizing pre-trained open-set object detection models to new categories. However, current methods for text prompts are limited as they require manual feedback when generalizing to new categories, which restricts their ability to model complex scenes, often leading to incorrect detection results. To address this limitation, we propose a novel visual prompt method that learns new category knowledge from a few labeled images, which generalizes the pre-trained detection model to the new category. To allow visual prompts to represent new categories adequately, we propose a statistical-based prompt construction module that is not limited by predefined vocabulary lengths, thus allowing more vectors to be used when representing categories. We further utilize the category dictionaries in the pre-training dataset to design task-specific similarity dictionaries, which make visual prompts more discriminative. We evaluate the method on the ODinW dataset and show that it outperforms existing prompt learning methods and performs more consistently in combinatorial inference.
Acceptance and Trust: Drivers' First Contact with Released Automated Vehicles in Naturalistic Traffic

This study investigates the impact of initial contact of drivers with an SAE Level 3 Automated Driving System (ADS) under real traffic conditions, focusing on the Mercedes-Benz Drive Pilot in the EQS. It examines Acceptance, Trust, Usability, and User Experience. Although previous studies in simulated environments provided insights into human-automation interaction, real-world experiences can differ significantly. The research was conducted on a segment of German interstate with 30 participants lacking familiarity with Level 3 ADS. Pre- and post-driving questionnaires were used to assess changes in acceptance and confidence. Supplementary metrics included post-driving ratings for usability and user experience. Findings reveal a significant increase in acceptance and trust following the first contact, confirming results from prior simulator studies. Factors such as Performance Expectancy, Effort Expectancy, Facilitating Condition, Self-Efficacy, and Behavioral Intention to use the vehicle were rated higher after initial contact with the ADS. However, inadequate communication from the ADS to the human driver was detected, highlighting the need for improved communication to prevent misuse or confusion about the operating mode. Contrary to prior research, we found no significant impact of general attitudes towards technological innovation on acceptance and trust. However, it's worth noting that most participants already had a high affinity for technology. Although overall reception was positive and showed an upward trend post first contact, the ADS was also perceived as demanding as manual driving. Future research should focus on a more diverse participant sample and include longer or multiple real-traffic trips to understand behavioral adaptations over time.
Robust option pricing with volatility term structure -- An empirical study for variance options

The robust option pricing problem is to find upper and lower bounds on fair prices of financial claims using only the most minimal assumptions. It contrasts with the classical, model-based approach and gained prominence in the wake of the 2008 financial crisis, and can be used to understand the extent to which a model-based price is sensitive to the underlying model assumptions. Common approaches involve pricing exotic derivatives such as variance options by incorporating market data through implied volatility. The existing literature focuses largely on incorporating implied volatility information corresponding to the maturity of the exotic option. In this paper, we aim to explain how intermediate data can and should be incorporated. It is natural to expect that this additional information will improve the robust pricing bounds. To investigate this question, we consider variance options, where the bounds of the informed robust pricing problem are known. We proceed to conduct an empirical study uncovering a surprising finding: Contrary to common belief, the incorporation of more information does not lead to an improvement of the robust pricing bounds.
NestE: Modeling Nested Relational Structures for Knowledge Graph Reasoning

Reasoning with knowledge graphs (KGs) has primarily focused on triple-shaped facts. Recent advancements have been explored to enhance the semantics of these facts by incorporating more potent representations, such as hyper-relational facts. However, these approaches are limited to atomic facts, which describe a single piece of information. This paper extends beyond atomic facts and delves into nested facts, represented by quoted triples where subjects and objects are triples themselves (e.g., ((BarackObama, holds_position, President), succeed_by, (DonaldTrump, holds_position, President))). These nested facts enable the expression of complex semantics like situations over time and logical patterns} over entities and relations. In response, we introduce NestE, a novel KG embedding approach that captures the semantics of both atomic and nested factual knowledge. NestE represents each atomic fact as a 1*3 matrix, and each nested relation is modeled as a 3*3 matrix that rotates the 1*3 atomic fact matrix through matrix multiplication. Each element of the matrix is represented as a complex number in the generalized 4D hypercomplex space, including (spherical) quaternions, hyperbolic quaternions, and split-quaternions. Through thorough analysis, we demonstrate the embedding's efficacy in capturing diverse logical patterns over nested facts, surpassing the confines of first-order logic-like expressions. Our experimental results showcase NestE's significant performance gains over current baselines in triple prediction and conditional link prediction. The code and pre-trained models are open available at https://github.com/xiongbo010/NestE.
Dissecting vocabulary biases datasets through statistical testing and automated data augmentation for artifact mitigation in Natural Language Inference

In recent years, the availability of large-scale annotated datasets, such as the Stanford Natural Language Inference and the Multi-Genre Natural Language Inference, coupled with the advent of pre-trained language models, has significantly contributed to the development of the natural language inference domain. However, these crowdsourced annotated datasets often contain biases or dataset artifacts, leading to overestimated model performance and poor generalization. In this work, we focus on investigating dataset artifacts and developing strategies to address these issues. Through the utilization of a novel statistical testing procedure, we discover a significant association between vocabulary distribution and text entailment classes, emphasizing vocabulary as a notable source of biases. To mitigate these issues, we propose several automatic data augmentation strategies spanning character to word levels. By fine-tuning the ELECTRA pre-trained language model, we compare the performance of boosted models with augmented data against their baseline counterparts. The experiments demonstrate that the proposed approaches effectively enhance model accuracy and reduce biases by up to 0.66% and 1.14%, respectively.
Clustering with Few Disks to Minimize the Sum of Radii

Given a set of $n$ points in the Euclidean plane, the $k$-MinSumRadius problem asks to cover this point set using $k$ disks with the objective of minimizing the sum of the radii of the disks. After a long line of research on related problems, it was finally discovered that this problem admits a polynomial time algorithm [GKKPV~'12]; however, the running time of this algorithm is $O(n^{881})$, and its relevance is thereby mostly of theoretical nature. A practically and structurally interesting special case of the $k$-MinSumRadius problem is that of small $k$. For the $2$-MinSumRadius problem, a near-quadratic time algorithm with expected running time $O(n^2 \log^2 n \log^2 \log n)$ was given over 30 years ago [Eppstein~'92]. We present the first improvement of this result, namely, a near-linear time algorithm to compute the $2$-MinSumRadius that runs in expected $O(n \log^2 n \log^2 \log n)$ time. We generalize this result to any constant dimension $d$, for which we give an $O(n^{2-1/(\lceil d/2\rceil + 1) + \varepsilon})$ time algorithm. Additionally, we give a near-quadratic time algorithm for $3$-MinSumRadius in the plane that runs in expected $O(n^2 \log^2 n \log^2 \log n)$ time. All of these algorithms rely on insights that uncover a surprisingly simple structure of optimal solutions: we can specify a linear number of lines out of which one separates one of the clusters from the remaining clusters in an optimal solution.
FineControlNet: Fine-level Text Control for Image Generation with Spatially Aligned Text Control Injection

Recently introduced ControlNet has the ability to steer the text-driven image generation process with geometric input such as human 2D pose, or edge features. While ControlNet provides control over the geometric form of the instances in the generated image, it lacks the capability to dictate the visual appearance of each instance. We present FineControlNet to provide fine control over each instance's appearance while maintaining the precise pose control capability. Specifically, we develop and demonstrate FineControlNet with geometric control via human pose images and appearance control via instance-level text prompts. The spatial alignment of instance-specific text prompts and 2D poses in latent space enables the fine control capabilities of FineControlNet. We evaluate the performance of FineControlNet with rigorous comparison against state-of-the-art pose-conditioned text-to-image diffusion models. FineControlNet achieves superior performance in generating images that follow the user-provided instance-specific text prompts and poses compared with existing methods. Project webpage: https://samsunglabs.github. io/FineControlNet-project-page
Supporting traversable wormholes: the case for noncommutative geometry

While wormholes may be just as good a prediction of Einstein's theory as black holes, they are subject to severe restrictions from quantum field theory. In particular, a wormhole can only be held open by violating the null energy condition, calling for the existence of ``exotic matter,"a condition that many researchers consider completely unphysical, enough to rule out macroscopic traversable wormholes. An equally serious problem is the enormous radial tension at the throat of a typical Morris-Thorne wormhole unless the wormhole has an extremely large throat size. It has been proposed that noncommutative geometry, an offshoot of string theory, may be the proper tool for addressing these issues. The purpose of this paper is two-fold: (1) to refine previous arguments to make a stronger and more detailed case for this proposal and (2) to obtain a complete wormhole solution from the given conditions.
On-Chip Multidimensional Dynamic Control of Twisted Moir\'e Photonic Crystal for Smart Sensing and Imaging

Reconfigurable optics, optical systems that have a dynamically tunable configuration, are emerging as a new frontier in photonics research. Recently, twisted moir\'e photonic crystal has become a competitive candidate for implementing reconfigurable optics because of its high degree of tunability. However, despite its great potential as versatile optics components, simultaneous and dynamic modulation of multiple degrees of freedom in twisted moir\'e photonic crystal has remained out of reach, severely limiting its area of application. In this paper, we present a MEMS-integrated twisted moir\'e photonic crystal sensor that offers precise control over the interlayer gap and twist angle between two photonic crystal layers, and demonstrate an active twisted moir\'e photonic crystal-based optical sensor that can simultaneously resolve wavelength and polarization. Leveraging twist- and gap-tuned resonance modes, we achieve high-accuracy spectropolarimetric reconstruction of light using an adaptive sensing algorithm over a broad operational bandwidth in the telecom range and full Poincar\'e sphere. Our research showcases the remarkable capabilities of multidimensional control over emergent degrees of freedom in reconfigurable nanophotonics platforms and establishes a scalable pathway towards creating comprehensive flat-optics devices suitable for versatile light manipulation and information processing tasks.
Physics-Guided Continual Learning for Accelerating Aqueous Organic Redox Flow Battery Material Discovery

Aqueous organic redox flow batteries (AORFBs) have gained popularity in renewable energy storage due to high energy density, low cost, and scalability. The rapid discovery of aqueous soluble organic (ASO) redox-active materials necessitates efficient machine learning surrogates for predicting battery performance. The physics-guided continual learning (PGCL) method proposed in this study can incrementally learn data from new ASO electrolytes while addressing catastrophic forgetting issues in conventional machine learning. Using a ASO anolyte database with 1024 materials generated by a large-scale $780 cm^2$ interdigitated cell model, PGCL incorporates AORFB physics to optimize the continual learning task formation and training process. This achieves a 5x training time speedup compared to the non-physics-guided continual learning method while retaining previously learned battery material knowledge. The trained PGCL demonstrates its capability in predicting battery performance when using unseen dihydroxyphenazine isomers in anolytes, thus showcasing the potential of PGCL to analyze and discover new ASO materials.
Optimal Motion Planning using Finite Fourier Series in a Learning-based Collision Field

This paper utilizes finite Fourier series to represent a time-continuous motion and proposes a novel planning method that adjusts the motion harmonics of each manipulator joint. Primarily, we sum the potential energy for collision detection and the kinetic energy up to calculate the Hamiltonian of the manipulator motion harmonics. Though the adaptive interior-point method is designed to modify the harmonics in its finite frequency domain, we still encounter the local minima due to the non-convexity of the collision field. In this way, we learn the collision field through a support vector machine with a Gaussian kernel, which is highly convex. The learning-based collision field is applied for Hamiltonian, and the experiment results show our method's high reliability and efficiency.
Effect of nonzero temperature to condensed fraction of a homogeneous dilute weakly interacting Bose gas

We investigate the effect of non-zero temperature to the condensate fraction of a homogeneous dilute weakly interacting Bose gas in very low-temperature region. Within inproved Hartree-Fock approximation, the Cornwall-Jackiw-Tomboulis effective action approach shows that the thermal fluctuations make the condensate fraction decrease as a second and fourth-order power law of temperature. The result is compared with experimental data. Indeed, the effect of non-infinite size of the trap is also integrated.
Defect formation energy, electronic structure and phonon dispersion study of half-Heusler TiSnX (X = Pd, Pt and Ni): an ab initio approach

In order to obtain reliable and close to the experimental transport properties, it is necessary to have a good description of the structural, electronic and vibrational properties of the materials. In this regard, the defect formation plays a crucial hole, specially when it has a small formation energy. In this study we have calculated, under the Density Functional Theory (DFT) formalism, the formation energy for five different models of defects, where one of them is interstitial and the other four substitutional. The interstitial Pd defect presented a very low formation energy, while the other defects have shown higher energies and, therefore they are less likely to emerge in the synthesis of the material.
CL2CM: Improving Cross-Lingual Cross-Modal Retrieval via Cross-Lingual Knowledge Transfer

Cross-lingual cross-modal retrieval has garnered increasing attention recently, which aims to achieve the alignment between vision and target language (V-T) without using any annotated V-T data pairs. Current methods employ machine translation (MT) to construct pseudo-parallel data pairs, which are then used to learn a multi-lingual and multi-modal embedding space that aligns visual and target-language representations. However, the large heterogeneous gap between vision and text, along with the noise present in target language translations, poses significant challenges in effectively aligning their representations. To address these challenges, we propose a general framework, Cross-Lingual to Cross-Modal (CL2CM), which improves the alignment between vision and target language using cross-lingual transfer. This approach allows us to fully leverage the merits of multi-lingual pre-trained models (e.g., mBERT) and the benefits of the same modality structure, i.e., smaller gap, to provide reliable and comprehensive semantic correspondence (knowledge) for the cross-modal network. We evaluate our proposed approach on two multilingual image-text datasets, Multi30K and MSCOCO, and one video-text dataset, VATEX. The results clearly demonstrate the effectiveness of our proposed method and its high potential for large-scale retrieval.