On the Difficulty of Manhattan Channel Routing

We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Omega(sqrt(n)) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature

Use of Tetra-ammonium Tetrakis(4-Sulphonato)Phenyl Porphyrin for Pseudomonas and Bacillus Cell Imaging

The use of tetraammonium tetrakis(4-sulphonato)phenyl porphyrin (TPPS), a water-soluble anionic compound, as a stain to analyse bacterial cells using fluorescent microscopy was investigated. TPPS was effectively used to analyse two different bacteria: Pseudomonas aeruginosa and Bacillus cereus. The variation in brightness with varying concentrations of TPPS was studied. The patterns of variations for these bacteria were found to be the same, but with consistently higher brightness for Bacillus cereus

Assessment of trace metal contamination in a historical freshwater canal (Buckingham Canal), Chennai, India

The present study was done to assess the sources and the major processes controlling the trace metal distribution in sediments of Buckingham Canal. Based on the observed geochemical variations, the sediments are grouped as South Buckingham Canal and North Buckingham Canal sediments (SBC and NBC, respectively). SBC sediments show enrichment in Fe, Ti, Mn, Cr, V, Mo, and As concentrations, while NBC sediments show enrichment in Sn, Cu, Pb, Zn, Ni, and Hg. The calculated Chemical Index of Alteration and Chemical Index of Weathering values for all the sediments are relatively higher than the North American Shale Composite and Upper Continental Crust but similar to Post-Archaean Average Shale, and suggest a source area with moderate weathering. Overall, SBC sediments are highly enriched in Mo, Zn, Cu, and Hg (geoaccumulation index (Igeo) class 4– 6), whereas NBC sediments are enriched in Sn, Cu,Zn, and Hg (Igeo class 4–6). Cu, Ni, and Cr show higher than Effects-Range Median values and hence the biological adverse effect of these metals is 20%; Zn, which accounts for 50%, in the NBC sediments, has a more biological adverse effect than other metalsfound in these sediments. The calculated Igeo, Enrichment Factor, and Contamination Factor values indicate that Mo, Hg, Sn, Cu, and Zn are highly enriched in the Buckingham Canal sediments, suggesting the rapid urban and industrial development of Chennai MetropolitanCity have negatively influenced on the surrounding aquatic ecosystem

Basic Data required for the Lockheed Real Time Simulation of HS - 748 Aircraft

This report contains the basic data for Simulation of HS - 748 as required by Lockheed

Flight Simulation Of HS-748 With And Without Rotodome Part-4 : Handling Qualities And Dynamic Responses

The Mathematical And Data Used In Off-Line Simulation Of The Rotodomed Aircraft Have Been Described In Detail In Part-1 . The Issue Related To The Rolls Royce Engine Simulation Studies Have Been Presented In Part-2 . The Formulation Of The Aerostatic 'Model And Its Verification Has Been Discussed In Part-3 . In This Report, The Results Of The Handling Qualities And Dynamic .Responses Of Both The Basic And The Aew Are Presented. The Results Are Discussed Within The Proposed Restricted C.G. Envelope And Speed Limits Of AEW

On Designing Parallel Algorithms with Applications to VLSI Routing

Data parallel programming provides a simple and powerful framework for designing parallel algorithms that can be mapped efficiently onto a variety of parallel architectures. The model associates a virtual processor as the fundamental unit of parallelism and the computation is expressed in terms of the operations performed by the virtual processors. Each virtual processor can access the memory of any other virtual processor. The algorithms are then evaluated based on two important parameters, time and work. Time refers to the number of time units required by the algorithm, where during each time unit a number of concurrent operations can take place. The work refers to the total number of operations needed to execute the algorithm.This dissertation work on parallel algorithms consists of two parts. The first part develops new computational paradigms for designing efficient parallel algorithms for several important problems in VLSI layout, including channel routing and the problem of routing wires around a rectangle. The second part concerns the evaluation of parallel algorithms. In addition to the time and work parameters, we introduce a third parameter called the communication delay, to model the cost of inter- processor communication. Because of the introduction of the new parameter, scheduling the operations of the parallel algorithm onto physical processors, (so as to optimize the total running time) is no longer an easy task. We so that parallel algorithms that can be represented in the form of arbitrary trees, can be scheduled on p processors, on the new model, such that the resulting makespan is no more than a factor of 3 from the optimal

Modification of Technique of Temporalis Transfer for Lagophthalmos and Lip Animation

The aim of this case report is to describe a modification of the technique of temporalis transfer for patients with paralysis of the facial neve. Primary fixation of fascia lata strips to the medial canthus, angle of mouth, lips, and ala of nose, and later executing the orthodromic transfer of a relevant segment of the muscle are the modifications to be described. Symmetry of the face, mouth, eye closure, and smooth elevation of angle of mouth were the measured outcomes by the surgeon. Our refinement of the technique is easy to perform with good results

Complete posterior migration of intact vertebral body in spinal tuberculosis

Spinal tuberculosis most commonly presents as a paradiscal lesion involving the disc space and adjacent vertebral bodies. Atypical forms of spinal tuberculosis have been described and are most often a result of posterior element involvement. The authors report a patient, who presented with complete posterior migration of an intact vertebral body, a complication of spinal tuberculosis that has not been reported till date. A 12-year-old girl with history of pulmonary tuberculosis presented with progressive paraparesis and back pain. Plain X-rays and MRI revealed that the L2 vertebral body had migrated posteriorly into the spinal canal, without significant movement of the posterior elements. The vertebral body was normal, with no erosion or bone loss. However, bilateral pedicle and facet joint involvement was seen. The neural elements were decompressed through an anterolateral retroperitoneal approach and the spine reconstructed. The authors present this rare manifestation of spinal tuberculosis and discuss the possible mechanisms of this presentation

Parallel Algorithms for VLSI Layout.

Efficient automatic layout tools are clearly essential for designing complex VLSI systems. Recent efforts have been directed toward developing parallel algorithms to handle the different subproblems involved in the layout phase. Some of these algorithms have been shown to offer significant speed-ups over the sequential ones. In this chapter, basic parallel techniques that have been found to be effective for handling problems arising in the layout phase are reviewed. In particular, parallel algorithms for problems arising in paffitioning, placement and routing are discussed. The algorithms used to handle these problems can be classified into two broad categories: iterative or direct. The iterative techniques such as simulated annealing and the Kernighan-Lin algorithm are very effective for partitioning and placment. The direct methods seem to be dominant in routing. These methods and some new methods are discussed in the general context of parallel processing. Efficient algorithms for the shared-memory model and for distributed-memory multiprocessors such as the hypercube are described. In addition, several special-purpose hardware for placement and routing are also outlined and their merits discussed