In the present work, zinc titanates (ZTO) as photocatalysts were synthesized, characterized, and evaluated aiming to study their photocatalytic properties for hydrogen production under visible-light irradiation and employing MeOH (methanol) and TEOA (Triethanolamine) as sacrificial agents. ZTO were synthesized by modified Pechini method. Characterization of materials consisted in TGA, XRD, TEM, EELS, BET, and UV–Vis. Surface interaction studies consisted of FT-IR spectroscopy and determination of MeOH and TEOA adsorption–desorption capacities on the ZTO by TGA. Zinc titanates were evaluated as photocatalyst for H2 production using an artificial visible light and monitored by GC. TGA results led to establish calcination temperatures of 550 °C (Zn2Ti3O8) and 700 °C (ZnTiO3) to reach their crystalline phases. XRD analysis of sample cds-ZTO found cubic Zn2Ti3O8 and traces of the ZnO crystalline phase, while p-ZTO exhibited a mixture of cubic and hexagonal ZnTiO3 crystalline phases. Surface area for cds-ZTO was 88 m2/g, while ZnTiO3 had 13 m2/g. Photocatalytic H2 production for cds-ZTO and p-ZTO using TEOA as sacrificial agent showed the highest photocatalytic activities generating 548 and 441 µmolH2/h.gcat. TEOA adsorption–desorption capacity was found superior on cds-ZTO and p-ZTO than that for MeOH on both samples.
We give experimental evidence for the benefits of order-preserving compression in sorting algorithms. While, in general, any algorithm might benefit from compressed data because of reduced paging requirements, we identified two natural candidates that would further benefit from order-preserving compression, namely string-oriented sorting algorithms and word-RAM algorithms for keys of bounded length. The word-RAM model has some of the fastest known sorting algorithms in practice. These algorithms are designed for keys of bounded length, usually 32 or 64 bits, which limits their direct applicability for strings. One possibility is to use an order-preserving compression scheme, so that a bounded-key-length algorithm can be applied. For the case of standard algorithms, we took what is considered to be the among the fastest nonword RAM string sorting algorithms, Fast MKQSort, and measured its performance on compressed data. The Fast MKQSort algorithm of Bentley and Sedgewick is optimized to handle text strings. Our experiments show that order-compression techniques results in savings of approximately 15% over the same algorithm on noncompressed data. For the word-RAM, we modified Andersson's sorting algorithm to handle variable-length keys. The resulting algorithm is faster than the standard Unix sort by a factor of 1.5 X . Last, we used an order-preserving scheme that is within a constant additive term of the optimal Hu--Tucker, but requires linear time rather than O ( m log m ), where m = |Σ| is the size of the alphabet.
The present investigation shows experimental results obtained with TiO2 thin films synthesized by the sol-gel method assisted with hydrothermal treatment over polypropylene, using the dip coating technique. Obtained coatings were characterized through SEM, XRD, UV-Vis and the photo- catalytic activity was monitored by GC. According to results, the hydrothermal treatment facilitates the crystallization of the TiO2 anatase phase, which is present in all synthesized films. Crystal size formed from precursor solutions (estimated by the Scherrer's equation) depends on the time and temperature of the hydrothermal treatment, wherein solution exposed to a higher temperature treatment of 150。C for 1.5 h (H150/1.5) exhibited a larger crystal size compared to those synthesized at 80。C for 1.5 h and 3 h (H80/1.5 and H80/3). Sample H150/1.5 over polypropylene resulted in a uniform and crack free coating. This behavior was attributed to the precursor solution being denser than those synthesized at 80。C. Additionally, the photocatalytic activity of the coatings was evaluated through the degradation of propane. Coating H150/1.5 reached 100% conversion after 3 h of UV light irradiation.
It has been experimentally observed that LRU and variants thereof are the preferred strategies for on-line paging. However, under most proposed performance measures for on-line algorithms the performance of LRU is the same as that of many other strategies which are inferior in practice. In this paper we first show that any performance measure which does not include a partition or implied distribution of the input sequences of a given length is unlikely to distinguish between any two lazy paging algorithms as their performance is identical in a very strong sense. This provides a theoretical justification for the use of a more refined measure. Building upon the ideas of concave analysis by Albers et al. [AFG05], we prove strict separation between LRU and all other paging strategies. That is, we show that LRU is the unique optimum strategy for paging under a deterministic model. This provides full theoretical backing to the empirical observation that LRU is preferable in practice.
Valiant load balancing (VLB), also called two-stage load balancing, is gaining popularity as a routing scheme that can serve arbitrary traffic matrices. To date, VLB network design is well understood on a logical full-mesh topology, where VLB is optimal even when nodes can fail. In this paper, we address the design and capacity provisioning of arbitrary VLB network topologies. First, we introduce an algorithm to determine if VLB can serve all traffic matrices when a fixed number of arbitrary links fail, and we show how to find a min-cost expansion of the network - via link upgrades and installs - so that it is resilient to these failures. Additionally, we propose a method to design a new VLB network under the fixed-charge network design cost model. Finally, we prove that VLB is no longer optimal on unrestricted topologies, and can require more capacity than shortest path routing to serve all traffic matrices on some topologies. These results rely on a novel theorem that characterizes the capacity VLB requires of links crossing each cut, i.e., a partition, of the network's nodes.