Search results for: cubic graphs

Authors: Zhipeng Chen, Peng Zhang, Qingyun Liu, Li Guo

Abstract:

With the Internet becoming the dominant channel for business and life, many IPs are increasingly masked using web proxies for illegal purposes such as propagating malware, impersonate phishing pages to steal sensitive data or redirect victims to other malicious targets. Moreover, as Internet traffic continues to grow in size and complexity, it has become an increasingly challenging task to detect the proxy service due to their dynamic update and high anonymity. In this paper, we present an approach based on behavioral graph analysis to study the behavior similarity of web proxy users. Specifically, we use bipartite graphs to model host communications from network traffic and build one-mode projections of bipartite graphs for discovering social-behavior similarity of web proxy users. Based on the similarity matrices of end-users from the derived one-mode projection graphs, we apply a simple yet effective spectral clustering algorithm to discover the inherent web proxy users behavior clusters. The web proxy URL may vary from time to time. Still, the inherent interest would not. So, based on the intuition, by dint of our private tools implemented by WebDriver, we examine whether the top URLs visited by the web proxy users are web proxies. Our experiment results based on real datasets show that the behavior clusters not only reduce the number of URLs analysis but also provide an effective way to detect the web proxies, especially for the unknown web proxies.

Keywords: bipartite graph, one-mode projection, clustering, web proxy detection

Procedia PDF Downloads 245

Authors: Abderrahim Elmoataz

Abstract:

More and more contemporary applications involve data in the form of functions defined on irregular and topologically complicated domains (images, meshs, points clouds, networks, etc). Such data are not organized as familiar digital signals and images sampled on regular lattices. However, they can be conveniently represented as graphs where each vertex represents measured data and each edge represents a relationship (connectivity or certain affinities or interaction) between two vertices. Processing and analyzing these types of data is a major challenge for both image and machine learning communities. Hence, it is very important to transfer to graphs and networks many of the mathematical tools which were initially developed on usual Euclidean spaces and proven to be efficient for many inverse problems and applications dealing with usual image and signal domains. Historically, the main tools for the study of graphs or networks come from combinatorial and graph theory. In recent years there has been an increasing interest in the investigation of one of the major mathematical tools for signal and image analysis, which are Partial Differential Equations (PDEs) variational methods on graphs. The normalized p-laplacian operator has been recently introduced to model a stochastic game called tug-of-war-game with noise. Part interest of this class of operators arises from the fact that it includes, as particular case, the infinity Laplacian, the mean curvature operator and the traditionnal Laplacian operators which was extensiveley used to models and to solve problems in image processing. The purpose of this paper is to introduce and to study a new class of normalized p-Laplacian on graphs. The introduction is based on the extension of p-harmonious function introduced in as discrete approximation for both infinity Laplacian and p-Laplacian equations. Finally, we propose to use these operators as a framework for solving many inverse problems in image processing.

Keywords: normalized p-laplacian, image processing, stochastic game, inverse problems

Procedia PDF Downloads 512

Authors: Puttaswamy, Anwar Alwardi, Nayaka S. R.

Abstract:

One of the algebraic representation of a graph is the graph polynomial. In this article, we introduce the paired-domination polynomial of a graph G. The paired-domination polynomial of a graph G of order n is the polynomial Dp(G, x) with the coefficients dp(G, i) where dp(G, i) denotes the number of paired dominating sets of G of cardinality i and γpd(G) denotes the paired-domination number of G. We obtain some properties of Dp(G, x) and its coefficients. Further, we compute this polynomial for some families of standard graphs. Further, we obtain some characterization for some specific graphs.

Keywords: domination polynomial, paired dominating set, paired domination number, paired domination polynomial

Procedia PDF Downloads 232

Authors: Nayaka S.R., Putta Swamy, Purushothama S.

Abstract:

Let G=(V, E) be a graph. A dominating set S in G is a pendant dominating set if < S > contains a pendant vertex. A pendant dominating set of G which intersects every minimum pendant dominating set in G is called a transversal pendant dominating set. The minimum cardinality of a transversal pendant dominating set is called the transversal pendant domination number of G, denoted by γ_tp(G). In this paper, we begin to study this parameter. We calculate γ_tp(G) for some families of graphs. Furthermore, some bounds and relations with other domination parameters are obtained for γ_tp(G).

Keywords: dominating set, pendant dominating set, pendant domination number, transversal pendant dominating set, transversal pendant domination number

Procedia PDF Downloads 182

Authors: Severino Gervacio, Velimor Almonte, Emmanuel Natalio

Abstract:

A simple graph is planar if it there is a way of drawing it in the plane without edge crossings. A planar graph which is not a proper spanning subgraph of another planar graph is a maximal planar graph. We prove that for complete tripartite graphs of order at most 9, the only ones that contain a spanning maximal planar subgraph are K1,1,1, K2,2,2, K2,3,3, and K3,3,3. The main result gives a necessary and sufficient condition for the complete tripartite graph Kx,y,z to contain a spanning maximal planar subgraph.

Keywords: complete tripartite graph, graph, maximal planar graph, planar graph, subgraph

Procedia PDF Downloads 380

Authors: A. Kulandai Therese

Abstract:

The eccentric connectivity index based on degree and eccentricity of the vertices of a graph is a widely used graph invariant in mathematics.In this paper, we present the explicit eccentric connectivity index, first and second Zagreb indices for a Corona graph and sub division-related corona graphs.

Keywords: corona graph, degree, eccentricity, eccentric connectivity index, first zagreb index, second zagreb index, subdivision graphs

Procedia PDF Downloads 337

Authors: Nileshkumar Vaishnav, Aditya Tatu

Abstract:

An algebraic framework for processing graph signals axiomatically designates the graph adjacency matrix as the shift operator. In this setup, we often encounter a problem wherein we know the filtered output and the filter coefficients, and need to find out the input graph signal. Solution to this problem using direct approach requires O(N3) operations, where N is the number of vertices in graph. In this paper, we adapt the spectral graph partitioning method for partitioning of graphs and use it to reduce the computational cost of the filtering problem. We use the example of denoising of the temperature data to illustrate the efficacy of the approach.

Keywords: graph signal processing, graph partitioning, inverse filtering on graphs, algebraic signal processing

Procedia PDF Downloads 310

Authors: Amadou Fall Dia, Maurras Ulbricht Togbe, Aliou Boly, Zakia Kazi Aoul, Elisabeth Metais

Abstract:

Existing RDF (Resource Description Framework) Stream Processing (RSP) systems allow continuous processing of RDF data issued from different application domains such as weather station measuring phenomena, geolocation, IoT applications, drinking water distribution management, and so on. However, processing window phase often expires before finishing the entire session and RSP systems immediately delete data streams after each processed window. Such mechanism does not allow optimized exploitation of the RDF data streams as the most relevant and pertinent information of the data is often not used in a due time and almost impossible to be exploited for further analyzes. It should be better to keep the most informative part of data within streams while minimizing the memory storage space. In this work, we propose an RDF graph summarization system based on an explicit and implicit expressed needs through three main approaches: (1) an approach for user queries (SPARQL) in order to extract their needs and group them into a more global query, (2) an extension of the closeness centrality measure issued from Social Network Analysis (SNA) to determine the most informative parts of the graph and (3) an RDF graph summarization technique combining extracted user query needs and the extended centrality measure. Experiments and evaluations show efficient results in terms of memory space storage and the most expected approximate query results on summarized graphs compared to the source ones.

Keywords: centrality measures, RDF graphs summary, RDF graphs stream, SPARQL query

Procedia PDF Downloads 203

Authors: M. A. Ghebouli, A. Bouhemadou, H. Choutri, L. Louaila

Abstract:

