Optimal server allocations for streaming multimedia applications on the Internet

In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks consisting of geographically dispersed servers and user populations over an interconnected set of metropolitan areas. Server selection issues for Web-based applications in such an environment have been widely addressed; the selection is mostly based on proximity measured using packet delay. Such a greedy or heuristic approach to server selection will not address the capacity planning problem evident in multimedia applications. For such applications, admission control becomes an essential part of their design to maintain Quality of Service (QoS). Our objective in providing a solution to the server selection problem is threefold: first, to direct clients to the nearest server; second, to provide multiple sources to diffuse network load; third, to match server capacity to user demand so that optimal blocking performance can be expected. We accomplish all three objectives by using a special type of Linear Programming (LP) formulation called the Transportation Problem (TP). The objective function in the TP is to minimize the cost of serving a video request from user population x using server y as measured by network distance. The optimal allocation between servers and user populations from TP results in server clusters, the aggregated capacity of each cluster designed to meet the demands of its designated user population. Within a server cluster, we propose streaming protocols for request handling that will result in a balanced load. We implement threshold-based admission control in individual servers within a cluster to enforce the fair share of the server resource to its designated user population. The blocking performance is used as a trigger to find new optimal allocations when blocking rates become unacceptable due to change in user demands. We substantiate the analytical model with an extensive simulation for analyzing the performance of the proposed clustered architecture and the protocols. The simulation results show significant difference in overall blocking performance between optimal and suboptimal allocations in as much as 15% at moderate to high workloads. We also show that the proposed cluster protocols result in lower packet loss and latencies by forcing path diversity from multiple sources for request delivery.     

Imaging gold clusters on TiO2(110) at elevated pressures and temperatures

Variable temperature scanning tunneling microscopy (STM) has been used to image oxide-supported nanoclusters of Au at temperatures from 300 to 450 K and oxygen pressures from 10^–10 to 4 Torr. Oxygen-induced morphological changes of the TiO₂(1×2) reconstruction are apparent at room temperature and prolonged exposure (3×10³ L (langmuir)) at 10^–4 Torr oxygen. Gold clusters with diameters smaller than 4 nm are unstable toward sintering at ca. 450 K and oxygen pressures >10^–1 Torr. Oxygen at pressures >10^–4 Torr weakens the interaction between the gold cluster and the titania support. Increasing the sample temperature to >300 K facilitates disruption of the cluster–support interaction.     

High Performance RDMA-Based MPI Implementation over InfiniBand

Although InfiniBand Architecture is relatively new in the high performance computing area, it offers many features which help us to improve the performance of communication subsystems. One of these features is Remote Direct Memory Access (RDMA) operations. In this paper, we propose a new design of MPI over InfiniBand which brings the benefit of RDMA to not only large messages, but also small and control messages. We also achieve better scalability by exploiting application communication pattern and combining send/receive operations with RDMA operations. Our RDMA-based MPI implementation achieves a latency of 6.8 sec for small messages and a peak bandwidth of 871 million bytes/sec. Performance evaluation shows that for small messages, our RDMA-based design can reduce the latency by 24%, increase the bandwidth by over 104%, and reduce the host overhead by up to 22% compared with the original design. For large data transfers, we improve performance by reducing the time for transferring control messages. We have also shown that our new design is beneficial to MPI collective communication and NAS Parallel Benchmarks.     

Summarization of text-based documents with a determination of latent topical sections and information-rich sentences

A method is proposed for use in summarization of text-based documents. By means of the method it is possible to discover latent topical sections and information-rich sentences. The underlying basis of the method — clustering of sentences — is formulated mathematically in the form of a problem of quadratic-type integer programming. An algorithm that makes it possible to determine with specified precision the optimal number of clusters is developed. The synthesis of a neural network is described for the purpose of solving a problem of integer quadratic programming.     

A decomposition of Moran's I for clustering detection

The test statistics I_h, I_c, and I_n are derived by decomposing the numerator of the Moran's I test for high-value clustering, low-value clustering, and negative autocorrelation, respectively. Formulae to compute the means and variances of these test statistics are derived under a random permutation test scheme, and the p-values of the test statistics are computed by asymptotic normality. A set of simulations shows that test statistic I_h is likely to be significant only for high-value clustering, test statistic I_c is likely to be significant only for low-value clustering, and test statistic I_n is likely to be significant only for negatively correlated spatial structures. These test statistics were used to reexamine spatial distributions of sudden infant death syndrome in North Carolina and the pH values of streams in the Great Smoky Mountains. In both analyses, low-value clustering and high-value clustering were shown to exit simultaneously.     

Developing Biotechnology Clusters in Non-high Technology Regions—The Case of Austria

