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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 3271 - 3300 of 27800

Full-Text Articles in Entire DC Network

Interpretable Tensor Fusion, Saurabh Varshneya, Antoine Ledent, Philipp Liznerski, Andriy Balinskyy, Purvanshi Mehta, Waleed Mustafa, Marius Kloft Aug 2024

Interpretable Tensor Fusion, Saurabh Varshneya, Antoine Ledent, Philipp Liznerski, Andriy Balinskyy, Purvanshi Mehta, Waleed Mustafa, Marius Kloft

Research Collection School Of Computing and Information Systems

Conventional machine learning methods are predominantly designed to predict outcomes based on a single data type. However, practical applications may encompass data of diverse types, such as text, images, and audio. We introduce interpretable tensor fusion (InTense), a multimodal learning method training a neural network to simultaneously learn multiple data representations and their interpretable fusion. InTense can separately capture both linear combinations and multiplicative interactions of the data types, thereby disentangling higher-order interactions from the individual effects of each modality. InTense provides interpretability out of the box by assigning relevance scores to modalities and their associations, respectively. The approach is …

Go to article

Solving Long-Run Average Reward Robust Mdps Via Stochastic Games, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic Aug 2024

Solving Long-Run Average Reward Robust Mdps Via Stochastic Games, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic

Research Collection School Of Computing and Information Systems

Markov decision processes (MDPs) provide a standard framework for sequential decision making under uncertainty. However, MDPs do not take uncertainty in transition probabilities into account. Robust Markov decision processes (RMDPs) address this shortcoming of MDPs by assigning to each transition an uncertainty set rather than a single probability value. In this work, we consider polytopic RMDPs in which all uncertainty sets are polytopes and study the problem of solving long-run average reward polytopic RMDPs. We present a novel perspective on this problem and show that it can be reduced to solving long-run average reward turn-based stochastic games with finite state …

Go to article

Peep With A Mirror: Breaking The Integrity Of Android App Sandboxing Via Unprivileged Cache Side Channel, Yan Lin, Joshua Wong, Xiang Li, Haoyu Ma, Debin Gao Aug 2024

Peep With A Mirror: Breaking The Integrity Of Android App Sandboxing Via Unprivileged Cache Side Channel, Yan Lin, Joshua Wong, Xiang Li, Haoyu Ma, Debin Gao

Research Collection School Of Computing and Information Systems

Application sandboxing is a well-established security principle employed in the Android platform to safeguard sensitive information. However, hardware resources, specifically the CPU caches, are beyond the protection of this software-based mechanism, leaving room for potential side-channel attacks. Existing attacks against this particular weakness of app sandboxing mainly target shared components among apps, hence can only observe system-level program dynamics (such as UI tracing). In this work, we advance cache side-channel attacks by demonstrating the viability of non-intrusive and fine-grained probing across different app sandboxes, which have the potential to uncover app-specific and private program behaviors, thereby highlighting the importance of …

Go to article

Anopay: Anonymous Payment For Vehicle Parking With Updatable Credential, Yang Yang, Wenyi Xue, Yonghua Zhan, Minming Huang, Yingjiu Li, Robert H. Deng Aug 2024

Anopay: Anonymous Payment For Vehicle Parking With Updatable Credential, Yang Yang, Wenyi Xue, Yonghua Zhan, Minming Huang, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Many existing anonymous parking payment schemes lack high efficiency and flexibility. For instance, the calculation and communication costs involved in payment may linearly increase with the payment amount. In this paper, we propose an anonymous payment system (dubbed AnoPay) for vehicle parking, which leverages updatable attribute-based anonymous credentials and efficient zero-knowledge proof (ZKP) to achieve user anonymity and constant overhead for parking fee payment. To further improve the efficiency, we design a secure parking fee aggregation protocol based on linear homomorphic encryption to aggregate parking transactions, where the amount of each parking transaction is hidden and the privacy of the …

Go to article

Is Aggregation The Only Choice? Federated Learning Via Layer-Wise Model Recombination, Ming Hu, Zhihao Yue, Xiaofei Xie, Cheng Chen Chen Aug 2024

