Clustering based on median and closest string via rank distance with applications on DNA

This paper aims to present several clustering methods based on rank distance. Rank distance has applications in many different fields such as computational linguistics, biology and computer science. The K-means algorithm represents each cluster by a single mean vector. The mean vector is computed with respect to a distance measure. Two K-means algorithms based on rank distance are described in this paper. Hierarchical clustering builds models based on distance connectivity. This paper describes two hierarchical clustering techniques that use rank distance. Experiments using mitochondrial DNA sequences extracted from several mammals are performed to compare the results of the clustering methods. Results demonstrate the clustering performance and the utility of the proposed algorithms.     

CO2 Retention in High-Alkali Borate Glasses

A study of the high-alkali region of glass formation in the system Na₂O +B₂O₃ reveals that retention of CO₂ from carbonate starting materials can become a serious preparative problem at the high-alkali extreme. Results presented for glasses prepared using both Na₂O and Na₂CO₃ show that residual CO₂ can lead to major differences in physical properties which in this work are represented by the viscosity-related glass transition temperature .     

An output formation consensus control for leader–follower networked multi-agent systems under communication constraints and switching topologies

In this paper, the formation consensus problem for a class of leader–follower networked multi-agent systems under communication constraints and switching topologies is investigated. A networked predictive control scheme is proposed to achieve stability and output formation consensus with the switching topology, capable of compensating for data loss and time delays in the network. By equating the whole closed-loop networked multi-agent system with the proposed control scheme to the corresponding switched system, the sufficient and necessary condition of output formation consensus and stability for agents is given. Finally, using three-degree-of-freedom air-bearing spacecraft simulators as the control objects, the proposed scheme is demonstrated to be able to actively compensate for the communication constraints through numerical simulations, and it is also verified to have a good control performance by further realizing the formation task of the simulators through practical experiments.     

Diode-Pumped Solid-State Lasers for Inertial Fusion Energy

We have begun building the Mercury laser system as the first in a series of new generation diode-pumped solid-state lasers for inertial fusion research. Mercury will integrate three key technologies: diodes, crystals, and gas cooling, within a unique laser architecture that is scalable to kilojoule and megajoule energy levels for fusion energy applications. The primary near-term performance goals include 10% electrical efficiencies at 10 Hz and 100J with a 2–10 ns pulse length at 1.047 m wavelength. When completed, Mercury will allow rep-rated target experiments with multiple chambers for high energy density physics research.     

Continuous-time quantum Monte Carlo impurity solvers

Continuous-time quantum Monte Carlo impurity solvers are algorithms that sample the partition function of an impurity model using diagrammatic Monte Carlo techniques. The present paper describes codes that implement the interaction expansion algorithm originally developed by Rubtsov, Savkin, and Lichtenstein, as well as the hybridization expansion method developed by Werner, Millis, Troyer, et al. These impurity solvers are part of the ALPS-DMFT application package and are accompanied by an implementation of dynamical mean-field self-consistency equations for (single orbital single site) dynamical mean-field problems with arbitrary densities of states.

Program summary

Program title: dmftCatalogue identifier: AEIL_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIL_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: ALPS LIBRARY LICENSE version 1.1No. of lines in distributed program, including test data, etc.: 899 806No. of bytes in distributed program, including test data, etc.: 32 153 916Distribution format: tar.gzProgramming language: C++Operating system: The ALPS libraries have been tested on the following platforms and compilers:

• • 

  Linux with GNU Compiler Collection (g++ version 3.1 and higher), and Intel C++ Compiler (icc version 7.0 and higher)

• • 

  MacOS X with GNU Compiler (g++ Apple-version 3.1, 3.3 and 4.0)

• • 

  IBM AIX with Visual Age C++ (xlC version 6.0) and GNU (g++ version 3.1 and higher) compilers

• • 

  Compaq Tru64 UNIX with Compq C++ Compiler (cxx)

• • 

  SGI IRIX with MIPSpro C++ Compiler (CC)

• • 

  HP-UX with HP C++ Compiler (aCC)

• • 

  Windows with Cygwin or coLinux platforms and GNU Compiler Collection (g++ version 3.1 and higher)

