Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 7651 - 7680 of 63016

Full-Text Articles in Computer Sciences

Learning Nighttime Semantic Segmentation The Hard Way, Wenxi Liu, Jiaxin Cai, Qi Li, Chenyang Liao, Jingjing Cao, Shengfeng He, Yuanlong Yu May 2024

Learning Nighttime Semantic Segmentation The Hard Way, Wenxi Liu, Jiaxin Cai, Qi Li, Chenyang Liao, Jingjing Cao, Shengfeng He, Yuanlong Yu

Research Collection School Of Computing and Information Systems

Nighttime semantic segmentation is an important but challenging research problem for autonomous driving. The major challenges lie in the small objects or regions from the under-/over-exposed areas or suffer from motion blur caused by the camera deployed on moving vehicles. To resolve this, we propose a novel hard- class-aware module that bridges the main network for full-class segmentation and the hard-class network for segmenting aforementioned hard-class objects. In specific, it exploits the shared focus of hard-class objects from the dual-stream network, enabling the contextual information flow to guide the model to concentrate on the pixels that are hard to classify. …

Go to article

Baffle : Hiding Backdoors In Offline Reinforcement Learning Datasets, Chen Gong, Zhou Yang, Yunpeng Bai, Junda He, Jieke Shi, Kecen Li, Arunesh Sinha, Bowen Xu, Xinwen Hou, David Lo, Tianhao Wang May 2024

Baffle : Hiding Backdoors In Offline Reinforcement Learning Datasets, Chen Gong, Zhou Yang, Yunpeng Bai, Junda He, Jieke Shi, Kecen Li, Arunesh Sinha, Bowen Xu, Xinwen Hou, David Lo, Tianhao Wang

Research Collection School Of Computing and Information Systems

Reinforcement learning (RL) makes an agent learn from trial-and-error experiences gathered during the interaction with the environment. Recently, offline RL has become a popular RL paradigm because it saves the interactions with environments. In offline RL, data providers share large pre-collected datasets, and others can train high-quality agents without interacting with the environments. This paradigm has demonstrated effectiveness in critical tasks like robot control, autonomous driving, etc. However, less attention is paid to investigating the security threats to the offline RL system. This paper focuses on backdoor attacks, where some perturbations are added to the data (observations) such that given …

Go to article

Online Control Of Adaptive Large Neighborhood Search Using Deep Reinforcement Learning, Reijnen Reijnen, Yingqian Zhang, Hoong Chuin Lau, Zaharah Bukhsh May 2024

Online Control Of Adaptive Large Neighborhood Search Using Deep Reinforcement Learning, Reijnen Reijnen, Yingqian Zhang, Hoong Chuin Lau, Zaharah Bukhsh

Research Collection School Of Computing and Information Systems

The Adaptive Large Neighborhood Search (ALNS) algorithm has shown considerable success in solving combinatorial optimization problems (COPs). Nonetheless, the performance of ALNS relies on the proper configuration of its selection and acceptance parameters, which is known to be a complex and resource-intensive task. To address this, we introduce a Deep Reinforcement Learning (DRL) based approach called DR-ALNS that selects operators, adjusts parameters, and controls the acceptance criterion throughout the search. The proposed method aims to learn, based on the state of the search, to configure ALNS for the next iteration to yield more effective solutions for the given optimization problem. …

Go to article

Factored Mdp Based Moving Target Defense With Dynamic Threat Modeling, Megha Bose, Praveen Paruchuri, Akshat Kumar May 2024

Factored Mdp Based Moving Target Defense With Dynamic Threat Modeling, Megha Bose, Praveen Paruchuri, Akshat Kumar

Research Collection School Of Computing and Information Systems

Moving Target Defense (MTD) has emerged as a proactive defense framework to counteract ever-changing cyber threats. Existing approaches often make assumptions about attacker-side knowledge and behavior, potentially resulting in suboptimal defense. This paper introduces a novel MTD approach, leveraging a Markov Decision Process (MDP) model that eliminates the need for prior knowledge about attacker intentions or payoffs. Our framework seamlessly integrates real-time attacker responses into the defender's MDP using a dynamic Bayesian network. We use a factored MDP model to enable a more comprehensive and realistic representation of the system having multiple switchable aspects and also accommodate incremental updates of …

Go to article

Grasper: A Generalist Pursuer For Pursuit-Evasion Problems, Pengdeng Li, Shuxin Li, Xinrun Wang, Jakub Cerny, Youzhi Zhang, Stephen Mcaleer, Hau Chan, Bo An May 2024

