Molecular modeling software is employed to correlate the thermal stability of an organotin molecule in PVC and molecular structure. Synthesizing model organotin compounds, measuring dynamic properties in PVC, and calculating structural and electronic properties yield an empirical relationship between the stabilizing ability of the tin molecule and electron density of the heteroatom. 相似文献
In order to gain insight into membrane fiber failure (i.e., loss of integrity), properties of five hollow fiber membranes and four hollow fiber modules were evaluated. Specifically, membrane material, membrane symmetry, fiber modulus of elasticity, fiber diameter and thickness, module potting technique, module flow pattern (inside-out or outside-in), and coliform breakthrough were investigated. The approach combined evaluation of the above properties with mathematical modeling of structure-fluid interactions to comprehensively evaluate the properties most important for maintaining hollow fiber membrane integrity. Tensile strength testing revealed that the strongest fiber was an asymmetric polyacrylonitrile membrane fiber. The weakest fiber was a symmetric polyethylene membrane fiber. Pilot plant testing on the four membrane modules revealed that membrane symmetry may be a more important factor than potting technique for hollow fiber integrity. Results from the SEM and tensile testing were used as input to a finite element analysis model used to evaluate time-dependent structure-fluid interactions. It was found that additional stresses at the juncture of the potting material and the hollow fiber membranes exist. These stresses likely lead to the formation of fractures. 相似文献
Platinum catalyst supported on a medium surface area -SiC was successfully used for the catalytic combustion of model carbon particles and compared to a catalyst supported on a low surface area -SiC. The -SiC-based catalyst showed no deactivation as a function of cycling tests while a strong deactivation was observed on the -SiC-based catalyst. This deactivation was attributed to the progressive encapsulation of the platinum particles by a layer of silica which built up during the combustion cycle. These results render possible the use of Pt/-SiC catalyst as a diesel carbon particle catalytic filter with continuous regeneration. 相似文献
In this perfusion magnetic resonance imaging study, the performances of different pseudo-continuous arterial spin labeling (PCASL) sequences were compared: two-dimensional (2D) single-shot readout with simultaneous multislice (SMS), 2D single-shot echo-planar imaging (EPI) and multishot three-dimensional (3D) gradient and spin echo (GRASE) sequences combined with a background-suppression (BS) module.
Materials and methods
Whole-brain PCASL images were acquired from seven healthy volunteers. The performance of each protocol was evaluated by extracting regional cerebral blood flow (rCBF) measures using an inline morphometric segmentation prototype. Image data postprocessing and subsequent statistical analyses enabled comparisons at the regional and sub-regional levels.
Results
The main findings were as follows: (i) Mean global CBF obtained across methods was were highly correlated, and these correlations were significantly higher among the same readout sequences. (ii) Temporal signal-to-noise ratio and gray-matter-to-white-matter CBF ratio were found to be equivalent for all 2D variants but lower than those of 3D-GRASE.
Discussion
Our study demonstrates that the accelerated SMS readout can provide increased acquisition efficiency and/or a higher temporal resolution than conventional 2D and 3D readout sequences. Among all of the methods, 3D-GRASE showed the lowest variability in CBF measurements and thus highest robustness against noise.
Mg-Al-Sr-based alloys (AJ alloys) have shown superior creep performance and tensile strength at temperatures as high as 175°
with stresses up to 70 MPa. Mg-6Al-2.4Sr (AJ62x) exhibits an optimum combination of creep resistance and excellent castability,
while AJ62Lx (strontium <2.1) has better ductility than other AJ formulations. The AJ alloy microstructure is characterized
by the Al4Sr-α(Mg) lamellar phase that forms at the interdendritic/grain boundary region of the primary magne sium matrix. Mg-5Al-2Sr
(AJ52x) contains a ternary phase that was tentatively named Al3Mg13Sr. When the strontium level is low in AJ62x, the volume fraction of Al4Sr is reduced, the aluminum supersaturation of the magnesium primary phase increases, and Mg17Al12 forms. In this article, a mechanism is proposed whereby the creep resistance decreases with the strontium level but the tensile
strength and ductility increase.
For more information, contact Eric Baril, Noranda, Noranda Technologies Centre, 240 Hymus Pointe-Claire (Montréal), Québec,
H9R 1G5 Canada; (514) 630-9347; fax (514) 630-9379; e-mail eric.baril@ntc.noranda.com. 相似文献
The problem of determining whether several finite automata accept a word in common is closely related to the well-studied membership problem in transformation monoids. We raise the issue of limiting the number of final states in the automata intersection problem. For automata with two final states, we show the problem to be \({\oplus}\)L-complete or NP-complete according to whether a nontrivial monoid other than a direct product of cyclic groups of order 2 is allowed in the automata. We further consider idempotent commutative automata and (Abelian, mainly) group automata with one, two, or three final states over a singleton or larger alphabet, elucidating (under the usual hypotheses on complexity classes) the complexity of the intersection nonemptiness and related problems in each case. 相似文献
We introduce a novel fitting procedure that takes as input an arbitrary material, possibly anisotropic, and automatically converts it to a microfacet BRDF. Our algorithm is based on the property that the distribution of microfacets may be retrieved by solving an eigenvector problem that is built solely from backscattering samples. We show that the eigenvector associated to the largest eigenvalue is always the only solution to this problem, and compute it using the power iteration method. This approach is straightforward to implement, much faster to compute, and considerably more robust than solutions based on nonlinear optimizations. In addition, we provide simple conversion procedures of our fits into both Beckmann and GGX roughness parameters, and discuss the advantages of microfacet slope space to make our fits editable. We apply our method to measured materials from two large databases that include anisotropic materials, and demonstrate the benefits of spatially varying roughness on texture mapped geometric models. 相似文献
Node‐link infographics are visually very rich and can communicate messages effectively, but can be very difficult to create, often involving a painstaking and artisanal process. In this paper we present an investigation of node‐link visualizations for communication and how to better support their creation. We begin by breaking down these images into their basic elements and analyzing how they are created. We then present a set of techniques aimed at improving the creation workflow by bringing more flexibility and power to users, letting them manipulate all aspects of a node‐link diagram (layout, visual attributes, etc.) while taking into account the context in which it will appear. These techniques were implemented in a proof‐of‐concept prototype called GraphCoiffure, which was designed as an intermediary step between graph drawing/editing software and image authoring applications. We describe how GraphCoiffure improves the workflow and illustrate its benefits through practical examples. 相似文献
Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables $\mathcal{M}$, with the same constraint C defined by a finite-state automaton $\mathcal{A}$ on each row of $\mathcal{M}$ and a global cardinality constraint $\mathit{gcc}$ on each column of $\mathcal{M}$. We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the $\mathit{gcc}$ constraints from the automaton $\mathcal{A}$. The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We also provide a domain consistency filtering algorithm for the conjunction of lexicographic ordering constraints between adjacent rows of $\mathcal{M}$ and (possibly different) automaton constraints on the rows. We evaluate the impact of our methods in terms of runtime and search effort on a large set of nurse rostering problem instances. 相似文献