This paper explores the role of distant knowledge links and policy actions for the development of biotechnology clusters. It seeks to challenge the prevailing view that the birth and early development of high technology industries are always spontaneous phenomena which are mainly based on local knowledge. Departing from the theoretical concept of regional innovation systems (RIS), a distinction between “RIS with strong potentials for high technology industries” and “RIS with weak potentials for high technology industries” will be drawn. It will be argued that in the latter case the development of biotechnology clusters is more dependent on distant knowledge sources and proactive policy efforts to create a favourable environment for high technology activities. Furthermore, it will be shown that a far-reaching transformation of the regional innovation system is crucial for catching-up processes of regions which are latecomers in high technology sectors such as biotechnology.     

BmNn和BmNnˉ团簇结构及其光电子能谱的研究

采用密度泛函理论（DFT）的B3LYP方法，在6-31G（d）水平上对BmNn（m＋n≤5）团簇及其阴离子的几何构型、电子结构和振动光谱等性质进行了理论研究．并在相同水平下计算了BmNnˉ（／m＋n≤5）的垂直电离能和BmNn（m＋n≤5）的绝热电子亲和势．结果表明：BmNnˉ（m＋n≤5）团簇的基态构型中，BN、B2N、B3N、B2 N3和B3N：为线形结构，其余均为平面结构；BmNnˉ（m＋n≤5）团簇的基态构型中，BN3ˉ、B2N3ˉ、BN4ˉ和B4Nˉ为平面结构，其余均为线形结构．     

Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters

In this paper, we present a technique that combines motion planning and part interaction clusters to improve generation of assembly precedence constraints. In particular, this technique automatically finds, and clusters, parts that can mutually affect each other’s accessibility, and hence may impose assembly constraints. This enables the generation of accurate precedence constraints without needing to examine all possible assembly sequences. Given an assembly model, our technique generates potential disassembly layers: spatial clustering is used to generate part sets. Next, motion planning based on rapidly-exploring random trees (RRT) with multiple trees is used to evaluate the interaction between these part sets. Specifically, motion planning is used to determine which part sets can be removed from the assembly. These sets are added to the first disassembly layer and removed from the assembly. Part sets that can be removed from the simplified assembly are then added to the second layer. If the process gets stuck, parts in the parent set are regrouped, and the process continues until all disassembly layers are found. The resulting structure reveals precedence relationships among part sets, which can be used to generate feasible assembly sequences for each part set and the whole assembly. We present theoretical results related to the algorithms developed in the paper. Computational results from tests on a variety of assemblies are presented to illustrate our approach.     

Genome Evolutionary Dynamics Meets Functional Genomics: A Case Story on the Identification of SLC25A44

Gene clusters are becoming promising tools for gene identification. The study reveals the purposive genomic distribution of genes toward higher inheritance rates of intact metabolic pathways/phenotypes and, thereby, higher fitness. The co-localization of co-expressed, co-interacting, and functionally related genes was found as genome-wide trends in humans, mouse, golden eagle, rice fish, Drosophila, peanut, and Arabidopsis. As anticipated, the analyses verified the co-segregation of co-localized events. A negative correlation was notable between the likelihood of co-localization events and the inter-loci distances. The evolution of genomic blocks was also found convergent and uniform along the chromosomal arms. Calling a genomic block responsible for adjacent metabolic reactions is therefore recommended for identification of candidate genes and interpretation of cellular functions. As a case story, a function in the metabolism of energy and secondary metabolites was proposed for Slc25A44, based on its genomic local information. Slc25A44 was further characterized as an essential housekeeping gene which has been under evolutionary purifying pressure and belongs to the phylogenetic ETC-clade of SLC25s. Pathway enrichment mapped the Slc25A44s to the energy metabolism. The expression of peanut and human Slc25A44s in oocytes and Saccharomyces cerevisiae strains confirmed the transport of common precursors for secondary metabolites and ubiquinone. These results suggest that SLC25A44 is a mitochondrion-ER-nucleus zone transporter with biotechnological applications. Finally, a conserved three-amino acid signature on the cytosolic face of transport cavity was found important for rational engineering of SLC25s.     

A refined model for the active site within the NO decomposition catalyst, Cu-ZSM-5

Static atomistic simulation techniques have been employed to identify a model for the active site configuration and its location within the NO decomposition catalyst, Cu-ZSM-5. We propose that the active site comprises a copper pair, bridged by OH and forming a six membered ring, specifically, {-O-Cu(II)-OH-Cu(I)-O-Al-}, within the zeolite framework. The six-membered ring arises from the strong association of both of the copper species with a single aluminium in the zeolite framework and consequently the ring is strained, reflected in the low (3.1 Å) intercopper distance in the cluster. Indeed, this Cu-Cu distance compares well with the experimentally determined value of 3.0. In addition, it is expected that the strain in the cluster influences the activity of the cluster, which we suggest may be responsible for its unique activity for NO decomposition.