Influence of additives on the charactaristics of stone matrix asphalt

The increase in traffic growth and maintenance expenditures demands the urgent need for building better, long-lasting, and more efficient roads preventing or minimizing bituminous pavement distresses. Many of the principal distresses in pavements initiate or increase in severity due to the presence of water. In Kerala highways, where traditional dense graded mixtures are used for the surface courses, major distress is due to moisture induced damages. The Stone Matrix Asphalt (SMA) mixtures provide a durable surface course. Proven field performance of test track at Delhi recommends Stone Matrix Asphalt as a right choice to sustain severe climatic and heavy traffic conditions. But the concept of SMA in India is not so popularized and its application is very limited mainly due to the lack of proper specifications. This research is an attempt to study the influence of additives on the characteristics of SMA mixtures and to propose an ideal surface course for the pavements. The additives used for this investigation are coir, sisal, banana fibres (natural fibres), waste plastics (waste material) and polypropylene (polymer). A preliminary investigation is conducted to characterize the materials used in this study. Marshall test is conducted for optimizing the SMA mixtures (Control mixture-without additives and Stabilized mixtures with additives). Indirect tensile strength tests, compression strength tests, triaxial strength tests and drain down sensitivity tests are conducted to study the engineering properties of stabilized mixtures. The comparison of the performance of all stabilized mixtures with the control mixture and among themselves are carried out. A statistical analysis (SPSS package Ver.16) is performed to establish the findings of this study

Squared interaction matrix Sherrington-Kirkpatrick model for a spin glass

The mean-field theory of a spin glass with a specific form of nearest- and next-nearest-neighbor interactions is investigated. Depending on the sign of the interaction matrix chosen we find either the continuous replica symmetry breaking seen in the Sherrington-Kirkpartick model or a one-step solution similar to that found in structural glasses. Our results are confirmed by numerical simulations and the link between the type of spin-glass behavior and the density of eigenvalues of the interaction matrix is discussed.

Semiclassical evaluation of average nuclear one- and two-body matrix elements

Thomas-Fermi theory is developed to evaluate nuclear matrix elements averaged on the energy shell, on the basis of independent particle Hamiltonians. One- and two-body matrix elements are compared with the quantal results, and it is demonstrated that the semiclassical matrix elements, as function of energy, well pass through the average of the scattered quantum values. For the one-body matrix elements it is shown how the Thomas-Fermi approach can be projected on good parity and also on good angular momentum. For the two-body case, the pairing matrix elements are considered explicitly.

Density matrix functional theory that includes pairing correlations

The extension of density functional theory (DFT) to include pairing correlations without formal violation of the particle-number conservation condition is described. This version of the theory can be considered as a foundation of the application of existing DFT plus pairing approaches to atoms, molecules, ultracooled and magnetically trapped atomic Fermi gases, and atomic nuclei where the number of particles is conserved exactly. The connection with Hartree-Fock-Bogoliubov (HFB) theory is discussed, and the method of quasilocal reduction of the nonlocal theory is also described. This quasilocal reduction allows equations of motion to be obtained which are much simpler for numerical solution than the equations corresponding to the nonlocal case. Our theory is applied to the study of some even Sn isotopes, and the results are compared with those obtained in the standard HFB theory and with the experimental ones.

Computing median and antimedian sets in median graphs

The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes

On the remoteness function in median graphs

A profile on a graph G is any nonempty multiset whose elements are vertices from G. The corresponding remoteness function associates to each vertex x 2 V.G/ the sum of distances from x to the vertices in the profile. Starting from some nice and useful properties of the remoteness function in hypercubes, the remoteness function is studied in arbitrary median graphs with respect to their isometric embeddings in hypercubes. In particular, a relation between the vertices in a median graph G whose remoteness function is maximum (antimedian set of G) with the antimedian set of the host hypercube is found. While for odd profiles the antimedian set is an independent set that lies in the strict boundary of a median graph, there exist median graphs in which special even profiles yield a constant remoteness function. We characterize such median graphs in two ways: as the graphs whose periphery transversal number is 2, and as the graphs with the geodetic number equal to 2. Finally, we present an algorithm that, given a graph G on n vertices and m edges, decides in O.mlog n/ time whether G is a median graph with geodetic number 2