RAM: 10 MB–1 GBClassification: 7.3External routines: ALPS [1], BLAS/LAPACK, HDF5Nature of problem: (See [2].) Quantum impurity models describe an atom or molecule embedded in a host material with which it can exchange electrons. They are basic to nanoscience as representations of quantum dots and molecular conductors and play an increasingly important role in the theory of “correlated electron” materials as auxiliary problems whose solution gives the “dynamical mean field” approximation to the self-energy and local correlation functions.Solution method: Quantum impurity models require a method of solution which provides access to both high and low energy scales and is effective for wide classes of physically realistic models. The continuous-time quantum Monte Carlo algorithms for which we present implementations here meet this challenge. Continuous-time quantum impurity methods are based on partition function expansions of quantum impurity models that are stochastically sampled to all orders using diagrammatic quantum Monte Carlo techniques. For a review of quantum impurity models and their applications and of continuous-time quantum Monte Carlo methods for impurity models we refer the reader to [2].Additional comments: Use of dmft requires citation of this paper. Use of any ALPS program requires citation of the ALPS [1] paper.Running time: 60 s–8 h per iteration.References:

• [1] 

  A. Albuquerque, F. Alet, P. Corboz, et al., J. Magn. Magn. Mater. 310 (2007) 1187.

• [2] 

  http://arxiv.org/abs/1012.4474, Rev. Mod. Phys., in press.

     

BCI Meeting 2005--workshop on signals and recording methods.

This paper describes the highlights of presentations and discussions during the Third International BCI Meeting in a workshop that evaluated potential brain-computer interface (BCI) signals and currently available recording methods. It defined the main potential user populations and their needs, addressed the relative advantages and disadvantages of noninvasive and implanted (i.e., invasive) methodologies, considered ethical issues, and focused on the challenges involved in translating BCI systems from the laboratory to widespread clinical use. The workshop stressed the critical importance of developing useful applications that establish the practical value of BCI technology.     

Poynting vector and the physical meaning of nonactive powers

This paper explains how the disputed energy oscillations associated with nonactive powers can be attributed to electromagnetic waves that travel back and forth between the transmission line's sending and receiving ends. Such waves "hug" the conductors and dwell in the dielectric that surrounds the conductors. The propagation of these energy waves and the density of their rate of flow may be observed with the help of the Poynting Vector. This approach, based on the electromagnetic fields theory, explains the true physical mechanism of energy propagation in power systems and helps to interpret correctly the power expressions in three-phase systems.     

Alphabetic search: Comment on Klahr, Chase, and Lovelace (1983).

Response time (RT) curves were obtained from Ss who were instructed to search for following or preceding letters in the alphabet with respect to given stimulus letters. To describe the shape of these curves, D. Klahr et al (see record 1984-05777-001) proposed a search model. It was assumed that the alphabet was internally represented by a number of chunks of a few letters. Klahr et al assumed that serial searches occurred along 2 hierarchical levels: (1) a search for the correct chunk and (2) a search of the letters within the chunk. The Klahr et al model predicted an ascending sawtooth-shaped RT curve. However, according to the authors' analysis of the data, the RT curves did not show the expected sawtooth shapes. In order to find out whether the lack of empirical support for the model was an artifact of averaging the data, the experiment was replicated. It was found that individual RT curves did not show the shape characteristics that were predicted by the Klahr et al model either. The data supported the hypothesis that the access of letters was direct without any hierarchy, and that the retrieval of successive letters was determined by the variable associations between subsequent letters. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Early portrait and genre photography in Romania

Abstract

Positioned at the ‘Gates of the Orient’, the Romanian Principalities attracted a large number of nineteenth century travellers, merchants, students and artists. For the artists, in particular, a visit to Romania was synomynous with a pilgrimage into the Romantic period, to a remote land filled with picturesque scenery, strange people and unbelievable adventures. Moreover, their services were welcomed by the local citizens.     

On the role of complementation in implicit language equations and relations

We solve systems of boolean implicit equations and relations with union and complementation. If the languages are regular, we determine whether a system of implicit boolean equations or relations has solutions. If there is a solution, we provide an effective construction of a (regular) solution. We give representations for maximal and minimal solutions. Moreover, we also solve the problem of uniqueness of solutions as well as whether infinitely many solutions exist.