Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- DSmT (2)
- Information fusion (2)
- Algorithms (1)
- Anomaly (1)
- Art (1)
-
- Artificial intelligence (1)
- Automation (1)
- Belief functions (1)
- Communication (1)
- Computation (1)
- Computational thinking (1)
- Conceptual art (1)
- Conjunctive rule (1)
- Construction (1)
- Cookbook (1)
- Counter-examples to Dempster rule (1)
- Counterexamples to Conjunctive rule (1)
- Data set (1)
- Dempster rule (1)
- Dilution (1)
- Food (1)
- Generative art (1)
- Integrity constraints (1)
- Levenberg (1)
- Machine learning (1)
- Marquardt (1)
- Metric (1)
- Operation (1)
- Photography (1)
- Recipes (1)
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Computational Engineering
Nonlinear Least Squares 3-D Geolocation Solutions Using Time Differences Of Arrival, Michael V. Bredemann
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 …
Recipe For Disaster, Zac Travis
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 …
An Operational View In Computational Construction Of Information, Florentin Smarandache, Stefan Vladutescu, Constantin Dima, Valeriu Voinea
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.
Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov
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
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 …