Grasper: A Generalist Pursuer For Pursuit-Evasion Problems, Pengdeng Li, Shuxin Li, Xinrun Wang, Jakub Cerny, Youzhi Zhang, Stephen Mcaleer, Hau Chan, Bo An

Research Collection School Of Computing and Information Systems

Pursuit-evasion games (PEGs) model interactions between a team of pursuers and an evader in graph-based environments such as urban street networks. Recent advancements have demonstrated the effectiveness of the pre-training and fine-tuning paradigm in Policy-Space Response Oracles (PSRO) to improve scalability in solving large-scale PEGs. However, these methods primarily focus on specific PEGs with fixed initial conditions that may vary substantially in real-world scenarios, which significantly hinders the applicability of the traditional methods. To address this issue, we introduce Grasper, a GeneRAlist purSuer for Pursuit-Evasion pRoblems, capable of efficiently generating pursuer policies tailored to specific PEGs. Our contributions are threefold: …

Go to article

Algorithms For Canvas-Based Attention Scheduling With Resizing, Yigong Hu, Ila Gokarn, Shengzhong Liu, Archan Misra, Tarek Adbelzaher May 2024

Algorithms For Canvas-Based Attention Scheduling With Resizing, Yigong Hu, Ila Gokarn, Shengzhong Liu, Archan Misra, Tarek Adbelzaher

Research Collection School Of Computing and Information Systems

Canvas-based attention scheduling was recently pro-posed to improve the efficiency of real-time machine perception systems. This framework introduces a notion of focus locales, referring to those areas where the attention of the inference system should “allocate its attention”. Data from these locales (e.g., parts of the input video frames containing objects of interest) are packed together into a smaller canvas frame which is processed by the downstream machine learning algorithm. Compared with processing the entire input data frame, this practice saves resources while maintaining inference quality. Previous work was limited to a simplified solution where the focus locales are quantized …

Go to article

Regret-Based Defense In Adversarial Reinforcement Learning, Roman Belaire, Pradeep Varakantham, Thanh Hong Nguyen, David Lo May 2024

Regret-Based Defense In Adversarial Reinforcement Learning, Roman Belaire, Pradeep Varakantham, Thanh Hong Nguyen, David Lo

Research Collection School Of Computing and Information Systems

Deep Reinforcement Learning (DRL) policies are vulnerable to adversarial noise in observations, which can have disastrous consequences in safety-critical environments. For instance, a self-driving car receiving adversarially perturbed sensory observations about traffic signs (e.g., a stop sign physically altered to be perceived as a speed limit sign) can be fatal. Leading existing approaches for making RL algorithms robust to an observation-perturbing adversary have focused on (a) regularization approaches that make expected value objectives robust by adding adversarial loss terms; or (b) employing "maximin'' (i.e., maximizing the minimum value) notions of robustness. While regularization approaches are adept at reducing the probability …

Go to article

Analyzing And Revivifying Function Signature Inference Using Deep Learning, Yan Lin, Trisha Singhal, Debin Gao, David Lo May 2024

Analyzing And Revivifying Function Signature Inference Using Deep Learning, Yan Lin, Trisha Singhal, Debin Gao, David Lo

Research Collection School Of Computing and Information Systems

Function signature plays an important role in binary analysis and security enhancement, with typical examples in bug finding and control-flow integrity enforcement. However, recovery of function signatures by static binary analysis is challenging since crucial information vital for such recovery is stripped off during compilation. Although function signature recovery using deep learning (DL) is proposed in an effort to handle such challenges, the reported accuracy is low for binaries compiled with optimizations. In this paper, we first perform a systematic study to quantify the extent to which compiler optimizations (negatively) impact the accuracy of existing DL techniques based on Recurrent …

Go to article

Automatic Grading Of Short Answers Using Large Language Models In Software Engineering Courses, Nguyen Binh Duong Ta, Yi Meng Chai May 2024

Automatic Grading Of Short Answers Using Large Language Models In Software Engineering Courses, Nguyen Binh Duong Ta, Yi Meng Chai

Research Collection School Of Computing and Information Systems

Short-answer based questions have been used widely due to their effectiveness in assessing whether the desired learning outcomes have been attained by students. However, due to their open-ended nature, many different answers could be considered entirely or partially correct for the same question. In the context of computer science and software engineering courses where the enrolment has been increasing recently, manual grading of short-answer questions is a time-consuming and tedious process for instructors. In software engineering courses, assessments concern not just coding but many other aspects of software development such as system analysis, architecture design, software processes and operation methodologies …

