Structures of an asymmetrically coupled double-well superlattice by double-crystal X-ray diffraction

An asymmetrically coupled (GaAs/AlAs/GaAs/AlAs)/GaAs (001) double-well supperlattice is studied by HRDCD (high resolution double-crystal X-ray diffractometry). The intensity of satellite peaks is modulated by wave packet of different sublayers. In the course of simulation, the satellite peaks in the vicinity of the node points of wave packet are very informative for precise determination of sublayer thickness and for improving accuracy.

Study of double barrier superlattice by synchrotron radiation and double-crystal x-ray diffraction

An (A1As/GaAs/A1As/A1GaAs)/GaAs(001) double-barrier superlattice grown by molecular beam epitaxy (MBE) is studied by combining synchrotron radiation and double-crystal x-ray diffraction (DCD). The intensity of satellite peaks is modulated by the wave function of each sublayer in one superlattice period. Simulated by the x-ray dynamical diffraction theory, it is discovered that the intensity of the satellite peaks situated near the modulating wave node point of each sublayer is very sensitive to the variation of the layer structural parameters, The accurate layer thickness of each sublayer is obtained with an error less than 1 Angstrom. Furthermore, x-ray kinematical diffraction theory is used to explain the modulation phenomenon. (C) 1996 American Institute of Physics.

A node-based smoothed conforming point interpolation method (NS-CPIM) for elasticity problems

This paper formulates a node-based smoothed conforming point interpolation method (NS-CPIM) for solid mechanics. In the proposed NS-CPIM, the higher order conforming PIM shape functions (CPIM) have been constructed to produce a continuous and piecewise quadratic displacement field over the whole problem domain, whereby the smoothed strain field was obtained through smoothing operation over each smoothing domain associated with domain nodes. The smoothed Galerkin weak form was then developed to create the discretized system equations. Numerical studies have demonstrated the following good properties: NS-CPIM (1) can pass both standard and quadratic patch test; (2) provides an upper bound of strain energy; (3) avoid the volumetric locking; (4) provides the higher accuracy than those in the node-based smoothed schemes of the original PIMs.

A point interpolation method with locally smoothed strain field (PIM-LS2) for mechanics problems using triangular mesh

A point interpolation method with locally smoothed strain field (PIM-LS2) is developed for mechanics problems using a triangular background mesh. In the PIM-LS2, the strain within each sub-cell of a nodal domain is assumed to be the average strain over the adjacent sub-cells of the neighboring element sharing the same field node. We prove theoretically that the energy norm of the smoothed strain field in PIM-LS2 is equivalent to that of the compatible strain field, and then prove that the solution of the PIM- LS2 converges to the exact solution of the original strong form. Furthermore, the softening effects of PIM-LS2 to system and the effects of the number of sub-cells that participated in the smoothing operation on the convergence of PIM-LS2 are investigated. Intensive numerical studies verify the convergence, softening effects and bound properties of the PIM-LS2, and show that the very ‘‘tight’’ lower and upper bound solutions can be obtained using PIM-LS2.

Extending lagrange interpolation to develop a 4-node quadrilateral element

Today finite element method is a well established tool in engineering analysis and design. Though there axe many two and three dimensional finite elements available, it is rare that a single element performs satisfactorily in majority of practical problems. The present work deals with the development of 4-node quadrilateral element using extended Lagrange interpolation functions. The classical univariate Lagrange interpolation is well developed for 1-D and is used for obtaining shape functions. We propose a new approach to extend the Lagrange interpolation to several variables. When variables axe more than one the method also gives the set of feasible bubble functions. We use the two to generate shape function for the 4-node arbitrary quadrilateral. It will require the incorporation of the condition of rigid body motion, constant strain and Navier equation by imposing necessary constraints. The procedure obviates the need for isoparametric transformation since interpolation functions are generated for arbitrary quadrilateral shapes. While generating the element stiffness matrix, integration can be carried out to the accuracy desired by dividing the quadrilateral into triangles. To validate the performance of the element which we call EXLQUAD4, we conduct several pathological tests available in the literature. EXLQUAD4 predicts both stresses and displacements accurately at every point in the element in all the constant stress fields. In tests involving higher order stress fields the element is assured to converge in the limit of discretisation. A method thus becomes available to generate shape functions directly for arbitrary quadrilateral. The method is applicable also for hexahedra. The approach should find use for development of finite elements for use with other field equations also.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

