On trading wavelengths with fibers: a cost-performance based study

We consider the effect of multiple fibers on wavelength division multiplexing networks without wavelength conversion. We study networks with dynamic wavelength routing and develop accurate analytical models to compare various possible options using single- and multiple-fiber networks. We use results of an analytical model and simulation-based studies to evaluate the blocking performance and cost of multifiber networks. The number of fibers required providing high performance in multifiber networks and their costs are compared. A case is made for using multiple fibers in each link with fewer wavelengths instead of using a single fiber with many wavelengths. In particular, we show that a network with four fibers per link and with four wavelengths on each fiber without any wavelength conversion on any node yields similar same performance as the networks with one fiber per link and 16 wavelengths per fiber on each link and with full wavelength conversion capability on all nodes. In addition, the multifiber network may also offer the cost advantage depending on the relative cost of components. We develop a parametric cost model to show that multiple fibers in each link are an attractive option. Finally, such multifiber networks also has fault tolerance, with respect to a single fiber failure, already built into the system.     

A singular loop transformation framework based on non-singular matrices

In this paper, we discuss a loop transformation framework that is based on integer non-singular matrices. The transformations included in this framework are called Λ-transformations and include permutation, skewing and reversal, as well as a transformation calledloop scaling. This framework is more general than existing ones; however, it is also more difficult to generate code in our framework. This paper shows how integer lattice theory can be used to generate efficient code. An added advantage of our framework over existing ones is that there is a simple completion algorithm which, given a partial transformation matrix, produces a full transformation matrix that satisfies all dependences. This completion procedure has applications in parallelization and in the generation of code for NUMA machines. This work was supported by the Cornell Theory Center, NSF Presidential Young Investigator award #CCR-8958543. by NSF Grant #CCR-9008526, and by a grant from the Hewlett-Packard Company.     

Effect of alkali on filaments of poly(ethylene terephthalate) and its copolyesters

The alkali hydrolysis of poly(ethylene terephthalate), anionic copolymer of poly(ethylene terephthalate), and block copolymer of poly(ethylene terephthalate)–poly(ethylene glycol) is investigated under a variety of conditions of alkali concentration in aqueous bath, additives, time, and temperature. Measurements of loss in weight, linear density, breaking load, tenacity, elongation to break apart from intrinsic viscosity, fiber density, COOH-end group content, diameter of filaments, and scanning electron micrographs have been analyzed to identify the differences in the action of alkali on these polymer materials.     

The Network as a Storage Device: Dynamic Routing with Bounded Buffers

We study dynamic routing in store-and-forward packet networks where each network link has bounded buffer capacity for receiving incoming packets and is capable of transmitting a fixed number of packets per unit of time. At any moment in time, packets are injected at various network nodes with each packet specifying its destination node. The goal is to maximize the throughput, defined as the number of packets delivered to their destinations. In this paper, we make some progress on throughput maximization in various network topologies. Let n and m denote the number of nodes and links in the network, respectively. For line networks, we show that Nearest-to-Go (NTG), a natural distributed greedy algorithm, is -competitive, essentially matching a known lower bound on the performance of any greedy algorithm. We also show that if we allow the online routing algorithm to make centralized decisions, there is a randomized polylog(n)-competitive algorithm for line networks as well as for rooted tree networks, where each packet is destined for the root of the tree. For grid graphs, we show that NTG has a competitive ratio of while no greedy algorithm can achieve a ratio better than . Finally, for arbitrary network topologies, we show that NTG is -competitive, improving upon an earlier bound of O(mn). An extended abstract appeared in the Proceedings of the 8th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, Berkeley, CA, USA, pp. 1–13, Lecture Notes in Computer Science, vol. 1741, Springer, Berlin. S. Angelov is supported in part by NSF Career Award CCR-0093117, NSF Award ITR 0205456 and NIGMS Award 1-P20-GM-6912-1. S. Khanna is supported in part by an NSF Career Award CCR-0093117, NSF Award CCF-0429836, and a US-Israel Binational Science Foundation Grant. K. Kunal is supported in part by an NSF Career Award CCR-0093117 and NSF Award CCF-0429836.     

Collusion set detection using graph clustering

Many mal-practices in stock market trading—e.g., circular trading and price manipulation—use the modus operandi of collusion. Informally, a set of traders is a candidate collusion set when they have “heavy trading” among themselves, as compared to their trading with others. We formalize the problem of detection of collusion sets, if any, in the given trading database. We show that naïve approaches are inefficient for real-life situations. We adapt and apply two well-known graph clustering algorithms for this problem. We also propose a new graph clustering algorithm, specifically tailored for detecting collusion sets. A novel feature of our approach is the use of Dempster–Schafer theory of evidence to combine the candidate collusion sets detected by individual algorithms. Treating individual experiments as evidence, this approach allows us to quantify the confidence (or belief) in the candidate collusion sets. We present detailed simulation experiments to demonstrate effectiveness of the proposed algorithms.     