Go to article

Hjg: An Effective Hierarchical Joint Graph For Anns In Multi-Metric Spaces, Yifan Zhu, Lu Chen, Yunjun Gao, Ruiyao Ma, Baihua Zheng, Jingwen Zhao May 2024

Hjg: An Effective Hierarchical Joint Graph For Anns In Multi-Metric Spaces, Yifan Zhu, Lu Chen, Yunjun Gao, Ruiyao Ma, Baihua Zheng, Jingwen Zhao

Research Collection School Of Computing and Information Systems

Owing to the widespread deployment of smartphones and networked devices, massive amount of data in different types are generated every day, including numeric data, locations, text data, images, etc. Nearest neighbour search in multi-metric spaces has attracted much attention, as it can accommodate any type of data and support search on flexible combinations of multiple metrics. However, most existing methods focus on single metric queries, failing to answer multi-metric queries efficiently due to the complex metric combinations. In this paper, for the first time, we study the approximate nearest neighbour search (ANNS) in multi-metric spaces, and propose HJG, a hierarchical …

Go to article

Reinforcement Retrieval Leveraging Fine-Grained Feedback For Fact Checking News Claims With Black-Box Llm, Xuan Zhang, Wei Gao May 2024

Reinforcement Retrieval Leveraging Fine-Grained Feedback For Fact Checking News Claims With Black-Box Llm, Xuan Zhang, Wei Gao

Research Collection School Of Computing and Information Systems

Retrieval-augmented language models have exhibited promising performance across various areas of natural language processing (NLP), including fact-critical tasks. However, due to the black-box nature of advanced large language models (LLMs) and the non-retrieval-oriented supervision signal of specific tasks, the training of retrieval model faces significant challenges under the setting of black-box LLM. We propose an approach leveraging Fine-grained Feedback with Reinforcement Retrieval (FFRR) to enhance fact-checking on news claims by using black-box LLM. FFRR adopts a two-level strategy to gather fine-grained feedback from the LLM, which serves as a reward for optimizing the retrieval policy, by rating the retrieved documents …

Go to article

Deep Reinforcement Learning Guided Improvement Heuristic For Job Shop Scheduling, Cong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu, Jie Zhang May 2024

Deep Reinforcement Learning Guided Improvement Heuristic For Job Shop Scheduling, Cong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu, Jie Zhang

Research Collection School Of Computing and Information Systems

Recent studies in using deep reinforcement learning (DRL) to solve Job-shop scheduling problems (JSSP) focus on construction heuristics. However, their performance is still far from optimality, mainly because the underlying graph representation scheme is unsuitable for modelling partial solutions at each construction step. This paper proposes a novel DRL-guided improvement heuristic for solving JSSP, where graph representation is employed to encode complete solutions. We design a Graph-Neural-Network-based representation scheme, consisting of two modules to effectively capture the information of dynamic topology and different types of nodes in graphs encountered during the improvement process. To speed up solution evaluation during improvement, …

Go to article

Discovering Personalized Characteristic Communities In Attributed Graphs, Yudong Niu, Yuchen Li, Panagiotis Karras, Yanhao Wang, Zhao Li May 2024

Discovering Personalized Characteristic Communities In Attributed Graphs, Yudong Niu, Yuchen Li, Panagiotis Karras, Yanhao Wang, Zhao Li

Research Collection School Of Computing and Information Systems

What is the widest community in which a person exercises a strong impact? Although extensive attention has been devoted to searching communities containing given individuals, the problem of finding their unique communities of influence has barely been examined. In this paper, we study the novel problem of Characteristic cOmmunity Discovery (COD) in attributed graphs. Our goal is to identify the largest community, taking into account the query attribute, in which the query node has a significant impact. The key challenge of the COD problem is that it requires evaluating the influence of the query node over a large number of …

Go to article

Deep Learning In Indus Valley Script Digitization, Deva Munikanta Reddy Atturu May 2024

Deep Learning In Indus Valley Script Digitization, Deva Munikanta Reddy Atturu

Theses and Dissertations

This research introduces ASR-net(Ancient Script Recognition), a groundbreaking system that automatically digitizes ancient Indus seals by converting them into coded text, similar to Optical Character Recognition for modern languages. ASR-net, with an 95% success rate in identifying individual symbols, aims to address the crucial need for automated techniques in deciphering the enigmatic Indus script. Initially Yolov3 is utilized to create the bounding boxes around each graphemes present in the Indus Valley Seal. In addition to that we created M-net(Mahadevan) model to encode the graphemes. Beyond digitization, the paper proposes a new research challenge called the Motif Identification Problem (MIP) related …