Network node with wireless and wired interfaces: Nios II processor and uClinux to development of a NCAP embedded (IEEE 1451.1) with two interfaces, wireless (IEEE 1451.5) and wired (IEEE p1451.2)

This paper presents a NCAP embedded on DE2 kit with Nios II processor and uClinux to development of a network gateway with two interfaces, wireless (ZigBee) and wired (RS232) based on IEEE 1451. Both the communications, wireless and wired, were developed to be point-to-point and working with the same protocols, based on IEEE 1451.0-2007. The tests were made using a microcomputer, which through of browser was possible access the web page stored in the DE2 kit and send commands of control and monitoring to both TIMs (WTIM and STIM). The system describes a different form of development of the NCAP node to be applied in different environments with wired or wireless in the same node. © 2011 IEEE.

Stability boundary characterization of nonlinear autonomous dynamical systems in the presence of saddle-node equilibrium points

A dynamical characterization of the stability boundary for a fairly large class of nonlinear autonomous dynamical systems is developed in this paper. This characterization generalizes the existing results by allowing the existence of saddle-node equilibrium points on the stability boundary. The stability boundary of an asymptotically stable equilibrium point is shown to consist of the stable manifolds of the hyperbolic equilibrium points on the stability boundary and the stable, stable center and center manifolds of the saddle-node equilibrium points on the stability boundary.

Tamoxifen after adjuvant chemotherapy for premenopausal women with lymph node-positive breast cancer: International Breast Cancer Study Group Trial 13-93

PURPOSE: The value of adjuvant tamoxifen after chemotherapy for premenopausal women with breast cancer has not been adequately assessed. PATIENTS AND METHODS: Between 1993 and 1999, International Breast Cancer Study Group Trial 13-93 enrolled 1,246 assessable premenopausal women with axillary node-positive, operable breast cancer. All patients received chemotherapy (cyclophosphamide plus either doxorubicin or epirubicin for four courses followed by immediate or delayed classical cyclophosphamide, methotrexate, and fluorouracil for three courses), which was followed by either tamoxifen (20 mg daily) for 5 years or no further treatment. The primary end point was disease-free survival (DFS). Tumors were classified as estrogen receptor (ER) -positive (n = 735, 59%) if immunohistochemical (IHC) or ligand-binding assays (LBA) were clearly positive. The ER-negative group included all other tumors (n = 511, 41%). A subset of the ER-negative group was defined as ER absent (n = 108, 9%) if IHC staining was none or if the LBA result was 0 fmol/mg cytosol protein. The median follow-up time was 7 years. RESULTS: Tamoxifen improved DFS in the ER-positive cohort (hazard ratio [HR] for tamoxifen v no tamoxifen = 0.59; 95% CI, 0.46 to 0.75; P < .0001) but not in the ER-negative cohort (HR = 1.02; 95% CI, 0.77 to 1.35; P = .89). Tamoxifen had a detrimental effect on patients with ER-absent tumors compared with no tamoxifen in an unplanned exploratory analysis (HR = 2.10; 95% CI, 1.03 to 4.29; P = .04). Patients with ER-positive tumors who achieved chemotherapy-induced amenorrhea had a significantly improved outcome (HR for amenorrhea v no amenorrhea = 0.61; 95% CI, 0.44 to 0.86; P = .004), whether or not they received tamoxifen. CONCLUSION: Tamoxifen after adjuvant chemotherapy significantly improved treatment outcome in premenopausal patients with endocrine-responsive disease, but its use as adjuvant therapy for patients with ER-negative tumors is not recommended.

FPGA-Based Wireless Sensor Node Architecture for High Performance Applications

