Use of recycled copper slag for blended cements

Copper slag is a by‐product generated during smelting to extract copper metal from the ore. The copper slag obtained may exhibit pozzolanic activity and may therefore be used in the manufacture of addition‐containing cements. In this paper the effect of the incorporation of the copper slag in cement is measured. Blends of copper slag with Portland cement generally possess properties equivalent to Portland cement containing fly ash, but very different to the silica fume incorporation. Copper slag and fly ash reduce the heat of hydration more effectively than silica fume in mortars. The replacement of 30% cement by copper slag reduces the flexural and compressive strength in a similar way to fly ash; however, after 28 days, the reduction is less than the percentage of substitution. Hydrated calcium aluminate phases were analysed using scanning electron microscopy (SEM) and X‐ray diffraction (XRD) techniques. The pozzolanic activity of copper slag is similar to that of fly ash and higher than silica fume. In the presence of low water/cement ratios, certain pozzolanic materials produce a very compact cement paste that limits the space available for hydration products, a determining factor in the formation of hydrated calcium aluminates. SEM was found to be a useful analytical technique when aluminates are formed and can be clearly detected by XRD. Copyright © 2008 Society of Chemical Industry     

Xylene Isomerization in a ZSM-5/SS Membrane Reactor

A membrane reactor containing different types of ZSM-5/porous SS membranes was used to perform the xylene isomerization reaction. The parent Na-ZSM-5 layer was synthesized by secondary growth on top of porous stainless steel tubes. The xylene isomerization reaction was carried out at different temperatures in the membrane reactor and in a fixed-bed reactor of identical geometry for comparison. Two different kinds of membranes were prepared by ion exchange: a Pt/H-ZSM-5 catalytic membrane and two Ba-ZSM-5 composites with different Ba²⁺ concentration. The p-xylene production using 100% exchanged Ba-membrane was about 28% higher than the fixed-bed reactor at 370 °C, when m-xylene was fed.     

Ultrasonic treatment restores the photoelectric parameters of silicon solar cells degraded under the action of <Superscript>60</Superscript>Co gamma radiation

The photoelectric parameters of silicon solar cells degraded under the action of ⁶⁰Co gamma-radiation can be partly restored using an ultrasonic treatment (UST). The growth of the maximum output power of solar cells after the UST is related to a redistribution of the radiation defects and an increase in the homogeneity of a semiconductor crystal structure.     

Power Distribution Fault Cause Identification With Imbalanced Data Using the Data Mining-Based Fuzzy Classification E-Algorithm

Power distribution systems have been significantly affected by many outage-causing events. Good fault cause identification can help expedite the restoration procedure and improve the system reliability. However, the data imbalance issue in many real-world data sets often degrades the fault cause identification performance. In this paper, the E-algorithm, which is extended from the fuzzy classification algorithm by Ishibuchi to alleviate the effect of imbalanced data constitution, is applied to Duke Energy outage data for distribution fault cause identification. Three major outage causes (tree, animal, and lightning) are used as prototypes. The performance of E-algorithm on real-world imbalanced data is compared with artificial neural network. The results show that the E-algorithm can greatly improve the performance when the data are imbalanced     

Lattice structure on some fuzzy algebraic systems

In this paper, we study the lattice structure of some fuzzy algebraic systems such as (G-)fuzzy groups, some fuzzy ordered algebras and fuzzy hyperstructures. We prove that under suitable conditions, these structures form a distributive or modular lattice. This research partially is supported by the “ Fuzzy Systems and its Applications Center of Excelence, Shahid Bahonar University of Kerman, Iran”.     

Manifold mapping: a two-level optimization technique

In this paper, we analyze in some detail the manifold-mapping optimization technique introduced recently [Echeverría and Hemker in space mapping and defect correction. Comput Methods Appl Math 5(2): 107—136, 2005]. Manifold mapping aims at accelerating optimal design procedures that otherwise require many evaluations of time-expensive cost functions. We give a proof of convergence for the manifold-mapping iteration. By means of two simple optimization problems we illustrate the convergence results derived. Finally, the performances of several variants of the method are compared for some design problems from electromagnetics.     

The LilyPad Arduino: Toward Wearable Engineering for Everyone

Electronic textiles, or e-textiles, are an increasingly important part of wearable computing, helping to make pervasive devices truly wearable. These soft, fabric-based computers can function as lovely embodiments of Mark Weiser's vision of ubiquitous computing: providing useful functionality while disappearing discreetly into the fabric of our clothing. E-textiles also give new, expressive materials to fashion designers, textile designers, and artists, and garments stemming from these disciplines usually employ technology in visible and dramatic style. Integrating computer science, electrical engineering, textile design, and fashion design, e-textiles cross unusual boundaries, appeal to a broad spectrum of people, and provide novel opportunities for creative experimentation both in engineering and design. Moreover, e-textiles are cutting- edge technologies that capture people's imagination in unusual ways. (What other emerging pervasive technology has Vogue magazine featured?) Our work aims to capitalize on these unique features by providing a toolkit that empowers novices to design, engineer, and build their own e-textiles.     

Sensor Selection in Arbitrary Dimensions

We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measurements provide a good estimate of a target's state (such as location). We focus on the bounded uncertainty sensing model where the target is a point in the d -dimensional Euclidean space. Each sensor measurement corresponds to a convex polyhedral subset of the space. The measurements are merged by intersecting corresponding sets. We show that, on the plane, four sensors are sufficient (and sometimes necessary) to obtain an estimate whose area is at most twice the area of the best possible estimate (obtained by intersecting all measurements). We also extend this result to arbitrary dimensions and show that a constant number of sensors suffice for a constant factor approximation in arbitrary dimensions. Both constants depend on the dimensionality of the space but are independent of the total number of sensors in the network.     

Integrating trust into the CyberCraft Initiative via the Trust Vectors model [Application Notes]

This research supports the hypothesis that the Trust Vector model can be modified to fit the CyberCraft Initiative, and that there are limits to the utility of historical data. This research proposed some modifications and expansions to the Trust Model Vector, and identified areas for future research.     

Evolving artificial neural network ensembles

Using a coordinated group of simple solvers to tackle a complex problem is not an entirely new idea. Its root could be traced back hundreds of years ago when ancient Chinese suggested a team approach to problem solving. For a long time, engineers have used the divide-and-conquer strategy to decompose a complex problem into simpler sub-problems and then solve them by a group of solvers. However, knowing the best way to divide a complex problem into simpler ones relies heavily on the available domain knowledge. It is often a manual process by an experienced engineer. There have been few automatic divide-and-conquer methods reported in the literature. Fortunately, evolutionary computation provides some of the interesting avenues to automatic divide-and-conquer methods. An in-depth study of such methods reveals that there is a deep underlying connection between evolutionary computation and ANN ensembles. Ideas in one area can be usefully transferred into another in producing effective algorithms. For example, using speciation to create and maintain diversity had inspired the development of negative correlation learning for ANN ensembles, and an in-depth study of diversity in ensembles. This paper will review some of the recent work in evolutionary approaches to designing ANN ensembles.