Comparison between molecular dynamics abd Monte Carlo simulations of an ordering process in a binary alloy

Ordering in a binary alloy is studied by means of a molecular-dynamics (MD) algorithm which allows to reach the domain growth regime. Results are compared with Monte Carlo simulations using a realistic vacancy-atom (MC-VA) mechanism. At low temperatures fast growth with a dynamical exponent x>1/2 is found for MD and MC-VA. The study of a nonequilibrium ordering process with the two methods shows the importance of the nonhomogeneity of the excitations in the system for determining its macroscopic kinetics.

Majorization arrow in quantum-algorithm design

We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.

Elastic scattering of fast electrons and positrons by atoms

Elastic scattering of relativistic electrons and positrons by atoms is considered in the framework of the static field approximation. The scattering field is expressed as a sum of Yukawa terms to allow the use of various approximations. Accurate phase shifts have been computed by combining Bühring¿s power-series method with the WKB and Born approximations. This combined procedure allows the evaluation of differential cross sections for kinetic energies up to several tens of MeV. Numerical results are used to analyze the validity of several approximate methods, namely the first- and second-order Born approximations and the screened Mott formula, which are frequently adopted as the basis of multiple scattering theories and Monte Carlo simulations of electron and positron transport.

Characterization of hydroxyapatite laser ablation plumes by fast intensified CCD-imaging

ArF excimer laser pulses (193 nm, 20 ns, 150 mJ) have been focused on a hydroxyapatite (HA) target in similar conditions to those normally used for thin film deposition. Fast intensified CCD images of HA laser ablation plumes have been taken in vacuum and under different water vapor pressures ranging from 0.01 mbar to 1 mbar. Images of HA ablation in vacuum have shown a plume freely expanding at a constant velocity of 2.3 106 cm/s. HA ablation under a water vapor pressure of 0.01 mbar has revealed an expansion behavior very similar to that of ablation in vacuum. Images taken under a water vapor pressure of 0.1 mbar have shown the formation of a shock structure in the plume. Finally, HA ablation under a water vapor pressure of 1 mbar has revealed the development of some irregularities in the shape of the plume.

Anomalous crystallization of hydrogenated amorphous silicon during fast heating ramps

Thermal crystallization experiments carried out using calorimetry on several a-Si:H materials with different microstructures are reported. The samples were crystallized during heating ramps at constant heating rates up to 100 K/min. Under these conditions, crystallization takes place above 700 C and progressively deviates from the standard kinetics. In particular, two crystallization processes were detected in conventional a-Si:H, which reveal an enhancement of the crystallization rate. At100 K/min, such enhancement is consistent with a diminution of the crystallization time by a factor of 7. In contrast, no systematic variation of the resulting grain size was observed. Similar behavior was also detected in polymorphous silicon and silicon nanoparticles, thus showing that it is characteristic of a variety of hydrogenated amorphous silicon materials.

Numerical algorithm for spectroscopic ellipsometry of thick transparent films

We present a numerical method for spectroscopic ellipsometry of thick transparent films. When an analytical expression for the dispersion of the refractive index (which contains several unknown coefficients) is assumed, the procedure is based on fitting the coefficients at a fixed thickness. Then the thickness is varied within a range (according to its approximate value). The final result given by our method is as follows: The sample thickness is considered to be the one that gives the best fitting. The refractive index is defined by the coefficients obtained for this thickness.

In situ fast ellipsometric analysis of repetitive surface phenomena

We present an ellipsometric technique and ellipsometric analysis of repetitive phenomena, based on the experimental arrangement of conventional phase modulated ellipsometers (PME) c onceived to study fast surface phenomena in repetitive processes such as periodic and triggered experiments. Phase modulated ellipsometry is a highly sensitive surface characterization technique that is widely used in the real-time study of several processes such as thin film deposition and etching. However, fast transient phenomena cannot be analyzed with this technique because precision requirements limit the data acquisition rate to about 25 Hz. The presented new ellipsometric method allows the study of fast transient phenomena in repetitive processes with a time resolution that is mainly limited by the data acquisition system. As an example, we apply this new method to the study of surface changes during plasma enhanced chemical vapor deposition of amorphous silicon in a modulated radio frequency discharge of SiH4. This study has revealed the evolution of the optical parameters of the film on the millisecond scale during the plasma on and off periods. The presented ellipsometric method extends the capabilities of PME arrangements and permits the analysis of fast surface phenomena that conventional PME cannot achieve.

