Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- AWS (1)
- Biomedical Engineering (1)
- Brain Connectivity (1)
- Cloud (1)
- Dijkstra’s algorithm; Single valued neutrosophic number; Shortest path problem; Network (1)
-
- Distributed computing (1)
- Environmental Mapping (1)
- Functional magnetic resonance imaging (1)
- Horizontal scalability (1)
- Human activity recognition (1)
- Mapping (1)
- Medical Imaging (1)
- Mental Disorder (1)
- RGB-D (1)
- Robotics (1)
- SLAM (1)
- Schizophrenia (1)
- Signal Processing (1)
- Vertical scalability (1)
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Computer Engineering
On Frequency Variation Of Dynamic Resting-State Functional Brain Network Activation And Connectivity With Applications To Both Healthy And Clinical Populations, Maziar Yaesoubi
Electrical and Computer Engineering ETDs
One of the earliest and fundamental observation in scientific study of the brain was discovering the relation between activities in different local regions of brain and some core functions of the brain. This was later followed by observing that not only local activities of regions but also synchronous activities between distributed brain regions play a key role in high-level brain functions. Synchronous activity related to the functions of the brain is commonly referred to as functional connectivity (FC) and is studied in the form of connectivity states of the brain which measure degree of interactions between distributed parts of the …
Distributed And Scalable Video Analysis Architecture For Human Activity Recognition Using Cloud Services, Cody Wilson Eilar
Distributed And Scalable Video Analysis Architecture For Human Activity Recognition Using Cloud Services, Cody Wilson Eilar
Electrical and Computer Engineering ETDs
This thesis proposes an open-source, maintainable system for detecting human activity in large video datasets using scalable hardware architectures. The system is validated by detecting writing and typing activities that were collected as part of the Advancing Out of School Learning in Mathematics and Engineering (AOLME) project. The implementation of the system using Amazon Web Services (AWS) is shown to be both horizontally and vertically scalable. The software associated with the system was designed to be robust so as to facilitate reproducibility and extensibility for future research.
Mesh Addition Based On The Depth Image (Mabdi), Lucas E. Chavez
Mesh Addition Based On The Depth Image (Mabdi), Lucas E. Chavez
Mechanical Engineering ETDs
Many robotic applications utilize a detailed map of the world and the algorithm used to produce such a map must take into consideration real-world constraints such as computational and memory costs. Traditional mesh-based environmental mapping algorithms receive data from the sensor, create a mesh surface from the data, and then append the surface to a growing global mesh. These algorithms do not provide a computationally efficient mechanism for reducing redundancies in the global mesh. MABDI is able to leverage the knowledge contained in the global mesh to find the difference between what we expect our sensor to see and what …
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram
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.