Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Critical Infrastructure (2)
- Algorithms (1)
- Analog computation (1)
- Analytical models (1)
- Asteroid detection (1)
-
- Asteroids (1)
- Astronomy (1)
- Big Data (1)
- ChipWhisperer (1)
- Cognitive radio (1)
- Community Detection (1)
- Cyberattack (1)
- DNA computation (1)
- Damage Assessment (1)
- Damage assessment and recovery (1)
- Data Lineage (1)
- Data Parallelism (1)
- Data Provenance (1)
- Database (1)
- Database security (1)
- Distributed computing (1)
- Energy detection (1)
- Engn_stsc (1)
- Graph Reachability (1)
- Heuristic algorithms (1)
- Honr_proj (1)
- K selection problem (1)
- K-Means clustering (1)
- Leakage assessment (1)
- Machine learning (1)
- Publication
- Publication Type
Articles 1 - 9 of 9
Full-Text Articles in Computer Engineering
A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas
A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
K-Means clustering algorithm does not offer a clear methodology to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. In this paper, we present a new metric for clustering quality and describe its use for K selection. The proposed metric, based on the locations of the centroids, as well as the desired properties of the clusters, is developed in two stages. In the initial stage, we take into account the full covariance matrix of the clustering variables, thereby making it mathematically similar to a reduced chi2. We then extend it to account for …
Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar
Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar
University of New Orleans Theses and Dissertations
Parallel computing plays a crucial role in processing large-scale graph data. Complex network analysis is an exciting area of research for many applications in different scientific domains e.g., sociology, biology, online media, recommendation systems and many more. Graph mining is an area of interest with diverse problems from different domains of our daily life. Due to the advancement of data and computing technologies, graph data is growing at an enormous rate, for example, the number of links in social networks is growing every millisecond. Machine/Deep learning plays a significant role for technological accomplishments to work with big data in modern …
A Novel Data Lineage Model For Critical Infrastructure And A Solution To A Special Case Of The Temporal Graph Reachability Problem, Ian Moncur
Graduate Theses and Dissertations
Rapid and accurate damage assessment is crucial to minimize downtime in critical infrastructure. Dependency on modern technology requires fast and consistent techniques to prevent damage from spreading while also minimizing the impact of damage on system users. One technique to assist in assessment is data lineage, which involves tracing a history of dependencies for data items. The goal of this thesis is to present one novel model and an algorithm that uses data lineage with the goal of being fast and accurate. In function this model operates as a directed graph, with the vertices being data items and edges representing …
Optimized Damage Assessment And Recovery Through Data Categorization In Critical Infrastructure System., Shruthi Ramakrishnan
Optimized Damage Assessment And Recovery Through Data Categorization In Critical Infrastructure System., Shruthi Ramakrishnan
Graduate Theses and Dissertations
Critical infrastructures (CI) play a vital role in majority of the fields and sectors worldwide. It contributes a lot towards the economy of nations and towards the wellbeing of the society. They are highly coupled, interconnected and their interdependencies make them more complex systems. Thus, when a damage occurs in a CI system, its complex interdependencies make it get subjected to cascading effects which propagates faster from one infrastructure to another resulting in wide service degradations which in turn causes economic and societal effects. The propagation of cascading effects of disruptive events could be handled efficiently if the assessment and …
Side-Channel Analysis On Post-Quantum Cryptography Algorithms, Tristen Teague
Side-Channel Analysis On Post-Quantum Cryptography Algorithms, Tristen Teague
Computer Science and Computer Engineering Undergraduate Honors Theses
The advancements of quantum computers brings us closer to the threat of our current asymmetric cryptography algorithms being broken by Shor's Algorithm. NIST proposed a standardization effort in creating a new class of asymmetric cryptography named Post-Quantum Cryptography (PQC). These new algorithms will be resistant against both classical computers and sufficiently powerful quantum computers. Although the new algorithms seem mathematically secure, they can possibly be broken by a class of attacks known as side-channels attacks (SCA). Side-channel attacks involve exploiting the hardware that the algorithm runs on to figure out secret values that could break the security of the system. …
Unconventional Computation Including Quantum Computation, Bruce J. Maclennan
Unconventional Computation Including Quantum Computation, Bruce J. Maclennan
Faculty Publications and Other Works -- EECS
Unconventional computation (or non-standard computation) refers to the use of non-traditional technologies and computing paradigms. As we approach the limits of Moore’s Law, progress in computation will depend on going beyond binary electronics and on exploring new paradigms and technologies for information processing and control. This book surveys some topics relevant to unconventional computation, including the definition of unconventional computations, the physics of computation, quantum computation, DNA and molecular computation, and analog computation. This book is the content of a course taught at UTK.
Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector
Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector
LSU Doctoral Dissertations
In recent years, the study of autonomous entities such as unmanned vehicles has begun to revolutionize both military and civilian devices. One important research focus of autonomous entities has been coordination problems for autonomous robot swarms. Traditionally, robot models are used for algorithms that account for the minimum specifications needed to operate the swarm. However, these theoretical models also gloss over important practical details. Some of these details, such as time, have been considered before (as epochs of execution). In this dissertation, we examine these details in the context of several problems and introduce new performance measures to capture practical …
Preprocessing Of Astronomical Images From The Neowise Survey For Near-Earth Asteroid Detection, Rachel Meyer
Preprocessing Of Astronomical Images From The Neowise Survey For Near-Earth Asteroid Detection, Rachel Meyer
Scholar Week 2016 - present
Asteroid detection is a common field in astronomy for planetary defense which requires observations from survey telescopes to detect and classify different objects. The amount of data collected each night is increasing as better designed telescopes are created each year. This amount is quickly becoming unmanageable and many researchers are looking for ways to better process this data. The dominant solution is to implement computer algorithms to automatically detect these sources and to use Machine Learning in order to create a more efficient and accurate classifier. In the past there has been a focus on larger asteroids that create streaks …
Spectrum Sensing With Energy Detection In Multiple Alternating Time Slots, Călin Vlădeanu, Alexandru Marţian, Dimitrie C. Popescu
Spectrum Sensing With Energy Detection In Multiple Alternating Time Slots, Călin Vlădeanu, Alexandru Marţian, Dimitrie C. Popescu
Electrical & Computer Engineering Faculty Publications
Energy detection (ED) represents a low complexity approach used by secondary users (SU) to sense spectrum occupancy by primary users (PU) in cognitive radio (CR) systems. In this paper, we present a new algorithm that senses the spectrum occupancy by performing ED in K consecutive sensing time slots starting from the current slot and continuing by alternating before and after the current slot. We consider a PU traffic model specified in terms of an average duty cycle value, and derive analytical expressions for the false alarm probability (FAP) and correct detection probability (CDP) for any value of K . Our …