Vibration of simply-supported trapezoidal plates II. Unsymmetric trapezoids

This paper deals with the investigation of the vibration characteristics of simply-supported unsymmetric trapezoidal plates. For numerical calculations, the relationship between the eigenvalue problems of a polygonal simply-supported plate and polygonal membrane is again effectively utilized. The Galerkin method is applied, with the deflection surface expressed in terms of a Fourier sine series in transformed coordinates. Numerical values for the first seven to eight frequencies for different geometries of the unsymmetric trapezoid are presented in the form of tables. Also the nodal patterns for a few representative configurations are presented.

On the use of a coordinate transformation for analysis of axisymmetric vibration of polar orthotropic annular plates

Estimates of natural frequencies corresponding to axisymmetric modes of flexural vibration of polar orthotropic annular plates have been obtained for various combinations of clamped, simply supported and free edge conditions. A coordinate transformation in the radial direction has been used to obtain effective solutions by the classical Rayleigh-Ritz method. The analysis with this transformation has been found to be advantageous in computations, particularly for large hole sizes, over direct analysis. Numerical results have been obtained for various values of hole sizes and rigidity ratio. The eigenvalue parameter has been found to vary more or less linearly with the rigidity ratio. A comparison with the results for isotropic plates has brought out some interesting features.

A new class of separators and planarity of chordal graphs

We introduce a new class of clique separators, called base sets, for chordal graphs. Base sets of a chordal graph closely reflect its structure. We show that the notion of base sets leads to structural characterizations of planar k-trees and planar chordal graphs. Using these characterizations, we develop linear time algorithms for recognizing planar k-trees and planar chordal graphs. These algorithms are extensions of the Lexicographic_Breadth_First_Search algorithm for recognizing chordal graphs and are much simpler than the general planarity checking algorithm. Further, we use the notion of base sets to prove the equivalence of hamiltonian 2-trees and maximal outerplanar graphs.

A chemical approach to an understanding of the fast ion conduction in silver iodide-silver oxysalt glasses

A number of AgI based fast ion conducting glasses, with a general formula AgI---Ag2O---MxOy (MxOy=MoO3, SeO3, WO3, V2O5, P2O5, GeO2, B2O3, As2O3, CrO3) have been studied. A chemical approach is made to investigate the origin of fast ion conduction in these glasses. An index known as Image tructural Image npinning Image umber, SUN (S), has been defined for the purpose, based on the unscreened nuclear charge of silver ions and the equilibrium lectronegativities of the halide-oxyanion matrix in these glasses. The variation of the glass transition temperature, Tg, conductivity, σ, and the energy of activation, Ea, with the concentration of AgI are discussed in the light of the structural unpinning number. Conductivities increase uniformly in any given glass series as a smooth function of S and level off at very high values. The entire range of conductivity appears to vary as ln Image , where ln σ0 corresponds roughly to the conductivity of the hypothetical AgI glass and “a” is a constant which could be obtained as the slope in the graph of ln Ea versus S. It is suggested that the increase in the concentration of AgI beyond 75–80 mole% in the glass is not advantageous from the conductivity point of view.

On the complexity of finding stopping set size in Tanner Graphs

The problem of determining whether a Tanner graph for a linear block code has a stopping set of a given size is shown to be NT-complete.

Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).

Parallelization of an unstructured data based cell centre finite volume code, HIFUN-3D

This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center

The Amenability Studies on Beneficiation of Low Grade Phyllite Deposits of Tungsten From Degana, Rajasthan

The phyllite deposit of Degana, Rajasthan, containing tungsten values in the form of wolframite, (Fe, MnWO sub 4 ) finely dispersed in the quartz groundmass, has been quantitatively analysed to give 0.063% WO sub 3 , 6.66% Fe sub 2 O sub 3 , 14.30% Al sub 2 O sub 3 and 67.4% SiO sub 2 . The major gangue minerals identified are quartz, iron oxides and mica along with minor amounts of graphite, fluorite and sulphides. The amenability of the ore to gravity concentration, magnetic separation and a combination of the processes has been studied. A combination of tabling on --100 mesh ground ore and dry magnetic separation of the tabled concentrate gave a final concentrate containing 1.834% WO sub 3 with an overall recovery of only 4.6%. The complex mineralogy combined with fine dispersion of very low W values have contributed to the low recoveries and grades. Graph, photomicrographs. 10 ref.--AA

