OpenRaiser/Intern-Atlas huggingface dataset:
Contextualizing Problems to Student Interests at Scale in Intelligent Tutoring System Using Large Language Models
Venue: arXiv cs.HC 2023
Year: 2023

Contextualizing problems to align with student interests can significantly improve learning outcomes. However, this task often presents scalability challenges due to resource and time constraints. Recent advancements in Large Language Models (LLMs) like GPT-4 offer potential solutions to these issues. This study explores the ability of GPT-4 in the contextualization of problems within CTAT, an intelligent tutoring system, aiming to increase student engagement and enhance learning outcomes. Through iterative prompt engineering, we achieved meaningful contextualization that preserved the difficulty and original intent of the problem, thereby not altering values or overcomplicating the questions. While our research highlights the potential of LLMs in educational settings, we acknowledge current limitations, particularly with geometry problems, and emphasize the need for ongoing evaluation and research. Future work includes systematic studies to measure the impact of this tool on students' learning outcomes and enhancements to handle a broader range of problems.
SSL-CPCD: Self-supervised learning with composite pretext-class discrimination for improved generalisability in endoscopic image analysis
Venue: arXiv cs.CV 2023
Year: 2023

Data-driven methods have shown tremendous progress in medical image analysis. In this context, deep learning-based supervised methods are widely popular. However, they require a large amount of training data and face issues in generalisability to unseen datasets that hinder clinical translation. Endoscopic imaging data incorporates large inter- and intra-patient variability that makes these models more challenging to learn representative features for downstream tasks. Thus, despite the publicly available datasets and datasets that can be generated within hospitals, most supervised models still underperform. While self-supervised learning has addressed this problem to some extent in natural scene data, there is a considerable performance gap in the medical image domain. In this paper, we propose to explore patch-level instance-group discrimination and penalisation of inter-class variation using additive angular margin within the cosine similarity metrics. Our novel approach enables models to learn to cluster similar representative patches, thereby improving their ability to provide better separation between different classes. Our results demonstrate significant improvement on all metrics over the state-of-the-art (SOTA) methods on the test set from the same and diverse datasets. We evaluated our approach for classification, detection, and segmentation. SSL-CPCD achieves 79.77% on Top 1 accuracy for ulcerative colitis classification, 88.62% on mAP for polyp detection, and 82.32% on dice similarity coefficient for segmentation tasks are nearly over 4%, 2%, and 3%, respectively, compared to the baseline architectures. We also demonstrate that our method generalises better than all SOTA methods to unseen datasets, reporting nearly 7% improvement in our generalisability assessment.
Customized Co-Simulation Environment for Autonomous Driving Algorithm Development and Evaluation
Venue: arXiv cs.RO 2023
Year: 2023

Increasing the implemented SAE level of autonomy in road vehicles requires extensive simulations and verifications in a realistic simulation environment before proving ground and public road testing. The level of detail in the simulation environment helps ensure the safety of a real-world implementation and reduces algorithm development cost by allowing developers to complete most of the validation in the simulation environment. Considering sensors like camera, LIDAR, radar, and V2X used in autonomous vehicles, it is essential to create a simulation environment that can provide these sensor simulations as realistically as possible. While sensor simulations are of crucial importance for perception algorithm development, the simulation environment will be incomplete for the simulation of holistic AV operation without being complemented by a realistic vehicle dynamic model and traffic cosimulation. Therefore, this paper investigates existing simulation environments, identifies use case scenarios, and creates a cosimulation environment to satisfy the simulation requirements for autonomous driving function development using the Carla simulator based on the Unreal game engine for the environment, Sumo or Vissim for traffic co-simulation, Carsim or Matlab, Simulink for vehicle dynamics co-simulation and Autoware or the author or user routines for autonomous driving algorithm co-simulation. As a result of this work, a model-based vehicle dynamics simulation with realistic sensor simulation and traffic simulation is presented. A sensor fusion methodology is implemented in the created simulation environment as a use case scenario. The results of this work will be a valuable resource for researchers who need a comprehensive co-simulation environment to develop connected and autonomous driving algorithms.
Bio-Inspired 4D-Printed Mechanisms with Programmable Morphology
Venue: arXiv cs.CE 2023
Year: 2023

