Designed Multifunctional Nanocomposites for Biomedical Applications

The assembly of multifunctional nanocomposite materials is demonstrated by exploiting the molecular sieving property of SBA‐16 nanoporous silica and using it as a template material. The cages of the pore networks are used to host iron oxide magnetic nanoparticles, leaving a pore volume of 0.29 cm³ g^?1 accessible for drug storage. This iron oxide–silica nanocomposite is then functionalized with amine groups. Finally the outside of the particle is decorated with antibodies. Since the size of many protein molecules, including that of antibodies, is too large to enter the pore system of SBA‐16, the amine groups inside the pores are preserved for drug binding. This is proven using a fluorescent protein, fluorescein‐isothiocyanate‐labeled bovine serum albumin (FITC‐BSA), with the unreacted amine groups inside the pores dyed with rhodamine B isothiocyanate (RITC). The resulting nanocomposite material offers a dual‐targeting drug delivery mechanism, i.e., magnetic and antibody‐targeting, while the functionalization approach is extendable to other applications, e.g., fluorescence–magnetic dual‐imaging diagnosis.     

Effect of orlistat on fat absorption in rats: A comparison of normal rats and rats with diverted bile and pancreatic juice

Orlistat is a specific inhibitor of pancreatic and gastric lipases leading to decreased absorption of fat. In the present study, we measured the effect of orlistat on lymphatic fat transport in rats following intake of oils very different in FA composition and TAG structure, and compared this with the transport in normal rats and rats with fat malabsorption. Rats were subjected to cannulation of the main mesenteric lymph duct, and a feeding catheter was inserted into the stomach. In addition, malabsorbing rats were cannulated in the common bile and pancreatic duct. Emulsified safflower, fish, and randomized oils were administered, and lymph was collected for 24 h and analyzed for FA composition. Administration of 25 mg orlistat together with the dietary oils resulted in very small changes from baseline lymphatic transport, indicating that inhibition of the fat absorption was almost complete and furthermore that the source of fat had no influence on the inhibitory effect of orlistat. Orlistat did not interfere with the absorption of the hydrolysis products, since high absorption of sn-2 MAG and FFA (oleic acid) mixed with orlistat was observed. The baseline lymphatic transport in the orlistat group was higher than in the malabsorbing group, but this was the result of generally lower transport of endogenous FA in the malabsorbing group, presumably caused by the absence of bile FA. The transport of FA in normal rats was several-fold higher than the transport after orlistat addition and in malabsorbing rats. Thus, this study showed that orlistat inhibited fat hydrolysis, and thereby lymphatic absorption, almost completely independently of the fat administered.     

Perfluorocarbons in Chemical Biology

Perfluorocarbons, saturated carbon chains in which all the hydrogen atoms are replaced with fluorine, form a separate phase from both organic and aqueous solutions. Though perfluorinated compounds are not found in living systems, they can be used to modify biomolecules to confer orthogonal behavior within natural systems, such as improved stability, engineered assembly, and cell-permeability. Perfluorinated groups also provide handles for purification, mass spectrometry, and ¹⁹F NMR studies in complex environments. Herein, we describe how the unique properties of perfluorocarbons have been employed to understand and manipulate biological systems.     

Universal constructions that ensure disjoint-access parallelism and wait-freedom

A universal construction is a general mechanism for obtaining a concurrent implementation of an object from its sequential code. We show that there is no universal construction that is both disjoint-access parallel (guaranteeing the processes operating on different parts of an implemented object do not interfere with one another) and wait-free (guaranteeing progress for each nonfaulty process when accessing an object). In contrast, we present a universal construction which results in disjoint-access parallel, wait-free implementations of any object provided there is a bound on the number of data items accessed by each operation supported by the object.     

V3: A vehicle-to-vehicle live video streaming architecture

We propose V3, an architecture to provide a live video streaming service to driving vehicles through vehicle-to-vehicle (V2V) networks. V2V video streaming is challenging because: (1) the V2V network may be persistently partitioned; (2) the video sources are mobile and transient. V3 addresses these challenges by incorporating a novel signaling mechanism to continuously trigger vehicles into video sources. It also adopts a store-carry-and-forward approach to transmit video data in partitioned network environments. We first propose an initial design which supports video streaming to a single receiver. We then propose a multicasting framework that enables video streaming from multiple sources to multiple receivers. Simulation experiments demonstrate the feasibility of supporting V2V video streaming with acceptable performance.     

Reframing Pinterest: Information Literacy for Interior Design Students

This article discusses providing information literacy to interior design students, specifically how over a few years, and several assignment iterations, we moved from a more traditional one-shot library instruction session to a creative Association of College and Research Libraries Framework-inspired assignment using Pinterest as the medium for the students' professionally relevant research project. The outcome of our instruction relied on flexible assignment planning, collaboration as faculty and librarians changed roles, and a focus on information literacy skills needed by professional designers.     

Experimental study of diffusion-based extraction from a cell suspension

A recently proposed application of microfluidics is the post-thaw processing of biological cells. Numerical simulations suggest that diffusion-based extraction of the cryoprotective agent dimethyl sulfoxide (DMSO) from blood cells is viable and more efficient than centrifugation, the conventional method of DMSO removal. In order to validate the theoretical model used in these simulations, a prototype was built and the flow of two parallel streams, a suspension of Jurkat cells containing DMSO and a wash stream that contained neither cells nor DMSO, was characterized experimentally. DMSO transport in a rectangular channel (depth 500 μm, width 25 mm and overall length 125 mm) was studied as a function of three dimensionless parameters: depth ratio of the streams, cell volume fraction in the cell solution, and the Peclet number (Pe) based on channel depth, average flow rate and the diffusion coefficient for DMSO in water. In our studies, values of Pe ranged from O(10³) to O(10⁴). Laminar flow was ensured by keeping the Reynolds number between O(1) and O(10). Experimental results based on visual and quantitative data demonstrate conclusively that a microfluidic device can effectively remove DMSO from liquid and cell laden streams without compromising cell recovery. Also, flow conditions in the microfluidic device appear to have no adverse effect on cell viability at the outlet. Further, the results demonstrate that we can predict the amount of DMSO removed from a given device with the theoretical model mentioned previously.     

The space complexity of unbounded timestamps

The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide information about the real-time ordering of those events. We consider the space complexity of wait-free implementations of timestamps from shared read-write registers in a system of n processes. We prove an lower bound on the number of registers required. If the timestamps are elements of a nowhere dense set, for example the integers, we prove a stronger, and tight, lower bound of n. However, if timestamps are not from a nowhere dense set, this bound can be beaten: we give an implementation that uses n − 1 (single-writer) registers. We also consider the special case of anonymous implementations, where processes are programmed identically and do not have unique identifiers. In contrast to the general case, we prove anonymous timestamp implementations require n registers. We also give an implementation to prove that this lower bound is tight. This is the first anonymous timestamp implementation that uses a finite number of registers.