Results 41 to 50 of about 38,430 (291)

Using String Kernels to Identify Famous Performers from their Playing Style [PDF]

open access: yes, 2004
In this paper we show a novel application of string kernels: that is to the problem of recognising famous pianists from their style of playing. The characteristics of performers playing the same piece are obtained from changes in beat-level tempo and ...
David R. Hardoon   +7 more
core   +1 more source

Three solutions for discrete anisotropic Kirchhoff-type problems

open access: yesDemonstratio Mathematica, 2023
In this article, using critical point theory and variational methods, we investigate the existence of at least three solutions for a class of double eigenvalue discrete anisotropic Kirchhoff-type problems.
Bohner Martin   +3 more
doaj   +1 more source

How to derive priorities in AHP: a comparative study [PDF]

open access: yes, 2006
Multi-criteria decision making, Simulation, AHP, Eigenvalue, Geometric mean,
Markus Lusti   +3 more
core   +2 more sources

Characterizations of the Family of All Generalized Line Graphs—Finite and Infinite—and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj   +1 more source

Payload Parameter Identification of a Flexible Space Manipulator System via Complex Eigenvalue Estimation

open access: yesInternational Journal of Aerospace Engineering, 2020
Manipulator systems are widely used in payload capture and movement in the ground/space operation due to their dexterous manipulation capability. In this study, a method for identifying the payload parameters of a flexible space manipulator using the ...
Zhiyu Ni   +3 more
doaj   +1 more source

On graphs whose least eigenvalue is greater than –2 [PDF]

open access: yes, 2016
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and other authors from the early beginning of the spectral graph theory.
BELARDO, Francesco   +2 more
core   +1 more source

The least eigenvalue of signless Laplacian of graphs under perturbation [PDF]

open access: yes, 2012
We investigate how the least eigenvalue of the signless Laplacian of a graph changes by relocating a bipartite branch from one vertex to another vertex, and minimize the least eigenvalue of the signless Laplacian among the class of connected graphs with ...
Wang, Yi   +3 more
core   +1 more source

The second least eigenvalue of the signless Laplacian of the complements of trees

open access: yesElectronic Journal of Graph Theory and Applications, 2019
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In 2012, Li and Wang gave the unique graph in the set Tnc ∖ {K1, n − 1c} with minimum 1st ‘least eigenvalue of the signless Laplacian’ (abbreviated to a ...
Muhammad Ajmal   +2 more
doaj   +1 more source

Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading

open access: yesAdvanced Engineering Materials, EarlyView.
The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley   +1 more source

Spikes for the two-dimensional Gierer-Meinhardt system: The weak coupling case [PDF]

open access: yes, 2001
In this paper, we rigorously prove the existence and stability of multiple-peaked patterns for the singularly perturbed Gierer-Meinhardt system in a two dimensional domain which are far from spatial homogeneity.
Winter, M, Wei, J
core   +1 more source

Home - About - Disclaimer - Privacy