Go to article

Space Transformation For Open Set Recognition, Atefeh Mahdavi May 2024

Space Transformation For Open Set Recognition, Atefeh Mahdavi

Theses and Dissertations

Open Set Recognition (OSR) is about dealing with unknown situations that were not learned by the models during training. In OSR, only a limited number of known classes are available at the time of training the model and the possibility of unknown classes never seen at training time emerges in the test environment. In such a setting, the unknown classes and their risk should be considered in the algorithm. Such systems require not only to identify and discriminate instances that belong to the source domain (i.e., the seen known classes contained in the training dataset) but also to reject unknown …

Go to article

Evaluation Of Orca 2 Against Other Llms For Retrieval Augmented Generation, Donghao Huang, Zhaoxia Wang May 2024

Evaluation Of Orca 2 Against Other Llms For Retrieval Augmented Generation, Donghao Huang, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

This study presents a comprehensive evaluation of Microsoft Research’s Orca 2, a small yet potent language model, in the context of Retrieval Augmented Generation (RAG). The research involved comparing Orca 2 with other significant models such as Llama-2, GPT-3.5-Turbo, and GPT-4, particularly focusing on its application in RAG. Key metrics, included faithfulness, answer relevance, overall score, and inference speed, were assessed. Experiments conducted on high-specification PCs revealed Orca 2’s exceptional performance in generating high quality responses and its efficiency on consumer-grade GPUs, underscoring its potential for scalable RAG applications. This study highlights the pivotal role of smaller, efficient models like …

Go to article

Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua May 2024

Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Web applications serve as vital interfaces for users to access information, perform various tasks, and engage with content. Traditional web designs have predominantly focused on user interfaces and static experiences. With the advent of large language models (LLMs), there’s a paradigm shift as we integrate LLM-powered agents into these platforms. These agents bring forth crucial human capabilities like memory and planning to make them behave like humans in completing various tasks, effectively enhancing user engagement and offering tailored interactions in web applications. In this tutorial, we delve into the cutting-edge techniques of LLM-powered agents across various web applications, such as …

Go to article

Difference Of Convex Functions Programming For Policy Optimization In Reinforcement Learning, Akshat Kumar May 2024

Difference Of Convex Functions Programming For Policy Optimization In Reinforcement Learning, Akshat Kumar

Research Collection School Of Computing and Information Systems

We formulate the problem of optimizing an agent's policy within the Markov decision process (MDP) model as a difference-of-convex functions (DC) program. The DC perspective enables optimizing the policy iteratively where each iteration constructs an easier-to-optimize lower bound on the value function using the well known concave-convex procedure. We show that several popular policy gradient based deep RL algorithms (both for discrete and continuous state, action spaces, and stochastic/deterministic policies) such as actor-critic, deterministic policy gradient (DPG), and soft actor critic (SAC) can be derived from the DC perspective. Additionally, the DC formulation enables more sample efficient learning approaches by …

Go to article

Flipped Classroom For Linear Algebra At Undergraduate Level, M. Thulasidas May 2024

Flipped Classroom For Linear Algebra At Undergraduate Level, M. Thulasidas

Research Collection School Of Computing and Information Systems

In this article, we describe our experience in developing an undergraduate Linear Algebra course tailored to highlight its relevance and applicability in Computer Science. Over the course of three years, the course transitioned from a traditional direct-instruction format to a flipped-classroom design, resulting in positive student learning outcomes. This article covers the course design philosophy, its syllabus, learning objectives, and the incorporation of both quantitative and qualitative student feedback in shaping the course. Furthermore, the article shares the insights gleaned from our experience, which can serve as best practices for instructors aiming to deliver a successful Linear Algebra course for …

Go to article

Learning Multi-Faceted Prototypical User Interests, Nhu Thuat Tran, Hady W. Lauw May 2024

Learning Multi-Faceted Prototypical User Interests, Nhu Thuat Tran, Hady W. Lauw

Research Collection School Of Computing and Information Systems

We seek to uncover the latent interest units from behavioral data to better learn user preferences under the VAE framework. Existing practices tend to ignore the multiple facets of item characteristics, which may not capture it at appropriate granularity. Moreover, current studies equate the granularity of item space to that of user interests, which we postulate is not ideal as user interests would likely map to a small subset of item space. In addition, the compositionality of user interests has received inadequate attention, preventing the modeling of interactions between explanatory factors driving a user's decision. To resolve this, we propose …