A program of nurse algorithm-guided care for adult patients with acute minor illnesses in primary care

Background: Attention to patients with acute minor-illnesses requesting same-day consultation represents a major burden in primary care. The workload is assumed by general practitioners in many countries. A number of reports suggest that care to these patients may be provided, at in least in part, by nurses. However, there is scarce information with respect to the applicability of a program of nurse management for adult patients with acute minor-illnesses in large areas. The aim of this study is to assess the effectiveness of a program of nurse algorithm-guided care for adult patients with acute minor illnesses requesting same-day consultation in primary care in a largely populated area. Methods: A cross-sectional study of all adult patients seeking same day consultation for 16 common acute minor illnesses in a large geographical area with 284 primary care practices. Patients were included in a program of nurse case management using management algorithms. The main outcome measure was case resolution, defined as completion of the algorithm by the nurse without need of referral of the patient to the general practitioner. The secondary outcome measure was return to consultation, defined as requirement of new consultation for the same reason as the first one, in primary care within a 7-day period. Results: During a two year period (April 2009-April 2011), a total of 1,209,669 consultations were performed in the program. Case resolution was achieved by nurses in 62.5% of consultations. The remaining cases were referred to a general practitioner. Resolution rates ranged from 94.2% in patients with burns to 42% in patients with upper respiratory symptoms. None of the 16 minor illnesses had a resolution rate below 40%. Return to consultation during a 7-day period was low, only 4.6%. Conclusions: A program of algorithms-guided care is effective for nurse case management of patients requesting same day consultation for minor illnesses in primary care.

A program of nurse algorithm-guided care for adult patients with acute minor illnesses in primary care

Background: Attention to patients with acute minor-illnesses requesting same-day consultation represents a major burden in primary care. The workload is assumed by general practitioners in many countries. A number of reports suggest that care to these patients may be provided, at in least in part, by nurses. However, there is scarce information with respect to the applicability of a program of nurse management for adult patients with acute minor-illnesses in large areas. The aim of this study is to assess the effectiveness of a program of nurse algorithm-guided care for adult patients with acute minor illnesses requesting same-day consultation in primary care in a largely populated area. Methods: A cross-sectional study of all adult patients seeking same day consultation for 16 common acute minor illnesses in a large geographical area with 284 primary care practices. Patients were included in a program of nurse case management using management algorithms. The main outcome measure was case resolution, defined as completion of the algorithm by the nurse without need of referral of the patient to the general practitioner. The secondary outcome measure was return to consultation, defined as requirement of new consultation for the same reason as the first one, in primary care within a 7-day period. Results: During a two year period (April 2009-April 2011), a total of 1,209,669 consultations were performed in the program. Case resolution was achieved by nurses in 62.5% of consultations. The remaining cases were referred to a general practitioner. Resolution rates ranged from 94.2% in patients with burns to 42% in patients with upper respiratory symptoms. None of the 16 minor illnesses had a resolution rate below 40%. Return to consultation during a 7-day period was low, only 4.6%. Conclusions: A program of algorithms-guided care is effective for nurse case management of patients requesting same day consultation for minor illnesses in primary care.

A program of nurse algorithm-guided care for adult patients with acute minor illnesses in primary care

Background: Attention to patients with acute minor-illnesses requesting same-day consultation represents a major burden in primary care. The workload is assumed by general practitioners in many countries. A number of reports suggest that care to these patients may be provided, at in least in part, by nurses. However, there is scarce information with respect to the applicability of a program of nurse management for adult patients with acute minor-illnesses in large areas. The aim of this study is to assess the effectiveness of a program of nurse algorithm-guided care for adult patients with acute minor illnesses requesting same-day consultation in primary care in a largely populated area. Methods: A cross-sectional study of all adult patients seeking same day consultation for 16 common acute minor illnesses in a large geographical area with 284 primary care practices. Patients were included in a program of nurse case management using management algorithms. The main outcome measure was case resolution, defined as completion of the algorithm by the nurse without need of referral of the patient to the general practitioner. The secondary outcome measure was return to consultation, defined as requirement of new consultation for the same reason as the first one, in primary care within a 7-day period. Results: During a two year period (April 2009-April 2011), a total of 1,209,669 consultations were performed in the program. Case resolution was achieved by nurses in 62.5% of consultations. The remaining cases were referred to a general practitioner. Resolution rates ranged from 94.2% in patients with burns to 42% in patients with upper respiratory symptoms. None of the 16 minor illnesses had a resolution rate below 40%. Return to consultation during a 7-day period was low, only 4.6%. Conclusions: A program of algorithms-guided care is effective for nurse case management of patients requesting same day consultation for minor illnesses in primary care.

