The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 401 –
420 of
1854
The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
The aim of this work is to perform the computation of the blood flow in all the cerebral network, obtained from medical images as angiographies. We use free finite elements codes as FreeFEM++. We first test the code on analytical solutions in simplified geometries. Then, we study the influence of boundary conditions on the flow and we finally perform first computations on realistic meshes.
The problem of assessing the reliability of clusters patients identified by clustering algorithms is crucial to estimate
the significance of subclasses of diseases detectable at bio-molecular level, and more in general to support bio-medical discovery
of patterns in gene expression data.
In this paper we present an experimental analysis of the reliability of clusters discovered in lung tumor patients
using DNA microarray data.
In particular we investigate if subclasses of lung adenocarcinoma...
We consider a quasilinear parabolic system which has the structure of Patlak-Keller-Segel model of chemotaxis and contains a class of models with degenerate diffusion. A cell population is described in terms of volume fraction or density. In the latter case, it is assumed that there is a threshold value which the density of cells cannot exceed. Existence and uniqueness of solutions to the corresponding initial-boundary value problem and existence of space inhomogeneous stationary solutions are discussed....
On étudie la classification des solutions du problème elliptiqueoù et une fonction changeant de signe. En utilisant une méthode de tire, On montre qu’en partant avec une dérivée initiale nulle toutes les solutions sont globales. De plus si et l’ensemble des solutions est constitué d’une seule solution à support compact et de deux familles de solutions ; celles qui sont strictement positives et celles qui changent de signes. On montre aussi que ces deux familles tendent vers l’infini quand...
The features of an evolutionary algorithm that most determine its performance are the coding by which its chromosomes represent candidate solutions to its target problem and the operators that act on that coding. Also, when a problem involves constraints, a coding that represents only valid solutions and operators that preserve that validity represent a smaller search space and result in a more effective search. Two genetic algorithms for the leaf-constrained minimum spanning tree problem illustrate...
A class of degree four differential systems that have an invariant conic , , is examined. We show the coexistence of small amplitude limit cycles, large amplitude limit cycles, and invariant algebraic curves under perturbations of the coefficients of the systems.
Currently displaying 401 –
420 of
1854