Computer Engineering Commons^™

A Saliency-Driven Video Magnifier For People With Low Vision, Ali Selman Aydin, Shirin Feiz, Iv Ramakrishnan, Vikas Ashok

Computer Science Faculty Publications

Consuming video content poses significant challenges for many screen magnifier users, which is the “go to” assistive technology for people with low vision. While screen magnifier software could be used to achieve a zoom factor that would make the content of the video visible to low-vision users, it is oftentimes a major challenge for these users to navigate through videos. Towards making videos more accessible for low-vision users, we have developed the SViM video magnifier system [6]. Specifically, SViM consists of three different magnifier interfaces with easy-to-use means of interactions. All three interfaces are driven by visual saliency as a …

Smart Communities: From Sensors To Internet Of Things And To A Marketplace Of Services, Stephan Olariu, Nirwan Ansari (Editor), Andreas Ahrens (Editor), Cesar Benavente-Preces (Editor)

Computer Science Faculty Publications

Our paper was inspired by the recent Society 5.0 initiative of the Japanese Government that seeks to create a sustainable human-centric society by putting to work recent advances in technology: sensor networks, edge computing, IoT ecosystems, AI, Big Data, robotics, to name just a few. The main contribution of this work is a vision of how these technological advances can contribute, directly or indirectly, to making Society 5.0 reality. For this purpose we build on a recently-proposed concept of Marketplace of Services that, in our view, will turn out to be one of the cornerstones of Society 5.0. Instead of …

Optimal Mission Planning Of Autonomous Mobile Agents For Applications In Microgrids, Sensor Networks, And Military Reconnaissance, Casey D. Majhor

Dissertations, Master's Theses and Master's Reports

As technology advances, the use of collaborative autonomous mobile systems for various applications will become evermore prevalent. One interesting application of these multi-agent systems is for autonomous mobile microgrids. These systems will play an increasingly important role in applications such as military special operations for mobile ad-hoc power infrastructures and for intelligence, surveillance, and reconnaissance missions. In performing these operations with these autonomous energy assets, there is a crucial need to optimize their functionality according to their specific application and mission. Challenges arise in determining mission characteristics such as how each resource should operate, when, where, and for how long. …

Dynamic Dependency Collapsing, Görkem Aşılıoğlu

Dissertations, Master's Theses and Master's Reports

In this dissertation, we explore the concept of dynamic dependency collapsing. Performance increases in computer architecture are always introduced by exploiting additional parallelism when the clock speed is fixed. We show that further improvements are possible even when the available parallelism in programs are exhausted. This performance improvement is possible due to executing instructions in parallel that would ordinarily have been serialized. We call this concept dependency collapsing. We explore existing techniques that exploit parallelism and show which of them fall under the umbrella of dependency collapsing. We then introduce two dependency collapsing techniques of our own. The first technique …

High-Performance Spectral Methods For Computer-Aided Design Of Integrated Circuits, Zhiqiang Zhao

Dissertations, Master's Theses and Master's Reports

Recent research shows that by leveraging the key spectral properties of eigenvalues and eigenvectors of graph Laplacians, more efficient algorithms can be developed for tackling many graph-related computing tasks. In this dissertation, spectral methods are utilized for achieving faster algorithms in the applications of very-large-scale integration (VLSI) computer-aided design (CAD)

First, a scalable algorithmic framework is proposed for effective-resistance preserving spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving the key spectral (structural) properties of the original graph. Our framework is built upon the following three key components: a spectrum-preserving node aggregation and …