Engineering Commons^™

Enabling Intelligent Network Management Through Multi-Agent Systems: An Implementation Of Autonomous Network System, Petro Mushidi Tshakwanda

Electrical and Computer Engineering ETDs

This Ph.D. dissertation presents a pioneering Multi-Agent System (MAS) approach for intelligent network management, particularly suited for next-generation networks like 5G and 6G. The thesis is segmented into four critical parts. Firstly, it contrasts the benefits of agent-based design over traditional micro-service architectures. Secondly, it elaborates on the implementation of network service agents in Python Agent Development Environment (PADE), employing machine learning and deep learning algorithms for performance evaluation. Thirdly, a new scalable approach, Scalable and Efficient DevOps (SE-DO), is introduced to optimize agent performance in resource-constrained settings. Fourthly, the dissertation delves into Quality of Service (QoS) and Radio Resource …

Intelligent Internet Of Things Frameworks For Smart City Safety, Dimitrios Sikeridis

Electrical and Computer Engineering ETDs

The emerging Smart City ecosystem consists of a vast edge network of Internet of Things (IoT) devices that continuously interact with mobile devices carried by its citizens. In this setting, the IoT infrastructure, apart from the main communications facilitator, acts as a crowdsourcing mechanism that collects massive amounts of user data, and can support public safety applications for the Smart City. In this thesis, we design and analyze learning mechanisms that extract intelligence from crowd interactions with the wireless IoT infrastructure, and optimize its energy efficiency while operating as a public safety network. First, we deploy a multi-story facility testbed …

Intelligent Networks For High Performance Computing, William Whitney Schonbein

Computer Science ETDs

