Comments on Identification of Totally Symmetric Boolean Functions

A modification in the algorithm for the detection of totally symmetric functions as expounded by the author in an earlier note1 is presented here. The modified algorithm takes care of a limited number of functions that escape detection by the previous method.

Algorithms for Constructing Hierarchical Graphs

An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.

Algorithms for Constructing Hierarchical Graphs

An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.

The heat capacity of liquid carbon disulfide + acetonitrile, especially near the upper critical solution temperature

The heat capacity Cp of the binary liquid system CS2 + CH3CN has been studied. This system has an upper critical solution temperature To ≈ 323.4 K and a critical mole fraction of CS2xo ≈ 0.5920. Measurements were made both for mixtures close to and far away from the critical region. The heat capacity of the mixture with x = xo exhibits a symmetric logarithmic anomaly around Tc, which is apparently preserved even for compositions in the immediate vicinity of xc. For compositions far away from xc, only a normal rise in Cp over the covered temperature range is observed.

Analysis of microstructure and texture evolution in pure magnesium during symmetric and asymmetric rolling

Asymmetric rolling of commercially pure magnesium was carried out at three different temperatures: room temperature, 200 degrees C and 350 degrees C. Systematic analysis of microstructures, grain size distributions, texture and misorientation distributions were performed using electron backscattered diffraction in a field emission gun scanning electron microscope. The results were compared with conventional (symmetric) rolling carried out under the same conditions of temperature and strain rate. Simulations of deformation texture evolution were performed using the viscoplastic self-consistent polycrystal plasticity model. The main trends of texture evolution are faithfully reproduced by the simulations for the tests at room temperature. The deviations that appear for the textures obtained at high temperature can be explained by the occurrence of dynamic recrystallization. Finally, the mechanisms of texture evolution in magnesium during asymmetric and symmetric rolling are explained with the help of ideal orientations, grain velocity fields and divergence maps displayed in orientation space.

Vertical uplift resistance of circular plate anchors in clays under undrained condition

The vertical uplift resistance of circular plate anchors, embedded horizontally in a clayey stratum whose cohesion increases linearly with depth, has been obtained under undrained (phi = 0) condition. The axi-symmetric static limit analysis formulation in combination with finite elements proposed recently by the authors has been employed. The variation of the uplift factor (F,) with changes in the embedment ratio (H/B) has been computed for several rates of increases of soil cohesion with depth. It is noted that in all the cases, the magnitude of F-c increases continuously with depth up to a certain value of H-cr/B beyond which the uplift factor becomes essentially constant. The proposed static limit analysis formulation is seen to provide acceptable results even for the two other simple chosen axi-symmetric problems.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

Acyclic edge coloring of subcubic graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.

Random security scheme selection for mobile transactions

Security in a mobile communication environment is always a matter for concern, even after deploying many security techniques at device, network, and application levels. The end-to-end security for mobile applications can be made robust by developing dynamic schemes at application level which makes use of the existing security techniques varying in terms of space, time, and attacks complexities. In this paper we present a security techniques selection scheme for mobile transactions, called the Transactions-Based Security Scheme (TBSS). The TBSS uses intelligence to study, and analyzes the security implications of transactions under execution based on certain criterion such as user behaviors, transaction sensitivity levels, and credibility factors computed over the previous transactions by the users, network vulnerability, and device characteristics. The TBSS identifies a suitable level of security techniques from the repository, which consists of symmetric, and asymmetric types of security algorithms arranged in three complexity levels, covering various encryption/decryption techniques, digital signature schemes, andhashing techniques. From this identified level, one of the techniques is deployed randomly. The results shows that, there is a considerable reduction in security cost compared to static schemes, which employ pre-fixed security techniques to secure the transactions data.

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.

Behaviour of Bi-material interface cracks in the presence of material nonlinearity of adherends