Is Aggregation The Only Choice? Federated Learning Via Layer-Wise Model Recombination, Ming Hu, Zhihao Yue, Xiaofei Xie, Cheng Chen Chen

Research Collection School Of Computing and Information Systems

Although Federated Learning (FL) enables global model training Xiaofei Xie [email protected] Singapore Management University Singapore, Singapore Xian Wei [email protected] East China Normal University Shanghai, China Mingsong Chen∗ [email protected] East China Normal University Shanghai, China • Computing methodologies → Distributed artificial intelligence. across clients without compromising their raw data, due to the unevenly distributed data among clients, existing Federated Averaging (FedAvg)-based methods suffer from the problem of low inference performance. Specifically, different data distributions among clients lead to various optimization directions of local models. Aggregating local models usually results in a low-generalized global model, which performs worse on most of the …

Go to article

Sibo : A Simple Booster For Parameter-Efficient Fine-Tuning, Zhihao Wen, Jie Zhang, Yuan Fang Aug 2024

Sibo : A Simple Booster For Parameter-Efficient Fine-Tuning, Zhihao Wen, Jie Zhang, Yuan Fang

Research Collection School Of Computing and Information Systems

Fine-tuning all parameters of large language models (LLMs) necessitates substantial computational power and extended time. Latest advancements in parameter-efficient fine-tuning (PEFT) techniques, such as Adapter tuning and LoRA, allow for adjustments to only a minor fraction of the parameters of these LLMs. Concurrently, it has been noted that the issue of over-smoothing diminishes the effectiveness of these Transformer-based LLMs, resulting in suboptimal performances in downstream tasks. In this paper, we present SIBO, which is a SImple BOoster to enhance PEFT, by injecting an initial residual. SIBO is straightforward and readily extensible to a range of state-of-the-art PEFT techniques to alleviate …

Go to article

Planning Like Human : A Dual-Process Framework For Dialogue Planning, Tao He, Lizi Liao, Yixin Cao, Yuanxing Liu, Ming Liu, Zerui Chen, Bing Qin Aug 2024

Planning Like Human : A Dual-Process Framework For Dialogue Planning, Tao He, Lizi Liao, Yixin Cao, Yuanxing Liu, Ming Liu, Zerui Chen, Bing Qin

Research Collection School Of Computing and Information Systems

In proactive dialogue, the challenge lies not just in generating responses but in steering conversations toward predetermined goals, a task where Large Language Models (LLMs) typically struggle due to their reactive nature. Traditional approaches to enhance dialogue planning in LLMs, ranging from elaborate prompt engineering to the integration of policy networks, either face efficiency issues or deliver suboptimal performance. Inspired by the dual-process theory in psychology, which identifies two distinct modes of thinking—intuitive (fast) and analytical (slow), we propose the Dual-Process Dialogue Planning (DPDP) framework. DPDP embodies this theory through two complementary planning systems: an instinctive policy model for familiar …

Go to article

Analyzing Temporal Complex Events With Large Language Models? A Benchmark Towards Temporal, Long Context Understanding, Zhihan Zhang, Yixin Cao, Chenchen Ye, Ma. Yunshan, Lizi Liao, Tat-Seng Chua Aug 2024

Analyzing Temporal Complex Events With Large Language Models? A Benchmark Towards Temporal, Long Context Understanding, Zhihan Zhang, Yixin Cao, Chenchen Ye, Ma. Yunshan, Lizi Liao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

The digital landscape is rapidly evolving with an ever-increasing volume of online news, emphasizing the need for swift and precise analysis of complex events.We refer to the complex events composed of many news articles over an extended period as Temporal Complex Event (TCE). This paper proposes a novel approach using Large Language Models (LLMs) to systematically extract and analyze the event chain within TCE, characterized by their key points and timestamps. We establish a benchmark, named TCELongBench, to evaluate the proficiency of LLMs in handling temporal dynamics and understanding extensive text. This benchmark encompasses three distinct tasks - reading comprehension, …

