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

Other Computer Engineering Commons

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

PDF

University of New Mexico

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1 - 30 of 32

Full-Text Articles in Other Computer Engineering

Side Channel Attack Counter Measure Using A Moving Target Architecture, Jithin Joseph Apr 2021

Side Channel Attack Counter Measure Using A Moving Target Architecture, Jithin Joseph

Electrical and Computer Engineering ETDs

A novel countermeasure to side-channel power analysis attacks called Side-channel Power analysis Resistance for Encryption Algorithms using DPR or SPREAD is investigated in this thesis. The countermeasure leverages a strategy that is best characterized as a moving target architecture. Modern field programmable gate arrays (FPGA) architectures provide support for dynamic partial reconfiguration (DPR), a feature that allows real-time reconfiguration of the programmable logic (PL). The moving target architecture proposed in this work leverages DPR to implement a power analysis countermeasure to side-channel attacks, the most common of which are referred to as differential power analysis (DPA) and correlation power analysis …


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

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 …


A Direct Data-Cluster Analysis Method Based On Neutrosophic Set Implication, Florentin Smarandache, Sudan Jha, Gyanendra Prasad Joshi, Lewis Nkenyereya, Dae Wan Kim Jan 2020

A Direct Data-Cluster Analysis Method Based On Neutrosophic Set Implication, Florentin Smarandache, Sudan Jha, Gyanendra Prasad Joshi, Lewis Nkenyereya, Dae Wan Kim

Branch Mathematics and Statistics Faculty and Staff Publications

