Physical Sciences and Mathematics Commons^™

Survey Of Planar And Outerplanar Graphs In Fuzzy And Neutrosophic Graphs, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

As many readers may know, graph theory is a fundamental branch of mathematics that explores networks made up of nodes and edges, focusing on their paths, structures, and properties [196]. A planar graph is one that can be drawn on a plane without any edges intersecting, ensuring planarity. Outerplanar graphs, a subset of planar graphs, have all their vertices located on the boundary of the outer face in their planar embedding. In recent years, outerplanar graphs have been formally defined within the context of fuzzy graphs. To capture uncertain parameters and concepts, various graphs such as fuzzy, neutrosophic, Turiyam, and …

Fundamental Computational Problems And Algorithms For Superhypergraphs, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Hypergraphs extend traditional graphs by allowing edges (known as hyperedges) to connect more than two vertices, rather than just pairs. This paper explores fundamental problems and algorithms in the context of SuperHypergraphs, an advanced extension of hypergraphs enabling modeling of hierarchical and complex relationships. Topics covered include constructing SuperHyperGraphs, recognizing SuperHyperTrees, and computing SuperHyperTree-width. We address a range of optimization problems, such as the SuperHy-pergraph Partition Problem, Reachability, Minimum Spanning SuperHypertree, and Single-Source Shortest Path. Furthermore, adaptations of classical problems like the Traveling Salesman Problem, Chinese Postman Problem, and Longest Simple Path Problem are presented in the SuperHypergraph framework.

Breve Introducción A Los Conjuntos Y A La Lógica Neutrosófica Estándar Y No Estándar, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Se recuerdan las definiciones de Conjunto Neutrosófico de Valor Único (SVNS), Conjunto Neutrosófico de Valor Intervalo (IVNS), Conjunto Neutrosófico de Valor Subconjunto (SVNS) y, respectivamente, Conjunto Neutrosófico No Estándar [Con Valor Único ( SVNS NoS ), Con Valor Intervalo ( IVNS NoS ) y Con Valor Subconjunto ( SVNS NoS )], junto con sus operadores. De manera similar, para Conjunto Neutrosófico Estándar y No Estándar.

A Review At Two Nuclear Reactor Problems In Asia, Victor Christianto, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

The development of nuclear power plants (NPP) is often a heated debate, especially in developing countries [1]. In relation to this, it is worth the public's attention that lately, it seems that there have been increasingly frequent press releases from various parties representing the government regarding plans to build the first nuclear fission reactor in Indonesia in the not too distant future. Reportedly there will be a large amount of additional energy supply planned (around 100 GW to be built in Indonesia within the coming decade). For this reason, the authors would like to invite readers to take a moment …

A Right-Brain-Based Epistemology Grounded On Local Wisdom: Intuilytics As A Culturally-Meaningful Alternative In Science, Victor Christianto, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Epistemology, the study of knowledge, has long grappled with the challenge of determining truth. While the combination of deductive and inductive reasoning has been a cornerstone of scientific inquiry, several limitations emerge in its application to contemporary epistemology. One significant issue lies within the core of falsificationism, a prominent philosophy championed by Karl Popper. Falsificationism posits that a scientific theory can only be proven false, not true. While this approach aims to prevent dogmatic adherence to untested ideas, it can lead to an endless cycle of trial and error. As Popper himself acknowledged, no single experiment can definitively prove a …

A Review Of The Hierarchy Of Plithogenic, Neutrosophic, And Fuzzy Graphs: Survey And Applications, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

As many readers may know, graph theory is a fundamental branch of mathematics that examines networks consisting of nodes and edges, with a focus on their paths, structures, and properties [157]. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, capturing the level of uncertainty. Expanding on this idea, the Turiyam Neutrosophic Graph was introduced as an extension of both Neutrosophic and Fuzzy Graphs. Plithogenic graphs, in turn, offer a powerful approach for managing uncertainty. In this paper, we explore the relationships among various graph classes, including Plithogenic graphs, …

