Engineering Commons^™

Evaluating The Effectiveness Of Flipped Classrooms For Teaching Cs1, Ashish Amresh, Adam R. Carberry, John Femiani

Ashish Amresh

An alternative to the traditional classroom structure that has seen increased use in higher education is the flipped classroom. Flipping the classroom switches when assignments (e.g. homework) and knowledge transfer (e.g. lecture) occur. Flipped classrooms are getting popular in secondary and postsecondary teaching institutions as evidenced by the marked increase in the study, use, and application of the flipped pedagogy as it applies to learning and retention. The majority of the courses that have undergone this change use applied learning strategies and include a significant “learning-by-doing” component. The research in this area is skewed towards such courses and in general …

Word Towers: Assessing Domain Knowledge With Non-Traditional Genres, Tyler Baron, Ashish Amresh

Ashish Amresh

This paper presents the design, development and the results of a pilot study for Word Towers (WT), an educational game that combines gameplay mechanics from board-style word building and arcade style tower defense games. To our knowledge, this is the first ever attempt to merge these game genres into a functional educational game. Our efforts open the possibility for other learning games to be reworked into new genres, increasing novelty and player engagement. Expanding the range of genres also allows for learning games to reach a wider audience. The goal of the WT is to provide a natural method for …

Ctle - Meteorological Sensors Incorporated Into A Uas For Pedagogical Purposes, David Ehrensperger, James Curtis, Dorothea Ivanova, Mark Sinclair, Jacqueline R. Luedtke, Tim Holt, Jennah Perry, Johnny L. Young, Nicholas E. Harris

David Ehrensperger

The Subject Librarian Newsletter, Nanoscience, Fall 2016, Sandy Avila

Sandy Avila

No abstract provided.

Extracting Vibration Characteristics Of A Guitar Using Finite Element, Modal Analysis, And Digital Image Correlation Techniques, Kiran Patil, Javad Baqersad, Daniel Ludwigsen, Yaomin Dong

Daniel Ludwigsen

The sound quality generated by the guitar depends on the vibration characteristics (i.e. natural frequencies and mode shapes) of this instrument. Thus, it is of particular interest to the guitar manufacturers to be able to obtain global information about the characteristics of the guitar. Traditional sensors can only measure at discrete locations. However, digital image correlation (DIC) can measure full-field data on the surface of the structure. In the current paper, a finite element (FE) model of a guitar with free boundary configurations was developed using quadratic solid elements. An eigensolution was performed on the FE model to determine its …

Recent Approaches In Designing Bioadhesive Materials Inspired By Mussel Adhesive Protein, Pegah Kord Forooshani, Bruce P. Lee

Bruce Lee

Marine mussels secret protein-based adhesives, which enable them to anchor to various surfaces in a saline, intertidal zone. Mussel foot proteins (Mfps) contain a large abundance of a unique, catecholic amino acid, Dopa, in their protein sequences. Catechol offers robust and durable adhe-sion to various substrate surfaces and contributes to the curing of the adhesive plaques. In this article, we review the unique features and the key functionalities of Mfps, catechol chemistry, and strategies for preparing catechol-functionalized poly- mers. Specifically, we reviewed recent findings on the contributions of various features of Mfps on interfacial binding, which include coacervate formation, surface …

Preparation, Modification, Characterization, And Biosensing Application Of Nanoporous Gold Using Electrochemical Techniques, Jay Bhattarai, Dharmendra Neupane, Bishal Nepal, Vasilii Mikhaylov, Alexei Demchenko, Keith Stine

Alexei Demchenko

Resilience Is A Property Of A System And A Network, Igor Linkov, Benjamin D. Trump, Jeffrey Keisler

Jeffrey Keisler

Agen Viagra Asli Usa 0821-6765-4444 Obat Tahan Lama Di Bali , Denpasar Cod, Rt Satu

TOKO OBAT VITALITAS BALI

Jual Obat Vitalitas Viagra Asli Usa 0821-6765-4444 Di Bali | Denpasar Cod, Rt Satu

TOKO OBAT VITALITAS BALI

Damage Analysis Modified Trac Computer Program (Damtrac), George H. Baker Iii, Alan D. Mcnutt, G. Bradford Shea, David M. Rubenstein

George H Baker

