Decomposition of toxic chemical substance management in three U.S. manufacturing sectors from 1991 to 2008

This study analyzes toxic chemical substance management in three U.S. manufacturing sectors from 1991 to 2008. Decomposition analysis applying the logarithmic mean Divisia index is used to analyze changes in toxic chemical substance emissions by the following five factors: cleaner production, end-of-pipe treatment, transfer for further management, mixing of intermediate materials, and production scale. Based on our results, the chemical manufacturing sector reduced toxic chemical substance emissions mainly via end-of-pipe treatment. In the meantime, transfer for further management contributed to the reduction of toxic chemical substance emissions in the metal fabrication industry. This occurred because the environmental business market expanded in the 1990s, and the infrastructure for the recycling of metal and other wastes became more efficient. Cleaner production is the main contributor to toxic chemical reduction in the electrical product industry. This implies that the electrical product industry is successful in developing a more environmentally friendly product design and production process.

Decomposition of the environmental Kuznets curve : scale, technique, and composition effects

This study decomposed the determinants of environmental quality into scale, technique, and composition effects. We applied a semiparametric method of generalized additive models, which enabled us to use flexible functional forms and include several independent variables in the model. The differences in the technique effect were found to play a crucial role in reducing pollution. We found that the technique effect was sufficient to reduce sulfur dioxide emissions. On the other hand, its effect was not enough to reduce carbon dioxide (CO2) emissions and energy use, except for the case of CO2 emissions in high-income countries.

Insight into the thermal decomposition of kaolinite intercalated with potassium acetate : an evolved gas analysis

The thermal decomposition process of kaolinite–potassium acetate intercalation complex has been studied using simultaneous thermogravimetry coupled with Fourier-transform infrared spectroscopy and mass spectrometry (TG-FTIR-MS). The results showed that the thermal decomposition of the complex took place in four temperature ranges, namely 50–100, 260–320, 320–550, and 650–780 °C. The maximal mass losses rate for the thermal decomposition of the kaolinite–potassium acetate intercalation complex was observed at 81, 296, 378, 411, 486, and 733 °C, which was attributed to (a) loss of the adsorbed water, (b) thermal decomposition of surface-adsorbed potassium acetate (KAc), (c) the loss of the water coordinated to potassium acetate in the intercalated kaolinite, (d) the thermal decomposition of intercalated KAc in the interlayer of kaolinite and the removal of inner surface hydroxyls, (e) the loss of the inner hydroxyls, and (f) the thermal decomposition of carbonate derived from the decomposition of KAc. The thermal decomposition of intercalated potassium acetate started in the range 320–550 °C accompanied by the release of water, acetone, carbon dioxide, and acetic acid. The identification of pyrolysis fragment ions provided insight into the thermal decomposition mechanism. The results showed that the main decomposition fragment ions of the kaolinite–KAc intercalation complex were water, acetone, carbon dioxide, and acetic acid. TG-FTIR-MS was demonstrated to be a powerful tool for the investigation of kaolinite intercalation complexes. It delivers a detailed insight into the thermal decomposition processes of the kaolinite intercalation complexes characterized by mass loss and the evolved gases.

A random key genetic algorithm for live migration of multiple virtual machines in data centers

Live migration of multiple Virtual Machines (VMs) has become an integral management activity in data centers for power saving, load balancing and system maintenance. While state-of-the-art live migration techniques focus on the improvement of migration performance of an independent single VM, only a little has been investigated to the case of live migration of multiple interacting VMs. Live migration is mostly influenced by the network bandwidth and arbitrarily migrating a VM which has data inter-dependencies with other VMs may increase the bandwidth consumption and adversely affect the performances of subsequent migrations. In this paper, we propose a Random Key Genetic Algorithm (RKGA) that efficiently schedules the migration of a given set of VMs accounting both inter-VM dependency and data center communication network. The experimental results show that the RKGA can schedule the migration of multiple VMs with significantly shorter total migration time and total downtime compared to a heuristic algorithm.

A Study of feature extraction algorithms for optical flow tracking

Sparse optical flow algorithms, such as the Lucas-Kanade approach, provide more robustness to noise than dense optical flow algorithms and are the preferred approach in many scenarios. Sparse optical flow algorithms estimate the displacement for a selected number of pixels in the image. These pixels can be chosen randomly. However, pixels in regions with more variance between the neighbours will produce more reliable displacement estimates. The selected pixel locations should therefore be chosen wisely. In this study, the suitability of Harris corners, Shi-Tomasi's “Good features to track", SIFT and SURF interest point extractors, Canny edges, and random pixel selection for the purpose of frame-by-frame tracking using a pyramidical Lucas-Kanade algorithm is investigated. The evaluation considers the important factors of processing time, feature count, and feature trackability in indoor and outdoor scenarios using ground vehicles and unmanned aerial vehicles, and for the purpose of visual odometry estimation.

