Parameter estimation of q-Gaussian Radial Basis Functions Neural Networks with a Hybrid Algorithm for binary classification

A classification problem is a decision-making task that many researchers have studied. A number of techniques have been proposed to perform binary classification. Neural networks are one of the artificial intelligence techniques that has had the most successful results when applied to this problem. Our proposal is the use of q-Gaussian Radial Basis Function Neural Networks (q-Gaussian RBFNNs). This basis function includes a supplementary degree of freedom in order to adapt the model to the distribution of data. A Hybrid Algorithm (HA) is used to search for a suitable architecture for the q-Gaussian RBFNN. The use of this type of more flexible kernel could greatly improve the discriminative power of RBFNNs. In order to test performance, the RBFNN with the q-Gaussian basis functions is compared to RBFNNs with Gaussian, Cauchy and Inverse Multiquadratic RBFs, and to other recent neural networks approaches. An experimental study is presented on 11 binary-classification datasets taken from the UCI repository. Moreover, aerial imagery taken in mid-May, mid-June and mid-July was used to evaluate the potential of the methodology proposed for discriminating Ridolfia segetum patches (one of the most dominant and harmful weeds in sunflower crops) in two naturally infested fields in southern Spain.     

Computing Green's function of the initial-boundary value problem for the wave equation in a layered cylinder

A new analytical method for the approximate computation of the time-dependent Green's function for the initial-boundary value problem of the three-dimensional wave equation on multi-layered bounded cylinder is suggested in this paper. The method is based on the derivation of eigenvalues and eigenfunctions for an ordinary differential equation with piecewise constant coefficients, and an approximate computation of Green's function in the form of the Fourier series with a finite number of terms relative to the orthogonal set of the derived eigenfunctions. The computational experiment confirms the robustness of the method.     

Application of the modified Taylor approximation

In this paper we introduce and describe a new scheme for the numerical integration of smooth functions. The scheme is based on the modified Taylor expansion and is suitable for functions that exhibit near-sinusoidal or repetitive behaviour. We discuss the method and its rate of convergence, then implement it for the approximation of certain integrals. Examples include integrands involving Airy wave, Bessel, Gamma, and elliptic functions. The results, from the data in the tables, demonstrate that the method converges rapidly and approximates the integral as well as some well-known numerical integration methods used with sufficiently small step sizes.     

A collocation approach to solve the Riccati-type differential equation systems

In this paper, a collocation method is presented for the solutions of the system of the Riccati-type differential equations with variable coefficients. The proposed approach consists of reducing the problem to a nonlinear algebraic equation system by expanding the approximate solutions in terms of the Bessel polynomials with unknown coefficients. The unknown coefficients of the Bessel polynomials are found by using the matrix operations of derivatives together with the collocation method. The proposed method gives the analytic solutions when the exact solutions are polynomials. Also, an error analysis technique based on the residual function is introduced for the suggested method. The reliability and efficiency of the proposed scheme are demonstrated by some numerical examples. Comparing the methodology with some known techniques shows that the presented approach is relatively easy and highly accurate. All of the numerical calculations have been done by using a program written in Maple.     

Robust projection method for Fredholm integral equation of the second kind

The projection method based on the Schauder basis expansion for solving the Fredholm integral equation of the second kind is investigated. (1) It is shown that any given finite linearly independent function set in L ^p [0, 1] can be extended as a Schauder basis. The truncation of the dual Schauder bases is then used to form the projection in approximating the kernel. (2) With the finite rank approximation, the use of the Sherman–Morrison–Woodbury formula achieves efficient implementation. The computation is successive when dimension of projection space increases. Numerical experiments demonstrate the robustness of the Schauder basis expansion.     

Updating method for the computation of orbits in parallel and sequential dynamical systems

In this article, we provide a matrix method in order to compute orbits of parallel and sequential dynamical systems on Boolean functions. In this sense, we develop algorithms for systems defined over directed (and undirected) graphs when the evolution operator is a general minterm or maxterm and, likewise, when it is constituted by independent local Boolean functions, so providing a new tool for the study of orbits of these dynamical systems.     

Effects of information technologies,department characteristics and individual roles on improving knowledge sharing visibility: a qualitative case study

Knowledge sharing visibility (KSV) is a critical environmental factor which can reduce social loafing in knowledge sharing (KS). This is especially true in ICT-based KS in learning organisations. As such, it is imperative that we better understand how to design technology enabled knowledge management systems (KMS) to support high KSV. This article examines the impact of knowledge management technology functions (e.g. tracking, knowledge storing) on KSV through qualitative analysis of 16 semi-structured interviews with participants in a Chinese company. Impact and implications of use for their existing KMS are examined. This article also examined the effects of department characteristics (i.e. group size and task characteristics) and individual roles (i.e. employee positions) on the IT–KSV relationship. Results encourage applied statistical, tracking, knowledge distribution and knowledge storing functions for monitoring explicit KS, and suggest integration of visualised knowledge maps with communication tools (e.g. Instant Messenger (IM)) to support visibility for implicit KS. Findings also suggest that KM technologies are more salient on improving KSV in large department with routine tasks, and that low-level employees may have more positive attitude on accepting communication tools on sharing knowledge. Extension to use of Web 2.0 technologies (e.g. weblogs) in KMS is also explored.     

沿虚轴无穷区问主值积分与逆傅里叶积分变换

在工程技术和科学研究的许多领域,傅里叶积分变换极为重要,但逆傅里叶积分变换手工计算比较困难,限制了傅里叶积分变换的应用范围。研究发现,逆傅里叶积分变换可以变换成沿复平面虚轴上的无穷区间主值积分,由此,导出一个逆傅里叶积分变换的计算公式,可用来快速完成逆傅里叶积分变换计算。