Influence of initial degree of saturation on swell pressures of compacted Barmer bentonite specimens

Densely compacted bentonite or bentonite-sand mixture has been identified as suitable buffer in deep geological repositories as its exceptionally high swelling capacity enables tight contact between the waste canister and surrounding rock. The degree of saturation of the compacted bentonite buffer can increase upon ingress of groundwater from the surrounding rock mass or decrease from evaporation due to high temperature (50-210 degrees C) derived from the waste canister. Available studies indicate that the influence of initial moisture content or degree of saturation on the swell pressure or swell potential of compacted bentonites is unclear. Some studies suggest that initial degree of saturation has an influence, while others suggest that it does not have bearing on the swell pressure of compacted bentonites. This paper examines the influence of initial degree of saturation in montmorillonite voids (termed,S-r,S-MF) on swell pressure of compacted Barmer bentonite-sand mixtures (dry density range: 1.4-2 Mg/m(3)) from micro-structural considerations. The experimental results bring out that, constant dry density specimens that developed similar number of hydration layers upon wetting developed comparable swell pressures and were unaffected by variations in initial S-r,S-MF values. Comparatively, constant dry density specimens that developed dis-similar number of hydration layers upon wetting established different swell pressures and were responsive to variations in initial S-r,S-MF. (C) 2015 Elsevier Ltd. All rights reserved.

MODELING AND SIMULATION OF A THREE-WHEELED MOBILE ROBOT ON UNEVEN TERRAINS WITH TWO-DEGREE-OF-FREEDOM SUSPENSION MECHANISMS

A wheeled mobile robot (WMR) will move on an uneven terrain without slip if its torus-shaped wheels tilt in a lateral direction. An independent two degree-of-freedom (DOF) suspension is required to maintain contact with uneven terrain and for lateral tilting. This article deals with the modeling and simulation of a three-wheeled mobile robot with torus-shaped wheels and four novel two-DOF suspension mechanism concepts. Simulations are performed on an uneven terrain for three representative pathsa straight line, a circular, and an S'-shaped path. Simulations show that a novel concept using double four-bar mechanism performs better than the other three concepts.

Three-degree-of-freedom Parallel Manipulator to Track the Sun for Concentrated Solar Power Systems

In concentrated solar power(CSP) generating stations, incident solar energy is reflected from a large number of mirrors or heliostats to a faraway receiver. In typical CSP installations, the mirror needs to be moved about two axes independently using two actuators in series with the mirror effectively mounted at a single point. A three degree-of-freedom parallel manipulator, namely the 3-RPS parallel manipulator, is proposed to track the sun. The proposed 3-RPS parallel manipulator supports the load of the mirror, structure and wind loading at three points resulting in less deflection, and thus a much larger mirror can be moved with the required tracking accuracy and without increasing the weight of the support structure. The kinematics equations to determine motion of the actuated prismatic joints in the 3-RPS parallel manipulator such that the sun's rays are reflected on to a stationary receiver are developed. Using finite element analysis, it is shown that for same sized mirror, wind loading and maximum deflection requirement, the weight of the support structure is between 15% and 60% less with the 3-RPS parallel manipulator when compared to azimuth-elevation or the target-aligned configurations.

A mobile robot with a two-degree-of-freedom suspension for traversing uneven terrain with minimal slip: Modeling, simulation and experiments

It is known in literature that a wheeled mobile robot (WMR) with fixed length axle will slip on an uneven terrain. One way to avoid wheel slip is to use a torus-shaped wheel with lateral tilt capability which allows the distance between the wheel-ground contact points to change even with a fixed length axle. Such an arrangement needs a two degree-of-freedom (DOF) suspension for the vertical and lateral tilting motion of the wheel. In this paper modeling, simulation, design and experimentation with a three-wheeled mobile robot, with torus-shaped wheels and a novel two DOF suspension allowing independent lateral tilt and vertical motion, is presented. The suspension is based on a four-bar mechanism and is called the double four-bar (D4Bar) suspension. Numerical simulations show that the three-wheeled mobile robot can traverse uneven terrain with low wheel slip. Experiments with a prototype three-wheeled mobile robot moving on a constructed uneven terrain along a straight line, a circular arc and a path representing a lane change, also illustrate the low slip capability of the three-wheeled mobile robot with the D4Bar suspension. (C) 2015 Elsevier Ltd. All rights reserved.

In-situ synthesized poly(vinyl butyral)/MMT-clay nanocomposites: The role of degree of acetalization and clay content on thermal, mechanical and permeability properties of PVB matrix

Poly(vinyl butyral) - MMT clay nanocomposites were synthesized in situ with three different degrees of acetalization and with varying clay content for each vinyl butyral polymer ratio. The clay nano-platelet galleries were expanded, as determined by X-ray diffraction and TEM analysis. The glass transition temperature of the polymer nanocomposites were found to be similar to 56 degrees C and similar to 52 degrees C for the neat polymer and the 4% clay loaded samples, respectively. The 4 wt% clay loaded film showed higher strength and low strain to failure. The dynamic mechanical analysis also confirmed the improved stability of the matrix. The matrix with 0.5 butyral to alcohol ratio for 4 wt% clay exhibited good water vapor transmission compared to all other compositions. The encapsulated devices with 2.5 and 4 wt% clay loaded films increases the device life time and the efficiencies of these films were 50% higher than their encapsulated pristine polymer films. (C) 2015 Elsevier Ltd. All rights reserved.

