Connection Management Protocols for Dynamic Lightpath Provisioning in Future WDM Networks

This paper investigates and compares the performance of two GMPLS-based distributed control and management protocols for dynamic lightpath provisioning in future IP networks. The first protocol is a global information-based link state approach that consists of both an integrated RWA algorithm and a signaling algorithm. Two triggering mechanisms for the LSAs update procedures are considered; one is periodic-based and the other is threshold-based. The second protocol is a local-information based fixed alternate link routing approach where the signaling protocol is closely integrated with the RWA protocols.     

Neuron type processor modeling using a timed Petri net

The basic operation of a digital neuron is reviewed, and the theory of time Petri nets used for modeling, representation, and analysis of the neuron-type processor (NTP) is reviewed. The timed Petri net is utilized to produce a model for the digital NTP. The neuron-type processor performs input temporal and spatial summation, as well as thresholding. The timed Petri net of the NTP operates asynchronously and sequentially takes on a series of distinct internal states, so that each of these states can concurrently realize a distinct set of steering switching functions depending on the pattern of steering inputs applied to it at the time. This model is structured using several subnets, called essential module units. Depending on the desired number of input dendrites required for the NTP, the essential module units (EMU) are interconnected to produce the required timed Petri net. The timed Petri net and representation facilitates a method of analysis of neural net works containing NTPs prior to hardware implementation.     

Disaster-aware service provisioning with manycasting in cloud networks

Cloud services delivered by high-capacity optical datacenter networks are subject to disasters which may cause large-area failures, leading to huge data loss. Survivable service provisioning is crucial to minimize the effects of network/datacenter failures and maintain critical services in case of a disaster. We propose a novel disaster-aware service-provisioning scheme that multiplexes service over multiple paths destined to multiple servers/datacenters with manycasting. Our scheme maintains some bandwidth (i.e., degraded service) after a disaster failure vs. no service at all. We formulate this problem into a mathematical model which turns out to be an Integer Linear Program (ILP), and we provide heuristic optimization approaches as ILP is intractable for large problem instances. Numerical examples show that exploiting manycasting by intelligently selecting destinations in a risk-aware manner for service provisioning offers high level of survivability against link and node failures that may be caused by disasters and post-disaster failures at no extra cost compared to the other survivable schemes.     

A scheduling model for multirobot assembly cells

We propose a mixed 0–1 linear programming model for repetitive scheduling of multirobot assembly and machining cells. The approach adopted is monolithic as opposed to hierarchical to avoid system suboptimization. The model permits any number of alternative ways (or modes) to perform each operation. A mode of an operation is determined by the required resources (facilities) and the duration of their use. The model incorporates facility changeover times. Robot collisions are avoided. Several objective functions are formulated to support different purposes. The scheduling problem of a multirobot assembly cell is formulated and solved by using commercially available mathematical programming software. Solutions under four different objective functions are reported.Acknowledging the complexity and considerable size of the formulation required, we prescribe and illustrate specific methods to achieve size reduction. Finally, for successful use of our model, an information processing schema is offered as a general guidance to help data management needed by the model.     

p53 mutation is a poor prognostic indicator for survival in patients with hepatocellular carcinoma undergoing surgical tumour ablation

Forty-two patients with hepatocellular carcinoma (HCC) were resected and their tumours were analysed for p53 mutations by GC-clamped denaturing gradient gel electrophoresis (DGGE), single-strand conformation polymorphism (SSCP) and gene sequencing. All the exons have been analysed in this study. Eight of 12 HCCs with cirrhosis due to viral hepatitis and the two patients with sarcomatoid changes displayed p53 mutations. In contrast, no mutation was observed in the fibrolamellar variant (n = 9), non-cirrhotics (n = 13) and alcoholic cirrhosis (n = 6). The mutations observed were in exons 5-8. Two mutations were observed in codons 136 and 213 as well as a T insertion between residues 156 and 157 (exon 5) and these are reported for the first time in HCC. Likewise, the silent mutation polymorphism in codon 213 was noticed in 3 of the 42 patients. Survival analysis of these patients after surgery showed the mean and median survival in patients with wild-type p53 to be 60 and 43 months respectively. In the group with p53 mutations, the mean and median survival was 15 and 12 months. The difference was statistically significant (P= 0.003).     

General model of a gas transport

A general model of transport of gases in porous membranes was established. The model was developed based on the Dusty Gas Model (DGM), solution diffusion, and surface diffusion. As a result, solutions of the model for the different transport conditions are given in this article.