Some physical properties of the cubic perovskites CsXF3 (X = Sr, Ca, and Hg) have been investigated using pseudopotential plane–wave (PP-PW) method based on the density functional theory (DFT). The calculated lattice constants within GGA (PBE) and LDA (CA-PZ) agree reasonably with the available experiment data. The elastic constants and their pressure derivatives are predicted using the static finite strain technique. We derived the bulk and shear moduli, Young’s modulus, Poisson’s ratio and Lamé’s constants for ideal polycrystalline aggregates. The analysis of B/G ratio indicates that CsXF3 (X = Ca, Sr, and Hg) are ductile materials. The thermal effect on the volume, bulk modulus, heat capacities CV, CP, and Debye temperature was predicted.

Keywords: perovskite, PP-PW method, elastic constants, electronic band structure

Procedia PDF Downloads 437

Authors: Jenna Metera, Olivia Graeve

Abstract:

Ceramic capacitor technologies using lead based materials is being phased out for its environmental and handling hazards. Bismuth ferrite (BiFeO₃) is the next best replacement for those lead-based technologies. Unfortunately, the electrical properties in bismuth systems are not as robust as the lead alternatives. The improvement of electrical properties such as charge density, charge anisotropy, relative permittivity, and dielectric loss are the parameters that will make BiFeO₃ a competitive alternative to lead-based ceramic materials. In order to maximize the utility of these properties, we propose the ordering and an evaporation-induced self-assembly of a cubic morphology powder. Evaporation-induced self-assembly is a template-less, bottom-up, self-assembly option. The capillary forces move the particles closer together when the solvent evaporates, promoting organized agglomeration at the particle faces. The assembly of particles into organized structures can lead to enhanced properties compared to unorganized structures or single particles themselves. The interactions between the particles can be controlled based on the long-range order in the organized structure. The cubic particle morphology is produced through a hydrothermal synthesis with changes in the concentration of potassium hydroxide, which changes the morphology of the powder. Once the assembly materializes, the powder is fabricated into workable substrates for electrical testing after consolidation.

Keywords: evaporation, lead-free, morphology, self-assembly

Procedia PDF Downloads 123

Authors: A. S. Hakeem, B. Ahmed, M. Ehsan, A. Ibrahim, H. M. Irshad, T. Laoui

Abstract:

Alumina (Al2O3) - cubic boron nitride (cBN) ceramic composites were sintered by spark plasma sintering (SPS) using α-Al2O3 particle sizes; 150 µm, 150 nm and cBN particle size of 42 µm. Alumina-cBN composites containing 10, 20 and 30wt% cBN with and without Ni coated were sintering at an elevated temperature of 1400°C at a constant uniaxial pressure of 50 MPa. The effect of matrix particle size, cBN and Ni content on mechanical properties and thermal properties, i.e., thermal conductivity, diffusivity, expansion, densification, phase transformation, microstructure, hardness and toughness of the Al2O3-cBN/(Ni) composites under specific sintering conditions were investigated. The highest relative densification of 150 nm-Al2O3 containing 30wt% cBN (Ni coated) composite was 99% at TSPS = 1400°C. In case of 150 µm- Al2O3 compositions, the phase transformation of cBN to hBN were observed, and the relative densification decreased. Thermal conductivity depicts maximum value in case of 150 nm- Al2O3-30wt% cBN-Ni composition. The Vickers hardness of this composition at TSPS = 1400°C also showed the highest value of 29 GPa.

Keywords: alumina composite, cubic boron nitride, mechanical properties, phase transformation, Spark plasma sintering

Procedia PDF Downloads 342

Authors: Jerzy F. Janik, Mariusz Drygas, Miroslaw M. Bucko

Abstract:

A simple precursor system has been recently developed in our laboratory for the conversion of affordable microcrystalline gallium antimonide GaSb to a range of nanocrystalline powders of gallium nitride GaN – a wide bandgap semiconductor indispensable in modern optoelectronics. The process relies on high temperature nitridation reactions of GaSb with ammonia. Topochemical relationships set up by the cubic lattice of GaSb result in some metastable cubic GaN formed in addition to the stable hexagonal GaN. A prior application of high energy ball milling to the initially microcrystalline GaSb precursor is shown to alter the nitridation output.

Keywords: nanocrystalline, gallium nitride, GaN, gallium antimonide, GaSb, nitridation, ball milling

Procedia PDF Downloads 400

Authors: Marianna Bolla

Abstract:

The aim of this paper is to compare spectral, discrepancy, and degree properties of expanding graph sequences. As we can prove equivalences and implications between them and the definition of the generalized (multiclass) quasirandomness of Lovasz–Sos (2008), they can be regarded as generalized quasirandom properties akin to the equivalent quasirandom properties of the seminal Chung-Graham-Wilson paper (1989) in the one-class scenario. Since these properties are valid for deterministic graph sequences, irrespective of stochastic models, the partial implications also justify for low-dimensional embedding of large-scale graphs and for discrepancy minimizing spectral clustering.

Keywords: generalized random graphs, multiway discrepancy, normalized modularity spectra, spectral clustering

Procedia PDF Downloads 197

Authors: Zainab Yasir Abed Al-Rekaby, Abdul Jalil M. Khalaf

Abstract:

Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W12 is chromatically unique.

Keywords: chromatic polynomial, chromatically equivalent, chromatically unique, wheel

Procedia PDF Downloads 431

Authors: David Pham, Yongfeng Zhang

Abstract:

Graphs are an important structure for data storage and computation. Recent years have seen the success of deep learning on graphs such as Graph Neural Networks (GNN) on various data mining and machine learning tasks. However, most of the deep learning models on graphs cannot easily explain their predictions and are thus often labelled as “black boxes.” For example, Graph Attention Network (GAT) is a frequently used GNN architecture, which adopts an attention mechanism to carefully select the neighborhood nodes for message passing and aggregation. However, it is difficult to explain why certain neighbors are selected while others are not and how the selected neighbors contribute to the final classification result. In this paper, we present a graph learning model called Explainable Graph Attention Network (XGAT), which integrates graph attention modeling and explainability. We use a single model to target both the accuracy and explainability of problem spaces and show that in the context of graph attention modeling, we can design a unified neighborhood selection strategy that selects appropriate neighbor nodes for both better accuracy and enhanced explainability. To justify this, we conduct extensive experiments to better understand the behavior of our model under different conditions and show an increase in both accuracy and explainability.

Keywords: explainable AI, graph attention network, graph neural network, node classification

Procedia PDF Downloads 198

Authors: Zainab Yasir Al-Rekaby, Abdul Jalil M. Khalaf

Abstract:

Coloring the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W14 is chromatically unique.

Keywords: chromatic polynomial, chromatically Equivalent, chromatically unique, wheel

Procedia PDF Downloads 414

Authors: E. R. Swart, S. J. Gismondi, N. R. Swart, C. E. Bell

Abstract:

We present an heuristic algorithm that decides graph non-Hamiltonicity. All graphs are directed, each undirected edge regarded as a pair of counter directed arcs. Each of the n! Hamilton cycles in a complete graph on n+1 vertices is mapped to an n-permutation matrix P where p(u,i)=1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+1. We first create exclusion set E by noting all arcs (u, v) not in G, sufficient to code precisely all cycles excluded from G i.e. cycles not in G use at least one arc not in G. Members are pairs of components of P, {p(u,i),p(v,i+1)}, i=1, n-1. A doubly stochastic-like relaxed LP formulation of the Hamilton cycle decision problem is constructed. Each {p(u,i),p(v,i+1)} in E is coded as variable q(u,i,v,i+1)=0 i.e. shrinks the feasible region. We then implement the Weak Closure Algorithm (WCA) that tests necessary conditions of a matching, together with Boolean closure to decide 0/1 variable assignments. Each {p(u,i),p(v,j)} not in E is tested for membership in E, and if possible, added to E (q(u,i,v,j)=0) to iteratively maximize |E|. If the WCA constructs E to be maximal, the set of all {p(u,i),p(v,j)}, then G is decided non-Hamiltonian. Only non-Hamiltonian G share this maximal property. Ten non-Hamiltonian graphs (10 through 104 vertices) and 2000 randomized 31 vertex non-Hamiltonian graphs are tested and correctly decided non-Hamiltonian. For Hamiltonian G, the complement of E covers a matching, perhaps useful in searching for cycles. We also present an example where the WCA fails.

