Complexity of Monte Carlo algorithms for a class of integral equations

In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.

Robustness and applicability of Markov chain Monte Carlo algorithms for eigenvalue problems

In this paper we analyse applicability and robustness of Markov chain Monte Carlo algorithms for eigenvalue problems. We restrict our consideration to real symmetric matrices. Almost Optimal Monte Carlo (MAO) algorithms for solving eigenvalue problems are formulated. Results for the structure of both - systematic and probability error are presented. It is shown that the values of both errors can be controlled independently by different algorithmic parameters. The results present how the systematic error depends on the matrix spectrum. The analysis of the probability error is presented. It shows that the close (in some sense) the matrix under consideration is to the stochastic matrix the smaller is this error. Sufficient conditions for constructing robust and interpolation Monte Carlo algorithms are obtained. For stochastic matrices an interpolation Monte Carlo algorithm is constructed. A number of numerical tests for large symmetric dense matrices are performed in order to study experimentally the dependence of the systematic error from the structure of matrix spectrum. We also study how the probability error depends on the balancing of the matrix. (c) 2007 Elsevier Inc. All rights reserved.

Experimental design and model construction algorithms for radial basis function networks

New construction algorithms for radial basis function (RBF) network modelling are introduced based on the A-optimality and D-optimality experimental design criteria respectively. We utilize new cost functions, based on experimental design criteria, for model selection that simultaneously optimizes model approximation, parameter variance (A-optimality) or model robustness (D-optimality). The proposed approaches are based on the forward orthogonal least-squares (OLS) algorithm, such that the new A-optimality- and D-optimality-based cost functions are constructed on the basis of an orthogonalization process that gains computational advantages and hence maintains the inherent computational efficiency associated with the conventional forward OLS approach. The proposed approach enhances the very popular forward OLS-algorithm-based RBF model construction method since the resultant RBF models are constructed in a manner that the system dynamics approximation capability, model adequacy and robustness are optimized simultaneously. The numerical examples provided show significant improvement based on the D-optimality design criterion, demonstrating that there is significant room for improvement in modelling via the popular RBF neural network.

Wigner Transport models of the electron-phonon kinetics in quantum wires

Two quantum-kinetic models of ultrafast electron transport in quantum wires are derived from the generalized electron-phonon Wigner equation. The various assumptions and approximations allowing one to find closed equations for the reduced electron Wigner function are discussed with an emphasis on their physical relevance. The models correspond to the Levinson and Barker-Ferry equations, now generalized to account for a space-dependent evolution. They are applied to study the quantum effects in the dynamics of an initial packet of highly nonequilibrium carriers, locally generated in the wire. The properties of the two model equations are compared and analyzed.

Gas-phase kinetics of chlorosilylene reactions II. ClSiH + C2H4: absolute rate measurements and quantum chemical and RRKM calculations for the prototype pi addition reaction

Time-resolved studies of chlorosilylene, ClSiH, generated by the 193 nm laser flash photolysis of 1-chloro-1-silacyclopent-3-ene, are carried out to obtain rate constants for its bimolecular reaction with ethene, C2H4, in the gas-phase. The reaction is studied over the pressure range 0.13-13.3 kPa (with added SF6) at five temperatures in the range 296-562 K. The second order rate constants, obtained by extrapolation to the high pressure limits at each temperature, fitted the Arrhenius equation: log(k(infinity)/cm(3) molecule(-1) s(-1))=(-10.55 +/- 0.10) + (3.86 +/- 0.70) kJ mol(-1)/RT ln10. The Arrhenius parameters correspond to a loose transition state and the rate constant at room temperature is 43% of that for SiH2 + C2H4, showing that the deactivating effect of Cl-for-H substitution in the silylene is not large. Quantum chemical calculations of the potential energy surface for this reaction at the G3MP2//B3LYP level show that, as well as 1-chlorosilirane, ethylchlorosilylene is a viable product. The calculations reveal how the added effect of the Cl atom on the divalent state stabilisation of ClSiH influences the course of this reaction. RRKM calculations of the reaction pressure dependence suggest that ethylchlorosilylene should be the main product. The results are compared and contrasted with those of SiH2 and SiCl2 with C2H4.

Time-resolved gas-phase kinetic, quantum chemical and RRKM studies of reactions of silylene with cyclic ethers

