Synthesis of transfer functions by nonsymmetrical lattice networks using lossy coils

A method for realising a v.t.f.by a nonsymmetrical lattice in which all coils can be made lossy is given.     

Influence of crack closure on the stress intensity factor for plates subjected to bending—A 3-D finite element analysis

Plates with central through cracks subjected to bending is analysed taking into account the closure of the crack faces on the compression side. A three-dimensional finite element method employing three-dimensional degenerate solid element is used for the analysis. The crack faces have been modelled such that they come in contact over an area on the compression side and interfere with each other. The influence of the crack closure on the variation of the stress intensity factor across the plate thickness is obtained for finite and infinite plate geometries.     

Large amplitude vibrations of circular plates with mixed boundary conditions

In this paper, a method of analysing large amplitude vibrations of circular plates with mixed boundary conditions is explained and is illustrated with an example where part of the boundary is clamped and the remaining simply-supported     

Time-resolved Fourier transform infrared spectroscopic imaging

Fourier transform infrared (FT-IR) imaging allows simultaneous spectral characterization of large spatial areas due to its multichannel detection advantage. The acquisition of large amounts of data in the multichannel configuration results, however, in a poor temporal resolution of sequentially acquired data sets, which limits the examination of dynamic processes to processes that have characteristic time scales of the order of minutes. Here, we introduce the concept and instrumental details of a time-resolved infrared spectroscopic imaging modality that permits the examination of repetitive dynamic processes whose half-lives are of the order of milli-seconds. As an illustration of this implementation of step-scan FT-IR imaging, we examine the molecular responses to external electric-field perturbations of a microscopically heterogeneous polymer-liquid crystal composite. Analysis of the spectroscopic data using conventional univariate and generalized two-dimensional (2D) correlation methods emphasizes an additional capability for accessing of simultaneous spatial and temporal chemical measurements of molecular dynamic processes.     

A continuous-flow system for high-precision kinetics using small volumes

A generally applicable continuous-flow kinetic analysis system that gives data of a precision high enough to measure small kinetic isotope effects for enzymatic and nonenzymatic reactions is described. It employs commercially available components that are readily assembled into an apparatus that is easy to use. It operates under laminar flow conditions, which requires that the time between the initiation of the reaction in the mixer and the observation be long enough that molecular diffusion can effect a symmetrization of the concentration profile that results from a thin plug of reagents introduced at the mixer. The analysis of a second-order irreversible reaction under pseudo-first-order conditions is presented. The Yersinia pestis protein tyrosine phosphatase catalyzed hydrolysis of p-nitrophenyl phosphate is characterized with the system, and a proton inventory on kcat is presented.     

A high-performance computing method for data allocation in distributed database systems

Enhancing the performance of the DDBs (Distributed Database system) can be done by speeding up the computation of the data allocation, leading to higher speed allocation decisions and resulting in smaller data redundancy and shorter processing time. This paper deals with an integrated method for grouping the distributed sites into clusters and customizing the database fragments allocation to the clusters and their sites. We design a high speed clustering and allocating method to determine which fragments would be allocated to which cluster and site so as to maintain data availability and a constant systemic reliability, and evaluate the performance achieved by this method and demonstrate its efficiency by means of tabular and graphical representation. We tested our method over different network sites and found it reduces the data transferred between the sites during the execution time, minimizes the communication cost needed for processing applications, and handles the database queries and meets their future needs.     

Two-stage Robust Network Design with Exponential Scenarios

We study two-stage robust variants of combinatorial optimization problems on undirected graphs, like Steiner tree, Steiner forest, and uncapacitated facility location. Robust optimization problems, previously studied by Dhamdhere et al. (Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05), pp. 367–378, 2005), Golovin et al. (Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2006), and Feige et al. (Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference, pp. 439–453, 2007), are two-stage planning problems in which the requirements are revealed after some decisions are taken in Stage 1. One has to then complete the solution, at a higher cost, to meet the given requirements. In the robust k-Steiner tree problem, for example, one buys some edges in Stage 1. Then k terminals are revealed in Stage 2 and one has to buy more edges, at a higher cost, to complete the Stage 1 solution to build a Steiner tree on these terminals. The objective is to minimize the total cost under the worst-case scenario. In this paper, we focus on the case of exponentially many scenarios given implicitly. A scenario consists of any subset of k terminals (for k-Steiner tree), or any subset of k terminal-pairs (for k-Steiner forest), or any subset of k clients (for facility location). Feige et al. (Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference, pp. 439–453, 2007) give an LP-based general framework for approximation algorithms for a class of two stage robust problems. Their framework cannot be used for network design problems like k-Steiner tree (see later elaboration). Their framework can be used for the robust facility location problem, but gives only a logarithmic approximation. We present the first constant-factor approximation algorithms for the robust k-Steiner tree (with exponential number of scenarios) and robust uncapacitated facility location problems. Our algorithms are combinatorial and are based on guessing the optimum cost and clustering to aggregate nearby vertices. For the robust k-Steiner forest problem on trees and with uniform multiplicative increase factor for Stage 2 (also known as inflation), we present a constant approximation. We show APX-hardness of the robust min-cut problem (even with singleton-set scenarios), resolving an open question of (Dhamdhere et al. in Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05), pp. 367–378, 2005) and (Golovin et al. in Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2006).     

A technique for generating natural colour images from false colour composite images

Colour is widely used in remote sensing work. In many instances, the use of colour conveys additional information both visually and scientifically. Remote sensing satellites view the earth in different spectral bands, viz. near infrared (NIR), red, green, and blue bands, in a conventional multispectral imaging system. In the absence of a blue channel, colour images can be generated using near infrared, red, and green bands in what is known as a false colour composite (FCC) and does not look natural, like the image we see with the naked eye. For a trained interpreter, this does not pose any problems. However, when the intended use is a fly‐through of a draped terrain, visual interpretation, or a display, meant for the non‐remote sensing professional, this becomes a handicap. To overcome this, there is a requirement to generate natural colour composites (NCC) from the given false colour composite, which demands the simulation of a blue band to be combined with green and red bands. This paper describes a unique method of generating a blue band to form natural colour images from a given false colour image set. We use a spectral transformation method to establish a relationship between the false colour and true colour image pairs provided by a sensor with all the four bands, which has a broader spectral coverage. A transformation function is fitted by selecting radiometric control points along the line of geometric registration to find a set of coefficients to be used for simulating a blue band. This blue band, along with the green and red bands, provides a near true colour or ‘natural colour’ on the display. In this paper, we present a set of adjustable radiometric transformation coefficients to accommodate variation in spatial and dynamic range offered by sensors to generate natural colour. These coefficients seem to work on a large number of images of different seasons, provided similar spectral bands and terrain are used. The proposed ‘natural colour generator’ can be used in changing false colour images to natural colour images with the aim of ‘what you get is what you would have seen’.