Keywords: Hamilton cycle decision problem, computational complexity theory, graph theory, theoretical computer science

Procedia PDF Downloads 373

Authors: Akbar Esmaeili, Zahra Salarieh

Abstract:

Cerium oxide nanoparticles (nano-series) are used as catalysts in industrial applications due to their free radical scavenging properties. Given that free radicals play an essential role in the pathology of many neurological diseases, we investigated the use of nanocrystals as a potential therapeutic agent for oxidative damage. This project synthesized nano-series from a new and environmentally friendly bio-pathway. Investigation of cerium nitrate in culture medium containing inoculated Lactobacillus acidophilus strain before incubation produces nano-series. Loaded with glatiramer acetate (GA) was formed by coating carboxymethylcellulose (CMC) and CeO2. FE-SEM analysis showed nano-series in the 9-11 nm range, spherical shape, and uniform particle size distribution. Cubic nanoparticles containing anti-multiple sclerosis (anti-Ms) treatment called GA were used. Glycerol monostearate (GMS) was used as a fat base, and evening primrose extract was used as an anti-inflammatory in cubosomes. Design-Expert® software was used to study the effects of different formulation factors on the properties of GAloaded cubic dispersions. Thirty GA-labeled cubic dispersions were prepared with GA-labeled carboxymethylcellulose and evaluated in vitro. The results showed an average nano-series size of 89.02 and a zeta potential of -49.9. Cubosomes containing GA-CMC/CeO2 showed a stable release profile for 180 min. The results showed that cubosomes containing GA-CMC/CeO2 could be a promising drug carrier with normal release behavior.

Keywords: ciochemistry, biotechnology, molecular, biology

Procedia PDF Downloads 50

Authors: Kittipong Tripetch

Abstract:

This paper proposes for the first time symbolic formula of the power spectrum of cross couple oscillator and its modified circuit. Many principle existed to derived power spectrum in microwave textbook such as impedance, admittance parameters, ABCD, H parameters, etc. It can be compared by graph of power spectrum which methodology is the best from the point of view of practical measurement setup such as condition of impedance parameter which used superposition of current to derived (its current injection of the other port of the circuit is zero, which is impossible in reality). Four Graphs of impedance parameters of cross couple oscillator is proposed. After that four graphs of Scattering parameters of cross couple oscillator will be shown.

Keywords: optimization, power spectrum, impedance parameters, scattering parameter

Procedia PDF Downloads 466

Authors: Shaowei Sun

Abstract:

Let G be a graph with vertex set V(G)={v_1,v_2,...,v_n} and edge set E(G). For any vertex v belong to V(G), let d_v denote the degree of v. The normalized Laplacian matrix of the graph G is the matrix where the non-diagonal (i,j)-th entry is -1/(d_id_j) when vertex i is adjacent to vertex j and 0 when they are not adjacent, and the diagonal (i,i)-th entry is the di. In this paper, we discuss some bounds on the largest and the second smallest normalized Laplacian eigenvalue of trees and graphs. As following, we found some new bounds on the second smallest normalized Laplacian eigenvalue of tree T in terms of graph parameters. Moreover, we use Sage to give some conjectures on the second largest and the third smallest normalized eigenvalues of graph.