Splittings of free groups, normal forms and partitions of ends

Splittings of a free group correspond to embedded spheres in the 3-manifold M = # (k) S (2) x S (1). These can be represented in a normal form due to Hatcher. In this paper, we determine the normal form in terms of crossings of partitions of ends corresponding to normal spheres, using a graph of trees representation for normal forms. In particular, we give a constructive proof of a criterion determining when a conjugacy class in pi (2)(M) can be represented by an embedded sphere.

Role of external electron donor in methylene blue sensitized dichromated gelatin holograms:an experimental study

An experimental study to ascertain the role of external electron donor in methylene blue sensitized dichromated gelatin (MBDCG) holograms has been carried out. The required volume holographic transmission gratings in MBDCG have been recorded using 633-nm light from a He-Ne laser. Three well-known electron donors, namely, N, N-dimethylformamide (DMF); ethylenediaminetetraacetic acid (EDTA); triethanolamine (TEA), were used in this study. The variation of diffraction efficiency (η) as a function of light exposure (E) and concentration (C) of the electron donor under consideration was chosen as the figure of merit for judging the role of external electron donor in MBDCG holograms. A self-consistent analysis of the experimental results was carried out by recalling the various known facts about the photochemistry and the hologram formation in DSDCG and also DCG. The important findings and conclusions are as follows: (i) Each η vs E graph is a bell-shaped curve and its peak height is influenced in a characteristic manner by the external electron donor used. (ii) High diffraction efficiency/recording speed can be achieved in pure MBDCG holograms. (iii) The diffraction efficiency/recording speed achieved in electron donor sensitized MBDCG holograms did not show any significant improvement at all over that observed in pure MBDCG holograms. (iv) In electron donor sensitized MBDCG holograms, the electron donor used, depending on its type and concentration, appears to promote the process of cross-linking of gelatin molecules in a manner to either retain or deteriorate the refractive-index modulation achieved using pure MBDCG.

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.

Design of nonequivalent self-routing networks based on a matrix model

In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.

Metabolome based reaction graphs of M.tuberculosis and M.leprae: A comparative network analysis

Background. Several types of networks, such as transcriptional, metabolic or protein-protein interaction networks of various organisms have been constructed, that have provided a variety of insights into metabolism and regulation. Here, we seek to exploit the reaction-based networks of three organisms for comparative genomics. We use concepts from spectral graph theory to systematically determine how differences in basic metabolism of organisms are reflected at the systems level and in the overall topological structures of their metabolic networks. Methodology/Principal Findings. Metabolome-based reaction networks of Mycobacterium tuberculosis, Mycobacterium leprae and Escherichia coli have been constructed based on the KEGG LIGAND database, followed by graph spectral analysis of the network to identify hubs as well as the sub-clustering of reactions. The shortest and alternate paths in the reaction networks have also been examined. Sub-cluster profiling demonstrates that reactions of the mycolic acid pathway in mycobacteria form a tightly connected sub-cluster. Identification of hubs reveals reactions involving glutamate to be central to mycobacterial metabolism, and pyruvate to be at the centre of the E. coli metabolome. The analysis of shortest paths between reactions has revealed several paths that are shorter than well established pathways. Conclusions. We conclude that severe downsizing of the leprae genome has not significantly altered the global structure of its reaction network but has reduced the total number of alternate paths between its reactions while keeping the shortest paths between them intact. The hubs in the mycobacterial networks that are absent in the human metabolome can be explored as potential drug targets. This work demonstrates the usefulness of constructing metabolome based networks of organisms and the feasibility of their analyses through graph spectral methods. The insights obtained from such studies provide a broad overview of the similarities and differences between organisms, taking comparative genomics studies to a higher dimension.

Analysis of Torsional Interactions with Power System Stabilizer

Torsional interactions can occur due to the speed input Power System Stabilizer (PSS) that are primarily used to damp low frequency oscillations. The solution to this problem can be either in the form of providing a torsional filter or developing an alternate signal for the PSS. This paper deals with the formulation of a linearized state space model of the system and study of the interactions using eigenvalue analysis. The effects of the parameters of PSS and control signals on the damping of torsional modes are investigated.

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.