971 resultados para Pore Topology
Resumo:
Thiol-functionalized mesoporous ethane-silicas with large pore were synthesized by co-condensation of 1,2-bis(trimethoxy-sily)ethane (BTME) with 3-mercaptopropyltrimethoxysilane (MPTMS) using nonionic oligomeric polymer C1H (OCH(2)-CH(2))(10)OH (Brij-76) or poly(alkylene oxide) block copolymer (P123) as surfactant in acidic medium. The results of powder X-ray diffraction (XRD), nitrogen gas adsorption, and transmission electron microscopy (TEM) show that the resultant materials have well-ordered hexagonal mesoscopic structure with uniform pore size distributions. (29)Si MAS NNR, (13)C CP-MAS NMR. FT-IR, and UV Raman spectroscopies confirm the attachment of thiol functionalities in the mesoporous ethane-sificas. The maximum content of the attached thiol group (-SH) in the mesoporous framework is 2.48mmol/g. The ordered mesoporous materials are efficient Hg(2+) adsorbents with almost every -SH site accessible to Hg(2+). In the presence of various kinds of heavy metal ions such as Hg(2+), Cd(2+), Zn(2+), Cu(2+) and Cr(3+), the materials synthesized using poly(alkylene oxide) block cooollxmier (Pluronic 123) g(2+), as surfactant show almost similar affinity to Hg(2+), Cd(2+), and Cr(3+), while the materials synthesized using ofigomeric polymer C(18)H(37)(OCH(2)CH(2))(10)OH (Brij-76) as surfactant exhibit high selectivity to Hg(2+). (C) 2004 Elsevier Inc. All rights reserved.
Resumo:
A new post-grafting process, consisting of two steps of substrate preparation and sol - gel post-grafting, has been developed to prepare titanium-doped mesoporous SBA-15 material with a double-layered structure and locally concentrated titanium content at the inner pore surface. With this novel technique, the single phased and originally ordered mesostructures can be well conserved; in the conventional direct synthesis they can be partially damaged when the frameworks are doped with high content heteroatoms. Titanium species exist in an isolated, tetrahedral structure and are localized at the pore surface; this is beneficial to both reactant access and product release. Characterization with XRD, N-2 adsorption/desorption isotherms, HREM/ EDS, ICP, UV - Vis, and the newly developed UV - Raman spectroscopy confirm these results. Preliminary catalytic tests with the selective epoxidation of cyclohexene show good catalytic activity. Among them, sample TiSBA-15-10 with a Si : Ti molar ratio of 10 shows a TON value of 75 and a highest product ( epoxide) yield of 55%.
Resumo:
A new mesoporous sphere-like SBA-15 silica was synthesized and evaluated in terms of its suitability as stationary phases for CEC. The unique and attractive properties of the silica particle are its submicrometer particle size of 400 nm and highly ordered cylindrical mesopores with uniform pore size of 12 nm running along the same direction. The bare silica particles with submicrometer size have been successfully employed for the normal-phase electrochromatographic separation of polar compounds with high efficiency (e.g., 210 000 for thiourea), which is matched well with its submicrometer particle size. The Van Deemeter plot showed the hindrance to mass transfer because of the existence of pore structure. The lowest plate height of 2.0 mu m was obtained at the linear velocity of 1.1 mm/s. On the other hand, because of the relatively high linear velocity (e.g., 4.0 mm/s) can be generated, high-speed separation of neutral compounds, anilines, and basic pharmaceuticals in CEC with C-18-modified SBA-15 silica as stationary phases was achieved within 36, 60, and 34 s, respectively.
Resumo:
Recent studies have noted that vertex degree in the autonomous system (AS) graph exhibits a highly variable distribution [15, 22]. The most prominent explanatory model for this phenomenon is the Barabási-Albert (B-A) model [5, 2]. A central feature of the B-A model is preferential connectivity—meaning that the likelihood a new node in a growing graph will connect to an existing node is proportional to the existing node’s degree. In this paper we ask whether a more general explanation than the B-A model, and absent the assumption of preferential connectivity, is consistent with empirical data. We are motivated by two observations: first, AS degree and AS size are highly correlated [11]; and second, highly variable AS size can arise simply through exponential growth. We construct a model incorporating exponential growth in the size of the Internet, and in the number of ASes. We then show via analysis that such a model yields a size distribution exhibiting a power-law tail. In such a model, if an AS’s link formation is roughly proportional to its size, then AS degree will also show high variability. We instantiate such a model with empirically derived estimates of growth rates and show that the resulting degree distribution is in good agreement with that of real AS graphs.
Resumo:
Wireless sensor networks are characterized by limited energy resources. To conserve energy, application-specific aggregation (fusion) of data reports from multiple sensors can be beneficial in reducing the amount of data flowing over the network. Furthermore, controlling the topology by scheduling the activity of nodes between active and sleep modes has often been used to uniformly distribute the energy consumption among all nodes by de-synchronizing their activities. We present an integrated analytical model to study the joint performance of in-network aggregation and topology control. We define performance metrics that capture the tradeoffs among delay, energy, and fidelity of the aggregation. Our results indicate that to achieve high fidelity levels under medium to high event reporting load, shorter and fatter aggregation/routing trees (toward the sink) offer the best delay-energy tradeoff as long as topology control is well coordinated with routing.
Resumo:
Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. Unfortunately, developing a deep understanding of these issues has proven to be a challenging task, since it in turn involves solving difficult problems such as mapping the actual topology, characterizing it, and developing models that capture its emergent behavior. Consequently, even though there are a number of topology models, it is an open question as to how representative the topologies they generate are of the actual Internet. Our goal is to produce a topology generation framework which improves the state of the art and is based on design principles which include representativeness, inclusiveness, and interoperability. Representativeness leads to synthetic topologies that accurately reflect many aspects of the actual Internet topology (e.g. hierarchical structure, degree distribution, etc.). Inclusiveness combines the strengths of as many generation models as possible in a single generation tool. Interoperability provides interfaces to widely-used simulation and visualization applications such as ns and SSF. We call such a tool a universal topology generator. In this paper we discuss the design, implementation and usage of the BRITE universal topology generation tool that we have built. We also describe the BRITE Analysis Engine, BRIANA, which is an independent piece of software designed and built upon BRITE design goals of flexibility and extensibility. The purpose of BRIANA is to act as a repository of analysis routines along with a user–friendly interface that allows its use on different topology formats.
Resumo:
Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute studies have led some authors to conclude that the router graph of the Internet is a scale-free graph, or more generally a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. In this paper we argue that the evidence to date for this conclusion is at best insufficient. We show that graphs appearing to have power-law degree distributions can arise surprisingly easily, when sampling graphs whose true degree distribution is not at all like a power-law. For example, given a classical Erdös-Rényi sparse, random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can easily appear to show a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to distinguish measurements taken from the Erdös-Rényi graphs from those taken from power-law random graphs. When we apply this distinction to a number of well-known datasets, we find that the evidence for sampling bias in these datasets is strong.