Keywords: graph, normalized Laplacian eigenvalues, normalized Laplacian matrix, tree

Procedia PDF Downloads 328

Authors: Masoumeh Ali Pouri, Hamid Haj Seyyed Javadi

Abstract:

Nowadays, cloud processing is one of the important issues in information technology. Since scheduling of tasks graph is an NP-hard problem, considering approaches based on undeterminisitic methods such as evolutionary processing, mostly genetic and cuckoo algorithms, will be effective. Therefore, an efficient algorithm has been proposed for scheduling of tasks graph to obtain an appropriate scheduling with minimum time. In this algorithm, the new approach is based on making the length of the critical path shorter and reducing the cost of communication. Finally, the results obtained from the implementation of the presented method show that this algorithm acts the same as other algorithms when it faces graphs without communication cost. It performs quicker and better than some algorithms like DSC and MCP algorithms when it faces the graphs involving communication cost.

Keywords: cloud computing, scheduling, tasks graph, chakoos algorithm

Procedia PDF Downloads 64

Authors: Gkolfo I. Smani, Vasileios Megalooikonomou

Abstract:

Social influence and influence diffusion have been studied in social networks. However, most existing tasks on this subject focus on static networks. In this paper, the problem of maximizing influence diffusion in dynamic social networks, i.e., the case of networks that change over time, is studied. The DM algorithm is an extension of the MATI algorithm and solves the influence maximization (IM) problem in dynamic networks and is proposed under the linear threshold (LT) and independent cascade (IC) models. Experimental results show that our proposed algorithm achieves a diffusion performance better by 1.5 times than several state-of-the-art algorithms and comparable results in diffusion scale with the Greedy algorithm. Also, the proposed algorithm is 2.4 times faster than previous methods.

Keywords: influence maximization, dynamic social networks, diffusion, social influence, graphs

Procedia PDF Downloads 238

Authors: Zafar Mahmood, Fahimullah Babar, Surriyia Naz, Hafiz Ur Rehman

Abstract:

Cadmium Sulphide (CdS) was deposited on a Tec 15 glass substrate with the help of CBD (chemical bath deposition process) and then cadmium telluride CdTe was deposited on CdS with the help of CSS (closed spaced sublimation technique) for the construction of a solar cell. The thicknesses of all the deposited materials were measured with the help of Elipsometry. The IV graphs were drawn in order to observe the current voltage output. The efficiency of the cell was graphed with the fill factor as well (graphs not given here).The efficiency came out to be approximately 16.5 % and the CIGS (copper- indium –gallium- selenide) maximum efficiency is 20 %.The efficiency of a solar cell can further be enhanced by adapting quality materials, good experimental devices and proper procedures. The grain size was analyzed with the help of scanning electron microscope using RBS (Rutherford backscattering spectroscopy).

Keywords: CBD, CdS, CdTe, CSS

Procedia PDF Downloads 364

Authors: Florian Gschösser, Walter Purrer

Abstract:

The paper shows examples for the (environmental) optimization of production processes for asphalt mixtures applied for typical road pavements in Austria and Switzerland. The conducted “from-cradle-to-gate” LCA firstly analyzes the production one cubic meter of asphalt and secondly all material production processes for exemplary highway pavements applied in Austria and Switzerland. It is shown that environmental impacts can be reduced by the application of reclaimed asphalt pavement (RAP) and by the optimization of specific production characteristics, e.g. the reduction of the initial moisture of the mineral aggregate and the reduction of the mixing temperature by the application of low-viscosity and foam bitumen. The results of the LCA study demonstrate reduction potentials per cubic meter asphalt of up to 57 % (Global Warming Potential–GWP) and 77 % (Ozone depletion–ODP). The analysis per square meter of asphalt pavement determined environmental potentials of up to 40 % (GWP) and 56 % (ODP).

Keywords: asphalt mixtures, environmental potentials, life cycle assessment, material production

Procedia PDF Downloads 532