Raw data are classified using clustering techniques in a reasonable manner to create disjoint clusters. A lot of clustering algorithms based on specific parameters have been proposed to access a high volume of datasets. This paper focuses on cluster analysis based on neutrosophic set implication, i.e., a k-means algorithm with a threshold-based clustering technique. This algorithm addresses the shortcomings of the k-means clustering algorithm by overcoming the limitations of the threshold-based clustering algorithm. To evaluate the validity of the proposed method, several validity measures and validity indices are applied to the Iris dataset (from the University of California, Irvine, Machine …


Using Uncertainty To Interpret Supervised Machine Learning Predictions, Michael C. Darling Nov 2019

Using Uncertainty To Interpret Supervised Machine Learning Predictions, Michael C. Darling

Electrical and Computer Engineering ETDs

Traditionally, machine learning models are assessed using methods that estimate an average performance against samples drawn from a particular distribution. Examples include the use of cross-validation or hold0out to estimate classification error, F-score, precision, and recall.

While these measures provide valuable information, they do not tell us a model's certainty relative to particular regions of the input space. Typically there are regions where the model can differentiate the classes with certainty, and regions where the model is much less certain about its predictions.

In this dissertation we explore numerous approaches for quantifying uncertainty in the individual predictions made by supervised …


Improvement Of The Material’S Mechanical Characteristics Using Intelligent Real Time Control Interfaces In Hfc Hardening Process, Florentin Smarandache, Luige Vladareanu, Mihaiela Iliescu, Victor Vladareanu, Alexandru Gal, Octavian Melinte, Adrian Margean Jan 2019

Improvement Of The Material’S Mechanical Characteristics Using Intelligent Real Time Control Interfaces In Hfc Hardening Process, Florentin Smarandache, Luige Vladareanu, Mihaiela Iliescu, Victor Vladareanu, Alexandru Gal, Octavian Melinte, Adrian Margean

Branch Mathematics and Statistics Faculty and Staff Publications

The paper presents Intelligent Control (IC) Interfaces for real time control of mechatronic systems applied to Hardening Process Control (HPC) in order to improvement of the material’s mechanical characteristics. Implementation of IC laws in the intelligent real time control interfaces depends on the particular circumstances of the models characteristics used and the exact definition of optimization problem. The results led to the development of the IC interfaces in real time through Particle Swarm Optimization (PSO) and neural networks (NN) using off- line the regression methods.


Frequency Domain Decomposition Of Digital Video Containing Multiple Moving Objects, Victor M. Stone Nov 2018

Frequency Domain Decomposition Of Digital Video Containing Multiple Moving Objects, Victor M. Stone

Electrical and Computer Engineering ETDs

Motion estimation has been dominated by time domain methods such as block matching and optical flow. However, these methods have problems with multiple moving objects in the video scene, moving backgrounds, noise, and fractional pixel/frame motion. This dissertation proposes a frequency domain method (FDM) that solves these problems. The methodology introduced here addresses multiple moving objects, with or without a moving background, 3-D frequency domain decomposition of digital video as the sum of locally translational (or, in the case of background, a globally translational motion), with high noise rejection. Additionally, via a version of the chirp-Z, fractional pixel/frame motion detection …


Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones Nov 2018

Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones

Computer Science ETDs

Though computational models typically assume all program steps execute flawlessly, that does not imply all steps are equally important if a failure should occur. In the "Constrained Reliability Allocation" problem, sufficient resources are guaranteed for operations that prompt eventual program termination on failure, but those operations that only cause output errors are given a limited budget of some vital resource, insufficient to ensure correct operation for each of them.

In this dissertation, I present a novel representation of failures based on a combination of their timing and location combined with criticality assessments---a method used to predict the behavior of systems …


A Novel Indoor Positioning System For Firefighters In Unprepared Scenarios, Vamsi Karthik Vadlamani Oct 2018

A Novel Indoor Positioning System For Firefighters In Unprepared Scenarios, Vamsi Karthik Vadlamani

Electrical and Computer Engineering ETDs

Situational awareness and indoor positioning of firefighters are types of information of paramount importance to the success of search and rescue operations. GPS units are undependable for use in Indoor Positioning Systems due to their associated mar- gins of error in position and their reliance on satellite communication that can be interrupted inside large structures. There are few other techniques like dead reck- oning, Wifi and bluetooth based triangulation, Structure from Motion (SFM) based scene reconstruction for Indoor positioning system. However due to high temper- atures, the rapidly changing environment of fires, and low parallax in the thermal images, the …


Intelligent Computational Transportation, Yuming Zhang Jul 2018

Intelligent Computational Transportation, Yuming Zhang

Electrical and Computer Engineering ETDs

Transportation is commonplace around our world. Numerous researchers dedicate great efforts to vast transportation research topics. The purpose of this dissertation is to investigate and address a couple of transportation problems with respect to geographic discretization, pavement surface automatic examination, and traffic ow simulation, using advanced computational technologies. Many applications require a discretized 2D geographic map such that local information can be accessed efficiently. For example, map matching, which aligns a sequence of observed positions to a real-world road network, needs to find all the nearby road segments to the individual positions. To this end, the map is discretized by …


Fundamentals Of Neutrosophic Logic And Sets And Their Role In Artificial Intelligence (Fundamentos De La Lógica Y Los Conjuntos Neutrosóficos Y Su Papel En La Inteligencia Artificial ), Florentin Smarandache, Maykel Leyva-Vazquez Jan 2018

Fundamentals Of Neutrosophic Logic And Sets And Their Role In Artificial Intelligence (Fundamentos De La Lógica Y Los Conjuntos Neutrosóficos Y Su Papel En La Inteligencia Artificial ), Florentin Smarandache, Maykel Leyva-Vazquez

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophy is a new branch of philosophy which studies the origin, nature and scope of neutralities. This has formed the basis for a series of mathematical theories that generalize the classical and fuzzy theories such as the neutrosophic sets and the neutrosophic logic. In the paper, the fundamental concepts related to neutrosophy and its antecedents are presented. Additionally, fundamental concepts of artificial intelligence will be defined and how neutrosophy has come to strengthen this discipline.


Some Aggregation Operators For Bipolar-Valued Hesitant Fuzzy Information, Florentin Smarandache, Tahir Mahmood, Kifayat Ullah, Qaisar Khan Jan 2018

Some Aggregation Operators For Bipolar-Valued Hesitant Fuzzy Information, Florentin Smarandache, Tahir Mahmood, Kifayat Ullah, Qaisar Khan

Branch Mathematics and Statistics Faculty and Staff Publications

In this article we define some aggregation operators for bipolar-valued hesitant fuzzy sets. These operations include bipolar-valued hesitant fuzzy ordered weighted averaging (BPVHFOWA) operator, bipolar-valued hesitant fuzzy ordered weighted geometric (BPVHFOWG) operator and their generalized forms. We also define hybrid aggregation operators and their generalized forms and solved a decision-making problem on these operation.


Application For Position And Load Reference Generation Of A Simulated Mechatronic Chain, Florentin Smarandache, V. Vladareanu, S.B. Cononovici, M. Migdalovici, H. Wang, Y. Feng Jan 2018

Application For Position And Load Reference Generation Of A Simulated Mechatronic Chain, Florentin Smarandache, V. Vladareanu, S.B. Cononovici, M. Migdalovici, H. Wang, Y. Feng

Branch Mathematics and Statistics Faculty and Staff Publications

The paper presents the position and load reference generation for a motor stand simulating a mechatronic chain, in this case a three degree of freedom robot leg. The task is accomplished using three PLC controlled motors in position as the robot joint actuators coupled with three controlled in torque, simulating the load at each simulation time-step. The paper briefly discusses the mathematical model and presents the visual interface used in the simulation, which is then to be further integrated into a virtual environment robot control application.


Modelo De Recomendación Basado En Conocimiento Y Números Svn, Maykel Leyva-Vazquez, Florentin Smarandache Jan 2018

Modelo De Recomendación Basado En Conocimiento Y Números Svn, Maykel Leyva-Vazquez, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Recommendation models are useful in the decision-making process that allow the user a set of options that are expected to meet their expectations. Recommendation models are useful in the decision-making process that offer the user a set of options that are expected to meet their SVN expectations to express linguistic terms.


Prediction Of Graduation Delay Based On Student Characterisitics And Performance, Tushar Ojha Jul 2017

Prediction Of Graduation Delay Based On Student Characterisitics And Performance, Tushar Ojha

Electrical and Computer Engineering ETDs

A college student's success depends on many factors including pre-university characteristics and university student support services. Student graduation rates are often used as an objective metric to measure institutional effectiveness. This work studies the impact of such factors on graduation rates, with a particular focus on delay in graduation. In this work, we used feature selection methods to identify a subset of the pre-institutional features with the highest discriminative power. In particular, Forward Selection with Linear Regression, Backward Elimination with Linear Regression, and Lasso Regression were applied. The feature sets were selected in a multivariate fashion. High school GPA, ACT …


Distributed Knowledge Discovery For Diverse Data, Hossein Hamooni Jul 2017

Distributed Knowledge Discovery For Diverse Data, Hossein Hamooni

Computer Science ETDs

In the era of new technologies, computer scientists deal with massive data of size hundreds of terabytes. Smart cities, social networks, health care systems, large sensor networks, etc. are constantly generating new data. It is non-trivial to extract knowledge from big datasets because traditional data mining algorithms run impractically on such big datasets. However, distributed systems have come to aid this problem while introducing new challenges in designing scalable algorithms. The transition from traditional algorithms to the ones that can be run on a distributed platform should be done carefully. Researchers should design the modern distributed algorithms based on the …


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

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.


A Lattice Theoretic Look: A Negated Approach To Adjectival (Intersective, Neutrosophic And Private) Phrases, Florentin Smarandache, Selcuk Topal Jan 2017

A Lattice Theoretic Look: A Negated Approach To Adjectival (Intersective, Neutrosophic And Private) Phrases, Florentin Smarandache, Selcuk Topal

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


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

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.


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

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.


Computational-Communicative Actions Of Informational Processing, Florentin Smarandache, Stefan Vladutescu Apr 2014

Computational-Communicative Actions Of Informational Processing, Florentin Smarandache, Stefan Vladutescu

Branch Mathematics and Statistics Faculty and Staff Publications

This study is circumscribed to the Information Science. The zetetic aim of research is double: a) to define the concept of action of informational processing and b) to design a taxonomy of actions of informational processing. First, the investigation trays to demonstrate that the computational actions of informational processing or the informational actions are computational-investigative configurations for structuring information: clusters of highly-aggregated operations which are carried out in a unitary manner operate convergently and behave like a unique computational device. From a methodological point of view, they are comprised within the category of analytical instruments for the informational processing of …


Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral Jan 2014

Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of distance between any two m  n matrices. If the distance is 0 or m  n there is nothing interesting. When the distance happens to be a value t; 0 < t < m  n the study is both innovating and interesting. The three cases of study which is carried out in this book are 1. If the difference between two square matrices is large, will it imply the eigen values and eigen vectors of those matrices are distinct? Several open conjectures in this direction are given. 2. The difference between parity check matrix and the generator matrix for the same C(n, k) code is studied. This will help in detecting errors in storage systems as well as in cryptography.


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

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 Sep 2013

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 Jul 2012

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 …


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

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.


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

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 …


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

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 Jan 2011

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 …


A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets, Florentin Smarandache, Mumtaz Ali Jan 2011

A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets, Florentin Smarandache, Mumtaz Ali

Branch Mathematics and Statistics Faculty and Staff Publications

Algebraic codes play a signifcant role in the minimisation of data corruption which caused by defects such as inference, noise channel, crosstalk, and packet loss. In this paper, we introduce soft codes (soft linear codes) through the application of soft sets which is an approximated collection of codes. We also discuss several types of soft codes such as type-1 soft codes, complete soft codes etc. Further, we construct the soft generator matrix and soft parity check matrix for the soft linear codes. Moreover, we develop two techniques for the decoding of soft codes.


Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache Apr 2010

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 …