Time-resolved kinetic studies of silylene, SiH2, generated by laser flash photolysis of phenylsilane, have been carried out to obtain rate constants for its bimolecular reactions with oxirane, oxetane, and tetrahydrofuran (THF). The reactions were studied in the gas phase over the pressure range 1-100 Torr in SF6 bath gas, at four or five temperatures in the range 294-605 K. All three reactions showed pressure dependences characteristic of third-body-assisted association reactions with, surprisingly, SiH2 + oxirane showing the least and SiH2 + THF showing the most pressure dependence. The second-order rate constants obtained by extrapolation to the high-pressure limits at each temperature fitted the Arrhenius equations where the error limits are single standard deviations: log(k(oxirane)(infinity)/cm(3) molecule(-1) s(-1)) = (-11.03 +/- 0.07) + (5.70 +/- 0.51) kJ mol(-1)/RT In 10 log(k(oxetane)(infinity)/cm(3) molecule(-1) s(-1)) = (-11.17 +/- 0.11) + (9.04 +/- 0.78) kJ mol(-1)/RT In 10 log(k(THF)(infinity)/cm(3) molecule(-1) s(-1)) = (-10.59 +/- 0.10) + (5.76 +/- 0.65) kJ mol(-1)/RT In 10 Binding-energy values of 77, 97, and 92 kJ mol(-1) have been obtained for the donor-acceptor complexes of SiH2 with oxirane, oxetane, and THF, respectively, by means of quantum chemical (ab initio) calculations carried Out at the G3 level. The use of these values to model the pressure dependences of these reactions, via RRKM theory, provided a good fit only in the case of SiH2 + THF. The lack of fit in the other two cases is attributed to further reaction pathways for the association complexes of SiH2 with oxirane and oxetane. The finding of ethene as a product of the SiH2 + oxirane reaction supports a pathway leading to H2Si=O + C2H4 predicted by the theoretical calculations of Apeloig and Sklenak.

New algorithms for synthesized design of optical filters

Chebyshev optical-filter algorithms for low-cost microcomputers have been improved. An offset ripple is now used for better transmission/matching in low-pass stacks. A prototype for narrowband filters is now more general and nearer practicability.

Application of the entropy technique and genetic algorithms to construction site layout planning of medium-size projects

Genetic algorithms (GAs) have been introduced into site layout planning as reported in a number of studies. In these studies, the objective functions were defined so as to employ the GAs in searching for the optimal site layout. However, few studies have been carried out to investigate the actual closeness of relationships between site facilities; it is these relationships that ultimately govern the site layout. This study has determined that the underlying factors of site layout planning for medium-size projects include work flow, personnel flow, safety and environment, and personal preferences. By finding the weightings on these factors and the corresponding closeness indices between each facility, a closeness relationship has been deduced. Two contemporary mathematical approaches - fuzzy logic theory and an entropy measure - were adopted in finding these results in order to minimize the uncertainty and vagueness of the collected data and improve the quality of the information. GAs were then applied to searching for the optimal site layout in a medium-size government project using the GeneHunter software. The objective function involved minimizing the total travel distance. An optimal layout was obtained within a short time. This reveals that the application of GA to site layout planning is highly promising and efficient.

Evaluation of peak-picking algorithms for protein mass spectrometry

Peak picking is an early key step in MS data analysis. We compare three commonly used approaches to peak picking and discuss their merits by means of statistical analysis. Methods investigated encompass signal-to-noise ratio, continuous wavelet transform, and a correlation-based approach using a Gaussian template. Functionality of the three methods is illustrated and discussed in a practical context using a mass spectral data set created with MALDI-TOF technology. Sensitivity and specificity are investigated using a manually defined reference set of peaks. As an additional criterion, the robustness of the three methods is assessed by a perturbation analysis and illustrated using ROC curves.

The gas-phase reaction between silylene and 2-butyne: kinetics, isotope studies, pressure dependence studies and quantum chemical calculations

