1,574 research outputs found

    Integration of microfluidic channels and optical waveguides using low-cost polymer microfabrication techniques

    Get PDF
    Recent progress on the realization of a silicon integrated biophotonic chip using plasma etching and laser ablation is presented. The chip utilizes films of SU-8 and UV-15 polymer material. An intersecting optical waveguide and microfluidic channel exhibiting good optical transmission across the channel is demonstrated

    Microstructural and compositional analysis of strontium-doped lead zirconate titanate thin films on gold-coated silicon substrates

    Get PDF
    This article discusses the results of transmission electron microscopy (TEM)-based characterization of strontium-doped lead zirconate titanate (PSZT) thin films. The thin films were deposited by radio frequency magnetron sputtering at 300°C on gold-coated silicon substrates, which used a 15 nm titanium adhesion layer between the 150 nm thick gold film and (100) silicon. The TEM analysis was carried out using a combination of high-resolution imaging, energy filtered imaging, energy dispersive X-ray (EDX) analysis, and hollow cone illumination. At the interface between the PSZT films and gold, an amorphous silicon-rich layer (about 4 nm thick) was observed, with the film composition remaining uniform otherwise. The films were found to be polycrystalline with a columnar structure perpendicular to the substrate. Interdiffusion between the bottom metal layers and silicon was observed and was confirmed using secondary ion mass spectrometry. This occurs due to the temperature of deposition (300°C) being close to the eutectic point of gold and silicon (363°C). The diffused regions in silicon were composed primarily of gold (analyzed by EDX) and were bounded by (111) silicon planes, highlighted by the triangular diffused regions observed in the two-dimensional TEM image

    A simple two-module problem to exemplify building-block assembly under crossover

    No full text
    Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa in other landscapes. Despite an extensive literature on the subject, and recent proofs of a principled distinction in the abilities of crossover and non-crossover algorithms for a particular theoretical landscape, building general intuitions about when and why crossover performs well when it does is a different matter. In particular, the proposal that crossover might enable the assembly of good building-blocks has been difficult to verify despite many attempts at idealized building-block landscapes. Here we show the first example of a two-module problem that shows a principled advantage for cross-over. This allows us to understand building-block assembly under crossover quite straightforwardly and build intuition about more general landscape classes favoring crossover or disfavoring it

    Strategy bifurcation and spatial inhomogeneity in a simple model of competing sellers

    Get PDF
    We present a simple one-parameter model for spatially localised evolving agents competing for spatially localised resources. The model considers selling agents able to evolve their pricing strategy in competition for a fixed market. Despite its simplicity, the model displays extraordinarily rich behavior. In addition to ``cheap'' sellers pricing to cover their costs, ``expensive'' sellers spontaneously appear to exploit short-term favorable situations. These expensive sellers ``speciate'' into discrete price bands. As well as variety in pricing strategy, the ``cheap'' sellers evolve a strongly correlated spatial structure, which in turn creates niches for their expensive competitors. Thus an entire ecosystem of coexisting, discrete, symmetry-breaking strategies arises.Comment: 6 pages, 6 figures, epl2; 1 new figure, include nash equilibrium analysis, typo fixe

    Nongaussian fluctuations arising from finite populations: Exact results for the evolutionary Moran process

    Full text link
    The appropriate description of fluctuations within the framework of evolutionary game theory is a fundamental unsolved problem in the case of finite populations. The Moran process recently introduced into this context [Nowak et al., Nature (London) 428, 646 (2004)] defines a promising standard model of evolutionary game theory in finite populations for which analytical results are accessible. In this paper, we derive the stationary distribution of the Moran process population dynamics for arbitrary 2×22\times{}2 games for the finite size case. We show that a nonvanishing background fitness can be transformed to the vanishing case by rescaling the payoff matrix. In contrast to the common approach to mimic finite-size fluctuations by Gaussian distributed noise, the finite size fluctuations can deviate significantly from a Gaussian distribution.Comment: 4 pages (2 figs). Published in Physical Review E (Rapid Communications

    A New Metaheuristic Bat-Inspired Algorithm

    Full text link
    Metaheuristic algorithms such as particle swarm optimization, firefly algorithm and harmony search are now becoming powerful methods for solving many tough optimization problems. In this paper, we propose a new metaheuristic method, the Bat Algorithm, based on the echolocation behaviour of bats. We also intend to combine the advantages of existing algorithms into the new bat algorithm. After a detailed formulation and explanation of its implementation, we will then compare the proposed algorithm with other existing algorithms, including genetic algorithms and particle swarm optimization. Simulations show that the proposed algorithm seems much superior to other algorithms, and further studies are also discussed.Comment: 10 pages, 2 figure

    A Spitzer Survey of Novae in M31

    Full text link
    We report the results of the first infrared survey of novae in the nearby spiral galaxy, M31. Both photometric and spectroscopic observations of a sample of 10 novae (M31N 2006-09c, 2006-10a, 2006-10b, 2006-11a, 2007-07f, 2007-08a, 2007-08d, 2007-10a, 2007-11d, and 2007-11e) were obtained with the Spitzer Space Telescope. Eight of the novae were observed with the IRAC (all but M31N 2007-11d and 2007-11e) and eight with the IRS (all but 2007-07f and 2007-08a), resulting in six in common between the two instruments. The observations, which were obtained between ~3 and ~7 months after discovery, revealed evidence for dust formation in two of the novae: M31N 2006-10a and (possibly) 2007-07f, and [Ne II] 12.8 micron line emission in a third (2007-11e). The Spitzer observations were supplemented with ground-based optical photometric and spectroscopic data that were used to determine the speed classes and spectroscopic types of the novae in our survey. After including data for dust-forming Galactic novae, we show that dust formation timescales are correlated with nova speed class in that dust typically forms earlier in faster novae. We conclude that our failure to detect the signature of dust formation in most of our M31 sample is likely a result of the relatively long delay between nova eruption and our Spitzer observations. Indeed, the two novae for which we found evidence of dust formation were the two "slowest" novae in our sample. Finally, as expected, we found that the majority of the novae in our sample belong to the Fe II spectroscopic class, with only one clear example of the He/N class (M31N 2006-10b). Typical of an He/N system, M31N 2006-10b was the fastest nova in our sample, not detected with the IRS, and just barely detected in three of the IRAC bands when it was observed ~4 months after eruption.Comment: 37 pages, 12 figures, accepted for publication in the Astrophysical Journa

    A quantum genetic algorithm with quantum crossover and mutation operations

    Full text link
    In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.Comment: 21 pages, 1 table, v2: typos corrected, minor modifications in sections 3.5 and 4, v3: minor revision, title changed (original title: Semiclassical genetic algorithm with quantum crossover and mutation operations), v4: minor revision, v5: minor grammatical corrections, to appear in QI

    The star-forming content of the W3 giant molecular cloud

    Full text link
    We have surveyed a ~0.9-square-degree area of the W3 giant molecular cloud and star-forming region in the 850-micron continuum, using the SCUBA bolometer array on the James Clerk Maxwell Telescope. A complete sample of 316 dense clumps was detected with a mass range from around 13 to 2500 Msun. Part of the W3 GMC is subject to an interaction with the HII region and fast stellar winds generated by the nearby W4 OB association. We find that the fraction of total gas mass in dense, 850-micron traced structures is significantly altered by this interaction, being around 5% to 13% in the undisturbed cloud but ~25 - 37% in the feedback-affected region. The mass distribution in the detected clump sample depends somewhat on assumptions of dust temperature and is not a simple, single power law but contains significant structure at intermediate masses. This structure is likely to be due to crowding of sources near or below the spatial resolution of the observations. There is little evidence of any difference between the index of the high-mass end of the clump mass function in the compressed region and in the unaffected cloud. The consequences of these results are discussed in terms of current models of triggered star formation.Comment: 13 pages, 8 figures, 1 table (full source table available on request). Accepted for publication in Monthly Notices of the Royal Astronomical Society (Main Journal

    Annealing schedule from population dynamics

    Full text link
    We introduce a dynamical annealing schedule for population-based optimization algorithms with mutation. On the basis of a statistical mechanics formulation of the population dynamics, the mutation rate adapts to a value maximizing expected rewards at each time step. Thereby, the mutation rate is eliminated as a free parameter from the algorithm.Comment: 6 pages RevTeX, 4 figures PostScript; to be published in Phys. Rev.
    corecore