Decision Making In The Case Of Confirmed Data Neutrosophic Linear Models To Choose The Advertising Medium, Maissam Ahmad Jdid, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In light of the great development witnessed by our contemporary world, it has become necessary to focus on scientific methods and use the quantitative method to reach more accurate decisions, appropriate to the surrounding circumstances and factors. The process of decision-making and choosing the optimal alternative depends on the type and quality of data that describes the issue for which the decision is to be made. Regarding it, in this chapter we present a study of the issue of determining the ideal advertising medium to display a company’s products. This issue is considered one of the issues of decision-making in …

Recreational Mathematics: Where Is The Error?, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This short note is a funny problem for the trigonometry students!.

Soft Sets Extensions Used In Bioinformatics, Florentin Smarandache, Daniela Gifu

Branch Mathematics and Statistics Faculty and Staff Publications

This comprehensive review delves into the intricate realm of Soft Sets and their extensions, including HyperSoft Set, IndetermSoft Set, IndetermHyperSoft Set, and TreeSoft Set, within the context of biomedical data analysis. Soft Sets serve as a foundational framework for managing the inherent uncertainty and imprecision inherent in biological data, thereby facilitating informed decision-making and knowledge discovery. The exploration of Soft Set Products, particularly in the context of multiple soft sets, underscores their pivotal role in advancing biomedical research. By extending these concepts to HyperSoft Sets, researchers can unlock deeper insights into complex biological phenomena, enabling more accurate predictions and classification.

Logical Pluralism And Neutrosophy: Reflections On The Nature Of Truth, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

The article explores the shift from classical binary logic (true and false) to a more complex landscape of logical frameworks. It introduces logical pluralism, which suggests that no single, universally accepted system of logic exists. The paper connects this idea to neutrosophy, a framework that extends fuzzy logic by incorporating a third value: indeterminacy. This triadic approach, where every proposition has a degree of truth (T), falsity (F), and indeterminacy (I), is particularly useful for managing incomplete or contradictory information. The author argues that different logical systems, like different tools, are suited for different problems, and that the …

Privobfnet: A Weakly Supervised Semantic Segmentation Model For Data Protection, Chiat Pin Tay, Vigneshwaran Subbaraju, Thivya Kandappu

Research Collection School Of Computing and Information Systems

The use of social media has made it easy to communicate and share information over the internet. However, it also brings issues such as data privacy leakage, which can be exploited by recipients with malicious intentions to harm the sender. In this paper, we propose a deep neural network that analyzes user’s image for privacy sensitive content and automatically locates sensitive regions for obfuscation. Our approach relies solely on image level annotations and learns to (a) predict an overall privacy score, (b) detect sensitive attributes and (c) demarcate the sensitive regions for obfuscation, in a given input image. We validated …

A Secure And Robust Knowledge Transfer Framework Via Stratified-Causality Distribution Adjustment In Intelligent Collaborative Services, Ju Jia, Siqi Ma, Lina Wang, Yang Liu, Robert H. Deng

Research Collection School Of Computing and Information Systems

The rapid development of device-edge-cloud collaborative computing techniques has actively contributed to the popularization and application of intelligent service models. The intensity of knowledge transfer plays a vital role in enhancing the performance of intelligent services. However, the existing knowledge transfer methods are mainly implemented through data fine-tuning and model distillation, which may cause the leakage of data privacy or model copyright in intelligent collaborative systems. To address this issue, we propose a secure and robust knowledge transfer framework through stratified-causality distribution adjustment (SCDA) for device-edge-cloud collaborative services. Specifically, a simple yet effective density-based estimation is first employed to obtain …

Causal Disentangled Recommendation Against User Preference Shifts, Wenjie Wang, Xinyu Lin, Liuhui Wang, Fuli Feng, Yunshan Ma, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

Recommender systems easily face the issue of user preference shifts. User representations will become outof-date and lead to inappropriate recommendations if user preference has shifted over time. To solve theissue, existing work focuses on learning robust representations or predicting the shifting pattern. Therelacks a comprehensive view to discover the underlying reasons for user preference shifts. To understand thepreference shift, we abstract a causal graph to describe the generation procedure of user interaction sequences.Assuming user preference is stable within a short period, we abstract the interaction sequence as a set ofchronological environments. From the causal graph, we find that the changes …

