feat(route): add query keyword parse of cool paper #17894
+121
−3
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
github-actions
bot
added
Route
Auto: Route Test Complete
|
Successfully generated as following: http://localhost:1200/papers/query/Detection - Success ✔️<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
<channel>
<title>detection</title>
<link>https://papers.cool/arxiv/search?highlight=1&query=Detection&sort=0</link>
<atom:link href="http://localhost:1200/papers/query/Detection" rel="self" type="application/rss+xml"></atom:link>
<description>detection - Powered by RSSHub</description>
<generator>RSSHub</generator>
<webMaster>[email protected] (RSSHub)</webMaster>
<language>en</language>
<lastBuildDate>Sat, 14 Dec 2024 15:29:31 GMT</lastBuildDate>
<ttl>5</ttl>
<item>
<title>Facade: High-Precision Insider Threat Detection Using Deep Contextual Anomaly Detection</title>
<description><a href="https://papers.cool/arxiv/2412.06700">[Site]</a> <a href="https://papers.cool/query/2412.06700">[Kimi]</a> <p><b>Authors:</b> Alex Kantchelian</p> <p>We present Facade (Fast and Accurate Contextual Anomaly DEtection): a high-precision deep-learning-based anomaly detection system deployed at Google (a large technology company) as the last line of defense against insider threats since 2018. Facade is an innovative unsupervised action-context system that detects suspicious actions by considering the context surrounding each action, including relevant facts about the user and other entities involved. It is built around a new multi-modal model that is trained on corporate document access, SQL query, and HTTP/RPC request logs. To overcome the scarcity of incident data, Facade harnesses a novel contrastive learning strategy that relies solely on benign data. Its use of history and implicit social network featurization efficiently handles the frequent out-of-distribution events that occur in a rapidly changing corporate environment, and sustains Facade's high precision performance for a full year after training. Beyond the core model, Facade contributes an innovative clustering approach based on user and action embeddings to improve detection robustness and achieve high precision, multi-scale detection. Functionally what sets Facade apart from existing anomaly detection systems is its high precision. It detects insider attackers with an extremely low false positive rate, lower than 0.01%. For single rogue actions, such as the illegitimate access to a sensitive document, the false positive rate is as low as 0.0003%. To the best of our knowledge, Facade is the only published insider risk anomaly detection system that helps secure such a large corporate environment.</p> </description>
<link>https://papers.cool/arxiv/2412.06700</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.06700</guid>
<pubDate>Mon, 09 Dec 2024 17:46:28 GMT</pubDate>
<author>Alex Kantchelian</author>
</item>
<item>
<title>Practitioners' Expectations on Log Anomaly Detection</title>
<description><a href="https://papers.cool/arxiv/2412.01066">[Site]</a> <a href="https://papers.cool/query/2412.01066">[Kimi]</a> <p><b>Authors:</b> Xiaoxue Ma</p> <p>Log anomaly detection has become a common practice for software engineers to analyze software system behavior. Despite significant research efforts in log anomaly detection over the past decade, it remains unclear what are practitioners' expectations on log anomaly detection and whether current research meets their needs. To fill this gap, we conduct an empirical study, surveying 312 practitioners from 36 countries about their expectations on log anomaly detection. In particular, we investigate various factors influencing practitioners' willingness to adopt log anomaly detection tools. We then perform a literature review on log anomaly detection, focusing on publications in premier venues from 2014 to 2024, to compare practitioners' needs with the current state of research. Based on this comparison, we highlight the directions for researchers to focus on to develop log anomaly detection techniques that better meet practitioners' expectations.</p> </description>
<link>https://papers.cool/arxiv/2412.01066</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.01066</guid>
<pubDate>Mon, 02 Dec 2024 03:01:35 GMT</pubDate>
<author>Xiaoxue Ma</author>
</item>
<item>
<title>From Audio Deepfake Detection to AI-Generated Music Detection -- A Pathway and Overview</title>
<description><a href="https://papers.cool/arxiv/2412.00571">[Site]</a> <a href="https://papers.cool/query/2412.00571">[Kimi]</a> <p><b>Authors:</b> Yupei Li</p> <p>As Artificial Intelligence (AI) technologies continue to evolve, their use in generating realistic, contextually appropriate content has expanded into various domains. Music, an art form and medium for entertainment, deeply rooted into human culture, is seeing an increased involvement of AI into its production. However, the unregulated use of AI music generation (AIGM) tools raises concerns about potential negative impacts on the music industry, copyright and artistic integrity, underscoring the importance of effective AIGM detection. This paper provides an overview of existing AIGM detection methods. To lay a foundation to the general workings and challenges of AIGM detection, we first review general principles of AIGM, including recent advancements in deepfake audios, as well as multimodal detection techniques. We further propose a potential pathway for leveraging foundation models from audio deepfake detection to AIGM detection. Additionally, we discuss implications of these tools and propose directions for future research to address ongoing challenges in the field.</p> </description>
<link>https://papers.cool/arxiv/2412.00571</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.00571</guid>
<pubDate>Sat, 30 Nov 2024 19:53:23 GMT</pubDate>
<author>Yupei Li</author>
</item>
<item>
<title>Cutting-Edge Detection of Fatigue in Drivers: A Comparative Study of Object Detection Models</title>
<description><a href="https://papers.cool/arxiv/2410.15030">[Site]</a> <a href="https://papers.cool/query/2410.15030">[Kimi]</a> <p><b>Authors:</b> Amelia Jones</p> <p>This research delves into the development of a fatigue detection system based on modern object detection algorithms, particularly YOLO (You Only Look Once) models, including YOLOv5, YOLOv6, YOLOv7, and YOLOv8. By comparing the performance of these models, we evaluate their effectiveness in real-time detection of fatigue-related behavior in drivers. The study addresses challenges like environmental variability and detection accuracy and suggests a roadmap for enhancing real-time detection. Experimental results demonstrate that YOLOv8 offers superior performance, balancing accuracy with speed. Data augmentation techniques and model optimization have been key in enhancing system adaptability to various driving conditions.</p> </description>
<link>https://papers.cool/arxiv/2410.15030</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.15030</guid>
<pubDate>Sat, 19 Oct 2024 08:06:43 GMT</pubDate>
<author>Amelia Jones</author>
</item>
<item>
<title>Spatiotemporal Object Detection for Improved Aerial Vehicle Detection in Traffic Monitoring</title>
<description><a href="https://papers.cool/arxiv/2410.13616">[Site]</a> <a href="https://papers.cool/query/2410.13616">[Kimi]</a> <p><b>Authors:</b> Kristina Telegraph</p> <p>This work presents advancements in multi-class vehicle detection using UAV cameras through the development of spatiotemporal object detection models. The study introduces a Spatio-Temporal Vehicle Detection Dataset (STVD) containing 6, 600 annotated sequential frame images captured by UAVs, enabling comprehensive training and evaluation of algorithms for holistic spatiotemporal perception. A YOLO-based object detection algorithm is enhanced to incorporate temporal dynamics, resulting in improved performance over single frame models. The integration of attention mechanisms into spatiotemporal models is shown to further enhance performance. Experimental validation demonstrates significant progress, with the best spatiotemporal model exhibiting a 16.22% improvement over single frame models, while it is demonstrated that attention mechanisms hold the potential for additional performance gains.</p> </description>
<link>https://papers.cool/arxiv/2410.13616</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.13616</guid>
<pubDate>Thu, 17 Oct 2024 14:49:37 GMT</pubDate>
<author>Kristina Telegraph</author>
</item>
<item>
<title>Real-time Fuel Leakage Detection via Online Change Point Detection</title>
<description><a href="https://papers.cool/arxiv/2410.09741">[Site]</a> <a href="https://papers.cool/query/2410.09741">[Kimi]</a> <p><b>Authors:</b> Ruimin Chu</p> <p>Early detection of fuel leakage at service stations with underground petroleum storage systems is a crucial task to prevent catastrophic hazards. Current data-driven fuel leakage detection methods employ offline statistical inventory reconciliation, leading to significant detection delays. Consequently, this can result in substantial financial loss and environmental impact on the surrounding community. In this paper, we propose a novel framework called Memory-based Online Change Point Detection (MOCPD) which operates in near real-time, enabling early detection of fuel leakage. MOCPD maintains a collection of representative historical data within a size-constrained memory, along with an adaptively computed threshold. Leaks are detected when the dissimilarity between the latest data and historical memory exceeds the current threshold. An update phase is incorporated in MOCPD to ensure diversity among historical samples in the memory. With this design, MOCPD is more robust and achieves a better recall rate while maintaining a reasonable precision score. We have conducted a variety of experiments comparing MOCPD to commonly used online change point detection (CPD) baselines on real-world fuel variance data with induced leakages, actual fuel leakage data and benchmark CPD datasets. Overall, MOCPD consistently outperforms the baseline methods in terms of detection accuracy, demonstrating its applicability to fuel leakage detection and CPD problems.</p> </description>
<link>https://papers.cool/arxiv/2410.09741</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.09741</guid>
<pubDate>Sun, 13 Oct 2024 06:22:13 GMT</pubDate>
<author>Ruimin Chu</author>
</item>
<item>
<title>1M-Deepfakes Detection Challenge</title>
<description><a href="https://papers.cool/arxiv/2409.06991">[Site]</a> <a href="https://papers.cool/query/2409.06991">[Kimi]</a> <p><b>Authors:</b> Zhixi Cai</p> <p>The detection and localization of deepfake content, particularly when small fake segments are seamlessly mixed with real videos, remains a significant challenge in the field of digital media security. Based on the recently released AV-Deepfake1M dataset, which contains more than 1 million manipulated videos across more than 2,000 subjects, we introduce the 1M-Deepfakes Detection Challenge. This challenge is designed to engage the research community in developing advanced methods for detecting and localizing deepfake manipulations within the large-scale high-realistic audio-visual dataset. The participants can access the AV-Deepfake1M dataset and are required to submit their inference results for evaluation across the metrics for detection or localization tasks. The methodologies developed through the challenge will contribute to the development of next-generation deepfake detection and localization systems. Evaluation scripts, baseline models, and accompanying code will be available on https://github.com/ControlNet/AV-Deepfake1M.</p> </description>
<link>https://papers.cool/arxiv/2409.06991</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.06991</guid>
<pubDate>Wed, 11 Sep 2024 03:43:53 GMT</pubDate>
<author>Zhixi Cai</author>
</item>
<item>
<title>Active-IRS-Enabled Target Detection</title>
<description><a href="https://papers.cool/arxiv/2409.04155">[Site]</a> <a href="https://papers.cool/query/2409.04155">[Kimi]</a> <p><b>Authors:</b> Song Xianxin</p> <p>This letter studies an active intelligent reflecting surface (IRS)-enabled non-line-of-sight (NLoS) target detection system, in which an active IRS equipped with active reflecting elements and sensors is strategically deployed to facilitate target detection in the NLoS region of the base station (BS) by processing echo signals through the BS-IRS-target-IRS link. First, we design an optimal detector based on the Neyman-Pearson (NP) theorem and derive the corresponding detection probability. Intriguingly, it is demonstrated that the optimal detector can exploit both the BS's transmit signal and the active IRS's reflection noise for more effective detection. Subsequently, we jointly optimize the transmit beamforming at the BS and the reflective beamforming at the active IRS to maximize the detection probability, subject to the maximum transmit power constraint at the BS, as well as the maximum amplification power and gain constraints at the active IRS. Finally, simulation results unveil that the proposed joint beamforming design significantly enhances the detection probability, with the active IRS outperforming its fully- and semi-passive counterparts in detection performance.</p> </description>
<link>https://papers.cool/arxiv/2409.04155</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.04155</guid>
<pubDate>Fri, 06 Sep 2024 09:34:55 GMT</pubDate>
<author>Song Xianxin</author>
</item>
<item>
<title>BFA-YOLO: Balanced multiscale object detection network for multi-view building facade attachments detection</title>
<description><a href="https://papers.cool/arxiv/2409.04025">[Site]</a> <a href="https://papers.cool/query/2409.04025">[Kimi]</a> <p><b>Authors:</b> Yangguang Chen</p> <p>Detection of building facade attachments such as doors, windows, balconies, air conditioner units, billboards, and glass curtain walls plays a pivotal role in numerous applications. Building facade attachments detection aids in vbuilding information modeling (BIM) construction and meeting Level of Detail 3 (LOD3) standards. Yet, it faces challenges like uneven object distribution, small object detection difficulty, and background interference. To counter these, we propose BFA-YOLO, a model for detecting facade attachments in multi-view images. BFA-YOLO incorporates three novel innovations: the Feature Balanced Spindle Module (FBSM) for addressing uneven distribution, the Target Dynamic Alignment Task Detection Head (TDATH) aimed at improving small object detection, and the Position Memory Enhanced Self-Attention Mechanism (PMESA) to combat background interference, with each component specifically designed to solve its corresponding challenge. Detection efficacy of deep network models deeply depends on the dataset's characteristics. Existing open source datasets related to building facades are limited by their single perspective, small image pool, and incomplete category coverage. We propose a novel method for building facade attachments detection dataset construction and construct the BFA-3D dataset for facade attachments detection. The BFA-3D dataset features multi-view, accurate labels, diverse categories, and detailed classification. BFA-YOLO surpasses YOLOv8 by 1.8% and 2.9% in [email protected] on the multi-view BFA-3D and street-view Facade-WHU datasets, respectively. These results underscore BFA-YOLO's superior performance in detecting facade attachments.</p> </description>
<link>https://papers.cool/arxiv/2409.04025</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.04025</guid>
<pubDate>Fri, 06 Sep 2024 04:44:52 GMT</pubDate>
<author>Yangguang Chen</author>
</item>
<item>
<title>Missile detection and destruction robot using detection algorithm</title>
<description><a href="https://papers.cool/arxiv/2407.07452">[Site]</a> <a href="https://papers.cool/query/2407.07452">[Kimi]</a> <p><b>Authors:</b> Md Kamrul Siam</p> <p>This research is based on the present missile detection technologies in the world and the analysis of these technologies to find a cost effective solution to implement the system in Bangladesh. The paper will give an idea of the missile detection technologies using the electro-optical sensor and the pulse doppler radar. The system is made to detect the target missile. Automatic detection and destruction with the help of ultrasonic sonar, a metal detector sensor, and a smoke detector sensor. The system is mainly based on an ultrasonic sonar sensor. It has a transducer, a transmitter, and a receiver. Transducer is connected with the connected with controller. When it detects an object by following the algorithm, it finds its distance and angle. It can also assure whether the system can destroy the object or not by using another algorithm's simulation.</p> </description>
<link>https://papers.cool/arxiv/2407.07452</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.07452</guid>
<pubDate>Wed, 10 Jul 2024 08:12:21 GMT</pubDate>
<author>Md Kamrul Siam</author>
</item>
<item>
<title>Small Aerial Target Detection for Airborne Infrared Detection Systems using LightGBM and Trajectory Constraints</title>
<description><a href="https://papers.cool/arxiv/2407.01278">[Site]</a> <a href="https://papers.cool/query/2407.01278">[Kimi]</a> <p><b>Authors:</b> Xiaoliang Sun</p> <p>Factors, such as rapid relative motion, clutter background, etc., make robust small aerial target detection for airborne infrared detection systems a challenge. Existing methods are facing difficulties when dealing with such cases. We consider that a continuous and smooth trajectory is critical in boosting small infrared aerial target detection performance. A simple and effective small aerial target detection method for airborne infrared detection system using light gradient boosting model (LightGBM) and trajectory constraints is proposed in this article. First, we simply formulate target candidate detection as a binary classification problem. Target candidates in every individual frame are detected via interesting pixel detection and a trained LightGBM model. Then, the local smoothness and global continuous characteristic of the target trajectory are modeled as short-strict and long-loose constraints. The trajectory constraints are used efficiently for detecting the true small infrared aerial targets from numerous target candidates. Experiments on public datasets demonstrate that the proposed method performs better than other existing methods. Furthermore, a public dataset for small aerial target detection in airborne infrared detection systems is constructed. To the best of our knowledge, this dataset has the largest data scale and richest scene types within this field.</p> </description>
<link>https://papers.cool/arxiv/2407.01278</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.01278</guid>
<pubDate>Mon, 01 Jul 2024 13:33:40 GMT</pubDate>
<author>Xiaoliang Sun</author>
</item>
<item>
<title>Language-driven Grasp Detection</title>
<description><a href="https://papers.cool/arxiv/2406.09489">[Site]</a> <a href="https://papers.cool/query/2406.09489">[Kimi]</a> <p><b>Authors:</b> An Dinh Vuong</p> <p>Grasp detection is a persistent and intricate challenge with various industrial applications. Recently, many methods and datasets have been proposed to tackle the grasp detection problem. However, most of them do not consider using natural language as a condition to detect the grasp poses. In this paper, we introduce Grasp-Anything++, a new language-driven grasp detection dataset featuring 1M samples, over 3M objects, and upwards of 10M grasping instructions. We utilize foundation models to create a large-scale scene corpus with corresponding images and grasp prompts. We approach the language-driven grasp detection task as a conditional generation problem. Drawing on the success of diffusion models in generative tasks and given that language plays a vital role in this task, we propose a new language-driven grasp detection method based on diffusion models. Our key contribution is the contrastive training objective, which explicitly contributes to the denoising process to detect the grasp pose given the language instructions. We illustrate that our approach is theoretically supportive. The intensive experiments show that our method outperforms state-of-the-art approaches and allows real-world robotic grasping. Finally, we demonstrate our large-scale dataset enables zero-short grasp detection and is a challenging benchmark for future work. Project website: https://airvlab.github.io/grasp-anything/</p> </description>
<link>https://papers.cool/arxiv/2406.09489</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2406.09489</guid>
<pubDate>Thu, 13 Jun 2024 16:06:59 GMT</pubDate>
<author>An Dinh Vuong</author>
</item>
<item>
<title>Detection-Rate-Emphasized Multi-objective Evolutionary Feature Selection for Network Intrusion Detection</title>
<description><a href="https://papers.cool/arxiv/2406.09180">[Site]</a> <a href="https://papers.cool/query/2406.09180">[Kimi]</a> <p><b>Authors:</b> Zi-Hang Cheng</p> <p>Network intrusion detection is one of the most important issues in the field of cyber security, and various machine learning techniques have been applied to build intrusion detection systems. However, since the number of features to describe the network connections is often large, where some features are redundant or noisy, feature selection is necessary in such scenarios, which can both improve the efficiency and accuracy. Recently, some researchers focus on using multi-objective evolutionary algorithms (MOEAs) to select features. But usually, they only consider the number of features and classification accuracy as the objectives, resulting in unsatisfactory performance on a critical metric, detection rate. This will lead to the missing of many real attacks and bring huge losses to the network system. In this paper, we propose DR-MOFS to model the feature selection problem in network intrusion detection as a three-objective optimization problem, where the number of features, accuracy and detection rate are optimized simultaneously, and use MOEAs to solve it. Experiments on two popular network intrusion detection datasets NSL-KDD and UNSW-NB15 show that in most cases the proposed method can outperform previous methods, i.e., lead to fewer features, higher accuracy and detection rate.</p> </description>
<link>https://papers.cool/arxiv/2406.09180</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2406.09180</guid>
<pubDate>Thu, 13 Jun 2024 14:42:17 GMT</pubDate>
<author>Zi-Hang Cheng</author>
</item>
<item>
<title>Tracking Small Birds by Detection Candidate Region Filtering and Detection History-aware Association</title>
<description><a href="https://papers.cool/arxiv/2405.17323">[Site]</a> <a href="https://papers.cool/query/2405.17323">[Kimi]</a> <p><b>Authors:</b> Tingwei Liu</p> <p>This paper focuses on tracking birds that appear small in a panoramic video. When the size of the tracked object is small in the image (small object tracking) and move quickly, object detection and association suffers. To address these problems, we propose Adaptive Slicing Aided Hyper Inference (Adaptive SAHI), which reduces the candidate regions to apply detection, and Detection History-aware Similarity Criterion (DHSC), which accurately associates objects in consecutive frames based on the detection history. Experiments on the NUBird2022 dataset verifies the effectiveness of the proposed method by showing improvements in both accuracy and speed.</p> </description>
<link>https://papers.cool/arxiv/2405.17323</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.17323</guid>
<pubDate>Mon, 27 May 2024 16:22:38 GMT</pubDate>
<author>Tingwei Liu</author>
</item>
<item>
<title>Quantum Edge Detection</title>
<description><a href="https://papers.cool/arxiv/2405.11373">[Site]</a> <a href="https://papers.cool/query/2405.11373">[Kimi]</a> <p><b>Authors:</b> Santiago Llorens</p> <p>This paper introduces quantum edge detection, aimed at locating boundaries of quantum domains where all particles share the same pure state. Focusing on the 1D scenario of a string of particles, we develop an optimal protocol for quantum edge detection, efficiently computing its success probability through Schur-Weyl duality and semidefinite programming techniques. We analyze the behavior of the success probability as a function of the string length and local dimension, with emphasis in the limit of long strings. We present a protocol based on square root measurement, which proves asymptotically optimal. Additionally, we explore a mixed quantum change point detection scenario where the state of particles transitions from known to unknown, which may find practical applications in detecting malfunctions in quantum devices</p> </description>
<link>https://papers.cool/arxiv/2405.11373</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.11373</guid>
<pubDate>Sat, 18 May 2024 19:22:15 GMT</pubDate>
<author>Santiago Llorens</author>
</item>
<item>
<title>Roadside Monocular 3D Detection via 2D Detection Prompting</title>
<description><a href="https://papers.cool/arxiv/2404.01064">[Site]</a> <a href="https://papers.cool/query/2404.01064">[Kimi]</a> <p><b>Authors:</b> Yechi Ma</p> <p>The problem of roadside monocular 3D detection requires detecting objects of interested classes in a 2D RGB frame and predicting their 3D information such as locations in bird's-eye-view (BEV). It has broad applications in traffic control, vehicle-vehicle communication, and vehicle-infrastructure cooperative perception. To approach this problem, we present a novel and simple method by prompting the 3D detector using 2D detections. Our method builds on a key insight that, compared with 3D detectors, a 2D detector is much easier to train and performs significantly better w.r.t detections on the 2D image plane. That said, one can exploit 2D detections of a well-trained 2D detector as prompts to a 3D detector, being trained in a way of inflating such 2D detections to 3D towards 3D detection. To construct better prompts using the 2D detector, we explore three techniques: (a) concatenating both 2D and 3D detectors' features, (b) attentively fusing 2D and 3D detectors' features, and (c) encoding predicted 2D boxes x, y, width, height, label and attentively fusing such with the 3D detector's features. Surprisingly, the third performs the best. Moreover, we present a yaw tuning tactic and a class-grouping strategy that merges classes based on their functionality; these techniques improve 3D detection performance further. Comprehensive ablation studies and extensive experiments demonstrate that our method resoundingly outperforms prior works, achieving the state-of-the-art on two large-scale roadside 3D detection benchmarks.</p> </description>
<link>https://papers.cool/arxiv/2404.01064</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2404.01064</guid>
<pubDate>Mon, 01 Apr 2024 11:57:34 GMT</pubDate>
<author>Yechi Ma</author>
</item>
<item>
<title>BAM: Box Abstraction Monitors for Real-time OoD Detection in Object Detection</title>
<description><a href="https://papers.cool/arxiv/2403.18373">[Site]</a> <a href="https://papers.cool/query/2403.18373">[Kimi]</a> <p><b>Authors:</b> Changshun Wu</p> <p>Out-of-distribution (OoD) detection techniques for deep neural networks (DNNs) become crucial thanks to their filtering of abnormal inputs, especially when DNNs are used in safety-critical applications and interact with an open and dynamic environment. Nevertheless, integrating OoD detection into state-of-the-art (SOTA) object detection DNNs poses significant challenges, partly due to the complexity introduced by the SOTA OoD construction methods, which require the modification of DNN architecture and the introduction of complex loss functions. This paper proposes a simple, yet surprisingly effective, method that requires neither retraining nor architectural change in object detection DNN, called Box Abstraction-based Monitors (BAM). The novelty of BAM stems from using a finite union of convex box abstractions to capture the learned features of objects for in-distribution (ID) data, and an important observation that features from OoD data are more likely to fall outside of these boxes. The union of convex regions within the feature space allows the formation of non-convex and interpretable decision boundaries, overcoming the limitations of VOS-like detectors without sacrificing real-time performance. Experiments integrating BAM into Faster R-CNN-based object detection DNNs demonstrate a considerably improved performance against SOTA OoD detection techniques.</p> </description>
<link>https://papers.cool/arxiv/2403.18373</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2403.18373</guid>
<pubDate>Wed, 27 Mar 2024 09:10:01 GMT</pubDate>
<author>Changshun Wu</author>
</item>
<item>
<title>GPT-generated Text Detection: Benchmark Dataset and Tensor-based Detection Method</title>
<description><a href="https://papers.cool/arxiv/2403.07321">[Site]</a> <a href="https://papers.cool/query/2403.07321">[Kimi]</a> <p><b>Authors:</b> Zubair Qazi</p> <p>As natural language models like ChatGPT become increasingly prevalent in applications and services, the need for robust and accurate methods to detect their output is of paramount importance. In this paper, we present GPT Reddit Dataset (GRiD), a novel Generative Pretrained Transformer (GPT)-generated text detection dataset designed to assess the performance of detection models in identifying generated responses from ChatGPT. The dataset consists of a diverse collection of context-prompt pairs based on Reddit, with human-generated and ChatGPT-generated responses. We provide an analysis of the dataset's characteristics, including linguistic diversity, context complexity, and response quality. To showcase the dataset's utility, we benchmark several detection methods on it, demonstrating their efficacy in distinguishing between human and ChatGPT-generated responses. This dataset serves as a resource for evaluating and advancing detection techniques in the context of ChatGPT and contributes to the ongoing efforts to ensure responsible and trustworthy AI-driven communication on the internet. Finally, we propose GpTen, a novel tensor-based GPT text detection method that is semi-supervised in nature since it only has access to human-generated text and performs on par with fully-supervised baselines.</p> </description>
<link>https://papers.cool/arxiv/2403.07321</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2403.07321</guid>
<pubDate>Tue, 12 Mar 2024 05:15:21 GMT</pubDate>
<author>Zubair Qazi</author>
</item>
<item>
<title>FriendNet: Detection-Friendly Dehazing Network</title>
<description><a href="https://papers.cool/arxiv/2403.04443">[Site]</a> <a href="https://papers.cool/query/2403.04443">[Kimi]</a> <p><b>Authors:</b> Yihua Fan</p> <p>Adverse weather conditions often impair the quality of captured images, inevitably inducing cutting-edge object detection models for advanced driver assistance systems (ADAS) and autonomous driving. In this paper, we raise an intriguing question: can the combination of image restoration and object detection enhance detection performance in adverse weather conditions? To answer it, we propose an effective architecture that bridges image dehazing and object detection together via guidance information and task-driven learning to achieve detection-friendly dehazing, termed FriendNet. FriendNet aims to deliver both high-quality perception and high detection capacity. Different from existing efforts that intuitively treat image dehazing as pre-processing, FriendNet establishes a positive correlation between these two tasks. Clean features generated by the dehazing network potentially contribute to improvements in object detection performance. Conversely, object detection crucially guides the learning process of the image dehazing network under the task-driven learning scheme. We shed light on how downstream tasks can guide upstream dehazing processes, considering both network architecture and learning objectives. We design Guidance Fusion Block (GFB) and Guidance Attention Block (GAB) to facilitate the integration of detection information into the network. Furthermore, the incorporation of the detection task loss aids in refining the optimization process. Additionally, we introduce a new Physics-aware Feature Enhancement Block (PFEB), which integrates physics-based priors to enhance the feature extraction and representation capabilities. Extensive experiments on synthetic and real-world datasets demonstrate the superiority of our method over state-of-the-art methods on both image quality and detection precision. Our source code is available at https://github.com/fanyihua0309/FriendNet.</p> </description>
<link>https://papers.cool/arxiv/2403.04443</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2403.04443</guid>
<pubDate>Thu, 07 Mar 2024 12:19:04 GMT</pubDate>
<author>Yihua Fan</author>
</item>
<item>
<title>Order-detection, representation-detection, and applications to cable knots</title>
<description><a href="https://papers.cool/arxiv/2402.15465">[Site]</a> <a href="https://papers.cool/query/2402.15465">[Kimi]</a> <p><b>Authors:</b> Adam Clay</p> <p>Given a $3$-manifold $M$ with multiple incompressible torus boundary components, we develop a general definition of order-detection of tuples of slopes on the boundary components of $M$. In parallel, we arrive at a general definition of representation-detection of tuples of slopes, and show that these two kinds of slope detection are equivalent -- in the sense that a tuple of slopes on the boundary of $M$ is order-detected if and only if it is representation-detected. We use these results, together with new "relative gluing theorems," to show how the work of Eisenbud-Hirsch-Neumann, Jankins-Neumann and Naimi can be used to determine tuples of representation-detected slopes and, in turn, the behaviour of order-detected slopes on the boundary of a knot manifold with respect to cabling. Our cabling results improve upon work of the first author and Watson, and in particular, this new approach shows how one can use the equivalence between representation-detection and order-detection to derive orderability results that parallel known behaviour of L-spaces with respect to Dehn filling.</p> </description>
<link>https://papers.cool/arxiv/2402.15465</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2402.15465</guid>
<pubDate>Fri, 23 Feb 2024 17:55:28 GMT</pubDate>
<author>Adam Clay</author>
</item>
<item>
<title>Optimal non-Gaussian operations in difference-intensity detection and parity detection-based Mach-Zehnder interferometer</title>
<description><a href="https://papers.cool/arxiv/2312.10774">[Site]</a> <a href="https://papers.cool/query/2312.10774">[Kimi]</a> <p><b>Authors:</b> Manali Verma</p> <p>We investigate the benefits of probabilistic non-Gaussian operations in phase estimation using difference-intensity and parity detection-based Mach-Zehnder interferometers (MZI). We consider an experimentally implementable model to perform three different non-Gaussian operations, namely photon subtraction (PS), photon addition (PA), and photon catalysis (PC) on a single-mode squeezed vacuum (SSV) state. In difference-intensity detection-based MZI, two PC operation is found to be the most optimal, while for parity detection-based MZI, two PA operation emerges as the most optimal process. We have also provided the corresponding squeezing and transmissivity parameters at best performance, making our study relevant for experimentalists. Further, we have derived the general expression of moment-generating function, which shall be useful in exploring other detection schemes such as homodyne detection and quadratic homodyne detection.</p> </description>
<link>https://papers.cool/arxiv/2312.10774</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.10774</guid>
<pubDate>Sun, 17 Dec 2023 17:52:14 GMT</pubDate>
<author>Manali Verma</author>
</item>
<item>
<title>Effects of detection-beam focal offset on displacement detection in optical tweezers</title>
<description><a href="https://papers.cool/arxiv/2311.06088">[Site]</a> <a href="https://papers.cool/query/2311.06088">[Kimi]</a> <p><b>Authors:</b> Anni Chen</p> <p>A high-resolution displacement detection can be achieved by analyzing the scattered light of the trapping beams from the particle in optical tweezers. In some applications where trapping and displacement detection need to be separated, a detection beam can be introduced for independent displacement detection. However, the detection beam focus possibly deviates from the centre of the particle, which will affect the performance of the displacement detection. In this paper, we detect the radial displacement of the particle by utilizing the forward scattered light of the detection beam from the particle. The effects of the lateral and axial offsets between the detection beam focus and the particle centre on the displacement detection are analyzed by the simulation and experiment. The results show that the lateral offsets will decrease the detection sensitivity and linear range and aggravate the crosstalk between the x-direction signal and y-direction signal of QPD. The axial offsets also affect the detection sensitivity, an optimal axial offset can improve the sensitivity of the displacement detection substantially. In addition, the influence of system parameters, such as particle radius a, numerical aperture of the condenser NAc and numerical aperture of the objective NAo on the optimal axial offset are discussed. A combination of conventional optical tweezers instrument and a detection beam provides a more flexible working point, allowing for the active modulation of the sensitivity and linear range of the displacement detection. This work would be of great interest for improving the accuracy of the displacement and force detection performed by the optical tweezers.</p> </description>
<link>https://papers.cool/arxiv/2311.06088</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2311.06088</guid>
<pubDate>Fri, 10 Nov 2023 14:41:04 GMT</pubDate>
<author>Anni Chen</author>
</item>
<item>
<title>Post-experiment coincidence detection techniques for direct detection of two-body correlations</title>
<description><a href="https://papers.cool/arxiv/2308.16746">[Site]</a> <a href="https://papers.cool/query/2308.16746">[Kimi]</a> <p><b>Authors:</b> Dezhong Cao</p> <p>It is one challenge to develop experimental techniques for direct detection of the many-body correlations of strongly correlated electrons, which exhibit a variety of unsolved mysteries. In this article, we present a post-experiment coincidence counting method and propose two post-experiment coincidence detection techniques, post-experiment coincidence angle-resolved photoemission spectroscopy (cARPES) and post-experiment coincidence inelastic neutron scattering (cINS). By coincidence detection of two photoelectric processes or two neutron-scattering processes, the post-experiment coincidence detection techniques can detect directly the two-body correlations of strongly correlated electrons in particle-particle channel or two-spin channel. The post-experiment coincidence detection techniques can be implemented upon the pulse-resolved angle-resolved photoemission spectroscopy (ARPES) or inelastic neutron scattering (INS) experimental apparatus with pulse photon or neutron source. When implemented experimentally, they will be powerful techniques to study the highly esoteric high-temperature superconductivity and the highly coveted quantum spin liquids.</p> </description>
<link>https://papers.cool/arxiv/2308.16746</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2308.16746</guid>
<pubDate>Thu, 31 Aug 2023 14:06:23 GMT</pubDate>
<author>Dezhong Cao</author>
</item>
<item>
<title>Described Object Detection: Liberating Object Detection with Flexible Expressions</title>
<description><a href="https://papers.cool/arxiv/2307.12813">[Site]</a> <a href="https://papers.cool/query/2307.12813">[Kimi]</a> <p><b>Authors:</b> Chi Xie</p> <p>Detecting objects based on language information is a popular task that includes Open-Vocabulary object Detection (OVD) and Referring Expression Comprehension (REC). In this paper, we advance them to a more practical setting called Described Object Detection (DOD) by expanding category names to flexible language expressions for OVD and overcoming the limitation of REC only grounding the pre-existing object. We establish the research foundation for DOD by constructing a Description Detection Dataset ($D^3$). This dataset features flexible language expressions, whether short category names or long descriptions, and annotating all described objects on all images without omission. By evaluating previous SOTA methods on $D^3$, we find some troublemakers that fail current REC, OVD, and bi-functional methods. REC methods struggle with confidence scores, rejecting negative instances, and multi-target scenarios, while OVD methods face constraints with long and complex descriptions. Recent bi-functional methods also do not work well on DOD due to their separated training procedures and inference strategies for REC and OVD tasks. Building upon the aforementioned findings, we propose a baseline that largely improves REC methods by reconstructing the training data and introducing a binary classification sub-task, outperforming existing methods. Data and code are available at https://github.com/shikras/d-cube and related works are tracked in https://github.com/Charles-Xie/awesome-described-object-detection.</p> </description>
<link>https://papers.cool/arxiv/2307.12813</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2307.12813</guid>
<pubDate>Mon, 24 Jul 2023 14:06:54 GMT</pubDate>
<author>Chi Xie</author>
</item>
<item>
<title>Joint Microseismic Event Detection and Location with a Detection Transformer</title>
<description><a href="https://papers.cool/arxiv/2307.09207">[Site]</a> <a href="https://papers.cool/query/2307.09207">[Kimi]</a> <p><b>Authors:</b> Yuanyuan Yang</p> <p>Microseismic event detection and location are two primary components in microseismic monitoring, which offers us invaluable insights into the subsurface during reservoir stimulation and evolution. Conventional approaches for event detection and location often suffer from manual intervention and/or heavy computation, while current machine learning-assisted approaches typically address detection and location separately; such limitations hinder the potential for real-time microseismic monitoring. We propose an approach to unify event detection and source location into a single framework by adapting a Convolutional Neural Network backbone and an encoder-decoder Transformer with a set-based Hungarian loss, which is applied directly to recorded waveforms. The proposed network is trained on synthetic data simulating multiple microseismic events corresponding to random source locations in the area of suspected microseismic activities. A synthetic test on a 2D profile of the SEAM Time Lapse model illustrates the capability of the proposed method in detecting the events properly and locating them in the subsurface accurately; while, a field test using the Arkoma Basin data further proves its practicability, efficiency, and its potential in paving the way for real-time monitoring of microseismic events.</p> </description>
<link>https://papers.cool/arxiv/2307.09207</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2307.09207</guid>
<pubDate>Sun, 16 Jul 2023 10:56:46 GMT</pubDate>
<author>Yuanyuan Yang</author>
</item>
<item>
<title>Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique</title>
<description><a href="https://papers.cool/arxiv/2306.17719">[Site]</a> <a href="https://papers.cool/query/2306.17719">[Kimi]</a> <p><b>Authors:</b> Guy Bresler</p> <p>Planted Dense Subgraph (PDS) problem is a prototypical problem with a computational-statistical gap. It also exhibits an intriguing additional phenomenon: different tasks, such as detection or recovery, appear to have different computational limits. A detection-recovery gap for PDS was substantiated in the form of a precise conjecture given by Chen and Xu (2014) (based on the parameter values for which a convexified MLE succeeds) and then shown to hold for low-degree polynomial algorithms by Schramm and Wein (2022) and for MCMC algorithms for Ben Arous et al. (2020). In this paper, we demonstrate that a slight variation of the Planted Clique Hypothesis with secret leakage (introduced in Brennan and Bresler (2020)), implies a detection-recovery gap for PDS. In the same vein, we also obtain a sharp lower bound for refutation, yielding a detection-refutation gap. Our methods build on the framework of Brennan and Bresler (2020) to construct average-case reductions mapping secret leakage Planted Clique to appropriate target problems.</p> </description>
<link>https://papers.cool/arxiv/2306.17719</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2306.17719</guid>
<pubDate>Fri, 30 Jun 2023 15:02:47 GMT</pubDate>
<author>Guy Bresler</author>
</item>
<item>
<title>Taming Detection Transformers for Medical Object Detection</title>
<description><a href="https://papers.cool/arxiv/2306.15472">[Site]</a> <a href="https://papers.cool/query/2306.15472">[Kimi]</a> <p><b>Authors:</b> Marc K. Ickler</p> <p>The accurate detection of suspicious regions in medical images is an error-prone and time-consuming process required by many routinely performed diagnostic procedures. To support clinicians during this difficult task, several automated solutions were proposed relying on complex methods with many hyperparameters. In this study, we investigate the feasibility of DEtection TRansformer (DETR) models for volumetric medical object detection. In contrast to previous works, these models directly predict a set of objects without relying on the design of anchors or manual heuristics such as non-maximum-suppression to detect objects. We show by conducting extensive experiments with three models, namely DETR, Conditional DETR, and DINO DETR on four data sets (CADA, RibFrac, KiTS19, and LIDC) that these set prediction models can perform on par with or even better than currently existing methods. DINO DETR, the best-performing model in our experiments demonstrates this by outperforming a strong anchor-based one-stage detector, Retina U-Net, on three out of four data sets.</p> </description>
<link>https://papers.cool/arxiv/2306.15472</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2306.15472</guid>
<pubDate>Tue, 27 Jun 2023 13:46:15 GMT</pubDate>
<author>Marc K. Ickler</author>
</item>
<item>
<title>WePaMaDM-Outlier Detection: Weighted Outlier Detection using Pattern Approaches for Mass Data Mining</title>
<description><a href="https://papers.cool/arxiv/2306.06139">[Site]</a> <a href="https://papers.cool/query/2306.06139">[Kimi]</a> <p><b>Authors:</b> Ravindrakumar Purohit</p> <p>Weighted Outlier Detection is a method for identifying unusual or anomalous data points in a dataset, which can be caused by various factors like human error, fraud, or equipment malfunctions. Detecting outliers can reveal vital information about system faults, fraudulent activities, and patterns in the data, assisting experts in addressing the root causes of these anomalies. However,creating a model of normal data patterns to identify outliers can be challenging due to the nature of input data, labeled data availability, and specific requirements of the problem. This article proposed the WePaMaDM-Outlier Detection with distinct mass data mining domain, demonstrating that such techniques are domain-dependent and usually developed for specific problem formulations. Nevertheless, similar domains can adapt solutions with modifications. This work also investigates the significance of data modeling in outlier detection techniques in surveillance, fault detection, and trend analysis, also referred to as novelty detection, a semisupervised task where the algorithm learns to recognize abnormality while being taught the normal class.</p> </description>
<link>https://papers.cool/arxiv/2306.06139</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2306.06139</guid>
<pubDate>Fri, 09 Jun 2023 07:00:00 GMT</pubDate>
<author>Ravindrakumar Purohit</author>
</item>
<item>
<title>A Dual-level Detection Method for Video Copy Detection</title>
<description><a href="https://papers.cool/arxiv/2305.12361">[Site]</a> <a href="https://papers.cool/query/2305.12361">[Kimi]</a> <p><b>Authors:</b> Tianyi Wang</p> <p>With the development of multimedia technology, Video Copy Detection has been a crucial problem for social media platforms. Meta AI hold Video Similarity Challenge on CVPR 2023 to push the technology forward. In this paper, we share our winner solutions on both tracks to help progress in this area. For Descriptor Track, we propose a dual-level detection method with Video Editing Detection (VED) and Frame Scenes Detection (FSD) to tackle the core challenges on Video Copy Detection. Experimental results demonstrate the effectiveness and efficiency of our proposed method. Code is available at https://github.com/FeipengMa6/VSC22-Submission.</p> </description>
<link>https://papers.cool/arxiv/2305.12361</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2305.12361</guid>
<pubDate>Sun, 21 May 2023 06:19:08 GMT</pubDate>
<author>Tianyi Wang</author>
</item>
<item>
<title>A Comparative Study of Face Detection Algorithms for Masked Face Detection</title>
<description><a href="https://papers.cool/arxiv/2305.11077">[Site]</a> <a href="https://papers.cool/query/2305.11077">[Kimi]</a> <p><b>Authors:</b> Sahel Mohammad Iqbal</p> <p>Contemporary face detection algorithms have to deal with many challenges such as variations in pose, illumination, and scale. A subclass of the face detection problem that has recently gained increasing attention is occluded face detection, or more specifically, the detection of masked faces. Three years on since the advent of the COVID-19 pandemic, there is still a complete lack of evidence regarding how well existing face detection algorithms perform on masked faces. This article first offers a brief review of state-of-the-art face detectors and detectors made for the masked face problem, along with a review of the existing masked face datasets. We evaluate and compare the performances of a well-representative set of face detectors at masked face detection and conclude with a discussion on the possible contributing factors to their performance.</p> </description>
<link>https://papers.cool/arxiv/2305.11077</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2305.11077</guid>
<pubDate>Thu, 18 May 2023 16:03:37 GMT</pubDate>
<author>Sahel Mohammad Iqbal</author>
</item>
<item>
<title>Context-Aware Chart Element Detection</title>
<description><a href="https://papers.cool/arxiv/2305.04151">[Site]</a> <a href="https://papers.cool/query/2305.04151">[Kimi]</a> <p><b>Authors:</b> Pengyu Yan</p> <p>As a prerequisite of chart data extraction, the accurate detection of chart basic elements is essential and mandatory. In contrast to object detection in the general image domain, chart element detection relies heavily on context information as charts are highly structured data visualization formats. To address this, we propose a novel method CACHED, which stands for Context-Aware Chart Element Detection, by integrating a local-global context fusion module consisting of visual context enhancement and positional context encoding with the Cascade R-CNN framework. To improve the generalization of our method for broader applicability, we refine the existing chart element categorization and standardized 18 classes for chart basic elements, excluding plot elements. Our CACHED method, with the updated category of chart elements, achieves state-of-the-art performance in our experiments, underscoring the importance of context in chart element detection. Extending our method to the bar plot detection task, we obtain the best result on the PMC test dataset.</p> </description>
<link>https://papers.cool/arxiv/2305.04151</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2305.04151</guid>
<pubDate>Sun, 07 May 2023 00:08:39 GMT</pubDate>
<author>Pengyu Yan</author>
</item>
<item>
<title>AGAD: Adversarial Generative Anomaly Detection</title>
<description><a href="https://papers.cool/arxiv/2304.04211">[Site]</a> <a href="https://papers.cool/query/2304.04211">[Kimi]</a> <p><b>Authors:</b> Jian Shi</p> <p>Anomaly detection suffered from the lack of anomalies due to the diversity of abnormalities and the difficulties of obtaining large-scale anomaly data. Semi-supervised anomaly detection methods are often used to solely leverage normal data to detect abnormalities that deviated from the learnt normality distributions. Meanwhile, given the fact that limited anomaly data can be obtained with a minor cost in practice, some researches also investigated anomaly detection methods under supervised scenarios with limited anomaly data. In order to address the lack of abnormal data for robust anomaly detection, we propose Adversarial Generative Anomaly Detection (AGAD), a self-contrast-based anomaly detection paradigm that learns to detect anomalies by generating \textit{contextual adversarial information} from the massive normal examples. Essentially, our method generates pseudo-anomaly data for both supervised and semi-supervised anomaly detection scenarios. Extensive experiments are carried out on multiple benchmark datasets and real-world datasets, the results show significant improvement in both supervised and semi-supervised scenarios. Importantly, our approach is data-efficient that can boost up the detection accuracy with no more than 5% anomalous training data.</p> </description>
<link>https://papers.cool/arxiv/2304.04211</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2304.04211</guid>
<pubDate>Sun, 09 Apr 2023 10:40:02 GMT</pubDate>
<author>Jian Shi</author>
</item>
<item>
<title>Entanglement detection with trace polynomials</title>
<description><a href="https://papers.cool/arxiv/2303.07761">[Site]</a> <a href="https://papers.cool/query/2303.07761">[Kimi]</a> <p><b>Authors:</b> Albert Rico</p> <p>We provide a systematic method for nonlinear entanglement detection based on trace polynomial inequalities. In particular, this allows to employ multi-partite witnesses for the detection of bipartite states, and vice versa. We identify witnesses for which linear detection of an entangled state fails, but for which nonlinear detection succeeds. With the trace polynomial formulation a great variety of witnesses arise from immamant inequalities, which can be implemented in the laboratory through randomized measurements.</p> </description>
<link>https://papers.cool/arxiv/2303.07761</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.07761</guid>
<pubDate>Tue, 14 Mar 2023 10:06:34 GMT</pubDate>
<author>Albert Rico</author>
</item>
<item>
<title>Achieving Counterfactual Fairness for Anomaly Detection</title>
<description><a href="https://papers.cool/arxiv/2303.02318">[Site]</a> <a href="https://papers.cool/query/2303.02318">[Kimi]</a> <p><b>Authors:</b> Xiao Han</p> <p>Ensuring fairness in anomaly detection models has received much attention recently as many anomaly detection applications involve human beings. However, existing fair anomaly detection approaches mainly focus on association-based fairness notions. In this work, we target counterfactual fairness, which is a prevalent causation-based fairness notion. The goal of counterfactually fair anomaly detection is to ensure that the detection outcome of an individual in the factual world is the same as that in the counterfactual world where the individual had belonged to a different group. To this end, we propose a counterfactually fair anomaly detection (CFAD) framework which consists of two phases, counterfactual data generation and fair anomaly detection. Experimental results on a synthetic dataset and two real datasets show that CFAD can effectively detect anomalies as well as ensure counterfactual fairness.</p> </description>
<link>https://papers.cool/arxiv/2303.02318</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.02318</guid>
<pubDate>Sat, 04 Mar 2023 04:45:12 GMT</pubDate>
<author>Xiao Han</author>
</item>
<item>
<title>Robust Detection Outcome: A Metric for Pathology Detection in Medical Images</title>
<description><a href="https://papers.cool/arxiv/2303.01920">[Site]</a> <a href="https://papers.cool/query/2303.01920">[Kimi]</a> <p><b>Authors:</b> Felix Meissen</p> <p>Detection of pathologies is a fundamental task in medical imaging and the evaluation of algorithms that can perform this task automatically is crucial. However, current object detection metrics for natural images do not reflect the specific clinical requirements in pathology detection sufficiently. To tackle this problem, we propose Robust Detection Outcome (RoDeO); a novel metric for evaluating algorithms for pathology detection in medical images, especially in chest X-rays. RoDeO evaluates different errors directly and individually, and reflects clinical needs better than current metrics. Extensive evaluation on the ChestX-ray8 dataset shows the superiority of our metrics compared to existing ones. We released the code at https://github.com/FeliMe/RoDeO and published RoDeO as pip package (rodeometric).</p> </description>
<link>https://papers.cool/arxiv/2303.01920</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.01920</guid>
<pubDate>Fri, 03 Mar 2023 13:45:13 GMT</pubDate>
<author>Felix Meissen</author>
</item>
<item>
<title>Benchmarking Deepart Detection</title>
<description><a href="https://papers.cool/arxiv/2302.14475">[Site]</a> <a href="https://papers.cool/query/2302.14475">[Kimi]</a> <p><b>Authors:</b> Yabin Wang</p> <p>Deepfake technologies have been blurring the boundaries between the real and unreal, likely resulting in malicious events. By leveraging newly emerged deepfake technologies, deepfake researchers have been making a great upending to create deepfake artworks (deeparts), which are further closing the gap between reality and fantasy. To address potentially appeared ethics questions, this paper establishes a deepart detection database (DDDB) that consists of a set of high-quality conventional art images (conarts) and five sets of deepart images generated by five state-of-the-art deepfake models. This database enables us to explore once-for-all deepart detection and continual deepart detection. For the two new problems, we suggest four benchmark evaluations and four families of solutions on the constructed DDDB. The comprehensive study demonstrates the effectiveness of the proposed solutions on the established benchmark dataset, which is capable of paving a way to more interesting directions of deepart detection. The constructed benchmark dataset and the source code will be made publicly available.</p> </description>
<link>https://papers.cool/arxiv/2302.14475</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2302.14475</guid>
<pubDate>Tue, 28 Feb 2023 10:34:44 GMT</pubDate>
<author>Yabin Wang</author>
</item>
<item>
<title>Towards Accurate Acne Detection via Decoupled Sequential Detection Head</title>
<description><a href="https://papers.cool/arxiv/2301.12219">[Site]</a> <a href="https://papers.cool/query/2301.12219">[Kimi]</a> <p><b>Authors:</b> Xin Wei</p> <p>Accurate acne detection plays a crucial role in acquiring precise diagnosis and conducting proper therapy. However, the ambiguous boundaries and arbitrary dimensions of acne lesions severely limit the performance of existing methods. In this paper, we address these challenges via a novel Decoupled Sequential Detection Head (DSDH), which can be easily adopted by mainstream two-stage detectors. DSDH brings two simple but effective improvements to acne detection. Firstly, the offset and scaling tasks are explicitly introduced, and their incompatibility is settled by our task-decouple mecha |
TonyRL
reviewed
Dec 16, 2024
|
Successfully generated as following: http://localhost:1200/papers/query/Detection - Success ✔️<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
<channel>
<title>undefined</title>
<link>https://papers.cool/arxiv/search?highlight=1&query=undefined&sort=0</link>
<atom:link href="http://localhost:1200/papers/query/Detection" rel="self" type="application/rss+xml"></atom:link>
<description>undefined - Powered by RSSHub</description>
<generator>RSSHub</generator>
<webMaster>[email protected] (RSSHub)</webMaster>
<language>en</language>
<lastBuildDate>Tue, 17 Dec 2024 14:23:17 GMT</lastBuildDate>
<ttl>5</ttl>
<item>
<title>Estimating Spillover Effects in the Presence of Isolated Nodes</title>
<description><a href="https://papers.cool/arxiv/2412.05919">[Site]</a> <a href="https://papers.cool/Detection/2412.05919">[Kimi]</a> <p><b>Authors:</b> Bora Kim</p> <p>In estimating spillover effects under network interference, practitioners often use linear regression with either the number or fraction of treated neighbors as regressors. An often overlooked fact is that the latter is undefined for units without neighbors (``isolated nodes"). The common practice is to impute this fraction as zero for isolated nodes. This paper shows that such practice introduces bias through theoretical derivations and simulations. Causal interpretations of the commonly used spillover regression coefficients are also provided.</p> </description>
<link>https://papers.cool/arxiv/2412.05919</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.05919</guid>
<pubDate>Sun, 08 Dec 2024 12:28:54 GMT</pubDate>
<author>Bora Kim</author>
</item>
<item>
<title>Surveying the Rust Verification Landscape</title>
<description><a href="https://papers.cool/arxiv/2410.01981">[Site]</a> <a href="https://papers.cool/Detection/2410.01981">[Kimi]</a> <p><b>Authors:</b> Alex Le Blanc</p> <p>Rust aims to be a safe programming language applicable to systems programming applications. In particular, its type system has strong guardrails to prevent a variety of issues, such as memory safety bugs and data races. However, these guardrails can be sidestepped via the unsafe keyword. unsafe allows certain otherwise-prohibited operations, but shifts the onus of preventing undefined behaviour from the Rust language's compile-time checks to the developer. We believe that tools have a role to play in ensuring the absence of undefined behaviour in the presence of unsafe code. Moreover, safety aside, programs would also benefit from being verified for functional correctness, ensuring that they meet their specifications. In this research proposal, we explore what it means to do Rust verification. Specifically, we explore which properties are worth verifying for Rust; what techniques exist to verify them; and which code is worth verifying. In doing so, we motivate an effort to verify safety properties of the Rust standard library, presenting the relevant challenges along with ideas to address them.</p> </description>
<link>https://papers.cool/arxiv/2410.01981</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.01981</guid>
<pubDate>Wed, 02 Oct 2024 19:40:18 GMT</pubDate>
<author>Alex Le Blanc</author>
</item>
<item>
<title>Quantum Black Hole as a Harmonic Oscillator from the Perspective of the Minimum Uncertainty Approach</title>
<description><a href="https://papers.cool/arxiv/2409.09181">[Site]</a> <a href="https://papers.cool/Detection/2409.09181">[Kimi]</a> <p><b>Authors:</b> Octavio Obregón</p> <p>Starting from the Wheeler-DeWitt equation for the Schwarzschild black hole interior, which is derived from a Hamiltonian formulated in terms of canonical phase space coordinates, we show that by applying a simple reparametrization, this equation can be expressed as the eigenvalue equation of a quantum linear harmonic oscillator. Within the standard quantization framework, we find that the resulting wave function diverges in the region of the classical singularity, and the expectation value of the Kretschmann scalar is undefined for all states within the black hole. However, when we apply the minimal uncertainty approach to the quantization process, we obtain a wave function that is both well-defined and square-integrable. Additionally, the expectation value of the Kretschmann scalar for these states remains finite throughout the black hole's interior, suggesting that the classical singularity is resolved in this approach, replaced it by a minimum radius.</p> </description>
<link>https://papers.cool/arxiv/2409.09181</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.09181</guid>
<pubDate>Fri, 13 Sep 2024 20:37:43 GMT</pubDate>
<author>Octavio Obregón</author>
</item>
<item>
<title>From annular to toroidal pseudo knots</title>
<description><a href="https://papers.cool/arxiv/2409.03537">[Site]</a> <a href="https://papers.cool/Detection/2409.03537">[Kimi]</a> <p><b>Authors:</b> Ioannis Diamantis</p> <p>In this paper, we extend the theory of planar pseudo knots to the theories of annular and toroidal pseudo knots. Pseudo knots are defined as equivalence classes under Reidemeister-like moves of knot diagrams characterized by crossings with undefined over/under information. In the theories of annular and toroidal pseudo knots we introduce their respective lifts to the solid and the thickened torus. Then, we interlink these theories by representing annular and toroidal pseudo knots as planar ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. We also explore the inclusion relations between planar, annular and toroidal pseudo knots, as well as of ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. Finally, we extend the planar weighted resolution set to annular and toroidal pseudo knots, defining new invariants for classifying pseudo knots and links in the solid and in the thickened torus.</p> </description>
<link>https://papers.cool/arxiv/2409.03537</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.03537</guid>
<pubDate>Thu, 05 Sep 2024 13:53:34 GMT</pubDate>
<author>Ioannis Diamantis</author>
</item>
<item>
<title>BiGS: Bidirectional Gaussian Primitives for Relightable 3D Gaussian Splatting</title>
<description><a href="https://papers.cool/arxiv/2408.13370">[Site]</a> <a href="https://papers.cool/Detection/2408.13370">[Kimi]</a> <p><b>Authors:</b> Zhenyuan Liu</p> <p>We present Bidirectional Gaussian Primitives, an image-based novel view synthesis technique designed to represent and render 3D objects with surface and volumetric materials under dynamic illumination. Our approach integrates light intrinsic decomposition into the Gaussian splatting framework, enabling real-time relighting of 3D objects. To unify surface and volumetric material within a cohesive appearance model, we adopt a light- and view-dependent scattering representation via bidirectional spherical harmonics. Our model does not use a specific surface normal-related reflectance function, making it more compatible with volumetric representations like Gaussian splatting, where the normals are undefined. We demonstrate our method by reconstructing and rendering objects with complex materials. Using One-Light-At-a-Time (OLAT) data as input, we can reproduce photorealistic appearances under novel lighting conditions in real time.</p> </description>
<link>https://papers.cool/arxiv/2408.13370</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2408.13370</guid>
<pubDate>Fri, 23 Aug 2024 21:04:40 GMT</pubDate>
<author>Zhenyuan Liu</author>
</item>
<item>
<title>A Continued Fractions Theory for the completion of the Puiseux field</title>
<description><a href="https://papers.cool/arxiv/2407.05454">[Site]</a> <a href="https://papers.cool/Detection/2407.05454">[Kimi]</a> <p><b>Authors:</b> Luis Arenas-Carmona</p> <p>In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients are polynomials in roots of the variable, and that this approximation is the best ''rational'' Diophantine approximation of such element. Then, we interpret the preceding result in terms of the action of a suitable arithmetic subgroup of the special linear group on the Berkovich space defined over the said completion. We also explore the connections between points of type IV of the Berkovich space in terms of some ''non-convergent'' or ''undefined'' continued fractions, in a sense that we make precise in the text.</p> </description>
<link>https://papers.cool/arxiv/2407.05454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.05454</guid>
<pubDate>Sun, 07 Jul 2024 17:37:38 GMT</pubDate>
<author>Luis Arenas-Carmona</author>
</item>
<item>
<title>A Calculus for Unreachable Code</title>
<description><a href="https://papers.cool/arxiv/2407.04917">[Site]</a> <a href="https://papers.cool/Detection/2407.04917">[Kimi]</a> <p><b>Authors:</b> Peter Zhong</p> <p>In Racket, the LLVM IR, Rust, and other modern languages, programmers and static analyses can hint, with special annotations, that certain parts of a program are unreachable. Same as other assumptions about undefined behavior; the compiler assumes these hints are correct and transforms the program aggressively. While compile-time transformations due to undefined behavior often perplex compiler writers and developers, we show that the essence of transformations due to unreachable code can be distilled in a surprisingly small set of simple formal rules. Specifically, following the well-established tradition of understanding linguistic phenomena through calculi, we introduce the first calculus for unreachable. Its term-rewriting rules that take advantage of unreachable fall into two groups. The first group allows the compiler to delete any code downstream of unreachable, and any effect-free code upstream of unreachable. The second group consists of rules that eliminate conditional expressions when one of their branches is unreachable. We show the correctness of the rules with a novel logical relation, and we examine how they correspond to transformations due to unreachable in Racket and LLVM.</p> </description>
<link>https://papers.cool/arxiv/2407.04917</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.04917</guid>
<pubDate>Sat, 06 Jul 2024 01:49:57 GMT</pubDate>
<author>Peter Zhong</author>
</item>
<item>
<title>Jackknife inference with two-way clustering</title>
<description><a href="https://papers.cool/arxiv/2406.08880">[Site]</a> <a href="https://papers.cool/Detection/2406.08880">[Kimi]</a> <p><b>Authors:</b> James G. MacKinnon</p> <p>For linear regression models with cross-section or panel data, it is natural to assume that the disturbances are clustered in two dimensions. However, the finite-sample properties of two-way cluster-robust tests and confidence intervals are often poor. We discuss several ways to improve inference with two-way clustering. Two of these are existing methods for avoiding, or at least ameliorating, the problem of undefined standard errors when a cluster-robust variance matrix estimator (CRVE) is not positive definite. One is a new method that always avoids the problem. More importantly, we propose a family of new two-way CRVEs based on the cluster jackknife. Simulations for models with two-way fixed effects suggest that, in many cases, the cluster-jackknife CRVE combined with our new method yields surprisingly accurate inferences. We provide a simple software package, twowayjack for Stata, that implements our recommended variance estimator.</p> </description>
<link>https://papers.cool/arxiv/2406.08880</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2406.08880</guid>
<pubDate>Thu, 13 Jun 2024 07:31:46 GMT</pubDate>
<author>James G. MacKinnon</author>
</item>
<item>
<title>Defining Requirements Strategies in Agile: A Design Science Research Study</title>
<description><a href="https://papers.cool/arxiv/2405.18847">[Site]</a> <a href="https://papers.cool/Detection/2405.18847">[Kimi]</a> <p><b>Authors:</b> Amna Pir Muhammad</p> <p>Research shows that many of the challenges currently encountered with agile development are related to requirements engineering. Based on design science research, this paper investigates critical challenges that arise in agile development from an undefined requirements strategy. We explore potential ways to address these challenges and synthesize the key building blocks of requirements strategies. Our design science research rests on a multiple case study with three industrial cases in the domains of communication technology, security services, and automotive. We relied on a total of 20 interviews, two workshops, participant observation in two cases, and document analysis in each of the cases to understand concrete challenges and workflows. In each case, we define a requirements strategy in collaboration with process managers and experienced engineers. From this experience, we extract guidelines for defining requirements strategies in agile development.</p> </description>
<link>https://papers.cool/arxiv/2405.18847</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.18847</guid>
<pubDate>Wed, 29 May 2024 07:57:32 GMT</pubDate>
<author>Amna Pir Muhammad</author>
</item>
<item>
<title>Analysis of Broken Randomized Experiments by Principal Stratification</title>
<description><a href="https://papers.cool/arxiv/2405.16780">[Site]</a> <a href="https://papers.cool/Detection/2405.16780">[Kimi]</a> <p><b>Authors:</b> Qinqing Liu</p> <p>Although randomized controlled trials have long been regarded as the ``gold standard'' for evaluating treatment effects, there is no natural prevention from post-treatment events. For example, non-compliance makes the actual treatment different from the assigned treatment, truncation-by-death renders the outcome undefined or ill-defined, and missingness prevents the outcomes from being measured. In this paper, we develop a statistical analysis framework using principal stratification to investigate the treatment effect in broken randomized experiments. The average treatment effect in compliers and always-survivors is adopted as the target causal estimand. We establish the asymptotic property for the estimator. We apply the framework to study the effect of training on earnings in the Job Corps Study and find that the training program does not have an effect on employment but possibly have an effect on improving the earnings after employment.</p> </description>
<link>https://papers.cool/arxiv/2405.16780</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.16780</guid>
<pubDate>Mon, 27 May 2024 03:05:29 GMT</pubDate>
<author>Qinqing Liu</author>
</item>
<item>
<title>A Study of Undefined Behavior Across Foreign Function Boundaries in Rust Libraries</title>
<description><a href="https://papers.cool/arxiv/2404.11671">[Site]</a> <a href="https://papers.cool/Detection/2404.11671">[Kimi]</a> <p><b>Authors:</b> Ian McCormack</p> <p>Developers rely on the Rust programming language's static safety guarantees to write secure and performant applications. However, Rust is frequently used to interoperate with other languages which allow design patterns that conflict with Rust's aliasing models. Miri is the only dynamic analysis tool capable of validating applications against these models, but it does not support foreign functions, indicating that there may be a critical correctness gap at the heart of the Rust ecosystem. We conducted a large-scale evaluation of Rust libraries that call foreign functions to determine whether Miri's dynamic analyses remain useful in this context. We used Miri and an LLVM interpreter to jointly execute applications that call foreign functions, where we found 48 instances of undefined or undesired behavior. These include three bugs from libraries that had over 10,000 daily downloads on average during our observation period and one from a library maintained by the Rust Project. Many of the errors we found involved incompatible aliasing patterns, but Rust's latest Tree Borrows aliasing model was significantly more permissive than the earlier Stacked Borrows model. The Rust community must invest in new, production-ready tooling for multi-language applications to ensure that developers can detect these errors.</p> </description>
<link>https://papers.cool/arxiv/2404.11671</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2404.11671</guid>
<pubDate>Wed, 17 Apr 2024 18:12:05 GMT</pubDate>
<author>Ian McCormack</author>
</item>
<item>
<title>EventRL: Enhancing Event Extraction with Outcome Supervision for Large Language Models</title>
<description><a href="https://papers.cool/arxiv/2402.11430">[Site]</a> <a href="https://papers.cool/Detection/2402.11430">[Kimi]</a> <p><b>Authors:</b> Jun Gao</p> <p>In this study, we present EventRL, a reinforcement learning approach developed to enhance event extraction for large language models (LLMs). EventRL utilizes outcome supervision with specific reward functions to tackle prevalent challenges in LLMs, such as instruction following and hallucination, manifested as the mismatch of event structure and the generation of undefined event types. We evaluate EventRL against existing methods like Few-Shot Prompting (FSP) (based on GPT4) and Supervised Fine-Tuning (SFT) across various LLMs, including GPT-4, LLaMa, and CodeLLaMa models. Our findings show that EventRL significantly outperforms these conventional approaches by improving the performance in identifying and structuring events, particularly in handling novel event types. The study emphasizes the critical role of reward function selection and demonstrates the benefits of incorporating code data for better event extraction. While increasing model size leads to higher accuracy, maintaining the ability to generalize is essential to avoid overfitting.</p> </description>
<link>https://papers.cool/arxiv/2402.11430</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2402.11430</guid>
<pubDate>Sun, 18 Feb 2024 02:41:06 GMT</pubDate>
<author>Jun Gao</author>
</item>
<item>
<title>SECOMP: Formally Secure Compilation of Compartmentalized C Programs</title>
<description><a href="https://papers.cool/arxiv/2401.16277">[Site]</a> <a href="https://papers.cool/Detection/2401.16277">[Kimi]</a> <p><b>Authors:</b> Jérémy Thibault</p> <p>Undefined behavior in C often causes devastating security vulnerabilities. One practical mitigation is compartmentalization, which allows developers to structure large programs into mutually distrustful compartments with clearly specified privileges and interactions. In this paper we introduce SECOMP, a compiler for compartmentalized C code that comes with machine-checked proofs guaranteeing that the scope of undefined behavior is restricted to the compartments that encounter it and become dynamically compromised. These guarantees are formalized as the preservation of safety properties against adversarial contexts, a secure compilation criterion similar to full abstraction, and this is the first time such a strong criterion is proven for a mainstream programming language. To achieve this we extend the languages of the CompCert verified C compiler with isolated compartments that can only interact via procedure calls and returns, as specified by cross-compartment interfaces. We adapt the passes and optimizations of CompCert as well as their correctness proofs to this compartment-aware setting. We then use compiler correctness as an ingredient in a larger secure compilation proof that involves several proof engineering novelties, needed to scale formally secure compilation up to a C compiler.</p> </description>
<link>https://papers.cool/arxiv/2401.16277</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2401.16277</guid>
<pubDate>Mon, 29 Jan 2024 16:32:36 GMT</pubDate>
<author>Jérémy Thibault</author>
</item>
<item>
<title>Taming numerical imprecision by adapting the KL divergence to negative probabilities</title>
<description><a href="https://papers.cool/arxiv/2312.13021">[Site]</a> <a href="https://papers.cool/Detection/2312.13021">[Kimi]</a> <p><b>Authors:</b> Simon Pfahler</p> <p>The Kullback-Leibler (KL) divergence is frequently used in data science. For discrete distributions on large state spaces, approximations of probability vectors may result in a few small negative entries, rendering the KL divergence undefined. We address this problem by introducing a parameterized family of substitute divergence measures, the shifted KL (sKL) divergence measures. Our approach is generic and does not increase the computational overhead. We show that the sKL divergence shares important theoretical properties with the KL divergence and discuss how its shift parameters should be chosen. If Gaussian noise is added to a probability vector, we prove that the average sKL divergence converges to the KL divergence for small enough noise. We also show that our method solves the problem of negative entries in an application from computational oncology, the optimization of Mutual Hazard Networks for cancer progression using tensor-train approximations.</p> </description>
<link>https://papers.cool/arxiv/2312.13021</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.13021</guid>
<pubDate>Wed, 20 Dec 2023 13:42:00 GMT</pubDate>
<author>Simon Pfahler</author>
</item>
<item>
<title>Performance rating in chess, tennis, and other contexts</title>
<description><a href="https://papers.cool/arxiv/2312.12700">[Site]</a> <a href="https://papers.cool/Detection/2312.12700">[Kimi]</a> <p><b>Authors:</b> Mehmet S. Ismail</p> <p>In this note, I introduce Estimated Performance Rating (PR$^e$), a novel system for evaluating player performance in sports and games. PR$^e$ addresses a key limitation of the Tournament Performance Rating (TPR) system, which is undefined for zero or perfect scores in a series of games. PR$^e$ is defined as the rating that solves an optimization problem related to scoring probability, making it applicable for any performance level. The main theorem establishes that the PR$^e$ of a player is equivalent to the TPR whenever the latter is defined. I then apply this system to historically significant win-streaks in association football, tennis, and chess. Beyond sports, PR$^e$ has broad applicability in domains where Elo ratings are used, from college rankings to the evaluation of large language models.</p> </description>
<link>https://papers.cool/arxiv/2312.12700</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.12700</guid>
<pubDate>Wed, 20 Dec 2023 01:47:55 GMT</pubDate>
<author>Mehmet S. Ismail</author>
</item>
<item>
<title>Memory Simulations, Security and Optimization in a Verified Compiler</title>
<description><a href="https://papers.cool/arxiv/2312.08117">[Site]</a> <a href="https://papers.cool/Detection/2312.08117">[Kimi]</a> <p><b>Authors:</b> VERIMAG - IMAG David Monniaux</p> <p>Current compilers implement security features and optimizations that require nontrivial semantic reasoning about pointers and memory allocation: the program after the insertion of the security feature, or after applying the optimization, must simulate the original program despite a different memory layout. In this article, we illustrate such reasoning on pointer allocations through memory extensions and injections, as well as fine points on undefined values, by explaining how we implemented and proved correct two security features (stack canaries and pointer authentication) and one optimization (tail recursion elimination) in the CompCert formally verified compiler.</p> </description>
<link>https://papers.cool/arxiv/2312.08117</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.08117</guid>
<pubDate>Wed, 13 Dec 2023 13:11:05 GMT</pubDate>
<author>VERIMAG - IMAG David Monniaux</author>
</item>
<item>
<title>Coherent control of two Jaynes-Cummings cavities</title>
<description><a href="https://papers.cool/arxiv/2312.06984">[Site]</a> <a href="https://papers.cool/Detection/2312.06984">[Kimi]</a> <p><b>Authors:</b> L. O. Castaños-Cervantes</p> <p>In this work, we uncover new features on the study of a two-level atom interacting with one of two cavities in a coherent superposition. The James-Cummings model is used to describe the atom-field interaction and to study the effects of quantum indefiniteness on such an interaction. We show that coherent control of the two cavities in an undefined manner allows novel possibilities to manipulate the atomic dynamics on demand which are not achievable in the conventional way. In addition, it is shown that the coherent control of the atom creates highly entangled states of the cavity fields taking a Bell-like or Schrödinger-cat-like state form. Our results are a step forward to understand and harness quantum systems in a coherent control, and open a new research avenue in the study of atom-field interaction exploiting quantum indefiniteness.</p> </description>
<link>https://papers.cool/arxiv/2312.06984</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.06984</guid>
<pubDate>Tue, 12 Dec 2023 05:03:13 GMT</pubDate>
<author>L. O. Castaños-Cervantes</author>
</item>
<item>
<title>Personality of AI</title>
<description><a href="https://papers.cool/arxiv/2312.02998">[Site]</a> <a href="https://papers.cool/Detection/2312.02998">[Kimi]</a> <p><b>Authors:</b> Byunggu Yu</p> <p>This research paper delves into the evolving landscape of fine-tuning large language models (LLMs) to align with human users, extending beyond basic alignment to propose "personality alignment" for language models in organizational settings. Acknowledging the impact of training methods on the formation of undefined personality traits in AI models, the study draws parallels with human fitting processes using personality tests. Through an original case study, we demonstrate the necessity of personality fine-tuning for AIs and raise intriguing questions about applying human-designed tests to AIs, engineering specialized AI personality tests, and shaping AI personalities to suit organizational roles. The paper serves as a starting point for discussions and developments in the burgeoning field of AI personality alignment, offering a foundational anchor for future exploration in human-machine teaming and co-existence.</p> </description>
<link>https://papers.cool/arxiv/2312.02998</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.02998</guid>
<pubDate>Sun, 03 Dec 2023 18:23:45 GMT</pubDate>
<author>Byunggu Yu</author>
</item>
<item>
<title>3vLTL: A Tool to Generate Automata for Three-valued LTL</title>
<description><a href="https://papers.cool/arxiv/2311.09787">[Site]</a> <a href="https://papers.cool/Detection/2311.09787">[Kimi]</a> <p><b>Authors:</b> Imperial College London Francesco Belardinelli</p> <p>Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multi-valued specification languages. We present 3vLTL, a tool to generate Buchi automata from formulas in Linear-time Temporal Logic (LTL) interpreted on a three-valued semantics. Given an LTL formula, a set of atomic propositions as the alphabet for the automaton, and a truth value, our procedure generates a Buchi automaton that accepts all the words that assign the chosen truth value to the LTL formula. Given the particular type of the output of the tool, it can also be seamlessly processed by third-party libraries in a natural way. That is, the Buchi automaton can then be used in the context of formal verification to check whether an LTL formula is true, false, or undefined on a given model.</p> </description>
<link>https://papers.cool/arxiv/2311.09787</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2311.09787</guid>
<pubDate>Thu, 16 Nov 2023 11:04:38 GMT</pubDate>
<author>Imperial College London Francesco Belardinelli</author>
</item>
<item>
<title>One-Way Communication Complexity of Partial XOR Functions</title>
<description><a href="https://papers.cool/arxiv/2310.20606">[Site]</a> <a href="https://papers.cool/Detection/2310.20606">[Kimi]</a> <p><b>Authors:</b> Vladimir V. Podolskii</p> <p>Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y)=f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known that deterministic communication complexity of $F$ is closely related to parity decision tree complexity of $f$. Montanaro and Osbourne (2009) observed that one-sided communication complexity $D_{cc}^{\rightarrow}(F)$ of $F$ is exactly equal to nonadaptive parity decision tree complexity $NADT^{\oplus}(f)$ of $f$. Hatami et al. (2018) showed that unrestricted communication complexity of $F$ is polynomially related to parity decision tree complexity of $f$. We initiate the studies of a similar connection for partial functions. We show that in case of one-sided communication complexity whether these measures are equal, depends on the number of undefined inputs of $f$. On the one hand, if $D_{cc}^{\rightarrow}(F)=t$ and $f$ is undefined on at most $O(\frac{2^{n-t}}{\sqrt{n-t}})$, then $NADT^{\oplus}(f)=t$. On the other hand, for a wide range of values of $D_{cc}^{\rightarrow}(F)$ and $NADT^{\oplus}(f)$ (from constant to $n-2$) we provide partial functions for which $D_{cc}^{\rightarrow}(F) &lt; NADT^{\oplus}(f)$. In particular, we provide a function with an exponential gap between the two measures. Our separation results translate to the case of two-sided communication complexity as well, in particular showing that the result of Hatami et al. (2018) cannot be generalized to partial functions. Previous results for total functions heavily rely on Boolean Fourier analysis and the technique does not translate to partial functions. For the proofs of our results we build a linear algebraic framework instead. Separation results are proved through the reduction to covering codes.</p> </description>
<link>https://papers.cool/arxiv/2310.20606</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.20606</guid>
<pubDate>Tue, 31 Oct 2023 16:42:10 GMT</pubDate>
<author>Vladimir V. Podolskii</author>
</item>
<item>
<title>Heavy-light $N+1$ clusters of two-dimensional fermions</title>
<description><a href="https://papers.cool/arxiv/2310.11330">[Site]</a> <a href="https://papers.cool/Detection/2310.11330">[Kimi]</a> <p><b>Authors:</b> J. Givois</p> <p>We study binding of $N$ identical heavy fermions by a light atom in two dimensions assuming zero-range attractive heavy-light interactions. By using the mean-field theory valid for large $N$ we show that the $N+1$ cluster is bound when the mass ratio exceeds $1.074N^2$. The mean-field theory, being scale invariant in two dimensions, predicts only the shapes of the clusters leaving their sizes and energies undefined. By taking into account beyond-mean-field effects we find closed-form expressions for these quantities. We also discuss differences between the Thomas-Fermi and Hartree-Fock approaches for treating the heavy fermions.</p> </description>
<link>https://papers.cool/arxiv/2310.11330</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.11330</guid>
<pubDate>Tue, 17 Oct 2023 15:08:23 GMT</pubDate>
<author>J. Givois</author>
</item>
<item>
<title>On Two- and Three-valued Semantics for Impure Simplicial Complexes</title>
<description><a href="https://papers.cool/arxiv/2310.00989">[Site]</a> <a href="https://papers.cool/Detection/2310.00989">[Kimi]</a> <p><b>Authors:</b> Hans van Ditmarsch</p> <p>Simplicial complexes are a convenient semantic primitive to reason about processes (agents) communicating with each other in synchronous and asynchronous computation. Impure simplicial complexes distinguish active processes from crashed ones, in other words, agents that are alive from agents that are dead. In order to rule out that dead agents reason about themselves and about other agents, three-valued epistemic semantics have been proposed where, in addition to the usual values true and false, the third value stands for undefined: the knowledge of dead agents is undefined and so are the propositional variables describing their local state. Other semantics for impure complexes are two-valued where a dead agent knows everything. Different choices in designing a semantics produce different three-valued semantics, and also different two-valued semantics. In this work, we categorize the available choices by discounting the bad ones, identifying the equivalent ones, and connecting the non-equivalent ones via a translation. The main result of the paper is identifying the main relevant distinction to be the number of truth values and bridging this difference by means of a novel embedding from three- into two-valued semantics. This translation also enables us to highlight quite fundamental modeling differences underpinning various two- and three-valued approaches in this area of combinatorial topology. In particular, pure complexes can be defined as those invariant under the translation.</p> </description>
<link>https://papers.cool/arxiv/2310.00989</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.00989</guid>
<pubDate>Mon, 02 Oct 2023 08:56:26 GMT</pubDate>
<author>Hans van Ditmarsch</author>
</item>
<item>
<title>Innovative Digital Storytelling with AIGC: Exploration and Discussion of Recent Advances</title>
<description><a href="https://papers.cool/arxiv/2309.14329">[Site]</a> <a href="https://papers.cool/Detection/2309.14329">[Kimi]</a> <p><b>Authors:</b> Rongzhang Gu</p> <p>Digital storytelling, as an art form, has struggled with cost-quality balance. The emergence of AI-generated Content (AIGC) is considered as a potential solution for efficient digital storytelling production. However, the specific form, effects, and impacts of this fusion remain unclear, leaving the boundaries of AIGC combined with storytelling undefined. This work explores the current integration state of AIGC and digital storytelling, investigates the artistic value of their fusion in a sample project, and addresses common issues through interviews. Through our study, we conclude that AIGC, while proficient in image creation, voiceover production, and music composition, falls short of replacing humans due to the irreplaceable elements of human creativity and aesthetic sensibilities at present, especially in complex character animations, facial expressions, and sound effects. The research objective is to increase public awareness of the current state, limitations, and challenges arising from combining AIGC and digital storytelling.</p> </description>
<link>https://papers.cool/arxiv/2309.14329</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2309.14329</guid>
<pubDate>Mon, 25 Sep 2023 17:54:29 GMT</pubDate>
<author>Rongzhang Gu</author>
</item>
<item>
<title>Polarization Jumps across Topological Phase Transitions in Two-dimensional Systems</title>
<description><a href="https://papers.cool/arxiv/2304.12742">[Site]</a> <a href="https://papers.cool/Detection/2304.12742">[Kimi]</a> <p><b>Authors:</b> Hiroki Yoshida</p> <p>In topological phase transitions involving a change in topological invariants such as the Chern number and the $\mathbb{Z}_2$ topological invariant, the gap closes, and the electric polarization becomes undefined at the transition. In this paper, we show that the jump of polarization across such topological phase transitions in two dimensions is described in terms of positions and monopole charges of Weyl points in the intermediate Weyl semimetal phase. We find that the jump of polarization is described by the Weyl dipole at $\mathbb{Z}_2$ topological phase transitions and at phase transitions without any change in the value of the Chern number. Meanwhile, when the Chern number changes at the phase transition, the jump is expressed in terms of the relative positions of Weyl points measured from a reference point in the reciprocal space.</p> </description>
<link>https://papers.cool/arxiv/2304.12742</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2304.12742</guid>
<pubDate>Tue, 25 Apr 2023 11:36:08 GMT</pubDate>
<author>Hiroki Yoshida</author>
</item>
<item>
<title>MINER: A Hybrid Data-Driven Approach for REST API Fuzzing</title>
<description><a href="https://papers.cool/arxiv/2303.02545">[Site]</a> <a href="https://papers.cool/Detection/2303.02545">[Kimi]</a> <p><b>Authors:</b> Chenyang Lyu</p> <p>In recent years, REST API fuzzing has emerged to explore errors on a cloud service. Its performance highly depends on the sequence construction and request generation. However, existing REST API fuzzers have trouble generating long sequences with well-constructed requests to trigger hard-to-reach states in a cloud service, which limits their performance of finding deep errors and security bugs. Further, they cannot find the specific errors caused by using undefined parameters during request generation. Therefore, in this paper, we propose a novel hybrid data-driven solution, named MINER, with three new designs working together to address the above limitations. First, MINER collects the valid sequences whose requests pass the cloud service's checking as the templates, and assigns more executions to long sequence templates. Second, to improve the generation quality of requests in a sequence template, MINER creatively leverages the state-of-the-art neural network model to predict key request parameters and provide them with appropriate parameter values. Third, MINER implements a new data-driven security rule checker to capture the new kind of errors caused by undefined parameters. We evaluate MINER against the state-of-the-art fuzzer RESTler on GitLab, Bugzilla, and WordPress via 11 REST APIs. The results demonstrate that the average pass rate of MINER is 23.42% higher than RESTler. MINER finds 97.54% more unique errors than RESTler on average and 142.86% more reproducible errors after manual analysis. We have reported all the newly found errors, and 7 of them have been confirmed as logic bugs by the corresponding vendors.</p> </description>
<link>https://papers.cool/arxiv/2303.02545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.02545</guid>
<pubDate>Sun, 05 Mar 2023 01:41:41 GMT</pubDate>
<author>Chenyang Lyu</author>
</item>
<item>
<title>The variance-gamma ratio distribution</title>
<description><a href="https://papers.cool/arxiv/2302.12581">[Site]</a> <a href="https://papers.cool/Detection/2302.12581">[Kimi]</a> <p><b>Authors:</b> Robert E. Gaunt</p> <p>Let $X$ and $Y$ be independent variance-gamma random variables with zero location parameter; then the exact probability density function of the ratio $X/Y$ is derived. Some basic distributional properties are also derived, including identification of parameter regimes under which the density is bounded, asymptotic approximations of tail probabilities, and fractional moments; in particular, we see that the mean is undefined. In the case that $X$ and $Y$ are independent symmetric variance-gamma random variables, an exact formula is also given for the cumulative distribution function of the ratio $X/Y$.</p> </description>
<link>https://papers.cool/arxiv/2302.12581</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2302.12581</guid>
<pubDate>Fri, 24 Feb 2023 11:40:20 GMT</pubDate>
<author>Robert E. Gaunt</author>
</item>
<item>
<title>Generalized PTR: User-Friendly Recipes for Data-Adaptive Algorithms with Differential Privacy</title>
<description><a href="https://papers.cool/arxiv/2301.00301">[Site]</a> <a href="https://papers.cool/Detection/2301.00301">[Kimi]</a> <p><b>Authors:</b> Rachel Redberg</p> <p>The ''Propose-Test-Release'' (PTR) framework is a classic recipe for designing differentially private (DP) algorithms that are data-adaptive, i.e. those that add less noise when the input dataset is nice. We extend PTR to a more general setting by privately testing data-dependent privacy losses rather than local sensitivity, hence making it applicable beyond the standard noise-adding mechanisms, e.g. to queries with unbounded or undefined sensitivity. We demonstrate the versatility of generalized PTR using private linear regression as a case study. Additionally, we apply our algorithm to solve an open problem from ''Private Aggregation of Teacher Ensembles (PATE)'' -- privately releasing the entire model with a delicate data-dependent analysis.</p> </description>
<link>https://papers.cool/arxiv/2301.00301</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2301.00301</guid>
<pubDate>Sat, 31 Dec 2022 22:22:53 GMT</pubDate>
<author>Rachel Redberg</author>
</item>
<item>
<title>Modular Formal Verification of Rust Programs with Unsafe Blocks</title>
<description><a href="https://papers.cool/arxiv/2212.12976">[Site]</a> <a href="https://papers.cool/Detection/2212.12976">[Kimi]</a> <p><b>Authors:</b> Nima Rahimi Foroushaani</p> <p>Rust is a modern systems programming language whose type system guarantees memory safety. For the sake of expressivity and performance it allows programmers to relax typing rules temporarily, using unsafe code blocks. However, in unsafe blocks, the burden of making sure that the code does not end up having undefined behaviour is on the programmer. Even most expert programmers make mistakes and a memory safety bug in an unsafe block renders all the type system guarantees void. To address this problem we are trying to verify soundness of Rust unsafe code applying our Modular Symbolic Execution algorithm. This text outlines our approach and the progress that has been made so far.</p> </description>
<link>https://papers.cool/arxiv/2212.12976</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.12976</guid>
<pubDate>Mon, 26 Dec 2022 00:19:19 GMT</pubDate>
<author>Nima Rahimi Foroushaani</author>
</item>
<item>
<title>@C -- augmented version of C programming language</title>
<description><a href="https://papers.cool/arxiv/2212.11245">[Site]</a> <a href="https://papers.cool/Detection/2212.11245">[Kimi]</a> <p><b>Authors:</b> Iosif Iulian Petrila</p> <p>The augmented version of C programming language is presented. The language was completed with a series of low-level and high-level facilities to enlarge the language usage spectrum to various computing systems, operations, users. The ambiguities and inconsistencies have been resolved by managing problematic and undefined languages elements through an interpretation and management similar to that used in the case of other C syntax based languages. The proposed augmentative completeness elements, through @C approach, preserve the spirit of C language and its basic characteristics through compatibility with the standard version but also allow rejuvenation and bring C language to the present programming languages state of the art.</p> </description>
<link>https://papers.cool/arxiv/2212.11245</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.11245</guid>
<pubDate>Mon, 19 Dec 2022 07:53:14 GMT</pubDate>
<author>Iosif Iulian Petrila</author>
</item>
<item>
<title>Hunt for 3-Schur polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.14956">[Site]</a> <a href="https://papers.cool/Detection/2211.14956">[Kimi]</a> <p><b>Authors:</b> A. Morozov</p> <p>This paper describes our attempt to understand the recent success of Na Wang in constructing the 3-Schur polynomials, associated with the plane partitions. We provide a rather detailed review and try to figure out the new insights, which allowed to overcome the problems of the previous efforts. In result we provide a very simple definition of time-variables ${\bf P}_{i\geqslant j}$ and the cut-and-join operator $\hat W_2$, which generates the set of $3$-Schur functions. Some coefficients in $\hat W_2$ remain undefined and require more effort to be fixed.</p> </description>
<link>https://papers.cool/arxiv/2211.14956</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.14956</guid>
<pubDate>Sun, 27 Nov 2022 22:28:20 GMT</pubDate>
<author>A. Morozov</author>
</item>
<item>
<title>Impure Simplicial Complexes: Complete Axiomatization</title>
<description><a href="https://papers.cool/arxiv/2211.13543">[Site]</a> <a href="https://papers.cool/Detection/2211.13543">[Kimi]</a> <p><b>Authors:</b> Rojo Randrianomentsoa</p> <p>Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment. Pure simplicial complexes describe message passing in asynchronous systems where all processes (agents) are alive, whereas impure simplicial complexes describe message passing in synchronous systems where processes may be dead (have crashed). Properties of impure simplicial complexes can be described in a three-valued multi-agent epistemic logic where the third value represents formulae that are undefined, e.g., the knowledge and local propositions of dead agents. In this work we present an axiomatization for the logic of the class of impure complexes and show soundness and completeness. The completeness proof involves the novel construction of the canonical simplicial model and requires a careful manipulation of undefined formulae.</p> </description>
<link>https://papers.cool/arxiv/2211.13543</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.13543</guid>
<pubDate>Thu, 24 Nov 2022 11:32:36 GMT</pubDate>
<author>Rojo Randrianomentsoa</author>
</item>
<item>
<title>Some Useful Collective Properties of Bessel, Marcum Q-Functions and Laguerre Polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.12260">[Site]</a> <a href="https://papers.cool/Detection/2211.12260">[Kimi]</a> <p><b>Authors:</b> Hakan Ozturk</p> <p>Special functions have been used widely in many problems of applied sciences. However, there are considerable numbers of problems in which exact solutions could not be achieved because of undefined sums or integrals involving special functions. These handicaps force researchers to seek new properties of special functions. Many problems that could not be solved so far would be solved by means of these efforts. Therefore in this article, we derived some useful properties and interrelations of each others of Bessel functions, Marcum Q-functions and Laguerre polynomials.</p> </description>
<link>https://papers.cool/arxiv/2211.12260</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.12260</guid>
<pubDate>Tue, 22 Nov 2022 13:22:47 GMT</pubDate>
<author>Hakan Ozturk</author>
</item>
<item>
<title>Francois Viete and his contribution to mathematics</title>
<description><a href="https://papers.cool/arxiv/2210.12545">[Site]</a> <a href="https://papers.cool/Detection/2210.12545">[Kimi]</a> <p><b>Authors:</b> Athanasios Paraskevopoulos</p> <p>This paper studies the work of the French mathematician Francois Viete, known as the "father of modern algebraic notation". Along with this fundamental change in algebra, Viete adopted a radically new notation based on Greek geometric equalities. Its letters represent values rather than types, and its given values are undefined. Where algebra had previously relied on polynomials as sets, Viete became the first modern algebraist to work with polynomials generated by operations, and the notations reflect these notions. His work was essential to his successors because it enabled those mathematicians who followed him to develop the mathematics we use today.</p> </description>
<link>https://papers.cool/arxiv/2210.12545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.12545</guid>
<pubDate>Sat, 22 Oct 2022 20:40:50 GMT</pubDate>
<author>Athanasios Paraskevopoulos</author>
</item>
<item>
<title>An Active Learning Reliability Method for Systems with Partially Defined Performance Functions</title>
<description><a href="https://papers.cool/arxiv/2210.02168">[Site]</a> <a href="https://papers.cool/Detection/2210.02168">[Kimi]</a> <p><b>Authors:</b> Jonathan Sadeghi</p> <p>In engineering design, one often wishes to calculate the probability that the performance of a system is satisfactory under uncertainty. State of the art algorithms exist to solve this problem using active learning with Gaussian process models. However, these algorithms cannot be applied to problems which often occur in the autonomous vehicle domain where the performance of a system may be undefined under certain circumstances. To solve this problem, we introduce a hierarchical model for the system performance, where undefined performance is classified before the performance is regressed. This enables active learning Gaussian process methods to be applied to problems where the performance of the system is sometimes undefined, and we demonstrate the effectiveness of our approach by testing our methodology on synthetic numerical examples for the autonomous driving domain.</p> </description>
<link>https://papers.cool/arxiv/2210.02168</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.02168</guid>
<pubDate>Wed, 05 Oct 2022 11:50:36 GMT</pubDate>
<author>Jonathan Sadeghi</author>
</item>
<item>
<title>Schroedinger cats and quantum complementarity</title>
<description><a href="https://papers.cool/arxiv/2210.01083">[Site]</a> <a href="https://papers.cool/Detection/2210.01083">[Kimi]</a> <p><b>Authors:</b> Lorenzo Maccone</p> <p>Complementarity tells us we cannot know precisely the values of all the properties of a quantum object at the same time: the precise determination of one property implies that the value of some other (complementary) property is undefined. E.g.the precise knowledge of the position of a particle implies that its momentum is undefined. Here we show that a Schroedinger cat has a well defined value of a property that is complementary to its ``being dead or alive'' property. Then, thanks to complementarity, it has an undefined value of the property ``being dead or alive''. In other words, the cat paradox is explained through quantum complementarity: of its many complementary properties, any quantum system, such as a cat, can have a well defined value only of one at a time. Schroedinger's cat has a definite value of a property which is complementary to ``being dead or alive'', so it is neither dead nor alive. Figuratively one can say it is both dead and alive. While this interpretation only uses textbook concepts (the Copenhagen interpretation), apparently it has never explicitly appeared in the literature. We detail how to build an Arduino based simulation of Schroedinger's experiment based on these concepts for science outreach events.</p> </description>
<link>https://papers.cool/arxiv/2210.01083</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.01083</guid>
<pubDate>Mon, 03 Oct 2022 17:00:42 GMT</pubDate>
<author>Lorenzo Maccone</author>
</item>
<item>
<title>Defining a credible interval is not always possible with "point-null'' priors: A lesser-known correlate of the Jeffreys-Lindley paradox</title>
<description><a href="https://papers.cool/arxiv/2210.00029">[Site]</a> <a href="https://papers.cool/Detection/2210.00029">[Kimi]</a> <p><b>Authors:</b> Harlan Campbell</p> <p>In many common situations, a Bayesian credible interval will be, given the same data, very similar to a frequentist confidence interval, and researchers will interpret these intervals in a similar fashion. However, no predictable similarity exists when credible intervals are based on model-averaged posteriors whenever one of the two nested models under consideration is a so called ''point-null''. Not only can this model-averaged credible interval be quite different than the frequentist confidence interval, in some cases it may be undefined. This is a lesser-known correlate of the Jeffreys-Lindley paradox and is of particular interest given the popularity of the Bayes factor for testing point-null hypotheses.</p> </description>
<link>https://papers.cool/arxiv/2210.00029</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.00029</guid>
<pubDate>Fri, 30 Sep 2022 18:08:56 GMT</pubDate>
<author>Harlan Campbell</author>
</item>
<item>
<title>Topologically protected four-dimensional optical singularities</title>
<description><a href="https://papers.cool/arxiv/2208.09054">[Site]</a> <a href="https://papers.cool/Detection/2208.09054">[Kimi]</a> <p><b>Authors:</b> Christina M. Spaegele</p> <p>Optical singularities play a major role in modern optics and are frequently deployed in structured light, super-resolution microscopy, and holography. While phase singularities are uniquely defined as locations of undefined phase, polarization singularities studied thus far are either partial, i.e., bright points of well-defined polarization, or unstable for small field perturbations. We demonstrate for the first time a complete, topologically protected polarization singularity; it is located in the 4D space spanned by the three spatial dimensions and the wavelength and is created in the focus of a cascaded metasurface-lens system. The field Jacobian plays a key role in the design of such higher-dimensional singularities, which can be extended to multidimensional wave phenomena, and pave the way to novel applications in topological photonics and precision sensing.</p> </description>
<link>https://papers.cool/arxiv/2208.09054</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2208.09054</guid>
<pubDate>Thu, 18 Aug 2022 20:45:31 GMT</pubDate>
<author>Christina M. Spaegele</author>
</item>
<item>
<title>The "SPectrogram Analysis and Cataloguing Environment" (SPACE) Labelling Tool</title>
<description><a href="https://papers.cool/arxiv/2207.12454">[Site]</a> <a href="https://papers.cool/Detection/2207.12454">[Kimi]</a> <p><b>Authors:</b> C. K. Louis</p> <p>The SPectrogram Analysis and Cataloguing Environment (SPACE) tool is an interactive python tool designed to label radio emission features of interest in a time-frequency map (called 'dynamic spectrum'). The program uses Matplotlib's Polygon Selector widget to allow a user to select and edit an undefined number of vertices on top of the dynamic spectrum before closing the shape (polygon). Multiple polygons may be drawn on any spectrum, and the feature name along with the coordinates for each polygon vertex are saved into a '.json' file as per the 'Time-Frequency Catalogue' (TFCat) format along with other data such as the feature id, observer name, and data units. This paper describes the first official stable release (version 2.0) of the tool.</p> </description>
<link>https://papers.cool/arxiv/2207.12454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2207.12454</guid>
<pubDate>Mon, 25 Jul 2022 18:18:40 GMT</pubDate>
<author>C. K. Louis</author>
</item>
<item>
<title>Simulating long-range coherence of atoms and photons in quantum computers</title>
<description><a href="https://papers.cool/arxiv/2206.08386">[Site]</a> <a href="https://papers.cool/Detection/2206.08386">[Kimi]</a> <p><b>Authors:</b> Emanuele G. Dalla Torre</p> <p>Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.</p> </description>
<link>https://papers.cool/arxiv/2206.08386</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2206.08386</guid>
<pubDate>Thu, 16 Jun 2022 18:00:03 GMT</pubDate>
<author>Emanuele G. Dalla Torre</author>
</item>
<item>
<title>Bosonic fields in states with undefined particle numbers possess detectable non-contextuality features, plus more</title>
<description><a href="https://papers.cool/arxiv/2205.09440">[Site]</a> <a href="https://papers.cool/Detection/2205.09440">[Kimi]</a> <p><b>Authors:</b> Konrad Schlichtholz</p> <p>Most of the paradoxical, for the classical intuition, features of quantum theory were formulated for situations which involve a fixed number of particles. While one can now find a formulation of Bell's theorem for quantum fields, a Kochen-Specker-type reasoning is usually formulated for just one particle, or like in the case of Peres-Mermin square for two. A question emerges. Is it possible to formulate a contextuality proof for situation in which the numbers of particles are fundamentally undefined? We address this problem for bosonic fields. We introduce a representation of the $\mathfrak{su}(2)$ algebra in terms of boson number states in two modes that allows us to assess nonclassicality of states of bosonic fields. As a figure of merit of a nonclassical behaviour we analyze first of all contextuality, and we show that the introduced observables are handy and efficient to reveal violation of local realism, and to formulate entanglement indicators. We construct a method which extends the Kochen-Specker contextuality to bosonic quantum fields. A form of an inequality is derived using a suitable version of the Peres-Mermin square. The entanglement indicators use a witness built with specially defined Pauli-like observables. Finally, Bell-nonclassicality is discussed: an inequality that involves the expectation values of pairs of the Pauli-like operators is presented. The introduced indicators are shown to be effective, e.g. they reveal nonclassicality in situaations involving undefined boson numbers. This is shown via quantum optical examples of the $2\times 2$ bright squeezed vacuum state, and a recently discussed bright-GHZ state resulting from multiple three photon emissions in a parametric process.</p> </description>
<link>https://papers.cool/arxiv/2205.09440</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2205.09440</guid>
<pubDate>Thu, 19 May 2022 09:56:08 GMT</pubDate>
<author>Konrad Schlichtholz</author>
</item>
<item>
<title>Textual Stylistic Variation: Choices, Genres and Individuals</title>
<description><a href="https://papers.cool/arxiv/2205.00510">[Site]</a> <a href="https://papers.cool/Detection/2205.00510">[Kimi]</a> <p><b>Authors:</b> Jussi Karlgren</p> <p>This chapter argues for more informed target metrics for the statistical processing of stylistic variation in text collections. Much as operationalised relevance proved a useful goal to strive for in information retrieval, research in textual stylistics, whether application oriented or philologically inclined, needs goals formulated in terms of pertinence, relevance, and utility - notions that agree with reader experience of text. Differences readers are aware of are mostly based on utility - not on textual characteristics per se. Mostly, readers report stylistic differences in terms of genres. Genres, while vague and undefined, are well-established and talked a |
|
Successfully generated as following: http://localhost:1200/papers/query/Detection - Success ✔️<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
<channel>
<title>undefined</title>
<link>https://papers.cool/arxiv/search?highlight=1&query=undefined&sort=0</link>
<atom:link href="http://localhost:1200/papers/query/Detection" rel="self" type="application/rss+xml"></atom:link>
<description>undefined - Powered by RSSHub</description>
<generator>RSSHub</generator>
<webMaster>[email protected] (RSSHub)</webMaster>
<language>en</language>
<lastBuildDate>Tue, 17 Dec 2024 14:30:13 GMT</lastBuildDate>
<ttl>5</ttl>
<item>
<title>Estimating Spillover Effects in the Presence of Isolated Nodes</title>
<description><a href="https://papers.cool/arxiv/2412.05919">[Site]</a> <a href="https://papers.cool/Detection/2412.05919">[Kimi]</a> <p><b>Authors:</b> Bora Kim</p> <p>In estimating spillover effects under network interference, practitioners often use linear regression with either the number or fraction of treated neighbors as regressors. An often overlooked fact is that the latter is undefined for units without neighbors (``isolated nodes"). The common practice is to impute this fraction as zero for isolated nodes. This paper shows that such practice introduces bias through theoretical derivations and simulations. Causal interpretations of the commonly used spillover regression coefficients are also provided.</p> </description>
<link>https://papers.cool/arxiv/2412.05919</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.05919</guid>
<pubDate>Sun, 08 Dec 2024 12:28:54 GMT</pubDate>
<author>Bora Kim</author>
</item>
<item>
<title>Surveying the Rust Verification Landscape</title>
<description><a href="https://papers.cool/arxiv/2410.01981">[Site]</a> <a href="https://papers.cool/Detection/2410.01981">[Kimi]</a> <p><b>Authors:</b> Alex Le Blanc</p> <p>Rust aims to be a safe programming language applicable to systems programming applications. In particular, its type system has strong guardrails to prevent a variety of issues, such as memory safety bugs and data races. However, these guardrails can be sidestepped via the unsafe keyword. unsafe allows certain otherwise-prohibited operations, but shifts the onus of preventing undefined behaviour from the Rust language's compile-time checks to the developer. We believe that tools have a role to play in ensuring the absence of undefined behaviour in the presence of unsafe code. Moreover, safety aside, programs would also benefit from being verified for functional correctness, ensuring that they meet their specifications. In this research proposal, we explore what it means to do Rust verification. Specifically, we explore which properties are worth verifying for Rust; what techniques exist to verify them; and which code is worth verifying. In doing so, we motivate an effort to verify safety properties of the Rust standard library, presenting the relevant challenges along with ideas to address them.</p> </description>
<link>https://papers.cool/arxiv/2410.01981</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.01981</guid>
<pubDate>Wed, 02 Oct 2024 19:40:18 GMT</pubDate>
<author>Alex Le Blanc</author>
</item>
<item>
<title>Quantum Black Hole as a Harmonic Oscillator from the Perspective of the Minimum Uncertainty Approach</title>
<description><a href="https://papers.cool/arxiv/2409.09181">[Site]</a> <a href="https://papers.cool/Detection/2409.09181">[Kimi]</a> <p><b>Authors:</b> Octavio Obregón</p> <p>Starting from the Wheeler-DeWitt equation for the Schwarzschild black hole interior, which is derived from a Hamiltonian formulated in terms of canonical phase space coordinates, we show that by applying a simple reparametrization, this equation can be expressed as the eigenvalue equation of a quantum linear harmonic oscillator. Within the standard quantization framework, we find that the resulting wave function diverges in the region of the classical singularity, and the expectation value of the Kretschmann scalar is undefined for all states within the black hole. However, when we apply the minimal uncertainty approach to the quantization process, we obtain a wave function that is both well-defined and square-integrable. Additionally, the expectation value of the Kretschmann scalar for these states remains finite throughout the black hole's interior, suggesting that the classical singularity is resolved in this approach, replaced it by a minimum radius.</p> </description>
<link>https://papers.cool/arxiv/2409.09181</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.09181</guid>
<pubDate>Fri, 13 Sep 2024 20:37:43 GMT</pubDate>
<author>Octavio Obregón</author>
</item>
<item>
<title>From annular to toroidal pseudo knots</title>
<description><a href="https://papers.cool/arxiv/2409.03537">[Site]</a> <a href="https://papers.cool/Detection/2409.03537">[Kimi]</a> <p><b>Authors:</b> Ioannis Diamantis</p> <p>In this paper, we extend the theory of planar pseudo knots to the theories of annular and toroidal pseudo knots. Pseudo knots are defined as equivalence classes under Reidemeister-like moves of knot diagrams characterized by crossings with undefined over/under information. In the theories of annular and toroidal pseudo knots we introduce their respective lifts to the solid and the thickened torus. Then, we interlink these theories by representing annular and toroidal pseudo knots as planar ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. We also explore the inclusion relations between planar, annular and toroidal pseudo knots, as well as of ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. Finally, we extend the planar weighted resolution set to annular and toroidal pseudo knots, defining new invariants for classifying pseudo knots and links in the solid and in the thickened torus.</p> </description>
<link>https://papers.cool/arxiv/2409.03537</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.03537</guid>
<pubDate>Thu, 05 Sep 2024 13:53:34 GMT</pubDate>
<author>Ioannis Diamantis</author>
</item>
<item>
<title>BiGS: Bidirectional Gaussian Primitives for Relightable 3D Gaussian Splatting</title>
<description><a href="https://papers.cool/arxiv/2408.13370">[Site]</a> <a href="https://papers.cool/Detection/2408.13370">[Kimi]</a> <p><b>Authors:</b> Zhenyuan Liu</p> <p>We present Bidirectional Gaussian Primitives, an image-based novel view synthesis technique designed to represent and render 3D objects with surface and volumetric materials under dynamic illumination. Our approach integrates light intrinsic decomposition into the Gaussian splatting framework, enabling real-time relighting of 3D objects. To unify surface and volumetric material within a cohesive appearance model, we adopt a light- and view-dependent scattering representation via bidirectional spherical harmonics. Our model does not use a specific surface normal-related reflectance function, making it more compatible with volumetric representations like Gaussian splatting, where the normals are undefined. We demonstrate our method by reconstructing and rendering objects with complex materials. Using One-Light-At-a-Time (OLAT) data as input, we can reproduce photorealistic appearances under novel lighting conditions in real time.</p> </description>
<link>https://papers.cool/arxiv/2408.13370</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2408.13370</guid>
<pubDate>Fri, 23 Aug 2024 21:04:40 GMT</pubDate>
<author>Zhenyuan Liu</author>
</item>
<item>
<title>A Continued Fractions Theory for the completion of the Puiseux field</title>
<description><a href="https://papers.cool/arxiv/2407.05454">[Site]</a> <a href="https://papers.cool/Detection/2407.05454">[Kimi]</a> <p><b>Authors:</b> Luis Arenas-Carmona</p> <p>In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients are polynomials in roots of the variable, and that this approximation is the best ''rational'' Diophantine approximation of such element. Then, we interpret the preceding result in terms of the action of a suitable arithmetic subgroup of the special linear group on the Berkovich space defined over the said completion. We also explore the connections between points of type IV of the Berkovich space in terms of some ''non-convergent'' or ''undefined'' continued fractions, in a sense that we make precise in the text.</p> </description>
<link>https://papers.cool/arxiv/2407.05454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.05454</guid>
<pubDate>Sun, 07 Jul 2024 17:37:38 GMT</pubDate>
<author>Luis Arenas-Carmona</author>
</item>
<item>
<title>A Calculus for Unreachable Code</title>
<description><a href="https://papers.cool/arxiv/2407.04917">[Site]</a> <a href="https://papers.cool/Detection/2407.04917">[Kimi]</a> <p><b>Authors:</b> Peter Zhong</p> <p>In Racket, the LLVM IR, Rust, and other modern languages, programmers and static analyses can hint, with special annotations, that certain parts of a program are unreachable. Same as other assumptions about undefined behavior; the compiler assumes these hints are correct and transforms the program aggressively. While compile-time transformations due to undefined behavior often perplex compiler writers and developers, we show that the essence of transformations due to unreachable code can be distilled in a surprisingly small set of simple formal rules. Specifically, following the well-established tradition of understanding linguistic phenomena through calculi, we introduce the first calculus for unreachable. Its term-rewriting rules that take advantage of unreachable fall into two groups. The first group allows the compiler to delete any code downstream of unreachable, and any effect-free code upstream of unreachable. The second group consists of rules that eliminate conditional expressions when one of their branches is unreachable. We show the correctness of the rules with a novel logical relation, and we examine how they correspond to transformations due to unreachable in Racket and LLVM.</p> </description>
<link>https://papers.cool/arxiv/2407.04917</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.04917</guid>
<pubDate>Sat, 06 Jul 2024 01:49:57 GMT</pubDate>
<author>Peter Zhong</author>
</item>
<item>
<title>Jackknife inference with two-way clustering</title>
<description><a href="https://papers.cool/arxiv/2406.08880">[Site]</a> <a href="https://papers.cool/Detection/2406.08880">[Kimi]</a> <p><b>Authors:</b> James G. MacKinnon</p> <p>For linear regression models with cross-section or panel data, it is natural to assume that the disturbances are clustered in two dimensions. However, the finite-sample properties of two-way cluster-robust tests and confidence intervals are often poor. We discuss several ways to improve inference with two-way clustering. Two of these are existing methods for avoiding, or at least ameliorating, the problem of undefined standard errors when a cluster-robust variance matrix estimator (CRVE) is not positive definite. One is a new method that always avoids the problem. More importantly, we propose a family of new two-way CRVEs based on the cluster jackknife. Simulations for models with two-way fixed effects suggest that, in many cases, the cluster-jackknife CRVE combined with our new method yields surprisingly accurate inferences. We provide a simple software package, twowayjack for Stata, that implements our recommended variance estimator.</p> </description>
<link>https://papers.cool/arxiv/2406.08880</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2406.08880</guid>
<pubDate>Thu, 13 Jun 2024 07:31:46 GMT</pubDate>
<author>James G. MacKinnon</author>
</item>
<item>
<title>Defining Requirements Strategies in Agile: A Design Science Research Study</title>
<description><a href="https://papers.cool/arxiv/2405.18847">[Site]</a> <a href="https://papers.cool/Detection/2405.18847">[Kimi]</a> <p><b>Authors:</b> Amna Pir Muhammad</p> <p>Research shows that many of the challenges currently encountered with agile development are related to requirements engineering. Based on design science research, this paper investigates critical challenges that arise in agile development from an undefined requirements strategy. We explore potential ways to address these challenges and synthesize the key building blocks of requirements strategies. Our design science research rests on a multiple case study with three industrial cases in the domains of communication technology, security services, and automotive. We relied on a total of 20 interviews, two workshops, participant observation in two cases, and document analysis in each of the cases to understand concrete challenges and workflows. In each case, we define a requirements strategy in collaboration with process managers and experienced engineers. From this experience, we extract guidelines for defining requirements strategies in agile development.</p> </description>
<link>https://papers.cool/arxiv/2405.18847</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.18847</guid>
<pubDate>Wed, 29 May 2024 07:57:32 GMT</pubDate>
<author>Amna Pir Muhammad</author>
</item>
<item>
<title>Analysis of Broken Randomized Experiments by Principal Stratification</title>
<description><a href="https://papers.cool/arxiv/2405.16780">[Site]</a> <a href="https://papers.cool/Detection/2405.16780">[Kimi]</a> <p><b>Authors:</b> Qinqing Liu</p> <p>Although randomized controlled trials have long been regarded as the ``gold standard'' for evaluating treatment effects, there is no natural prevention from post-treatment events. For example, non-compliance makes the actual treatment different from the assigned treatment, truncation-by-death renders the outcome undefined or ill-defined, and missingness prevents the outcomes from being measured. In this paper, we develop a statistical analysis framework using principal stratification to investigate the treatment effect in broken randomized experiments. The average treatment effect in compliers and always-survivors is adopted as the target causal estimand. We establish the asymptotic property for the estimator. We apply the framework to study the effect of training on earnings in the Job Corps Study and find that the training program does not have an effect on employment but possibly have an effect on improving the earnings after employment.</p> </description>
<link>https://papers.cool/arxiv/2405.16780</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.16780</guid>
<pubDate>Mon, 27 May 2024 03:05:29 GMT</pubDate>
<author>Qinqing Liu</author>
</item>
<item>
<title>A Study of Undefined Behavior Across Foreign Function Boundaries in Rust Libraries</title>
<description><a href="https://papers.cool/arxiv/2404.11671">[Site]</a> <a href="https://papers.cool/Detection/2404.11671">[Kimi]</a> <p><b>Authors:</b> Ian McCormack</p> <p>Developers rely on the Rust programming language's static safety guarantees to write secure and performant applications. However, Rust is frequently used to interoperate with other languages which allow design patterns that conflict with Rust's aliasing models. Miri is the only dynamic analysis tool capable of validating applications against these models, but it does not support foreign functions, indicating that there may be a critical correctness gap at the heart of the Rust ecosystem. We conducted a large-scale evaluation of Rust libraries that call foreign functions to determine whether Miri's dynamic analyses remain useful in this context. We used Miri and an LLVM interpreter to jointly execute applications that call foreign functions, where we found 48 instances of undefined or undesired behavior. These include three bugs from libraries that had over 10,000 daily downloads on average during our observation period and one from a library maintained by the Rust Project. Many of the errors we found involved incompatible aliasing patterns, but Rust's latest Tree Borrows aliasing model was significantly more permissive than the earlier Stacked Borrows model. The Rust community must invest in new, production-ready tooling for multi-language applications to ensure that developers can detect these errors.</p> </description>
<link>https://papers.cool/arxiv/2404.11671</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2404.11671</guid>
<pubDate>Wed, 17 Apr 2024 18:12:05 GMT</pubDate>
<author>Ian McCormack</author>
</item>
<item>
<title>EventRL: Enhancing Event Extraction with Outcome Supervision for Large Language Models</title>
<description><a href="https://papers.cool/arxiv/2402.11430">[Site]</a> <a href="https://papers.cool/Detection/2402.11430">[Kimi]</a> <p><b>Authors:</b> Jun Gao</p> <p>In this study, we present EventRL, a reinforcement learning approach developed to enhance event extraction for large language models (LLMs). EventRL utilizes outcome supervision with specific reward functions to tackle prevalent challenges in LLMs, such as instruction following and hallucination, manifested as the mismatch of event structure and the generation of undefined event types. We evaluate EventRL against existing methods like Few-Shot Prompting (FSP) (based on GPT4) and Supervised Fine-Tuning (SFT) across various LLMs, including GPT-4, LLaMa, and CodeLLaMa models. Our findings show that EventRL significantly outperforms these conventional approaches by improving the performance in identifying and structuring events, particularly in handling novel event types. The study emphasizes the critical role of reward function selection and demonstrates the benefits of incorporating code data for better event extraction. While increasing model size leads to higher accuracy, maintaining the ability to generalize is essential to avoid overfitting.</p> </description>
<link>https://papers.cool/arxiv/2402.11430</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2402.11430</guid>
<pubDate>Sun, 18 Feb 2024 02:41:06 GMT</pubDate>
<author>Jun Gao</author>
</item>
<item>
<title>SECOMP: Formally Secure Compilation of Compartmentalized C Programs</title>
<description><a href="https://papers.cool/arxiv/2401.16277">[Site]</a> <a href="https://papers.cool/Detection/2401.16277">[Kimi]</a> <p><b>Authors:</b> Jérémy Thibault</p> <p>Undefined behavior in C often causes devastating security vulnerabilities. One practical mitigation is compartmentalization, which allows developers to structure large programs into mutually distrustful compartments with clearly specified privileges and interactions. In this paper we introduce SECOMP, a compiler for compartmentalized C code that comes with machine-checked proofs guaranteeing that the scope of undefined behavior is restricted to the compartments that encounter it and become dynamically compromised. These guarantees are formalized as the preservation of safety properties against adversarial contexts, a secure compilation criterion similar to full abstraction, and this is the first time such a strong criterion is proven for a mainstream programming language. To achieve this we extend the languages of the CompCert verified C compiler with isolated compartments that can only interact via procedure calls and returns, as specified by cross-compartment interfaces. We adapt the passes and optimizations of CompCert as well as their correctness proofs to this compartment-aware setting. We then use compiler correctness as an ingredient in a larger secure compilation proof that involves several proof engineering novelties, needed to scale formally secure compilation up to a C compiler.</p> </description>
<link>https://papers.cool/arxiv/2401.16277</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2401.16277</guid>
<pubDate>Mon, 29 Jan 2024 16:32:36 GMT</pubDate>
<author>Jérémy Thibault</author>
</item>
<item>
<title>Taming numerical imprecision by adapting the KL divergence to negative probabilities</title>
<description><a href="https://papers.cool/arxiv/2312.13021">[Site]</a> <a href="https://papers.cool/Detection/2312.13021">[Kimi]</a> <p><b>Authors:</b> Simon Pfahler</p> <p>The Kullback-Leibler (KL) divergence is frequently used in data science. For discrete distributions on large state spaces, approximations of probability vectors may result in a few small negative entries, rendering the KL divergence undefined. We address this problem by introducing a parameterized family of substitute divergence measures, the shifted KL (sKL) divergence measures. Our approach is generic and does not increase the computational overhead. We show that the sKL divergence shares important theoretical properties with the KL divergence and discuss how its shift parameters should be chosen. If Gaussian noise is added to a probability vector, we prove that the average sKL divergence converges to the KL divergence for small enough noise. We also show that our method solves the problem of negative entries in an application from computational oncology, the optimization of Mutual Hazard Networks for cancer progression using tensor-train approximations.</p> </description>
<link>https://papers.cool/arxiv/2312.13021</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.13021</guid>
<pubDate>Wed, 20 Dec 2023 13:42:00 GMT</pubDate>
<author>Simon Pfahler</author>
</item>
<item>
<title>Performance rating in chess, tennis, and other contexts</title>
<description><a href="https://papers.cool/arxiv/2312.12700">[Site]</a> <a href="https://papers.cool/Detection/2312.12700">[Kimi]</a> <p><b>Authors:</b> Mehmet S. Ismail</p> <p>In this note, I introduce Estimated Performance Rating (PR$^e$), a novel system for evaluating player performance in sports and games. PR$^e$ addresses a key limitation of the Tournament Performance Rating (TPR) system, which is undefined for zero or perfect scores in a series of games. PR$^e$ is defined as the rating that solves an optimization problem related to scoring probability, making it applicable for any performance level. The main theorem establishes that the PR$^e$ of a player is equivalent to the TPR whenever the latter is defined. I then apply this system to historically significant win-streaks in association football, tennis, and chess. Beyond sports, PR$^e$ has broad applicability in domains where Elo ratings are used, from college rankings to the evaluation of large language models.</p> </description>
<link>https://papers.cool/arxiv/2312.12700</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.12700</guid>
<pubDate>Wed, 20 Dec 2023 01:47:55 GMT</pubDate>
<author>Mehmet S. Ismail</author>
</item>
<item>
<title>Memory Simulations, Security and Optimization in a Verified Compiler</title>
<description><a href="https://papers.cool/arxiv/2312.08117">[Site]</a> <a href="https://papers.cool/Detection/2312.08117">[Kimi]</a> <p><b>Authors:</b> VERIMAG - IMAG David Monniaux</p> <p>Current compilers implement security features and optimizations that require nontrivial semantic reasoning about pointers and memory allocation: the program after the insertion of the security feature, or after applying the optimization, must simulate the original program despite a different memory layout. In this article, we illustrate such reasoning on pointer allocations through memory extensions and injections, as well as fine points on undefined values, by explaining how we implemented and proved correct two security features (stack canaries and pointer authentication) and one optimization (tail recursion elimination) in the CompCert formally verified compiler.</p> </description>
<link>https://papers.cool/arxiv/2312.08117</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.08117</guid>
<pubDate>Wed, 13 Dec 2023 13:11:05 GMT</pubDate>
<author>VERIMAG - IMAG David Monniaux</author>
</item>
<item>
<title>Coherent control of two Jaynes-Cummings cavities</title>
<description><a href="https://papers.cool/arxiv/2312.06984">[Site]</a> <a href="https://papers.cool/Detection/2312.06984">[Kimi]</a> <p><b>Authors:</b> L. O. Castaños-Cervantes</p> <p>In this work, we uncover new features on the study of a two-level atom interacting with one of two cavities in a coherent superposition. The James-Cummings model is used to describe the atom-field interaction and to study the effects of quantum indefiniteness on such an interaction. We show that coherent control of the two cavities in an undefined manner allows novel possibilities to manipulate the atomic dynamics on demand which are not achievable in the conventional way. In addition, it is shown that the coherent control of the atom creates highly entangled states of the cavity fields taking a Bell-like or Schrödinger-cat-like state form. Our results are a step forward to understand and harness quantum systems in a coherent control, and open a new research avenue in the study of atom-field interaction exploiting quantum indefiniteness.</p> </description>
<link>https://papers.cool/arxiv/2312.06984</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.06984</guid>
<pubDate>Tue, 12 Dec 2023 05:03:13 GMT</pubDate>
<author>L. O. Castaños-Cervantes</author>
</item>
<item>
<title>Personality of AI</title>
<description><a href="https://papers.cool/arxiv/2312.02998">[Site]</a> <a href="https://papers.cool/Detection/2312.02998">[Kimi]</a> <p><b>Authors:</b> Byunggu Yu</p> <p>This research paper delves into the evolving landscape of fine-tuning large language models (LLMs) to align with human users, extending beyond basic alignment to propose "personality alignment" for language models in organizational settings. Acknowledging the impact of training methods on the formation of undefined personality traits in AI models, the study draws parallels with human fitting processes using personality tests. Through an original case study, we demonstrate the necessity of personality fine-tuning for AIs and raise intriguing questions about applying human-designed tests to AIs, engineering specialized AI personality tests, and shaping AI personalities to suit organizational roles. The paper serves as a starting point for discussions and developments in the burgeoning field of AI personality alignment, offering a foundational anchor for future exploration in human-machine teaming and co-existence.</p> </description>
<link>https://papers.cool/arxiv/2312.02998</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.02998</guid>
<pubDate>Sun, 03 Dec 2023 18:23:45 GMT</pubDate>
<author>Byunggu Yu</author>
</item>
<item>
<title>3vLTL: A Tool to Generate Automata for Three-valued LTL</title>
<description><a href="https://papers.cool/arxiv/2311.09787">[Site]</a> <a href="https://papers.cool/Detection/2311.09787">[Kimi]</a> <p><b>Authors:</b> Imperial College London Francesco Belardinelli</p> <p>Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multi-valued specification languages. We present 3vLTL, a tool to generate Buchi automata from formulas in Linear-time Temporal Logic (LTL) interpreted on a three-valued semantics. Given an LTL formula, a set of atomic propositions as the alphabet for the automaton, and a truth value, our procedure generates a Buchi automaton that accepts all the words that assign the chosen truth value to the LTL formula. Given the particular type of the output of the tool, it can also be seamlessly processed by third-party libraries in a natural way. That is, the Buchi automaton can then be used in the context of formal verification to check whether an LTL formula is true, false, or undefined on a given model.</p> </description>
<link>https://papers.cool/arxiv/2311.09787</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2311.09787</guid>
<pubDate>Thu, 16 Nov 2023 11:04:38 GMT</pubDate>
<author>Imperial College London Francesco Belardinelli</author>
</item>
<item>
<title>One-Way Communication Complexity of Partial XOR Functions</title>
<description><a href="https://papers.cool/arxiv/2310.20606">[Site]</a> <a href="https://papers.cool/Detection/2310.20606">[Kimi]</a> <p><b>Authors:</b> Vladimir V. Podolskii</p> <p>Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y)=f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known that deterministic communication complexity of $F$ is closely related to parity decision tree complexity of $f$. Montanaro and Osbourne (2009) observed that one-sided communication complexity $D_{cc}^{\rightarrow}(F)$ of $F$ is exactly equal to nonadaptive parity decision tree complexity $NADT^{\oplus}(f)$ of $f$. Hatami et al. (2018) showed that unrestricted communication complexity of $F$ is polynomially related to parity decision tree complexity of $f$. We initiate the studies of a similar connection for partial functions. We show that in case of one-sided communication complexity whether these measures are equal, depends on the number of undefined inputs of $f$. On the one hand, if $D_{cc}^{\rightarrow}(F)=t$ and $f$ is undefined on at most $O(\frac{2^{n-t}}{\sqrt{n-t}})$, then $NADT^{\oplus}(f)=t$. On the other hand, for a wide range of values of $D_{cc}^{\rightarrow}(F)$ and $NADT^{\oplus}(f)$ (from constant to $n-2$) we provide partial functions for which $D_{cc}^{\rightarrow}(F) &lt; NADT^{\oplus}(f)$. In particular, we provide a function with an exponential gap between the two measures. Our separation results translate to the case of two-sided communication complexity as well, in particular showing that the result of Hatami et al. (2018) cannot be generalized to partial functions. Previous results for total functions heavily rely on Boolean Fourier analysis and the technique does not translate to partial functions. For the proofs of our results we build a linear algebraic framework instead. Separation results are proved through the reduction to covering codes.</p> </description>
<link>https://papers.cool/arxiv/2310.20606</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.20606</guid>
<pubDate>Tue, 31 Oct 2023 16:42:10 GMT</pubDate>
<author>Vladimir V. Podolskii</author>
</item>
<item>
<title>Heavy-light $N+1$ clusters of two-dimensional fermions</title>
<description><a href="https://papers.cool/arxiv/2310.11330">[Site]</a> <a href="https://papers.cool/Detection/2310.11330">[Kimi]</a> <p><b>Authors:</b> J. Givois</p> <p>We study binding of $N$ identical heavy fermions by a light atom in two dimensions assuming zero-range attractive heavy-light interactions. By using the mean-field theory valid for large $N$ we show that the $N+1$ cluster is bound when the mass ratio exceeds $1.074N^2$. The mean-field theory, being scale invariant in two dimensions, predicts only the shapes of the clusters leaving their sizes and energies undefined. By taking into account beyond-mean-field effects we find closed-form expressions for these quantities. We also discuss differences between the Thomas-Fermi and Hartree-Fock approaches for treating the heavy fermions.</p> </description>
<link>https://papers.cool/arxiv/2310.11330</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.11330</guid>
<pubDate>Tue, 17 Oct 2023 15:08:23 GMT</pubDate>
<author>J. Givois</author>
</item>
<item>
<title>On Two- and Three-valued Semantics for Impure Simplicial Complexes</title>
<description><a href="https://papers.cool/arxiv/2310.00989">[Site]</a> <a href="https://papers.cool/Detection/2310.00989">[Kimi]</a> <p><b>Authors:</b> Hans van Ditmarsch</p> <p>Simplicial complexes are a convenient semantic primitive to reason about processes (agents) communicating with each other in synchronous and asynchronous computation. Impure simplicial complexes distinguish active processes from crashed ones, in other words, agents that are alive from agents that are dead. In order to rule out that dead agents reason about themselves and about other agents, three-valued epistemic semantics have been proposed where, in addition to the usual values true and false, the third value stands for undefined: the knowledge of dead agents is undefined and so are the propositional variables describing their local state. Other semantics for impure complexes are two-valued where a dead agent knows everything. Different choices in designing a semantics produce different three-valued semantics, and also different two-valued semantics. In this work, we categorize the available choices by discounting the bad ones, identifying the equivalent ones, and connecting the non-equivalent ones via a translation. The main result of the paper is identifying the main relevant distinction to be the number of truth values and bridging this difference by means of a novel embedding from three- into two-valued semantics. This translation also enables us to highlight quite fundamental modeling differences underpinning various two- and three-valued approaches in this area of combinatorial topology. In particular, pure complexes can be defined as those invariant under the translation.</p> </description>
<link>https://papers.cool/arxiv/2310.00989</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.00989</guid>
<pubDate>Mon, 02 Oct 2023 08:56:26 GMT</pubDate>
<author>Hans van Ditmarsch</author>
</item>
<item>
<title>Innovative Digital Storytelling with AIGC: Exploration and Discussion of Recent Advances</title>
<description><a href="https://papers.cool/arxiv/2309.14329">[Site]</a> <a href="https://papers.cool/Detection/2309.14329">[Kimi]</a> <p><b>Authors:</b> Rongzhang Gu</p> <p>Digital storytelling, as an art form, has struggled with cost-quality balance. The emergence of AI-generated Content (AIGC) is considered as a potential solution for efficient digital storytelling production. However, the specific form, effects, and impacts of this fusion remain unclear, leaving the boundaries of AIGC combined with storytelling undefined. This work explores the current integration state of AIGC and digital storytelling, investigates the artistic value of their fusion in a sample project, and addresses common issues through interviews. Through our study, we conclude that AIGC, while proficient in image creation, voiceover production, and music composition, falls short of replacing humans due to the irreplaceable elements of human creativity and aesthetic sensibilities at present, especially in complex character animations, facial expressions, and sound effects. The research objective is to increase public awareness of the current state, limitations, and challenges arising from combining AIGC and digital storytelling.</p> </description>
<link>https://papers.cool/arxiv/2309.14329</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2309.14329</guid>
<pubDate>Mon, 25 Sep 2023 17:54:29 GMT</pubDate>
<author>Rongzhang Gu</author>
</item>
<item>
<title>Polarization Jumps across Topological Phase Transitions in Two-dimensional Systems</title>
<description><a href="https://papers.cool/arxiv/2304.12742">[Site]</a> <a href="https://papers.cool/Detection/2304.12742">[Kimi]</a> <p><b>Authors:</b> Hiroki Yoshida</p> <p>In topological phase transitions involving a change in topological invariants such as the Chern number and the $\mathbb{Z}_2$ topological invariant, the gap closes, and the electric polarization becomes undefined at the transition. In this paper, we show that the jump of polarization across such topological phase transitions in two dimensions is described in terms of positions and monopole charges of Weyl points in the intermediate Weyl semimetal phase. We find that the jump of polarization is described by the Weyl dipole at $\mathbb{Z}_2$ topological phase transitions and at phase transitions without any change in the value of the Chern number. Meanwhile, when the Chern number changes at the phase transition, the jump is expressed in terms of the relative positions of Weyl points measured from a reference point in the reciprocal space.</p> </description>
<link>https://papers.cool/arxiv/2304.12742</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2304.12742</guid>
<pubDate>Tue, 25 Apr 2023 11:36:08 GMT</pubDate>
<author>Hiroki Yoshida</author>
</item>
<item>
<title>MINER: A Hybrid Data-Driven Approach for REST API Fuzzing</title>
<description><a href="https://papers.cool/arxiv/2303.02545">[Site]</a> <a href="https://papers.cool/Detection/2303.02545">[Kimi]</a> <p><b>Authors:</b> Chenyang Lyu</p> <p>In recent years, REST API fuzzing has emerged to explore errors on a cloud service. Its performance highly depends on the sequence construction and request generation. However, existing REST API fuzzers have trouble generating long sequences with well-constructed requests to trigger hard-to-reach states in a cloud service, which limits their performance of finding deep errors and security bugs. Further, they cannot find the specific errors caused by using undefined parameters during request generation. Therefore, in this paper, we propose a novel hybrid data-driven solution, named MINER, with three new designs working together to address the above limitations. First, MINER collects the valid sequences whose requests pass the cloud service's checking as the templates, and assigns more executions to long sequence templates. Second, to improve the generation quality of requests in a sequence template, MINER creatively leverages the state-of-the-art neural network model to predict key request parameters and provide them with appropriate parameter values. Third, MINER implements a new data-driven security rule checker to capture the new kind of errors caused by undefined parameters. We evaluate MINER against the state-of-the-art fuzzer RESTler on GitLab, Bugzilla, and WordPress via 11 REST APIs. The results demonstrate that the average pass rate of MINER is 23.42% higher than RESTler. MINER finds 97.54% more unique errors than RESTler on average and 142.86% more reproducible errors after manual analysis. We have reported all the newly found errors, and 7 of them have been confirmed as logic bugs by the corresponding vendors.</p> </description>
<link>https://papers.cool/arxiv/2303.02545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.02545</guid>
<pubDate>Sun, 05 Mar 2023 01:41:41 GMT</pubDate>
<author>Chenyang Lyu</author>
</item>
<item>
<title>The variance-gamma ratio distribution</title>
<description><a href="https://papers.cool/arxiv/2302.12581">[Site]</a> <a href="https://papers.cool/Detection/2302.12581">[Kimi]</a> <p><b>Authors:</b> Robert E. Gaunt</p> <p>Let $X$ and $Y$ be independent variance-gamma random variables with zero location parameter; then the exact probability density function of the ratio $X/Y$ is derived. Some basic distributional properties are also derived, including identification of parameter regimes under which the density is bounded, asymptotic approximations of tail probabilities, and fractional moments; in particular, we see that the mean is undefined. In the case that $X$ and $Y$ are independent symmetric variance-gamma random variables, an exact formula is also given for the cumulative distribution function of the ratio $X/Y$.</p> </description>
<link>https://papers.cool/arxiv/2302.12581</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2302.12581</guid>
<pubDate>Fri, 24 Feb 2023 11:40:20 GMT</pubDate>
<author>Robert E. Gaunt</author>
</item>
<item>
<title>Generalized PTR: User-Friendly Recipes for Data-Adaptive Algorithms with Differential Privacy</title>
<description><a href="https://papers.cool/arxiv/2301.00301">[Site]</a> <a href="https://papers.cool/Detection/2301.00301">[Kimi]</a> <p><b>Authors:</b> Rachel Redberg</p> <p>The ''Propose-Test-Release'' (PTR) framework is a classic recipe for designing differentially private (DP) algorithms that are data-adaptive, i.e. those that add less noise when the input dataset is nice. We extend PTR to a more general setting by privately testing data-dependent privacy losses rather than local sensitivity, hence making it applicable beyond the standard noise-adding mechanisms, e.g. to queries with unbounded or undefined sensitivity. We demonstrate the versatility of generalized PTR using private linear regression as a case study. Additionally, we apply our algorithm to solve an open problem from ''Private Aggregation of Teacher Ensembles (PATE)'' -- privately releasing the entire model with a delicate data-dependent analysis.</p> </description>
<link>https://papers.cool/arxiv/2301.00301</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2301.00301</guid>
<pubDate>Sat, 31 Dec 2022 22:22:53 GMT</pubDate>
<author>Rachel Redberg</author>
</item>
<item>
<title>Modular Formal Verification of Rust Programs with Unsafe Blocks</title>
<description><a href="https://papers.cool/arxiv/2212.12976">[Site]</a> <a href="https://papers.cool/Detection/2212.12976">[Kimi]</a> <p><b>Authors:</b> Nima Rahimi Foroushaani</p> <p>Rust is a modern systems programming language whose type system guarantees memory safety. For the sake of expressivity and performance it allows programmers to relax typing rules temporarily, using unsafe code blocks. However, in unsafe blocks, the burden of making sure that the code does not end up having undefined behaviour is on the programmer. Even most expert programmers make mistakes and a memory safety bug in an unsafe block renders all the type system guarantees void. To address this problem we are trying to verify soundness of Rust unsafe code applying our Modular Symbolic Execution algorithm. This text outlines our approach and the progress that has been made so far.</p> </description>
<link>https://papers.cool/arxiv/2212.12976</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.12976</guid>
<pubDate>Mon, 26 Dec 2022 00:19:19 GMT</pubDate>
<author>Nima Rahimi Foroushaani</author>
</item>
<item>
<title>@C -- augmented version of C programming language</title>
<description><a href="https://papers.cool/arxiv/2212.11245">[Site]</a> <a href="https://papers.cool/Detection/2212.11245">[Kimi]</a> <p><b>Authors:</b> Iosif Iulian Petrila</p> <p>The augmented version of C programming language is presented. The language was completed with a series of low-level and high-level facilities to enlarge the language usage spectrum to various computing systems, operations, users. The ambiguities and inconsistencies have been resolved by managing problematic and undefined languages elements through an interpretation and management similar to that used in the case of other C syntax based languages. The proposed augmentative completeness elements, through @C approach, preserve the spirit of C language and its basic characteristics through compatibility with the standard version but also allow rejuvenation and bring C language to the present programming languages state of the art.</p> </description>
<link>https://papers.cool/arxiv/2212.11245</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.11245</guid>
<pubDate>Mon, 19 Dec 2022 07:53:14 GMT</pubDate>
<author>Iosif Iulian Petrila</author>
</item>
<item>
<title>Hunt for 3-Schur polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.14956">[Site]</a> <a href="https://papers.cool/Detection/2211.14956">[Kimi]</a> <p><b>Authors:</b> A. Morozov</p> <p>This paper describes our attempt to understand the recent success of Na Wang in constructing the 3-Schur polynomials, associated with the plane partitions. We provide a rather detailed review and try to figure out the new insights, which allowed to overcome the problems of the previous efforts. In result we provide a very simple definition of time-variables ${\bf P}_{i\geqslant j}$ and the cut-and-join operator $\hat W_2$, which generates the set of $3$-Schur functions. Some coefficients in $\hat W_2$ remain undefined and require more effort to be fixed.</p> </description>
<link>https://papers.cool/arxiv/2211.14956</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.14956</guid>
<pubDate>Sun, 27 Nov 2022 22:28:20 GMT</pubDate>
<author>A. Morozov</author>
</item>
<item>
<title>Impure Simplicial Complexes: Complete Axiomatization</title>
<description><a href="https://papers.cool/arxiv/2211.13543">[Site]</a> <a href="https://papers.cool/Detection/2211.13543">[Kimi]</a> <p><b>Authors:</b> Rojo Randrianomentsoa</p> <p>Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment. Pure simplicial complexes describe message passing in asynchronous systems where all processes (agents) are alive, whereas impure simplicial complexes describe message passing in synchronous systems where processes may be dead (have crashed). Properties of impure simplicial complexes can be described in a three-valued multi-agent epistemic logic where the third value represents formulae that are undefined, e.g., the knowledge and local propositions of dead agents. In this work we present an axiomatization for the logic of the class of impure complexes and show soundness and completeness. The completeness proof involves the novel construction of the canonical simplicial model and requires a careful manipulation of undefined formulae.</p> </description>
<link>https://papers.cool/arxiv/2211.13543</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.13543</guid>
<pubDate>Thu, 24 Nov 2022 11:32:36 GMT</pubDate>
<author>Rojo Randrianomentsoa</author>
</item>
<item>
<title>Some Useful Collective Properties of Bessel, Marcum Q-Functions and Laguerre Polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.12260">[Site]</a> <a href="https://papers.cool/Detection/2211.12260">[Kimi]</a> <p><b>Authors:</b> Hakan Ozturk</p> <p>Special functions have been used widely in many problems of applied sciences. However, there are considerable numbers of problems in which exact solutions could not be achieved because of undefined sums or integrals involving special functions. These handicaps force researchers to seek new properties of special functions. Many problems that could not be solved so far would be solved by means of these efforts. Therefore in this article, we derived some useful properties and interrelations of each others of Bessel functions, Marcum Q-functions and Laguerre polynomials.</p> </description>
<link>https://papers.cool/arxiv/2211.12260</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.12260</guid>
<pubDate>Tue, 22 Nov 2022 13:22:47 GMT</pubDate>
<author>Hakan Ozturk</author>
</item>
<item>
<title>Francois Viete and his contribution to mathematics</title>
<description><a href="https://papers.cool/arxiv/2210.12545">[Site]</a> <a href="https://papers.cool/Detection/2210.12545">[Kimi]</a> <p><b>Authors:</b> Athanasios Paraskevopoulos</p> <p>This paper studies the work of the French mathematician Francois Viete, known as the "father of modern algebraic notation". Along with this fundamental change in algebra, Viete adopted a radically new notation based on Greek geometric equalities. Its letters represent values rather than types, and its given values are undefined. Where algebra had previously relied on polynomials as sets, Viete became the first modern algebraist to work with polynomials generated by operations, and the notations reflect these notions. His work was essential to his successors because it enabled those mathematicians who followed him to develop the mathematics we use today.</p> </description>
<link>https://papers.cool/arxiv/2210.12545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.12545</guid>
<pubDate>Sat, 22 Oct 2022 20:40:50 GMT</pubDate>
<author>Athanasios Paraskevopoulos</author>
</item>
<item>
<title>An Active Learning Reliability Method for Systems with Partially Defined Performance Functions</title>
<description><a href="https://papers.cool/arxiv/2210.02168">[Site]</a> <a href="https://papers.cool/Detection/2210.02168">[Kimi]</a> <p><b>Authors:</b> Jonathan Sadeghi</p> <p>In engineering design, one often wishes to calculate the probability that the performance of a system is satisfactory under uncertainty. State of the art algorithms exist to solve this problem using active learning with Gaussian process models. However, these algorithms cannot be applied to problems which often occur in the autonomous vehicle domain where the performance of a system may be undefined under certain circumstances. To solve this problem, we introduce a hierarchical model for the system performance, where undefined performance is classified before the performance is regressed. This enables active learning Gaussian process methods to be applied to problems where the performance of the system is sometimes undefined, and we demonstrate the effectiveness of our approach by testing our methodology on synthetic numerical examples for the autonomous driving domain.</p> </description>
<link>https://papers.cool/arxiv/2210.02168</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.02168</guid>
<pubDate>Wed, 05 Oct 2022 11:50:36 GMT</pubDate>
<author>Jonathan Sadeghi</author>
</item>
<item>
<title>Schroedinger cats and quantum complementarity</title>
<description><a href="https://papers.cool/arxiv/2210.01083">[Site]</a> <a href="https://papers.cool/Detection/2210.01083">[Kimi]</a> <p><b>Authors:</b> Lorenzo Maccone</p> <p>Complementarity tells us we cannot know precisely the values of all the properties of a quantum object at the same time: the precise determination of one property implies that the value of some other (complementary) property is undefined. E.g.the precise knowledge of the position of a particle implies that its momentum is undefined. Here we show that a Schroedinger cat has a well defined value of a property that is complementary to its ``being dead or alive'' property. Then, thanks to complementarity, it has an undefined value of the property ``being dead or alive''. In other words, the cat paradox is explained through quantum complementarity: of its many complementary properties, any quantum system, such as a cat, can have a well defined value only of one at a time. Schroedinger's cat has a definite value of a property which is complementary to ``being dead or alive'', so it is neither dead nor alive. Figuratively one can say it is both dead and alive. While this interpretation only uses textbook concepts (the Copenhagen interpretation), apparently it has never explicitly appeared in the literature. We detail how to build an Arduino based simulation of Schroedinger's experiment based on these concepts for science outreach events.</p> </description>
<link>https://papers.cool/arxiv/2210.01083</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.01083</guid>
<pubDate>Mon, 03 Oct 2022 17:00:42 GMT</pubDate>
<author>Lorenzo Maccone</author>
</item>
<item>
<title>Defining a credible interval is not always possible with "point-null'' priors: A lesser-known correlate of the Jeffreys-Lindley paradox</title>
<description><a href="https://papers.cool/arxiv/2210.00029">[Site]</a> <a href="https://papers.cool/Detection/2210.00029">[Kimi]</a> <p><b>Authors:</b> Harlan Campbell</p> <p>In many common situations, a Bayesian credible interval will be, given the same data, very similar to a frequentist confidence interval, and researchers will interpret these intervals in a similar fashion. However, no predictable similarity exists when credible intervals are based on model-averaged posteriors whenever one of the two nested models under consideration is a so called ''point-null''. Not only can this model-averaged credible interval be quite different than the frequentist confidence interval, in some cases it may be undefined. This is a lesser-known correlate of the Jeffreys-Lindley paradox and is of particular interest given the popularity of the Bayes factor for testing point-null hypotheses.</p> </description>
<link>https://papers.cool/arxiv/2210.00029</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.00029</guid>
<pubDate>Fri, 30 Sep 2022 18:08:56 GMT</pubDate>
<author>Harlan Campbell</author>
</item>
<item>
<title>Topologically protected four-dimensional optical singularities</title>
<description><a href="https://papers.cool/arxiv/2208.09054">[Site]</a> <a href="https://papers.cool/Detection/2208.09054">[Kimi]</a> <p><b>Authors:</b> Christina M. Spaegele</p> <p>Optical singularities play a major role in modern optics and are frequently deployed in structured light, super-resolution microscopy, and holography. While phase singularities are uniquely defined as locations of undefined phase, polarization singularities studied thus far are either partial, i.e., bright points of well-defined polarization, or unstable for small field perturbations. We demonstrate for the first time a complete, topologically protected polarization singularity; it is located in the 4D space spanned by the three spatial dimensions and the wavelength and is created in the focus of a cascaded metasurface-lens system. The field Jacobian plays a key role in the design of such higher-dimensional singularities, which can be extended to multidimensional wave phenomena, and pave the way to novel applications in topological photonics and precision sensing.</p> </description>
<link>https://papers.cool/arxiv/2208.09054</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2208.09054</guid>
<pubDate>Thu, 18 Aug 2022 20:45:31 GMT</pubDate>
<author>Christina M. Spaegele</author>
</item>
<item>
<title>The "SPectrogram Analysis and Cataloguing Environment" (SPACE) Labelling Tool</title>
<description><a href="https://papers.cool/arxiv/2207.12454">[Site]</a> <a href="https://papers.cool/Detection/2207.12454">[Kimi]</a> <p><b>Authors:</b> C. K. Louis</p> <p>The SPectrogram Analysis and Cataloguing Environment (SPACE) tool is an interactive python tool designed to label radio emission features of interest in a time-frequency map (called 'dynamic spectrum'). The program uses Matplotlib's Polygon Selector widget to allow a user to select and edit an undefined number of vertices on top of the dynamic spectrum before closing the shape (polygon). Multiple polygons may be drawn on any spectrum, and the feature name along with the coordinates for each polygon vertex are saved into a '.json' file as per the 'Time-Frequency Catalogue' (TFCat) format along with other data such as the feature id, observer name, and data units. This paper describes the first official stable release (version 2.0) of the tool.</p> </description>
<link>https://papers.cool/arxiv/2207.12454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2207.12454</guid>
<pubDate>Mon, 25 Jul 2022 18:18:40 GMT</pubDate>
<author>C. K. Louis</author>
</item>
<item>
<title>Simulating long-range coherence of atoms and photons in quantum computers</title>
<description><a href="https://papers.cool/arxiv/2206.08386">[Site]</a> <a href="https://papers.cool/Detection/2206.08386">[Kimi]</a> <p><b>Authors:</b> Emanuele G. Dalla Torre</p> <p>Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.</p> </description>
<link>https://papers.cool/arxiv/2206.08386</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2206.08386</guid>
<pubDate>Thu, 16 Jun 2022 18:00:03 GMT</pubDate>
<author>Emanuele G. Dalla Torre</author>
</item>
<item>
<title>Bosonic fields in states with undefined particle numbers possess detectable non-contextuality features, plus more</title>
<description><a href="https://papers.cool/arxiv/2205.09440">[Site]</a> <a href="https://papers.cool/Detection/2205.09440">[Kimi]</a> <p><b>Authors:</b> Konrad Schlichtholz</p> <p>Most of the paradoxical, for the classical intuition, features of quantum theory were formulated for situations which involve a fixed number of particles. While one can now find a formulation of Bell's theorem for quantum fields, a Kochen-Specker-type reasoning is usually formulated for just one particle, or like in the case of Peres-Mermin square for two. A question emerges. Is it possible to formulate a contextuality proof for situation in which the numbers of particles are fundamentally undefined? We address this problem for bosonic fields. We introduce a representation of the $\mathfrak{su}(2)$ algebra in terms of boson number states in two modes that allows us to assess nonclassicality of states of bosonic fields. As a figure of merit of a nonclassical behaviour we analyze first of all contextuality, and we show that the introduced observables are handy and efficient to reveal violation of local realism, and to formulate entanglement indicators. We construct a method which extends the Kochen-Specker contextuality to bosonic quantum fields. A form of an inequality is derived using a suitable version of the Peres-Mermin square. The entanglement indicators use a witness built with specially defined Pauli-like observables. Finally, Bell-nonclassicality is discussed: an inequality that involves the expectation values of pairs of the Pauli-like operators is presented. The introduced indicators are shown to be effective, e.g. they reveal nonclassicality in situaations involving undefined boson numbers. This is shown via quantum optical examples of the $2\times 2$ bright squeezed vacuum state, and a recently discussed bright-GHZ state resulting from multiple three photon emissions in a parametric process.</p> </description>
<link>https://papers.cool/arxiv/2205.09440</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2205.09440</guid>
<pubDate>Thu, 19 May 2022 09:56:08 GMT</pubDate>
<author>Konrad Schlichtholz</author>
</item>
<item>
<title>Textual Stylistic Variation: Choices, Genres and Individuals</title>
<description><a href="https://papers.cool/arxiv/2205.00510">[Site]</a> <a href="https://papers.cool/Detection/2205.00510">[Kimi]</a> <p><b>Authors:</b> Jussi Karlgren</p> <p>This chapter argues for more informed target metrics for the statistical processing of stylistic variation in text collections. Much as operationalised relevance proved a useful goal to strive for in information retrieval, research in textual stylistics, whether application oriented or philologically inclined, needs goals formulated in terms of pertinence, relevance, and utility - notions that agree with reader experience of text. Differences readers are aware of are mostly based on utility - not on textual characteristics per se. Mostly, readers report stylistic differences in terms of genres. Genres, while vague and undefined, are well-established and talked a |
|
@TonyRL Hello, Tony, I have finished my modification, split the arxiv/category and query/keyword. Please help me to review the code again, thanks |
|
Successfully generated as following: http://localhost:1200/papers/query/Detection - Success ✔️<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
<channel>
<title>undefined</title>
<link>https://papers.cool/arxiv/search?highlight=1&query=undefined&sort=0</link>
<atom:link href="http://localhost:1200/papers/query/Detection" rel="self" type="application/rss+xml"></atom:link>
<description>undefined - Powered by RSSHub</description>
<generator>RSSHub</generator>
<webMaster>[email protected] (RSSHub)</webMaster>
<language>en</language>
<lastBuildDate>Tue, 17 Dec 2024 14:36:49 GMT</lastBuildDate>
<ttl>5</ttl>
<item>
<title>Estimating Spillover Effects in the Presence of Isolated Nodes</title>
<description><a href="https://papers.cool/arxiv/2412.05919">[Site]</a> <a href="https://papers.cool/Detection/2412.05919">[Kimi]</a> <p><b>Authors:</b> Bora Kim</p> <p>In estimating spillover effects under network interference, practitioners often use linear regression with either the number or fraction of treated neighbors as regressors. An often overlooked fact is that the latter is undefined for units without neighbors (``isolated nodes"). The common practice is to impute this fraction as zero for isolated nodes. This paper shows that such practice introduces bias through theoretical derivations and simulations. Causal interpretations of the commonly used spillover regression coefficients are also provided.</p> </description>
<link>https://papers.cool/arxiv/2412.05919</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.05919</guid>
<pubDate>Sun, 08 Dec 2024 12:28:54 GMT</pubDate>
<author>Bora Kim</author>
</item>
<item>
<title>Surveying the Rust Verification Landscape</title>
<description><a href="https://papers.cool/arxiv/2410.01981">[Site]</a> <a href="https://papers.cool/Detection/2410.01981">[Kimi]</a> <p><b>Authors:</b> Alex Le Blanc</p> <p>Rust aims to be a safe programming language applicable to systems programming applications. In particular, its type system has strong guardrails to prevent a variety of issues, such as memory safety bugs and data races. However, these guardrails can be sidestepped via the unsafe keyword. unsafe allows certain otherwise-prohibited operations, but shifts the onus of preventing undefined behaviour from the Rust language's compile-time checks to the developer. We believe that tools have a role to play in ensuring the absence of undefined behaviour in the presence of unsafe code. Moreover, safety aside, programs would also benefit from being verified for functional correctness, ensuring that they meet their specifications. In this research proposal, we explore what it means to do Rust verification. Specifically, we explore which properties are worth verifying for Rust; what techniques exist to verify them; and which code is worth verifying. In doing so, we motivate an effort to verify safety properties of the Rust standard library, presenting the relevant challenges along with ideas to address them.</p> </description>
<link>https://papers.cool/arxiv/2410.01981</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.01981</guid>
<pubDate>Wed, 02 Oct 2024 19:40:18 GMT</pubDate>
<author>Alex Le Blanc</author>
</item>
<item>
<title>Quantum Black Hole as a Harmonic Oscillator from the Perspective of the Minimum Uncertainty Approach</title>
<description><a href="https://papers.cool/arxiv/2409.09181">[Site]</a> <a href="https://papers.cool/Detection/2409.09181">[Kimi]</a> <p><b>Authors:</b> Octavio Obregón</p> <p>Starting from the Wheeler-DeWitt equation for the Schwarzschild black hole interior, which is derived from a Hamiltonian formulated in terms of canonical phase space coordinates, we show that by applying a simple reparametrization, this equation can be expressed as the eigenvalue equation of a quantum linear harmonic oscillator. Within the standard quantization framework, we find that the resulting wave function diverges in the region of the classical singularity, and the expectation value of the Kretschmann scalar is undefined for all states within the black hole. However, when we apply the minimal uncertainty approach to the quantization process, we obtain a wave function that is both well-defined and square-integrable. Additionally, the expectation value of the Kretschmann scalar for these states remains finite throughout the black hole's interior, suggesting that the classical singularity is resolved in this approach, replaced it by a minimum radius.</p> </description>
<link>https://papers.cool/arxiv/2409.09181</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.09181</guid>
<pubDate>Fri, 13 Sep 2024 20:37:43 GMT</pubDate>
<author>Octavio Obregón</author>
</item>
<item>
<title>From annular to toroidal pseudo knots</title>
<description><a href="https://papers.cool/arxiv/2409.03537">[Site]</a> <a href="https://papers.cool/Detection/2409.03537">[Kimi]</a> <p><b>Authors:</b> Ioannis Diamantis</p> <p>In this paper, we extend the theory of planar pseudo knots to the theories of annular and toroidal pseudo knots. Pseudo knots are defined as equivalence classes under Reidemeister-like moves of knot diagrams characterized by crossings with undefined over/under information. In the theories of annular and toroidal pseudo knots we introduce their respective lifts to the solid and the thickened torus. Then, we interlink these theories by representing annular and toroidal pseudo knots as planar ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. We also explore the inclusion relations between planar, annular and toroidal pseudo knots, as well as of ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. Finally, we extend the planar weighted resolution set to annular and toroidal pseudo knots, defining new invariants for classifying pseudo knots and links in the solid and in the thickened torus.</p> </description>
<link>https://papers.cool/arxiv/2409.03537</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.03537</guid>
<pubDate>Thu, 05 Sep 2024 13:53:34 GMT</pubDate>
<author>Ioannis Diamantis</author>
</item>
<item>
<title>BiGS: Bidirectional Gaussian Primitives for Relightable 3D Gaussian Splatting</title>
<description><a href="https://papers.cool/arxiv/2408.13370">[Site]</a> <a href="https://papers.cool/Detection/2408.13370">[Kimi]</a> <p><b>Authors:</b> Zhenyuan Liu</p> <p>We present Bidirectional Gaussian Primitives, an image-based novel view synthesis technique designed to represent and render 3D objects with surface and volumetric materials under dynamic illumination. Our approach integrates light intrinsic decomposition into the Gaussian splatting framework, enabling real-time relighting of 3D objects. To unify surface and volumetric material within a cohesive appearance model, we adopt a light- and view-dependent scattering representation via bidirectional spherical harmonics. Our model does not use a specific surface normal-related reflectance function, making it more compatible with volumetric representations like Gaussian splatting, where the normals are undefined. We demonstrate our method by reconstructing and rendering objects with complex materials. Using One-Light-At-a-Time (OLAT) data as input, we can reproduce photorealistic appearances under novel lighting conditions in real time.</p> </description>
<link>https://papers.cool/arxiv/2408.13370</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2408.13370</guid>
<pubDate>Fri, 23 Aug 2024 21:04:40 GMT</pubDate>
<author>Zhenyuan Liu</author>
</item>
<item>
<title>A Continued Fractions Theory for the completion of the Puiseux field</title>
<description><a href="https://papers.cool/arxiv/2407.05454">[Site]</a> <a href="https://papers.cool/Detection/2407.05454">[Kimi]</a> <p><b>Authors:</b> Luis Arenas-Carmona</p> <p>In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients are polynomials in roots of the variable, and that this approximation is the best ''rational'' Diophantine approximation of such element. Then, we interpret the preceding result in terms of the action of a suitable arithmetic subgroup of the special linear group on the Berkovich space defined over the said completion. We also explore the connections between points of type IV of the Berkovich space in terms of some ''non-convergent'' or ''undefined'' continued fractions, in a sense that we make precise in the text.</p> </description>
<link>https://papers.cool/arxiv/2407.05454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.05454</guid>
<pubDate>Sun, 07 Jul 2024 17:37:38 GMT</pubDate>
<author>Luis Arenas-Carmona</author>
</item>
<item>
<title>A Calculus for Unreachable Code</title>
<description><a href="https://papers.cool/arxiv/2407.04917">[Site]</a> <a href="https://papers.cool/Detection/2407.04917">[Kimi]</a> <p><b>Authors:</b> Peter Zhong</p> <p>In Racket, the LLVM IR, Rust, and other modern languages, programmers and static analyses can hint, with special annotations, that certain parts of a program are unreachable. Same as other assumptions about undefined behavior; the compiler assumes these hints are correct and transforms the program aggressively. While compile-time transformations due to undefined behavior often perplex compiler writers and developers, we show that the essence of transformations due to unreachable code can be distilled in a surprisingly small set of simple formal rules. Specifically, following the well-established tradition of understanding linguistic phenomena through calculi, we introduce the first calculus for unreachable. Its term-rewriting rules that take advantage of unreachable fall into two groups. The first group allows the compiler to delete any code downstream of unreachable, and any effect-free code upstream of unreachable. The second group consists of rules that eliminate conditional expressions when one of their branches is unreachable. We show the correctness of the rules with a novel logical relation, and we examine how they correspond to transformations due to unreachable in Racket and LLVM.</p> </description>
<link>https://papers.cool/arxiv/2407.04917</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.04917</guid>
<pubDate>Sat, 06 Jul 2024 01:49:57 GMT</pubDate>
<author>Peter Zhong</author>
</item>
<item>
<title>Jackknife inference with two-way clustering</title>
<description><a href="https://papers.cool/arxiv/2406.08880">[Site]</a> <a href="https://papers.cool/Detection/2406.08880">[Kimi]</a> <p><b>Authors:</b> James G. MacKinnon</p> <p>For linear regression models with cross-section or panel data, it is natural to assume that the disturbances are clustered in two dimensions. However, the finite-sample properties of two-way cluster-robust tests and confidence intervals are often poor. We discuss several ways to improve inference with two-way clustering. Two of these are existing methods for avoiding, or at least ameliorating, the problem of undefined standard errors when a cluster-robust variance matrix estimator (CRVE) is not positive definite. One is a new method that always avoids the problem. More importantly, we propose a family of new two-way CRVEs based on the cluster jackknife. Simulations for models with two-way fixed effects suggest that, in many cases, the cluster-jackknife CRVE combined with our new method yields surprisingly accurate inferences. We provide a simple software package, twowayjack for Stata, that implements our recommended variance estimator.</p> </description>
<link>https://papers.cool/arxiv/2406.08880</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2406.08880</guid>
<pubDate>Thu, 13 Jun 2024 07:31:46 GMT</pubDate>
<author>James G. MacKinnon</author>
</item>
<item>
<title>Defining Requirements Strategies in Agile: A Design Science Research Study</title>
<description><a href="https://papers.cool/arxiv/2405.18847">[Site]</a> <a href="https://papers.cool/Detection/2405.18847">[Kimi]</a> <p><b>Authors:</b> Amna Pir Muhammad</p> <p>Research shows that many of the challenges currently encountered with agile development are related to requirements engineering. Based on design science research, this paper investigates critical challenges that arise in agile development from an undefined requirements strategy. We explore potential ways to address these challenges and synthesize the key building blocks of requirements strategies. Our design science research rests on a multiple case study with three industrial cases in the domains of communication technology, security services, and automotive. We relied on a total of 20 interviews, two workshops, participant observation in two cases, and document analysis in each of the cases to understand concrete challenges and workflows. In each case, we define a requirements strategy in collaboration with process managers and experienced engineers. From this experience, we extract guidelines for defining requirements strategies in agile development.</p> </description>
<link>https://papers.cool/arxiv/2405.18847</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.18847</guid>
<pubDate>Wed, 29 May 2024 07:57:32 GMT</pubDate>
<author>Amna Pir Muhammad</author>
</item>
<item>
<title>Analysis of Broken Randomized Experiments by Principal Stratification</title>
<description><a href="https://papers.cool/arxiv/2405.16780">[Site]</a> <a href="https://papers.cool/Detection/2405.16780">[Kimi]</a> <p><b>Authors:</b> Qinqing Liu</p> <p>Although randomized controlled trials have long been regarded as the ``gold standard'' for evaluating treatment effects, there is no natural prevention from post-treatment events. For example, non-compliance makes the actual treatment different from the assigned treatment, truncation-by-death renders the outcome undefined or ill-defined, and missingness prevents the outcomes from being measured. In this paper, we develop a statistical analysis framework using principal stratification to investigate the treatment effect in broken randomized experiments. The average treatment effect in compliers and always-survivors is adopted as the target causal estimand. We establish the asymptotic property for the estimator. We apply the framework to study the effect of training on earnings in the Job Corps Study and find that the training program does not have an effect on employment but possibly have an effect on improving the earnings after employment.</p> </description>
<link>https://papers.cool/arxiv/2405.16780</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.16780</guid>
<pubDate>Mon, 27 May 2024 03:05:29 GMT</pubDate>
<author>Qinqing Liu</author>
</item>
<item>
<title>A Study of Undefined Behavior Across Foreign Function Boundaries in Rust Libraries</title>
<description><a href="https://papers.cool/arxiv/2404.11671">[Site]</a> <a href="https://papers.cool/Detection/2404.11671">[Kimi]</a> <p><b>Authors:</b> Ian McCormack</p> <p>Developers rely on the Rust programming language's static safety guarantees to write secure and performant applications. However, Rust is frequently used to interoperate with other languages which allow design patterns that conflict with Rust's aliasing models. Miri is the only dynamic analysis tool capable of validating applications against these models, but it does not support foreign functions, indicating that there may be a critical correctness gap at the heart of the Rust ecosystem. We conducted a large-scale evaluation of Rust libraries that call foreign functions to determine whether Miri's dynamic analyses remain useful in this context. We used Miri and an LLVM interpreter to jointly execute applications that call foreign functions, where we found 48 instances of undefined or undesired behavior. These include three bugs from libraries that had over 10,000 daily downloads on average during our observation period and one from a library maintained by the Rust Project. Many of the errors we found involved incompatible aliasing patterns, but Rust's latest Tree Borrows aliasing model was significantly more permissive than the earlier Stacked Borrows model. The Rust community must invest in new, production-ready tooling for multi-language applications to ensure that developers can detect these errors.</p> </description>
<link>https://papers.cool/arxiv/2404.11671</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2404.11671</guid>
<pubDate>Wed, 17 Apr 2024 18:12:05 GMT</pubDate>
<author>Ian McCormack</author>
</item>
<item>
<title>EventRL: Enhancing Event Extraction with Outcome Supervision for Large Language Models</title>
<description><a href="https://papers.cool/arxiv/2402.11430">[Site]</a> <a href="https://papers.cool/Detection/2402.11430">[Kimi]</a> <p><b>Authors:</b> Jun Gao</p> <p>In this study, we present EventRL, a reinforcement learning approach developed to enhance event extraction for large language models (LLMs). EventRL utilizes outcome supervision with specific reward functions to tackle prevalent challenges in LLMs, such as instruction following and hallucination, manifested as the mismatch of event structure and the generation of undefined event types. We evaluate EventRL against existing methods like Few-Shot Prompting (FSP) (based on GPT4) and Supervised Fine-Tuning (SFT) across various LLMs, including GPT-4, LLaMa, and CodeLLaMa models. Our findings show that EventRL significantly outperforms these conventional approaches by improving the performance in identifying and structuring events, particularly in handling novel event types. The study emphasizes the critical role of reward function selection and demonstrates the benefits of incorporating code data for better event extraction. While increasing model size leads to higher accuracy, maintaining the ability to generalize is essential to avoid overfitting.</p> </description>
<link>https://papers.cool/arxiv/2402.11430</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2402.11430</guid>
<pubDate>Sun, 18 Feb 2024 02:41:06 GMT</pubDate>
<author>Jun Gao</author>
</item>
<item>
<title>SECOMP: Formally Secure Compilation of Compartmentalized C Programs</title>
<description><a href="https://papers.cool/arxiv/2401.16277">[Site]</a> <a href="https://papers.cool/Detection/2401.16277">[Kimi]</a> <p><b>Authors:</b> Jérémy Thibault</p> <p>Undefined behavior in C often causes devastating security vulnerabilities. One practical mitigation is compartmentalization, which allows developers to structure large programs into mutually distrustful compartments with clearly specified privileges and interactions. In this paper we introduce SECOMP, a compiler for compartmentalized C code that comes with machine-checked proofs guaranteeing that the scope of undefined behavior is restricted to the compartments that encounter it and become dynamically compromised. These guarantees are formalized as the preservation of safety properties against adversarial contexts, a secure compilation criterion similar to full abstraction, and this is the first time such a strong criterion is proven for a mainstream programming language. To achieve this we extend the languages of the CompCert verified C compiler with isolated compartments that can only interact via procedure calls and returns, as specified by cross-compartment interfaces. We adapt the passes and optimizations of CompCert as well as their correctness proofs to this compartment-aware setting. We then use compiler correctness as an ingredient in a larger secure compilation proof that involves several proof engineering novelties, needed to scale formally secure compilation up to a C compiler.</p> </description>
<link>https://papers.cool/arxiv/2401.16277</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2401.16277</guid>
<pubDate>Mon, 29 Jan 2024 16:32:36 GMT</pubDate>
<author>Jérémy Thibault</author>
</item>
<item>
<title>Taming numerical imprecision by adapting the KL divergence to negative probabilities</title>
<description><a href="https://papers.cool/arxiv/2312.13021">[Site]</a> <a href="https://papers.cool/Detection/2312.13021">[Kimi]</a> <p><b>Authors:</b> Simon Pfahler</p> <p>The Kullback-Leibler (KL) divergence is frequently used in data science. For discrete distributions on large state spaces, approximations of probability vectors may result in a few small negative entries, rendering the KL divergence undefined. We address this problem by introducing a parameterized family of substitute divergence measures, the shifted KL (sKL) divergence measures. Our approach is generic and does not increase the computational overhead. We show that the sKL divergence shares important theoretical properties with the KL divergence and discuss how its shift parameters should be chosen. If Gaussian noise is added to a probability vector, we prove that the average sKL divergence converges to the KL divergence for small enough noise. We also show that our method solves the problem of negative entries in an application from computational oncology, the optimization of Mutual Hazard Networks for cancer progression using tensor-train approximations.</p> </description>
<link>https://papers.cool/arxiv/2312.13021</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.13021</guid>
<pubDate>Wed, 20 Dec 2023 13:42:00 GMT</pubDate>
<author>Simon Pfahler</author>
</item>
<item>
<title>Performance rating in chess, tennis, and other contexts</title>
<description><a href="https://papers.cool/arxiv/2312.12700">[Site]</a> <a href="https://papers.cool/Detection/2312.12700">[Kimi]</a> <p><b>Authors:</b> Mehmet S. Ismail</p> <p>In this note, I introduce Estimated Performance Rating (PR$^e$), a novel system for evaluating player performance in sports and games. PR$^e$ addresses a key limitation of the Tournament Performance Rating (TPR) system, which is undefined for zero or perfect scores in a series of games. PR$^e$ is defined as the rating that solves an optimization problem related to scoring probability, making it applicable for any performance level. The main theorem establishes that the PR$^e$ of a player is equivalent to the TPR whenever the latter is defined. I then apply this system to historically significant win-streaks in association football, tennis, and chess. Beyond sports, PR$^e$ has broad applicability in domains where Elo ratings are used, from college rankings to the evaluation of large language models.</p> </description>
<link>https://papers.cool/arxiv/2312.12700</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.12700</guid>
<pubDate>Wed, 20 Dec 2023 01:47:55 GMT</pubDate>
<author>Mehmet S. Ismail</author>
</item>
<item>
<title>Memory Simulations, Security and Optimization in a Verified Compiler</title>
<description><a href="https://papers.cool/arxiv/2312.08117">[Site]</a> <a href="https://papers.cool/Detection/2312.08117">[Kimi]</a> <p><b>Authors:</b> VERIMAG - IMAG David Monniaux</p> <p>Current compilers implement security features and optimizations that require nontrivial semantic reasoning about pointers and memory allocation: the program after the insertion of the security feature, or after applying the optimization, must simulate the original program despite a different memory layout. In this article, we illustrate such reasoning on pointer allocations through memory extensions and injections, as well as fine points on undefined values, by explaining how we implemented and proved correct two security features (stack canaries and pointer authentication) and one optimization (tail recursion elimination) in the CompCert formally verified compiler.</p> </description>
<link>https://papers.cool/arxiv/2312.08117</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.08117</guid>
<pubDate>Wed, 13 Dec 2023 13:11:05 GMT</pubDate>
<author>VERIMAG - IMAG David Monniaux</author>
</item>
<item>
<title>Coherent control of two Jaynes-Cummings cavities</title>
<description><a href="https://papers.cool/arxiv/2312.06984">[Site]</a> <a href="https://papers.cool/Detection/2312.06984">[Kimi]</a> <p><b>Authors:</b> L. O. Castaños-Cervantes</p> <p>In this work, we uncover new features on the study of a two-level atom interacting with one of two cavities in a coherent superposition. The James-Cummings model is used to describe the atom-field interaction and to study the effects of quantum indefiniteness on such an interaction. We show that coherent control of the two cavities in an undefined manner allows novel possibilities to manipulate the atomic dynamics on demand which are not achievable in the conventional way. In addition, it is shown that the coherent control of the atom creates highly entangled states of the cavity fields taking a Bell-like or Schrödinger-cat-like state form. Our results are a step forward to understand and harness quantum systems in a coherent control, and open a new research avenue in the study of atom-field interaction exploiting quantum indefiniteness.</p> </description>
<link>https://papers.cool/arxiv/2312.06984</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.06984</guid>
<pubDate>Tue, 12 Dec 2023 05:03:13 GMT</pubDate>
<author>L. O. Castaños-Cervantes</author>
</item>
<item>
<title>Personality of AI</title>
<description><a href="https://papers.cool/arxiv/2312.02998">[Site]</a> <a href="https://papers.cool/Detection/2312.02998">[Kimi]</a> <p><b>Authors:</b> Byunggu Yu</p> <p>This research paper delves into the evolving landscape of fine-tuning large language models (LLMs) to align with human users, extending beyond basic alignment to propose "personality alignment" for language models in organizational settings. Acknowledging the impact of training methods on the formation of undefined personality traits in AI models, the study draws parallels with human fitting processes using personality tests. Through an original case study, we demonstrate the necessity of personality fine-tuning for AIs and raise intriguing questions about applying human-designed tests to AIs, engineering specialized AI personality tests, and shaping AI personalities to suit organizational roles. The paper serves as a starting point for discussions and developments in the burgeoning field of AI personality alignment, offering a foundational anchor for future exploration in human-machine teaming and co-existence.</p> </description>
<link>https://papers.cool/arxiv/2312.02998</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.02998</guid>
<pubDate>Sun, 03 Dec 2023 18:23:45 GMT</pubDate>
<author>Byunggu Yu</author>
</item>
<item>
<title>3vLTL: A Tool to Generate Automata for Three-valued LTL</title>
<description><a href="https://papers.cool/arxiv/2311.09787">[Site]</a> <a href="https://papers.cool/Detection/2311.09787">[Kimi]</a> <p><b>Authors:</b> Imperial College London Francesco Belardinelli</p> <p>Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multi-valued specification languages. We present 3vLTL, a tool to generate Buchi automata from formulas in Linear-time Temporal Logic (LTL) interpreted on a three-valued semantics. Given an LTL formula, a set of atomic propositions as the alphabet for the automaton, and a truth value, our procedure generates a Buchi automaton that accepts all the words that assign the chosen truth value to the LTL formula. Given the particular type of the output of the tool, it can also be seamlessly processed by third-party libraries in a natural way. That is, the Buchi automaton can then be used in the context of formal verification to check whether an LTL formula is true, false, or undefined on a given model.</p> </description>
<link>https://papers.cool/arxiv/2311.09787</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2311.09787</guid>
<pubDate>Thu, 16 Nov 2023 11:04:38 GMT</pubDate>
<author>Imperial College London Francesco Belardinelli</author>
</item>
<item>
<title>One-Way Communication Complexity of Partial XOR Functions</title>
<description><a href="https://papers.cool/arxiv/2310.20606">[Site]</a> <a href="https://papers.cool/Detection/2310.20606">[Kimi]</a> <p><b>Authors:</b> Vladimir V. Podolskii</p> <p>Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y)=f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known that deterministic communication complexity of $F$ is closely related to parity decision tree complexity of $f$. Montanaro and Osbourne (2009) observed that one-sided communication complexity $D_{cc}^{\rightarrow}(F)$ of $F$ is exactly equal to nonadaptive parity decision tree complexity $NADT^{\oplus}(f)$ of $f$. Hatami et al. (2018) showed that unrestricted communication complexity of $F$ is polynomially related to parity decision tree complexity of $f$. We initiate the studies of a similar connection for partial functions. We show that in case of one-sided communication complexity whether these measures are equal, depends on the number of undefined inputs of $f$. On the one hand, if $D_{cc}^{\rightarrow}(F)=t$ and $f$ is undefined on at most $O(\frac{2^{n-t}}{\sqrt{n-t}})$, then $NADT^{\oplus}(f)=t$. On the other hand, for a wide range of values of $D_{cc}^{\rightarrow}(F)$ and $NADT^{\oplus}(f)$ (from constant to $n-2$) we provide partial functions for which $D_{cc}^{\rightarrow}(F) &lt; NADT^{\oplus}(f)$. In particular, we provide a function with an exponential gap between the two measures. Our separation results translate to the case of two-sided communication complexity as well, in particular showing that the result of Hatami et al. (2018) cannot be generalized to partial functions. Previous results for total functions heavily rely on Boolean Fourier analysis and the technique does not translate to partial functions. For the proofs of our results we build a linear algebraic framework instead. Separation results are proved through the reduction to covering codes.</p> </description>
<link>https://papers.cool/arxiv/2310.20606</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.20606</guid>
<pubDate>Tue, 31 Oct 2023 16:42:10 GMT</pubDate>
<author>Vladimir V. Podolskii</author>
</item>
<item>
<title>Heavy-light $N+1$ clusters of two-dimensional fermions</title>
<description><a href="https://papers.cool/arxiv/2310.11330">[Site]</a> <a href="https://papers.cool/Detection/2310.11330">[Kimi]</a> <p><b>Authors:</b> J. Givois</p> <p>We study binding of $N$ identical heavy fermions by a light atom in two dimensions assuming zero-range attractive heavy-light interactions. By using the mean-field theory valid for large $N$ we show that the $N+1$ cluster is bound when the mass ratio exceeds $1.074N^2$. The mean-field theory, being scale invariant in two dimensions, predicts only the shapes of the clusters leaving their sizes and energies undefined. By taking into account beyond-mean-field effects we find closed-form expressions for these quantities. We also discuss differences between the Thomas-Fermi and Hartree-Fock approaches for treating the heavy fermions.</p> </description>
<link>https://papers.cool/arxiv/2310.11330</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.11330</guid>
<pubDate>Tue, 17 Oct 2023 15:08:23 GMT</pubDate>
<author>J. Givois</author>
</item>
<item>
<title>On Two- and Three-valued Semantics for Impure Simplicial Complexes</title>
<description><a href="https://papers.cool/arxiv/2310.00989">[Site]</a> <a href="https://papers.cool/Detection/2310.00989">[Kimi]</a> <p><b>Authors:</b> Hans van Ditmarsch</p> <p>Simplicial complexes are a convenient semantic primitive to reason about processes (agents) communicating with each other in synchronous and asynchronous computation. Impure simplicial complexes distinguish active processes from crashed ones, in other words, agents that are alive from agents that are dead. In order to rule out that dead agents reason about themselves and about other agents, three-valued epistemic semantics have been proposed where, in addition to the usual values true and false, the third value stands for undefined: the knowledge of dead agents is undefined and so are the propositional variables describing their local state. Other semantics for impure complexes are two-valued where a dead agent knows everything. Different choices in designing a semantics produce different three-valued semantics, and also different two-valued semantics. In this work, we categorize the available choices by discounting the bad ones, identifying the equivalent ones, and connecting the non-equivalent ones via a translation. The main result of the paper is identifying the main relevant distinction to be the number of truth values and bridging this difference by means of a novel embedding from three- into two-valued semantics. This translation also enables us to highlight quite fundamental modeling differences underpinning various two- and three-valued approaches in this area of combinatorial topology. In particular, pure complexes can be defined as those invariant under the translation.</p> </description>
<link>https://papers.cool/arxiv/2310.00989</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.00989</guid>
<pubDate>Mon, 02 Oct 2023 08:56:26 GMT</pubDate>
<author>Hans van Ditmarsch</author>
</item>
<item>
<title>Innovative Digital Storytelling with AIGC: Exploration and Discussion of Recent Advances</title>
<description><a href="https://papers.cool/arxiv/2309.14329">[Site]</a> <a href="https://papers.cool/Detection/2309.14329">[Kimi]</a> <p><b>Authors:</b> Rongzhang Gu</p> <p>Digital storytelling, as an art form, has struggled with cost-quality balance. The emergence of AI-generated Content (AIGC) is considered as a potential solution for efficient digital storytelling production. However, the specific form, effects, and impacts of this fusion remain unclear, leaving the boundaries of AIGC combined with storytelling undefined. This work explores the current integration state of AIGC and digital storytelling, investigates the artistic value of their fusion in a sample project, and addresses common issues through interviews. Through our study, we conclude that AIGC, while proficient in image creation, voiceover production, and music composition, falls short of replacing humans due to the irreplaceable elements of human creativity and aesthetic sensibilities at present, especially in complex character animations, facial expressions, and sound effects. The research objective is to increase public awareness of the current state, limitations, and challenges arising from combining AIGC and digital storytelling.</p> </description>
<link>https://papers.cool/arxiv/2309.14329</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2309.14329</guid>
<pubDate>Mon, 25 Sep 2023 17:54:29 GMT</pubDate>
<author>Rongzhang Gu</author>
</item>
<item>
<title>Polarization Jumps across Topological Phase Transitions in Two-dimensional Systems</title>
<description><a href="https://papers.cool/arxiv/2304.12742">[Site]</a> <a href="https://papers.cool/Detection/2304.12742">[Kimi]</a> <p><b>Authors:</b> Hiroki Yoshida</p> <p>In topological phase transitions involving a change in topological invariants such as the Chern number and the $\mathbb{Z}_2$ topological invariant, the gap closes, and the electric polarization becomes undefined at the transition. In this paper, we show that the jump of polarization across such topological phase transitions in two dimensions is described in terms of positions and monopole charges of Weyl points in the intermediate Weyl semimetal phase. We find that the jump of polarization is described by the Weyl dipole at $\mathbb{Z}_2$ topological phase transitions and at phase transitions without any change in the value of the Chern number. Meanwhile, when the Chern number changes at the phase transition, the jump is expressed in terms of the relative positions of Weyl points measured from a reference point in the reciprocal space.</p> </description>
<link>https://papers.cool/arxiv/2304.12742</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2304.12742</guid>
<pubDate>Tue, 25 Apr 2023 11:36:08 GMT</pubDate>
<author>Hiroki Yoshida</author>
</item>
<item>
<title>MINER: A Hybrid Data-Driven Approach for REST API Fuzzing</title>
<description><a href="https://papers.cool/arxiv/2303.02545">[Site]</a> <a href="https://papers.cool/Detection/2303.02545">[Kimi]</a> <p><b>Authors:</b> Chenyang Lyu</p> <p>In recent years, REST API fuzzing has emerged to explore errors on a cloud service. Its performance highly depends on the sequence construction and request generation. However, existing REST API fuzzers have trouble generating long sequences with well-constructed requests to trigger hard-to-reach states in a cloud service, which limits their performance of finding deep errors and security bugs. Further, they cannot find the specific errors caused by using undefined parameters during request generation. Therefore, in this paper, we propose a novel hybrid data-driven solution, named MINER, with three new designs working together to address the above limitations. First, MINER collects the valid sequences whose requests pass the cloud service's checking as the templates, and assigns more executions to long sequence templates. Second, to improve the generation quality of requests in a sequence template, MINER creatively leverages the state-of-the-art neural network model to predict key request parameters and provide them with appropriate parameter values. Third, MINER implements a new data-driven security rule checker to capture the new kind of errors caused by undefined parameters. We evaluate MINER against the state-of-the-art fuzzer RESTler on GitLab, Bugzilla, and WordPress via 11 REST APIs. The results demonstrate that the average pass rate of MINER is 23.42% higher than RESTler. MINER finds 97.54% more unique errors than RESTler on average and 142.86% more reproducible errors after manual analysis. We have reported all the newly found errors, and 7 of them have been confirmed as logic bugs by the corresponding vendors.</p> </description>
<link>https://papers.cool/arxiv/2303.02545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.02545</guid>
<pubDate>Sun, 05 Mar 2023 01:41:41 GMT</pubDate>
<author>Chenyang Lyu</author>
</item>
<item>
<title>The variance-gamma ratio distribution</title>
<description><a href="https://papers.cool/arxiv/2302.12581">[Site]</a> <a href="https://papers.cool/Detection/2302.12581">[Kimi]</a> <p><b>Authors:</b> Robert E. Gaunt</p> <p>Let $X$ and $Y$ be independent variance-gamma random variables with zero location parameter; then the exact probability density function of the ratio $X/Y$ is derived. Some basic distributional properties are also derived, including identification of parameter regimes under which the density is bounded, asymptotic approximations of tail probabilities, and fractional moments; in particular, we see that the mean is undefined. In the case that $X$ and $Y$ are independent symmetric variance-gamma random variables, an exact formula is also given for the cumulative distribution function of the ratio $X/Y$.</p> </description>
<link>https://papers.cool/arxiv/2302.12581</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2302.12581</guid>
<pubDate>Fri, 24 Feb 2023 11:40:20 GMT</pubDate>
<author>Robert E. Gaunt</author>
</item>
<item>
<title>Generalized PTR: User-Friendly Recipes for Data-Adaptive Algorithms with Differential Privacy</title>
<description><a href="https://papers.cool/arxiv/2301.00301">[Site]</a> <a href="https://papers.cool/Detection/2301.00301">[Kimi]</a> <p><b>Authors:</b> Rachel Redberg</p> <p>The ''Propose-Test-Release'' (PTR) framework is a classic recipe for designing differentially private (DP) algorithms that are data-adaptive, i.e. those that add less noise when the input dataset is nice. We extend PTR to a more general setting by privately testing data-dependent privacy losses rather than local sensitivity, hence making it applicable beyond the standard noise-adding mechanisms, e.g. to queries with unbounded or undefined sensitivity. We demonstrate the versatility of generalized PTR using private linear regression as a case study. Additionally, we apply our algorithm to solve an open problem from ''Private Aggregation of Teacher Ensembles (PATE)'' -- privately releasing the entire model with a delicate data-dependent analysis.</p> </description>
<link>https://papers.cool/arxiv/2301.00301</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2301.00301</guid>
<pubDate>Sat, 31 Dec 2022 22:22:53 GMT</pubDate>
<author>Rachel Redberg</author>
</item>
<item>
<title>Modular Formal Verification of Rust Programs with Unsafe Blocks</title>
<description><a href="https://papers.cool/arxiv/2212.12976">[Site]</a> <a href="https://papers.cool/Detection/2212.12976">[Kimi]</a> <p><b>Authors:</b> Nima Rahimi Foroushaani</p> <p>Rust is a modern systems programming language whose type system guarantees memory safety. For the sake of expressivity and performance it allows programmers to relax typing rules temporarily, using unsafe code blocks. However, in unsafe blocks, the burden of making sure that the code does not end up having undefined behaviour is on the programmer. Even most expert programmers make mistakes and a memory safety bug in an unsafe block renders all the type system guarantees void. To address this problem we are trying to verify soundness of Rust unsafe code applying our Modular Symbolic Execution algorithm. This text outlines our approach and the progress that has been made so far.</p> </description>
<link>https://papers.cool/arxiv/2212.12976</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.12976</guid>
<pubDate>Mon, 26 Dec 2022 00:19:19 GMT</pubDate>
<author>Nima Rahimi Foroushaani</author>
</item>
<item>
<title>@C -- augmented version of C programming language</title>
<description><a href="https://papers.cool/arxiv/2212.11245">[Site]</a> <a href="https://papers.cool/Detection/2212.11245">[Kimi]</a> <p><b>Authors:</b> Iosif Iulian Petrila</p> <p>The augmented version of C programming language is presented. The language was completed with a series of low-level and high-level facilities to enlarge the language usage spectrum to various computing systems, operations, users. The ambiguities and inconsistencies have been resolved by managing problematic and undefined languages elements through an interpretation and management similar to that used in the case of other C syntax based languages. The proposed augmentative completeness elements, through @C approach, preserve the spirit of C language and its basic characteristics through compatibility with the standard version but also allow rejuvenation and bring C language to the present programming languages state of the art.</p> </description>
<link>https://papers.cool/arxiv/2212.11245</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.11245</guid>
<pubDate>Mon, 19 Dec 2022 07:53:14 GMT</pubDate>
<author>Iosif Iulian Petrila</author>
</item>
<item>
<title>Hunt for 3-Schur polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.14956">[Site]</a> <a href="https://papers.cool/Detection/2211.14956">[Kimi]</a> <p><b>Authors:</b> A. Morozov</p> <p>This paper describes our attempt to understand the recent success of Na Wang in constructing the 3-Schur polynomials, associated with the plane partitions. We provide a rather detailed review and try to figure out the new insights, which allowed to overcome the problems of the previous efforts. In result we provide a very simple definition of time-variables ${\bf P}_{i\geqslant j}$ and the cut-and-join operator $\hat W_2$, which generates the set of $3$-Schur functions. Some coefficients in $\hat W_2$ remain undefined and require more effort to be fixed.</p> </description>
<link>https://papers.cool/arxiv/2211.14956</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.14956</guid>
<pubDate>Sun, 27 Nov 2022 22:28:20 GMT</pubDate>
<author>A. Morozov</author>
</item>
<item>
<title>Impure Simplicial Complexes: Complete Axiomatization</title>
<description><a href="https://papers.cool/arxiv/2211.13543">[Site]</a> <a href="https://papers.cool/Detection/2211.13543">[Kimi]</a> <p><b>Authors:</b> Rojo Randrianomentsoa</p> <p>Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment. Pure simplicial complexes describe message passing in asynchronous systems where all processes (agents) are alive, whereas impure simplicial complexes describe message passing in synchronous systems where processes may be dead (have crashed). Properties of impure simplicial complexes can be described in a three-valued multi-agent epistemic logic where the third value represents formulae that are undefined, e.g., the knowledge and local propositions of dead agents. In this work we present an axiomatization for the logic of the class of impure complexes and show soundness and completeness. The completeness proof involves the novel construction of the canonical simplicial model and requires a careful manipulation of undefined formulae.</p> </description>
<link>https://papers.cool/arxiv/2211.13543</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.13543</guid>
<pubDate>Thu, 24 Nov 2022 11:32:36 GMT</pubDate>
<author>Rojo Randrianomentsoa</author>
</item>
<item>
<title>Some Useful Collective Properties of Bessel, Marcum Q-Functions and Laguerre Polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.12260">[Site]</a> <a href="https://papers.cool/Detection/2211.12260">[Kimi]</a> <p><b>Authors:</b> Hakan Ozturk</p> <p>Special functions have been used widely in many problems of applied sciences. However, there are considerable numbers of problems in which exact solutions could not be achieved because of undefined sums or integrals involving special functions. These handicaps force researchers to seek new properties of special functions. Many problems that could not be solved so far would be solved by means of these efforts. Therefore in this article, we derived some useful properties and interrelations of each others of Bessel functions, Marcum Q-functions and Laguerre polynomials.</p> </description>
<link>https://papers.cool/arxiv/2211.12260</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.12260</guid>
<pubDate>Tue, 22 Nov 2022 13:22:47 GMT</pubDate>
<author>Hakan Ozturk</author>
</item>
<item>
<title>Francois Viete and his contribution to mathematics</title>
<description><a href="https://papers.cool/arxiv/2210.12545">[Site]</a> <a href="https://papers.cool/Detection/2210.12545">[Kimi]</a> <p><b>Authors:</b> Athanasios Paraskevopoulos</p> <p>This paper studies the work of the French mathematician Francois Viete, known as the "father of modern algebraic notation". Along with this fundamental change in algebra, Viete adopted a radically new notation based on Greek geometric equalities. Its letters represent values rather than types, and its given values are undefined. Where algebra had previously relied on polynomials as sets, Viete became the first modern algebraist to work with polynomials generated by operations, and the notations reflect these notions. His work was essential to his successors because it enabled those mathematicians who followed him to develop the mathematics we use today.</p> </description>
<link>https://papers.cool/arxiv/2210.12545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.12545</guid>
<pubDate>Sat, 22 Oct 2022 20:40:50 GMT</pubDate>
<author>Athanasios Paraskevopoulos</author>
</item>
<item>
<title>An Active Learning Reliability Method for Systems with Partially Defined Performance Functions</title>
<description><a href="https://papers.cool/arxiv/2210.02168">[Site]</a> <a href="https://papers.cool/Detection/2210.02168">[Kimi]</a> <p><b>Authors:</b> Jonathan Sadeghi</p> <p>In engineering design, one often wishes to calculate the probability that the performance of a system is satisfactory under uncertainty. State of the art algorithms exist to solve this problem using active learning with Gaussian process models. However, these algorithms cannot be applied to problems which often occur in the autonomous vehicle domain where the performance of a system may be undefined under certain circumstances. To solve this problem, we introduce a hierarchical model for the system performance, where undefined performance is classified before the performance is regressed. This enables active learning Gaussian process methods to be applied to problems where the performance of the system is sometimes undefined, and we demonstrate the effectiveness of our approach by testing our methodology on synthetic numerical examples for the autonomous driving domain.</p> </description>
<link>https://papers.cool/arxiv/2210.02168</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.02168</guid>
<pubDate>Wed, 05 Oct 2022 11:50:36 GMT</pubDate>
<author>Jonathan Sadeghi</author>
</item>
<item>
<title>Schroedinger cats and quantum complementarity</title>
<description><a href="https://papers.cool/arxiv/2210.01083">[Site]</a> <a href="https://papers.cool/Detection/2210.01083">[Kimi]</a> <p><b>Authors:</b> Lorenzo Maccone</p> <p>Complementarity tells us we cannot know precisely the values of all the properties of a quantum object at the same time: the precise determination of one property implies that the value of some other (complementary) property is undefined. E.g.the precise knowledge of the position of a particle implies that its momentum is undefined. Here we show that a Schroedinger cat has a well defined value of a property that is complementary to its ``being dead or alive'' property. Then, thanks to complementarity, it has an undefined value of the property ``being dead or alive''. In other words, the cat paradox is explained through quantum complementarity: of its many complementary properties, any quantum system, such as a cat, can have a well defined value only of one at a time. Schroedinger's cat has a definite value of a property which is complementary to ``being dead or alive'', so it is neither dead nor alive. Figuratively one can say it is both dead and alive. While this interpretation only uses textbook concepts (the Copenhagen interpretation), apparently it has never explicitly appeared in the literature. We detail how to build an Arduino based simulation of Schroedinger's experiment based on these concepts for science outreach events.</p> </description>
<link>https://papers.cool/arxiv/2210.01083</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.01083</guid>
<pubDate>Mon, 03 Oct 2022 17:00:42 GMT</pubDate>
<author>Lorenzo Maccone</author>
</item>
<item>
<title>Defining a credible interval is not always possible with "point-null'' priors: A lesser-known correlate of the Jeffreys-Lindley paradox</title>
<description><a href="https://papers.cool/arxiv/2210.00029">[Site]</a> <a href="https://papers.cool/Detection/2210.00029">[Kimi]</a> <p><b>Authors:</b> Harlan Campbell</p> <p>In many common situations, a Bayesian credible interval will be, given the same data, very similar to a frequentist confidence interval, and researchers will interpret these intervals in a similar fashion. However, no predictable similarity exists when credible intervals are based on model-averaged posteriors whenever one of the two nested models under consideration is a so called ''point-null''. Not only can this model-averaged credible interval be quite different than the frequentist confidence interval, in some cases it may be undefined. This is a lesser-known correlate of the Jeffreys-Lindley paradox and is of particular interest given the popularity of the Bayes factor for testing point-null hypotheses.</p> </description>
<link>https://papers.cool/arxiv/2210.00029</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.00029</guid>
<pubDate>Fri, 30 Sep 2022 18:08:56 GMT</pubDate>
<author>Harlan Campbell</author>
</item>
<item>
<title>Topologically protected four-dimensional optical singularities</title>
<description><a href="https://papers.cool/arxiv/2208.09054">[Site]</a> <a href="https://papers.cool/Detection/2208.09054">[Kimi]</a> <p><b>Authors:</b> Christina M. Spaegele</p> <p>Optical singularities play a major role in modern optics and are frequently deployed in structured light, super-resolution microscopy, and holography. While phase singularities are uniquely defined as locations of undefined phase, polarization singularities studied thus far are either partial, i.e., bright points of well-defined polarization, or unstable for small field perturbations. We demonstrate for the first time a complete, topologically protected polarization singularity; it is located in the 4D space spanned by the three spatial dimensions and the wavelength and is created in the focus of a cascaded metasurface-lens system. The field Jacobian plays a key role in the design of such higher-dimensional singularities, which can be extended to multidimensional wave phenomena, and pave the way to novel applications in topological photonics and precision sensing.</p> </description>
<link>https://papers.cool/arxiv/2208.09054</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2208.09054</guid>
<pubDate>Thu, 18 Aug 2022 20:45:31 GMT</pubDate>
<author>Christina M. Spaegele</author>
</item>
<item>
<title>The "SPectrogram Analysis and Cataloguing Environment" (SPACE) Labelling Tool</title>
<description><a href="https://papers.cool/arxiv/2207.12454">[Site]</a> <a href="https://papers.cool/Detection/2207.12454">[Kimi]</a> <p><b>Authors:</b> C. K. Louis</p> <p>The SPectrogram Analysis and Cataloguing Environment (SPACE) tool is an interactive python tool designed to label radio emission features of interest in a time-frequency map (called 'dynamic spectrum'). The program uses Matplotlib's Polygon Selector widget to allow a user to select and edit an undefined number of vertices on top of the dynamic spectrum before closing the shape (polygon). Multiple polygons may be drawn on any spectrum, and the feature name along with the coordinates for each polygon vertex are saved into a '.json' file as per the 'Time-Frequency Catalogue' (TFCat) format along with other data such as the feature id, observer name, and data units. This paper describes the first official stable release (version 2.0) of the tool.</p> </description>
<link>https://papers.cool/arxiv/2207.12454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2207.12454</guid>
<pubDate>Mon, 25 Jul 2022 18:18:40 GMT</pubDate>
<author>C. K. Louis</author>
</item>
<item>
<title>Simulating long-range coherence of atoms and photons in quantum computers</title>
<description><a href="https://papers.cool/arxiv/2206.08386">[Site]</a> <a href="https://papers.cool/Detection/2206.08386">[Kimi]</a> <p><b>Authors:</b> Emanuele G. Dalla Torre</p> <p>Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.</p> </description>
<link>https://papers.cool/arxiv/2206.08386</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2206.08386</guid>
<pubDate>Thu, 16 Jun 2022 18:00:03 GMT</pubDate>
<author>Emanuele G. Dalla Torre</author>
</item>
<item>
<title>Bosonic fields in states with undefined particle numbers possess detectable non-contextuality features, plus more</title>
<description><a href="https://papers.cool/arxiv/2205.09440">[Site]</a> <a href="https://papers.cool/Detection/2205.09440">[Kimi]</a> <p><b>Authors:</b> Konrad Schlichtholz</p> <p>Most of the paradoxical, for the classical intuition, features of quantum theory were formulated for situations which involve a fixed number of particles. While one can now find a formulation of Bell's theorem for quantum fields, a Kochen-Specker-type reasoning is usually formulated for just one particle, or like in the case of Peres-Mermin square for two. A question emerges. Is it possible to formulate a contextuality proof for situation in which the numbers of particles are fundamentally undefined? We address this problem for bosonic fields. We introduce a representation of the $\mathfrak{su}(2)$ algebra in terms of boson number states in two modes that allows us to assess nonclassicality of states of bosonic fields. As a figure of merit of a nonclassical behaviour we analyze first of all contextuality, and we show that the introduced observables are handy and efficient to reveal violation of local realism, and to formulate entanglement indicators. We construct a method which extends the Kochen-Specker contextuality to bosonic quantum fields. A form of an inequality is derived using a suitable version of the Peres-Mermin square. The entanglement indicators use a witness built with specially defined Pauli-like observables. Finally, Bell-nonclassicality is discussed: an inequality that involves the expectation values of pairs of the Pauli-like operators is presented. The introduced indicators are shown to be effective, e.g. they reveal nonclassicality in situaations involving undefined boson numbers. This is shown via quantum optical examples of the $2\times 2$ bright squeezed vacuum state, and a recently discussed bright-GHZ state resulting from multiple three photon emissions in a parametric process.</p> </description>
<link>https://papers.cool/arxiv/2205.09440</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2205.09440</guid>
<pubDate>Thu, 19 May 2022 09:56:08 GMT</pubDate>
<author>Konrad Schlichtholz</author>
</item>
<item>
<title>Textual Stylistic Variation: Choices, Genres and Individuals</title>
<description><a href="https://papers.cool/arxiv/2205.00510">[Site]</a> <a href="https://papers.cool/Detection/2205.00510">[Kimi]</a> <p><b>Authors:</b> Jussi Karlgren</p> <p>This chapter argues for more informed target metrics for the statistical processing of stylistic variation in text collections. Much as operationalised relevance proved a useful goal to strive for in information retrieval, research in textual stylistics, whether application oriented or philologically inclined, needs goals formulated in terms of pertinence, relevance, and utility - notions that agree with reader experience of text. Differences readers are aware of are mostly based on utility - not on textual characteristics per se. Mostly, readers report stylistic differences in terms of genres. Genres, while vague and undefined, are well-established and talked a |
|
Successfully generated as following: http://localhost:1200/papers/query/Detection - Success ✔️<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
<channel>
<title>undefined</title>
<link>https://papers.cool/arxiv/search?highlight=1&query=undefined&sort=0</link>
<atom:link href="http://localhost:1200/papers/query/Detection" rel="self" type="application/rss+xml"></atom:link>
<description>undefined - Powered by RSSHub</description>
<generator>RSSHub</generator>
<webMaster>[email protected] (RSSHub)</webMaster>
<language>en</language>
<lastBuildDate>Wed, 18 Dec 2024 15:35:07 GMT</lastBuildDate>
<ttl>5</ttl>
<item>
<title>Estimating Spillover Effects in the Presence of Isolated Nodes</title>
<description><a href="https://papers.cool/arxiv/2412.05919">[Site]</a> <a href="https://papers.cool/Detection/2412.05919">[Kimi]</a> <p><b>Authors:</b> Bora Kim</p> <p>In estimating spillover effects under network interference, practitioners often use linear regression with either the number or fraction of treated neighbors as regressors. An often overlooked fact is that the latter is undefined for units without neighbors (``isolated nodes"). The common practice is to impute this fraction as zero for isolated nodes. This paper shows that such practice introduces bias through theoretical derivations and simulations. Causal interpretations of the commonly used spillover regression coefficients are also provided.</p> </description>
<link>https://papers.cool/arxiv/2412.05919</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.05919</guid>
<pubDate>Sun, 08 Dec 2024 12:28:54 GMT</pubDate>
<author>Bora Kim</author>
</item>
<item>
<title>Surveying the Rust Verification Landscape</title>
<description><a href="https://papers.cool/arxiv/2410.01981">[Site]</a> <a href="https://papers.cool/Detection/2410.01981">[Kimi]</a> <p><b>Authors:</b> Alex Le Blanc</p> <p>Rust aims to be a safe programming language applicable to systems programming applications. In particular, its type system has strong guardrails to prevent a variety of issues, such as memory safety bugs and data races. However, these guardrails can be sidestepped via the unsafe keyword. unsafe allows certain otherwise-prohibited operations, but shifts the onus of preventing undefined behaviour from the Rust language's compile-time checks to the developer. We believe that tools have a role to play in ensuring the absence of undefined behaviour in the presence of unsafe code. Moreover, safety aside, programs would also benefit from being verified for functional correctness, ensuring that they meet their specifications. In this research proposal, we explore what it means to do Rust verification. Specifically, we explore which properties are worth verifying for Rust; what techniques exist to verify them; and which code is worth verifying. In doing so, we motivate an effort to verify safety properties of the Rust standard library, presenting the relevant challenges along with ideas to address them.</p> </description>
<link>https://papers.cool/arxiv/2410.01981</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.01981</guid>
<pubDate>Wed, 02 Oct 2024 19:40:18 GMT</pubDate>
<author>Alex Le Blanc</author>
</item>
<item>
<title>Quantum Black Hole as a Harmonic Oscillator from the Perspective of the Minimum Uncertainty Approach</title>
<description><a href="https://papers.cool/arxiv/2409.09181">[Site]</a> <a href="https://papers.cool/Detection/2409.09181">[Kimi]</a> <p><b>Authors:</b> Octavio Obregón</p> <p>Starting from the Wheeler-DeWitt equation for the Schwarzschild black hole interior, which is derived from a Hamiltonian formulated in terms of canonical phase space coordinates, we show that by applying a simple reparametrization, this equation can be expressed as the eigenvalue equation of a quantum linear harmonic oscillator. Within the standard quantization framework, we find that the resulting wave function diverges in the region of the classical singularity, and the expectation value of the Kretschmann scalar is undefined for all states within the black hole. However, when we apply the minimal uncertainty approach to the quantization process, we obtain a wave function that is both well-defined and square-integrable. Additionally, the expectation value of the Kretschmann scalar for these states remains finite throughout the black hole's interior, suggesting that the classical singularity is resolved in this approach, replaced it by a minimum radius.</p> </description>
<link>https://papers.cool/arxiv/2409.09181</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.09181</guid>
<pubDate>Fri, 13 Sep 2024 20:37:43 GMT</pubDate>
<author>Octavio Obregón</author>
</item>
<item>
<title>From annular to toroidal pseudo knots</title>
<description><a href="https://papers.cool/arxiv/2409.03537">[Site]</a> <a href="https://papers.cool/Detection/2409.03537">[Kimi]</a> <p><b>Authors:</b> Ioannis Diamantis</p> <p>In this paper, we extend the theory of planar pseudo knots to the theories of annular and toroidal pseudo knots. Pseudo knots are defined as equivalence classes under Reidemeister-like moves of knot diagrams characterized by crossings with undefined over/under information. In the theories of annular and toroidal pseudo knots we introduce their respective lifts to the solid and the thickened torus. Then, we interlink these theories by representing annular and toroidal pseudo knots as planar ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. We also explore the inclusion relations between planar, annular and toroidal pseudo knots, as well as of ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. Finally, we extend the planar weighted resolution set to annular and toroidal pseudo knots, defining new invariants for classifying pseudo knots and links in the solid and in the thickened torus.</p> </description>
<link>https://papers.cool/arxiv/2409.03537</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.03537</guid>
<pubDate>Thu, 05 Sep 2024 13:53:34 GMT</pubDate>
<author>Ioannis Diamantis</author>
</item>
<item>
<title>BiGS: Bidirectional Gaussian Primitives for Relightable 3D Gaussian Splatting</title>
<description><a href="https://papers.cool/arxiv/2408.13370">[Site]</a> <a href="https://papers.cool/Detection/2408.13370">[Kimi]</a> <p><b>Authors:</b> Zhenyuan Liu</p> <p>We present Bidirectional Gaussian Primitives, an image-based novel view synthesis technique designed to represent and render 3D objects with surface and volumetric materials under dynamic illumination. Our approach integrates light intrinsic decomposition into the Gaussian splatting framework, enabling real-time relighting of 3D objects. To unify surface and volumetric material within a cohesive appearance model, we adopt a light- and view-dependent scattering representation via bidirectional spherical harmonics. Our model does not use a specific surface normal-related reflectance function, making it more compatible with volumetric representations like Gaussian splatting, where the normals are undefined. We demonstrate our method by reconstructing and rendering objects with complex materials. Using One-Light-At-a-Time (OLAT) data as input, we can reproduce photorealistic appearances under novel lighting conditions in real time.</p> </description>
<link>https://papers.cool/arxiv/2408.13370</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2408.13370</guid>
<pubDate>Fri, 23 Aug 2024 21:04:40 GMT</pubDate>
<author>Zhenyuan Liu</author>
</item>
<item>
<title>A Continued Fractions Theory for the completion of the Puiseux field</title>
<description><a href="https://papers.cool/arxiv/2407.05454">[Site]</a> <a href="https://papers.cool/Detection/2407.05454">[Kimi]</a> <p><b>Authors:</b> Luis Arenas-Carmona</p> <p>In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients are polynomials in roots of the variable, and that this approximation is the best ''rational'' Diophantine approximation of such element. Then, we interpret the preceding result in terms of the action of a suitable arithmetic subgroup of the special linear group on the Berkovich space defined over the said completion. We also explore the connections between points of type IV of the Berkovich space in terms of some ''non-convergent'' or ''undefined'' continued fractions, in a sense that we make precise in the text.</p> </description>
<link>https://papers.cool/arxiv/2407.05454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.05454</guid>
<pubDate>Sun, 07 Jul 2024 17:37:38 GMT</pubDate>
<author>Luis Arenas-Carmona</author>
</item>
<item>
<title>A Calculus for Unreachable Code</title>
<description><a href="https://papers.cool/arxiv/2407.04917">[Site]</a> <a href="https://papers.cool/Detection/2407.04917">[Kimi]</a> <p><b>Authors:</b> Peter Zhong</p> <p>In Racket, the LLVM IR, Rust, and other modern languages, programmers and static analyses can hint, with special annotations, that certain parts of a program are unreachable. Same as other assumptions about undefined behavior; the compiler assumes these hints are correct and transforms the program aggressively. While compile-time transformations due to undefined behavior often perplex compiler writers and developers, we show that the essence of transformations due to unreachable code can be distilled in a surprisingly small set of simple formal rules. Specifically, following the well-established tradition of understanding linguistic phenomena through calculi, we introduce the first calculus for unreachable. Its term-rewriting rules that take advantage of unreachable fall into two groups. The first group allows the compiler to delete any code downstream of unreachable, and any effect-free code upstream of unreachable. The second group consists of rules that eliminate conditional expressions when one of their branches is unreachable. We show the correctness of the rules with a novel logical relation, and we examine how they correspond to transformations due to unreachable in Racket and LLVM.</p> </description>
<link>https://papers.cool/arxiv/2407.04917</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.04917</guid>
<pubDate>Sat, 06 Jul 2024 01:49:57 GMT</pubDate>
<author>Peter Zhong</author>
</item>
<item>
<title>Jackknife inference with two-way clustering</title>
<description><a href="https://papers.cool/arxiv/2406.08880">[Site]</a> <a href="https://papers.cool/Detection/2406.08880">[Kimi]</a> <p><b>Authors:</b> James G. MacKinnon</p> <p>For linear regression models with cross-section or panel data, it is natural to assume that the disturbances are clustered in two dimensions. However, the finite-sample properties of two-way cluster-robust tests and confidence intervals are often poor. We discuss several ways to improve inference with two-way clustering. Two of these are existing methods for avoiding, or at least ameliorating, the problem of undefined standard errors when a cluster-robust variance matrix estimator (CRVE) is not positive definite. One is a new method that always avoids the problem. More importantly, we propose a family of new two-way CRVEs based on the cluster jackknife. Simulations for models with two-way fixed effects suggest that, in many cases, the cluster-jackknife CRVE combined with our new method yields surprisingly accurate inferences. We provide a simple software package, twowayjack for Stata, that implements our recommended variance estimator.</p> </description>
<link>https://papers.cool/arxiv/2406.08880</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2406.08880</guid>
<pubDate>Thu, 13 Jun 2024 07:31:46 GMT</pubDate>
<author>James G. MacKinnon</author>
</item>
<item>
<title>Defining Requirements Strategies in Agile: A Design Science Research Study</title>
<description><a href="https://papers.cool/arxiv/2405.18847">[Site]</a> <a href="https://papers.cool/Detection/2405.18847">[Kimi]</a> <p><b>Authors:</b> Amna Pir Muhammad</p> <p>Research shows that many of the challenges currently encountered with agile development are related to requirements engineering. Based on design science research, this paper investigates critical challenges that arise in agile development from an undefined requirements strategy. We explore potential ways to address these challenges and synthesize the key building blocks of requirements strategies. Our design science research rests on a multiple case study with three industrial cases in the domains of communication technology, security services, and automotive. We relied on a total of 20 interviews, two workshops, participant observation in two cases, and document analysis in each of the cases to understand concrete challenges and workflows. In each case, we define a requirements strategy in collaboration with process managers and experienced engineers. From this experience, we extract guidelines for defining requirements strategies in agile development.</p> </description>
<link>https://papers.cool/arxiv/2405.18847</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.18847</guid>
<pubDate>Wed, 29 May 2024 07:57:32 GMT</pubDate>
<author>Amna Pir Muhammad</author>
</item>
<item>
<title>Analysis of Broken Randomized Experiments by Principal Stratification</title>
<description><a href="https://papers.cool/arxiv/2405.16780">[Site]</a> <a href="https://papers.cool/Detection/2405.16780">[Kimi]</a> <p><b>Authors:</b> Qinqing Liu</p> <p>Although randomized controlled trials have long been regarded as the ``gold standard'' for evaluating treatment effects, there is no natural prevention from post-treatment events. For example, non-compliance makes the actual treatment different from the assigned treatment, truncation-by-death renders the outcome undefined or ill-defined, and missingness prevents the outcomes from being measured. In this paper, we develop a statistical analysis framework using principal stratification to investigate the treatment effect in broken randomized experiments. The average treatment effect in compliers and always-survivors is adopted as the target causal estimand. We establish the asymptotic property for the estimator. We apply the framework to study the effect of training on earnings in the Job Corps Study and find that the training program does not have an effect on employment but possibly have an effect on improving the earnings after employment.</p> </description>
<link>https://papers.cool/arxiv/2405.16780</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.16780</guid>
<pubDate>Mon, 27 May 2024 03:05:29 GMT</pubDate>
<author>Qinqing Liu</author>
</item>
<item>
<title>A Study of Undefined Behavior Across Foreign Function Boundaries in Rust Libraries</title>
<description><a href="https://papers.cool/arxiv/2404.11671">[Site]</a> <a href="https://papers.cool/Detection/2404.11671">[Kimi]</a> <p><b>Authors:</b> Ian McCormack</p> <p>Developers rely on the Rust programming language's static safety guarantees to write secure and performant applications. However, Rust is frequently used to interoperate with other languages which allow design patterns that conflict with Rust's aliasing models. Miri is the only dynamic analysis tool capable of validating applications against these models, but it does not support foreign functions, indicating that there may be a critical correctness gap at the heart of the Rust ecosystem. We conducted a large-scale evaluation of Rust libraries that call foreign functions to determine whether Miri's dynamic analyses remain useful in this context. We used Miri and an LLVM interpreter to jointly execute applications that call foreign functions, where we found 48 instances of undefined or undesired behavior. These include three bugs from libraries that had over 10,000 daily downloads on average during our observation period and one from a library maintained by the Rust Project. Many of the errors we found involved incompatible aliasing patterns, but Rust's latest Tree Borrows aliasing model was significantly more permissive than the earlier Stacked Borrows model. The Rust community must invest in new, production-ready tooling for multi-language applications to ensure that developers can detect these errors.</p> </description>
<link>https://papers.cool/arxiv/2404.11671</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2404.11671</guid>
<pubDate>Wed, 17 Apr 2024 18:12:05 GMT</pubDate>
<author>Ian McCormack</author>
</item>
<item>
<title>EventRL: Enhancing Event Extraction with Outcome Supervision for Large Language Models</title>
<description><a href="https://papers.cool/arxiv/2402.11430">[Site]</a> <a href="https://papers.cool/Detection/2402.11430">[Kimi]</a> <p><b>Authors:</b> Jun Gao</p> <p>In this study, we present EventRL, a reinforcement learning approach developed to enhance event extraction for large language models (LLMs). EventRL utilizes outcome supervision with specific reward functions to tackle prevalent challenges in LLMs, such as instruction following and hallucination, manifested as the mismatch of event structure and the generation of undefined event types. We evaluate EventRL against existing methods like Few-Shot Prompting (FSP) (based on GPT4) and Supervised Fine-Tuning (SFT) across various LLMs, including GPT-4, LLaMa, and CodeLLaMa models. Our findings show that EventRL significantly outperforms these conventional approaches by improving the performance in identifying and structuring events, particularly in handling novel event types. The study emphasizes the critical role of reward function selection and demonstrates the benefits of incorporating code data for better event extraction. While increasing model size leads to higher accuracy, maintaining the ability to generalize is essential to avoid overfitting.</p> </description>
<link>https://papers.cool/arxiv/2402.11430</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2402.11430</guid>
<pubDate>Sun, 18 Feb 2024 02:41:06 GMT</pubDate>
<author>Jun Gao</author>
</item>
<item>
<title>SECOMP: Formally Secure Compilation of Compartmentalized C Programs</title>
<description><a href="https://papers.cool/arxiv/2401.16277">[Site]</a> <a href="https://papers.cool/Detection/2401.16277">[Kimi]</a> <p><b>Authors:</b> Jérémy Thibault</p> <p>Undefined behavior in C often causes devastating security vulnerabilities. One practical mitigation is compartmentalization, which allows developers to structure large programs into mutually distrustful compartments with clearly specified privileges and interactions. In this paper we introduce SECOMP, a compiler for compartmentalized C code that comes with machine-checked proofs guaranteeing that the scope of undefined behavior is restricted to the compartments that encounter it and become dynamically compromised. These guarantees are formalized as the preservation of safety properties against adversarial contexts, a secure compilation criterion similar to full abstraction, and this is the first time such a strong criterion is proven for a mainstream programming language. To achieve this we extend the languages of the CompCert verified C compiler with isolated compartments that can only interact via procedure calls and returns, as specified by cross-compartment interfaces. We adapt the passes and optimizations of CompCert as well as their correctness proofs to this compartment-aware setting. We then use compiler correctness as an ingredient in a larger secure compilation proof that involves several proof engineering novelties, needed to scale formally secure compilation up to a C compiler.</p> </description>
<link>https://papers.cool/arxiv/2401.16277</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2401.16277</guid>
<pubDate>Mon, 29 Jan 2024 16:32:36 GMT</pubDate>
<author>Jérémy Thibault</author>
</item>
<item>
<title>Taming numerical imprecision by adapting the KL divergence to negative probabilities</title>
<description><a href="https://papers.cool/arxiv/2312.13021">[Site]</a> <a href="https://papers.cool/Detection/2312.13021">[Kimi]</a> <p><b>Authors:</b> Simon Pfahler</p> <p>The Kullback-Leibler (KL) divergence is frequently used in data science. For discrete distributions on large state spaces, approximations of probability vectors may result in a few small negative entries, rendering the KL divergence undefined. We address this problem by introducing a parameterized family of substitute divergence measures, the shifted KL (sKL) divergence measures. Our approach is generic and does not increase the computational overhead. We show that the sKL divergence shares important theoretical properties with the KL divergence and discuss how its shift parameters should be chosen. If Gaussian noise is added to a probability vector, we prove that the average sKL divergence converges to the KL divergence for small enough noise. We also show that our method solves the problem of negative entries in an application from computational oncology, the optimization of Mutual Hazard Networks for cancer progression using tensor-train approximations.</p> </description>
<link>https://papers.cool/arxiv/2312.13021</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.13021</guid>
<pubDate>Wed, 20 Dec 2023 13:42:00 GMT</pubDate>
<author>Simon Pfahler</author>
</item>
<item>
<title>Performance rating in chess, tennis, and other contexts</title>
<description><a href="https://papers.cool/arxiv/2312.12700">[Site]</a> <a href="https://papers.cool/Detection/2312.12700">[Kimi]</a> <p><b>Authors:</b> Mehmet S. Ismail</p> <p>In this note, I introduce Estimated Performance Rating (PR$^e$), a novel system for evaluating player performance in sports and games. PR$^e$ addresses a key limitation of the Tournament Performance Rating (TPR) system, which is undefined for zero or perfect scores in a series of games. PR$^e$ is defined as the rating that solves an optimization problem related to scoring probability, making it applicable for any performance level. The main theorem establishes that the PR$^e$ of a player is equivalent to the TPR whenever the latter is defined. I then apply this system to historically significant win-streaks in association football, tennis, and chess. Beyond sports, PR$^e$ has broad applicability in domains where Elo ratings are used, from college rankings to the evaluation of large language models.</p> </description>
<link>https://papers.cool/arxiv/2312.12700</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.12700</guid>
<pubDate>Wed, 20 Dec 2023 01:47:55 GMT</pubDate>
<author>Mehmet S. Ismail</author>
</item>
<item>
<title>Memory Simulations, Security and Optimization in a Verified Compiler</title>
<description><a href="https://papers.cool/arxiv/2312.08117">[Site]</a> <a href="https://papers.cool/Detection/2312.08117">[Kimi]</a> <p><b>Authors:</b> VERIMAG - IMAG David Monniaux</p> <p>Current compilers implement security features and optimizations that require nontrivial semantic reasoning about pointers and memory allocation: the program after the insertion of the security feature, or after applying the optimization, must simulate the original program despite a different memory layout. In this article, we illustrate such reasoning on pointer allocations through memory extensions and injections, as well as fine points on undefined values, by explaining how we implemented and proved correct two security features (stack canaries and pointer authentication) and one optimization (tail recursion elimination) in the CompCert formally verified compiler.</p> </description>
<link>https://papers.cool/arxiv/2312.08117</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.08117</guid>
<pubDate>Wed, 13 Dec 2023 13:11:05 GMT</pubDate>
<author>VERIMAG - IMAG David Monniaux</author>
</item>
<item>
<title>Coherent control of two Jaynes-Cummings cavities</title>
<description><a href="https://papers.cool/arxiv/2312.06984">[Site]</a> <a href="https://papers.cool/Detection/2312.06984">[Kimi]</a> <p><b>Authors:</b> L. O. Castaños-Cervantes</p> <p>In this work, we uncover new features on the study of a two-level atom interacting with one of two cavities in a coherent superposition. The James-Cummings model is used to describe the atom-field interaction and to study the effects of quantum indefiniteness on such an interaction. We show that coherent control of the two cavities in an undefined manner allows novel possibilities to manipulate the atomic dynamics on demand which are not achievable in the conventional way. In addition, it is shown that the coherent control of the atom creates highly entangled states of the cavity fields taking a Bell-like or Schrödinger-cat-like state form. Our results are a step forward to understand and harness quantum systems in a coherent control, and open a new research avenue in the study of atom-field interaction exploiting quantum indefiniteness.</p> </description>
<link>https://papers.cool/arxiv/2312.06984</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.06984</guid>
<pubDate>Tue, 12 Dec 2023 05:03:13 GMT</pubDate>
<author>L. O. Castaños-Cervantes</author>
</item>
<item>
<title>Personality of AI</title>
<description><a href="https://papers.cool/arxiv/2312.02998">[Site]</a> <a href="https://papers.cool/Detection/2312.02998">[Kimi]</a> <p><b>Authors:</b> Byunggu Yu</p> <p>This research paper delves into the evolving landscape of fine-tuning large language models (LLMs) to align with human users, extending beyond basic alignment to propose "personality alignment" for language models in organizational settings. Acknowledging the impact of training methods on the formation of undefined personality traits in AI models, the study draws parallels with human fitting processes using personality tests. Through an original case study, we demonstrate the necessity of personality fine-tuning for AIs and raise intriguing questions about applying human-designed tests to AIs, engineering specialized AI personality tests, and shaping AI personalities to suit organizational roles. The paper serves as a starting point for discussions and developments in the burgeoning field of AI personality alignment, offering a foundational anchor for future exploration in human-machine teaming and co-existence.</p> </description>
<link>https://papers.cool/arxiv/2312.02998</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.02998</guid>
<pubDate>Sun, 03 Dec 2023 18:23:45 GMT</pubDate>
<author>Byunggu Yu</author>
</item>
<item>
<title>3vLTL: A Tool to Generate Automata for Three-valued LTL</title>
<description><a href="https://papers.cool/arxiv/2311.09787">[Site]</a> <a href="https://papers.cool/Detection/2311.09787">[Kimi]</a> <p><b>Authors:</b> Imperial College London Francesco Belardinelli</p> <p>Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multi-valued specification languages. We present 3vLTL, a tool to generate Buchi automata from formulas in Linear-time Temporal Logic (LTL) interpreted on a three-valued semantics. Given an LTL formula, a set of atomic propositions as the alphabet for the automaton, and a truth value, our procedure generates a Buchi automaton that accepts all the words that assign the chosen truth value to the LTL formula. Given the particular type of the output of the tool, it can also be seamlessly processed by third-party libraries in a natural way. That is, the Buchi automaton can then be used in the context of formal verification to check whether an LTL formula is true, false, or undefined on a given model.</p> </description>
<link>https://papers.cool/arxiv/2311.09787</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2311.09787</guid>
<pubDate>Thu, 16 Nov 2023 11:04:38 GMT</pubDate>
<author>Imperial College London Francesco Belardinelli</author>
</item>
<item>
<title>One-Way Communication Complexity of Partial XOR Functions</title>
<description><a href="https://papers.cool/arxiv/2310.20606">[Site]</a> <a href="https://papers.cool/Detection/2310.20606">[Kimi]</a> <p><b>Authors:</b> Vladimir V. Podolskii</p> <p>Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y)=f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known that deterministic communication complexity of $F$ is closely related to parity decision tree complexity of $f$. Montanaro and Osbourne (2009) observed that one-sided communication complexity $D_{cc}^{\rightarrow}(F)$ of $F$ is exactly equal to nonadaptive parity decision tree complexity $NADT^{\oplus}(f)$ of $f$. Hatami et al. (2018) showed that unrestricted communication complexity of $F$ is polynomially related to parity decision tree complexity of $f$. We initiate the studies of a similar connection for partial functions. We show that in case of one-sided communication complexity whether these measures are equal, depends on the number of undefined inputs of $f$. On the one hand, if $D_{cc}^{\rightarrow}(F)=t$ and $f$ is undefined on at most $O(\frac{2^{n-t}}{\sqrt{n-t}})$, then $NADT^{\oplus}(f)=t$. On the other hand, for a wide range of values of $D_{cc}^{\rightarrow}(F)$ and $NADT^{\oplus}(f)$ (from constant to $n-2$) we provide partial functions for which $D_{cc}^{\rightarrow}(F) &lt; NADT^{\oplus}(f)$. In particular, we provide a function with an exponential gap between the two measures. Our separation results translate to the case of two-sided communication complexity as well, in particular showing that the result of Hatami et al. (2018) cannot be generalized to partial functions. Previous results for total functions heavily rely on Boolean Fourier analysis and the technique does not translate to partial functions. For the proofs of our results we build a linear algebraic framework instead. Separation results are proved through the reduction to covering codes.</p> </description>
<link>https://papers.cool/arxiv/2310.20606</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.20606</guid>
<pubDate>Tue, 31 Oct 2023 16:42:10 GMT</pubDate>
<author>Vladimir V. Podolskii</author>
</item>
<item>
<title>Heavy-light $N+1$ clusters of two-dimensional fermions</title>
<description><a href="https://papers.cool/arxiv/2310.11330">[Site]</a> <a href="https://papers.cool/Detection/2310.11330">[Kimi]</a> <p><b>Authors:</b> J. Givois</p> <p>We study binding of $N$ identical heavy fermions by a light atom in two dimensions assuming zero-range attractive heavy-light interactions. By using the mean-field theory valid for large $N$ we show that the $N+1$ cluster is bound when the mass ratio exceeds $1.074N^2$. The mean-field theory, being scale invariant in two dimensions, predicts only the shapes of the clusters leaving their sizes and energies undefined. By taking into account beyond-mean-field effects we find closed-form expressions for these quantities. We also discuss differences between the Thomas-Fermi and Hartree-Fock approaches for treating the heavy fermions.</p> </description>
<link>https://papers.cool/arxiv/2310.11330</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.11330</guid>
<pubDate>Tue, 17 Oct 2023 15:08:23 GMT</pubDate>
<author>J. Givois</author>
</item>
<item>
<title>On Two- and Three-valued Semantics for Impure Simplicial Complexes</title>
<description><a href="https://papers.cool/arxiv/2310.00989">[Site]</a> <a href="https://papers.cool/Detection/2310.00989">[Kimi]</a> <p><b>Authors:</b> Hans van Ditmarsch</p> <p>Simplicial complexes are a convenient semantic primitive to reason about processes (agents) communicating with each other in synchronous and asynchronous computation. Impure simplicial complexes distinguish active processes from crashed ones, in other words, agents that are alive from agents that are dead. In order to rule out that dead agents reason about themselves and about other agents, three-valued epistemic semantics have been proposed where, in addition to the usual values true and false, the third value stands for undefined: the knowledge of dead agents is undefined and so are the propositional variables describing their local state. Other semantics for impure complexes are two-valued where a dead agent knows everything. Different choices in designing a semantics produce different three-valued semantics, and also different two-valued semantics. In this work, we categorize the available choices by discounting the bad ones, identifying the equivalent ones, and connecting the non-equivalent ones via a translation. The main result of the paper is identifying the main relevant distinction to be the number of truth values and bridging this difference by means of a novel embedding from three- into two-valued semantics. This translation also enables us to highlight quite fundamental modeling differences underpinning various two- and three-valued approaches in this area of combinatorial topology. In particular, pure complexes can be defined as those invariant under the translation.</p> </description>
<link>https://papers.cool/arxiv/2310.00989</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.00989</guid>
<pubDate>Mon, 02 Oct 2023 08:56:26 GMT</pubDate>
<author>Hans van Ditmarsch</author>
</item>
<item>
<title>Innovative Digital Storytelling with AIGC: Exploration and Discussion of Recent Advances</title>
<description><a href="https://papers.cool/arxiv/2309.14329">[Site]</a> <a href="https://papers.cool/Detection/2309.14329">[Kimi]</a> <p><b>Authors:</b> Rongzhang Gu</p> <p>Digital storytelling, as an art form, has struggled with cost-quality balance. The emergence of AI-generated Content (AIGC) is considered as a potential solution for efficient digital storytelling production. However, the specific form, effects, and impacts of this fusion remain unclear, leaving the boundaries of AIGC combined with storytelling undefined. This work explores the current integration state of AIGC and digital storytelling, investigates the artistic value of their fusion in a sample project, and addresses common issues through interviews. Through our study, we conclude that AIGC, while proficient in image creation, voiceover production, and music composition, falls short of replacing humans due to the irreplaceable elements of human creativity and aesthetic sensibilities at present, especially in complex character animations, facial expressions, and sound effects. The research objective is to increase public awareness of the current state, limitations, and challenges arising from combining AIGC and digital storytelling.</p> </description>
<link>https://papers.cool/arxiv/2309.14329</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2309.14329</guid>
<pubDate>Mon, 25 Sep 2023 17:54:29 GMT</pubDate>
<author>Rongzhang Gu</author>
</item>
<item>
<title>Polarization Jumps across Topological Phase Transitions in Two-dimensional Systems</title>
<description><a href="https://papers.cool/arxiv/2304.12742">[Site]</a> <a href="https://papers.cool/Detection/2304.12742">[Kimi]</a> <p><b>Authors:</b> Hiroki Yoshida</p> <p>In topological phase transitions involving a change in topological invariants such as the Chern number and the $\mathbb{Z}_2$ topological invariant, the gap closes, and the electric polarization becomes undefined at the transition. In this paper, we show that the jump of polarization across such topological phase transitions in two dimensions is described in terms of positions and monopole charges of Weyl points in the intermediate Weyl semimetal phase. We find that the jump of polarization is described by the Weyl dipole at $\mathbb{Z}_2$ topological phase transitions and at phase transitions without any change in the value of the Chern number. Meanwhile, when the Chern number changes at the phase transition, the jump is expressed in terms of the relative positions of Weyl points measured from a reference point in the reciprocal space.</p> </description>
<link>https://papers.cool/arxiv/2304.12742</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2304.12742</guid>
<pubDate>Tue, 25 Apr 2023 11:36:08 GMT</pubDate>
<author>Hiroki Yoshida</author>
</item>
<item>
<title>MINER: A Hybrid Data-Driven Approach for REST API Fuzzing</title>
<description><a href="https://papers.cool/arxiv/2303.02545">[Site]</a> <a href="https://papers.cool/Detection/2303.02545">[Kimi]</a> <p><b>Authors:</b> Chenyang Lyu</p> <p>In recent years, REST API fuzzing has emerged to explore errors on a cloud service. Its performance highly depends on the sequence construction and request generation. However, existing REST API fuzzers have trouble generating long sequences with well-constructed requests to trigger hard-to-reach states in a cloud service, which limits their performance of finding deep errors and security bugs. Further, they cannot find the specific errors caused by using undefined parameters during request generation. Therefore, in this paper, we propose a novel hybrid data-driven solution, named MINER, with three new designs working together to address the above limitations. First, MINER collects the valid sequences whose requests pass the cloud service's checking as the templates, and assigns more executions to long sequence templates. Second, to improve the generation quality of requests in a sequence template, MINER creatively leverages the state-of-the-art neural network model to predict key request parameters and provide them with appropriate parameter values. Third, MINER implements a new data-driven security rule checker to capture the new kind of errors caused by undefined parameters. We evaluate MINER against the state-of-the-art fuzzer RESTler on GitLab, Bugzilla, and WordPress via 11 REST APIs. The results demonstrate that the average pass rate of MINER is 23.42% higher than RESTler. MINER finds 97.54% more unique errors than RESTler on average and 142.86% more reproducible errors after manual analysis. We have reported all the newly found errors, and 7 of them have been confirmed as logic bugs by the corresponding vendors.</p> </description>
<link>https://papers.cool/arxiv/2303.02545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.02545</guid>
<pubDate>Sun, 05 Mar 2023 01:41:41 GMT</pubDate>
<author>Chenyang Lyu</author>
</item>
<item>
<title>The variance-gamma ratio distribution</title>
<description><a href="https://papers.cool/arxiv/2302.12581">[Site]</a> <a href="https://papers.cool/Detection/2302.12581">[Kimi]</a> <p><b>Authors:</b> Robert E. Gaunt</p> <p>Let $X$ and $Y$ be independent variance-gamma random variables with zero location parameter; then the exact probability density function of the ratio $X/Y$ is derived. Some basic distributional properties are also derived, including identification of parameter regimes under which the density is bounded, asymptotic approximations of tail probabilities, and fractional moments; in particular, we see that the mean is undefined. In the case that $X$ and $Y$ are independent symmetric variance-gamma random variables, an exact formula is also given for the cumulative distribution function of the ratio $X/Y$.</p> </description>
<link>https://papers.cool/arxiv/2302.12581</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2302.12581</guid>
<pubDate>Fri, 24 Feb 2023 11:40:20 GMT</pubDate>
<author>Robert E. Gaunt</author>
</item>
<item>
<title>Generalized PTR: User-Friendly Recipes for Data-Adaptive Algorithms with Differential Privacy</title>
<description><a href="https://papers.cool/arxiv/2301.00301">[Site]</a> <a href="https://papers.cool/Detection/2301.00301">[Kimi]</a> <p><b>Authors:</b> Rachel Redberg</p> <p>The ''Propose-Test-Release'' (PTR) framework is a classic recipe for designing differentially private (DP) algorithms that are data-adaptive, i.e. those that add less noise when the input dataset is nice. We extend PTR to a more general setting by privately testing data-dependent privacy losses rather than local sensitivity, hence making it applicable beyond the standard noise-adding mechanisms, e.g. to queries with unbounded or undefined sensitivity. We demonstrate the versatility of generalized PTR using private linear regression as a case study. Additionally, we apply our algorithm to solve an open problem from ''Private Aggregation of Teacher Ensembles (PATE)'' -- privately releasing the entire model with a delicate data-dependent analysis.</p> </description>
<link>https://papers.cool/arxiv/2301.00301</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2301.00301</guid>
<pubDate>Sat, 31 Dec 2022 22:22:53 GMT</pubDate>
<author>Rachel Redberg</author>
</item>
<item>
<title>Modular Formal Verification of Rust Programs with Unsafe Blocks</title>
<description><a href="https://papers.cool/arxiv/2212.12976">[Site]</a> <a href="https://papers.cool/Detection/2212.12976">[Kimi]</a> <p><b>Authors:</b> Nima Rahimi Foroushaani</p> <p>Rust is a modern systems programming language whose type system guarantees memory safety. For the sake of expressivity and performance it allows programmers to relax typing rules temporarily, using unsafe code blocks. However, in unsafe blocks, the burden of making sure that the code does not end up having undefined behaviour is on the programmer. Even most expert programmers make mistakes and a memory safety bug in an unsafe block renders all the type system guarantees void. To address this problem we are trying to verify soundness of Rust unsafe code applying our Modular Symbolic Execution algorithm. This text outlines our approach and the progress that has been made so far.</p> </description>
<link>https://papers.cool/arxiv/2212.12976</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.12976</guid>
<pubDate>Mon, 26 Dec 2022 00:19:19 GMT</pubDate>
<author>Nima Rahimi Foroushaani</author>
</item>
<item>
<title>@C -- augmented version of C programming language</title>
<description><a href="https://papers.cool/arxiv/2212.11245">[Site]</a> <a href="https://papers.cool/Detection/2212.11245">[Kimi]</a> <p><b>Authors:</b> Iosif Iulian Petrila</p> <p>The augmented version of C programming language is presented. The language was completed with a series of low-level and high-level facilities to enlarge the language usage spectrum to various computing systems, operations, users. The ambiguities and inconsistencies have been resolved by managing problematic and undefined languages elements through an interpretation and management similar to that used in the case of other C syntax based languages. The proposed augmentative completeness elements, through @C approach, preserve the spirit of C language and its basic characteristics through compatibility with the standard version but also allow rejuvenation and bring C language to the present programming languages state of the art.</p> </description>
<link>https://papers.cool/arxiv/2212.11245</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.11245</guid>
<pubDate>Mon, 19 Dec 2022 07:53:14 GMT</pubDate>
<author>Iosif Iulian Petrila</author>
</item>
<item>
<title>Hunt for 3-Schur polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.14956">[Site]</a> <a href="https://papers.cool/Detection/2211.14956">[Kimi]</a> <p><b>Authors:</b> A. Morozov</p> <p>This paper describes our attempt to understand the recent success of Na Wang in constructing the 3-Schur polynomials, associated with the plane partitions. We provide a rather detailed review and try to figure out the new insights, which allowed to overcome the problems of the previous efforts. In result we provide a very simple definition of time-variables ${\bf P}_{i\geqslant j}$ and the cut-and-join operator $\hat W_2$, which generates the set of $3$-Schur functions. Some coefficients in $\hat W_2$ remain undefined and require more effort to be fixed.</p> </description>
<link>https://papers.cool/arxiv/2211.14956</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.14956</guid>
<pubDate>Sun, 27 Nov 2022 22:28:20 GMT</pubDate>
<author>A. Morozov</author>
</item>
<item>
<title>Impure Simplicial Complexes: Complete Axiomatization</title>
<description><a href="https://papers.cool/arxiv/2211.13543">[Site]</a> <a href="https://papers.cool/Detection/2211.13543">[Kimi]</a> <p><b>Authors:</b> Rojo Randrianomentsoa</p> <p>Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment. Pure simplicial complexes describe message passing in asynchronous systems where all processes (agents) are alive, whereas impure simplicial complexes describe message passing in synchronous systems where processes may be dead (have crashed). Properties of impure simplicial complexes can be described in a three-valued multi-agent epistemic logic where the third value represents formulae that are undefined, e.g., the knowledge and local propositions of dead agents. In this work we present an axiomatization for the logic of the class of impure complexes and show soundness and completeness. The completeness proof involves the novel construction of the canonical simplicial model and requires a careful manipulation of undefined formulae.</p> </description>
<link>https://papers.cool/arxiv/2211.13543</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.13543</guid>
<pubDate>Thu, 24 Nov 2022 11:32:36 GMT</pubDate>
<author>Rojo Randrianomentsoa</author>
</item>
<item>
<title>Some Useful Collective Properties of Bessel, Marcum Q-Functions and Laguerre Polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.12260">[Site]</a> <a href="https://papers.cool/Detection/2211.12260">[Kimi]</a> <p><b>Authors:</b> Hakan Ozturk</p> <p>Special functions have been used widely in many problems of applied sciences. However, there are considerable numbers of problems in which exact solutions could not be achieved because of undefined sums or integrals involving special functions. These handicaps force researchers to seek new properties of special functions. Many problems that could not be solved so far would be solved by means of these efforts. Therefore in this article, we derived some useful properties and interrelations of each others of Bessel functions, Marcum Q-functions and Laguerre polynomials.</p> </description>
<link>https://papers.cool/arxiv/2211.12260</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.12260</guid>
<pubDate>Tue, 22 Nov 2022 13:22:47 GMT</pubDate>
<author>Hakan Ozturk</author>
</item>
<item>
<title>Francois Viete and his contribution to mathematics</title>
<description><a href="https://papers.cool/arxiv/2210.12545">[Site]</a> <a href="https://papers.cool/Detection/2210.12545">[Kimi]</a> <p><b>Authors:</b> Athanasios Paraskevopoulos</p> <p>This paper studies the work of the French mathematician Francois Viete, known as the "father of modern algebraic notation". Along with this fundamental change in algebra, Viete adopted a radically new notation based on Greek geometric equalities. Its letters represent values rather than types, and its given values are undefined. Where algebra had previously relied on polynomials as sets, Viete became the first modern algebraist to work with polynomials generated by operations, and the notations reflect these notions. His work was essential to his successors because it enabled those mathematicians who followed him to develop the mathematics we use today.</p> </description>
<link>https://papers.cool/arxiv/2210.12545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.12545</guid>
<pubDate>Sat, 22 Oct 2022 20:40:50 GMT</pubDate>
<author>Athanasios Paraskevopoulos</author>
</item>
<item>
<title>An Active Learning Reliability Method for Systems with Partially Defined Performance Functions</title>
<description><a href="https://papers.cool/arxiv/2210.02168">[Site]</a> <a href="https://papers.cool/Detection/2210.02168">[Kimi]</a> <p><b>Authors:</b> Jonathan Sadeghi</p> <p>In engineering design, one often wishes to calculate the probability that the performance of a system is satisfactory under uncertainty. State of the art algorithms exist to solve this problem using active learning with Gaussian process models. However, these algorithms cannot be applied to problems which often occur in the autonomous vehicle domain where the performance of a system may be undefined under certain circumstances. To solve this problem, we introduce a hierarchical model for the system performance, where undefined performance is classified before the performance is regressed. This enables active learning Gaussian process methods to be applied to problems where the performance of the system is sometimes undefined, and we demonstrate the effectiveness of our approach by testing our methodology on synthetic numerical examples for the autonomous driving domain.</p> </description>
<link>https://papers.cool/arxiv/2210.02168</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.02168</guid>
<pubDate>Wed, 05 Oct 2022 11:50:36 GMT</pubDate>
<author>Jonathan Sadeghi</author>
</item>
<item>
<title>Schroedinger cats and quantum complementarity</title>
<description><a href="https://papers.cool/arxiv/2210.01083">[Site]</a> <a href="https://papers.cool/Detection/2210.01083">[Kimi]</a> <p><b>Authors:</b> Lorenzo Maccone</p> <p>Complementarity tells us we cannot know precisely the values of all the properties of a quantum object at the same time: the precise determination of one property implies that the value of some other (complementary) property is undefined. E.g.the precise knowledge of the position of a particle implies that its momentum is undefined. Here we show that a Schroedinger cat has a well defined value of a property that is complementary to its ``being dead or alive'' property. Then, thanks to complementarity, it has an undefined value of the property ``being dead or alive''. In other words, the cat paradox is explained through quantum complementarity: of its many complementary properties, any quantum system, such as a cat, can have a well defined value only of one at a time. Schroedinger's cat has a definite value of a property which is complementary to ``being dead or alive'', so it is neither dead nor alive. Figuratively one can say it is both dead and alive. While this interpretation only uses textbook concepts (the Copenhagen interpretation), apparently it has never explicitly appeared in the literature. We detail how to build an Arduino based simulation of Schroedinger's experiment based on these concepts for science outreach events.</p> </description>
<link>https://papers.cool/arxiv/2210.01083</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.01083</guid>
<pubDate>Mon, 03 Oct 2022 17:00:42 GMT</pubDate>
<author>Lorenzo Maccone</author>
</item>
<item>
<title>Defining a credible interval is not always possible with "point-null'' priors: A lesser-known correlate of the Jeffreys-Lindley paradox</title>
<description><a href="https://papers.cool/arxiv/2210.00029">[Site]</a> <a href="https://papers.cool/Detection/2210.00029">[Kimi]</a> <p><b>Authors:</b> Harlan Campbell</p> <p>In many common situations, a Bayesian credible interval will be, given the same data, very similar to a frequentist confidence interval, and researchers will interpret these intervals in a similar fashion. However, no predictable similarity exists when credible intervals are based on model-averaged posteriors whenever one of the two nested models under consideration is a so called ''point-null''. Not only can this model-averaged credible interval be quite different than the frequentist confidence interval, in some cases it may be undefined. This is a lesser-known correlate of the Jeffreys-Lindley paradox and is of particular interest given the popularity of the Bayes factor for testing point-null hypotheses.</p> </description>
<link>https://papers.cool/arxiv/2210.00029</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.00029</guid>
<pubDate>Fri, 30 Sep 2022 18:08:56 GMT</pubDate>
<author>Harlan Campbell</author>
</item>
<item>
<title>Topologically protected four-dimensional optical singularities</title>
<description><a href="https://papers.cool/arxiv/2208.09054">[Site]</a> <a href="https://papers.cool/Detection/2208.09054">[Kimi]</a> <p><b>Authors:</b> Christina M. Spaegele</p> <p>Optical singularities play a major role in modern optics and are frequently deployed in structured light, super-resolution microscopy, and holography. While phase singularities are uniquely defined as locations of undefined phase, polarization singularities studied thus far are either partial, i.e., bright points of well-defined polarization, or unstable for small field perturbations. We demonstrate for the first time a complete, topologically protected polarization singularity; it is located in the 4D space spanned by the three spatial dimensions and the wavelength and is created in the focus of a cascaded metasurface-lens system. The field Jacobian plays a key role in the design of such higher-dimensional singularities, which can be extended to multidimensional wave phenomena, and pave the way to novel applications in topological photonics and precision sensing.</p> </description>
<link>https://papers.cool/arxiv/2208.09054</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2208.09054</guid>
<pubDate>Thu, 18 Aug 2022 20:45:31 GMT</pubDate>
<author>Christina M. Spaegele</author>
</item>
<item>
<title>The "SPectrogram Analysis and Cataloguing Environment" (SPACE) Labelling Tool</title>
<description><a href="https://papers.cool/arxiv/2207.12454">[Site]</a> <a href="https://papers.cool/Detection/2207.12454">[Kimi]</a> <p><b>Authors:</b> C. K. Louis</p> <p>The SPectrogram Analysis and Cataloguing Environment (SPACE) tool is an interactive python tool designed to label radio emission features of interest in a time-frequency map (called 'dynamic spectrum'). The program uses Matplotlib's Polygon Selector widget to allow a user to select and edit an undefined number of vertices on top of the dynamic spectrum before closing the shape (polygon). Multiple polygons may be drawn on any spectrum, and the feature name along with the coordinates for each polygon vertex are saved into a '.json' file as per the 'Time-Frequency Catalogue' (TFCat) format along with other data such as the feature id, observer name, and data units. This paper describes the first official stable release (version 2.0) of the tool.</p> </description>
<link>https://papers.cool/arxiv/2207.12454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2207.12454</guid>
<pubDate>Mon, 25 Jul 2022 18:18:40 GMT</pubDate>
<author>C. K. Louis</author>
</item>
<item>
<title>Simulating long-range coherence of atoms and photons in quantum computers</title>
<description><a href="https://papers.cool/arxiv/2206.08386">[Site]</a> <a href="https://papers.cool/Detection/2206.08386">[Kimi]</a> <p><b>Authors:</b> Emanuele G. Dalla Torre</p> <p>Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.</p> </description>
<link>https://papers.cool/arxiv/2206.08386</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2206.08386</guid>
<pubDate>Thu, 16 Jun 2022 18:00:03 GMT</pubDate>
<author>Emanuele G. Dalla Torre</author>
</item>
<item>
<title>Bosonic fields in states with undefined particle numbers possess detectable non-contextuality features, plus more</title>
<description><a href="https://papers.cool/arxiv/2205.09440">[Site]</a> <a href="https://papers.cool/Detection/2205.09440">[Kimi]</a> <p><b>Authors:</b> Konrad Schlichtholz</p> <p>Most of the paradoxical, for the classical intuition, features of quantum theory were formulated for situations which involve a fixed number of particles. While one can now find a formulation of Bell's theorem for quantum fields, a Kochen-Specker-type reasoning is usually formulated for just one particle, or like in the case of Peres-Mermin square for two. A question emerges. Is it possible to formulate a contextuality proof for situation in which the numbers of particles are fundamentally undefined? We address this problem for bosonic fields. We introduce a representation of the $\mathfrak{su}(2)$ algebra in terms of boson number states in two modes that allows us to assess nonclassicality of states of bosonic fields. As a figure of merit of a nonclassical behaviour we analyze first of all contextuality, and we show that the introduced observables are handy and efficient to reveal violation of local realism, and to formulate entanglement indicators. We construct a method which extends the Kochen-Specker contextuality to bosonic quantum fields. A form of an inequality is derived using a suitable version of the Peres-Mermin square. The entanglement indicators use a witness built with specially defined Pauli-like observables. Finally, Bell-nonclassicality is discussed: an inequality that involves the expectation values of pairs of the Pauli-like operators is presented. The introduced indicators are shown to be effective, e.g. they reveal nonclassicality in situaations involving undefined boson numbers. This is shown via quantum optical examples of the $2\times 2$ bright squeezed vacuum state, and a recently discussed bright-GHZ state resulting from multiple three photon emissions in a parametric process.</p> </description>
<link>https://papers.cool/arxiv/2205.09440</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2205.09440</guid>
<pubDate>Thu, 19 May 2022 09:56:08 GMT</pubDate>
<author>Konrad Schlichtholz</author>
</item>
<item>
<title>Textual Stylistic Variation: Choices, Genres and Individuals</title>
<description><a href="https://papers.cool/arxiv/2205.00510">[Site]</a> <a href="https://papers.cool/Detection/2205.00510">[Kimi]</a> <p><b>Authors:</b> Jussi Karlgren</p> <p>This chapter argues for more informed target metrics for the statistical processing of stylistic variation in text collections. Much as operationalised relevance proved a useful goal to strive for in information retrieval, research in textual stylistics, whether application oriented or philologically inclined, needs goals formulated in terms of pertinence, relevance, and utility - notions that agree with reader experience of text. Differences readers are aware of are mostly based on utility - not on textual characteristics per se. Mostly, readers report stylistic differences in terms of genres. Genres, while vague and undefined, are well-established and talked a |
|
Successfully generated as following: http://localhost:1200/papers/query/Detection - Success ✔️<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
<channel>
<title>undefined</title>
<link>https://papers.cool/arxiv/search?highlight=1&query=undefined&sort=0</link>
<atom:link href="http://localhost:1200/papers/query/Detection" rel="self" type="application/rss+xml"></atom:link>
<description>undefined - Powered by RSSHub</description>
<generator>RSSHub</generator>
<webMaster>[email protected] (RSSHub)</webMaster>
<language>en</language>
<lastBuildDate>Wed, 18 Dec 2024 16:18:11 GMT</lastBuildDate>
<ttl>5</ttl>
<item>
<title>Estimating Spillover Effects in the Presence of Isolated Nodes</title>
<description><a href="https://papers.cool/arxiv/2412.05919">[Site]</a> <a href="https://papers.cool/Detection/2412.05919">[Kimi]</a> <p><b>Authors:</b> Bora Kim</p> <p>In estimating spillover effects under network interference, practitioners often use linear regression with either the number or fraction of treated neighbors as regressors. An often overlooked fact is that the latter is undefined for units without neighbors (``isolated nodes"). The common practice is to impute this fraction as zero for isolated nodes. This paper shows that such practice introduces bias through theoretical derivations and simulations. Causal interpretations of the commonly used spillover regression coefficients are also provided.</p> </description>
<link>https://papers.cool/arxiv/2412.05919</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2412.05919</guid>
<pubDate>Sun, 08 Dec 2024 12:28:54 GMT</pubDate>
<author>Bora Kim</author>
</item>
<item>
<title>Surveying the Rust Verification Landscape</title>
<description><a href="https://papers.cool/arxiv/2410.01981">[Site]</a> <a href="https://papers.cool/Detection/2410.01981">[Kimi]</a> <p><b>Authors:</b> Alex Le Blanc</p> <p>Rust aims to be a safe programming language applicable to systems programming applications. In particular, its type system has strong guardrails to prevent a variety of issues, such as memory safety bugs and data races. However, these guardrails can be sidestepped via the unsafe keyword. unsafe allows certain otherwise-prohibited operations, but shifts the onus of preventing undefined behaviour from the Rust language's compile-time checks to the developer. We believe that tools have a role to play in ensuring the absence of undefined behaviour in the presence of unsafe code. Moreover, safety aside, programs would also benefit from being verified for functional correctness, ensuring that they meet their specifications. In this research proposal, we explore what it means to do Rust verification. Specifically, we explore which properties are worth verifying for Rust; what techniques exist to verify them; and which code is worth verifying. In doing so, we motivate an effort to verify safety properties of the Rust standard library, presenting the relevant challenges along with ideas to address them.</p> </description>
<link>https://papers.cool/arxiv/2410.01981</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2410.01981</guid>
<pubDate>Wed, 02 Oct 2024 19:40:18 GMT</pubDate>
<author>Alex Le Blanc</author>
</item>
<item>
<title>Quantum Black Hole as a Harmonic Oscillator from the Perspective of the Minimum Uncertainty Approach</title>
<description><a href="https://papers.cool/arxiv/2409.09181">[Site]</a> <a href="https://papers.cool/Detection/2409.09181">[Kimi]</a> <p><b>Authors:</b> Octavio Obregón</p> <p>Starting from the Wheeler-DeWitt equation for the Schwarzschild black hole interior, which is derived from a Hamiltonian formulated in terms of canonical phase space coordinates, we show that by applying a simple reparametrization, this equation can be expressed as the eigenvalue equation of a quantum linear harmonic oscillator. Within the standard quantization framework, we find that the resulting wave function diverges in the region of the classical singularity, and the expectation value of the Kretschmann scalar is undefined for all states within the black hole. However, when we apply the minimal uncertainty approach to the quantization process, we obtain a wave function that is both well-defined and square-integrable. Additionally, the expectation value of the Kretschmann scalar for these states remains finite throughout the black hole's interior, suggesting that the classical singularity is resolved in this approach, replaced it by a minimum radius.</p> </description>
<link>https://papers.cool/arxiv/2409.09181</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.09181</guid>
<pubDate>Fri, 13 Sep 2024 20:37:43 GMT</pubDate>
<author>Octavio Obregón</author>
</item>
<item>
<title>From annular to toroidal pseudo knots</title>
<description><a href="https://papers.cool/arxiv/2409.03537">[Site]</a> <a href="https://papers.cool/Detection/2409.03537">[Kimi]</a> <p><b>Authors:</b> Ioannis Diamantis</p> <p>In this paper, we extend the theory of planar pseudo knots to the theories of annular and toroidal pseudo knots. Pseudo knots are defined as equivalence classes under Reidemeister-like moves of knot diagrams characterized by crossings with undefined over/under information. In the theories of annular and toroidal pseudo knots we introduce their respective lifts to the solid and the thickened torus. Then, we interlink these theories by representing annular and toroidal pseudo knots as planar ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. We also explore the inclusion relations between planar, annular and toroidal pseudo knots, as well as of ${\rm O}$-mixed and ${\rm H}$-mixed pseudo links. Finally, we extend the planar weighted resolution set to annular and toroidal pseudo knots, defining new invariants for classifying pseudo knots and links in the solid and in the thickened torus.</p> </description>
<link>https://papers.cool/arxiv/2409.03537</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2409.03537</guid>
<pubDate>Thu, 05 Sep 2024 13:53:34 GMT</pubDate>
<author>Ioannis Diamantis</author>
</item>
<item>
<title>BiGS: Bidirectional Gaussian Primitives for Relightable 3D Gaussian Splatting</title>
<description><a href="https://papers.cool/arxiv/2408.13370">[Site]</a> <a href="https://papers.cool/Detection/2408.13370">[Kimi]</a> <p><b>Authors:</b> Zhenyuan Liu</p> <p>We present Bidirectional Gaussian Primitives, an image-based novel view synthesis technique designed to represent and render 3D objects with surface and volumetric materials under dynamic illumination. Our approach integrates light intrinsic decomposition into the Gaussian splatting framework, enabling real-time relighting of 3D objects. To unify surface and volumetric material within a cohesive appearance model, we adopt a light- and view-dependent scattering representation via bidirectional spherical harmonics. Our model does not use a specific surface normal-related reflectance function, making it more compatible with volumetric representations like Gaussian splatting, where the normals are undefined. We demonstrate our method by reconstructing and rendering objects with complex materials. Using One-Light-At-a-Time (OLAT) data as input, we can reproduce photorealistic appearances under novel lighting conditions in real time.</p> </description>
<link>https://papers.cool/arxiv/2408.13370</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2408.13370</guid>
<pubDate>Fri, 23 Aug 2024 21:04:40 GMT</pubDate>
<author>Zhenyuan Liu</author>
</item>
<item>
<title>A Continued Fractions Theory for the completion of the Puiseux field</title>
<description><a href="https://papers.cool/arxiv/2407.05454">[Site]</a> <a href="https://papers.cool/Detection/2407.05454">[Kimi]</a> <p><b>Authors:</b> Luis Arenas-Carmona</p> <p>In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients are polynomials in roots of the variable, and that this approximation is the best ''rational'' Diophantine approximation of such element. Then, we interpret the preceding result in terms of the action of a suitable arithmetic subgroup of the special linear group on the Berkovich space defined over the said completion. We also explore the connections between points of type IV of the Berkovich space in terms of some ''non-convergent'' or ''undefined'' continued fractions, in a sense that we make precise in the text.</p> </description>
<link>https://papers.cool/arxiv/2407.05454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.05454</guid>
<pubDate>Sun, 07 Jul 2024 17:37:38 GMT</pubDate>
<author>Luis Arenas-Carmona</author>
</item>
<item>
<title>A Calculus for Unreachable Code</title>
<description><a href="https://papers.cool/arxiv/2407.04917">[Site]</a> <a href="https://papers.cool/Detection/2407.04917">[Kimi]</a> <p><b>Authors:</b> Peter Zhong</p> <p>In Racket, the LLVM IR, Rust, and other modern languages, programmers and static analyses can hint, with special annotations, that certain parts of a program are unreachable. Same as other assumptions about undefined behavior; the compiler assumes these hints are correct and transforms the program aggressively. While compile-time transformations due to undefined behavior often perplex compiler writers and developers, we show that the essence of transformations due to unreachable code can be distilled in a surprisingly small set of simple formal rules. Specifically, following the well-established tradition of understanding linguistic phenomena through calculi, we introduce the first calculus for unreachable. Its term-rewriting rules that take advantage of unreachable fall into two groups. The first group allows the compiler to delete any code downstream of unreachable, and any effect-free code upstream of unreachable. The second group consists of rules that eliminate conditional expressions when one of their branches is unreachable. We show the correctness of the rules with a novel logical relation, and we examine how they correspond to transformations due to unreachable in Racket and LLVM.</p> </description>
<link>https://papers.cool/arxiv/2407.04917</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2407.04917</guid>
<pubDate>Sat, 06 Jul 2024 01:49:57 GMT</pubDate>
<author>Peter Zhong</author>
</item>
<item>
<title>Jackknife inference with two-way clustering</title>
<description><a href="https://papers.cool/arxiv/2406.08880">[Site]</a> <a href="https://papers.cool/Detection/2406.08880">[Kimi]</a> <p><b>Authors:</b> James G. MacKinnon</p> <p>For linear regression models with cross-section or panel data, it is natural to assume that the disturbances are clustered in two dimensions. However, the finite-sample properties of two-way cluster-robust tests and confidence intervals are often poor. We discuss several ways to improve inference with two-way clustering. Two of these are existing methods for avoiding, or at least ameliorating, the problem of undefined standard errors when a cluster-robust variance matrix estimator (CRVE) is not positive definite. One is a new method that always avoids the problem. More importantly, we propose a family of new two-way CRVEs based on the cluster jackknife. Simulations for models with two-way fixed effects suggest that, in many cases, the cluster-jackknife CRVE combined with our new method yields surprisingly accurate inferences. We provide a simple software package, twowayjack for Stata, that implements our recommended variance estimator.</p> </description>
<link>https://papers.cool/arxiv/2406.08880</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2406.08880</guid>
<pubDate>Thu, 13 Jun 2024 07:31:46 GMT</pubDate>
<author>James G. MacKinnon</author>
</item>
<item>
<title>Defining Requirements Strategies in Agile: A Design Science Research Study</title>
<description><a href="https://papers.cool/arxiv/2405.18847">[Site]</a> <a href="https://papers.cool/Detection/2405.18847">[Kimi]</a> <p><b>Authors:</b> Amna Pir Muhammad</p> <p>Research shows that many of the challenges currently encountered with agile development are related to requirements engineering. Based on design science research, this paper investigates critical challenges that arise in agile development from an undefined requirements strategy. We explore potential ways to address these challenges and synthesize the key building blocks of requirements strategies. Our design science research rests on a multiple case study with three industrial cases in the domains of communication technology, security services, and automotive. We relied on a total of 20 interviews, two workshops, participant observation in two cases, and document analysis in each of the cases to understand concrete challenges and workflows. In each case, we define a requirements strategy in collaboration with process managers and experienced engineers. From this experience, we extract guidelines for defining requirements strategies in agile development.</p> </description>
<link>https://papers.cool/arxiv/2405.18847</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.18847</guid>
<pubDate>Wed, 29 May 2024 07:57:32 GMT</pubDate>
<author>Amna Pir Muhammad</author>
</item>
<item>
<title>Analysis of Broken Randomized Experiments by Principal Stratification</title>
<description><a href="https://papers.cool/arxiv/2405.16780">[Site]</a> <a href="https://papers.cool/Detection/2405.16780">[Kimi]</a> <p><b>Authors:</b> Qinqing Liu</p> <p>Although randomized controlled trials have long been regarded as the ``gold standard'' for evaluating treatment effects, there is no natural prevention from post-treatment events. For example, non-compliance makes the actual treatment different from the assigned treatment, truncation-by-death renders the outcome undefined or ill-defined, and missingness prevents the outcomes from being measured. In this paper, we develop a statistical analysis framework using principal stratification to investigate the treatment effect in broken randomized experiments. The average treatment effect in compliers and always-survivors is adopted as the target causal estimand. We establish the asymptotic property for the estimator. We apply the framework to study the effect of training on earnings in the Job Corps Study and find that the training program does not have an effect on employment but possibly have an effect on improving the earnings after employment.</p> </description>
<link>https://papers.cool/arxiv/2405.16780</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2405.16780</guid>
<pubDate>Mon, 27 May 2024 03:05:29 GMT</pubDate>
<author>Qinqing Liu</author>
</item>
<item>
<title>A Study of Undefined Behavior Across Foreign Function Boundaries in Rust Libraries</title>
<description><a href="https://papers.cool/arxiv/2404.11671">[Site]</a> <a href="https://papers.cool/Detection/2404.11671">[Kimi]</a> <p><b>Authors:</b> Ian McCormack</p> <p>Developers rely on the Rust programming language's static safety guarantees to write secure and performant applications. However, Rust is frequently used to interoperate with other languages which allow design patterns that conflict with Rust's aliasing models. Miri is the only dynamic analysis tool capable of validating applications against these models, but it does not support foreign functions, indicating that there may be a critical correctness gap at the heart of the Rust ecosystem. We conducted a large-scale evaluation of Rust libraries that call foreign functions to determine whether Miri's dynamic analyses remain useful in this context. We used Miri and an LLVM interpreter to jointly execute applications that call foreign functions, where we found 48 instances of undefined or undesired behavior. These include three bugs from libraries that had over 10,000 daily downloads on average during our observation period and one from a library maintained by the Rust Project. Many of the errors we found involved incompatible aliasing patterns, but Rust's latest Tree Borrows aliasing model was significantly more permissive than the earlier Stacked Borrows model. The Rust community must invest in new, production-ready tooling for multi-language applications to ensure that developers can detect these errors.</p> </description>
<link>https://papers.cool/arxiv/2404.11671</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2404.11671</guid>
<pubDate>Wed, 17 Apr 2024 18:12:05 GMT</pubDate>
<author>Ian McCormack</author>
</item>
<item>
<title>EventRL: Enhancing Event Extraction with Outcome Supervision for Large Language Models</title>
<description><a href="https://papers.cool/arxiv/2402.11430">[Site]</a> <a href="https://papers.cool/Detection/2402.11430">[Kimi]</a> <p><b>Authors:</b> Jun Gao</p> <p>In this study, we present EventRL, a reinforcement learning approach developed to enhance event extraction for large language models (LLMs). EventRL utilizes outcome supervision with specific reward functions to tackle prevalent challenges in LLMs, such as instruction following and hallucination, manifested as the mismatch of event structure and the generation of undefined event types. We evaluate EventRL against existing methods like Few-Shot Prompting (FSP) (based on GPT4) and Supervised Fine-Tuning (SFT) across various LLMs, including GPT-4, LLaMa, and CodeLLaMa models. Our findings show that EventRL significantly outperforms these conventional approaches by improving the performance in identifying and structuring events, particularly in handling novel event types. The study emphasizes the critical role of reward function selection and demonstrates the benefits of incorporating code data for better event extraction. While increasing model size leads to higher accuracy, maintaining the ability to generalize is essential to avoid overfitting.</p> </description>
<link>https://papers.cool/arxiv/2402.11430</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2402.11430</guid>
<pubDate>Sun, 18 Feb 2024 02:41:06 GMT</pubDate>
<author>Jun Gao</author>
</item>
<item>
<title>SECOMP: Formally Secure Compilation of Compartmentalized C Programs</title>
<description><a href="https://papers.cool/arxiv/2401.16277">[Site]</a> <a href="https://papers.cool/Detection/2401.16277">[Kimi]</a> <p><b>Authors:</b> Jérémy Thibault</p> <p>Undefined behavior in C often causes devastating security vulnerabilities. One practical mitigation is compartmentalization, which allows developers to structure large programs into mutually distrustful compartments with clearly specified privileges and interactions. In this paper we introduce SECOMP, a compiler for compartmentalized C code that comes with machine-checked proofs guaranteeing that the scope of undefined behavior is restricted to the compartments that encounter it and become dynamically compromised. These guarantees are formalized as the preservation of safety properties against adversarial contexts, a secure compilation criterion similar to full abstraction, and this is the first time such a strong criterion is proven for a mainstream programming language. To achieve this we extend the languages of the CompCert verified C compiler with isolated compartments that can only interact via procedure calls and returns, as specified by cross-compartment interfaces. We adapt the passes and optimizations of CompCert as well as their correctness proofs to this compartment-aware setting. We then use compiler correctness as an ingredient in a larger secure compilation proof that involves several proof engineering novelties, needed to scale formally secure compilation up to a C compiler.</p> </description>
<link>https://papers.cool/arxiv/2401.16277</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2401.16277</guid>
<pubDate>Mon, 29 Jan 2024 16:32:36 GMT</pubDate>
<author>Jérémy Thibault</author>
</item>
<item>
<title>Taming numerical imprecision by adapting the KL divergence to negative probabilities</title>
<description><a href="https://papers.cool/arxiv/2312.13021">[Site]</a> <a href="https://papers.cool/Detection/2312.13021">[Kimi]</a> <p><b>Authors:</b> Simon Pfahler</p> <p>The Kullback-Leibler (KL) divergence is frequently used in data science. For discrete distributions on large state spaces, approximations of probability vectors may result in a few small negative entries, rendering the KL divergence undefined. We address this problem by introducing a parameterized family of substitute divergence measures, the shifted KL (sKL) divergence measures. Our approach is generic and does not increase the computational overhead. We show that the sKL divergence shares important theoretical properties with the KL divergence and discuss how its shift parameters should be chosen. If Gaussian noise is added to a probability vector, we prove that the average sKL divergence converges to the KL divergence for small enough noise. We also show that our method solves the problem of negative entries in an application from computational oncology, the optimization of Mutual Hazard Networks for cancer progression using tensor-train approximations.</p> </description>
<link>https://papers.cool/arxiv/2312.13021</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.13021</guid>
<pubDate>Wed, 20 Dec 2023 13:42:00 GMT</pubDate>
<author>Simon Pfahler</author>
</item>
<item>
<title>Performance rating in chess, tennis, and other contexts</title>
<description><a href="https://papers.cool/arxiv/2312.12700">[Site]</a> <a href="https://papers.cool/Detection/2312.12700">[Kimi]</a> <p><b>Authors:</b> Mehmet S. Ismail</p> <p>In this note, I introduce Estimated Performance Rating (PR$^e$), a novel system for evaluating player performance in sports and games. PR$^e$ addresses a key limitation of the Tournament Performance Rating (TPR) system, which is undefined for zero or perfect scores in a series of games. PR$^e$ is defined as the rating that solves an optimization problem related to scoring probability, making it applicable for any performance level. The main theorem establishes that the PR$^e$ of a player is equivalent to the TPR whenever the latter is defined. I then apply this system to historically significant win-streaks in association football, tennis, and chess. Beyond sports, PR$^e$ has broad applicability in domains where Elo ratings are used, from college rankings to the evaluation of large language models.</p> </description>
<link>https://papers.cool/arxiv/2312.12700</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.12700</guid>
<pubDate>Wed, 20 Dec 2023 01:47:55 GMT</pubDate>
<author>Mehmet S. Ismail</author>
</item>
<item>
<title>Memory Simulations, Security and Optimization in a Verified Compiler</title>
<description><a href="https://papers.cool/arxiv/2312.08117">[Site]</a> <a href="https://papers.cool/Detection/2312.08117">[Kimi]</a> <p><b>Authors:</b> VERIMAG - IMAG David Monniaux</p> <p>Current compilers implement security features and optimizations that require nontrivial semantic reasoning about pointers and memory allocation: the program after the insertion of the security feature, or after applying the optimization, must simulate the original program despite a different memory layout. In this article, we illustrate such reasoning on pointer allocations through memory extensions and injections, as well as fine points on undefined values, by explaining how we implemented and proved correct two security features (stack canaries and pointer authentication) and one optimization (tail recursion elimination) in the CompCert formally verified compiler.</p> </description>
<link>https://papers.cool/arxiv/2312.08117</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.08117</guid>
<pubDate>Wed, 13 Dec 2023 13:11:05 GMT</pubDate>
<author>VERIMAG - IMAG David Monniaux</author>
</item>
<item>
<title>Coherent control of two Jaynes-Cummings cavities</title>
<description><a href="https://papers.cool/arxiv/2312.06984">[Site]</a> <a href="https://papers.cool/Detection/2312.06984">[Kimi]</a> <p><b>Authors:</b> L. O. Castaños-Cervantes</p> <p>In this work, we uncover new features on the study of a two-level atom interacting with one of two cavities in a coherent superposition. The James-Cummings model is used to describe the atom-field interaction and to study the effects of quantum indefiniteness on such an interaction. We show that coherent control of the two cavities in an undefined manner allows novel possibilities to manipulate the atomic dynamics on demand which are not achievable in the conventional way. In addition, it is shown that the coherent control of the atom creates highly entangled states of the cavity fields taking a Bell-like or Schrödinger-cat-like state form. Our results are a step forward to understand and harness quantum systems in a coherent control, and open a new research avenue in the study of atom-field interaction exploiting quantum indefiniteness.</p> </description>
<link>https://papers.cool/arxiv/2312.06984</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.06984</guid>
<pubDate>Tue, 12 Dec 2023 05:03:13 GMT</pubDate>
<author>L. O. Castaños-Cervantes</author>
</item>
<item>
<title>Personality of AI</title>
<description><a href="https://papers.cool/arxiv/2312.02998">[Site]</a> <a href="https://papers.cool/Detection/2312.02998">[Kimi]</a> <p><b>Authors:</b> Byunggu Yu</p> <p>This research paper delves into the evolving landscape of fine-tuning large language models (LLMs) to align with human users, extending beyond basic alignment to propose "personality alignment" for language models in organizational settings. Acknowledging the impact of training methods on the formation of undefined personality traits in AI models, the study draws parallels with human fitting processes using personality tests. Through an original case study, we demonstrate the necessity of personality fine-tuning for AIs and raise intriguing questions about applying human-designed tests to AIs, engineering specialized AI personality tests, and shaping AI personalities to suit organizational roles. The paper serves as a starting point for discussions and developments in the burgeoning field of AI personality alignment, offering a foundational anchor for future exploration in human-machine teaming and co-existence.</p> </description>
<link>https://papers.cool/arxiv/2312.02998</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2312.02998</guid>
<pubDate>Sun, 03 Dec 2023 18:23:45 GMT</pubDate>
<author>Byunggu Yu</author>
</item>
<item>
<title>3vLTL: A Tool to Generate Automata for Three-valued LTL</title>
<description><a href="https://papers.cool/arxiv/2311.09787">[Site]</a> <a href="https://papers.cool/Detection/2311.09787">[Kimi]</a> <p><b>Authors:</b> Imperial College London Francesco Belardinelli</p> <p>Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multi-valued specification languages. We present 3vLTL, a tool to generate Buchi automata from formulas in Linear-time Temporal Logic (LTL) interpreted on a three-valued semantics. Given an LTL formula, a set of atomic propositions as the alphabet for the automaton, and a truth value, our procedure generates a Buchi automaton that accepts all the words that assign the chosen truth value to the LTL formula. Given the particular type of the output of the tool, it can also be seamlessly processed by third-party libraries in a natural way. That is, the Buchi automaton can then be used in the context of formal verification to check whether an LTL formula is true, false, or undefined on a given model.</p> </description>
<link>https://papers.cool/arxiv/2311.09787</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2311.09787</guid>
<pubDate>Thu, 16 Nov 2023 11:04:38 GMT</pubDate>
<author>Imperial College London Francesco Belardinelli</author>
</item>
<item>
<title>One-Way Communication Complexity of Partial XOR Functions</title>
<description><a href="https://papers.cool/arxiv/2310.20606">[Site]</a> <a href="https://papers.cool/Detection/2310.20606">[Kimi]</a> <p><b>Authors:</b> Vladimir V. Podolskii</p> <p>Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y)=f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known that deterministic communication complexity of $F$ is closely related to parity decision tree complexity of $f$. Montanaro and Osbourne (2009) observed that one-sided communication complexity $D_{cc}^{\rightarrow}(F)$ of $F$ is exactly equal to nonadaptive parity decision tree complexity $NADT^{\oplus}(f)$ of $f$. Hatami et al. (2018) showed that unrestricted communication complexity of $F$ is polynomially related to parity decision tree complexity of $f$. We initiate the studies of a similar connection for partial functions. We show that in case of one-sided communication complexity whether these measures are equal, depends on the number of undefined inputs of $f$. On the one hand, if $D_{cc}^{\rightarrow}(F)=t$ and $f$ is undefined on at most $O(\frac{2^{n-t}}{\sqrt{n-t}})$, then $NADT^{\oplus}(f)=t$. On the other hand, for a wide range of values of $D_{cc}^{\rightarrow}(F)$ and $NADT^{\oplus}(f)$ (from constant to $n-2$) we provide partial functions for which $D_{cc}^{\rightarrow}(F) &lt; NADT^{\oplus}(f)$. In particular, we provide a function with an exponential gap between the two measures. Our separation results translate to the case of two-sided communication complexity as well, in particular showing that the result of Hatami et al. (2018) cannot be generalized to partial functions. Previous results for total functions heavily rely on Boolean Fourier analysis and the technique does not translate to partial functions. For the proofs of our results we build a linear algebraic framework instead. Separation results are proved through the reduction to covering codes.</p> </description>
<link>https://papers.cool/arxiv/2310.20606</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.20606</guid>
<pubDate>Tue, 31 Oct 2023 16:42:10 GMT</pubDate>
<author>Vladimir V. Podolskii</author>
</item>
<item>
<title>Heavy-light $N+1$ clusters of two-dimensional fermions</title>
<description><a href="https://papers.cool/arxiv/2310.11330">[Site]</a> <a href="https://papers.cool/Detection/2310.11330">[Kimi]</a> <p><b>Authors:</b> J. Givois</p> <p>We study binding of $N$ identical heavy fermions by a light atom in two dimensions assuming zero-range attractive heavy-light interactions. By using the mean-field theory valid for large $N$ we show that the $N+1$ cluster is bound when the mass ratio exceeds $1.074N^2$. The mean-field theory, being scale invariant in two dimensions, predicts only the shapes of the clusters leaving their sizes and energies undefined. By taking into account beyond-mean-field effects we find closed-form expressions for these quantities. We also discuss differences between the Thomas-Fermi and Hartree-Fock approaches for treating the heavy fermions.</p> </description>
<link>https://papers.cool/arxiv/2310.11330</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.11330</guid>
<pubDate>Tue, 17 Oct 2023 15:08:23 GMT</pubDate>
<author>J. Givois</author>
</item>
<item>
<title>On Two- and Three-valued Semantics for Impure Simplicial Complexes</title>
<description><a href="https://papers.cool/arxiv/2310.00989">[Site]</a> <a href="https://papers.cool/Detection/2310.00989">[Kimi]</a> <p><b>Authors:</b> Hans van Ditmarsch</p> <p>Simplicial complexes are a convenient semantic primitive to reason about processes (agents) communicating with each other in synchronous and asynchronous computation. Impure simplicial complexes distinguish active processes from crashed ones, in other words, agents that are alive from agents that are dead. In order to rule out that dead agents reason about themselves and about other agents, three-valued epistemic semantics have been proposed where, in addition to the usual values true and false, the third value stands for undefined: the knowledge of dead agents is undefined and so are the propositional variables describing their local state. Other semantics for impure complexes are two-valued where a dead agent knows everything. Different choices in designing a semantics produce different three-valued semantics, and also different two-valued semantics. In this work, we categorize the available choices by discounting the bad ones, identifying the equivalent ones, and connecting the non-equivalent ones via a translation. The main result of the paper is identifying the main relevant distinction to be the number of truth values and bridging this difference by means of a novel embedding from three- into two-valued semantics. This translation also enables us to highlight quite fundamental modeling differences underpinning various two- and three-valued approaches in this area of combinatorial topology. In particular, pure complexes can be defined as those invariant under the translation.</p> </description>
<link>https://papers.cool/arxiv/2310.00989</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2310.00989</guid>
<pubDate>Mon, 02 Oct 2023 08:56:26 GMT</pubDate>
<author>Hans van Ditmarsch</author>
</item>
<item>
<title>Innovative Digital Storytelling with AIGC: Exploration and Discussion of Recent Advances</title>
<description><a href="https://papers.cool/arxiv/2309.14329">[Site]</a> <a href="https://papers.cool/Detection/2309.14329">[Kimi]</a> <p><b>Authors:</b> Rongzhang Gu</p> <p>Digital storytelling, as an art form, has struggled with cost-quality balance. The emergence of AI-generated Content (AIGC) is considered as a potential solution for efficient digital storytelling production. However, the specific form, effects, and impacts of this fusion remain unclear, leaving the boundaries of AIGC combined with storytelling undefined. This work explores the current integration state of AIGC and digital storytelling, investigates the artistic value of their fusion in a sample project, and addresses common issues through interviews. Through our study, we conclude that AIGC, while proficient in image creation, voiceover production, and music composition, falls short of replacing humans due to the irreplaceable elements of human creativity and aesthetic sensibilities at present, especially in complex character animations, facial expressions, and sound effects. The research objective is to increase public awareness of the current state, limitations, and challenges arising from combining AIGC and digital storytelling.</p> </description>
<link>https://papers.cool/arxiv/2309.14329</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2309.14329</guid>
<pubDate>Mon, 25 Sep 2023 17:54:29 GMT</pubDate>
<author>Rongzhang Gu</author>
</item>
<item>
<title>Polarization Jumps across Topological Phase Transitions in Two-dimensional Systems</title>
<description><a href="https://papers.cool/arxiv/2304.12742">[Site]</a> <a href="https://papers.cool/Detection/2304.12742">[Kimi]</a> <p><b>Authors:</b> Hiroki Yoshida</p> <p>In topological phase transitions involving a change in topological invariants such as the Chern number and the $\mathbb{Z}_2$ topological invariant, the gap closes, and the electric polarization becomes undefined at the transition. In this paper, we show that the jump of polarization across such topological phase transitions in two dimensions is described in terms of positions and monopole charges of Weyl points in the intermediate Weyl semimetal phase. We find that the jump of polarization is described by the Weyl dipole at $\mathbb{Z}_2$ topological phase transitions and at phase transitions without any change in the value of the Chern number. Meanwhile, when the Chern number changes at the phase transition, the jump is expressed in terms of the relative positions of Weyl points measured from a reference point in the reciprocal space.</p> </description>
<link>https://papers.cool/arxiv/2304.12742</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2304.12742</guid>
<pubDate>Tue, 25 Apr 2023 11:36:08 GMT</pubDate>
<author>Hiroki Yoshida</author>
</item>
<item>
<title>MINER: A Hybrid Data-Driven Approach for REST API Fuzzing</title>
<description><a href="https://papers.cool/arxiv/2303.02545">[Site]</a> <a href="https://papers.cool/Detection/2303.02545">[Kimi]</a> <p><b>Authors:</b> Chenyang Lyu</p> <p>In recent years, REST API fuzzing has emerged to explore errors on a cloud service. Its performance highly depends on the sequence construction and request generation. However, existing REST API fuzzers have trouble generating long sequences with well-constructed requests to trigger hard-to-reach states in a cloud service, which limits their performance of finding deep errors and security bugs. Further, they cannot find the specific errors caused by using undefined parameters during request generation. Therefore, in this paper, we propose a novel hybrid data-driven solution, named MINER, with three new designs working together to address the above limitations. First, MINER collects the valid sequences whose requests pass the cloud service's checking as the templates, and assigns more executions to long sequence templates. Second, to improve the generation quality of requests in a sequence template, MINER creatively leverages the state-of-the-art neural network model to predict key request parameters and provide them with appropriate parameter values. Third, MINER implements a new data-driven security rule checker to capture the new kind of errors caused by undefined parameters. We evaluate MINER against the state-of-the-art fuzzer RESTler on GitLab, Bugzilla, and WordPress via 11 REST APIs. The results demonstrate that the average pass rate of MINER is 23.42% higher than RESTler. MINER finds 97.54% more unique errors than RESTler on average and 142.86% more reproducible errors after manual analysis. We have reported all the newly found errors, and 7 of them have been confirmed as logic bugs by the corresponding vendors.</p> </description>
<link>https://papers.cool/arxiv/2303.02545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2303.02545</guid>
<pubDate>Sun, 05 Mar 2023 01:41:41 GMT</pubDate>
<author>Chenyang Lyu</author>
</item>
<item>
<title>The variance-gamma ratio distribution</title>
<description><a href="https://papers.cool/arxiv/2302.12581">[Site]</a> <a href="https://papers.cool/Detection/2302.12581">[Kimi]</a> <p><b>Authors:</b> Robert E. Gaunt</p> <p>Let $X$ and $Y$ be independent variance-gamma random variables with zero location parameter; then the exact probability density function of the ratio $X/Y$ is derived. Some basic distributional properties are also derived, including identification of parameter regimes under which the density is bounded, asymptotic approximations of tail probabilities, and fractional moments; in particular, we see that the mean is undefined. In the case that $X$ and $Y$ are independent symmetric variance-gamma random variables, an exact formula is also given for the cumulative distribution function of the ratio $X/Y$.</p> </description>
<link>https://papers.cool/arxiv/2302.12581</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2302.12581</guid>
<pubDate>Fri, 24 Feb 2023 11:40:20 GMT</pubDate>
<author>Robert E. Gaunt</author>
</item>
<item>
<title>Generalized PTR: User-Friendly Recipes for Data-Adaptive Algorithms with Differential Privacy</title>
<description><a href="https://papers.cool/arxiv/2301.00301">[Site]</a> <a href="https://papers.cool/Detection/2301.00301">[Kimi]</a> <p><b>Authors:</b> Rachel Redberg</p> <p>The ''Propose-Test-Release'' (PTR) framework is a classic recipe for designing differentially private (DP) algorithms that are data-adaptive, i.e. those that add less noise when the input dataset is nice. We extend PTR to a more general setting by privately testing data-dependent privacy losses rather than local sensitivity, hence making it applicable beyond the standard noise-adding mechanisms, e.g. to queries with unbounded or undefined sensitivity. We demonstrate the versatility of generalized PTR using private linear regression as a case study. Additionally, we apply our algorithm to solve an open problem from ''Private Aggregation of Teacher Ensembles (PATE)'' -- privately releasing the entire model with a delicate data-dependent analysis.</p> </description>
<link>https://papers.cool/arxiv/2301.00301</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2301.00301</guid>
<pubDate>Sat, 31 Dec 2022 22:22:53 GMT</pubDate>
<author>Rachel Redberg</author>
</item>
<item>
<title>Modular Formal Verification of Rust Programs with Unsafe Blocks</title>
<description><a href="https://papers.cool/arxiv/2212.12976">[Site]</a> <a href="https://papers.cool/Detection/2212.12976">[Kimi]</a> <p><b>Authors:</b> Nima Rahimi Foroushaani</p> <p>Rust is a modern systems programming language whose type system guarantees memory safety. For the sake of expressivity and performance it allows programmers to relax typing rules temporarily, using unsafe code blocks. However, in unsafe blocks, the burden of making sure that the code does not end up having undefined behaviour is on the programmer. Even most expert programmers make mistakes and a memory safety bug in an unsafe block renders all the type system guarantees void. To address this problem we are trying to verify soundness of Rust unsafe code applying our Modular Symbolic Execution algorithm. This text outlines our approach and the progress that has been made so far.</p> </description>
<link>https://papers.cool/arxiv/2212.12976</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.12976</guid>
<pubDate>Mon, 26 Dec 2022 00:19:19 GMT</pubDate>
<author>Nima Rahimi Foroushaani</author>
</item>
<item>
<title>@C -- augmented version of C programming language</title>
<description><a href="https://papers.cool/arxiv/2212.11245">[Site]</a> <a href="https://papers.cool/Detection/2212.11245">[Kimi]</a> <p><b>Authors:</b> Iosif Iulian Petrila</p> <p>The augmented version of C programming language is presented. The language was completed with a series of low-level and high-level facilities to enlarge the language usage spectrum to various computing systems, operations, users. The ambiguities and inconsistencies have been resolved by managing problematic and undefined languages elements through an interpretation and management similar to that used in the case of other C syntax based languages. The proposed augmentative completeness elements, through @C approach, preserve the spirit of C language and its basic characteristics through compatibility with the standard version but also allow rejuvenation and bring C language to the present programming languages state of the art.</p> </description>
<link>https://papers.cool/arxiv/2212.11245</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2212.11245</guid>
<pubDate>Mon, 19 Dec 2022 07:53:14 GMT</pubDate>
<author>Iosif Iulian Petrila</author>
</item>
<item>
<title>Hunt for 3-Schur polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.14956">[Site]</a> <a href="https://papers.cool/Detection/2211.14956">[Kimi]</a> <p><b>Authors:</b> A. Morozov</p> <p>This paper describes our attempt to understand the recent success of Na Wang in constructing the 3-Schur polynomials, associated with the plane partitions. We provide a rather detailed review and try to figure out the new insights, which allowed to overcome the problems of the previous efforts. In result we provide a very simple definition of time-variables ${\bf P}_{i\geqslant j}$ and the cut-and-join operator $\hat W_2$, which generates the set of $3$-Schur functions. Some coefficients in $\hat W_2$ remain undefined and require more effort to be fixed.</p> </description>
<link>https://papers.cool/arxiv/2211.14956</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.14956</guid>
<pubDate>Sun, 27 Nov 2022 22:28:20 GMT</pubDate>
<author>A. Morozov</author>
</item>
<item>
<title>Impure Simplicial Complexes: Complete Axiomatization</title>
<description><a href="https://papers.cool/arxiv/2211.13543">[Site]</a> <a href="https://papers.cool/Detection/2211.13543">[Kimi]</a> <p><b>Authors:</b> Rojo Randrianomentsoa</p> <p>Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment. Pure simplicial complexes describe message passing in asynchronous systems where all processes (agents) are alive, whereas impure simplicial complexes describe message passing in synchronous systems where processes may be dead (have crashed). Properties of impure simplicial complexes can be described in a three-valued multi-agent epistemic logic where the third value represents formulae that are undefined, e.g., the knowledge and local propositions of dead agents. In this work we present an axiomatization for the logic of the class of impure complexes and show soundness and completeness. The completeness proof involves the novel construction of the canonical simplicial model and requires a careful manipulation of undefined formulae.</p> </description>
<link>https://papers.cool/arxiv/2211.13543</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.13543</guid>
<pubDate>Thu, 24 Nov 2022 11:32:36 GMT</pubDate>
<author>Rojo Randrianomentsoa</author>
</item>
<item>
<title>Some Useful Collective Properties of Bessel, Marcum Q-Functions and Laguerre Polynomials</title>
<description><a href="https://papers.cool/arxiv/2211.12260">[Site]</a> <a href="https://papers.cool/Detection/2211.12260">[Kimi]</a> <p><b>Authors:</b> Hakan Ozturk</p> <p>Special functions have been used widely in many problems of applied sciences. However, there are considerable numbers of problems in which exact solutions could not be achieved because of undefined sums or integrals involving special functions. These handicaps force researchers to seek new properties of special functions. Many problems that could not be solved so far would be solved by means of these efforts. Therefore in this article, we derived some useful properties and interrelations of each others of Bessel functions, Marcum Q-functions and Laguerre polynomials.</p> </description>
<link>https://papers.cool/arxiv/2211.12260</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2211.12260</guid>
<pubDate>Tue, 22 Nov 2022 13:22:47 GMT</pubDate>
<author>Hakan Ozturk</author>
</item>
<item>
<title>Francois Viete and his contribution to mathematics</title>
<description><a href="https://papers.cool/arxiv/2210.12545">[Site]</a> <a href="https://papers.cool/Detection/2210.12545">[Kimi]</a> <p><b>Authors:</b> Athanasios Paraskevopoulos</p> <p>This paper studies the work of the French mathematician Francois Viete, known as the "father of modern algebraic notation". Along with this fundamental change in algebra, Viete adopted a radically new notation based on Greek geometric equalities. Its letters represent values rather than types, and its given values are undefined. Where algebra had previously relied on polynomials as sets, Viete became the first modern algebraist to work with polynomials generated by operations, and the notations reflect these notions. His work was essential to his successors because it enabled those mathematicians who followed him to develop the mathematics we use today.</p> </description>
<link>https://papers.cool/arxiv/2210.12545</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.12545</guid>
<pubDate>Sat, 22 Oct 2022 20:40:50 GMT</pubDate>
<author>Athanasios Paraskevopoulos</author>
</item>
<item>
<title>An Active Learning Reliability Method for Systems with Partially Defined Performance Functions</title>
<description><a href="https://papers.cool/arxiv/2210.02168">[Site]</a> <a href="https://papers.cool/Detection/2210.02168">[Kimi]</a> <p><b>Authors:</b> Jonathan Sadeghi</p> <p>In engineering design, one often wishes to calculate the probability that the performance of a system is satisfactory under uncertainty. State of the art algorithms exist to solve this problem using active learning with Gaussian process models. However, these algorithms cannot be applied to problems which often occur in the autonomous vehicle domain where the performance of a system may be undefined under certain circumstances. To solve this problem, we introduce a hierarchical model for the system performance, where undefined performance is classified before the performance is regressed. This enables active learning Gaussian process methods to be applied to problems where the performance of the system is sometimes undefined, and we demonstrate the effectiveness of our approach by testing our methodology on synthetic numerical examples for the autonomous driving domain.</p> </description>
<link>https://papers.cool/arxiv/2210.02168</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.02168</guid>
<pubDate>Wed, 05 Oct 2022 11:50:36 GMT</pubDate>
<author>Jonathan Sadeghi</author>
</item>
<item>
<title>Schroedinger cats and quantum complementarity</title>
<description><a href="https://papers.cool/arxiv/2210.01083">[Site]</a> <a href="https://papers.cool/Detection/2210.01083">[Kimi]</a> <p><b>Authors:</b> Lorenzo Maccone</p> <p>Complementarity tells us we cannot know precisely the values of all the properties of a quantum object at the same time: the precise determination of one property implies that the value of some other (complementary) property is undefined. E.g.the precise knowledge of the position of a particle implies that its momentum is undefined. Here we show that a Schroedinger cat has a well defined value of a property that is complementary to its ``being dead or alive'' property. Then, thanks to complementarity, it has an undefined value of the property ``being dead or alive''. In other words, the cat paradox is explained through quantum complementarity: of its many complementary properties, any quantum system, such as a cat, can have a well defined value only of one at a time. Schroedinger's cat has a definite value of a property which is complementary to ``being dead or alive'', so it is neither dead nor alive. Figuratively one can say it is both dead and alive. While this interpretation only uses textbook concepts (the Copenhagen interpretation), apparently it has never explicitly appeared in the literature. We detail how to build an Arduino based simulation of Schroedinger's experiment based on these concepts for science outreach events.</p> </description>
<link>https://papers.cool/arxiv/2210.01083</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.01083</guid>
<pubDate>Mon, 03 Oct 2022 17:00:42 GMT</pubDate>
<author>Lorenzo Maccone</author>
</item>
<item>
<title>Defining a credible interval is not always possible with "point-null'' priors: A lesser-known correlate of the Jeffreys-Lindley paradox</title>
<description><a href="https://papers.cool/arxiv/2210.00029">[Site]</a> <a href="https://papers.cool/Detection/2210.00029">[Kimi]</a> <p><b>Authors:</b> Harlan Campbell</p> <p>In many common situations, a Bayesian credible interval will be, given the same data, very similar to a frequentist confidence interval, and researchers will interpret these intervals in a similar fashion. However, no predictable similarity exists when credible intervals are based on model-averaged posteriors whenever one of the two nested models under consideration is a so called ''point-null''. Not only can this model-averaged credible interval be quite different than the frequentist confidence interval, in some cases it may be undefined. This is a lesser-known correlate of the Jeffreys-Lindley paradox and is of particular interest given the popularity of the Bayes factor for testing point-null hypotheses.</p> </description>
<link>https://papers.cool/arxiv/2210.00029</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2210.00029</guid>
<pubDate>Fri, 30 Sep 2022 18:08:56 GMT</pubDate>
<author>Harlan Campbell</author>
</item>
<item>
<title>Topologically protected four-dimensional optical singularities</title>
<description><a href="https://papers.cool/arxiv/2208.09054">[Site]</a> <a href="https://papers.cool/Detection/2208.09054">[Kimi]</a> <p><b>Authors:</b> Christina M. Spaegele</p> <p>Optical singularities play a major role in modern optics and are frequently deployed in structured light, super-resolution microscopy, and holography. While phase singularities are uniquely defined as locations of undefined phase, polarization singularities studied thus far are either partial, i.e., bright points of well-defined polarization, or unstable for small field perturbations. We demonstrate for the first time a complete, topologically protected polarization singularity; it is located in the 4D space spanned by the three spatial dimensions and the wavelength and is created in the focus of a cascaded metasurface-lens system. The field Jacobian plays a key role in the design of such higher-dimensional singularities, which can be extended to multidimensional wave phenomena, and pave the way to novel applications in topological photonics and precision sensing.</p> </description>
<link>https://papers.cool/arxiv/2208.09054</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2208.09054</guid>
<pubDate>Thu, 18 Aug 2022 20:45:31 GMT</pubDate>
<author>Christina M. Spaegele</author>
</item>
<item>
<title>The "SPectrogram Analysis and Cataloguing Environment" (SPACE) Labelling Tool</title>
<description><a href="https://papers.cool/arxiv/2207.12454">[Site]</a> <a href="https://papers.cool/Detection/2207.12454">[Kimi]</a> <p><b>Authors:</b> C. K. Louis</p> <p>The SPectrogram Analysis and Cataloguing Environment (SPACE) tool is an interactive python tool designed to label radio emission features of interest in a time-frequency map (called 'dynamic spectrum'). The program uses Matplotlib's Polygon Selector widget to allow a user to select and edit an undefined number of vertices on top of the dynamic spectrum before closing the shape (polygon). Multiple polygons may be drawn on any spectrum, and the feature name along with the coordinates for each polygon vertex are saved into a '.json' file as per the 'Time-Frequency Catalogue' (TFCat) format along with other data such as the feature id, observer name, and data units. This paper describes the first official stable release (version 2.0) of the tool.</p> </description>
<link>https://papers.cool/arxiv/2207.12454</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2207.12454</guid>
<pubDate>Mon, 25 Jul 2022 18:18:40 GMT</pubDate>
<author>C. K. Louis</author>
</item>
<item>
<title>Simulating long-range coherence of atoms and photons in quantum computers</title>
<description><a href="https://papers.cool/arxiv/2206.08386">[Site]</a> <a href="https://papers.cool/Detection/2206.08386">[Kimi]</a> <p><b>Authors:</b> Emanuele G. Dalla Torre</p> <p>Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.</p> </description>
<link>https://papers.cool/arxiv/2206.08386</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2206.08386</guid>
<pubDate>Thu, 16 Jun 2022 18:00:03 GMT</pubDate>
<author>Emanuele G. Dalla Torre</author>
</item>
<item>
<title>Bosonic fields in states with undefined particle numbers possess detectable non-contextuality features, plus more</title>
<description><a href="https://papers.cool/arxiv/2205.09440">[Site]</a> <a href="https://papers.cool/Detection/2205.09440">[Kimi]</a> <p><b>Authors:</b> Konrad Schlichtholz</p> <p>Most of the paradoxical, for the classical intuition, features of quantum theory were formulated for situations which involve a fixed number of particles. While one can now find a formulation of Bell's theorem for quantum fields, a Kochen-Specker-type reasoning is usually formulated for just one particle, or like in the case of Peres-Mermin square for two. A question emerges. Is it possible to formulate a contextuality proof for situation in which the numbers of particles are fundamentally undefined? We address this problem for bosonic fields. We introduce a representation of the $\mathfrak{su}(2)$ algebra in terms of boson number states in two modes that allows us to assess nonclassicality of states of bosonic fields. As a figure of merit of a nonclassical behaviour we analyze first of all contextuality, and we show that the introduced observables are handy and efficient to reveal violation of local realism, and to formulate entanglement indicators. We construct a method which extends the Kochen-Specker contextuality to bosonic quantum fields. A form of an inequality is derived using a suitable version of the Peres-Mermin square. The entanglement indicators use a witness built with specially defined Pauli-like observables. Finally, Bell-nonclassicality is discussed: an inequality that involves the expectation values of pairs of the Pauli-like operators is presented. The introduced indicators are shown to be effective, e.g. they reveal nonclassicality in situaations involving undefined boson numbers. This is shown via quantum optical examples of the $2\times 2$ bright squeezed vacuum state, and a recently discussed bright-GHZ state resulting from multiple three photon emissions in a parametric process.</p> </description>
<link>https://papers.cool/arxiv/2205.09440</link>
<guid isPermaLink="false">https://papers.cool/arxiv/2205.09440</guid>
<pubDate>Thu, 19 May 2022 09:56:08 GMT</pubDate>
<author>Konrad Schlichtholz</author>
</item>
<item>
<title>Textual Stylistic Variation: Choices, Genres and Individuals</title>
<description><a href="https://papers.cool/arxiv/2205.00510">[Site]</a> <a href="https://papers.cool/Detection/2205.00510">[Kimi]</a> <p><b>Authors:</b> Jussi Karlgren</p> <p>This chapter argues for more informed target metrics for the statistical processing of stylistic variation in text collections. Much as operationalised relevance proved a useful goal to strive for in information retrieval, research in textual stylistics, whether application oriented or philologically inclined, needs goals formulated in terms of pertinence, relevance, and utility - notions that agree with reader experience of text. Differences readers are aware of are mostly based on utility - not on textual characteristics per se. Mostly, readers report stylistic differences in terms of genres. Genres, while vague and undefined, are well-established and talked a |
TonyRL
reviewed
Dec 18, 2024
Comment on lines
+109
to
+114
| source: ['papers.cool/arxiv/search?highlight=1&query=Detection&sort=0`'], | ||
| target: '/papers/query/Detection', | ||
| }, | ||
| { | ||
| title: 'arXiv Paper queryed by Segmentation', | ||
| source: ['papers.cool/arxiv/search?highlight=1&query=Segmentation&sort=0`'], |
| }); | ||
|
|
||
| return { | ||
| title: feed.title, |
| const limit = ctx.req.query('limit') ? Number.parseInt(ctx.req.query('limit'), 10) : 150; | ||
|
|
||
| const rootUrl = 'https://papers.cool'; | ||
| const query = keyword.split(/\//)[1]; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Involved Issue / 该 PR 相关 Issue
Close #
Example for the Proposed Route(s) / 路由地址示例
New RSS Route Checklist / 新 RSS 路由检查表
PuppeteerNote / 说明
增加了 cool paper RSS 源对 query keyword的解析，可以传入一个 keyword，然后自动解析