Probabilistically induced domain decomposition methods for elliptic boundary-value problems

Monte Carlo as well as quasi-Monte Carlo methods are used to generate only few interfacial values in two-dimensional domains where boundary-value elliptic problems are formulated. This allows for a domain decomposition of the domain. A continuous approximation of the solution is obtained interpolating on such interfaces, and then used as boundary data to split the original problem into fully decoupled subproblems. The numerical treatment can then be continued, implementing any deterministic algorithm on each subdomain. Both, Monte Carlo (or quasi-Monte Carlo) simulations and the domain decomposition strategy allow for exploiting parallel architectures. Scalability and natural fault tolerance are peculiarities of the present algorithm. Examples concern Helmholtz and Poisson equations, whose probabilistic treatment presents additional complications with respect to the case of homogeneous elliptic problems without any potential term and source.     

Four-operand parallel optical computing using shadow-casting technique

Optical shadow-casting (OSC) technique has shown excellent potential for optically implementing two-operand parallel logic gates and array logic operations. The 16 logic functions for two binary patterns (variables) are optically realizable in parallel by properly configuring an array of 2×2 light emitting diodes. In this paper, we propose an enhanced OSC technique for implementing four-operand parallel logic gates. The proposed system is capable of performing 2¹⁶ logic functions by simply programming the switching mode of an array of 4×4 light emitting diodes in the input plane. This leads to an efficient and compact realization scheme when compared to the conventional two-operand OSC system.     

Biologically-inspired stochastic vector matching for noise-robust information processing

“End of Moore’s Law” has recently become a topic. Keeping the signal-to-noise ratio (SNR) at the same level in the future will surely increase the energy density of smaller-sized transistors. Lowering the operating voltage will prevent this, but the SNR would inevitably degrade. Meanwhile, biological systems such as cells and brains possess robustness against noise in their information processing in spite of the strong influence of stochastic thermal noise. Inspired by the information processing of organisms, we propose a stochastic computing model to acquire information from noisy signals. Our model is based on vector matching, in which the similarities between the input vector carrying external noisy signals and the reference vectors prepared in advance as memorized templates are evaluated in a stochastic manner. This model exhibited robustness against the noise strength and its performance was improved by addition of noise with an appropriate strength, which is similar to a phenomenon observed in stochastic resonance. Because the stochastic vector matching we propose here has robustness against noise, it is a candidate for noisy information processing that is driven by stochastically-operating devices with low energy consumption in future. Moreover, the stochastic vector matching may be applied to memory-based information processing like that of the brain.     

Bankruptcy prediction in banks and firms via statistical and intelligent techniques – A review

This paper presents a comprehensive review of the work done, during the 1968–2005, in the application of statistical and intelligent techniques to solve the bankruptcy prediction problem faced by banks and firms. The review is categorized by taking the type of technique applied to solve this problem as an important dimension. Accordingly, the papers are grouped in the following families of techniques: (i) statistical techniques, (ii) neural networks, (iii) case-based reasoning, (iv) decision trees, (iv) operational research, (v) evolutionary approaches, (vi) rough set based techniques, (vii) other techniques subsuming fuzzy logic, support vector machine and isotonic separation and (viii) soft computing subsuming seamless hybridization of all the above-mentioned techniques. Of particular significance is that in each paper, the review highlights the source of data sets, financial ratios used, country of origin, time line of study and the comparative performance of techniques in terms of prediction accuracy wherever available. The review also lists some important directions for future research.     

Parallel radial basis function methods for the global optimization of expensive functions

We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two radial basis function (RBF) methods for global optimization, namely, the RBF method by Gutmann [Gutmann, H.M., 2001a. A radial basis function method for global optimization. Journal of Global Optimization 19(3), 201–227] (Gutmann-RBF) and the RBF method by Regis and Shoemaker [Regis, R.G., Shoemaker, C.A., 2005. Constrained global optimization of expensive black box functions using radial basis functions, Journal of Global Optimization 31, 153–171] (CORS-RBF). We modify these algorithms so that they can generate multiple points for simultaneous evaluation in parallel. We compare the performance of the two parallel RBF methods with a parallel multistart derivative-based algorithm, a parallel multistart derivative-free trust-region algorithm, and a parallel evolutionary algorithm on eleven test problems and on a 6-dimensional groundwater bioremediation application. The results indicate that the two parallel RBF algorithms are generally better than the other three alternatives on most of the test problems. Moreover, the two parallel RBF algorithms have comparable performances on the test problems considered. Finally, we report good speedups for both parallel RBF algorithms when using a small number of processors.     

高维抛物方程迎风区域分裂差分方法

结合迎风方法和区域分裂思想,采用一阶迎风、二阶修正迎风法逼近高维抛物方程的对流项.内边界处和子区域分别对应区域分裂显隐格式;并运用极值原理和嵌入定理给出了收敛性分析,最后给出数值试验,说明其实际意义.     

A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times

We consider the problem of scheduling n independent jobs on m unrelated parallel machines with sequence-dependent setup times and availability dates for the machines and release dates for the jobs to minimize a regular additive cost function. In this work, we develop a new branch-and-price optimization algorithm for the solution of this general class of parallel machines scheduling problems. A new column generation accelerating method, termed “primal box”, and a specific branching variable selection rule that significantly reduces the number of explored nodes are proposed. The computational results show that the approach solves problems of large size to optimality within reasonable computational time.     

真值表查询式光学符号替换

本文提出了一种新的符号替换光学处理方法.采用互补编码和地点寻址的真值表查询,构造了一种可进行返回运算的全加数字处理器.利用由液晶光阀构成的行逻辑器件对这一符号替换系统进行了实验验证并给出了实验结果.