Authors: Michele Aleandri, Matteo Colangeli, Davide Gabrielli

Abstract:

We study a generalization to a continuous setting of the classical Markov chain tree theorem. In particular, we consider an irreducible diffusion process on a metric graph. The unique invariant measure has an atomic component on the vertices and an absolutely continuous part on the edges. We show that the corresponding density at x can be represented by a normalized superposition of the weights associated to metric arborescences oriented toward the point x. A metric arborescence is a metric tree oriented towards its root. The weight of each oriented metric arborescence is obtained by the product of the exponential of integrals of the form ∫a/b², where b is the drift and σ² is the diffusion coefficient, along the oriented edges, for a weight for each node determined by the local orientation of the arborescence around the node and for the inverse of the diffusion coefficient at x. The metric arborescences are obtained by cutting the original metric graph along some edges.

Keywords: diffusion processes, metric graphs, invariant measure, reversibility

Procedia PDF Downloads 172

Authors: Lanre Oluwafemi Akinyemi

Abstract:

The reduction of limestone to cement in Nigeria is expensive and requires huge amounts of energy. This significantly affects the cost of cement. Concrete is heavy: a cubic foot of it weighs about 150 lbs. and a cubic yard is about 4000 lbs. Thus a ready-mix truck with 9 cubic yards is carrying 36,000 lbs excluding the weight of the truck itself, thereby accumulating cost for also manufacturers. Therein lies the need to find a substitute for cement by using the polystyrene paste that benefits both the manufactures and the consumers. Polystyrene Paste Constructional Cement (PPCC), a patented material obtained by dissolving Waste EPS in volatile organic solvent, has recently been identified as a suitable binder/cement for construction and building material production. This paper illustrates the procedures of a test experiment undertaken to determine the splitting tensile strength of PPCC mortar compared to that of OPC (Ordinary Portland Cement). Expanded polystyrene was dissolved in gasoline to form a paste referred to as Polystyrene Paste Constructional Cement (PPCC). Mortars of mix ratios 1:4, 1:5, 1:6, 1:7 (PPCC: fine aggregate) batched by volume were used to produce 50mm x 100mm cylindrical PPCC mortar splitting tensile strength specimens. The control experiment was done by creating another series of cylindrical OPC mortar splitting tensile strength specimens following the same mix ratio used earlier. The PPCC cylindrical splitting tensile strength specimens were left to air-set, and the ones made with Ordinary Portland Cement (OPC) were demoded after 24 hours and cured in water. The cylindrical PPCC splitting tensile strength specimens were tested at 28 days and compared with those of the Ordinary Portland cement splitting tensile strength specimens. The result shows that hence for this two mixes, PPCC exhibits a better binding property than the OPC. With this my new invention I recommend the use of PPCC as a substitute for a Portland cement.

Keywords: polystyrene paste, Portland cement, construction, mortar

Procedia PDF Downloads 157

Authors: Z. Mahmood, F. U. Babar, S. Naz, H. U. Rehman

Abstract:

Cadmium Sulphide (CdS) was deposited on a Tec 15 glass substrate with the help of CBD (chemical bath deposition process) and then cadmium telluride CdTe was deposited on CdS with the help of CSS (closed spaced sublimation technique) for the construction of a solar cell. The thicknesses of all the deposited materials were measured with the help of Ellipsometry. The IV graphs were drawn in order to observe the current voltage output. The efficiency of the cell was graphed with the fill factor as well (graphs not given here). The efficiency came out to be approximately 16.5 % and the CIGS (copper-indium–gallium-selenide) maximum efficiency is 20 %. The efficiency of a solar cell can further be enhanced by adapting quality materials, good experimental devices and proper procedures. The grain size was analyzed with the help of scanning electron microscope using RBS (Rutherford backscattering spectroscopy).

Keywords: Chemical Bath Deposition Technique (CBD), cadmium sulphide (CdS), CdTe, CSS (Closed Space Sublimation)