Go to article

Non-Vacuous Generalization Bounds For Adversarial Risk In Stochastic Neural Networks, Mustafa Waleed, Liznerski Philipp, Antoine Ledent, Wagner Dennis, Wang Puyu, Kloft Marius May 2024

Non-Vacuous Generalization Bounds For Adversarial Risk In Stochastic Neural Networks, Mustafa Waleed, Liznerski Philipp, Antoine Ledent, Wagner Dennis, Wang Puyu, Kloft Marius

Research Collection School Of Computing and Information Systems

Adversarial examples are manipulated samples used to deceive machine learning models, posing a serious threat in safety-critical applications. Existing safety certificates for machine learning models are limited to individual input examples, failing to capture generalization to unseen data. To address this limitation, we propose novel generalization bounds based on the PAC-Bayesian and randomized smoothing frameworks, providing certificates that predict the model’s performance and robustness on unseen test samples based solely on the training data. We present an effective procedure to train and compute the first non-vacuous generalization bounds for neural networks in adversarial settings. Experimental results on the widely recognized …

Go to article

Towards Explainable Harmful Meme Detection Through Multimodal Debate Between Large Language Models, Hongzhan Lin, Ziyang Luo, Wei Gao, Jing Ma, Bo Wang, Ruichao Yang May 2024

Towards Explainable Harmful Meme Detection Through Multimodal Debate Between Large Language Models, Hongzhan Lin, Ziyang Luo, Wei Gao, Jing Ma, Bo Wang, Ruichao Yang

Research Collection School Of Computing and Information Systems

The age of social media is flooded with Internet memes, necessitating a clear grasp and effective identification of harmful ones. This task presents a significant challenge due to the implicit meaning embedded in memes, which is not explicitly conveyed through the surface text and image. However, existing harmful meme detection methods do not present readable explanations that unveil such implicit meaning to support their detection decisions. In this paper, we propose an explainable approach to detect harmful memes, achieved through reasoning over conflicting rationales from both harmless and harmful positions. Specifically, inspired by the powerful capacity of Large Language Models …

Go to article

Q-Learning Based Framework For Solving The Stochastic E-Waste Collection Problem, Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen May 2024

Q-Learning Based Framework For Solving The Stochastic E-Waste Collection Problem, Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

Electrical and Electronic Equipment (EEE) has evolved into a gateway for accessing technological innovations. However, EEE imposes substantial pressure on the environment due to the shortened life cycles. E-waste encompasses discarded EEE and its components which are no longer in use. This study focuses on the e-waste collection problem and models it as a Vehicle Routing Problem with a heterogeneous fleet and a multi-period planning problem with time windows as well as stochastic travel times. Two different Q-learning-based methods are designed to enhance the search procedure for finding solutions. The first method involves utilizing the state-action value to determine the …

Go to article

Benchmarking Marl On Long Horizon Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan May 2024

Benchmarking Marl On Long Horizon Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Current MARL benchmarks fall short in simulating realistic scenarios, particularly those involving long action sequences with sequential tasks and multiple conflicting objectives. Addressing this gap, we introduce Multi-Objective SMAC (MOSMAC), a novel MARL benchmark tailored to assess MARL methods on tasks with varying time horizons and multiple objectives. Each MOSMAC task contains one or multiple sequential subtasks. Agents are required to simultaneously balance between two objectives - combat and navigation - to successfully complete each subtask. Our evaluation of nine state-of-the-art MARL algorithms reveals that MOSMAC presents substantial challenges to many state-of-the-art MARL methods and effectively fills a critical gap …

Go to article

Enabling Roll-Up And Drill-Down Operations In News Exploration With Knowledge Graphs For Due Diligence And Risk Management, Sha Wang, Yuchen Li, Hanhua Xiao, Zhifeng Bao, Yanfei Dong May 2024

Enabling Roll-Up And Drill-Down Operations In News Exploration With Knowledge Graphs For Due Diligence And Risk Management, Sha Wang, Yuchen Li, Hanhua Xiao, Zhifeng Bao, Yanfei Dong

Research Collection School Of Computing and Information Systems