Traditional robotic mechanisms contain a series of rigid links connected by rotational joints that provide powered motion, all of which is controlled by a central processor. By contrast, analogous mechanisms found in nature, such as octopus tentacles, contain sensors, actuators, and even neurons distributed throughout the appendage, thereby allowing for motion with superior complexity, fluidity, and reaction time. Smart materials provide a means with which we can mimic these features artificially. These specialized materials undergo shape change in response to changes in their environment. Previous studies have developed material-based actuators that could produce targeted shape changes. Here we extend this capability by introducing a novel computational and experimental method for design and synthesis of material-based morphing mechanisms capable of achieving complex pre-programmed motion. By combining active and passive materials, the algorithm can encode the desired movement into the material distribution of the mechanism. We demonstrate this new capability by de novo design of a 3D printed self-tying knot. This method advances a new paradigm in mechanism design that could enable a new generation of material-driven machines that are lightweight, adaptable, robust to damage, and easily manufacturable by 3D printing.
Efficient Computation of Physics-Compliant Channel Realizations for (Rich-Scattering) RIS-Parametrized Radio Environments
Venue: arXiv cs.IT 2023
Year: 2023

Physics-compliant channel models of RIS-parametrized radio environments require the inversion of an "interaction matrix" to capture the mutual coupling between wireless entities (transmitters, receivers, RIS, environmental scattering objects) due to proximity and reverberation. The computational cost of this matrix inversion is typically dictated by the environmental scattering objects in non-trivial radio environments, and scales unfavorably with the latter's complexity. In addition, many problems of interest in wireless communications (RIS optimization, fast fading, object or user-equipment localization, etc.) require the computation of multiple channel realizations. To overcome the potentially prohibitive computational cost of using physics-compliant channel models, we i) introduce an isospectral reduction of the interaction matrix from the canonical basis to an equivalent reduced basis of primary wireless entities (antennas and RIS), and ii) leverage the fact that interaction matrices for different channel realizations only differ regarding RIS configurations and/or some wireless entities' locations.
Affinity-based Attention in Self-supervised Transformers Predicts Dynamics of Object Grouping in Humans
Venue: arXiv cs.CV 2023
Year: 2023

The spreading of attention has been proposed as a mechanism for how humans group features to segment objects. However, such a mechanism has not yet been implemented and tested in naturalistic images. Here, we leverage the feature maps from self-supervised vision Transformers and propose a model of human object-based attention spreading and segmentation. Attention spreads within an object through the feature affinity signal between different patches of the image. We also collected behavioral data on people grouping objects in natural images by judging whether two dots are on the same object or on two different objects. We found that our models of affinity spread that were built on feature maps from the self-supervised Transformers showed significant improvement over baseline and CNN based models on predicting reaction time patterns of humans, despite not being trained on the task or with any other object labels. Our work provides new benchmarks for evaluating models of visual representation learning including Transformers.
Developing and Building Ontologies in Cyber Security
Venue: arXiv cs.CR 2023
Year: 2023

Cyber Security is one of the most arising disciplines in our modern society. We work on Cybersecurity domain and in this the topic we chose is Cyber Security Ontologies. In this we gather all latest and previous ontologies and compare them on the basis of different analyzing factors to get best of them. Reason to select this topic is to assemble different ontologies from different era of time. Because, researches that included in this SLR is mostly studied single ontology. If any researcher wants to study ontologies, he has to study every single ontology and select which one is best for his research. So, we assemble different types of ontology and compare them against each other to get best of them. A total 24 papers between years 2010-2020 are carefully selected through systematic process and classified accordingly. Lastly, this SLR have been presented to provide the researchers promising future directions in the domain of cybersecurity ontologies.
Symmetric Uncertainty-Aware Feature Transmission for Depth Super-Resolution
Venue: arXiv cs.CV 2023
Year: 2023

Color-guided depth super-resolution (DSR) is an encouraging paradigm that enhances a low-resolution (LR) depth map guided by an extra high-resolution (HR) RGB image from the same scene. Existing methods usually use interpolation to upscale the depth maps before feeding them into the network and transfer the high-frequency information extracted from HR RGB images to guide the reconstruction of depth maps. However, the extracted high-frequency information usually contains textures that are not present in depth maps in the existence of the cross-modality gap, and the noises would be further aggravated by interpolation due to the resolution gap between the RGB and depth images. To tackle these challenges, we propose a novel Symmetric Uncertainty-aware Feature Transmission (SUFT) for color-guided DSR. (1) For the resolution gap, SUFT builds an iterative up-and-down sampling pipeline, which makes depth features and RGB features spatially consistent while suppressing noise amplification and blurring by replacing common interpolated pre-upsampling. (2) For the cross-modality gap, we propose a novel Symmetric Uncertainty scheme to remove parts of RGB information harmful to the recovery of HR depth maps. Extensive experiments on benchmark datasets and challenging real-world settings suggest that our method achieves superior performance compared to state-of-the-art methods. Our code and models are available at https://github.com/ShiWuxuan/SUFT.
Towards Interactive Image Inpainting via Sketch Refinement
Venue: arXiv cs.CV 2023
Year: 2023