There exists a resurgence of interest in `smart' network interfaces that can operate on data as it flows through a network. However, while smart capabilities have been expanding, what they can do for high-performance computing (HPC) is not well-understood. In this work, we advance our understanding of the capabilities and contributions of smart network interfaces to HPC. First, we show current offloaded message demultiplexing can mitigate (but not eliminate) overheads incurred by multithreaded communication. Second, we demonstrate current offloaded capabilities can be leveraged to provide Turing complete program execution on the interface. We elaborate with a framework for offloading arbitrary …

Blockchain Based Communication Architectures With Applications To Private Security Networks, Ashley N. Mayle

Computer Science ETDs

Existing communication protocols in security networks are highly centralized. While this naively makes the controls easier to physically secure, external actors require fewer resources to disrupt the system because there are fewer points in the system can be interrupted without the entire system failing. We present a solution to this problem using a proof-of-work-based blockchain implementation built on MultiChain. We construct a test-bed network containing visual imagers and microwave sensor information. These data types are ubiquitous in perimeter security systems and allow a realistic representation of a real-world network architecture. The cameras in this system use an object detection algorithm …

Incentivization In Mobile Edge Computing Using A Full Bayesian Approach, Sean Lebien

Electrical and Computer Engineering ETDs

The advances of multi-access edge computing (MEC) have paved the way for the integration of the MEC servers, as intelligent entities into the Internet of Things (IoT) environment as well as into the 5G radio access networks. In this thesis, a novel artificial intelligence-based MEC servers’ activation mechanism is proposed, by adopting the principles of Reinforcement Learning (RL) and Bayesian Reasoning. The considered problem enables the MEC servers’ activation decision-making, aiming at enhancing the reputation of the overall MEC system, as well as considering the total computing costs to serve efficiently the users’ computing demands, guaranteeing at the same time …

A Novel Framework Using Neutrosophy For Integrated Speech And Text Sentiment Analysis, Florentin Smarandache, Kritika Mishra, Ilanthenral Kandasamy, Vasantha Kandasamy W.B.

Branch Mathematics and Statistics Faculty and Staff Publications

With increasing data on the Internet, it is becoming difficult to analyze every bit and make sure it can be used efficiently for all the businesses. One useful technique using Natural Language Processing (NLP) is sentiment analysis. Various algorithms can be used to classify textual data based on various scales ranging from just positive-negative, positive-neutral-negative to a wide spectrum of emotions. While a lot of work has been done on text, only a lesser amount of research has been done on audio datasets. An audio file contains more features that can be extracted from its amplitude and frequency than a …

Intelligent Algorithm For Trapezoidal Interval Valued Neutrosophic Network Analysis, Florentin Smarandache, Said Broumi, Deivanayagampillai Nagarajan, Malayalan Lathamaheswari, Mohamed Talea, Assia Bakali

Branch Mathematics and Statistics Faculty and Staff Publications

The shortest path problem has been one of the most fundamental practical problems in network analysis. One of the good algorithms is Bellman-Ford, which has been applied in network, for the last some years. Due to complexity in the decision-making process, the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment. Though the interval number is a special situation of the neutrosophic, it did not solve the shortest path problems in an absolute manner. Hence, in this work, the authors have introduced the score function and accuracy …

Nonlinear Least Squares 3-D Geolocation Solutions Using Time Differences Of Arrival, Michael V. Bredemann

Mathematics & Statistics ETDs

This thesis uses a geometric approach to derive and solve nonlinear least squares minimization problems to geolocate a signal source in three dimensions using time differences of arrival at multiple sensor locations. There is no restriction on the maximum number of sensors used. Residual errors reach the numerical limits of machine precision. Symmetric sensor orientations are found that prevent closed form solutions of source locations lying within the null space. Maximum uncertainties in relative sensor positions and time difference of arrivals, required to locate a source within a maximum specified error, are found from these results. Examples illustrate potential requirements …

Non-Trivial Off-Path Network Measurements Without Shared Side-Channel Resource Exhaustion, Geoffrey I. Alexander

Computer Science ETDs

Most traditional network measurement scans and attacks are carried out through the use of direct, on-path network packet transmission. This requires that a machine be on-path (i.e, involved in the packet transmission process) and as a result have direct access to the data packets being transmitted. This limits network scans and attacks to situations where access can be gained to an on-path machine. If, for example, a researcher wanted to measure the round trip time between two machines they did not have access to, traditional scans would be of little help as they require access to an on-path machine to …

Artificial Intelligence Empowered Uavs Data Offloading In Mobile Edge Computing, Nicholas Alexander Kemp

Electrical and Computer Engineering ETDs

The advances introduced by Unmanned Aerial Vehicles (UAVs) are manifold and have paved the path for the full integration of UAVs, as intelligent objects, into the Internet of Things (IoT). This paper brings artificial intelligence into the UAVs data offloading process in a multi-server Mobile Edge Computing (MEC) environment, by adopting principles and concepts from game theory and reinforcement learning. Initially, the autonomous MEC server selection for partial data offloading is performed by the UAVs, based on the theory of the stochastic learning automata. A non-cooperative game among the UAVs is then formulated to determine the UAVs' data to be …

Recipe For Disaster, Zac Travis

MFA Thesis Exhibit Catalogs

Today’s rapid advances in algorithmic processes are creating and generating predictions through common applications, including speech recognition, natural language (text) generation, search engine prediction, social media personalization, and product recommendations. These algorithmic processes rapidly sort through streams of computational calculations and personal digital footprints to predict, make decisions, translate, and attempt to mimic human cognitive function as closely as possible. This is known as machine learning.

The project Recipe for Disaster was developed by exploring automation in technology, specifically through the use of machine learning and recurrent neural networks. These algorithmic models feed on large amounts of data as a …

Mesh Node Communication System For Fire Figthers, Eric E. Hamke, Trace Norris, Jessica E. Ladd, Jeffrey K. Eaton, Jicard J. Malveaux, Manish Bhattarai, Ramiro Jordan, Manel Martinez-Ramon

Electrical & Computer Engineering Technical Reports

This report describes the prototype and demonstration of a reliable local area network (LAN) of devices able to interconnect a crew of fire fighters with a communications node. The data consists of images for thermal cameras at a given rate and other low bandwith data taken from the different sensors of the fire fighter gear, that are connected to the transmitter using a Bluetooth personal area network (PAN). The physical environment is indoors and it is expected that all nodes of the communication networks are distributed in different positions into a building.

Cloudsat: Iot Approach To Small Satellite Ground Infrastructure, Brian Zufelt

Electrical and Computer Engineering ETDs

Over the last decade, the cost of space access has dramatically decreased with the creation of the CubeSat standard. The CubeSat standard defines the structural requirements for an on-orbit deployer and satellite to be placed into orbit. The average cost of creating a space mission with the CubeSat standard can range from $200 thousand to over $3 million. This lower cost has allowed many Universities, and small businesses to create their own space programs. However, a significant portion of the investment for any new space asset is the development of the ground system to communicate with the satellite. These costs …

Special Issue: Neutrosophic Information Theory And Applications, Florentin Smarandache, Jun Ye

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophiclogic,symboliclogic,set,probability,statistics,etc.,are,respectively,generalizations of fuzzy and intuitionistic fuzzy logic and set, classical and imprecise probability, classical statistics, and so on. Neutrosophic logic, symbol logic, and set are gaining significant attention in solving many real-life problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. A number of new neutrosophic theories have been proposed and have been applied in computational intelligence, multiple-attribute decision making, image processing, medical diagnosis, fault diagnosis, optimization design, etc. This Special Issue gathers original research papers that report on the state of the art, as well as on recent advancements in neutrosophic information theory in soft computing, artificial intelligence, …

Improving Hpc Communication Library Performance On Modern Architectures, Matthew G. F. Dosanjh

Computer Science ETDs

As high-performance computing (HPC) systems advance towards exascale (10^18 operations per second), they must leverage increasing levels of parallelism to achieve their performance goals. In addition to increased parallelism, machines of that scale will have strict power limitations placed on them. One direction currently being explored to alleviate those issues are many-core processors such as Intel’s Xeon Phi line. Many-core processors sacrifice clock speed and core complexity, such as out of order pipelining, to increase the number of cores on a die. While this increases floating point throughput, it can reduce the performance of serialized, synchronized, and latency sensitive code …

Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.

An Operational View In Computational Construction Of Information, Florentin Smarandache, Stefan Vladutescu, Constantin Dima, Valeriu Voinea

Branch Mathematics and Statistics Faculty and Staff Publications

The paper aims to explain the technology of emergence of information. Our research proves that information as communicational product is the result of processing within some operations, actions, mechanisms and strategies of informational material meanings. Are determined eight computational-communicative operations of building information. Information occurs in two communication phases, syncretic and the segregation-synthetic. The syncretic phase consists of four operations: referral of significant field, primary delimitation of information, detection-looking information and an anticipative-draft constitution (feedforward). The segregation-synthetic phase also includes four operations: discrimination, identification, interpretation and confrontation (feedback). In the future we will investigate informational actions, mechanisms and strategies.

Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram

Branch Mathematics and Statistics Faculty and Staff Publications

The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

New Operations On Intuitionistic Fuzzy Soft Sets Based On First Zadeh's Logical Operators, Florentin Smarandache, Said Broumi, Pinaki Majumdar

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper , we have defined First Zadeh’s implication , First Zadeh’s intuitionistic fuzzy conjunction and intuitionistic fuzzy disjunction of two intuitionistic fuzzy soft sets and some their basic properties are studied with proofs and examples.

Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we present several counter-examples to the Conjunctive rule and to Dempster rule of combinations in information fusion.

Extended Pcr Rules For Dynamic Frames, Florentin Smarandache, Jean Dezert

Branch Mathematics and Statistics Faculty and Staff Publications

In most of classical fusion problems modeled from belief functions, the frame of discernment is considered as static. This means that the set of elements in the frame and the underlying integrity constraints of the frame are fixed forever and they do not change with time. In some applications, like in target tracking for example, the use of such invariant frame is not very appropriate because it can truly change with time. So it is necessary to adapt the Proportional Conflict Redistribution fusion rules (PCR5 and PCR6) for working with dynamical frames. In this paper, we propose an extension of …

Erasure Techniques In Mrd Codes, Florentin Smarandache, W.B. Vasantha Kandasamy, R. Sujatha, R.S. Raja Durai

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors study the erasure techniques in concatenated Maximum Rank Distance (MRD) codes. The authors for the first time in this book introduce the new notion of concatenation of MRD codes with binary codes, where we take the outer code as the RD code and the binary code as the inner code. The concatenated code consists of the codewords of the outer code expressed in terms of the alphabets of the inner code. These new class of codes are defined as CRM codes. This concatenation techniques helps one to construct any CRM code of desired minimum distance …

Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we introduce the indeterminate models in information fusion, which are due either to the existence of some indeterminate elements in the fusion space or to some indeterminate masses. The best approach for dealing with such models is the neutrosophic logic.

Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Florentin Smarandache, Jean Dezert, Xinde Li, Xinhan Huang

Branch Mathematics and Statistics Faculty and Staff Publications

This paper presents a new method for reducing the number of sources of evidence to combine in order to reduce the complexity of the fusion processing. Such a complexity reduction is often required in many applications where the real-time constraint and limited computing resources are of prime importance. The basic idea consists in selecting, among all sources available, only a subset of sources of evidence to combine. The selection is based on an evidence supporting measure of similarity (ESMS) criterion which is an efficient generic tool for outlier sources identification and rejection. The ESMS between two sources of evidence can …

Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Xinde Li, Jean Dezert, Florentin Smarandache, Xinhan Huang

Branch Mathematics and Statistics Faculty and Staff Publications

This paper proposes a new solution for reducing the number of sources of evidence to be combined in order to diminish the complexity of the fusion process required in some applications where the real-time constraint and strong computing resource limitation are of prime importance. The basic idea consists in selecting, among the whole set of sources of evidence, only the biggest subset of sources which are not too contradicting based on a criterion of Evidence Supporting Measure of Similarity (ESMS) in order to process solely the coherent information received. The ESMS criterion serves actually as a generic tool for outlier …

Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …

Super Special Codes Using Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these …

New Classes Of Codes For Cryptologists And Computer Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Historically a code refers to a cryptosystem that deals with linguistic units: words, phrases etc. We do not discuss such codes in this book. Here codes are message carriers or information storages or information transmitters which in time of need should not be decoded or read by an enemy or an intruder. When we use very abstract mathematics in using a specific code, it is difficult for non-mathematicians to make use of it. At the same time, one cannot compromise with the capacity of the codes. So the authors in this book have introduced several classes of codes which are …