Anomalous crystallization of hydrogenated amorphous silicon during fast heating ramps

Thermal crystallization experiments carried out using calorimetry on several a-Si:H materials with different microstructures are reported. The samples were crystallized during heating ramps at constant heating rates up to 100 K/min. Under these conditions, crystallization takes place above 700 C and progressively deviates from the standard kinetics. In particular, two crystallization processes were detected in conventional a-Si:H, which reveal an enhancement of the crystallization rate. At100 K/min, such enhancement is consistent with a diminution of the crystallization time by a factor of 7. In contrast, no systematic variation of the resulting grain size was observed. Similar behavior was also detected in polymorphous silicon and silicon nanoparticles, thus showing that it is characteristic of a variety of hydrogenated amorphous silicon materials

An efficient algorithm to perform multiple testing in epistasis screening

Background: Research in epistasis or gene-gene interaction detection for human complex traits has grown over the last few years. It has been marked by promising methodological developments, improved translation efforts of statistical epistasis to biological epistasis and attempts to integrate different omics information sources into the epistasis screening to enhance power. The quest for gene-gene interactions poses severe multiple-testing problems. In this context, the maxT algorithm is one technique to control the false-positive rate. However, the memory needed by this algorithm rises linearly with the amount of hypothesis tests. Gene-gene interaction studies will require a memory proportional to the squared number of SNPs. A genome-wide epistasis search would therefore require terabytes of memory. Hence, cache problems are likely to occur, increasing the computation time. In this work we present a new version of maxT, requiring an amount of memory independent from the number of genetic effects to be investigated. This algorithm was implemented in C++ in our epistasis screening software MBMDR-3.0.3. We evaluate the new implementation in terms of memory efficiency and speed using simulated data. The software is illustrated on real-life data for Crohn’s disease. Results: In the case of a binary (affected/unaffected) trait, the parallel workflow of MBMDR-3.0.3 analyzes all gene-gene interactions with a dataset of 100,000 SNPs typed on 1000 individuals within 4 days and 9 hours, using 999 permutations of the trait to assess statistical significance, on a cluster composed of 10 blades, containing each four Quad-Core AMD Opteron(tm) Processor 2352 2.1 GHz. In the case of a continuous trait, a similar run takes 9 days. Our program found 14 SNP-SNP interactions with a multiple-testing corrected p-value of less than 0.05 on real-life Crohn’s disease (CD) data. Conclusions: Our software is the first implementation of the MB-MDR methodology able to solve large-scale SNP-SNP interactions problems within a few days, without using much memory, while adequately controlling the type I error rates. A new implementation to reach genome-wide epistasis screening is under construction. In the context of Crohn’s disease, MBMDR-3.0.3 could identify epistasis involving regions that are well known in the field and could be explained from a biological point of view. This demonstrates the power of our software to find relevant phenotype-genotype higher-order associations.

A Canonical Genetic Algorithm for Blind Inversion of Linear Channels

It is well known the relationship between source separation and blind deconvolution: If a filtered version of an unknown i.i.d. signal is observed, temporal independence between samples can be used to retrieve the original signal, in the same manner as spatial independence is used for source separation. In this paper we propose the use of a Genetic Algorithm (GA) to blindly invert linear channels. The use of GA is justified in the case of small number of samples, where other gradient-like methods fails because of poor estimation of statistics.

Initialisation of Nonlinearities for PNL and Wiener systems Inversion

This paper proposes a very fast method for blindly initial- izing a nonlinear mapping which transforms a sum of random variables. The method provides a surprisingly good approximation even when the basic assumption is not fully satis¯ed. The method can been used success- fully for initializing nonlinearity in post-nonlinear mixtures or in Wiener system inversion, for improving algorithm speed and convergence.

A hybrid algorithm combining metaheuristic with Monte Carlo simulation for solving the Stochastic Flow Shop problem

In this paper, a hybrid simulation-based algorithm is proposed for the StochasticFlow Shop Problem. The main idea of the methodology is to transform the stochastic problem into a deterministic problem and then apply simulation to the latter. In order to achieve this goal, we rely on Monte Carlo Simulation and an adapted version of a deterministic heuristic. This approach aims to provide flexibility and simplicity due to the fact that it is not constrained by any previous assumption and relies in well-tested heuristics.