Free-space optoelectronic switching cores with MPLS for SANs over WDM ring networks

With increasing demands on storage devices in the modern communication environment, the storage area network (SAN) has evolved to provide a direct connection allowing these storage devices to be accessed efficiently. To optimize the performance of a SAN, a three-stage hybrid electronic/optical switching node architecture based on the concept of a MPLS label switching mechanism, aimed at serving as a multi-protocol label switching (MPLS) ingress label edge router (LER) for a SAN-enabled application, has been designed. New shutter-based free-space multi-channel optical switching cores are employed as the core switch fabric to solve the packet contention and switching path conflict problems. The system-level node architecture design constraints are evaluated through self-similar traffic sourced from real gigabit Ethernet network traces and storage systems. The extension performance of a SAN over a proposed WDM ring network, aimed at serving as an MPLS-enabled transport network, is also presented and demonstrated.

Measles immune suppression:lessons from the Macaque Model

Measles remains a significant childhood disease, and is associated with a transient immune suppression. Paradoxically, measles virus (MV) infection also induces robust MV-specific immune responses. Current hypotheses for the mechanism underlying measles immune suppression focus on functional impairment of lymphocytes or antigen-presenting cells, caused by infection with or exposure to MV. We have generated stable recombinant MVs that express enhanced green fluorescent protein, and remain virulent in non-human primates. By performing a comprehensive study of virological, immunological, hematological and histopathological observations made in animals euthanized at different time points after MV infection, we developed a model explaining measles immune suppression which fits with the "measles paradox". Here we show that MV preferentially infects CD45RA - memory T-lymphocytes and follicular B-lymphocytes, resulting in high infection levels in these populations. After the peak of viremia MV-infected lymphocytes were cleared within days, followed by immune activation and lymph node enlargement. During this period tuberculin-specific T-lymphocyte responses disappeared, whilst strong MV-specific T-lymphocyte responses emerged. Histopathological analysis of lymphoid tissues showed lymphocyte depletion in the B- and T-cell areas in the absence of apoptotic cells, paralleled by infiltration of T-lymphocytes into B-cell follicles and reappearance of proliferating cells. Our findings indicate an immune-mediated clearance of MV-infected CD45RA - memory T-lymphocytes and follicular B-lymphocytes, which causes temporary immunological amnesia. The rapid oligoclonal expansion of MV-specific lymphocytes and bystander cells masks this depletion, explaining the short duration of measles lymphopenia yet long duration of immune suppression. © 2012 de Vries et al.

A bit-level systolic architecture for implementing a VQ tree search

A bit-level systolic array system for performing a binary tree Vector Quantization codebook search is described. This consists of a linear chain of regular VLSI building blocks and exhibits data rates suitable for a wide range of real-time applications. A technique is described which reduces the computation required at each node in the binary tree to that of a single inner product operation. This method applies to all the common distortion measures (including the Euclidean distance, the Weighted Euclidean distance and the Itakura-Saito distortion measure) and significantly reduces the hardware required to implement the tree search system. © 1990 Kluwer Academic Publishers.

Ixaru's Extended Frequency Dependent Quadrature Rules for Slater Integrals: Parallel Computation Issues

We describe recent progress of an ongoing research programme aimed at producing computational science software that can exploit high performance architectures in the atomic physics application domain. We examine the computational bottleneck of matrix construction in a suite of two-dimensional R-matrix propagation programs, 2DRMP, that are aimed at creating virtual electron collision experiments on HPC architectures. We build on Ixaru's extended frequency dependent quadrature rules (EFDQR) for Slater integrals and examine the challenge of constructing Hamiltonian matrices in parallel across an m-processor compute node in a block cyclic distribution for subsequent diagonalization by ScaLAPACK.

Postbuckling behaviour of a blade-stiffened composite panel loaded in uniaxial compression

The postbuckling behaviour of a panel with blade-stiffeners incorporating tapered flanges was experimentally investigated. A new failure mechanism was identified for this particular type of stiffener. Failure was initiated by mid-plane delamination at the free edge of the postbuckled stiffener web at a node-line. This was consistent with an interlaminar shear stress failure and was calculated from strain gauge measurements using an approximate analysis based on lamination theory and incorporating edge effects. The critical shear stress was found to agree well with the shear strength obtained from a three-point bending test of the web laminate. 

Fracture mechanics using a 3D composite element

