Passivity-based control for Hopfield neural networks using convex representation

This paper considers the problem of passivity-based controller design for Hopfield neural networks. By making use of a convex representation of nonlinearities, a feedback control scheme based on passivity and Lyapunov theory is presented. A criterion for existence of the controller is given in terms of linear matrix inequality (LMI), which can be easily solved by a convex optimization problem. An example and its numerical simulation are given to show the effectiveness of the proposed method.     

Identities for the Widder transform and transforms with Bessel function kernels

In the present paper, we consider the classical Widder transform, the H_ν-transform, the K_ν-transform, and the Y_ν-transform. Some identities involving these transforms and many others are given. By making use of these identities, a number of new Parseval-Goldstein type identities are obtained for these and other well-known integral transforms.     

Observer synthesis method for Lipschitz nonlinear discrete-time systems with time-delay: An LMI approach

In this paper, we address the problem of observer design for a class of Lipschitz nonlinear discrete-time systems with time-delay. The main contribution lies in the use of a new structure of the proposed observer with a novel Lyapunov-Krasovskii functional. Thanks to these designs, new nonrestrictive synthesis conditions, expressed in terms of linear matrix inequalities (LMIs), are obtained. Indeed, the obtained LMIs contain more degree of freedom than those established by the approaches available in the literature which consider a simple Luenberger observer with a simple Lyapunov function for the stability analysis. An extension of the presented result to H_∞ performance analysis is given in order to take into account the noise (if it exists) affecting the considered system.     

Condensed Cramer rule for some restricted quaternion linear equations

In this paper, we derive an alternative more condensed Cramer rule for the unique solution of some restricted left and right systems of quaternion linear equations. The findings of this paper extend some known results in the literature.     

Triangular line graphs and word sense disambiguation

Linguists often represent the relationships between words in a collection of text as an undirected graph G=(V,E), where V is the vocabulary and vertices are adjacent in G if and only if the words that they represent co-occur in a relevant pattern in the text. Ideally, the words with similar meanings give rise to the vertices of a component of the graph. However, many words have several distinct meanings, preventing components from characterizing distinct semantic fields. This paper examines how the structural properties of triangular line graphs motivate the use of a clustering coefficient on the triangular line graph, thereby helping to identify polysemous words. The triangular line graph of G, denoted by T(G), is the subgraph of the line graph of G where two vertices are adjacent if the corresponding edges in G belong to a K₃.     

Positive Quaternion Kähler Manifolds with fourth Betti number equal to one

Positive Quaternion Kähler Manifolds are Riemannian manifolds with holonomy contained in Sp(n)Sp(1) and with positive scalar curvature. Conjecturally, they are symmetric spaces. In this article we are mainly concerned with Positive Quaternion Kähler Manifolds M satisfying b₄(M)=1. Generalising a result of Galicki and Salamon we prove that M4n in this case is homothetic to a quaternionic projective space if 2≠n?6.     

Sensitivity of risk measures with respect to the normal approximation of total claim distributions

A simple and commonly used method to approximate the total claim distribution of a (possibly weakly dependent) insurance collective is the normal approximation. In this article, we investigate the error made when the normal approximation is plugged in a fairly general distribution-invariant risk measure. We focus on the rate of convergence of the error relative to the number of clients, we specify the relative error’s asymptotic distribution, and we illustrate our results by means of a numerical example. Regarding the risk measure, we take into account distortion risk measures as well as distribution-invariant coherent risk measures.     

A general criterion to determine the number of change-points

A general criterion is proposed to determine the number K of the change-points in a parametric nonlinear multi-response model. Schwarz criterion is a particular case. The change-points depend on regressor values and not on instant of measure. We prove that the proposed estimator for K is consistent. Simulation results, using Monte Carlo technique, for nonlinear models which have numerous applications, support the relevance of the theory.     

Least squares estimators of the regression function with twice censored data

We propose least squares estimators of E(Y/X=x) for Y censored on the right by R and min(Y,R) left censored. We establish their convergence in the L₂-norm. This work extends a known result in the context of right censoring.     

Some generalizations of locally and weakly locally uniformly convex space

In this paper, we prove that strongly convex space and almost locally uniformly rotund space, very convex space and weakly almost locally uniformly rotund space are respectively equivalent. We also investigate a few properties of k-strongly convex space and k-very convex space, and discuss the applications of strongly convex space and very convex space in approximation theory.