atlantis press apr 2015 (5 risultati)

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The book 'Single variable Differential and Integral Calculus' is an interesting text book for students of mathematics and physics programs, and a reference book for graduate students in any engineering field. This book is unique in the field of mathematical analysis in content and in style. It aims to define, compare and discuss topics in single variable differential and integral calculus, as well as giving application examples in important business fields. Some elementary concepts such as the power of a set, cardinality, measure theory, measurable functions are introduced. It also covers real and complex numbers, vector spaces, topological properties of sets, series and sequences of functions (including complex-valued functions and functions of a complex variable), polynomials and interpolation and extrema of functions. Although analysis is based on the single variable models and applications, theorems and examples are all set to be converted to multi variable extensions. For example, Newton, Riemann, Stieltjes and Lebesque integrals are studied together and compared. 392 pp. Englisch.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions, that can be solved by using a non trivial brute-force approach. Given a metabolic network, each individual story should explain how some interesting metabolites are derived from some others through a chain of reactions, by keeping all alternative pathways between sources and targets. Enumerating cycles or paths in an undirected graph, such as a protein-protein interaction undirected network, is an example of an enumeration problem in which all the solutions can be listed through an optimal algorithm, i.e. the time required to list all the solutions is dominated by the time to read the graph plus the time required to print all of them. By extending this result to directed graphs, it would be possible to deal more efficiently with feedback loops and signed paths analysis in signed or interaction directed graphs, such as gene regulatory networks. Finally, enumerating mouths or bubbles with a source s in a directed graph, that is enumerating all the two vertex-disjoint directed paths between the source s and all the possible targets, is an example of an enumeration problem in which all the solutions can be listed through a linear delay algorithm, meaning that the delay between any two consecutive solutions is linear, by turning the problem into a constrained cycle enumeration problem. Such patterns, in a de Bruijn graph representation of the reads obtained by sequencing, are related to polymorphisms in DNA- or RNA-seq data. 172 pp. Englisch.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This monograph offers the reader a treatment of the theory of evolution PDEs with nonstandard growth conditions. This class includes parabolic and hyperbolic equations with variable or anisotropic nonlinear structure. We develop methods for the study of such equations and present a detailed account of recent results. An overview of other approaches to the study of PDEs of this kind is provided. The presentation is focused on the issues of existence and uniqueness of solutions in appropriate function spaces and on the study of the specific qualitative properties of solutions, such as localization in space and time, extinction in a finite time and blow-up, or nonexistence of global in time solutions. Special attention is paid to the study of the properties intrinsic to solutions of equations with nonstandard growth. 428 pp. Englisch.

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions, that can be solved by using a non trivial brute-force approach. Given a metabolic network, each individual story should explain how some interesting metabolites are derived from some others through a chain of reactions, by keeping all alternative pathways between sources and targets. Enumerating cycles or paths in an undirected graph, such as a protein-protein interaction undirected network, is an example of an enumeration problem in which all the solutions can be listed through an optimal algorithm, i.e. the time required to list all the solutions is dominated by the time to read the graph plus the time required to print all of them. By extending this result to directed graphs, it would be possible to deal more efficiently with feedback loops and signed paths analysis in signed or interaction directed graphs, such as gene regulatory networks. Finally, enumerating mouths or bubbles with a source s in a directed graph, that is enumerating all the two vertex-disjoint directed paths between the source s and all the possible targets, is an example of an enumeration problem in which all the solutions can be listed through a linear delay algorithm, meaning that the delay between any two consecutive solutions is linear, by turning the problem into a constrained cycle enumeration problem. Such patterns, in a de Bruijn graph representation of the reads obtained by sequencing, are related to polymorphisms in DNA- or RNA-seq data.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 172 pp. Englisch.

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This monograph offers the reader a treatment of the theory of evolution PDEs with nonstandard growth conditions. This class includes parabolic and hyperbolic equations with variable or anisotropic nonlinear structure. We develop methods for the study of such equations and present a detailed account of recent results. An overview of other approaches to the study of PDEs of this kind is provided. The presentation is focused on the issues of existence and uniqueness of solutions in appropriate function spaces and on the study of the specific qualitative properties of solutions, such as localization in space and time, extinction in a finite time and blow-up, or nonexistence of global in time solutions. Special attention is paid to the study of the properties intrinsic to solutions of equations with nonstandard growth.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 428 pp. Englisch.