Design,Synthesis, and Self-Assembly Studies of a Suite of Monodisperse,Facially Amphiphilic,Protein–Dendron Conjugates

The custom design of protein–dendron amphiphilic macromolecules is at the forefront of macromolecular engineering. Macromolecules with this architecture are very interesting because of their ability to self-assemble into various biomimetic nanoscopic structures. However, to date, there are no reports on this concept due to technical challenges associated with the chemical synthesis. Towards that end, herein, a new chemical methodology for the modular synthesis of a suite of monodisperse, facially amphiphilic, protein–dendron bioconjugates is reported. Benzyl ether dendrons of different generations (G1–G4) are coupled to monodisperse cetyl ethylene glycol to form macromolecular amphiphilic activity-based probes (AABPs) with a single protein reactive functionality. Micelle-assisted protein labeling technology is utilized for site-specific conjugation of macromolecular AABPs to globular proteins to make monodisperse, facially amphiphilic, protein–dendron bioconjugates. These biohybrid conjugates have the ability to self-assemble into supramolecular protein nanoassemblies. Self-assembly is primarily mediated by strong hydrophobic interactions of the benzyl ether dendron domain. The size, surface charge, and oligomeric state of protein nanoassemblies could be systematically tuned by choosing an appropriate dendron or protein of interest. This chemical method discloses a new way to custom-make monodisperse, facially amphiphilic, protein–dendron bioconjugates.     

利用精密仪表放大器实现负压电流检测

监测正电源的电流时，通常使用高边检流放大器。然而，对于ISDN、电信电源，通常需要一个工作在负电源的检流放大器。本文介绍了一种采用MAX4460单电源仪表放大器设计负压检流放大器的方法。     

Performance of in-call buffer/window allocation schemes for short intermittent file transfers over broadband packet networks

While static open loop rate controls may be adequate for handling continuous bit rate (CBR) traffic, relatively smooth data traffic, and relatively low speed bursty data traffic over broadband integrated networks, high speed bursty data sources need more dynamic controls. Burst level resource allocation is one such dynamic control. Potential benefits and other issues for burst level resource parameter negotiations for bursty data traffic over high speed wide area packet networks have been discussed earlier.^1–6 A detailed analysis of an adaptive buffer/window negotiation scheme for long file transfers using these concepts is presented in Reference 1. In this paper we discuss two burst level buffer/window negotiation schemes for short intermittent file transfers, focusing on the specific needs of such traffic streams. We develop closed network of queues models to reflect the behaviour of the proposed schemes. These models, while being simple, capture essential details of the control schemes. Under fairly general assumptions, the resulting network of queues is of product form and can be analysed using the mean value analysis. We use such an analysis to compare the proposed schemes and to determine appropriate sizes of trunk buffers to achieve the desired balance between bandwidth utilization and file transfer delay. The effects of other parameters on the performance of these schemes as well as on the buffer sizing rules are also discussed. Burst level (in-call) parameter negotiation may be carried out by the end system with the network elements or by an interface system (access controller) with the broadband network elements. We discuss implications of this location as well as the needed protocol features. Finally, the service discrimination capabilities desired at the trunk controllers in switching nodes are briefly discussed.     

Fast restoration of ATM networks

Asynchronous transfer mode (ATM) is now well recognized as the fundamental switching and multiplexing technique for future broadband ISDN. As these networks will be increasingly relied upon for providing a multitude of integrated voice, data, and video services, network reliability is a key concern. There are several intrinsic features of ATM networks that could potentially be exploited to provide improved restoration techniques, beyond those established for synchronous transfer mode (STM) networks, such as digital cross-connect restoration or self-healing rings. These features include ATM cell level error detection, inherent rate adaptation and nonhierarchical multiplexing. The authors explore the use of these features in developing fast restoration strategies for ATM networks. In particular, they address: (1) ATM error detection capabilities for enhanced failure detection, (2) network rerouting strategies, (3) spare capacity allocation, and (4) network control architecture and related implementation aspects. Their findings suggest that fast network span failure detection and bandwidth-efficient rerouting capabilities can be combined to develop restoration strategies for ATM networks with significantly greater performance-cost ratios when compared to existing STM network restoration strategies     

RADIAL FLOW HOLLOW FIBERREVERSE OSMOSIS: EXPERIMENTS AND THEORY

