M. Pellegrini1,4, A. Mansouri1, A. Simeone2, E. Boncinelli3,5 and P. Gruss1 1Max-Planck-Institute of Biophysical Chemistry, Am Fassberg, D-37077 GÃ¶ttingen 2International Institute of Genetics andâ€¦ (More)

A coloring of a graph G = (V ,E) is a partition {V1, V2, . . . , Vk} of V into independent sets or color classes. A vertex v âˆˆ Vi is a Grundy vertex if it is adjacent to at least one vertex in eachâ€¦ (More)

Our work becomes integrated into the general problem of the stability of the network ad hoc. Some, works attacked(affected) this problem. Among these works, we find the modelling of the network adâ€¦ (More)

A coloring of a graph is an assignment of colors to its nodes so that no two adjacent nodes are assigned the same color. Given a graph G, by a Grundy k-coloring of G mean any proper k-vertex coloringâ€¦ (More)

International Conference on MEMS,NANO and Smartâ€¦

2005

Electrokinetic (EK) flow is a flow of an electrolyte in narrow capillaries driven by the combined influence of electric field and pressure, is of significant interest in microfluidic devices.â€¦ (More)

The objective of this work is to find the optimal geometric parameters for the design of permanent magnet synchronous machines (PMSM) with inversed structure (outer rotor) for electric vehiclesâ€¦ (More)

Introduction: Chronic renal failure (CRF) is the progressive and irreversible destruction of renal function in which the bodyâ€™s ability to maintain metabolism and water and electrolyte balance isâ€¦ (More)