The well known features of crack face interpenetration/contact at the tip of an interface crack is re-examined using finite element analysis and assuming material nonlinear properties for the adherends. It was assumed in literature that the crack tips are fully open at all load levels in the presence of material nonlinearity of the adherends. Analysis for the case of remote tension shows that even in the presence of material nonlinearity, crack tip closes at small load levels and opens above a certain load level. Mixed-mode fracture parameters are evaluated for the situation when the crack tips are fully open. Due to the presence of nonlinearity, the mixed-mode fracture parameters are measured with the symmetric and anti-symmetric components of J-integral. The present analysis explains the sequence of events at the interface crack tip with progressively increasing remote tension load for the case of adherends with material nonlinear behaviour.

Off-axis field approximations for ion traps with apertures

In recent work (Int. J. Mass Spec., vol. 282, pp. 112–122) we have considered the effect of apertures on the fields inside rf traps at points on the trap axis. We now complement and complete that work by considering off-axis fields in axially symmetric (referred to as “3D”) and in two dimensional (“2D”) ion traps whose electrodes have apertures, i.e., holes in 3D and slits in 2D. Our approximation has two parts. The first, EnoAperture, is the field obtained numerically for the trap under study with apertures artificially closed. We have used the boundary element method (BEM) for obtaining this field. The second part, EdueToAperture, is an analytical expression for the field contribution of the aperture. In EdueToAperture, aperture size is a free parameter. A key element in our approximation is the electrostatic field near an infinite thin plate with an aperture, and with different constant-valued far field intensities on either side. Compact expressions for this field can be found using separation of variables, wherein the choice of coordinate system is crucial. This field is, in turn, used four times within our trap-specific approximation. The off-axis field expressions for the 3D geometries were tested on the quadrupole ion trap (QIT) and the cylindrical ion trap (CIT), and the corresponding expressions for the 2D geometries were tested on the linear ion trap (LIT) and the rectilinear ion trap (RIT). For each geometry, we have considered apertures which are 10%, 30%, and 50% of the trap dimension. We have found that our analytical correction term EdueToAperture, though based on a classical small-aperture approximation, gives good results even for relatively large apertures.

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

Spherical means with centers on a hyperplane in even dimensions

Given a real-valued function on R-n we study the problem of recovering the function from its spherical means over spheres centered on a hyperplane. An old paper of Bukhgeim and Kardakov derived an inversion formula for the odd n case with great simplicity and economy. We apply their method to derive an inversion formula for the even n case. A feature of our inversion formula, for the even n case, is that it does not require the Fourier transform of the mean values or the use of the Hilbert transform, unlike the previously known inversion formulas for the even n case. Along the way, we extend the isometry identity of Bukhgeim and Kardakov for odd n, for solutions of the wave equation, to the even n case.

Hadwiger Number and the Cartesian Product of Graphs

The Hadwiger number eta(G) of a graph G is the largest integer n for which the complete graph K-n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, eta(G) >= chi(G), where chi(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G square H of graphs. As the main result of this paper, we prove that eta(G(1) square G(2)) >= h root 1 (1 - o(1)) for any two graphs G(1) and G(2) with eta(G(1)) = h and eta(G(2)) = l. We show that the above lower bound is asymptotically best possible when h >= l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following: 1. Let G be a connected graph. Let G = G(1) square G(2) square ... square G(k) be the ( unique) prime factorization of G. Then G satisfies Hadwiger's conjecture if k >= 2 log log chi(G) + c', where c' is a constant. This improves the 2 log chi(G) + 3 bound in [2] 2. Let G(1) and G(2) be two graphs such that chi(G1) >= chi(G2) >= clog(1.5)(chi(G(1))), where c is a constant. Then G1 square G2 satisfies Hadwiger's conjecture. 3. Hadwiger's conjecture is true for G(d) (Cartesian product of G taken d times) for every graph G and every d >= 2. This settles a question by Chandran and Sivadasan [2]. ( They had shown that the Hadiwger's conjecture is true for G(d) if d >= 3).