On the elimination of DC in reconstructed wavefronts from in-line holograms

New experimental results to demonstrate that the annoying DC in the reconstructed wavefronts from in-line holograms could be successfully eliminated are presented in this paper. The complete elimination of DC has been achieved by making proper use of a Mach-Zehnder interferometer. The results for an in-line hololens and an in-line Fourier transform hologram are discussed.

Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

Investigations of the Nature of Critical Line Very Close to a Double Critical Point

The curvature of the line of critical points in a reentrant ternary mixture is determined by approaching the double critical point (DCP) extremely closely. The results establish the continuous and quadratic nature of this line. Out study encompasses as small a loop size (ΔT) as 663 mK. The DCP is realized when ΔT becomes zero.

Study of forging design using slip-line fields

The main purpose of forging design is to ensure cavity filling with minimum material wastage, minimum die load and minimum deformation energy. Given the desired shape of the component and the material to be forged, this goal is achieved by optimising the initial volume of the billet, the geometrical parameters of the die and the process parameters. It is general industrial practise to fix the initial billet volume and the die parameters using empirical relationships derived from practical experience. In this paper a basis for optimising some of the parameters for simple closed-die forging is proposed. Slip-line field solutions are used to predict the flow, the load and the energy in a simple two-dimensional closed-die forging operation. The influence of the design parameters; flash-land width, excess initial workpiece area and forged cross-sectional size; on complete cavity filling and efficient cavity filling are investigated. Using the latter as necessary requirements for forging, the levels of permissable design parameters are determined, the variation of these levels with the size of the cross-section then being examined.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

Three Dimensional Line-Clipping by Systematic Enumeration

Three dimensional clipping is a critical component of the 3D graphics pipeline. A new 3D clipping algorithm is presented in this paper. An efficient 2D clipping routine reported earlier has been used as a submodule. This algorithm uses a new classification scheme for lines of all possible orientations with respect to a rectangular parallelopiped view volume. The performance of this algorithm has been evaluated using exact arithmetic operation counts. It is shown that our algorithm requires less arithmetic operations than the Cyrus-Beck 3D clipping algorithm in all cases. It is also shown that for lines that intersect the clipping volume, our algorithm performs better than the Liang-Barsky 3D clipping algorithm.

Effect of tolerance on the propagation characteristic of a superconducting thin film microstrip delay line

The propagation constant of a superconducting microstrip transmission delay line is evaluated using the spectral domain immitance approach, modelling the superconductor as a surface current having an equivalent surface impedance found through the complex resistive boundary condition. The sensitivity approach is used to study the beta variations with substrate parameters and film characteristics. Results show that the surface impedance does not have much influence on beta sensitivities with respect to epsilon r, W and h. However, it can be observed that the surface impedance plays a crucial role in determining the optimum design.

On the Nash-Williams′ Lemma in Graph Reconstruction Theory

A generalization of Nash-Williams′ lemma is proved for the Structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams′ lemma is conjectured for the vertex reconstruction problem.

X-ray diffraction line profile analysis of deformation microstructure in boron modified Ti-6Al-4V alloy

X-ray diffraction line profile analysis (XRDLPA) techniques have been applied to investigate the deformed microstructure of a recently developed boron modified two-phase titanium alloy Ti-6Al-4V. The alloy was hot compressed at 750 degrees C up to 50% height reduction at two different strain rates (10(-3) S-1 and 1 S-1). Microstructural parameters like average domain size, average microstrain within the domain and dislocation density of the two phases were determined using X-ray diffraction line profile analysis. The results indicate an increase in the microstrain and dislocation density for the alpha-phase and decrease for the beta-phase in the case of boron modified alloys as compared to the normal material. Microstructural modifications viz, the grain refinement and the presence of hard, brittle TiB particles in the case of boron modified alloy are held responsible for the observed difference in the dislocation density. (C) 2010 Elsevier Inc. All rights reserved.

Proposed visible emission line space solar coronagraph

The outer atmosphere of the sun called the corona has been observed during total solar eclipse for short periods (typically <6 min), from as early as the eighteenth century. In the recent past, space-based instruments have permitted us to study the corona uninterruptedly. In spite of these developments, the dynamic corona and its high temperature (1-2 million K) are yet to be Ally understood. It is conjectured that their dynamic nature and associated energetic events are possible reasons behind the high temperature. In order to study these in detail, a visible emission line space solar coronagraph is being proposed as a payload under the small-satellite programme of the Indian Space Research Organisation. The satellite is named as Aditya-1 and the scientific objectives of this payload are to study: (i) the existence of intensity oscillations for the study of wave-driven coronal heating; (ii) the dynamics and formation of coronal loops and temperature structure of the coronal features; (iii) the origin, cause and acceleration of coronal mass ejections (CMEs) and other solar active features, and (iv) coronal magnetic field topology and three-dimensional structures of CMEs using polarization information. The uniqueness of this payload compared to previously flown space instruments is as follows: (a) observations in the visible wavelength closer to the disk (down to 1.05 solar radii); (b) high time cadence capability (better than two-images per second), and (c) simultaneous observations of at least two spectral windows all the time and three spectral windows for short durations.

Azidothymidine induces apoptosis in mouse myeloma cell line Sp2/0

Azidothymidine (AZT), which has been extensively used as an antiviral agent in the treatment of AIDS, showed strong inhibition of growth of Sp2/0 cells in vitro. AZT-treated cells showed a decrease in viability in a dose-dependent manner. AZT specifically induced typical apoptotic cell death with DNA double-strand cleavage and subsequent formation of apoptotic bodies. The induction of DNA double-strand cleavage into the oligonucleosomal ladder by AZT was protected in the presence of thymidine or uridine. An increase in endonuclease activity from nuclear extract of AZT-treated cells was observed. The enzyme activity was found to be Ca2+- and Mg2+-dependent and was inhibited by zinc acetate. A marked enhancement of PARP activity was observed in AZT-treated cells. These observations show that AZT can trigger both morphological and biochemical changes typical of apoptosis in the mouse myeloma cell line Sp2/0.

Line clipping revisited: Two efficient algorithms based on simple geometric observations

Two new line clipping algorithms, the opposite-corner algorithm and the perpendicular-distance algorithm, that are based on simple geometric observations are presented. These algorithms do not require computation of outcodes nor do they depend on the parametric representations of the lines. It is shown that the opposite-corner algorithm perform consistently better than an algorithm due to Nicholl, Lee, and Nicholl which is claimed to be better than the classic algorithm due to Cohen-Sutherland and the more recent Liang-Barsky algorithm. The pseudo-code of the opposite-corner algorithm is provided in the Appendix.