Go to article

Synergizing Large Language Models And Pre-Trained Smaller Models For Conversational Intent Discovery, Jinggui Liang, Lizi Liao, Hao Fei, Jing Jiang Aug 2024

Synergizing Large Language Models And Pre-Trained Smaller Models For Conversational Intent Discovery, Jinggui Liang, Lizi Liao, Hao Fei, Jing Jiang

Research Collection School Of Computing and Information Systems

In Conversational Intent Discovery (CID), Small Language Models (SLMs) struggle with overfitting to familiar intents and fail to label newly discovered ones. This issue stems from their limited grasp of semantic nuances and their intrinsically discriminative framework. Therefore, we propose Synergizing Large Language Models (LLMs) with pre-trained SLMs for CID (SynCID). It harnesses the profound semantic comprehension of LLMs alongside the operational agility of SLMs. By utilizing LLMs to refine both utterances and existing intent labels, SynCID significantly enhances the semantic depth, subsequently realigning these enriched descriptors within the SLMs’ feature space to correct cluster distortion and promote robust learning …

Go to article

Speaker Verification In Agent-Generated Conversations, Yizhe Yang, Palakorn Achananuparp, Heyan Huang, Jing Jiang, Ee-Peng Lim Aug 2024

Speaker Verification In Agent-Generated Conversations, Yizhe Yang, Palakorn Achananuparp, Heyan Huang, Jing Jiang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

The recent success of large language models (LLMs) has attracted widespread interest to develop role-playing conversational agents personalized to the characteristics and styles of different speakers to enhance their abilities to perform both general and special purpose dialogue tasks. However, the ability to personalize the generated utterances to speakers, whether conducted by human or LLM, has not been well studied. To bridge this gap, our study introduces a novel evaluation challenge: speaker verification in agent-generated conversations, which aimed to verify whether two sets of utterances originate from the same speaker. To this end, we assemble a large dataset collection encompassing …

Go to article

Towards Gradient-Based Time-Series Explanations Through A Spatiotemporal Attention Network, Min Hun Lee Aug 2024

Towards Gradient-Based Time-Series Explanations Through A Spatiotemporal Attention Network, Min Hun Lee

Research Collection School Of Computing and Information Systems

In this paper, we explore the feasibility of using a transformer-based, spatiotemporal attention network (STAN) for gradient-based time-series explanations. First, we trained the STAN model for video classifications using the global and local views of data and weakly supervised labels on time-series data (i.e. the type of an activity). We then leveraged a gradient-based XAI technique (e.g. saliency map) to identify salient frames of time-series data. According to the experiments using the datasets of four medically relevant activities, the STAN model demonstrated its potential to identify important frames of videos.

Go to article

Value-Based Subgoal Discovery And Path Planning For Reaching Long-Horizon Goals, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek Aug 2024

Value-Based Subgoal Discovery And Path Planning For Reaching Long-Horizon Goals, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek

Research Collection School Of Computing and Information Systems

Learning to reach long-horizon goals in spatial traversal tasks is a significant challenge for autonomous agents. Recent subgoal graph-based planning methods address this challenge by decomposing a goal into a sequence of shorter-horizon subgoals. These methods, however, use arbitrary heuristics for sampling or discovering subgoals, which may not conform to the cumulative reward distribution. Moreover, they are prone to learning erroneous connections (edges) between subgoals, especially those lying across obstacles. To address these issues, this article proposes a novel subgoal graph-based planning method called learning subgoal graph using value-based subgoal discovery and automatic pruning (LSGVP). The proposed method uses a …

Go to article

Larp: Language Audio Relational Pre‑Training For Cold‑Start Playlist Continuation, Rebecca Salganik, Xiaohao Liu, Yunshan Ma, Jian Kang, Tat‑Seng Chua Aug 2024

Larp: Language Audio Relational Pre‑Training For Cold‑Start Playlist Continuation, Rebecca Salganik, Xiaohao Liu, Yunshan Ma, Jian Kang, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