Glance To Count: Learning To Rank With Anchors For Weakly-Supervised Crowd Counting, Zheng Xiong, Liangyu Chai, Wenxi Liu, Yongtuo Liu, Sucheng Ren, Shengfeng He

Research Collection School Of Computing and Information Systems

Crowd image is arguably one of the most laborious data to annotate. In this paper, we devote to reduce the massive demand of densely labeled crowd data, and propose a novel weakly-supervised setting, in which we leverage the binary ranking of two images with highcontrast crowd counts as training guidance. To enable training under this new setting, we convert the crowd count regression problem to a ranking potential prediction problem. In particular, we tailor a Siamese Ranking Network that predicts the potential scores of two images indicating the ordering of the counts. Hence, the ultimate goal is to assign appropriate …

Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao

Research Collection School Of Computing and Information Systems

The cooperative delivery of trucks and drones promises considerable advantages in delivery efficiency and environmental friendliness over pure fossil fuel fleets. As the prosperity of rural B2C e-commerce grows, this study intends to explore the prospect of this cooperation mode for rural last-mile delivery by developing a green vehicle routing problem with drones that considers the presence of steep roads (GVRPD-SR). Realistic energy consumption calculations for trucks and drones that both consider the impacts of general factors and steep roads are incorporated into the GVRPD-SR model, and the objective is to minimize the total energy consumption. To solve the proposed …

Affinity Uncertainty-Based Hard Negative Mining In Graph Contrastive Learning, Chaoxi Niu, Guansong Pang, Ling Chen

Research Collection School Of Computing and Information Systems

Hard negative mining has shown effective in enhancing self-supervised contrastive learning (CL) on diverse data types, including graph CL (GCL). The existing hardness-aware CL methods typically treat negative instances that are most similar to the anchor instance as hard negatives, which helps improve the CL performance, especially on image data. However, this approach often fails to identify the hard negatives but leads to many false negatives on graph data. This is mainly due to that the learned graph representations are not sufficiently discriminative due to oversmooth representations and/or non-independent and identically distributed (non-i.i.d.) issues in graph data. To tackle this …

Remote Multi-Person Heart Rate Monitoring With Smart Speakers: Overcoming Separation Constraint, Ngoc Doan Thu Tran, Dong Ma, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Heart rate is a key vital sign that can be used to understand an individual’s health condition. Recently, remote sensing techniques, especially acoustic-based sensing, have received increasing attention for their ability to non-invasively detect heart rate via commercial mobile devices such as smartphones and smart speakers. However, due to signal interference, existing methods have primarily focused on monitoring a single user and required a large separation between them when monitoring multiple people. These limitations hinder many common use cases such as couples sharing the same bed or two or more people located in close proximity. In this paper, we present …

Provably Secure Decisions Based On Potentially Malicious Information, Dongxia Wang, Tim Muller, Jun Sun

Research Collection School Of Computing and Information Systems

There are various security-critical decisions routinely made, on the basis of information provided by peers: routing messages, user reports, sensor data, navigational information, blockchain updates, etc. Jury theorems were proposed in sociology to make decisions based on information from peers, which assume peers may be mistaken with some probability. We focus on attackers in a system, which manifest as peers that strategically report fake information to manipulate decision making. We define the property of robustness: a lower bound probability of deciding correctly, regardless of what information attackers provide. When peers are independently selected, we propose an optimal, robust decision mechanism …

Active Code Learning: Benchmarking Sample-Efficient Training Of Code Models, Qiang Hu, Yuejun Guo, Xiaofei Xie, Maxime Cordy, Lei Ma, Mike Papadakis, Yves Le Traon

Research Collection School Of Computing and Information Systems

The costly human effort required to prepare the training data of machine learning (ML) models hinders their practical development and usage in software engineering (ML4Code), especially for those with limited budgets. Therefore, efficiently training models of code with less human effort has become an emergent problem. Active learning is such a technique to address this issue that allows developers to train a model with reduced data while producing models with desired performance, which has been well studied in computer vision and natural language processing domains. Unfortunately, there is no such work that explores the effectiveness of active learning for code …