Time-resolved kinetic studies of the reactions of silylene, SiH2, and dideutero-silylene, SiD2, generated by laser. ash photolysis of phenylsilane and phenylsilane-d(3), respectively, have been carried out to obtain rate coefficients for their bimolecular reactions with 2-butyne, CH3C CCH3. The reactions were studied in the gas phase over the pressure range 1-100 Torr in SF6 bath gas at five temperatures in the range 294-612 K. The second-order rate coefficients, obtained by extrapolation to the high pressure limits at each temperature, fitted the Arrhenius equations where the error limits are single standard deviations: log(k(H)(infinity)/cm(3) molecule(-1) s(-1)) = (-9.67 +/- 0.04) + (1.71 +/- 0.33) kJ mol(-1)/RTln10 log(k(D)(infinity)/cm(3) molecule(-1) s(-1)) = (-9.65 +/- 0.01) + (1.92 +/- 0.13) kJ mol(-1)/RTln10 Additionally, pressure-dependent rate coefficients for the reaction of SiH2 with 2-butyne in the presence of He (1-100 Torr) were obtained at 301, 429 and 613 K. Quantum chemical (ab initio) calculations of the SiC4H8 reaction system at the G3 level support the formation of 2,3-dimethylsilirene [cyclo-SiH2C(CH3)=C(CH3)-] as the sole end product. However, reversible formation of 2,3-dimethylvinylsilylene [CH3CH=C(CH3)SiH] is also an important process. The calculations also indicate the probable involvement of several other intermediates, and possible products. RRKM calculations are in reasonable agreement with the pressure dependences at an enthalpy value for 2,3-dimethylsilirene fairly close to that suggested by the ab initio calculations. The experimental isotope effects deviate significantly from those predicted by RRKM theory. The differences can be explained by an isotopic scrambling mechanism, involving H - D exchange between the hydrogens of the methyl groups and the D-atoms in the ring in 2,3-dimethylsilirene-1,1-d(2). A detailed mechanism involving several intermediate species, which is consistent with the G3 energy surface, is proposed to account for this.

Distributed acceleration of mobile radio network optimisation algorithms

The past decade has witnessed explosive growth of mobile subscribers and services. With the purpose of providing better-swifter-cheaper services, radio network optimisation plays a crucial role but faces enormous challenges. The concept of Dynamic Network Optimisation (DNO), therefore, has been introduced to optimally and continuously adjust network configurations, in response to changes in network conditions and traffic. However, the realization of DNO has been seriously hindered by the bottleneck of optimisation speed performance. An advanced distributed parallel solution is presented in this paper, as to bridge the gap by accelerating the sophisticated proprietary network optimisation algorithm, while maintaining the optimisation quality and numerical consistency. The ariesoACP product from Arieso Ltd serves as the main platform for acceleration. This solution has been prototyped, implemented and tested. Real-project based results exhibit a high scalability and substantial acceleration at an average speed-up of 2.5, 4.9 and 6.1 on a distributed 5-core, 9-core and 16-core system, respectively. This significantly outperforms other parallel solutions such as multi-threading. Furthermore, augmented optimisation outcome, alongside high correctness and self-consistency, have also been fulfilled. Overall, this is a breakthrough towards the realization of DNO.

Acceleration of radio network optimisation algorithms

The increasing demand for cheaper-faster-better services anytime and anywhere has made radio network optimisation much more complex than ever before. In order to dynamically optimise the serving network, Dynamic Network Optimisation (DNO), is proposed as the ultimate solution and future trend. The realization of DNO, however, has been hindered by a significant bottleneck of the optimisation speed as the network complexity grows. This paper presents a multi-threaded parallel solution to accelerate complicated proprietary network optimisation algorithms, under a rigid condition of numerical consistency. ariesoACP product from Arieso Ltd serves as the platform for parallelisation. This parallel solution has been benchmarked and results exhibit a high scalability and a run-time reduction by 11% to 42% based on the technology, subscriber density and blocking rate of a given network in comparison with the original version. Further, it is highly essential that the parallel version produces equivalent optimisation quality in terms of identical optimisation outputs.

Neurofuzzy mixture of experts network parallel learning and model construction algorithms

A connection between a fuzzy neural network model with the mixture of experts network (MEN) modelling approach is established. Based on this linkage, two new neuro-fuzzy MEN construction algorithms are proposed to overcome the curse of dimensionality that is inherent in the majority of associative memory networks and/or other rule based systems. The first construction algorithm employs a function selection manager module in an MEN system. The second construction algorithm is based on a new parallel learning algorithm in which each model rule is trained independently, for which the parameter convergence property of the new learning method is established. As with the first approach, an expert selection criterion is utilised in this algorithm. These two construction methods are equivalent in their effectiveness in overcoming the curse of dimensionality by reducing the dimensionality of the regression vector, but the latter has the additional computational advantage of parallel processing. The proposed algorithms are analysed for effectiveness followed by numerical examples to illustrate their efficacy for some difficult data based modelling problems.