Synthesis and characterization of ET(P)S-4 and ET(P)S-10

Phosphorus containing ET(P)S-4 and ET(P)S-10 were synthesized from gels of composition xNa₂O–0.6KF–0.2TiO₂–(1.28 − 4y)xHCl–yP₂O₅–1.49SiO₂–39.5H₂O at 190 °C for 3 days. The XRD patterns are almost identical to the corresponding ETS samples. The presence of phosphorus in the initial gel influences the kinetic parameters of the crystallization process, the morphology and the size of the crystals. The ³¹P-NMR of the samples show that part of the phosphorus is attached at the siliceous surface as dihydrogenophosphate SiOPO(OH)₂ groups and cannot be introduced in a tetrahedral or octahedral framework position.     

Micromechanical Modeling of the Effective Viscoelastic Properties of Inhomogeneous Materials Using Fraction-exponential Operators

A new analytical approach for’ micromechanical modeling of the effective viscoelastic behavior of a’ composite material is presented. Fractionexponential operators are. used to describe the viscoelastic properties of the constituents. To construct the corresponding elastic solution, effective field method is used. Effective viscoelastic operators are obtained from the Volter ra’s elasticity-viscoelasticity correspondence principle. Incompatible deformation that often occurs during the manufacturiig process is taken intp account. All the formulas are obtained in explicit ready-to-use form.     

D-Index: Distance Searching Index for Metric Data Sets

In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types grows, metric spaces have become a popular paradigm for similarity retrieval. We propose a new index structure, called D-Index, that combines a novel clustering technique and the pivot-based distance searching strategy to speed up execution of similarity range and nearest neighbor queries for large files with objects stored in disk memories. We have qualitatively analyzed D-Index and verified its properties on actual implementation. We have also compared D-Index with other index structures and demonstrated its superiority on several real-life data sets. Contrary to tree organizations, the D-Index structure is suitable for dynamic environments with a high rate of delete/insert operations.     

Approximate similarity retrieval with M-trees

Motivated by the urgent need to improve the efficiency of similarity queries, approximate similarity retrieval is investigated in the environment of a metric tree index called the M-tree. Three different approximation techniques are proposed, which show how to forsake query precision for improved performance. Measures are defined that can quantify the improvements in performance efficiency and the quality of approximations. The proposed approximation techniques are then tested on various synthetic and real-life files. The evidence obtained from the experiments confirms our hypothesis that a high-quality approximated similarity search can be performed at a much lower cost than that needed to obtain the exact results. The proposed approximation techniques are scalable and appear to be independent of the metric used. Extensions of these techniques to the environments of other similarity search indexes are also discussed. Received July 7, 1998 / Accepted October 13, 1998     

Approximation Algorithms for Quickest Spanning Tree Problems

Let $G=(V,E)$ be an undirected multigraph with a special vertex ${\it root} \in V$, and where each edge $e \in E$ is endowed with a length $l(e) \geq 0$ and a capacity $c(e) > 0$. For a path $P$ that connects $u$ and $v$, the {\it transmission time} of $P$ is defined as $t(P)=\mbox{\large$\Sigma$}_{e \in P} l(e) + \max_{e \in P}\!{(1 / c(e))}$. For a spanning tree $T$, let $P_{u,v}^T$ be the unique $u$--$v$ path in $T$. The {\sc quickest radius spanning tree problem} is to find a spanning tree $T$ of $G$ such that $\max _{v \in V} t(P^T_{root,v})$ is minimized. In this paper we present a 2-approximation algorithm for this problem, and show that unless $P =NP$, there is no approximation algorithm with a performance guarantee of $2 - \epsilon$ for any $\epsilon >0$. The {\sc quickest diameter spanning tree problem} is to find a spanning tree $T$ of $G$ such that $\max_{u,v \in V} t(P^T_{u,v})$ is minimized. We present a ${3 \over 2}$-approximation to this problem, and prove that unless $P=NP$ there is no approximation algorithm with a performance guarantee of ${3 \over 2}-\epsilon$ for any $\epsilon >0$.     

Microfluidic switchboards with integrated inertial pumps

Arrays of H-shaped microfluidic channels connecting two different fluidic reservoirs have been built with silicon/SU8 microfabrication technologies utilized in production of thermal inkjet printheads. The fluids are delivered to the channels via slots etched through the silicon wafer. Every H-shaped channel comprises four thermal inkjet resistors, one in each of the four legs. The resistors vaporize water and generate drive bubbles that pump the fluids from the bulk reservoirs into and out of the channels. By varying relative frequencies of the four pumps, input fluids can be routed to any part of the network in any proportion. Several fluidic operations including dilution, mixing, dynamic valving, and routing have been demonstrated. Thus, a fully integrated microfluidic switchboard that does not require external sources of mechanical power has been achieved. A matrix formalism to describe flow in complex switchboards has been developed and tested.     

Self-assembled silver nanoislands formed on glass surface via out-diffusion for multiple usages in SERS applications

We demonstrate that silver nanoisland film self-assembled on the surface of silver-containing glass in the course of thermal processing in hydrogen is capable to detect 10⁻⁷ M concentration of rhodamine 6G in water using surface enhanced Raman spectroscopy (SERS) technique. The film can be multiply restored on the same glass substrate via annealing of the glass in hydrogen. We showed that the film can be self-assembled after as much as ten circles of the substrate cleaning followed by annealing. The proposed technique of the silver nanoisland film formation enables multiple usage of the same glass substrate in SERS experiments.