The formulation of a 3D composite element and its use in a mixed-mode fracture mechanics example is presented. This element, like a conventional 3D finite element, has three degrees of freedom per node although, like a plate element, the strains are defined in the local directions of the mid-plane surface. The stress-strain property matrix of this element was modified to decouple the stresses in the local mid-plane and the strains normal to this plane thus preventing the element from being too stiff in bending. A main advantage of this formulation is the ability to model a laminate with a single 3D element. The motivation behind this work was to improve the computational efficiency associated with the calculation of strain energy release rates in laminated structures. A comparison of mixed-mode results using different elements of an in-house finite element package are presented. Good agreement was achieved between the results obtained using the new element and coventional higher-order elements

PROSTATIC INTRAEPITHELIAL NEOPLASIA (PIN) - PERFORMANCE OF BAYESIAN BELIEF NETWORK FOR DIAGNOSIS AND GRADING

Prostatic intraepithelial neoplasia (PIN) diagnosis and grading are affected by uncertainties which arise from the fact that almost all knowledge of PIN histopathology is expressed in concepts, descriptive linguistic terms, and words. A Bayesian belief network (BBN) was therefore used to reduce the problem of uncertainty in diagnostic clue assessment, while still considering the dependences between elements in the reasoning sequence. A shallow network was used with an open-tree topology, with eight first-level descendant nodes for the diagnostic clues (evidence nodes), each independently linked by a conditional probability matrix to a root node containing the diagnostic alternatives (decision node). One of the evidence nodes was based on the tissue architecture and the others were based on cell features. The system was designed to be interactive, in that the histopathologist entered evidence into the network in the form of likelihood ratios for outcomes at each evidence node. The efficiency of the network was tested on a series of 110 prostate specimens, subdivided as follows: 22 cases of non-neoplastic prostate or benign prostatic tissue (NP), 22 PINs of low grade (PINlow), 22 PINs of high grade (PINhigh), 22 prostatic adenocarcinomas with cribriform pattern (PACcri), and 22 prostatic adenocarcinomas with large acinar pattern (PAClgac). The results obtained in the benign and malignant categories showed that the belief for the diagnostic alternatives is very high, the values being in general more than 0.8 and often close to 1.0. When considering the PIN lesions, the network classified and graded most of the cases with high certainty. However, there were some cases which showed values less than 0.8 (13 cases out of 44), thus indicating that there are situations in which the feature changes are intermediate between contiguous categories or grades. Discrepancy between morphological grading and the BBN results was observed in four out of 44 PIN cases: one PINlow was classified as PINhigh and three PINhigh were classified as PINlow. In conclusion, the network can grade PlN lesions and differentiate them from other prostate lesions with certainty. In particular, it offers a descriptive classifier which is readily implemented and which allows the use of linguistic, fuzzy variables.

EXPERT-SYSTEM SUPPORT USING BAYESIAN BELIEF NETWORKS IN THE DIAGNOSIS OF FINE-NEEDLE ASPIRATION BIOPSY SPECIMENS OF THE BREAST

Aim-To develop an expert system model for the diagnosis of fine needle aspiration cytology (FNAC) of the breast.

Methods-Knowledge and uncertainty were represented in the form of a Bayesian belief network which permitted the combination of diagnostic evidence in a cumulative manner and provided a final probability for the possible diagnostic outcomes. The network comprised 10 cytological features (evidence nodes), each independently linked to the diagnosis (decision node) by a conditional probability matrix. The system was designed to be interactive in that the cytopathologist entered evidence into the network in the form of likelihood ratios for the outcomes at each evidence node.

Results-The efficiency of the network was tested on a series of 40 breast FNAC specimens. The highest diagnostic probability provided by the network agreed with the cytopathologists' diagnosis in 100% of cases for the assessment of discrete, benign, and malignant aspirates. A typical probably benign cases were given probabilities in favour of a benign diagnosis. Suspicious cases tended to have similar probabilities for both diagnostic outcomes and so, correctly, could not be assigned as benign or malignant. A closer examination of cumulative belief graphs for the diagnostic sequence of each case provided insight into the diagnostic process, and quantitative data which improved the identification of suspicious cases.

Conclusion-The further development of such a system will have three important roles in breast cytodiagnosis: (1) to aid the cytologist in making a more consistent and objective diagnosis; (2) to provide a teaching tool on breast cytological diagnosis for the non-expert; and (3) it is the first stage in the development of a system capable of automated diagnosis through the use of expert system machine vision.

Spatial distribution of arsenic and temporal variation of its concentration in rice

P>In order to gain insights into the transport and distribution of arsenic (As) in intact rice (Oryza sativa) plants and its unloading into the rice grain, we investigated the spatial distribution of As and the temporal variation of As concentration in whole rice plants at different growth stages. To the best of our knowledge, this is the first time that such a study has been performed.