One tough problem of image inpainting is to restore complex structures in the corrupted regions. It motivates interactive image inpainting which leverages additional hints, e.g., sketches, to assist the inpainting process. Sketch is simple and intuitive to end users, but meanwhile has free forms with much randomness. Such randomness may confuse the inpainting models, and incur severe artifacts in completed images. To address this problem, we propose a two-stage image inpainting method termed SketchRefiner. In the first stage, we propose using a cross-correlation loss function to robustly calibrate and refine the user-provided sketches in a coarse-to-fine fashion. In the second stage, we learn to extract informative features from the abstracted sketches in the feature space and modulate the inpainting process. We also propose an algorithm to simulate real sketches automatically and build a test protocol with different applications. Experimental results on public datasets demonstrate that SketchRefiner effectively utilizes sketch information and eliminates the artifacts due to the free-form sketches. Our method consistently outperforms the state-of-the-art ones both qualitatively and quantitatively, meanwhile revealing great potential in real-world applications. Our code and dataset are available.
Representation Theorems Obtained by Miningacross Web Sources for Hints
Venue: arXiv cs.LO 2023
Year: 2023

A representation theorem relates different mathematical structures by providing an isomorphism between them: that is, a one-to-one correspondence preserving their original properties. Establishing that the two structures substantially behave in the same way, representation theorems typically provide insight and generate powerful techniques to study the involved structures, by cross-fertilising between the methodologies existing for each of the respective branches of mathematics. When the related structures have no obvious a priori connection, however, such results can be, by their own nature, elusive. Here, we show how data-mining across distinct web sources (including the Online Encyclopedia of Integer Sequences, OEIS), was crucial in the discovery of two original representation theorems relating event structures (mathematical structures commonly used to represent concurrent discrete systems) to families of sets (endowed with elementary disjointness and subset relations) and to full graphs, respectively. The latter originally emerged in the apparently unrelated field of bioinformatics. As expected, our representation theorems are powerful, allowing to capitalise on existing theorems about full graphs to immediately conclude new facts about event structures. Our contribution is twofold: on one hand, we illustrate our novel method to mine the web, resulting in thousands of candidate connections between distinct mathematical realms; on the other hand, we explore one of these connections to obtain our new representation theorems. We hope this paper can encourage people with relevant expertise to scrutinize these candidate connections. We anticipate that, building on the ideas presented here, further connections can be unearthed, by refining the mining techniques and by extending the mined repositories.
Scaling Expected Force: Efficient Identification of Key Nodes in Network-based Epidemic Models
Venue: arXiv cs.SI 2023
Year: 2023

Centrality measures are fundamental tools of network analysis as they highlight the key actors within the network. This study focuses on a newly proposed centrality measure, Expected Force (EF), and its use in identifying spreaders in network-based epidemic models. We found that EF effectively predicts the spreading power of nodes and identifies key nodes and immunization targets. However, its high computational cost presents a challenge for its use in large networks. To overcome this limitation, we propose two parallel scalable algorithms for computing EF scores: the first algorithm is based on the original formulation, while the second one focuses on a cluster-centric approach to improve efficiency and scalability. Our implementations significantly reduce computation time, allowing for the detection of key nodes at large scales. Performance analysis on synthetic and real-world networks demonstrates that the GPU implementation of our algorithm can efficiently scale to networks with up to 44 million edges by exploiting modern parallel architectures, achieving speed-ups of up to 300x, and 50x on average, compared to the simple parallel solution.
Wuerstchen: An Efficient Architecture for Large-Scale Text-to-Image Diffusion Models
Venue: arXiv cs.CV 2023
Year: 2023

We introduce Würstchen, a novel architecture for text-to-image synthesis that combines competitive performance with unprecedented cost-effectiveness for large-scale text-to-image diffusion models. A key contribution of our work is to develop a latent diffusion technique in which we learn a detailed but extremely compact semantic image representation used to guide the diffusion process. This highly compressed representation of an image provides much more detailed guidance compared to latent representations of language and this significantly reduces the computational requirements to achieve state-of-the-art results. Our approach also improves the quality of text-conditioned image generation based on our user preference study. The training requirements of our approach consists of 24,602 A100-GPU hours - compared to Stable Diffusion 2.1's 200,000 GPU hours. Our approach also requires less training data to achieve these results. Furthermore, our compact latent representations allows us to perform inference over twice as fast, slashing the usual costs and carbon footprint of a state-of-the-art (SOTA) diffusion model significantly, without compromising the end performance. In a broader comparison against SOTA models our approach is substantially more efficient and compares favorably in terms of image quality. We believe that this work motivates more emphasis on the prioritization of both performance and computational accessibility.
Normalization Enhances Generalization in Visual Reinforcement Learning
Venue: arXiv cs.LG 2023
Year: 2023

