Engineering Commons^™

Multilevel-3d Bit Patterned Magnetic Media With 8 Signal Levels Per Nanocolumn, Nissim Amos, John Butler, Beomseop Lee, Meir H. Shachar, Bing Hu, Yuan Tian, Jeongmin Hong, Davil Garcia, Rabee M. Ikkawi, Robert C. Haddon, Dmitri Litvinov, Sakhrat Khizroev

Sakhrat Khizroev

This letter presents an experimental study that shows that a 3^rd physical dimension may be used to further increase information packing density in magnetic storage devices. We demonstrate the feasibility of at least quadrupling the magnetic states of magnetic-based data storage devices by recording and reading information from nanopillars with three magnetically-decoupled layers. Magneto-optical Kerr effect microscopy and magnetic force microscopy analysis show that both continuous (thin film) and patterned triple-stack magnetic media can generate eight magnetically-stable states. This is in comparison to only two states in conventional magnetic recording. Our work further reveals that ferromagnetic interaction between magnetic …

Multiferroic Coreshell Magnetoelectric Nanoparticles As Nmr Sensitive Nanoprobes For Cancer Cell Detection, Abhignyan Nagesetti, Alexandra Rodzinski, Emmanuel Stimphil, Tiffanie Stewart, Chooda Khanal, Ping Wang, Rakesh Guduru, Ping Liang, Irina U. Agoulnik, Jeffrey Horstmyer, Sakhrat Khizroev

Sakhrat Khizroev

Magnetoelectric (ME) nanoparticles (MENs) intrinsically couple magnetic and electric fields. Using them as nuclear magnetic resonance (NMR) sensitive nanoprobes adds another dimension for NMR detection of biological cells based on the cell type and corresponding particle association with the cell. Based on ME property, for the first time we show that MENs can distinguish different cancer cells among themselves as well as from their normal counterparts. The core-shell nanoparticles are 30 nm in size and were not superparamagnetic. Due to presence of the ME effect, these nanoparticles can significantly enhance the electric field configuration on the cell membrane which serves …

Fabrication Of Dense Non-Circular Nanomagnetic Device Arrays Using Self-Limiting Low-Energy Glow-Discharge Processing, Zhen Zheng, Long Chang, Ivan Nekrashevich, Paul Ruchhoeft, Sakhrat Khizroev, Dmitri Litvinov

Sakhrat Khizroev

We describe a low-energy glow-discharge process using reactive ion etching system that enables non-circular device patterns, such as squares or hexagons, to be formed from a precursor array of uniform circular openings in polymethyl methacrylate, PMMA, defined by electron beam lithography. This technique is of a particular interest for bit-patterned magnetic recording medium fabrication, where close packed square magnetic bits may improve its recording performance. The process and results of generating close packed square patterns by self-limiting low-energy glow-discharge are investigated. Dense magnetic arrays formed by electrochemical deposition of nickel over self-limiting formed molds are demonstrated.

Contributions To Hybrid Power Systems Incorporating Renewables For Desalination Systems, Nasser Alawhali

nasser alawhali

No abstract provided.

Fabricating Ordered 2-D Nano-Structured Arrays Using Nanosphere Lithography, Chenlong Zhang, Sandra Cvetanovic, Joshua M. Pearce

Joshua M. Pearce

Recent advances in the use of plasmonic metamaterials to improve absorption of light in thin-film solar photovoltaic devices has created a demand for a scalable method of patterning large areas with metal nanostructures deposited in an ordered array. This article describes two methods of fabricating ordered 2D nanosphere colloidal films: spin coating and interface coating. The two methods are compared and parameter optimization discussed. The study reveals that:

• For smaller nanosphere sizes, spin coating is more favorable, while for larger nanospheres, the angled interface coating provides more coverage and uniformity.

• A surfactant-free approach for interface coating is developed …

General Design Procedures For Airport-Based Solar Photovoltaic Systems, Anurag Anurag, Jiemin Zhang, Jephias Gwamuri, Joshua M. Pearce

Joshua M. Pearce

A source of large surface areas for solar photovoltaic (PV) farms that has been largely overlooked in the 13,000 United States of America (U.S.) airports. This paper hopes to enable PV deployments in most airports by providing an approach to overcome the three primary challenges identified by the Federal Aviation Administration (FAA): (1) reflectivity and glare; (2) radar interference; and (3) physical penetration of airspace. First, these challenges and precautions that must be adhered to for safe PV projects deployment at airports are reviewed and summarized. Since one of the core concerns for PV and airport symbiosis is solar panel …

General Design Procedure For Free And Open-Source Hardware For Scientific Equipment, Shane W. Oberloier, Joshua M. Pearce

Joshua M. Pearce

Distributed digital manufacturing of free and open-source scientific hardware (FOSH) used for scientific experiments has been shown to in general reduce the costs of scientific hardware by 90–99%. In part due to these cost savings, the manufacturing of scientific equipment is beginning to move away from a central paradigm of purchasing proprietary equipment to one in which scientists themselves download open-source designs, fabricate components with digital manufacturing technology, and then assemble the equipment themselves. This trend introduces a need for new formal design procedures that designers can follow when targeting this scientific audience. This study provides five steps in the …

