Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Channel routing (4)
- Area-universal networks (3)
- Computer science (3)
- Parallel computation (3)
- Randomized routing (3)
-
- Algorithms (2)
- Automated Aerial Refueling (2)
- Computer Vision (2)
- Encryption (2)
- Fat-trees (2)
- Interconnection networks (2)
- Internet of Things (2)
- Layout algorithms (2)
- Lower bounds (2)
- Machine Learning (2)
- Position Estimation (2)
- Relative Navigation (2)
- Single-layer channel routing (2)
- Single-layer routing (2)
- VLSI (2)
- VLSI layout (2)
- Virtual World (2)
- Wormhole routing (2)
- #antcenter (1)
- Aerial refueling (1)
- Algebraic systems theory (1)
- Applications of algebraic and differential geometry in systems theory (1)
- Area-universality (1)
- Arithmetic Cost (1)
- Aritifical Intelligence (AI), Static Security Evaluation (SSE), Economic Dispatch (ED), Support Vector Machines (SVM), Particle Swarm Optimization (PSO), Feature Selection (1)
- Publication
-
- Ronald Greenberg (17)
- Theses and Dissertations (6)
- Dissertations, Master's Theses and Master's Reports (3)
- FIU Electronic Theses and Dissertations (3)
- Research Collection School Of Computing and Information Systems (3)
-
- Electrical & Computer Engineering Faculty Publications (2)
- Masters Theses & Specialist Projects (2)
- Computer Science ETDs (1)
- Computer Science Theses & Dissertations (1)
- Conference papers (1)
- Electronic Theses and Dissertations (1)
- Information Science Faculty Publications (1)
- Master's Theses (1)
- Shared Knowledge Conference (1)
- Sirani Mututhanthrige Perera (1)
- Theses and Dissertations--Electrical and Computer Engineering (1)
- University of New Orleans Theses and Dissertations (1)
- Publication Type
Articles 1 - 30 of 46
Full-Text Articles in Engineering
Data Center Holistic Demand Response Algorithm To Smooth Microgrid Tie-Line Power Fluctuation, Ting Yang, Yingjie Zhao, Haibo Pen, Zhaoxia Wang
Data Center Holistic Demand Response Algorithm To Smooth Microgrid Tie-Line Power Fluctuation, Ting Yang, Yingjie Zhao, Haibo Pen, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
With the rapid development of cloud computing, artificial intelligence technologies and big data applications, data centers have become widely deployed. High density IT equipment in data centers consumes a lot of electrical power, and makes data center a hungry monster of energy consumption. To solve this problem, renewable energy is increasingly integrated into data center power provisioning systems. Compared to the traditional power supply methods, renewable energy has its unique characteristics, such as intermittency and randomness. When renewable energy supplies power to the data center industrial park, this kind of power supply not only has negative effects on the normal …
Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones
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 Multi-Task Approach To Incremental Dialogue State Tracking, Anh Duong Trinh, Robert J. Ross, John D. Kelleher
A Multi-Task Approach To Incremental Dialogue State Tracking, Anh Duong Trinh, Robert J. Ross, John D. Kelleher
Conference papers
Incrementality is a fundamental feature of language in real world use. To this point, however, the vast majority of work in automated dialogue processing has focused on language as turn based. In this paper we explore the challenge of incremental dialogue state tracking through the development and analysis of a multi-task approach to incremental dialogue state tracking. We present the design of our incremental dialogue state tracker in detail and provide evaluation against the well known Dialogue State Tracking Challenge 2 (DSTC2) dataset. In addition to a standard evaluation of the tracker, we also provide an analysis of the Incrementality …
Genetic Algorithm Design Of Photonic Crystals For Energy-Efficient Ultrafast Laser Transmitters, Troy A. Hutchins-Delgado
Genetic Algorithm Design Of Photonic Crystals For Energy-Efficient Ultrafast Laser Transmitters, Troy A. Hutchins-Delgado
Shared Knowledge Conference
Photonic crystals allow light to be controlled and manipulated such that novel photonic devices can be created. We are interested in using photonic crystals to increase the energy efficiency of our semiconductor whistle-geometry ring lasers. A photonic crystal will enable us to reduce the ring size, while maintaining confinement, thereby reducing its operating power. Photonic crystals can also exhibit slow light that will increase the interaction with the material. This will increase the gain, and therefore, lower the threshold for lasing to occur. Designing a photonic crystal for a particular application can be a challenge due to its number of …
A Mathematical Framework On Machine Learning: Theory And Application, Bin Shi
A Mathematical Framework On Machine Learning: Theory And Application, Bin Shi
FIU Electronic Theses and Dissertations
The dissertation addresses the research topics of machine learning outlined below. We developed the theory about traditional first-order algorithms from convex opti- mization and provide new insights in nonconvex objective functions from machine learning. Based on the theory analysis, we designed and developed new algorithms to overcome the difficulty of nonconvex objective and to accelerate the speed to obtain the desired result. In this thesis, we answer the two questions: (1) How to design a step size for gradient descent with random initialization? (2) Can we accelerate the current convex optimization algorithms and improve them into nonconvex objective? For application, …
Game-Theoretic And Machine-Learning Techniques For Cyber-Physical Security And Resilience In Smart Grid, Longfei Wei
Game-Theoretic And Machine-Learning Techniques For Cyber-Physical Security And Resilience In Smart Grid, Longfei Wei
FIU Electronic Theses and Dissertations
The smart grid is the next-generation electrical infrastructure utilizing Information and Communication Technologies (ICTs), whose architecture is evolving from a utility-centric structure to a distributed Cyber-Physical System (CPS) integrated with a large-scale of renewable energy resources. However, meeting reliability objectives in the smart grid becomes increasingly challenging owing to the high penetration of renewable resources and changing weather conditions. Moreover, the cyber-physical attack targeted at the smart grid has become a major threat because millions of electronic devices interconnected via communication networks expose unprecedented vulnerabilities, thereby increasing the potential attack surface. This dissertation is aimed at developing novel game-theoretic and …
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Sirani Mututhanthrige Perera
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.
Exploring The Effect Of Different Numbers Of Convolutional Filters And Training Loops On The Performance Of Alphazero, Jared Prince
Exploring The Effect Of Different Numbers Of Convolutional Filters And Training Loops On The Performance Of Alphazero, Jared Prince
Masters Theses & Specialist Projects
In this work, the algorithm used by AlphaZero is adapted for dots and boxes, a two-player game. This algorithm is explored using different numbers of convolutional filters and training loops, in order to better understand the effect these parameters have on the learning of the player. Different board sizes are also tested to compare these parameters in relation to game complexity. AlphaZero originated as a Go player using an algorithm which combines Monte Carlo tree search and convolutional neural networks. This novel approach, integrating a reinforcement learning method previously applied to Go (MCTS) with a supervised learning method (neural networks) …
Iterated Local Search Algorithm For The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
Iterated Local Search Algorithm For The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper focuses on a recent variant of the Orienteering Problem (OP), namely the Capacitated Team Orienteering Problem (CTOP). In this problem, each node is associated with a demand that needs to be satisfied and a score that need to be collected. Given a set of homogeneous fleet of vehicles, the main objective is to find a path for each available vehicle in order to maximize the total score, without violating the capacity and time budget of each vehicle. We propose an Iterated Local Search algorithm that has been applied in solving various variants of the OP. We propose two …
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Research Collection School Of Computing and Information Systems
Traditional rank-aware processing assumes a dataset that contains available options to cover a specific need (e.g., restaurants, hotels, etc) and users who browse that dataset via top-k queries with linear scoring functions, i.e., by ranking the options according to the weighted sum of their attributes, for a set of given weights. In practice, however, user preferences (weights) may only be estimated with bounded accuracy, or may be inherently uncertain due to the inability of a human user to specify exact weight values with absolute accuracy. Motivated by this, we introduce the uncertain top-k query (UTK). Given uncertain preferences, that is, …
Compact Hardware Implementation Of A Sha-3 Core For Wireless Body Sensor Networks, Yi Yang, Debiao He, Neeraj Kumar, Sherali Zeadally
Compact Hardware Implementation Of A Sha-3 Core For Wireless Body Sensor Networks, Yi Yang, Debiao He, Neeraj Kumar, Sherali Zeadally
Information Science Faculty Publications
One of the most important Internet of Things applications is the wireless body sensor network (WBSN), which can provide universal health care, disease prevention, and control. Due to large deployments of small scale smart sensors in WBSNs, security, and privacy guarantees (e.g., security and safety-critical data, sensitive private information) are becoming a challenging issue because these sensor nodes communicate using an open channel, i.e., Internet. We implement data integrity (to resist against malicious tampering) using the secure hash algorithm 3 (SHA-3) when smart sensors in WBSNs communicate with each other using the Internet. Due to the limited resources (i.e., storage, …
Funqual: User-Defined, Statically-Checked Call Graph Constraints In C++, Andrew P. Nelson
Funqual: User-Defined, Statically-Checked Call Graph Constraints In C++, Andrew P. Nelson
Master's Theses
Static analysis tools can aid programmers by reporting potential programming mistakes prior to the execution of a program. Funqual is a static analysis tool that reads C++17 code ``in the wild'' and checks that the function call graph follows a set of rules which can be defined by the user. This sort of analysis can help the programmer to avoid errors such as accidentally calling blocking functions in time-sensitive contexts or accidentally allocating memory in heap-sensitive environments. To accomplish this, we create a type system whereby functions can be given user-defined type qualifiers and where users can define their own …
Applications Of Artificial Intelligence In Power Systems, Samin Rastgoufard
Applications Of Artificial Intelligence In Power Systems, Samin Rastgoufard
University of New Orleans Theses and Dissertations
Artificial intelligence tools, which are fast, robust and adaptive can overcome the drawbacks of traditional solutions for several power systems problems. In this work, applications of AI techniques have been studied for solving two important problems in power systems.
The first problem is static security evaluation (SSE). The objective of SSE is to identify the contingencies in planning and operations of power systems. Numerical conventional solutions are time-consuming, computationally expensive, and are not suitable for online applications. SSE may be considered as a binary-classification, multi-classification or regression problem. In this work, multi-support vector machine is combined with several evolutionary computation …
Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch
Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch
Electronic Theses and Dissertations
The performance and stability of the Particle Swarm Optimization algorithm depends on parameters that are typically tuned manually or adapted based on knowledge from empirical parameter studies. Such parameter selection is ineffectual when faced with a broad range of problem types, which often hinders the adoption of PSO to real world problems. This dissertation develops a dynamic self-optimization approach for the respective parameters (inertia weight, social and cognition). The effects of self-adaption for the optimal balance between superior performance (convergence) and the robustness (divergence) of the algorithm with regard to both simple and complex benchmark functions is investigated. This work …
User-Centric Privacy Preservation In Mobile And Location-Aware Applications, Mingming Guo
User-Centric Privacy Preservation In Mobile And Location-Aware Applications, Mingming Guo
FIU Electronic Theses and Dissertations
The mobile and wireless community has brought a significant growth of location-aware devices including smart phones, connected vehicles and IoT devices. The combination of location-aware sensing, data processing and wireless communication in these devices leads to the rapid development of mobile and location-aware applications. Meanwhile, user privacy is becoming an indispensable concern. These mobile and location-aware applications, which collect data from mobile sensors carried by users or vehicles, return valuable data collection services (e.g., health condition monitoring, traffic monitoring, and natural disaster forecasting) in real time. The sequential spatial-temporal data queries sent by users provide their location trajectory information. The …
Application Of Huffman Data Compression Algorithm In Hashing Computation, Lakshmi Narasimha Devulapalli Venkata,
Application Of Huffman Data Compression Algorithm In Hashing Computation, Lakshmi Narasimha Devulapalli Venkata,
Masters Theses & Specialist Projects
Cryptography is the art of protecting information by encrypting the original message into an unreadable format. A cryptographic hash function is a hash function which takes an arbitrary length of the text message as input and converts that text into a fixed length of encrypted characters which is infeasible to invert. The values returned by the hash function are called as the message digest or simply hash values. Because of its versatility, hash functions are used in many applications such as message authentication, digital signatures, and password hashing [Thomsen and Knudsen, 2005].
The purpose of this study is to apply …
Special Perturbations On The Jetson Tx1 And Tx2 Computers, Tyler M. Moore
Special Perturbations On The Jetson Tx1 And Tx2 Computers, Tyler M. Moore
Theses and Dissertations
Simplified General Perturbations Number 4 (SGP4) has been the traditional algorithm for performing Orbit Determination (OD) onboard orbiting spacecraft. However, the recent rise of high-performance computers with low Size, Weight, and Power (SWAP) factors has provided the opportunity to use Special Perturbations (SP), a more accurate algorithm to perform onboard OD. This research evaluates the most efficient way to implement SP on NVIDIA’s Jetson TX series of integrated Graphical Processing Units (GPUs). An initial serial version was implemented on the Jetson TX1 and TX2's Central Processing Units (CPUs). The runtimes of the initial version are the benchmark that the runtimes …
Mitigating The Effects Of Boom Occlusion On Automated Aerial Refueling Through Shadow Volumes, Zachary C. Paulson
Mitigating The Effects Of Boom Occlusion On Automated Aerial Refueling Through Shadow Volumes, Zachary C. Paulson
Theses and Dissertations
In flight refueling of Unmanned Aerial Vehicles (UAVs) is critical to the United States Air Force (USAF). However, the large communication latency between a ground-based operator and his/her remote UAV makes docking with a refueling tanker unsafe. This latency may be mitigated by leveraging a tanker-centric stereo vision system. The vision system observes and computes an approaching receiver's relative position and orientation offering a low-latency, high frequency docking solution. Unfortunately, the boom -- an articulated refueling arm responsible for physically pumping fuel into the receiver -- occludes large portions of the receiver especially as the receiver approaches and docks with …
Rss-Based Device-Free Passive Detection And Localization Using Home Automation Network Radio Frequencies, Tiffany M. Phan
Rss-Based Device-Free Passive Detection And Localization Using Home Automation Network Radio Frequencies, Tiffany M. Phan
Theses and Dissertations
This research provided a proof of concept for a device-free passive (DfP) system capable of detecting and localizing a target through exploitation of a home automation network’s radio frequency (RF) signals. The system was developed using Insteon devices with a 915 MHz center frequency. Without developer privileges, limitations of the Insteon technology like no intrinsic received signal strength (RSS) field and silent periods between messages were overcome by using software-defined radios to simulate Insteon devices capable of collecting and reporting RSS, and by creating a message generation script and implementing a calibrated filter threshold to reduce silent periods. Evaluation of …
Stereo Vision: A Comparison Of Synthetic Imagery Vs. Real World Imagery For The Automated Aerial Refueling Problem, Nicholas J. Seydel
Stereo Vision: A Comparison Of Synthetic Imagery Vs. Real World Imagery For The Automated Aerial Refueling Problem, Nicholas J. Seydel
Theses and Dissertations
Missions using unmanned aerial vehicles have increased in the past decade. Currently, there is no way to refuel these aircraft. Accomplishing automated aerial refueling can be made possible using the stereo vision system on a tanker. Real world experiments for the automated aerial refueling problem are expensive and time consuming. Currently, simulations performed in a virtual world have shown promising results using computer vision. It is possible to use the virtual world as a substitute environment for the real world. This research compares the performance of stereo vision algorithms on synthetic and real world imagery.
Integrity Monitoring For Automated Aerial Refueling: A Stereo Vision Approach, Thomas R. Stuart
Integrity Monitoring For Automated Aerial Refueling: A Stereo Vision Approach, Thomas R. Stuart
Theses and Dissertations
Unmanned aerial vehicles (UAVs) increasingly require the capability to y autonomously in close formation including to facilitate automated aerial refueling (AAR). The availability of relative navigation measurements and navigation integrity are essential to autonomous relative navigation. Due to the potential non-availability of the global positioning system (GPS) during military operations, it is highly desirable that relative navigation can be accomplished without the use of GPS. This paper develops two algorithms designed to provide relative navigation measurements solely from a stereo image pair. These algorithms were developed and analyzed in the context of AAR using a stereo camera system modeling that …
Assessment Of Structure From Motion For Reconnaissance Augmentation And Bandwidth Usage Reduction, Jonathan B. Roeber
Assessment Of Structure From Motion For Reconnaissance Augmentation And Bandwidth Usage Reduction, Jonathan B. Roeber
Theses and Dissertations
Modern militaries rely upon remote image sensors for real-time intelligence. A typical remote system consists of an unmanned aerial vehicle, or UAV, with an attached camera. A video stream is sent from the UAV, through a bandwidth-constrained satellite connection, to an intelligence processing unit. In this research, an upgrade to this method of collection is proposed. A set of synthetic images of a scene captured by a UAV in a virtual environment is sent to a pipeline of computer vision algorithms, collectively known as Structure from Motion. The output of Structure from Motion, a three-dimensional model, is then assessed in …
Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson
Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson
Ronald Greenberg
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda + lg n lg lg n) with probability 1-O(1/n). The best previous …
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
Ronald Greenberg
This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Ronald Greenberg
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …
Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh
Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh
Ronald Greenberg
In this paper, we examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη+cLηlogP) time with high probability, where L is the number of flits in a packet, and η=min{d,L}; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat-tree network of area Θ(A) can simulate wormhole routing on any network of comparable area with O(log^3 A) …
Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih
Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih
Ronald Greenberg
This paper considers the optimal offset, feasible offset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time solutions to all three problems. Such results are implausible if the placement of terminals is entirely unrestricted; in fact, the size of the output for the feasible offset problem may be Ω(n^2). The linear-time …
On The Difficulty Of Manhattan Channel Routing, Ronald I. Greenberg, Joseph Jaja, Sridhar Krishnamurthy
On The Difficulty Of Manhattan Channel Routing, Ronald I. Greenberg, Joseph Jaja, Sridhar Krishnamurthy
Ronald Greenberg
We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Omega(sqrt(n)) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.
On The Area Of Hypercube Layouts, Ronald I. Greenberg, Lee Guan
On The Area Of Hypercube Layouts, Ronald I. Greenberg, Lee Guan
Ronald Greenberg
This paper precisely analyzes the wire density and required area in standard styles for the hypercube. It shows that the most natural, regular layout of a hypercube of N^2 nodes in the plane, in a NxN grid arrangement, uses floor(2N/3)+1 horizontal wiring tracks for each row of nodes. (In the process, we see that the number of tracks per row can be reduced by 1 with a less regular design, as can also be seen from an independent argument of Bezrukov et al.) This paper also gives a simple formula for the wire density at any cut position and a …
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Ronald Greenberg
We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.