Recent advances in visual reinforcement learning (RL) have led to impressive success in handling complex tasks. However, these methods have demonstrated limited generalization capability to visual disturbances, which poses a significant challenge for their real-world application and adaptability. Though normalization techniques have demonstrated huge success in supervised and unsupervised learning, their applications in visual RL are still scarce. In this paper, we explore the potential benefits of integrating normalization into visual RL methods with respect to generalization performance. We find that, perhaps surprisingly, incorporating suitable normalization techniques is sufficient to enhance the generalization capabilities, without any additional special design. We utilize the combination of two normalization techniques, CrossNorm and SelfNorm, for generalizable visual RL. Extensive experiments are conducted on DMControl Generalization Benchmark and CARLA to validate the effectiveness of our method. We show that our method significantly improves generalization capability while only marginally affecting sample efficiency. In particular, when integrated with DrQ-v2, our method enhances the test performance of DrQ-v2 on CARLA across various scenarios, from 14% of the training performance to 97%.
Green Segment Routing for Improved Sustainability of Backbone Networks
Venue: arXiv cs.NI 2023
Year: 2023

Improving the energy efficiency of Internet Service Provider (ISP) backbone networks is an important objective for ISP operators. In these networks, the overall traffic load throughout the day can vary drastically, resulting in many backbone networks being highly overprovisioned during periods of lower traffic volume. In this paper, we propose a new Segment Routing (SR)-based optimization algorithm that aims at reducing the energy consumption of networks during such low-traffic periods. It uses the traffic steering capabilities of SR to remove traffic from as many links as possible to allow the respective hardware components to be switched off. Furthermore, it simultaneously ensures that solutions comply to additional operator requirements regarding the overall Maximum Link Utilization in the network. Based on data from a Tier-1 ISP and a public available dataset, we show that our approach allows for up to 70 % of the overall linecards to be switched off, corresponding to an around 56% reduction of the overall energy consumption of the network in times of low traffic demands.
DAM-Net: Global Flood Detection from SAR Imagery Using Differential Attention Metric-Based Vision Transformers
Venue: arXiv cs.CV 2023
Year: 2023

The detection of flooded areas using high-resolution synthetic aperture radar (SAR) imagery is a critical task with applications in crisis and disaster management, as well as environmental resource planning. However, the complex nature of SAR images presents a challenge that often leads to an overestimation of the flood extent. To address this issue, we propose a novel differential attention metric-based network (DAM-Net) in this study. The DAM-Net comprises two key components: a weight-sharing Siamese backbone to obtain multi-scale change features of multi-temporal images and tokens containing high-level semantic information of water-body changes, and a temporal differential fusion (TDF) module that integrates semantic tokens and change features to generate flood maps with reduced speckle noise. Specifically, the backbone is split into multiple stages. In each stage, we design three modules, namely, temporal-wise feature extraction (TWFE), cross-temporal change attention (CTCA), and temporal-aware change enhancement (TACE), to effectively extract the change features. In TACE of the last stage, we introduce a class token to record high-level semantic information of water-body changes via the attention mechanism. Another challenge faced by data-driven deep learning algorithms is the limited availability of flood detection datasets. To overcome this, we have created the S1GFloods open-source dataset, a global-scale high-resolution Sentinel-1 SAR image pairs dataset covering 46 global flood events between 2015 and 2022. The experiments on the S1GFloods dataset using the proposed DAM-Net showed top results compared to state-of-the-art methods in terms of overall accuracy, F1-score, and IoU, which reached 97.8%, 96.5%, and 93.2%, respectively. Our dataset and code will be available online at https://github.com/Tamer-Saleh/S1GFlood-Detection.
End-to-End Document Classification and Key Information Extraction using Assignment Optimization
Venue: arXiv cs.IR 2023
Year: 2023

We propose end-to-end document classification and key information extraction (KIE) for automating document processing in forms. Through accurate document classification we harness known information from templates to enhance KIE from forms. We use text and layout encoding with a cosine similarity measure to classify visually-similar documents. We then demonstrate a novel application of mixed integer programming by using assignment optimization to extract key information from documents. Our approach is validated on an in-house dataset of noisy scanned forms. The best performing document classification approach achieved 0.97 f1 score. A mean f1 score of 0.94 for the KIE task suggests there is significant potential in applying optimization techniques. Abation results show that the method relies on document preprocessing techniques to mitigate Type II errors and achieve optimal performance.