As online music consumption increasingly shifts towards playlist-based listening, the task of playlist continuation, in which an algorithm suggests songs to extend a playlist in a personalized and musically cohesive manner, has become vital to the success of music streaming services. Currently, many existing playlist continuation approaches rely on collaborative filtering methods to perform their recommendations. However, such methods will struggle to recommend songs that lack interaction data, an issue known as the cold-start problem. Current approaches to this challenge design complex mechanisms for extracting relational signals from sparse collaborative signals and integrating them into content representations. However, these approaches …

Go to article

An Llm-Assisted Easy-To-Trigger Poisoning Attack On Code Completion Models: Injecting Disguised Vulnerabilities Against Strong Detection, Shenao Yan, Shen Wang, Yue Duan, Hanbin Hong, Kiho Lee, Doowon Kim, Yuan Hong Aug 2024

An Llm-Assisted Easy-To-Trigger Poisoning Attack On Code Completion Models: Injecting Disguised Vulnerabilities Against Strong Detection, Shenao Yan, Shen Wang, Yue Duan, Hanbin Hong, Kiho Lee, Doowon Kim, Yuan Hong

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have transformed code completion tasks, providing context-based suggestions to boost developer productivity in software engineering. As users often fine-tune these models for specific applications, poisoning and backdoor attacks can covertly alter the model outputs. To address this critical security challenge, we introduce CODEBREAKER, a pioneering LLM-assisted backdoor attack framework on code completion models. Unlike recent attacks that embed malicious payloads in detectable or irrelevant sections of the code (e.g., comments), CODEBREAKER leverages LLMs (e.g., GPT-4) for sophisticated payload transformation (without affecting functionalities), ensuring that both the poisoned data for fine-tuning and generated code can evade strong …

Go to article

Nonfactoid Question Answering As Query-Focused Summarization With Graph-Enhanced Multihop Inference, Yang Deng, Wenxuan Zhang, Weiwen Xu, Ying Shen, Wai Lam Aug 2024

Nonfactoid Question Answering As Query-Focused Summarization With Graph-Enhanced Multihop Inference, Yang Deng, Wenxuan Zhang, Weiwen Xu, Ying Shen, Wai Lam

Research Collection School Of Computing and Information Systems

Nonfactoid question answering (QA) is one of the most extensive yet challenging applications and research areas in natural language processing (NLP). Existing methods fall short of handling the long-distance and complex semantic relations between the question and the document sentences. In this work, we propose a novel query-focused summarization method, namely a graph-enhanced multihop query-focused summarizer (GMQS), to tackle the nonfactoid QA problem. Specifically, we leverage graph-enhanced reasoning techniques to elaborate the multihop inference process in nonfactoid QA. Three types of graphs with different semantic relations, namely semantic relevance, topical coherence, and coreference linking, are constructed for explicitly capturing the …

Go to article

Neural Network Semantic Backdoor Detection And Mitigation: A Causality-Based Approach, Bing Sun, Jun Sun, Wayne Koh, Jie Shi Aug 2024

Neural Network Semantic Backdoor Detection And Mitigation: A Causality-Based Approach, Bing Sun, Jun Sun, Wayne Koh, Jie Shi

Research Collection School Of Computing and Information Systems

Different from ordinary backdoors in neural networks which are introduced with artificial triggers (e.g., certain specific patch) and/or by tampering the samples, semantic backdoors are introduced by simply manipulating the semantic, e.g., by labeling green cars as frogs in the training set. By focusing on samples with rare semantic features (such as green cars), the accuracy of the model is often minimally affected. Since the attacker is not required to modify the input sample during training nor inference time, semantic backdoors are challenging to detect and remove. Existing backdoor detection and mitigation techniques are shown to be ineffective with respect …

Go to article

On The Multi-Turn Instruction Following For Conversational Web Agents, Yang Deng, Xuan Zhang, Wenxuan Zhang, Yifei Yuan, See-Kiong Ng, Tat-Seng Chua Aug 2024