Governing virtual worlds : to what extent is it possible to empower players and preserve their rights in virtual worlds, and what is the best method of doing so?

In this paper the author considers the possibilities for establishing democratic governance in virtual worlds. He looks at the freedoms currently available to players in “Second Life”, contrasting these to those established in Raph Koster’s “A Declaration of the Rights of Avatars”, and assess whether some restrictions are more necessary in game spaces than social spaces. The author looks at the early implementations of self-governance in online spaces, and consider what lessons can be taken from these, investigating what a contemporary democratic space looks like, in the form of “A Tale in the Desert”, and finally considers how else we may think of giving players more rights in these developing social spaces.

Document clustering algorithms, representations and evaluation for information retrieval

This thesis presents new methods for classification and thematic grouping of billions of web pages, at scales previously not achievable. This process is also known as document clustering, where similar documents are automatically associated with clusters that represent various distinct topic. These automatically discovered topics are in turn used to improve search engine performance by only searching the topics that are deemed relevant to particular user queries.

The dynamics of cellular automata on 2-manifolds is affected by topology

In this paper, we demonstrate that the distribution of Wolfram classes within a cellular automata rule space in the triangular tessellation is not consistent across different topological general. Using a statistical mechanics approach, cellular automata dynamical classes were approximated for cellular automata defined on genus-0, genus-1 and genus-2 2-manifolds. A distribution-free equality test for empirical distributions was applied to identify cases in which Wolfram classes were distributed differently across topologies. This result implies that global structure and local dynamics contribute to the long term evolution of cellular automata.

Author response to : Brough et al. in response to the recently published article : Lottering,N., MacGregor,D.M.,Barry,M.D.,Reynolds,M.S., Gregory,L.S., 2014. Introducing standardized protocols for anthropological measurement of virtual sub-adult crania using computed tomography 2(1),34–38

Firstly, we would like to thank Ms. Alison Brough and her colleagues for their positive commentary on our published work [1] and their appraisal of our utility of the “off-set plane” protocol for anthropometric analysis. The standardized protocols described in our manuscript have wide applications, ranging from forensic anthropology and paleodemographic research to clinical settings such as paediatric practice and orthopaedic surgical design. We affirm that the use of geometrically based reference tools commonly found in computer aided design (CAD) programs such as Geomagic Design X® are imperative for more automated and precise measurement protocols for quantitative skeletal analysis. Therefore we stand by our recommendation of the use of software such as Amira and Geomagic Design X® in the contexts described in our manuscript...

Efficient multiple relay selection for cooperative communication using alamouti-coded virtual transmit antenna systems

An opportunistic relay selection scheme improving cooperative diversity is devised using the concept of a virtual SIMO-MISO antenna array. By incorporating multiple users as a virtual distributed antenna, not only helps combat fading but also provides significant advantage in terms of energy consumption. The proposed efficient multiple relay selection uses the concept of the distributed Alamouti scheme in a time varying environment to realize cooperative networking in wireless relay networks and provides the platform for outage, Diversiy-Multiplexing Tradeoff (DMT) and Bit-Error-Rate (BER) analysis to conclude that it is capable of achieving promising diversity gains by operating at much lower SNR when compared with conventional relay selection methods. It also has the added advantage of conserving energy for the relays that are reachable but not selected for the cooperative communication.

A time for everything : reviewing an institution’s virtual learning environment

This paper outlines a review carried out at Queensland University of Technology (QUT) in 2013 to identify the extent to which the centrally supported virtual learning environment met current and future learning and teaching needs. A range of consultation and investigation activities occurred from May to November to encourage open stakeholder feedback as well as to allow for reflection on alternative digital technologies, systems and strategies. This resulted in the development of nine recommendations, which, following a planning phase, will commence being implemented from mid-2014.

Selection procedures for module discovery : exploring evolutionary algorithms for cognitive science

Evolutionary algorithms are playing an increasingly important role as search methods in cognitive science domains. In this study, methodological issues in the use of evolutionary algorithms were investigated via simulations in which procedures were systematically varied to modify the selection pressures on populations of evolving agents. Traditional roulette wheel, tournament, and variations of these selection algorithms were compared on the “needle-in-a-haystack” problem developed by Hinton and Nowlan in their 1987 study of the Baldwin effect. The task is an important one for cognitive science, as it demonstrates the power of learning as a local search technique in smoothing a fitness landscape that lacks gradient information. One aspect that has continued to foster interest in the problem is the observation of residual learning ability in simulated populations even after long periods of time. Effective evolutionary algorithms balance their search effort between broad exploration of the search space and in-depth exploitation of promising solutions already found. Issues discussed include the differential effects of rank and proportional selection, the tradeoff between migration of populations towards good solutions and maintenance of diversity, and the development of measures that illustrate how each selection algorithm affects the search process over generations. We show that both roulette wheel and tournament algorithms can be modified to appropriately balance search between exploration and exploitation, and effectively eliminate residual learning in this problem.