Gjør som tusenvis av andre bokelskere
Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.
Ved å abonnere godtar du vår personvernerklæring.Du kan når som helst melde deg av våre nyhetsbrev.
There is no a reference model, which could be used to develop and unify E-Commerce, E-Business, and E-Government services as the software artifacts. This book suggests a reference model that called Global Village Services Reference Model (GVSRM) to realize the Global Village Grid as an E-Services Framework.Thus, GVSRM could be referenced as the baseline of any kind of software engineering efforts pertaining to the E-Services, Globalization, and the Grid Computing concepts. Furthermore, some Grid-based entities, actors, actions, and their associations, which defined and elaborated in detail in GVSRM, would realize E-Government, E-Business, and E-Commerce systems. This book presents the AS-IS Models of Grid Computing, E-Commerce, E-Business, and E-Government software-intensive systems before presenting a TO-BE reference model (Global Village Services Reference Model) as a holistic and comprehensive, UML-based, XML-based, Grid-centric, X2Y-centric, Service-centric, and collaborative-centric consolidated reference model to realize pragmatically the Globalization as an E-Services framework in the cyberspace.
Graphs are known structures with many applications in various fields including computer science and information visualization. Drawing graphs makes understanding the meaning of graphs easy by geometrically representation of them. Many graph drawing algorithms have been presented in the literature. Most of them draw graphs on an unbounded surface. However, there are applications in which it is required to draw graphs on a prescribed size area. For example, consider a VLSI circuit which should be designed on a U-shaped PCB with prescribed size, or consider a software in which one would like to show a graph on a prescribed size area. In this book, we examine the complexity of this problem, and introduce new algorithms for drawing planar graphs on 2D surfaces which are bounded by simple polygons. The content of this book is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph drawing, information visualization and computational geometry. The book will also serve as a useful reference for researchers and software developers in the field of graph drawing, information visualization, VLSI design and CAD.
Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.
Ved å abonnere godtar du vår personvernerklæring.