On The Multi-Turn Instruction Following For Conversational Web Agents, Yang Deng, Xuan Zhang, Wenxuan Zhang, Yifei Yuan, See-Kiong Ng, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Web agents powered by Large Language Models (LLMs) have demonstrated remarkable abilities in planning and executing multi-step interactions within complex web-based environments, fulfilling a wide range of web navigation tasks. Despite these advancements, the potential for LLM-powered agents to effectively engage with sequential user instructions in real-world scenarios has not been fully explored. In this work, we introduce a new task of Conversational Web Navigation, which necessitates sophisticated interactions that span multiple turns with both the users and the environment, supported by a specially developed dataset named Multi-Turn Mind2Web (MT-Mind2Web). To tackle the limited context length of LLMs and the …

Go to article

Clamber: A Benchmark Of Identifying And Clarifying Ambiguous Information Needs In Large Language Models, Tong Zhang, Peixin Qin, Yang Deng, Chen Huang, Wenqiang Lei, Junhong Liu, Dingnan Jin, Hongru Liang, Tat-Seng Chua Aug 2024

Clamber: A Benchmark Of Identifying And Clarifying Ambiguous Information Needs In Large Language Models, Tong Zhang, Peixin Qin, Yang Deng, Chen Huang, Wenqiang Lei, Junhong Liu, Dingnan Jin, Hongru Liang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Large language models (LLMs) are increasingly used to meet user information needs, but their effectiveness in dealing with user queries that contain various types of ambiguity remains unknown, ultimately risking user trust and satisfaction. To this end, we introduce CLAMBER, a benchmark for evaluating LLMs using a well-organized taxonomy. Building upon the taxonomy, we construct 12K high-quality data to assess the strengths, weaknesses, and potential risks of various off-the-shelf LLMs.Our findings indicate the limited practical utility of current LLMs in identifying and clarifying ambiguous user queries, even enhanced by chain-of-thought (CoT) and few-shot prompting. These techniques may result in overconfidence …

Go to article

Prompt Tuning On Graph-Augmented Low-Resource Text Classification, Zhihao Wen, Yuan Fang Aug 2024

Prompt Tuning On Graph-Augmented Low-Resource Text Classification, Zhihao Wen, Yuan Fang

Research Collection School Of Computing and Information Systems

Text classification is a fundamental problem in information retrieval with many real-world applications, such as predicting the topics of online articles and the categories of e-commerce product descriptions. However, low-resource text classification, with no or few labeled samples, presents a serious concern for supervised learning. Meanwhile, many text data are inherently grounded on a network structure, such as a hyperlink/citation network for online articles, and a user-item purchase network for e-commerce products. These graph structures capture rich semantic relationships, which can potentially augment low-resource text classification. In this paper, we propose a novel model called Graph-Grounded Pre-training and Prompting (G2P2) …

Go to article

Intrinsic Universality In Tile Automata And Related Results, Elise C. Grizzell Aug 2024

Intrinsic Universality In Tile Automata And Related Results, Elise C. Grizzell

Theses and Dissertations

The Tile Automata (TA) model describes self-assembly systems in which monomers can build structures and transition with an adjacent monomer to change their states. This paper shows that seeded TA is a non-committal intrinsically universal model of self-assembly. We present a single universal Tile Automata system containing approximately 4600 states that can simulate (a) the output assemblies created by any other Tile Automata system Γ, (b) the dynamics involved in building Γ’s assemblies, and (c) Γ’s internal state transitions. It does so in a non-committal way: it preserves the full non-deterministic dynamics of a tile’s potential attachment or transition by …

Go to article

Use Of Computational Methods To Determine The Relative Thermodynamic Stability Of Myricetin, Quercetin And 4-Methylesculetin For Use As Spin Traps, Cole Walker Aug 2024

Use Of Computational Methods To Determine The Relative Thermodynamic Stability Of Myricetin, Quercetin And 4-Methylesculetin For Use As Spin Traps, Cole Walker

Electronic Theses and Dissertations