Ambiance-Dependent Agglomeration And Surface-Enhanced Raman Spectroscopy Response Of Self-Assembled Silver Nanoparticles For Plasmonic Photovoltaic Devices, Jephias Gwamuri, Ragavendran Venkatesan, Mehdi Sadatgol, Jeyanthinath Mayandi, Durdo O. Guney, Joshua M. Pearce

Joshua M. Pearce

The agglomeration/dewetting process of thin silver films provides a scalable method of obtaining self-assembled nanoparticles (SANPs) for plasmonics-based thin-film solar photovoltaic (PV) devices. We show the effect of annealing ambiance on silver SANP average size, particle/cluster finite shape, substrate area coverage/particle distribution, and how these physical parameters influence optical properties and surface-enhanced Raman scattering (SERS) responses of SANPs. Statistical analysis performed indicates that generally Ag SANPs processed in the presence of a gas (argon and nitrogen) ambiance tend to have smaller average size particles compared to those processed under vacuum. Optical properties are observed to be highly dependent on particle …

Design Of Post-Consumer Modification Of Standard Solar Modules To Form Large-Area Building-Integrated Photovoltaic Roof Slates, Joshua M. Pearce, Jay Meldrum, Nolan Osborne

Joshua M. Pearce

Building-integrated photovoltaic (BIPV) systems have improved aesthetics but generally cost far more than conventional PV systems because of small manufacturing scale. Thus, in the short and medium term, there is a need for a BIPV mounting system that utilizes conventional modules. Such a design is provided here with a novel modification of conventional photovoltaic (PV) modules to allow them to act as BIPV roofing slates. The open-source designs for the mechanical components necessary to provide the post-consumer conversion for a conventional PV module are provided, and prototypes are fabricated and installed on a mock roof system along with control modules …

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.

Network Resilience Improvement Using Link Additions, Mohammed J. F. Alenazi, Egemen K. Çetinkaya, James P. G. Sterbenz

Egemen K. Çetinkaya

No abstract provided.

Network Attack Experimentation Using Openflow-Enabled Geni Testbed, Mani Chaitanya Gorla, Venu Madhav Kamaraju, Egemen K. Çetinkaya

Egemen K. Çetinkaya

No abstract provided.

Multilayer Network Resilience Analysis And Experimentation On Geni, Justin P. Rohrer, Egemen K. Çetinkaya, James P. G. Sterbenz

Egemen K. Çetinkaya

GENI is evolving to provide a promising environment in which to do experimental research in the resilience and survivability of future networks, by allowing programmable control over topology and mechanism, while providing the scale and global reach needed to conduct network experiments far beyond the capabilities of a conventional testbed. We will use GENI in general, and the GpENI infrastructure (expanding to 40 clusters with 200 nodes worldwide), federated with the larger GENI PlanetLab control framework and interconnected to several ProtoGENI facilities to perform resilience and survivability experiments at scale, both in terms of node count and with the geographic …

Modelling Robustness Of Critical Infrastructure Networks, Srinath Pinnaka, Rajgopal Yarlagadda, Egemen K. Çetinkaya

Egemen K. Çetinkaya

No abstract provided.

Resilience Modelling Of Networks Against Adaptive Challenges, Egemen K. Çetinkaya, Justin P. Rohrer, James P. G. Sterbenz

Egemen K. Çetinkaya

No abstract provided.

Modelling Challenges And Attacks To Wireless Networks, Dongsheng Zhang, Santosh Ajith Gogi, Dan S. Broyles, Egemen K. Çetinkaya, James P. G. Sterbenz

Egemen K. Çetinkaya

A thorough understanding of the network behaviour when exposed to challenges is of paramount importance to construct a resilient MANET (mobile ad hoc network). However, modelling mobile and wireless networks as well as challenges against them is non-trivial due to dynamic and intermittent connectivity caused by channel fading and mobility of the nodes. We treat MANETs as time-varying graphs (TVGs) represented as a weighted adjacency matrix, in which the weights denote the link availability. We present how centrality-based attacks could affect network performance for different routing protocols. Furthermore, we model propagation loss models that represent realistic area-based challenges in wireless …

Resilience Experiments On The Gpeni Testbed, Egemen K. Çetinkaya, Dongsheng Zhang, Mohammed J. F. Alenazi, Yufei Cheng, Parker Riley, James P. G. Sterbenz

Egemen K. Çetinkaya

No abstract provided.

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

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

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.

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.

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

Ronald Greenberg

We give algorithms to minimize density for VLSI channel routing problems 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, we improve previous results for running time and space by a factor of L/\lgn and L, respectively, where L is the channel length, and n is the number of terminals.

Parallel Algorithms For Single-Layer Channel Routing, Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih

Ronald Greenberg

We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that have linear-time sequential solutions rather than limiting attention to the ``river-routing'' context, where single-sided connections are disallowed. For the minimum separation problem, we obtain O(lgN) time on a CREW PRAM or O(lgN/lglgN) time on a CRCW PRAM, both with optimal work (processor-time product) of O(N), where N is the number of terminals. For the offset range problem, we obtain the same time and processor bounds as long as only one side of …