Efficient news exploration is crucial in real-world applications, particularly within the financial sector, where numerous control and risk assessment tasks rely on the analysis of public news reports. The current processes in this domain predominantly rely on manual efforts, often involving keyword-based searches and the compilation of extensive keyword lists. In this paper, we introduce NCEXPLORER, a framework designed with OLAP-like operations to enhance the news exploration experience. NCEXPLORER empowers users to use roll-up operations for a broader content overview and drill-down operations for detailed insights. These operations are achieved through integration with external knowledge graphs (KGs), encompassing both fact-based …

Go to article

Fashionregen: Llm‑Empowered Fashion Report Generation, Yujuan Ding, Yunshan Ma, Wenqi Fan, Yige Yao, Tat‑Seng Chua, Qing Li May 2024

Fashionregen: Llm‑Empowered Fashion Report Generation, Yujuan Ding, Yunshan Ma, Wenqi Fan, Yige Yao, Tat‑Seng Chua, Qing Li

Research Collection School Of Computing and Information Systems

Fashion analysis refers to the process of examining and evaluating trends, styles, and elements within the fashion industry to understand and interpret its current state, generating fashion reports. It is traditionally performed by fashion professionals based on their expertise and experience, which requires high labour cost and may also produce biased results for relying heavily on a small group of people. In this paper, to tackle the Fashion Report Generation (FashionReGen) task, we propose an intelligent Fashion Analyzing and Reporting system based the advanced Large Language Models (LLMs), debbed as GPT-FAR. Specifically, it tries to deliver FashionReGen based on effective …

Go to article

Denoising Diffusion Probabilistic Models Based Accelerated Mri, Alexander Francis Bugielski May 2024

Denoising Diffusion Probabilistic Models Based Accelerated Mri, Alexander Francis Bugielski

Theses and Dissertations

Magnetic Resonance Imaging (MRI) is a cornerstone in obtaining intricate visualizations of anatomy and physiological processes within the human body. However, its extensive scan duration not only causes patient discomfort but also increases the likelihood of motion-induced artifacts in the images. To address such a challenge, this study investigates deep neural network models for reconstructing high-resolution MRI images from noisy and significantly undersampled data in a supervised learning manner. Specifically, it compares three models: a conventional U-Net, a self-attentive U-Net, and an innovative probabilistic diffusion model that builds upon the self-attentive U-Net architecture. These models are evaluated on their ability …

Go to article

Investigating The Impact Of Human-Centered Interface Design On The User Experience Of Mobile Device Users, Ruchir Gupta May 2024

Investigating The Impact Of Human-Centered Interface Design On The User Experience Of Mobile Device Users, Ruchir Gupta

Theses and Dissertations

In order to investigate the intricate interaction between interface design, user technological proficiency, and other components of the user experience, this research study used a mixed-method approach. The beginner user group—those with little experience or expertise with technology - were the main target audience. The important discovery emphasizes the substantial influence that careful design can have on improving the effectiveness and usability of interfaces for non-tech-savvy individuals. When using the suggested Interface B instead of the current Interface A, beginner participants' task completion times significantly improved, according to the user study. This underlines the significance of creating with the needs …

Go to article

Artificial Intelligence's Ability To Detect Online Predators, Olatilewa Osifeso May 2024

Artificial Intelligence's Ability To Detect Online Predators, Olatilewa Osifeso

Electronic Theses, Projects, and Dissertations

Online child predators pose a danger to children who use the Internet. Children fall victim to online predators at an alarming rate, based on the data from the National Center of Missing and Exploited Children. When making online profiles and joining websites, you only need a name, an email and a password without identity verification. Studies have shown that online predators use a variety of methods and tools to manipulate and exploit children, such as blackmail, coercion, flattery, and deception. These issues have created an opportunity for skilled online predators to have fewer obstacles when it comes to contacting and …

Go to article

Classification Of Remote Sensing Image Data Using Rsscn-7 Dataset, Satya Priya Challa May 2024

Classification Of Remote Sensing Image Data Using Rsscn-7 Dataset, Satya Priya Challa

Electronic Theses, Projects, and Dissertations

A novel technique for remote sensing image scene classification is employed using the Compact Vision Transformer (CVT) architecture. This model strengthens the power of deep learning and self-attention algorithms to significantly intensify the accuracy and efficiency of scene classification in remote sensing imagery. Through extensive training and evaluation of the RSSCNN7 dataset, our CVT-based model has achieved an impressive accuracy rate of 87.46% on the original dataset. This remarkable result underscores the prospect of CVT models in the domain of remote sensing and underscores their applicability in real-world scenarios. Our report furnishes an elaborate account of the model's architecture, training …

Go to article

First Prev Next Last