Morphological evolution of edge-hillocks on single-crystal films having anisotropic drift-diffusion under the capillary and electromigration forces

The morphological evolution of hillocks at the unpassivated sidewalls of single-crystal metallic thin film interconnects is investigated via computer simulations using the free-moving boundary value problem. The effect of drift-diffusion anisotropy on the development of surface topographical scenarios is fully explored under the action of electromigration and capillary forces, utilizing numerous combinations of the surface texture, the drift-diffusion anisotropy and the direction of the applied electric field. The simulation studies yield analytical relationships for the velocity of the surface solitary waves and the drift velocity of electromigration-induced internal voids as a function of the applied current densities, which contain intrinsic and structural properties of the single-crystal thin films. The threshold value of the applied current density, above which electromigration-induced internal voids can be formed and may cause the catastrophic failure of interconnects by breaching, also appears explicitly in this relationship.     

Where differences persist: Robotic vs. human movement control

Summary form only given. A partial list of features on which human movement control systems (HMCSs) and robotic movement control systems (RMCSs) differ is presented. It is concluded that along with the obvious stimulation that is generated back and forth between the study of the HMCS and that of RMCS, it is tempting to point only to the similarities between the two systems. However, it should be remembered that differences do exist between these systems and forced attempts to prove similarities may be very misleading     

Constructing Pseudo-Random Permutations with a Prescribed Structure

We show how to construct pseudo-random permutations that satisfy a certain cycle restriction, for example that the permutation be cyclic (consisting of one cycle containing all the elements) or an involution (a self-inverse permutation) with no fixed points. The construction can be based on any (unrestricted) pseudo-random permutation. The resulting permutations are defined succinctly and their evaluation at a given point is efficient. Furthermore, they enjoy a fast forward property, i.e. it is possible to iterate them at a very small cost. Received 10 August 2000 and revised 30 September 2000 Online publication 9 April 2001     

Collaborative detection and mitigation of DDoS in software-defined networks

The Journal of Supercomputing - This research presents the detection and mitigation of distributed denial of service (DDoS) in software defined networks (SDN). The proposed method consists of three...     

Randomized range-maxima in nearly-constant parallel time

Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log^* n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage.     

High-Temperature Stiffness and Damping Measurements to Monitor the Glassy Intergranular Phase in Liquid-Phase-Sintered Silicon Carbides

Detailed stiffness and internal friction ( Q ⁻¹) versus temperature curves were obtained for liquid-phase-sintered silicon carbides using advanced resonant beam analysis up to 1400°C. As-sintered materials display a stable Q ⁻¹-peak near 1100°C, superimposed on an increasing background. The change of stiffness associated with the damping peak is quantitatively related to the amount of matter in pockets of the amorphous intergranular phase in which the refractory SiC matrix grains are embedded. The successful removal of the amorphous pockets by annealing at 1900°C is deduced from the disappearance of the damping peak and confirmed with transmission electron microscopy.     

Transfer learning in deep neural network-based receiver coil sensitivity map estimation

Magnetic Resonance Materials in Physics, Biology and Medicine - The success of parallel Magnetic Resonance Imaging algorithms like SENSitivity Encoding (SENSE) depends on an accurate estimation of...     

On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR

A k-query locally decodable code (LDC) allows to probabilistically decode any bit of an encoded message by probing only k bits of its corrupted encoding. A stronger and desirable property is that of self-correction, allowing to efficiently recover not only bits of the message but also arbitrary bits of its encoding. In contrast to the initial constructions of LDCs, the recent and most efficient constructions are not known to be self-correctable. The existence of self-correctable codes of comparable efficiency remains open.     

Selective determination of urea using urease immobilized on ZnO nanowires

Well-aligned zinc oxide (ZnO) nanowire arrays were fabricated on gold-coated plastic substrates using a low-temperature aqueous chemical growth (ACG) method. The ZnO nanowire arrays with 50–130 nm diameters and ∼1 μm in lengths were used in an enzyme-based urea sensor through immobilization of the enzyme urease that was found to be sensitive to urea concentrations from 0.1 mM to 100 mM. Two linear sensitivity regions were observed when the electrochemical responses (EMF) of the sensors were plotted vs. the logarithmic concentration range of urea from 0.1 mM to 100 mM. The proposed sensor showed a sensitivity of 52.8 mV/decade for 0.1–40 mM urea and a fast response time less than 4 s was achieved with good selectivity, reproducibility and negligible response to common interferents such as ascorbic acid and uric acid, glucose, K⁺ and Na⁺ ions.     

Performance evaluation of semantic registries: OWLJessKB and instanceStore

Service discovery is a critical task in distributed computing architectures for finding a particular service instance. Semantic annotations of services help to enrich the service discovery process. Semantic registries are an important component for the discovery of services and they allow for semantic interoperability through ontology-based query formulation and dynamic mapping of terminologies between system domains. This paper evaluates two semantic registries—OWLJessKB implementation and instanceStore—to determine the suitability of these with regards to the query response time and the overall scalability for use in mathematical services. Mathematical ontologies from the MONET project are used to undertake comparison. The results demonstrate that the performance of registries may be compared across two axes: (1) time to initialize (i.e. time to load an initial ontology into memory); (2) time to query (i.e. time to reason with an ontology loaded into memory).