Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Engineering

Minutes & Seconds: The Scientists, Patrick Aievoli Sep 2018

Minutes & Seconds: The Scientists, Patrick Aievoli

Zea E-Books Collection

Minutes & Seconds, is a captivating intelligible read for those who strive to understand where the “what if” moment has gone. Succeeding his other captivating books, Aievoli’s deep introspective lens dials his readers in to awaken the proverbial sleeping giant inside of our consciousness. He designs an insightful exciting romp through the surreal landscape of our society and illustrates how various pioneers have lead us to a crossroads. I’m truly impressed with Aievoli’s perspicacious comprehension of where digital has taken us through the hands of these select individuals. --Sequoyah Wharton

In creating Minutes & Seconds, Aievoli has assembled an interesting …


The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg Jan 2018

The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg

Ronald Greenberg

This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.


The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg Jan 2018

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 …


Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih Jan 2018

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.


Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih Jan 2018

Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih

Ronald Greenberg

The paper provides an efficient method to find all feasible offsets for a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only for problems with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Theta(n) to Omega(n^2), where n is the number of nets. But, if the number of columns c is O(n), one can solve the problem in time O(n^{1.5}lg n ), which improves upon a `naive' O(cn) approach. As a corollary of this result, the same time bound suffices to find the optimal offset …


The Rock 2018, School Of Engineering And Computer Science Jan 2018

The Rock 2018, School Of Engineering And Computer Science

The Rock

No abstract provided.


A Twitter-Based Study For Understanding Public Reaction On Zika Virus, Roopteja Muppalla Jan 2018

A Twitter-Based Study For Understanding Public Reaction On Zika Virus, Roopteja Muppalla

Browse all Theses and Dissertations

In recent times, social media platforms like Twitter have become more popular and people have become more interactive and responsive than before. People often react to every news in real-time and within no-time, the information spreads rapidly. Even with viral diseases like Zika, people tend to share their opinions and concerns on social media. This can be leveraged by the health officials to track the disease in real-time thereby reducing the time lag due to traditional surveys. A faster and accurate detection of the disease can allow health officials to understand people's opinion of the disease and take necessary precautions …