In recent years, fast neural networks for object/face detection have been introduced based on cross correlation in the frequency domain between the input matrix and the hidden weights of neural networks. In our previous papers [3,4], fast neural networks for certain code detection was introduced. It was proved in [10] that for fast neural networks to give the same correct results as conventiona...

In a weighted voting game, each voter has given weight, and coalition of voters is successful if the sum their individual weights exceeds quota. Such systems translate idea that are not all equal by assigning them different weights. such situation, two symmetric in game interchanging leaves outcome unchanged. Two with same weight naturally every but converse statement necessarily true. We call ...

The ability to move in complex environments is one of the most important features of humans and animals. In this work, we exploit a bio-inspired method to generate different gaits in a bipedal locomotion system. We use the 4-cell CPG model developed by Pinto [21]. This model has been established on symmetric coupling between the cells which are responsible for generating oscillatory signals. Th...

We consider a problem coming from practical applications: finding a minimum spanning tree with both edge weights and inner node (non-leaf node) weights. This problem is NP-complete even in the metric space. We present two polynomial time algorithms which achieve approximation factors of 2.35 ln n and 2(Hn − 1), respectively, where n is the number of nodes in the graph and Hn is the n-th Harmoni...

In [15], the second author defined algebraic geometric codes over rings. This definition was motivated by two recent trends in coding theory: the study of algebraic geometric codes over finite fields, and the study of codes over rings. In that paper, many of the basic parameters of these new codes were computed. However, the Lee weight, which is very important for codes over the ring Z/4Z, was ...

In one-dimensional case, various important, weighted polynomial inequalities, such as Bernstein, Marcinkiewicz–Zygmund, Nikolskii, Schur, Remez, etc., have been proved under the doubling condition or the slightly stronger A∞ condition on the weights by Mastroianni and Totik in a recent paper [G. Mastroianni, V. Totik, Weighted polynomial inequalities with doubling and A∞ weights, Constr. Approx...

In a We use statistical mechanics to study generalization in large committee machines. For an architecture with nonoverlapping receptive fields a replica calculation yields the generalization error in the limit of a large number of hidden units. For continuous weights the generalization error falls off asymptotically inversely proportional to Q, the number of training examples per weight. For b...

We propose estimating the scale parameter (mean of eigenvalues) scatter matrix an unspecified elliptically symmetric distribution using weights obtained by solving Tyler's M-estimator matrix. The proposed weights-based estimate (TWE) is then used to construct affine equivariant as a weighted sample covariance normalized weights. develop unified framework for unknown tail elliptical (such degree...

In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points’ (often symmetric) relationships in input space, without considering directionality. However, relationships may be more informative in one direction (e.g. from labelled to unlabelled) than in the reverse direction, and some relationships (e.g. strong weights between op...