The performance of a hollow fiber reverse osmosis system is studied both theoretically and experimentally. Experiments were carried out for applied pressure ranging from 200 to 400 psig, feed rates varying from 75 to 380 cc/sec and for feed concentrations up to 34,000 ppm of sodium chloride.

A mathematical model is proposed to predict productivity, ϕ, and product concentration, θ_p. The model involves solving membrane transport equations simultaneously with the hydrodynamic equations. The solubility-diffusion-imperfection, or pore diffusion model, is used to describe solute and solvent transport across the membrane. The axial gradients of shell side concentration, neglected in previous investigations, are taken into account. The differential equations are solved numerically by the 4th Order Runge-Kutta method.

Predicted values of ϕ and θ_p agree within 8% and 17% respectively, with experimental data over the entire range of operating conditions. However, membrane transport coefficients were found to be concentration dependent.

An approximate analysis shows that the concentration polarization is negligible in present day hollow fiber systems.     

EvoMiner: frequent subtree mining in phylogenetic databases

The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to interpret the results of phylogenetic analysis. FST mining generalizes the well-known maximum agreement subtree problem. Here we present EvoMiner, a new algorithm for mining frequent subtrees in collections of phylogenetic trees. EvoMiner is an Apriori-like levelwise method, which uses a novel phylogeny-specific constant-time candidate generation scheme, an efficient fingerprinting-based technique for downward closure, and a lowest-common-ancestor-based support counting step that requires neither costly subtree operations nor database traversal. Our algorithm achieves speedups of up to 100 times or more over Phylominer, the current state-of-the-art algorithm for mining phylogenetic trees. EvoMiner can also work in depth-first enumeration mode to use less memory at the expense of speed. We demonstrate the utility of FST mining as a way to extract meaningful phylogenetic information from collections of trees when compared to maximum agreement subtrees and majority-rule trees—two commonly used approaches in phylogenetic analysis for extracting consensus information from a collection of trees over a common leaf set.     

Graphical models for interactive POMDPs: representations and solutions

We develop new graphical representations for the problem of sequential decision making in partially observable multiagent environments, as formalized by interactive partially observable Markov decision processes (I-POMDPs). The graphical models called interactive influence diagrams (I-IDs) and their dynamic counterparts, interactive dynamic influence diagrams (I-DIDs), seek to explicitly model the structure that is often present in real-world problems by decomposing the situation into chance and decision variables, and the dependencies between the variables. I-DIDs generalize DIDs, which may be viewed as graphical representations of POMDPs, to multiagent settings in the same way that I-POMDPs generalize POMDPs. I-DIDs may be used to compute the policy of an agent given its belief as the agent acts and observes in a setting that is populated by other interacting agents. Using several examples, we show how I-IDs and I-DIDs may be applied and demonstrate their usefulness. We also show how the models may be solved using the standard algorithms that are applicable to DIDs. Solving I-DIDs exactly involves knowing the solutions of possible models of the other agents. The space of models grows exponentially with the number of time steps. We present a method of solving I-DIDs approximately by limiting the number of other agents’ candidate models at each time step to a constant. We do this by clustering models that are likely to be behaviorally equivalent and selecting a representative set from the clusters. We discuss the error bound of the approximation technique and demonstrate its empirical performance.     

A compact ACS-fed dual-band monopole antenna for LTE,WLAN/WiMAX and public safety applications

In this paper, a compact asymmetric coplanar strip (ACS)-fed printed monopole antenna for dual frequency operation is presented. The proposed antenna is composed of an ACS-fed monopole structure and two semi circle shaped radiating branches, which occupies a very small size of 13.4 × 22.7 mm² including the ground plane. By properly selecting the length and position of these branches, two desired operating bands can be achieved and tuned independently. The simulated and measured return loss results shows that the proposed antenna can be used for long term evolution 2500 (2500–2690 MHz), WLAN 5.2 GHz (5.15–5.35 GHz)/5.8 GHz (5.725–5.825 GHz), WiMAX 5.5 GHz (5.28–5.85 GHz) and 4.9 GHz (4.94–4.99 GHz) public safety applications. The omnidirectional and bidirectional radiation pattern characteristics in H-plane and E-plane of the proposed antenna along with acceptable peak gain make the best suitable candidate for the above intended applications.