Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c ≥ 2, there are at most finitely many trunks of semiharmonic graphs with cyclomatic number c — in contrast to the fact established by the last two of the present authors in their paper Semiharmonic Bicyclic Graphs (this journal) that there are infinitely many connected semiharmonic gr...

in this note, a generalization of higher rank numerical range isintroduced and some of its properties are investigated

The effects of L-glutamate and its analogues were studied in voltage-clamped motoneurons of the lobster cardiac ganglion. These excitatory amino acids caused a dose-dependent increase in membrane conductance and an inward current at the resting membrane potential. The EC50 for L-glutamate was 150 mumol 1(-1). The rank order of potencies of the various agonists was quisqualate greater than L-glu...

Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

  In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of th...