Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- University of Dayton (38)
- Old Dominion University (18)
- Singapore Management University (15)
- San Jose State University (6)
- Loyola University Chicago (4)
-
- University of Kentucky (4)
- City University of New York (CUNY) (3)
- Ursinus College (3)
- California Polytechnic State University, San Luis Obispo (2)
- Indian Statistical Institute (2)
- Institute of Business Administration (2)
- LSU New Orleans (2)
- Montclair State University (2)
- University of Malaya (2)
- University of Nevada, Las Vegas (2)
- Bemidji State University (1)
- California State University, San Bernardino (1)
- Dartmouth College (1)
- Georgia Southern University (1)
- Kennesaw State University (1)
- Louisiana State University (1)
- Michigan Technological University (1)
- Minnesota State University, Mankato (1)
- Portland State University (1)
- Purdue University (1)
- Southern Methodist University (1)
- Tennessee State University (1)
- United Arab Emirates University (1)
- University of Arkansas, Fayetteville (1)
- University of Louisville (1)
- Keyword
-
- Peer-to-peer computing (6)
- Computer science (5)
- Resilience (5)
- Algorithms (4)
- Computer networks (4)
-
- Delay (4)
- Graph theory (4)
- Machine Learning (4)
- Probability (4)
- Routing (4)
- Wireless sensor networks (4)
- Ad hoc networks (3)
- Analytical models (3)
- Computational modeling (3)
- Failure analysis (3)
- Genetic algorithm (3)
- Internet (3)
- Large-scale systems (3)
- Neural Networks (3)
- Neural networks (3)
- P2P networks (3)
- Parallel computation (3)
- Peer to peer computing (3)
- Peer-to-peer (3)
- Random processes (3)
- Stochastic processes (3)
- Task analysis (3)
- Training (3)
- User churn (3)
- Anomaly detection (2)
- Publication Year
- Publication
-
- Computer Science Faculty Publications (38)
- Research Collection School Of Computing and Information Systems (14)
- Electrical & Computer Engineering Theses & Dissertations (7)
- VMASC Publications (5)
- Computer Science: Faculty Publications and Other Works (4)
-
- Master's Projects (4)
- Theses and Dissertations--Computer Science (4)
- Mathematics, Computer Science & Statistics Faculty Publications (3)
- Department of Computer Science Faculty Scholarship and Creative Works (2)
- Dissertations, Theses, and Capstone Projects (2)
- International Conference on Information and Communication Technologies (2)
- LSU New Orleans Theses and Dissertations (2)
- Master's Theses (2)
- Master’s Dissertations (2)
- Student Works (2000-2009) (2)
- All Graduate Theses, Dissertations, and Other Capstone Projects (1)
- Civil & Environmental Engineering Faculty Publications (1)
- College of Graduate Studies: Theses & Dissertations (1)
- Computational Modeling & Simulation Engineering Faculty Publications (1)
- Computer Science Faculty Publications and Presentations (1)
- Computer Science Faculty Research (1)
- Computer Science Theses & Dissertations (1)
- Computer Science and Computer Engineering Undergraduate Honors Theses (1)
- Dartmouth College Undergraduate Theses (1)
- Dissertations (1)
- Dissertations and Theses Collection (Open Access) (1)
- Dissertations, Master's Theses and Master's Reports (1)
- Electrical and Computer Engineering Faculty Publications (1)
- Electronic Theses and Dissertations (1)
- Electronic Theses, Projects, and Dissertations (1)
- Publication Type
Articles 1 - 30 of 125
Full-Text Articles in Theory and Algorithms
Ai-Driven Penetration Testing For Arm Systems: A Comprehensive Framework With Experimental Validation, Matthew Ragsdale
Ai-Driven Penetration Testing For Arm Systems: A Comprehensive Framework With Experimental Validation, Matthew Ragsdale
College of Graduate Studies: Theses & Dissertations
The convergence of artificial intelligence and cybersecurity presents new opportunities for automated penetration testing capable of discovering, prioritizing, and remediating vulnerabilities at machine speed. However, deployment on resource-constrained ARM platforms remains unexplored despite ARM’s dominance in mobile, IoT, and edge computing with over 280 billion chips deployed globally. This thesis presents systematic experimental evaluation of AI-driven penetration testing across four paradigms—traditional machine learning, deep learning, large language models, and reinforcement learning—on three ARM platform tiers: Raspberry Pi 5 (8GB, Cortex-A76), Radxa ROCK 5B Plus (16GB LPDDR5 with NPU), and NVIDIA Jetson Nano (4GB with Maxwell GPU). The experimental framework generates …
Csc36000 - Modern Distributed Computing Assignment, Saptarashmi Bandyopadhyay
Csc36000 - Modern Distributed Computing Assignment, Saptarashmi Bandyopadhyay
Open Educational Resources
This assignment covers standard performance metrics for Distributed Systems and the basics of Multiprocessing for CSC36000 - Modern Distributed Computing at the City College of New York CUNY. It is an interactive coding assignment intended to be executed in a Python notebook.
Filling Gaps In Scientific Data Sets Using Physics Informed Neural Networks: A Case Study In Velocity Fields, Ellen Saunders
Filling Gaps In Scientific Data Sets Using Physics Informed Neural Networks: A Case Study In Velocity Fields, Ellen Saunders
Master's Theses
Gaps in scientific data sets are a persistent issue for researchers in a variety of fields, and while nothing makes up for missing out on real data, well-simulated synthetic data can be a useful tool. In the world of image processing, machine learning techniques have become quite sophisticated at taking an image with a missing component and filling in that space with something believable. The aim of this thesis is to take machine learning techniques similar to what gets used in image processing and repurpose them to infill gaps in scientific data sets in a realistic manner. This thesis compares …
Community Detection In Heterogeneous Information Networks Without Materialization, Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu
Community Detection In Heterogeneous Information Networks Without Materialization, Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu
Research Collection School Of Computing and Information Systems
Community detection in heterogeneous information networks (HINs) poses significant challenges due to the diversity of entity types and the complexity of their interrelations. While traditional algorithms may perform adequately in some scenarios, many struggle with the high memory usage and computational demands of large-scale HINs. To address these challenges, we introduce a novel framework, SCAR, which efficiently uncovers community structures in HINs without requiring network materialization. SCAR leverages insights from meta-paths to interpret multi-relational data through compact vertex-based sketches, significantly reducing computational overhead and materialization overhead. We propose a sketch-based technique for estimating changes in modularity, improving both the precision …
A Multimodal Fusion Model Leveraging Mlp Mixer And Handcrafted Features-Based Deep Learning Networks For Facial Palsy Detection, Heng Yim Nicole Oo, Min Hun Lee, Jeong Hoon Lim
A Multimodal Fusion Model Leveraging Mlp Mixer And Handcrafted Features-Based Deep Learning Networks For Facial Palsy Detection, Heng Yim Nicole Oo, Min Hun Lee, Jeong Hoon Lim
Research Collection School Of Computing and Information Systems
Algorithmic detection of facial palsy offers the potential to improve current practices, which usually involve labor-intensive and subjective assessments by clinicians. In this paper, we present a multimodal fusion-based deep learning model that utilizes an MLP mixer-based model to process unstructured data (i.e. RGB images or images with facial line segments) and a feed-forward neural network to process structured data (i.e. facial landmark coordinates, features of facial expressions, or handcrafted features) for detecting facial palsy. We then contribute to a study to analyze the effect of different data modalities and the benefits of a multimodal fusion-based approach using videos of …
Comparative Analysis Of Classical And Machine Learning Pathfinding Approaches, Miguel Gapud
Comparative Analysis Of Classical And Machine Learning Pathfinding Approaches, Miguel Gapud
Honors Theses
Pathfinding is an essential task for any autonomous robot. Graph-based classical pathfinding algorithms and machine learning approaches have both been used for this end, but they are often not compared against each other. An implementation of end-to-end (E2E) pathfinding using Proximal Policy Optimization (PPO) and an Alexnet architecture is compared against an implementation of Hybrid A*. A digital twin in Unity3D is used as the testing environment with the Clearpath Dingo as the pathfinding robot. In machine learning, the robot is controlled using PPO through ROS-Noetic with a camera as its sensor. Hybrid A* and its controls are implemented directly …
36 - Investigation Of The Digital Footprint Of Scientific Research In Social Media – Preliminary Findings, Lee Logan, Dominik Soos, Sean Baker, Jian Wu
36 - Investigation Of The Digital Footprint Of Scientific Research In Social Media – Preliminary Findings, Lee Logan, Dominik Soos, Sean Baker, Jian Wu
Undergraduate Research Symposium
Title: Investigation of The Digital Footprint of Scientific Research in Social Media – Preliminary Findings
Authors: Lee Logan, Sean Baker, Dominik Soos, Jian Wu
The spread of scientific information and research beyond the confines of academic institutions plays a central role in how the public understands and trusts modern sciences. Social media has become an essential means of dissemination for scholarly news, papers, and other forms of engagement. This research aims to explore how scientific research is disseminated over social media to understand its role as a bridge between peer-reviewed research and the public's overall understanding. To support the research …
Computing In The Commonwealth: Specialized Education In Computer Science And Information Technology For High School Students In Virginia – An Environmental Scan, Amy Corning, Jonathan D. Becker, Jon Graham, James Carrigan, Keisha Tennessee
Computing In The Commonwealth: Specialized Education In Computer Science And Information Technology For High School Students In Virginia – An Environmental Scan, Amy Corning, Jonathan D. Becker, Jon Graham, James Carrigan, Keisha Tennessee
ICRE Publications
Over the past two decades, Virginia has invested substantially in STEM education, in part through specialized programs focused on computer science and information technology (CS/IT). This study represents the first effort to identify Virginia’s specialized secondary CS/IT programs and examine them collectively. Findings from the statewide environmental scan indicate that the programs are delivered through a wide variety of institutional structures, including Governor’s STEM Academies, Governor’s Schools, specialty centers, and academies, but most often through Career and Technical Education (CTE) centers. Programs tend to be concentrated in metropolitan areas, and some rural divisions may not be served. The programs provide …
Age Of Information-Based Optimal Scheduling With Energy Cost Trade-Off For Smart Warehouse: A Deep Reinforcement Learning-Based Approach, Sandip Roy, Abhishek Bisht, Ashok Kumar Das, Sachin Shetty
Age Of Information-Based Optimal Scheduling With Energy Cost Trade-Off For Smart Warehouse: A Deep Reinforcement Learning-Based Approach, Sandip Roy, Abhishek Bisht, Ashok Kumar Das, Sachin Shetty
VMASC Publications
Recent advances in the integration of high-speed mobile networks and real-time IoT devices have facilitated in building of smart warehouses, where a set of beacons and Internet of Things (IoT) devices (or source nodes) can monitor the status of various physical processes in a time-critical way. In real-time status monitoring systems, like smart warehouses, quantifying the freshness of the Internet of Things (IoT) data based on the age of information (AoI) metrics becomes quite crucial. As source nodes are battery-constrained, a balanced trade-off between AoI minimization and preservation of source node battery energy is essential. In this paper, in a …
5g-Practical Byzantine Fault Tolerance: An Improved Pbft Consensus Algorithm For The 5g Network, Xin Liu, Xing Fan, Baoning Niu, Xianrong Zheng
5g-Practical Byzantine Fault Tolerance: An Improved Pbft Consensus Algorithm For The 5g Network, Xin Liu, Xing Fan, Baoning Niu, Xianrong Zheng
Information Technology & Decision Sciences Faculty Publications
The consensus algorithm is the core technology of blockchain systems to maintain data consistency, and its performance directly affects the efficiency and security of the whole system. Practical Byzantine Fault Tolerance (PBFT) plays a crucial role in blockchain consensus algorithms by providing a robust mechanism to achieve fault-tolerant and deterministic consensus in distributed networks. With the development of 5G network technology, its features of high bandwidth, low latency, and high reliability provide a new approach for consensus algorithm optimization. To take advantage of the features of the 5G network, this paper proposes 5G-PBFT, which is an improved practical Byzantine fault-tolerant …
A Framework For Task Offloading In Heterogeneous Computing Applications Within The Fog Ran Architecture, Samira Taheri, Neda Moghim, Naser Movahhedinia, Sachin Shetty
A Framework For Task Offloading In Heterogeneous Computing Applications Within The Fog Ran Architecture, Samira Taheri, Neda Moghim, Naser Movahhedinia, Sachin Shetty
VMASC Publications
Fog Radio Access Network (Fog RAN) has recently emerged as a promising architecture for supporting low-latency applications by bringing fog nodes and cloud resources closer to end users. However, existing research on computational offloading in Fog RAN lacks a comprehensive framework that addresses three key aspects: where to offload tasks, which processing nodes to utilize, and how to allocate resources for tasks with varying latency requirements. To address this gap, we propose TOFRA (Task Offloading for Fog RAN), a novel latency-aware task offloading framework. TOFRA is a centralized system that determines the optimal offloading strategy, whether to execute tasks locally, …
Deep Reinforcement Learning With Explicit Context Representation, Francisco Munguia-Galeano, Ah-Hwee Tan, Ze Ji
Deep Reinforcement Learning With Explicit Context Representation, Francisco Munguia-Galeano, Ah-Hwee Tan, Ze Ji
Research Collection School Of Computing and Information Systems
Though reinforcement learning (RL) has shown an outstanding capability for solving complex computational problems, most RL algorithms lack an explicit method that would allow learning from contextual information. On the other hand, humans often use context to identify patterns and relations among elements in the environment, along with how to avoid making wrong actions. However, what may seem like an obviously wrong decision from a human perspective could take hundreds of steps for an RL agent to learn to avoid. This article proposes a framework for discrete environments called Iota explicit context representation (IECR). The framework involves representing each state …
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models, Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models, Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan
Research Collection School Of Computing and Information Systems
In deep learning, different kinds of deep networks typically need different optimizers, which have to be chosen after multiple trials, making the training process inefficient. To relieve this issue and consistently improve the model training speed across deep networks, we propose the ADAptive Nesterov momentum algorithm, Adan for short. Adan first reformulates the vanilla Nesterov acceleration to develop a new Nesterov momentum estimation (NME) method, which avoids the extra overhead of computing gradient at the extrapolation point. Then Adan adopts NME to estimate the gradient's first- and second-order moments in adaptive gradient algorithms for convergence acceleration. Besides, we prove that …
Win: Weight-Decay-Integrated Nesterov Acceleration For Faster Network Training, Pan Zhou, Xingyu Xie, Zhouchen Lin, Kim-Chuan Toh, Shuicheng Yan
Win: Weight-Decay-Integrated Nesterov Acceleration For Faster Network Training, Pan Zhou, Xingyu Xie, Zhouchen Lin, Kim-Chuan Toh, Shuicheng Yan
Research Collection School Of Computing and Information Systems
Training deep networks on large-scale datasets is computationally challenging. This work explores the problem of “how to accelerate adaptive gradient algorithms in a general manner", and proposes an effective Weight-decay-Integrated Nesterov acceleration (Win) to accelerate adaptive algorithms. Taking AdamW and Adam as examples, per iteration, we construct a dynamical loss that combines the vanilla training loss and a dynamic regularizer inspired by proximal point method, and respectively minimize the first- and second-order Taylor approximations of dynamical loss to update variable. This yields our Win acceleration that uses a conservative step and an aggressive step to update, and linearly combines these …
Enhancing Cyber Resilience Through Traffic Generation Patterns In Complex Networks: A Study On Cascading Failures, Aymar Le Père Tchimwa Bouom, Jean-Pierre Lienou, Wilson Ejuh Geh, Frederica Nelson, Sachin Shetty, Charles Kamhoua
Enhancing Cyber Resilience Through Traffic Generation Patterns In Complex Networks: A Study On Cascading Failures, Aymar Le Père Tchimwa Bouom, Jean-Pierre Lienou, Wilson Ejuh Geh, Frederica Nelson, Sachin Shetty, Charles Kamhoua
VMASC Publications
Network resilience is the capacity of a network to maintain and restore its fundamental operations during or after a failure. This paper investigates the resilience of communication networks with heterogeneous nodes, with host nodes that generate and receive packets and routers that only forward packets. We focus on how traffic generation patterns, defined as the distribution of data packet creation across hosts, affect network resilience. While previous studies identified optimal host placements that balance traffic loads and enhance network performance, this research explores how traffic generation patterns influence network resilience, particularly during cascading failures, where the failure of one node …
A Defensive Strategy Against Android Adversarial Malware Attacks, Fabrice Setephin Atedjio, Jean-Pierre Lienou, Frederica F. Nelson, Sachin S. Shetty, Charles A. Kamhoua
A Defensive Strategy Against Android Adversarial Malware Attacks, Fabrice Setephin Atedjio, Jean-Pierre Lienou, Frederica F. Nelson, Sachin S. Shetty, Charles A. Kamhoua
VMASC Publications
Due to the popularity of Android mobile devices over the past ten years, malicious Android applications have significantly increased. Systems utilizing machine learning techniques have been successfully applied for Android malware detection to counter the constantly changing Android malware threats. However, attackers have developed new strategies to circumvent these systems by using adversarial attacks. An attacker can carefully craft a malicious sample to deceive a classifier. Among the evasion attacks, there is the more potent one, which is based on solid optimization constraints: the Carlini-Wagner attack. Carlini-Wagner is an attack that uses margin loss, which is more efficient than cross-entropy …
Robust Test Selection For Deep Neural Networks, Weifeng Sun, Meng Yan, Zhongxin Liu, David Lo
Robust Test Selection For Deep Neural Networks, Weifeng Sun, Meng Yan, Zhongxin Liu, David Lo
Research Collection School Of Computing and Information Systems
Deep Neural Networks (DNNs) have been widely used in various domains, such as computer vision and software engineering. Although many DNNs have been deployed to assist various tasks in the real world, similar to traditional software, they also suffer from defects that may lead to severe outcomes. DNN testing is one of the most widely used methods to ensure the quality of DNNs. Such method needs rich test inputs with oracle information (expected output) to reveal the incorrect behaviors of a DNN model. However, manually labeling all the collected test inputs is a labor-intensive task, which delays the quality assurance …
Win: Weight-Decay-Integrated Nesterov Acceleration For Adaptive Gradient Algorithms, Pan Zhou, Xingyu Xie, Shuicheng Yan
Win: Weight-Decay-Integrated Nesterov Acceleration For Adaptive Gradient Algorithms, Pan Zhou, Xingyu Xie, Shuicheng Yan
Research Collection School Of Computing and Information Systems
Training deep networks on large-scale datasets is computationally challenging. In this work, we explore the problem of “how to accelerate adaptive gradient algorithms in a general manner”, and aim to provide practical efficiency-boosting insights. To this end, we propose an effective and general Weight-decay-Integrated Nesterov acceleration (Win) to accelerate adaptive algorithms. Taking AdamW and Adam as examples, we minimize a dynamical loss per iteration which combines the vanilla training loss and a dynamic regularizer inspired by proximal point method (PPM) to improve the convexity of the problem. To introduce Nesterov-alike-acceleration into AdamW and Adam, we respectively use the first- and …
Analysis Of Honeypots In Detecting Tactics, Techniques, And Procedure (Ttp) Changes In Threat Actors Based On Source Ip Address, Carson Reynolds, Andy Green
Analysis Of Honeypots In Detecting Tactics, Techniques, And Procedure (Ttp) Changes In Threat Actors Based On Source Ip Address, Carson Reynolds, Andy Green
Symposium of Student Scholars
The financial and national security impacts of cybercrime globally are well documented. According to the 2020 FBI Internet Crime Report, financially motivated threat actors committed 86% of reported breaches, resulting in a total loss of approximately $4.1 billion in the United States alone. In order to combat this, our research seeks to determine if threat actors change their tactics, techniques, and procedures (TTPs) based on the geolocation of their target’s IP address. We will construct a honeypot network distributed across multiple continents to collect attack data from geographically separate locations concurrently to answer this research question. We will configure the …
Self-Learning Algorithms For Intrusion Detection And Prevention Systems (Idps), Juan E. Nunez, Roger W. Tchegui Donfack, Rohit Rohit, Hayley Horn
Self-Learning Algorithms For Intrusion Detection And Prevention Systems (Idps), Juan E. Nunez, Roger W. Tchegui Donfack, Rohit Rohit, Hayley Horn
SMU Data Science Review
Today, there is an increased risk to data privacy and information security due to cyberattacks that compromise data reliability and accessibility. New machine learning models are needed to detect and prevent these cyberattacks. One application of these models is cybersecurity threat detection and prevention systems that can create a baseline of a network's traffic patterns to detect anomalies without needing pre-labeled data; thus, enabling the identification of abnormal network events as threats. This research explored algorithms that can help automate anomaly detection on an enterprise network using Canadian Institute for Cybersecurity data. This study demonstrates that Neural Networks with Bayesian …
Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)
Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)
Library Philosophy and Practice (e-journal)
Abstract
Purpose: The purpose of this research paper is to explore ChatGPT’s potential as an innovative designer tool for the future development of artificial intelligence. Specifically, this conceptual investigation aims to analyze ChatGPT’s capabilities as a tool for designing and developing near about human intelligent systems for futuristic used and developed in the field of Artificial Intelligence (AI). Also with the helps of this paper, researchers are analyzed the strengths and weaknesses of ChatGPT as a tool, and identify possible areas for improvement in its development and implementation. This investigation focused on the various features and functions of ChatGPT that …
Improving Connectivity For Remote Cancer Patient Symptom Monitoring And Reporting In Rural Medically Underserved Regions, Esther Max-Onakpoya
Improving Connectivity For Remote Cancer Patient Symptom Monitoring And Reporting In Rural Medically Underserved Regions, Esther Max-Onakpoya
Theses and Dissertations--Computer Science
Rural residents are often faced with many disparities when compared to their urban counterparts. Two key areas where these disparities are apparent are access to health and Internet services. Improved access to healthcare services has the potential to increase residents' quality of life and life expectancy. Additionally, improved access to Internet services can create significant social returns in increasing job and educational opportunities, and improving access to healthcare. Therefore, this dissertation focuses on the intersection between access to Internet and healthcare services in rural areas. More specifically, it attempts to analyze systems that can be used to improve Internet access …
Joint Congestion And Contention Avoidance In A Scalable Qos-Aware Opportunistic Routing In Wireless Ad-Hoc Networks, Ali Parsa, Neda Moghim, Sasan Haghani
Joint Congestion And Contention Avoidance In A Scalable Qos-Aware Opportunistic Routing In Wireless Ad-Hoc Networks, Ali Parsa, Neda Moghim, Sasan Haghani
VMASC Publications
Opportunistic routing (OR) can greatly increase transmission reliability and network throughput in wireless ad-hoc networks by taking advantage of the broadcast nature of the wireless medium. However, network congestion is a barrier in the way of OR's performance improvement, and network congestion control is a challenge in OR algorithms, because only the pure physical channel conditions of the links are considered in forwarding decisions. This paper proposes a new method to control network congestion in OR, considering three types of parameters, namely, the backlogged traffic, the traffic flows' Quality of Service (QoS) level, and the channel occupancy rate. Simulation results …
Coded Distributed Function Computation, Pedro J. Soto
Coded Distributed Function Computation, Pedro J. Soto
Dissertations, Theses, and Capstone Projects
A ubiquitous problem in computer science research is the optimization of computation on large data sets. Such computations are usually too large to be performed on one machine and therefore the task needs to be distributed amongst a network of machines. However, a common problem within distributed computing is the mitigation of delays caused by faulty machines. This can be performed by the use of coding theory to optimize the amount of redundancy needed to handle such faults. This problem differs from classical coding theory since it is concerned with the dynamic coded computation on data rather than just statically …
The Effect Of Using The Gamification Strategy On Academic Achievement And Motivation Towards Learning Problem-Solving Skills In Computer And Information Technology Course Among Tenth Grade Female Students, Mazyunah Almutairi, Prof. Ahmad Almassaad
The Effect Of Using The Gamification Strategy On Academic Achievement And Motivation Towards Learning Problem-Solving Skills In Computer And Information Technology Course Among Tenth Grade Female Students, Mazyunah Almutairi, Prof. Ahmad Almassaad
International Journal for Research in Education
Abstract
This study aimed to identify the effect of using the gamification strategy on academic achievement and motivation towards learning problem-solving skills in computer and information technology course. A quasi-experimental method was adopted. The study population included tenth-grade female students in Al-Badi’ah schools in Riyadh. The sample consisted of 54 students divided into two equal groups: control group and experimental group. The study tools comprised an achievement test and the motivation scale. The results showed that there were statistically significant differences between the two groups in the academic achievement test in favor of the experimental group, with a large effect …
Ggnb: Graph-Based Gaussian Naive Bayes Intrusion Detection System For Can Bus, Riadul Islam, Maloy K. Devnath, Manar D. Samad, Syed Md Jaffrey Al Kadry
Ggnb: Graph-Based Gaussian Naive Bayes Intrusion Detection System For Can Bus, Riadul Islam, Maloy K. Devnath, Manar D. Samad, Syed Md Jaffrey Al Kadry
Computer Science Faculty Research
The national highway traffic safety administration (NHTSA) identified cybersecurity of the automobile systems are more critical than the security of other information systems. Researchers already demonstrated remote attacks on critical vehicular electronic control units (ECUs) using controller area network (CAN). Besides, existing intrusion detection systems (IDSs) often propose to tackle a specific type of attack, which may leave a system vulnerable to numerous other types of attacks. A generalizable IDS that can identify a wide range of attacks within the shortest possible time has more practical value than attack-specific IDSs, which is not a trivial task to accomplish. In this …
Counting And Sampling Small Structures In Graph And Hypergraph Data Streams, Themistoklis Haris
Counting And Sampling Small Structures In Graph And Hypergraph Data Streams, Themistoklis Haris
Dartmouth College Undergraduate Theses
In this thesis, we explore the problem of approximating the number of elementary substructures called simplices in large k-uniform hypergraphs. The hypergraphs are assumed to be too large to be stored in memory, so we adopt a data stream model, where the hypergraph is defined by a sequence of hyperedges.
First we propose an algorithm that (ε, δ)-estimates the number of simplices using O(m1+1/k / T) bits of space. In addition, we prove that no constant-pass streaming algorithm can (ε, δ)- approximate the number of simplices using less than O( m 1+1/k / T ) bits of space. Thus …
Fake News Analysis And Graph Classification On A Covid-19 Twitter Dataset, Kriti Gupta
Fake News Analysis And Graph Classification On A Covid-19 Twitter Dataset, Kriti Gupta
Master's Projects
Earlier researches have showed that the spread of fake news through social media can have a huge impact to society and also to individuals in an extremely negative way. In this work we aim to study the spread of fake news compared to real news in a social network. We do that by performing classical social network analysis to discover various characteristics, and formulate the problem as a binary classification, where we have graphs modeling the spread of fake and real news. For our experiments we rely on how news are propagated through a popular social media services such as …
Semi-Supervised Spatial-Temporal Feature Learning On Anomaly-Based Network Intrusion Detection, Huy Mai
Semi-Supervised Spatial-Temporal Feature Learning On Anomaly-Based Network Intrusion Detection, Huy Mai
Computer Science and Computer Engineering Undergraduate Honors Theses
Due to a rapid increase in network traffic, it is growing more imperative to have systems that detect attacks that are both known and unknown to networks. Anomaly-based detection methods utilize deep learning techniques, including semi-supervised learning, in order to effectively detect these attacks. Semi-supervision is advantageous as it doesn't fully depend on the labelling of network traffic data points, which may be a daunting task especially considering the amount of traffic data collected. Even though deep learning models such as the convolutional neural network have been integrated into a number of proposed network intrusion detection systems in recent years, …
Toward A Quantum Neural Network: Proposing The Qaoa Algorithm To Replace A Feed Forward Neural Network, Erick Serrano
Toward A Quantum Neural Network: Proposing The Qaoa Algorithm To Replace A Feed Forward Neural Network, Erick Serrano
Undergraduate Research Symposium Posters
With a surge in popularity of machine learning as a whole, many researchers have sought optimization methods to reduce the complexity of neural networks; however, only recent attempts have been made to optimize neural networks via quantum computing methods. In this paper, we describe the training process of a feed forward neural network (FFNN) and the time complexity of the training process. We highlight the inefficiencies of the FFNN training process, particularly when implemented with gradient descent, and introduce a call to action for optimization of a FFNN. Afterward, we discuss the strides made in quantum computing to improve the …