Identification of type and degree of railway ballast fouling using ground coupled GPR antennas

GPR is widely used for ballast fouling identification, however, there are no robust guidelines to find the degree and type of fouling quantitatively. In this study, GPR studies were carried out on model and actual railway tracks using three ground coupled antennas and considering three fouling materials. Three ground coupled antennas viz., 100 MHz, 500 MHz and 800 MHz antennas were used for the initial survey and it was found that the 800 MHz ground coupled antenna is an optimum one to get quality results. Three major fouling materials viz., screened/broken ballast, coal and iron ore were used to construct prototype model sections, which were 1/2 of the actual Indian broad-gauge railway track. A separate model section has been created for each degree and type of fouling and GPR surveys were carried out. GPR study shows that increasing the fouling content results in a decrease in the Electromagnetic Wave (EMW) velocity and an increase in the dielectric constant. EMW velocity of ballast fouled with screened ballast was found to be more than coal fouled ballast and iron ore fouled ballast at any degree of fouling and EMW velocity of iron ore fouled ballast was found to be less than coal and screen ballast fouled ballast. Dielectric constant of iron ore fouled ballast was found to be higher than coal and screen ballast fouled ballast for all degrees of fouling. Average slope of the trend line of screen ballast fouled section is low (25.6 degrees), coal fouled ballast is medium (27.8 degrees) and iron ore fouled ballast is high (47.6 degrees). (C) 2016 Elsevier B.V. All rights reserved.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

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 is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

A Gaussian quadrature analysis of linear sweep voltammetry

The application of Gaussian Quadrature (GQ) procedures to the evaluation of i—E curves in linear sweep voltammetry is advocated. It is shown that a high degree of precision is achieved with these methods and the values obtained through GQ are in good agreement with (and even better than) the values reported in literature by Nicholson-Shain, for example. Another welcome feature with GQ is its ability to be interpreted as an elegant, efficient analytic approximation scheme too. A comparison of the values obtained by this approach and by a recent scheme based on series approximation proposed by Oldham is made and excellent agreement is shown to exist.

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.

Confined fluids in a Janus pore: influence of surface asymmetry on structure and solvation forces

Density distribution, fluid structure and solvation forces for fluids confined in Janus slit-shaped pores are investigated using grand canonical Monte Carlo simulations. By varying the degree of asymmetry between the two smooth surfaces that make up the slit pores, a wide variety of adsorption situations are observed. The presence of one moderately attractive surface in the asymmetric pore is sufficient to disrupt the formation of frozen phases observed in the symmetric case. In the extreme case of asymmetry in which one wall is repulsive, the pore fluid can consist of a frozen contact layer at the attractive surface for smaller surface separations (H) or a frozen contact layer with liquid-like and gas-like regions as the pore width is increased. The superposition approximation, wherein the solvation pressure and number density in the asymmetric pores can be obtained from the results on symmetric pores, is found to be accurate for H > 4 sigma(ff), where sigma(ff) is the Lennard-Jones fluid diameter and within 10% accuracy for smaller surface separations. Our study has implications in controlling stick slip and overcoming static friction `stiction' in micro and nanofluidic devices.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

Fault-tolerant characteristics and topological properties of a hierarchical network of hypercubes

We analyse the fault-tolerant parameters and topological properties of a hierarchical network of hypercubes. We take a close look at the Extended Hypercube (EH) and the Hyperweave (HW) architectures and also compare them with other popular architectures. These two architectures have low diameter and constant degree of connectivity making it possible to expand these networks without affecting the existing configuration. A scheme for incrementally expanding this network is also presented. We also look at the performance of the ASCEND/DESCEND class of algorithms on these architectures.

Inverse Sensitivity Analysis of Singular Solutions of FRF matrix in Structural System Identification

The problem of structural damage detection based on measured frequency response functions of the structure in its damaged and undamaged states is considered. A novel procedure that is based on inverse sensitivity of the singular solutions of the system FRF matrix is proposed. The treatment of possibly ill-conditioned set of equations via regularization scheme and questions on spatial incompleteness of measurements are considered. The application of the method in dealing with systems with repeated natural frequencies and (or) packets of closely spaced modes is demonstrated. The relationship between the proposed method and the methods based on inverse sensitivity of eigensolutions and frequency response functions is noted. The numerical examples on a 5-degree of freedom system, a one span free-free beam and a spatially periodic multi-span beam demonstrate the efficacy of the proposed method and its superior performance vis-a-vis methods based on inverse eigensensitivity.

Effects of the filling process on the evolution of the mushy zone and macrosegregation in alloy casting

A numerical model of the entire casting process starting from the mould filling stage to complete solidification is presented. The model takes into consideration any phase change taking place during the filling process. A volume of fluid method is used for tracking the metal–air interface during filling and an enthalpy based macro-scale solidification model is used for the phase change process. The model is demonstrated for the case of filling and solidification of Pb–15 wt%Sn alloy in a side-cooled two-dimensional rectangular cavity, and the resulting evolution of a mushy region and macrosegregation are studied. The effects of process parameters related to filling, namely degree of melt superheat and filling velocity on macrosegregation in the cavity, are also investigated. Results show significant differences in the progress of the mushy zone and macrosegregation pattern between this analysis and conventional analysis without the filling effect.