While for years traditional wireless sensor nodes have been based on ultra-low power microcontrollers with sufficient but limited computing power, the complexity and number of tasks of today’s applications are constantly increasing. Increasing the node duty cycle is not feasible in all cases, so in many cases more computing power is required. This extra computing power may be achieved by either more powerful microcontrollers, though more power consumption or, in general, any solution capable of accelerating task execution. At this point, the use of hardware based, and in particular FPGA solutions, might appear as a candidate technology, since though power use is higher compared with lower power devices, execution time is reduced, so energy could be reduced overall. In order to demonstrate this, an innovative WSN node architecture is proposed. This architecture is based on a high performance high capacity state-of-the-art FPGA, which combines the advantages of the intrinsic acceleration provided by the parallelism of hardware devices, the use of partial reconfiguration capabilities, as well as a careful power-aware management system, to show that energy savings for certain higher-end applications can be achieved. Finally, comprehensive tests have been done to validate the platform in terms of performance and power consumption, to proof that better energy efficiency compared to processor based solutions can be achieved, for instance, when encryption is imposed by the application requirements.

A Survey on Mobile Anchor Node Assisted Localization in Wireless Sensor Networks

Localization is one of the key technologies in Wireless Sensor Networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints on cost and power consumption make it infeasible to equip each sensor node in the network with a Global Position System (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use mobile anchor nodes (MANs), which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. A considerable body of research has addressed the Mobile Anchor Node Assisted Localization (MANAL) problem. However to the best of our knowledge, no updated surveys on MAAL reflecting recent advances in the field have been presented in the past few years. This survey presents a review of the most successful MANAL algorithms, focusing on the achievements made in the past decade, and aims to become a starting point for researchers who are initiating their endeavors in MANAL research field. In addition, we seek to present a comprehensive review of the recent breakthroughs in the field, providing links to the most interesting and successful advances in this research field.

GPX - Gardens Point XML Information Retrieval at INEX 2004

Traditional information retrieval (IR) systems respond to user queries with ranked lists of relevant documents. The separation of content and structure in XML documents allows individual XML elements to be selected in isolation. Thus, users expect XML-IR systems to return highly relevant results that are more precise than entire documents. In this paper we describe the implementation of a search engine for XML document collections. The system is keyword based and is built upon an XML inverted file system. We describe the approach that was adopted to meet the requirements of Content Only (CO) and Vague Content and Structure (VCAS) queries in INEX 2004.

At breaking point? Challenges for Australian film policy through the lens of genre (horror) films

Cultural policy settings attempting to foster the growth and development of the Australian feature film industry in era of globalisation are coming under increasing pressure. Global forces and emerging production and distribution models are challenging the “narrowness” of cultural policy – mandating a particular film culture, circumscribing certain notions of value and limiting the variety of films produced through cultural policy driven subvention models. Australian horror film production is an important case study. Horror films are a production strategy well suited to the financial limitations of the Australian film industry with competitive advantages for producers against international competitors. However, emerging within a “national” cinema driven by public subsidy and social/cultural objectives, horror films – internationally oriented with a low-culture status – have been severely marginalised within public funding environments. This paper introduces Australian horror film production, and examines the limitations of cultural policy, and the impacts of these questions for the Producer Offset.

Characterising anomalous events using change point correlation on unsolicited network traffic

Monitoring unused or dark IP addresses offers opportunities to extract useful information about both on-going and new attack patterns. In recent years, different techniques have been used to analyze such traffic including sequential analysis where a change in traffic behavior, for example change in mean, is used as an indication of malicious activity. Change points themselves say little about detected change; further data processing is necessary for the extraction of useful information and to identify the exact cause of the detected change which is limited due to the size and nature of observed traffic. In this paper, we address the problem of analyzing a large volume of such traffic by correlating change points identified in different traffic parameters. The significance of the proposed technique is two-fold. Firstly, automatic extraction of information related to change points by correlating change points detected across multiple traffic parameters. Secondly, validation of the detected change point by the simultaneous presence of another change point in a different parameter. Using a real network trace collected from unused IP addresses, we demonstrate that the proposed technique enables us to not only validate the change point but also extract useful information about the causes of change points.