الصفحة 32
الصفحة 32
Grid and cooperative computing - GCC 2005 ; 4th International Conference, Beijing, China, November 30 -- December 3, 2005, Proceedings
This volume presents the accepted papers for the 4th International Conference on Grid and Cooperative Computing (GCC2005),held in Beijing, China, during November 30 – December 3, 2005.The conferenceseries of GCC aims to provide an international forum for the presentation and discussion of research trends on the theory, method, and design of Grid and cooperative computing as well as their scienti?c, engineering and commercial applications. It has become a major annual event in this area. The First International Conference on Grid and Cooperative Computing (GCC2002) received 168 submissions. GCC 2003 received 550 submissions, from which 176 regular papers and 173 short papers were accepted. The acceptance rate of regular papers was 32%, and the total acceptance rate was 64%. GCC 2004 received 427 main-conference submissions and 154 workshop submissions. The main conference accepted 96 regular papers and 62 short papers. The - ceptance rate of the regular papers was 23%. The total acceptance rate of the main conference was 37%. For this conference, we received 576 submissions. Each was reviewed by two independent members of the International Program Committee. After carefully evaluating their originality and quality, we accepted 57 regular papers and 84 short papers. The acceptance rate of regular papers was 10%. The total acc- tance rate was 25%.
Grey information : Theory and practical applications
he book covers the latest advances in grey information and systems research, providing a state-of-the-art overview of this important field. Covering the theoretical foundation, fundamental methods and main topics in grey information and systems research, this book includes all the elementary concepts: basic principles, grey numbers and their operations, grey equations and matrices, operators of sequences and generations of grey sequences, grey incidence analysis, grey clusters and grey statistical evaluations, grey systems modeling, grey combined models, grey prediction, grey decisions, grey programming, grey input and output and grey controls, etc.
Green Function Theory of Chemisorption
The book provides an introduction to the Green-Function (GF) theory of chemisorption. It is self-contained, and requires only a basic knowledge of quantum mechanics and solid-state physics. The GF approach lends itself well to the pedagogically desirable modellistic treatment of the subject. Throughout each chapter, step-by-step details are provided by which the calculations are performed, so that readers are led from the simple to the more advanced aspects, in a straightforward manner. In this way, students gain confidence to read the current literature on their own.
Gravity, Black Holes, and the Very Early Universe : An Introduction to General Relativity and Cosmology
In the early 1900s, Albert Einstein formulated two theories that would forever change the landscape of physics: the Special Theory of Relativity and the General Theory of Relativity. By 1925, quantum mechanics had been born out of the dissection of these two theories, and shortly after that, relativistic quantum field theory. We now had in place some important ties between the laws of physics and the types of particle interactions the new physics was uncovering. Gravity is one of the four types of forces that are found throughout the universe. In fact, although it is a relatively weak force, it operates at huge distances, and so must be accounted for in any cosmological system. Unfortunately, gravity continues to defy our neat categorization of how all the forces in nature work together.
Graph-theoretic concepts in computer science ; Vol. 4271 ; 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers
The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer s- ence, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks showed how recent researchresults from algorithmic graph theory can be used in computer science and which graph-theoreticquestions arisefrom new developments in computer science.
Graph-theoretic concepts in computer science ; Vol. 3787 ; 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers
that aims to unite theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science. This book provides results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields.
Graph-theoretic concepts in computer science ; 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers
This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
Graph-theoretic concepts in computer science ; 34th International Workshop, WG 2008, Durham, UK, June 30 – July 2, 2008. Revised Papers
This book constitutes the thoroughly refereed post-conference proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, held in Durham, UK, in June/July 2008.The 30 revised full papers presented together with 3 invited paper were carefully reviewed and selected from 76 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems.
Graph-theoretic concepts in computer science ; 33rd International workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers
The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research.
Graph-theoretic concepts in computer science ; 30th International workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity.
Graphs, networks and algorithms ; 3rd ed.
The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.
Graphs, networks and algorithms ; 2nd ed.
This book have a chapter on the network simplex algorithm and a section on the five color theorem; this also necessitated some changes in the previous order of the presentation (so that the numbering differs from that of the first edition,beginning with Chapter 8). In addition to this, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced. There are also several new exercises.
Graphs, Dioids and Semirings : New Models and Algorithms
The primary objectives of GRAPHS, DIOÏDS AND SEMIRINGS: New Models and Algorithms are to emphasize the deep relations existing between the semiring and dioïd structures with graphs and their combinatorial properties, while demonstrating the modeling and problem-solving capability and flexibility of these structures. In addition the book provides an extensive overview of the mathematical properties employed by "nonclassical" algebraic structures, which either extend usual algebra (i.e., semirings), or correspond to a new branch of algebra (i.e., dioïds), apart from the classical structures of groups, rings, and fields.
Graphic design : Learn it, do it
An introduction to the fundamentals of graphic design and the Adobe Creative Cloud applications used to put these concepts into practice. This book is intended for production-oriented audiences, those interested in the what, why and how of graphic design. The "what" is effective graphic design, a visual solution created using the design principles that stands out in a crowded marketplace. This discussion includes color theory, typography and page layout. Focus on the "why" of design begins with the reasons why we communicate.
Graph-based representations in pattern recognition ; 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings
Constitutes the refereed proceedings of the 6th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2007, held in Alicante, Spain in June 2007.
Graph-based representations in pattern recognition ; 5th IAPR International Workshop, GbRPR 2005, Poitiers, France, April 11-13, 2005, Proceedings
Many vision problems have to deal with di?erent entities (regions, lines, line junctions, etc.) and their relationships. These entities together with their re- tionships may be encoded using graphs or hypergraphs. The structural inf- mation encoded by graphs allows computer vision algorithms to address both the features of the di?erent entities and the structural or topological relati- ships between them. Moreover, turning a computer vision problem into a graph problem allows one to access the full arsenal of graph algorithms developed in computer science. The Technical Committee (TC15, http://www.iapr.org/tcs.html) of the IAPR (International Association for Pattern Recognition) has been funded in order to federate and to encourage research work in these ?elds. Among its - tivities, TC15 encourages the organization of special graph sessions at many computer vision conferences and organizes the biennial workshop GbR.
Graph-based Knowledge Representation : Computational Foundations of Conceptual Graphs
This book studies a graph-based knowledge representation and reasoning formalism stemming from conceptual graphs, with a substantial focus on the computational properties.Knowledge can be symbolically represented in many ways, and the authors have chosen labeled graphs for their modeling and computational qualities. the authors have attempted to answer, the following question:`how far is it possible to go in knowledge representation and reasoning by representing knowledge with graphs and reasoning with graph operations?''
Graph Transformations ; 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings
This book constitutes the refereed proceedings of the 4th International Conference on Graph Transformations, ICGT 2008, held in Leicester, UK, in September 2008.The 27 revised full papers presented together with 5 tutorial and workshop papers and 3 invited lectures were carefully selected from 57 submissions. All current aspects in graph drawing are addressed including hypergraphs and termgraph rewriting, applications of graph transformation, execution of graph transformations, compositional systems, validation and verification, graph languages and special transformation concepts, as well as patterns and model transformations.
Graph Transformations ; 3rd International Conference, ICGT 2006, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings
ICGT 2006 was the 3rd International Conference on Graph Transformation, following the previous two in Barcelona (2002) and Rome (2004), and a series of six international workshops between 1978 and 1998. The scope of the conference concerned graphical structures of various kinds (like graphs, diagrams and visual sentences) that are useful when describing complex structures and systems in a direct and intuitive way. These structures are often enriched with formalisms that model their evolution via suitable kinds of transformations. The ?eld of the conference was concerned with the theory, applications, and implementation issues of such formalisms. Particularemphasis wasputonmetamodelswhichcanaccommodateavarietyofgraphicalstructures within the same abstract theory.
Graph Transformation ; 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020, Proceedings
This book constitutes the refereed proceedings of the 13th International Conference on Graph Transformation, ICGT 2020, in Bergen, Norway, in June 2020.* The 16 research papers and 4 tool paper presented in this book were carefully reviewed and selected from 40 submissions. One invited paper is also included. The papers deal with the following topics: theoretical advances; application domains; and tool presentations.