Nanoclays for polymer nanocomposites, paints, inks, greases and cosmetics formulations, drug delivery vehicle and waste water treatment

An overview of nanoclays or organically modified layered silicates (organoclays) is presented with emphasis placed on the use of nanoclays as the reinforcement phase in polymer matrices for preparation of polymer/layered silicates nanocomposites, rheological modifier for paints, inks and greases, drug delivery vehicle for controlled release of therapeutic agents, and nanoclays for industrial waste water as well as potable water treatment to make further step into green environment. A little amount of nanoclay can alter the entire properties of polymers, paints, inks and greases to a great extent by dispersing 1nm thick layered silicate throughout the matrices. The flexibility of interlayer spacing of layered silicates accommodates therapeutic agents which can later on be released to damaged cell. Because the release of drugs in drug-intercalated layered materials is controllable, these new materials have a great potential as a delivery host in the pharmaceutical field. The problem of clean water can be solved by treating industrial and municipal waste water with organoclays in combination with other sorbents like activated carbon and alum. Organoclays have proven to be superior to any other water treatment technology in applications where the water to be treated contains substantial amounts of oil and grease or humic acid.     

Time and Space Optimal Data Parallel Volume Rendering Using Permutation Warping

In this paper we present a data parallel volume rendering algorithm that possesses numerous advantages over prior published solutions. Volume rendering is a three-dimensional graphics rendering algorithm that computes views of sampled medical and simulation data, but has been much slower than other graphics algorithms because of the data set sizes and the computational complexity. Our algorithm usespermutation warpingto achieve linear speedup (run time is O(S/P) forPprocessors whenP\= O(S/logS) forS\=n³samples), linear storage (O(S)) for large data sets, arbitrary view directions, and high-quality filters. We derived a new processor permutation assignment of five passes (our prior known solution was eight passes), and a new parallel compositing technique that is essential for scaling linearly on machines that have more processors than view rays to process (P>n²). We show a speedup of 15.7 for a 16k processor over a 1k processor MasPar MP-1 (16 is linear) and two frames/second with a 128³volume and trilinear view reconstruction. In addition, we demonstrate volume sizes of 256³, constant run time over angles 5 to 75°, filter quality comparisons, and communication congestion of just 19 to 29\%.     

Look Left, Look Right, Look Left Again: An Application of Fractal Symbolic Analysis to Linear Algebra Code Restructuring

Fractal symbolic analysis is a symbolic analysis technique for verifying the legality of program transformations. It is strictly more powerful than dependence analysis; for example, it can be used to verify the legality of blocking LU factorization with pivoting, a task for which dependence analysis is inadequate. In this paper, we show how fractal symbolic analysis can be used to convert between left- and right-looking versions of three kernels of central importance in computational science: triangular solve, Cholesky factorization, and LU factorization with pivoting.     

Effect of solid polymer electrolyte on the sensitization of photocurrents in solid-state electrochemical cells using conducting polypyrrole

The effect of small concentration of methylene blue dye on photocurrents was studied in the solid-state photoelectrochemical cells fabricated using conducting polypyrrole-coated electrodes sandwiched with solid-polymer electrolyte, namely, polyvinylpyrrolidone with phosphoric acid. A maximum photosensitivity factor (S=I _l/I _d, where I _l is the photocurrent and I _d is the dark current) of the order of 5 is observed. The current–voltage (I–V) characteristics in such cells reveal that charge transport is mainly governed by the space charge effect. Comparison of the results presented in this paper with the ones we reported earlier [23] indicates that the matrix in which dye has been incorporated plays an important role in such sensitization processes. A matrix that can efficiently transport the photogenerated charge carriers is observed to be more suitable for such dye-sensitized devices.     

Reactive extraction of itaconic acid using tri‐n‐butyl phosphate and aliquat 336 in sunflower oil as a non‐toxic diluent

Itaconic acid finds a place in various industrial applications. It can be produced by biocultivation in a clean and environment friendly route but recovery of the acid from the dilute stream of the bioreactor is an economic problem. Reactive extraction is a promising method to recover carboxylic acid but suffers from toxicity problems of the diluent and extractant employed. So there is need for a non‐toxic extractant and diluent or a combination of less toxic extractants in a non‐toxic diluent that can recover acid efficiently. Effect of different extractants: tri‐n‐butylphosphate (TBP) (an organophosporous compound) and Aliquat 336 (a quaternary amine) in sunflower oil was studied to find the best extractant–sunflower oil combination. Equilibrium complexation constant, K_E, values of 1.789 and 2.385 m³ kmol^?1, respectively, were obtained for itaconic acid extraction using TBP and Aliquat 336 in sunflower oil. The problem of toxicity in reactive extraction can be reduced by using a natural non‐toxic diluent (sunflower oil) with the extractant. Copyright © 2010 Society of Chemical Industry