The research conducted focused on the oxidative intermediates of antioxidants known as Myricetin, Quercetin, and 4-Methylesutin by calculating the reaction mechanism. During this research, computational quantum chemistry on selected parts for the 3 antioxidants previously mentioned were performed to find the most stable intermediate to act as a spin trap. The hypothesis is that the intermediates found can act as spin traps which will allow longer preservation of a free radical to be identified using Electron Paramagnetic Resonance (EPR) spectroscopy. This may be because the buildup of excess free radicals in a system leads them to cause damage down to …

Go to article

Sociomathematical Norms And Automated Proof Checking In Mathematical Education: Reflections And Experiences, Merlin Carl Jul 2024

Sociomathematical Norms And Automated Proof Checking In Mathematical Education: Reflections And Experiences, Merlin Carl

Journal of Humanistic Mathematics

According to a widely held view, mathematical proofs are essentially (indications of) formal derivations, and thus in principle mechanically checkable (this view is defended, for example, by Azzouni [3]). This should in particular hold for the kind of simple proof exercises typically given to students of mathematics learning to write proofs. If that is so, then automated proof checking should be an attractive option for math education at the undergraduate level. An opposing view would be that mathematical proofs are social objects and that what constitutes a mathematical proof can thus not be separated from the social context in which …

Go to article

Maximizing Generative Ai Benefits With Task Creativity And Human Validation, Charu Sinha, Veselina P. Vracheva, Cristina Nistor Jul 2024

Maximizing Generative Ai Benefits With Task Creativity And Human Validation, Charu Sinha, Veselina P. Vracheva, Cristina Nistor

Business Faculty Articles and Research

Much of the existing literature on generative AI applications is conflicting, with findings suggesting that investing in AI will lead to better organizational outcomes but also pointing out that incorporating AI may be a wasteful even counterproductive initiative. We develop a conceptual frame-work to characterize generative AI benefits based on the types of tasks that generative AI may be used for in management. Our work suggests that task creativity plays a key role in successful generative AI outcomes, but human validation - the extent to which a human engages in a supervisory role - is required to reap the benefits. …

Go to article

Increasing The Robustness Of Machine Learning By Adversarial Attacks, Gourab Mukhopadhyay Jul 2024

Increasing The Robustness Of Machine Learning By Adversarial Attacks, Gourab Mukhopadhyay

Theses and Dissertations

By perturbation or physical attacks any machine can be fooled into predicting something else other than the intended output. There are training data based on which the model is trained to predict unknown things. The objective was to create noises and shades of different levels on the images and do experiments for measuring accuracy and making the model classify the traffic signs. When it comes to adding shades to the pictures, pixels were modified for three different layers of the pictures. The experiment also shows that with the shadows getting deeper, the accuracies drop significantly. Here, some changes in pixels …

Go to article

Low-Resource Automatic Speech Recognition Domain Adaptation – A Case-Study In Aviation Maintenance, Nadine Amin, Tracy L. Yother, Julia Rayz Jul 2024

Low-Resource Automatic Speech Recognition Domain Adaptation – A Case-Study In Aviation Maintenance, Nadine Amin, Tracy L. Yother, Julia Rayz

Journal of Aviation/Aerospace Education & Research

With timeliness and efficiency being critical in the aviation maintenance industry, the need has been growing for smart technological solutions that optimize and streamline the different underlying tasks (Bergkvist & Sabbagh, 2021). One such task is the technical documentation of the performed maintenance operations (Chandola et al., 2022). Instead of manual documentation, voice tools that transcribe spoken logbook entries allow technicians to document their work right away in a hands-free and time efficient manner. However, an accurate automatic speech recognition (ASR) model requires large training corpora (Siyaev & Jo, 2021a), which are lacking in the domain of aviation maintenance. In …

Go to article

An Enhanced Deep Autoencoder For Flight Delay Prediction, Desmond B. Bisandu, Dan Andrei Soviani-Sitoiu, Irene Moulitsas Jul 2024

An Enhanced Deep Autoencoder For Flight Delay Prediction, Desmond B. Bisandu, Dan Andrei Soviani-Sitoiu, Irene Moulitsas