Dynamic Meta-Path Guided Temporal Heterogeneous Graph Neural Networks, Yugang Ji, Chuan Shi, Yuan Fang

Research Collection School Of Computing and Information Systems

Graph Neural Networks (GNNs) have become the de facto standard for representation learning on topological graphs, which usually derive effective node representations via message passing from neighborhoods. Although GNNs have achieved great success, previous models are mostly confined to static and homogeneous graphs. However, there are multiple dynamic interactions between different-typed nodes in real-world scenarios like academic networks and e-commerce platforms, forming temporal heterogeneous graphs (THGs). Limited work has been done for representation learning on THGs and the challenges are in two aspects. First, there are abundant dynamic semantics between nodes while traditional techniques like meta-paths can only capture static …

Enabling Ai And Robotic Coaches For Physical Rehabilitation Therapy: Iterative Design And Evaluation With Therapists And Post-Stroke Survivors, Min Hun Lee, Daniel Siewiorek, Asim Smailagic, Alexandre Bernardino, Sergi Bermúdez I Badia

Research Collection School Of Computing and Information Systems

Artificial intelligence (AI) and robotic coaches promise the improved engagement of patients on rehabilitation exercises through social interaction. While previous work explored the potential of automatically monitoring exercises for AI and robotic coaches, the deployment of these systems remains a challenge. Previous work described the lack of involving stakeholders to design such functionalities as one of the major causes. In this paper, we present our efforts on eliciting the detailed design specifications on how AI and robotic coaches could interact with and guide patient’s exercises in an effective and acceptable way with four therapists and five post-stroke survivors. Through iterative …

A Computerized Mastitis Classification Aid Using A Dairy Herd-Based Records: Multi-Layer Perceptron (Mlp) Neural Network With Backpropagation Approach, Ahmed M. Gad Prof, Dina Faris De, Sherif Ramadan Prof, Ghada Afifi Dr, Eman Manaa Prof, Mahmoud El-Tarabany Prof

Business Administration

The main objective of this study is to develop an efficient machine learning-based model for the early prediction of clinical mastitis in Holstein Friesian dairy cattle where automatic milking system (AMS) data is used. The model aims to offer a costless opportunity for mastitis control and reduce its negative impact on livestock production. Different forward multilayer perceptron (MLP) neural networks with backpropagation (BP) learning algorithms using various numbers of hidden neurons and epochs have been introduced. The results of the established models are evaluated based on different metrics such as the accuracy, the F1 core, the precision, the recall, and …

Dynamics Of A 3-D Inlet/Isolator Measured With Fast Pressure-Sensitive Paint, Andrew N. Bustard, Mark E. Noftz, Mitsugu Hasegawa, Hirotaka Sakaue, Joseph S. Jewell, Nicholas J. Bisek, Thomas J. Juliano

Publications

Fast pressure-sensitive paint (PSP) was applied to an inlet/isolator designed using the Osculating Internal Waverider Inlet with Parallel Streamlines (OIWPS) method. The dorsal isolator surface pressure was measured using anodized-aluminum PSP through transparent cast acrylic that makes up the ventral portion of the isolator. Temperature-sensitive paint was utilized to correct for the PSP’s temperature sensitivity. The model was tested under Mach 5.7 flow at Re = 8.5 ×106 /m and 10.2 ×106 /m in the AFOSR–Notre Dame Large Mach-6 Quiet Tunnel (ANDLM6QT) under conventional noise conditions. Flow phenomena, such as shocks originating in the inlet and flow separation at the …

Wakening Past Concepts Without Past Data: Class-Incremental Learning From Online Placebos, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Not forgetting old class knowledge is a key challenge for class-incremental learning (CIL) when the model continuously adapts to new classes. A common technique to address this is knowledge distillation (KD), which penalizes prediction inconsistencies between old and new models. Such prediction is made with almost new class data, as old class data is extremely scarce due to the strict memory limitation in CIL. In this paper, we take a deep dive into KD losses and find that "using new class data for KD"not only hinders the model adaption (for learning new classes) but also results in low efficiency for …