Inductively coupled plasma mass spectroscopy (ICP-MS) and high-performance liquid chromatography (HPLC)-ICP-MS were used to analyze total As concentration and speciation. Moreover, synchrotron-based X-ray fluorescence (SXRF) was used to investigate in situ As distribution in the leaf, internode, node and grain.

Total As concentrations of vegetative tissues increased during the 2 wk after flowering. The concentration of dimethylarsinic acid (DMA) in the caryopsis decreased progressively with its development, whereas inorganic As concentration remained stable. The ratios of As content between neighboring leaves or between neighboring internodes were c. 0.6. SXRF revealed As accumulation in the center of the caryopsis during its early development and then in the ovular vascular trace.

These results indicate that there are different controls on the unloading of inorganic As and DMA; the latter accumulated mainly in the caryopsis before flowering, whereas inorganic As was mainly transported into the caryopsis during grain filling. Moreover, nodes appeared to serve as a check-point in As distribution in rice shoots.

Co-operating retrodirective system

Practical demonstration of the operational advantages gained through the use of a co-operating retrodirective array (RDA) basestation and Van Atta node arrangements is discussed. The system exploits a number of inherent RDA features to provide analogue real time multifunctional operation at low physical complexity. An active dual-conversion four element RDA is used as the power distribution source (basestation) while simultaneously achieving a receive sensitivity level of ??109 dBm and 3 dB automatic beam steering angle of ??45??. When mobile units are each equipped with a semi-passive four element Van Atta array, it is shown mobile device orientation issues are mitigated and optimal energy transfer can occur because of automatic beam formation resulting from retrodirective self-pointing action. We show that operation in multipath rich environments with or without line of sight acts to reduce average power density limits in the operating volume with high energy density occurring at mobile nodes sites only. The system described can be used as a full duplex ASK communications link, or, as a means for remote node charging by wireless means, thereby enhancing deployment opportunities between unstabilised moving platforms.

Voltage Sensing Using an Asynchronous Charge-to-Digital Converter for Energy-Autonomous Environments

In future systems with relatively unreliable and unpredictable energy sources such as harvesters, the system power supply may become non-deterministic. For energy effective operations, Vdd is an important parameter in any meaningful system control mechanism. Reliable and accurate on-chip voltage sensors are therefore indispensible for the power and computation management of such systems. Existing voltage sensing methods are not suitable because they usually require a stable and known reference (voltage, current, time, frequency, etc.), which is difficult to obtain in this environment. This paper describes an autonomous reference-free voltage sensor designed using an asynchronous counter powered by the charge on a capacitor and a small controller. Unlike existing methods, the voltage information is directly generated as a digital code. The sensor, fabricated in the 180 nm technology node, was tested successfully through performing measurements over the voltage range from 1.8 V down to 0.8 V.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

End-to-End QoS Enhancement ofHSDPA End-User Multi-flow Traffic Using RAN Buffer Management

High speed downlink packet access (HSDPA) was introduced to UMTS radio access segment to provide higher capacity for new packet switched services. As a result, packet switched sessions with multiple diverse traffic flows such as concurrent voice and data, or video and data being transmitted to the same user are a likely commonplace cellular packet data scenario. In HSDPA, radio access network (RAN) buffer management schemes are essential to support the end-to-end QoS of such sessions. Hence in this paper we present the end-to-end performance study of a proposed RAN buffer management scheme for multi-flow sessions via dynamic system-level HSDPA simulations. The scheme is an enhancement of a time-space priority (TSP) queuing strategy applied to the node B MAC-hs buffer allocated to an end user with concurrent real-time (RT) and non-real-time (NRT) flows during a multi-flow session. The experimental multi- flow scenario is a packet voice call with concurrent TCP-based file download to the same user. Results show that with the proposed enhancements to the TSP-based RAN buffer management, end-to-end QoS performance gains accrue to the NRT flow without compromising RT flow QoS of the same end user session

Buffer Management for Multimedia QoS control over HSDPA Downlink

HSDPA specifications include support for a flexible framework for QoS management. In this paper, it is shown how buffer management could be incorporated into HSDPA QoS framework for 'multimedia' traffic QoS control in the MAC-hs of the Node-B. A time-space-priority (TSP) scheme is proposed as viable buffer management scheme to this effect. Comparative simulation study with other schemes is presented, demonstrating the effectiveness of the TSP buffer management scheme for 'multimedia' service QoS control in HSDPA Node-B data buffers

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.