Journal of Aviation/Aerospace Education & Research

Accurate and timely flight delay prediction cannot be overemphasized because of the ever-increasing demand for air travel and its importance in deploying intelligent transportation systems. Nonetheless, there has not been a universal solution to the problem, as more intelligent flight decision systems are required for the aviation industry's future growth. Existing flight delay classification and prediction approaches are mainly shallow traffic models and do not satisfy many applications in the real world. Our motivation to rethink the deep architecture model for predicting flight delays emanates from the problem. In this research, we proposed a technique that modified stacked autoencoder architecture …

Go to article

Smart Airports: Artificial Intelligence–Enabled Internet Of Things Networks Using Blockchain Technology, Edwin Ongola Jul 2024

Smart Airports: Artificial Intelligence–Enabled Internet Of Things Networks Using Blockchain Technology, Edwin Ongola

Journal of Aviation Technology and Engineering

This article provides a perspective on how an internet of heterogeneous self-service airport terminal systems can be used for data collection, which is stored on a private or consortium blockchain depending on the ownership or operations of an airport or both. Such a setup would help to increase efficiency, reduce costs, and improve traveler experience at airport terminals. Moreover, it would allow airports to gather data directly from passengers as opposed to waiting to receive the same data from airlines. Subsequently, this data, now on a blockchain system, becomes a data source for other applications such as machine learning. In …

Go to article

Personalized Driving Using Inverse Reinforcement Learning, Rodrigo J. Gonzalez Salinas Jul 2024

Personalized Driving Using Inverse Reinforcement Learning, Rodrigo J. Gonzalez Salinas

Theses and Dissertations

This thesis introduces an autonomous driving controller designed to replicate individual driving behaviors based on a provided demonstration. The controller employs Inverse Reinforcement Learning (IRL) to formulate the reward function associated with the provided demonstration. IRL is implemented through a dual-feedback loop system. The inner loop utilizes Q-learning, a model-free reinforcement learning technique, to optimize the Hamilton-Jacobi-Bellman (HJB) equation and derive an appropriate control solution. The outer loop leverages this derived control solution to generate parameters for the reward function, which are subsequently integrated into the HJB equation. The ultimate control policy is deduced from the final reward function obtained …

Go to article

Freedom As The Physical Notion. Mechanics Of A Material Point, Michael Vigdorowitsch Jul 2024

Freedom As The Physical Notion. Mechanics Of A Material Point, Michael Vigdorowitsch

Karbala International Journal of Modern Science

This is a novel conceptual attempt to introduce freedom as a consistent physical notion. The present consideration is limited to mechanics of a material point. Adapted to physical representation, freedom is tested throughout the paper to conform to its general perception. It is first tried on such physical notions (but not restricted to) as potency of a set, Lagrangian, action, degrees of freedom. Defined as angular and essentially nonlinear variable, it appears to be dual as that the domain affords and that the material point possesses within the domain, not necessarily equal to one another. Freedom has to degrade if …

Go to article

A New Approach: Ordinal Predictive Maintenance With Ensemble Binary Decomposition (Opmeb), Ozlem Ece Yurek, Derya Birant Jul 2024

A New Approach: Ordinal Predictive Maintenance With Ensemble Binary Decomposition (Opmeb), Ozlem Ece Yurek, Derya Birant

Turkish Journal of Electrical Engineering and Computer Sciences

Predictive maintenance (PdM), a fundamental element of modern industrial systems, employs machine learning to monitor equipment conditions, estimate failure probabilities, and optimize maintenance schedules. Its core objective is to enhance equipment reliability, extend lifespan, and minimize costs through data-driven insights by enabling efficient maintenance scheduling, reducing downtime, and optimizing resource allocation. In this paper, we propose a novel ordinal predictive maintenance with ensemble binary decomposition (OPMEB) method for the PdM domain, considering the hierarchical nature of class labels reflecting the machine's health status, including categories like healthy, low risk, moderate risk, and high risk. The proposed OPMEB method was validated …

Go to article

First Prev Next Last