Procedia PDF Downloads 364

Authors: Raghvendra Singh Yadav, Ivo Kuřitka

Abstract:

In this report, we studied the impact of Gd3+ substitution on structural, magnetic and electrical properties of CoFe2O4 nanoparticles synthesized by sonochemical method. X-ray diffraction pattern confirmed the formation of cubic spinel structure at low concentration of Gd3+ ions, however, GdFeO3 additional phase was observed at higher concentration of Gd3+ ions. Raman and Fourier Transform Infrared spectroscopy study also confirmed cubic spinel structure of Gd3+ substituted CoFe2O4 nanoparticles. The field emission scanning electron microscopy study revealed that Gd3+ substituted CoFe2O4 nanoparticles were in the range of 5-20 nm. The magnetic properties of Gd3+ substituted CoFe2O4 nanoparticles were investigated by using vibrating sample magnetometer. The variation in saturation magnetization, coercivity and remanent magnetization with Gd3+ concentration in CoFe2O4 nanoparticles was observed. The variation of real and imaginary part of dielectric constant, tan δ, and AC conductivity were studied at room temperature.

Keywords: spinel ferrites, nanoparticles, sonochemical method, magnetic properties

Procedia PDF Downloads 294

Authors: Wenzhe Li, Xiaoyu Ying, Grace Ding

Abstract:

Architecture plane form is an important consideration in the design of green buildings due to its significant impact on energy performance. The most effective method to consider energy performance in the early design stages is parametric modelling. This paper presents a methodology to program plane forms using MATLAB language, generating 16 kinds of plane forms by changing four designed parameters. DesignBuilder (an energy consumption simulation software) was proposed to simulate the energy consumption of the generated planes. A regression mathematical model was established to study the relationship between the plane forms and their energy consumption. The main finding of the study suggested that there was a cubic function relationship between the depth-ratio of U-shaped buildings and energy consumption, and there is also a cubic function relationship between the width-ratio and energy consumption. In the design, the depth-ratio of U-shaped buildings should not be less than 2.5, and the width-ratio should not be less than 2.

Keywords: graphic parameterization, green building design, mathematical model, plane form

Procedia PDF Downloads 153

Authors: Lu Ren, You-Liang Fang, Yan-Gang Zhao

Abstract:

In recent years, the application of BIM (Building Information Modelling) to construction schedule plan has been the focus of more and more researchers. In order to assess the reasonable level of the BIM-based construction schedule plan, that is whether the schedule can be completed on time, some researchers have introduced reliability theory to evaluate. In the process of evaluation, the uncertain factors affecting the construction schedule plan are regarded as random variables, and probability distributions of the random variables are assumed to be normal distribution, which is determined using two parameters evaluated from the mean and standard deviation of statistical data. However, in practical engineering, most of the uncertain influence factors are not normal random variables. So the evaluation results of the construction schedule plan will be unreasonable under the assumption that probability distributions of random variables submitted to the normal distribution. Therefore, in order to get a more reasonable evaluation result, it is necessary to describe the distribution of random variables more comprehensively. For this purpose, cubic normal distribution is introduced in this paper to describe the distribution of arbitrary random variables, which is determined by the first four moments (mean, standard deviation, skewness and kurtosis). In this paper, building the BIM model firstly according to the design messages of the structure and making the construction schedule plan based on BIM, then the cubic normal distribution is used to describe the distribution of the random variables due to the collecting statistical data of the random factors influencing construction schedule plan. Next the reliability analysis of the construction schedule plan based on BIM can be carried out more reasonably. Finally, the more accurate evaluation results can be given providing reference for the implementation of the actual construction schedule plan. In the last part of this paper, the more efficiency and accuracy of the proposed methodology for the reliability analysis of the construction schedule plan based on BIM are conducted through practical engineering case.

Keywords: BIM, construction schedule plan, cubic normal distribution, reliability analysis

Procedia PDF Downloads 146