Toward Self-Assembled Ferroelectric Random Access Memories: Hard-Wired Switching Capacitor Arrays with Almost Tb/in.2 Densities

We report on the successful fabrication of arrays of switchable nanocapacitors made by harnessing the self-assembly of materials. The structures are composed of arrays of 20-40 nm diameter Pt nanowires, spaced 50-100 nm apart, electrodeposited through nanoporous alumina onto a thin film lower electrode on a silicon wafer. A thin film ferroelectric (both barium titanate (BTO) and lead zirconium titanate (PZT)) has been deposited on top of the nanowire array, followed by the deposition of thin film upper electrodes. The PZT nanocapacitors exhibit hysteresis loops with substantial remnant polarizations, while although the switching performance was inferior, the low-field characteristics of the BTO nanocapacitors show dielectric behavior comparable to conventional thin film heterostructures. While registration is not sufficient for commercial RAM production, this is nevertheless an embryonic form of the highest density hard-wired FRAM capacitor array reported to date and compares favorably with atomic force microscopy read-write densities.

Ferroelectric hafnium oxide: A CMOS-compatible and highly scalable approach to future ferroelectric memories

With the ability to engineer ferroelectricity in HfO2 thin films, manufacturable and highly scaled MFM capacitors and MFIS-FETs can be implemented into a CMOS-environment. NVM properties of the resulting devices are discussed and contrasted to existing perovskite based FRAM.

Conformal oxide coating of carbon nanotubes

The International Roadmap for Ferroelectric Memories requires three-dimensional integration of high-dielectric materials onto metal interconnects or bottom electrodes by 2010. Here, we demonstrate the possibility of conformally coating carbon nanotubes with high-dielectric oxide as a first step toward ultrahigh integration density of three-dimensional ferroelectric random access memories.

Liquid source misted chemical deposition process of three-dimensional nano-ferroelectrics with substrate heating

A modification of liquid source misted chemical deposition process (LSMCD) with heating mist and substrate has developed, and this enabled to control mist penetrability and fluidity on sidewalls of three-dimensional structures and ensure step coverage. A modified LSMCD process allowed a combinatorial approach of Pb(Zr,Ti)O-3 (PZT) thin films and carbon nanotubes (CNTs) toward ultrahigh integration density of ferroelectric random access memories (FeRAMs). The CNTs templates were survived during the crystallization process of deposited PZT film onto CNTs annealed at 650 degrees C in oxygen ambient due to a matter of minute process, so that the thermal budget is quite small. The modified LSMCD process opens up the possibility to realize the nanoscale capacitor structure of ferroelectric PZT film with CNTs electrodes toward ultrahigh integration density FeRAMs.

6-T SRAM cell design with nanoscale double-gate SOI MOSFETs: impact of source/drain engineering and circuit topology

The impact of source/drain engineering on the performance of a six-transistor (6-T) static random access memory (SRAM) cell, based on 22 nm double-gate (DG) SOI MOSFETs, has been analyzed using mixed-mode simulation, for three different circuit topologies for low voltage operation. The trade-offs associated with the various conflicting requirements relating to read/write/standby operations have been evaluated comprehensively in terms of eight performance metrics, namely retention noise margin, static noise margin, static voltage/current noise margin, write-ability current, write trip voltage/current and leakage current. Optimal design parameters with gate-underlap architecture have been identified to enhance the overall SRAM performance, and the influence of parasitic source/drain resistance and supply voltage scaling has been investigated. A gate-underlap device designed with a spacer-to-straggle (s/sigma) ratio in the range 2-3 yields improved SRAM performance metrics, regardless of circuit topology. An optimal two word-line double-gate SOI 6-T SRAM cell design exhibits a high SNM similar to 162 mV, I-wr similar to 35 mu A and low I-leak similar to 70 pA at V-DD = 0.6 V, while maintaining SNM similar to 30% V-DD over the supply voltage (V-DD) range of 0.4-0.9 V.

Mechanical fatigue and spectrum analysis of small-satellite