A computer program tailored for EMP damage analysis of solid-state circuitry has been developed by modifying the existing TRAC network analysis program. Modification of the TRAC diode and transistor models to include breakdown parameters and the addition of a semiconductor device parameter library have greatly simplified the analyst's task. An added feature is a subroutine that automatically calculates the amplitude and duration of transient power dissipated in electronic circuit components.

Inventing Around Edison’S Lamp Patent: The Role Of Patents In Stimulating Downstream Development And Competition, Ron D. Katznelson, John Howells

Ron D. Katznelson

We provide the first detailed empirical study of inventing around patent claims. The enforcement of Edison’s incandescent lamp patent in 1891-1894 stimulated a surge of patenting. Most of these later patents disclosed inventions around the Edison patent. Some of these patents introduced important new technology in their own right and became prior art for new fields, indicating that invention around patents contributes to dynamic efficiency. Contrary to widespread contemporary understanding, the Edison lamp patent did not suppress technological advance in electric lighting. The market position of General Electric (“GE”), the Edison patent-owner, weakened through the period of this patent’s enforcement.

Jual Obat Kuat Viagra Asli Usa Di Bali 0821-6765-4444 Denpasar Cod, Rt Satu

TOKO OBAT VITALITAS BALI

Jual Cream Titan Gel Asli Di Samarinda 0821-6765-4444 Pembesar Penis Cod, Rt Satu

TOKO OBAT VITALITAS BALI

Jual Obat Hammer Of Thor Asli Di Samarinda Cod 0821-6765-4444, Rt Satu

TOKO OBAT VITALITAS BALI

Internet Enabled Remote Driving Of A Combat Hybrid Electric Power System For Duty Cycle Measurement, Jarrett Goodell, Marc Compere, Wilford Smith, Mark Brudnak, Mike Pozolo, Et Al.

Marc Compere

This paper describes a human-in-the-loop motion-based simulator interfaced to hybrid-electric power system hardware, both of which were used to measure the duty cycle of a combat vehicle in a virtual simulation environment. The project discussed is a greatly expanded follow-on to the experiment published in [1,7]. This paper is written in the context of [1,7] and therefore highlights the enhancements. The most prominent of these enhancements is the integration (in real-time) of the Power & Energy System Integration Lab (P&E SIL) with a motion base simulator by means of a “long haul” connection over the Internet (a geographical distance of …

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: 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

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 …

Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg

Ronald Greenberg

This paper provides tips for LEGO robot construction involving bracing or gear meshing along a diagonal using standard Botball kits.

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

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

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 …

Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle

Ronald Greenberg

In a target detection communication system, apparatus and method for determining the presence of probable targets based on contacts (which can indicate the presence of a target, noise, chatter, or objects not of interest) detected within a predefined position sector or sectors over a specified number of scans. The position of each detected contact, as a contact of interest, is compared with the positions of contacts detected at previous times or scans. Velocity profiles indicate which previous contacts support the likelihood that the contact of interest represents a target having a velocity within a defined band. The likelihood, which can …

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

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 …

Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley

Ronald Greenberg

We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg

Ronald Greenberg

Abstract. This paper can be used in two ways. It can provide reference information for incorporating diagonal elements (for bracing or gear meshing) in educational robots built from standard LEGO kits. Alternatively, it can be used as the basis for an assignment for high school or college students to recreate this information; in the process, students will exercise skills in both computer programming and data analysis. Using the paper in the second way can be an excellent integrative experience to add to an existing course; for example, the Exploring Computer Science high school curriculum concludes with the units “Introduction to …

Mulch: A Multi-Layer Channel Router Using One, Two, And Three Layer Partitions, Ronald I. Greenberg, Alex T. Ishii, Alberto L. Sangiovanni-Vincentelli

Ronald Greenberg

Chameleon, a channel router for three layers of interconnect, has been implemented to accept specification of an arbitrary number of layers. Chameleon is based on a strategy of decomposing the multilayer problem into two- and three-layer problems in which one of the layers is reserved primarily for vertical wire runs and the other layer(s) for horizontal runs. In some situations, however, it is advantageous to consider also layers that allow the routing of entire nets, using both horizontal and vertical wires. MulCh is a multilayer channel router that extends the algorithms of Chameleon in this direction. MulCh can route channels …

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.