Simultaneous Embeddings Of Graphs As Median And Antimedian Subgraphs

The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The set of vertices in G with maximum (minimum) distance is the antimedian (median) set of a graph G. It is proved that for arbitrary graphs G and J and a positive integer r 2, there exists a connected graph H such that G is the antimedian and J the median subgraphs of H, respectively, and that dH(G, J) = r. When both G and J are connected, G and J can in addition be made convex subgraphs of H.

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

Almost Self-Centered Median And Chordal Graphs

Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is much richer, despite the fact that their diameter is at most 3. We also discuss almost self-centered graphs among partial cubes and among k-chordal graphs, classes of graphs that generalize median and chordal graphs, respectively. Characterizations of almost self-centered graphs among these two classes seem elusive

The median function on graphs with bounded profiles

The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that minimize the sum of distances from x to the vertices of . It is shown that for profiles with diameter the median set can be computed within an isometric subgraph of G that contains a vertex x of and the r -ball around x, where r > 2 − 1 − 2 /| |. The median index of a graph and r -joins of graphs are introduced and it is shown that r -joins preserve the property of having a large median index. Consensus strategies are also briefly discussed on a graph with bounded profiles.

Median computation in graphs using consensus strategies

Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of pro¯les. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strategies on median computation in arbitrary graphs is discussed

Median graphs, the remoteness function, periphery transversals, and geodetic number two

A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed

Artificial neural network modeling for surface roughness prediction in cylindrical grinding of Al‐SiCp metal matrix composites and ANOVA analysis

Metal matrix composites (MMC) having aluminium (Al) in the matrix phase and silicon carbide particles (SiCp) in reinforcement phase, ie Al‐SiCp type MMC, have gained popularity in the re‐cent past. In this competitive age, manufacturing industries strive to produce superior quality products at reasonable price. This is possible by achieving higher productivity while performing machining at optimum combinations of process variables. The low weight and high strength MMC are found suitable for variety of components

Influence Of Additives On The Drain Down Characteristics Of Stone Matrix Asphalt Mixtures

In Kerala highways, where traditional dense graded mixtures are used for the surface courses, major distress is due to moisture induced damages. Development of stabilized Stone Matrix Asphalt (SMA) mixtures for improved pavement performance has been the focus of research all over the world for the past few decades. Many successful attempts are made to stabilize SMA mixtures with synthetic fibres and polymers. India, being an agricultural economy produces fairly huge quantity of natural fibres such as coconut, sisal, banana, sugar cane, jute etc.. Now- a -days the disposal of waste plastics is a major concern for an eco- friendly sustainable environment. This paper focuses on the influence of additives like coir, sisal, banana fibres (natural fibres), waste plastics (waste material) and polypropylene (polymer) on the drain down characteristics of SMA mixtures. A preliminary investigation is conducted to characterize the materials used in this study. Drain down sensitivity tests are conducted to study the bleeding phenomena and drain down of SMA mixtures. Based on the drain down characteristics of the various stabilized mixtures it is inferred that the optimum fibre content is 0.3% by weight of mixture for all fibre mixtures irrespective of the type of fibre. For waste plastics and polypropylene stabilized SMA mixtures, the optimum additive contents are respectively 7% and 5% by weight of mixture. Due to the absorptive nature of fibres, fibre stabilizers are found to be more effective in reducing the drain down of the SMA mixture. The drain values for the waste plastics mix is within the required specification range. The coir fibre additive is the best among the fibres investigated. Sisal and banana fibre mixtures showed almost the same characteristics on stabilization.