Mechanical fatigue due to environmental loads and spectrum analysis due to launch loads of the primary structure of a low cost, low-earth orbit small satellite intended for earth observation missions are presented. The payload of the satellite under consideration is a precise optical unit to image the earth’s surface having a mass of 45 kg. 3-D Finite Element Model for the satellite structure is generated by applying substructure method. Modal analysis is required to determine natural frequencies of the satellite and define its mode shape. Then, ranking of mode shapes according to specific constraint is performed. Harmonic analysis at resonance frequencies with the highest ranking is done and cumulative fatigue damage analysis is performed. Spectrum analysis is performed for Small Sat structure to verify the satellite structure reliability under all dynamic random vibration loads applied during transportation and launch cases.

Fast Mining of Interesting Phrases from Subsets of Text Corpora

We address the problem of mining interesting phrases from subsets of a text corpus where the subset is specified using a set of features such as keywords that form a query. Previous algorithms for the problem have proposed solutions that involve sifting through a phrase dictionary based index or a document-based index where the solution is linear in either the phrase dictionary size or the size of the document subset. We propose the usage of an independence assumption between query keywords given the top correlated phrases, wherein the pre-processing could be reduced to discovering phrases from among the top phrases per each feature in the query. We then outline an indexing mechanism where per-keyword phrase lists are stored either in disk or memory, so that popular aggregation algorithms such as No Random Access and Sort-merge Join may be adapted to do the scoring at real-time to identify the top interesting phrases. Though such an approach is expected to be approximate, we empirically illustrate that very high accuracies (of over 90%) are achieved against the results of exact algorithms. Due to the simplified list-aggregation, we are also able to provide response times that are orders of magnitude better than state-of-the-art algorithms. Interestingly, our disk-based approach outperforms the in-memory baselines by up to hundred times and sometimes more, confirming the superiority of the proposed method.

An empirical polarization domain channel availability model for cognitive radio

In dynamic spectrum access networks, cognitive radio terminals monitor their spectral environment in order to detect and opportunistically access unoccupied frequency channels. The overall performance of such networks depends on the spectrum occupancy or availability patterns. Accurate knowledge on the channel availability enables optimum performance of such networks in terms of spectrum and energy efficiency. This work proposes a novel probabilistic channel availability model that can describe the channel availability in different polarizations for mobile cognitive radio terminals that are likely to change their orientation during their operation. A Gaussian approximation is used to model the empirical occupancy data that was obtained through a measurement campaign in the cellular frequency bands within a realistic operational scenario.

Influence of access to straw provided in racks on the welfare of sows in large dynamic groups

This experiment investigated the effect of providing access to straw in racks on the welfare of sows in large dynamic groups. Two treatments were applied: (1) access to two racks containing chopped barley straw (offering an average of 0.3 kg straw/sow/day) and (2) control, with no straw racks. Treatments were applied to two separate dynamic groups each containing 35 ( 3) sows. Approximately 9 sows were replaced in each of these groups at 3-week intervals (each replacement constituting a replicate of the study). Peak rack usage was shown between 08:00 and 12:00 h, where on average 6% of sows were observed at each rack. On average over a 24-h period, 27% of sows that were observed at the racks were newly introduced. This percentage was significantly greater in the pre- rather than post-feeding yard (P 0.05). A greater proportion of sows performed sham chewing behaviour in the post- rather than the pre-feeding yard (P 0.05). Overall, providing access to straw in racks led to a reduction in pen-directed exploratory behaviour, and this may reflect the fact that sows were provided with an outlet for exploratory and/or foraging behaviour. However, the fact that sham chewing behaviour was not affected suggests that welfare benefits associated with the straw rack treatment were limited. (C) 2007 Elsevier B.V. All rights reserved.

Influence of access to grass silage on the welfare of sows introduced to a large dynamic group