The Metaverse, Religious Practice And Wellbeing: A Narrative Review, Justin Thomas, Mohammad Amin Kuhail, Fahad Albeyahi

All Works

The metaverse is touted as the next phase in the evolution of the Internet. This emerging digital ecosystem is widely conceptualized as a persistent matrix of interconnected multiuser, massively scaled online environments optimally experienced through immersive digital technologies such as virtual reality (VR). Much of the prognostication about the social implications of the metaverse center on secular activities. For example, retail, entertainment (gaming/concerts), and social networking. Little attention has been given to how the metaverse might impact religion. This narrative review explores contemporary research into online religious practice and the use of immersive digital technologies for religious purposes. This focus …

Advancing The Understanding Of Clinical Sepsis Using Gene Expression–Driven Machine Learning To Improve Patient Outcomes, Asrar Rashid, Feras Al-Obeidat, Wael Hafez, Govind Benakatti, Rayaz A. Malik, Christos Koutentis, Javed Sharief, Joe Brierley, Nasir Quraishi, Zainab A. Malik, Arif Anwary, Hoda Alkhzaimi, Syed Ahmed Zaki, Praveen Khilnani, Raziya Kadwa, Rajesh Phatak, Maike Schumacher, M. Guftar Shaikh, Ahmed Al-Dubai, Amir Hussain

All Works

Sepsis remains a major challenge that necessitates improved approaches to enhance patient outcomes. This study explored the potential of machine learning (ML) techniques to bridge the gap between clinical data and gene expression information to better predict and understand sepsis. We discuss the application of ML algorithms, including neural networks, deep learning, and ensemble methods, to address key evidence gaps and overcome the challenges in sepsis research. The lack of a clear definition of sepsis is highlighted as a major hurdle, but ML models offer a workaround by focusing on endpoint prediction. We emphasize the significance of gene transcript information …

The Deep Bsde Method, Daniel Kovach

Masters Theses

"The curse of dimensionality is the non-linear growth in computing time as the dimension of a problem increases. Using the Deep Backwards Stochastic Differential Equation (Deep BSDE) method developed in [HJE18], I approximate the solution at an initial time to a one-dimensional diffusion equation. Although we only approximate a one-dimensional equation, this method extends well to higher dimensions because it overcomes the curse of dimensionality by evaluating the given partial differential equation along "random characteristics''. In addition to the implementation, I also present most of the mathematical theory needed to understand this method"-- Abstract, p. iii

Radiofrequency Interference Detection Using Lstmand Statistical Analysis Discriminator, Luke Smith

Masters Theses

"Wireless devices are becoming increasingly pervasive across all aspects of society. Examples of such devices include radios, routers, mobile phones, tablets, and more. As the number of radio frequency (RF) devices continues to rise, so does the amount of interference and noise increase. This is why an efficient approach to interference detection is explored. Most research within this area has been done strictly within the frequency domain as viewing a signal within this domain provides many insights into what makes the signal. This has, however, led to the time domain being underutilized for this area of research.

To explore the …

Branching Fractional Brownian Motion, Reece Beattie-Hauser

Masters Theses

"Fractional Brownian Motion (FBM) is a Gaussian process whose increments are correlated over long times. FBM is an example of anomalous diffusion, and recently it has been used to model the distribution of serotonergic fibers in the brain [1, 2]. To better represent these fibers, branching FBM (bFBM), where FBM trajectories may randomly split into two, is introduced. One-dimensional bFBM is studied in both sub diffusive and super diffusive regimes, examining three potential behaviors of the correlations (memory) in a branching event: both trajectories retain the memory of previous steps, only one keeps the memory, and neither keeps the memory. …

The Exponential Function In Discrete Fractional Calculus Under The Delta Operator, Brayton James Link

Masters Theses

"Previously the exponential problem in discrete fractional calculus under the nabla operator was solved with the discrete Mittag--Leffler function. We now show the solution to the exponential problem in discrete fractional calculus under the delta operator, providing multiple derivations of the solution with recursion and Laplace transforms. We also share some computational and numerical results of experiments with different orders of difference to display the nature of the solution" -- Abstract, p. iii