This experiment investigated the effects of providing access to grass silage on the welfare of sows introduced to a large dynamic group. Two treatments were applied: (1) access to racks containing grass silage (offering an average of 1.9 kg silage/sow/day), and (2) control treatment with no grass silage racks. Treatments 1 and 2 were applied to two separate dynamic groups, each containing 37 (2) sows. Approximately 9 sows were replaced in both groups at 3-week intervals, and each of these replacements constituted a replicate of the study. The study was replicated six times using a total of 108 sows. In a time-based cross-over design, treatments were swapped between the two dynamic groups after three replicates. Highest levels of rack usage were shown between 08:00 and 14:00 h. During peak periods, 9.8% of sows were observed at the racks at a given time. On average, 78.5% of sows observed at the racks were newly-introduced animals. Overall levels of aggression to which newly-introduced sows were exposed on the day of introduction to the group were low, and did not differ significantly between treatments (P > 0.05). In addition, injury levels measured 1-week post-introduction to the group did not differ significantly between treatments (P > 0.05). Sham chewing behaviour was more prevalent in the post-rather than the pre-feeding yard (P

Doing Focus Groups and Interviews with Recent Migrants to Northern Ireland: A Dynamic Interplay of Ethics, Language and Access

This case describes a qualitative social science research project that was conducted in 2009 and that examined the experiences of recent migrants to Northern Ireland. While background to the research and key findings are presented, the topic forms a backdrop to the case. The following aspects of the study are presented: the theoretical context; formulating the research question, design and methodology; key methodological issues; data collection and analysis; project dissemination; and research funding and reporting. The case pays particular attention to the needs and impact of different groups including the researcher, the funding body, the researcher’s employer and the researched. The significance of access, language and ethics to this study are examined. Finally, the way in which the research unfolded in an often-unpredictable way throughout the implementation process is highlighted in the narrative.

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy {\em churn} (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a {\em constant} degree graph with {\em high expansion} even under {\em continuous high adversarial} churn. Our protocol can tolerate a churn rate of up to $O(n/\poly\log(n))$ per round (where $n$ is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only $O(\poly\log(n))$ overhead for topology maintenance: only polylogarithmic (in $n$) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.

A dynamic mechanical method for determining the silicone elastomer solubility of drugs and pharmaceutical excipients in silicone intravaginal drug delivery rings

The silicone elastomer solubilities of a range of drugs and pharmaceutical excipients employed in the development of silicone intravaginal drug delivery rings (polyethylene glycols, norethisterone acetate, estradiol, triclosan, oleyl alcohol, oxybutynin) have been determined using dynamic mechanical analysis. The method involves measuring the concentration-dependent decrease in the storage modulus associated with the melting of the incorporated drug/excipient, and extrapolation to zero change in storage modulus. The study also demonstrates the effect of drug/excipient concentrations on the mechanical stiffness of the silicone devices at 37°C.

Dynamic Job Scheduling on the Grid Environment using the Great Deluge Algorithm

The utilization of the computational Grid processor network has become a common method for researchers and scientists without access to local processor clusters to avail of the benefits of parallel processing for compute-intensive applications. As a result, this demand requires effective and efficient dynamic allocation of available resources. Although static scheduling and allocation techniques have proved effective, the dynamic nature of the Grid requires innovative techniques for reacting to change and maintaining stability for users. The dynamic scheduling process requires quite powerful optimization techniques, which can themselves lack the performance required in reaction time for achieving an effective schedule solution. Often there is a trade-off between solution quality and speed in achieving a solution. This paper presents an extension of a technique used in optimization and scheduling which can provide the means of achieving this balance and improves on similar approaches currently published.

A distributed contention-vector division multiple access (D-CVDMA) protocol for wireless networks

Traditional Time Division Multiple Access (TDMA) protocol provides deterministic periodic collision free data transmissions. However, TDMA lacks flexibility and exhibits low efficiency in dynamic environments such as wireless LANs. On the other hand contention-based MAC protocols such as the IEEE 802.11 DCF are adaptive to network dynamics but are generally inefficient in heavily loaded or large networks. To take advantage of the both types of protocols, a D-CVDMA protocol is proposed. It is based on the k-round elimination contention (k-EC) scheme, which provides fast contention resolution for Wireless LANs. D-CVDMA uses a contention mechanism to achieve TDMA-like collision-free data transmissions, which does not need to reserve time slots for forthcoming transmissions. These features make the D-CVDMA robust and adaptive to network dynamics such as node leaving and joining, changes in packet size and arrival rate, which in turn make it suitable for the delivery of hybrid traffic including multimedia and data content. Analyses and simulations demonstrate that D-CVDMA outperforms the IEEE 802.11 DCF and k-EC in terms of network throughput, delay, jitter, and fairness.