Researches and developers of simulation models state that the Java program ming language presents a unique and significant opportunity for important changes in the way we develop simulation models today. The most important characteristics of the Java language that are advantageous for simulation are its multi-threading capabilities, its facilities for executing programs across the Web, and its graphics facilities. It is feasible to develop compatible and reusable simulation components that will facilitate the construction of newer and more complex models. This is possible with Java development environments. Another important trend that begun very recently is web-based simulation, i.e., and the execution of simulation models using Internet browser software. This book introduces the application of the Java programming language in discrete-event simulation. In addition, the fundamental concepts and prac tical simulation techniques for modeling different types of systems to study their general behavior and their performance are introduced. The approaches applied are the process interaction approach to discrete-event simulation and object-oriented modeling. Java is used as the implementation language and UML as the modeling language. The first offers several advantages compared to C++, the most important being: thread handling, graphical user interfaces (QUI) and Web computing. The second language, UML (Unified Modeling Language) is the standard notation used today for modeling systems as a collection of classes, class relationships, objects, and object behavior."

Actor-Network Theory (ANT) has existed as a topic of interest among social theorists for decades. Due to the prevalence of technology in modern society, discussions over the influence of actor-network theory on the changing scope of technology can assist in facilitating further research and scientific thought. Technological Advancements and the Impact of Actor-Network Theory focuses on cross-disciplinary research as well as examples of the use of actor-network theory in a variety of fields, including medicine, education, business, engineering, environmental science, computer science, and social science. This timely publication is well-suited for reference use by academicians, researchers, upper-level students, and theorists. Topics Covered The many academic areas covered in this publication include, but are not limited to: Digital Communication E-Health Human Interaction Information and Communication Technologies Online Education Online Investing Public Service Innovation Software Development

As the telecommunication industry introduces new sophisticated technologies, the nature of services and the volume of demands have changed. Indeed, a broad range of new services for users appear, combining voice, data, graphics, video, etc. This implies new planning issues. Fiber transmission systems that can carry large amounts of data on a few strands of wire were introduced. These systems have such a large bandwidth that the failure of even a single transmission link: in the network can create a severe service loss to customers. Therefore, a very high level of service reliability is becoming imperative for both system users and service providers. Since equipment failures and accidents cannot be avoided entirely, networks have to be designed so as to "survive" failures. This is done by judiciously installing spare capacity over the network so that all traffic interrupted by a failure may be diverted around that failure by way of this spare or reserve capacity. This of course translates into huge investments for network operators. Designing such survivable networks while minimizing spare capacity costs is, not surprisingly, a major concern of operating companies which gives rise to very difficult combinatorial problems. In order to make telecommunication networks survivable, one can essentially use two different strategies: protection or restoration. The protection approach preas signs spare capacity to protect each element of the network independently, while the restoration approach spreads the redundant capacity over the whole network and uses it as required in order to restore the disrupted traffic."

Once the basic idea of hypertext had spread rapidly throughout the world via the Internet, the reception of hypertexts soon became subject of empirical research among psychologists, cognitive scientists, and educational researchers. As easy to use software for the writing of hypertexts (HTML editors) is now broadly available, there are no longer any technical obstacles for the use of hypertext production in teaching and learning. This book presents and analyses the learning effects that can be anticipated from the production of hypertexts. It includes laboratory experiments, studies on the production of hypertexts in the context of educational institutions, and reports on software environments designed for the production of hypertext. It includes theoretical, empirically and developmentally oriented contributions. The first three chapters link up directly with research on traditional writing while addressing aspects of the interaction between content and rhetoric during hypertext writing. The next three chapters focus on cooperative learning of students in and through the production of hypertexts. The following two chapters look at new technological possibilities, namely, a software environment for transforming textbooks into personalized hypertexts and the design of hypervideos. The final chapter discusses potential methods for further research.

New Approaches to Circle Packing into the Square is devoted to the most recent results on the densest packing of equal circles in a square. In the last few decades, many articles have considered this question, which has been an object of interest since it is a hard challenge both in discrete geometry and in mathematical programming. The authors have studied this geometrical optimization problem for a long time, and they developed several new algorithms to solve it. The book completely covers the investigations on this topic.

Templates are used to generate all kinds of text, including computer code. The last decade, the use of templates gained a lot of popularity due to the increase of dynamic web applications. Templates are a tool for programmers, and implementations of template engines are most times based on practical experience rather than based on a theoretical background.

This book reveals the mathematical background of templates and shows interesting findings for improving the practical use of templates.

First, a framework to determine the necessary computational power for the template metalanguage is presented. The template metalanguage does not need to be Turing-complete to be useful. A non-Turing-complete metalanguage enforces separation of concerns between the view and model.

Second, syntactical correctness of all languages of the templates and generated code is ensured. This includes the syntactical correctness of the template metalanguage and the output language. Third, case studies show that the achieved goals are applicable in practice. It is even shown that syntactical correctness helps to prevent cross-site scripting attacks in web applications.

The target audience of this book is twofold. The first group exists of researcher interested in the mathematical background of templates. The second group exists of users of templates. This includes designers of template engines on one side and programmers and web designers using templates on the other side"

Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let: e = {: e 1, ...: en} be the vector in n-dimensional real linear space Rn; n PO(: e), PI (: e), ..., Pm (: e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(: e) subject to constraints (0.2) Pi (: e) =0, i=l, ..., m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) 0 is equivalent to P(: e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ..., a } be integer vector with nonnegative entries {a;}f=l. n Denote by R a](: e) monomial in n variables of the form: n R a](: e) = IT: ef';;=1 d(a) = 2:7=1 ai is the total degree of monomial R a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(: e) = L caR a](: e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P

The book presents a unified treatment of integer programming and network models with topics ranging from exact and heuristic algorithms to network flows, traveling salesman tours, and traffic assignment problems. While the emphasis of the book is on models and applications, the most important methods and algorithms are described in detail and illustrated by numerical examples. The formulations and the discussion of a large variety of models provides insight into their structures that allows the user to better evaluate the solutions to the problems.

Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) solution of the formulated problem. One can solve a problem on its own using ad hoc techniques or follow those techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions and the context appropriate for each of them. This book advocates the study of algorithm design techniques by presenting most of the useful algorithm design techniques and illustrating them through numerous examples.

System Design: A Practical Guide with SpecC presents the system design flow following a simple example through the whole process in an easy-to-follow, step-by-step fashion. Each step is described in detail in pictorial form and with code examples in SpecC. For each picture slide a detailed explanation is provided of the concepts presented. This format is suited for tutorials, seminars, self-study, as a guided reference carried by examples, or as teaching material for courses on system design. Features: Comprehensive introduction to and description of the SpecC language and design methodology; IP-centric language and methodology with focus on design reuse; Complete framework for system-level design from specification to implementation for SOCs and other embedded HW/SW systems. System Design: A Practical Guide with SpecC will benefit designers and design managers of complex SOCs, or embedded systems in general, by allowing them to develop new methodologies from these results, in order to increase design productivity by orders of magnitude. Designers at RTL, logical or physical levels, who are interested in moving up to the system level, will find a comprehensive overview within. The design models in the book define IP models and functions for IP exchange between IP providers and their users. A well-defined methodology like the one presented in this book will help product planning divisions to quickly develop new products or to derive completely new business models, like e-design or product-on-demand. Finally, researchers and students in the area of system design will find an example of a formal, well-structured design flow in this book.

Another powerful contraction began and the pain jarred her back to the reality of the task at hand. In just a few minutes, the head appeared and the event moments ago were repeated. Again, the Doktor held the baby by its feet and gave this one a good whack. Nothing happened. He tried again. There was still no cry from the baby. He laid the baby down and put his stethoscope to his tiny chest. A frown crossed his face. Nurse Kelm had seen that look before and understood. The Doktor tied and cut the cord just as he had done with the first baby and handed him to Ilse. She quickly wrapped the baby in a receiving blanket, picked it up and rushed out of the room. Freya watched this scene as if seeing it in slow motion. Where is she taking my baby? she screamed. The Doktor took her hand and said softly, I'm sorry Frau Muller, but he is dead. A heart-rending scream shattered the quiet of the room. Freya began to sob uncontrollably. The Doktor whispered to the second nurse and she handed him a syringe with a mild sedative. Freya didn't feel the needle enter her arm. She couldn't feel anything at that moment except a pain in her heart that made her oblivious to any physical pain.

This new text/reference presents an accessible, concise, but rather complete, introduction to the C++ programming language with special emphasis on object-oriented numeric computation for scientific and engineering program development. The description of the language is in compliance with ISO/ANSI standards and is platform independent for maximum versatility. Requiring only basic calculus and linear algebra as prerequisites, the book introduces concepts, techniques, and standard libraries of C++ in a manner that is easy to understand and uses such familiar examples as vectors, matrices, integrals, and complex numbers. It also contains an introduction to C++ programs for applications with many numberic methods that are fundamental to science and engineering computing: polynomial evaluation and interpolation; numeric integration; methods for solving nonlinear equations; systems of linear equations in full, band, and sparse matrix storage formats; and ordinary and partial differential equations. Numerous techniques and examples are provided on how to reduce (C and Fortran) run-time overhead and improve program efficiency. Topics and features: *concise coverage of C++ programming concepts with object-oriented emphasis*numerous examples, coding tools, sample programs and exercises for reinforcement and self-study purposes*develops and uses basic and advanced features, as well as standard libraries of C++*covers many fundamental numeric methods for scientific and engineering computing applications*downloadable user-defined numeric linear algebra library available from author web site With an accessible style, intuitive topic development, and numerous examples, the book is an excellent resource and guide to the power, versatility and efficiency of C++ programming for numeric computing applications. Advanced students, practitioners and professionals in computer science, engineering and scientific computing in general will find the book a practical guide and resource for their work and applications program development.

A presentation of the central and basic concepts, techniques, and tools of computer science, with the emphasis on presenting a problem-solving approach and on providing a survey of all of the most important topics covered in degree programmes. Scheme is used throughout as the programming language and the author stresses a functional programming approach to create simple functions so as to obtain the desired programming goal. Such simple functions are easily tested individually, which greatly helps in producing programs that work correctly first time. Throughout, the author aids to writing programs, and makes liberal use of boxes with "Mistakes to Avoid." Programming examples include: * abstracting a problem; * creating pseudo code as an intermediate solution; * top-down and bottom-up design; * building procedural and data abstractions; * writing progams in modules which are easily testable. Numerous exercises help readers test their understanding of the material and develop ideas in greater depth, making this an ideal first course for all students coming to computer science for the first time.

This book brings together research on numerical methods adapted for Graphics Processing Units (GPUs). It explains recent efforts to adapt classic numerical methods, including solution of linear equations and FFT, for massively parallel GPU architectures. This volume consolidates recent research and adaptations, covering widely used methods that are at the core of many scientific and engineering computations. Each chapter is written by authors working on a specific group of methods; these leading experts provide mathematical background, parallel algorithms and implementation details leading to reusable, adaptable and scalable code fragments. This book also serves as a GPU implementation manual for many numerical algorithms, sharing tips on GPUs that can increase application efficiency. The valuable insights into parallelization strategies for GPUs are supplemented by ready-to-use code fragments. Numerical Computations with GPUs targets professionals and researchers working in high performance computing and GPU programming. Advanced-level students focused on computer science and mathematics will also find this book useful as secondary text book or reference.

This book delivers the latest developments in object technology and their impact in computing systems re-engineering. Object-oriented programming is here shown to provide support for constructing large scale systems that are cheaply built and with reusable components, adaptable to changing requirements and use efficient and cost-effective techniques.
Internationally recognised authorities from Finland, France, Germany, Italy, Poland, Spain, the UK and the USA here record their research and development work on the industrial techniques and structured object-oriented methodologies in forward and reverse engineering of computing systems. This book takes stock of progress of that work showing its promise and feasibility, and how its structured technology can overcome the limitations of forward engineering methods used in industry. Forward methods are focused in the domain of reverse engineering to implement a high level of specification for existing software.
The book contains the selected, quintessential content of the first UK Colloquium on Object Technology and Systems Re-Engineering held at Oxford University in 1998. The conference was sponsored by British Telecom Laboratories, EMSI limited and the OOSP Specialised Group of The British Computer Society.
Delivers the latest developments in object technology and their impact in computing systems re-engineeringProvides support for constructing large scale systems that are cheaply built and with reusable components, adaptable to changing requirements and use efficient and cost-effective techniquesContains the content of the first UK Colloquium on Object Technology and Systems Re-Engineering held at Oxford University in 1998

This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs in the plane; examines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curves; describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems; includes lists of symbols and abbreviations, in addition to other appendices.

2 Concept ( Tools * Specification ( Tools + Design Stages ( Tools * Implementation ( Tools Figure 1-1. A nominal, multi-stage development process From that beginning, we have progressed to the point where the EDA community at large, including both users and developers of the tools, are interested in more unified environments. Here, the notion is that the tools used at the various stages in the development process need to be able to complement each other, and to communicate with one another efficiently using effective file exchange capabilities. Furthermore, the idea of capturing all the tool support needed for an EDA development into a unified support environment is now becoming a reality. This reality is evidenced by some of the EDA suites we now see emerging, wherein several tool functions are integrated under a common graphical user interface (GUI), with supporting file exchange and libraries to enable all tool functions to operate effectively and synergistically. This concept, which we illustrate in Figure 1- 2, is the true future ofEDA.

The latest edition of a classic text on concurrency and distributed programming - from a winner of the ACM/SIGCSE Award for Outstanding Contribution to Computer Science Education.

grams of which the objective is given by the ratio of a convex by a positive (over a convex domain) concave function. As observed by Sniedovich (Ref. [102, 103]) most of the properties of fractional pro grams could be found in other programs, given that the objective function could be written as a particular composition of functions. He called this new field C programming, standing for composite concave programming. In his seminal book on dynamic programming (Ref. [104]), Sniedovich shows how the study of such com positions can help tackling non-separable dynamic programs that otherwise would defeat solution. Barros and Frenk (Ref. [9]) developed a cutting plane algorithm capable of optimizing C-programs. More recently, this algorithm has been used by Carrizosa and Plastria to solve a global optimization problem in facility location (Ref. [16]). The distinction between global optimization problems (Ref. [54]) and generalized convex problems can sometimes be hard to establish. That is exactly the reason why so much effort has been placed into finding an exhaustive classification of the different weak forms of convexity, establishing a new definition just to satisfy some desirable property in the most general way possible. This book does not aim at all the subtleties of the different generalizations of convexity, but concentrates on the most general of them all, quasiconvex programming. Chapter 5 shows clearly where the real difficulties appear.

Many approaches have been proposed to enhance software productivity and reliability. These approaches typically fall into three categories: the engineering approach, the formal approach, and the knowledge-based approach. The optimal gain in software productivity cannot be obtained if one relies on only one of these approaches. Thus, the integration of different approaches has also become a major area of research. No approach can be said to be perfect if it fails to satisfy the following two criteria. Firstly, a good approach should support the full life cycle of software development. Secondly, a good approach should support the development of large-scale software for real use in many application domains. Such an approach can be referred to as a five-in-one approach. The authors of this book have, for the past eight years, conducted research in knowledge-based software engineering, of which the final goal is to develop a paradigm for software engineering which not only integrates the three approaches mentioned above, but also fulfils the two criteria on which the five-in-one approach is based. Domain Modeling- Based Software Engineering: A Formal Approach explores the results of this research. Domain Modeling-Based Software Engineering: A Formal Approach will be useful to researchers of knowledge-based software engineering, students and instructors of computer science, and software engineers who are working on large-scale projects of software development and want to use knowledge-based development methods in their work.

Many designers, policy makers, teachers, and other practitioners are beginning to understand the usefulness of using digital games beyond entertainment. Games have been developed for teaching, recruiting and to collect data to improve search engines. This book examines the fundamentals of designing any game with a serious purpose and provides a way of thinking on how to design one successfully.

The reader will be introduced to a design philosophy called Triadic Game Design.; a theory that all games involve three worlds: the worlds of Reality, Meaning, and Play. Each world is affiliated with aspects. A balance needs to be found within and between the three worlds. Such a balance is difficult to achieve, during the design many tensions will arise, forcing designers to make trade-offs. To deal with these tensions and to ensure that the right decisions are made to create a harmonic game, a frame of reference is needed. This is what "Triadic Game Design" offers.

This monograph book is focused on the recent advances in smart, multimedia and computer gaming technologies. The Contributions include: *Smart Gamification and Smart Serious Games. *Fusion of secure IPsec-based Virtual Private Network, mobile computing and rich multimedia technology. *Teaching and Promoting Smart Internet of Things Solutions Using the Serious-game Approach. *Evaluation of Student Knowledge using an e-Learning Framework. *The iTEC Eduteka. *3D Virtual Worlds as a Fusion of Immersing, Visualizing, Recording, and Replaying Technologies. *Fusion of multimedia and mobile technology in audio guides for Museums and Exhibitions: from Bluetooth Push to Web Pull. The book is directed to researchers, students and software developers working in the areas of education and information technologies.

In the paper we propose a model of tax incentives optimization for inve- ment projects with a help of the mechanism of accelerated depreciation. Unlike the tax holidays which influence on effective income tax rate, accelerated - preciation affects on taxable income. In modern economic practice the state actively use for an attraction of - vestment into the creation of new enterprises such mechanisms as accelerated depreciation and tax holidays. The problem under our consideration is the following. Assume that the state (region) is interested in realization of a certain investment project, for ex- ple, the creation of a new enterprise. In order to attract a potential investor the state decides to use a mechanism of accelerated tax depreciation. The foll- ing question arise. What is a reasonable principle for choosing depreciation rate? From the state's point of view the future investor's behavior will be rat- nal. It means that while looking at economic environment the investor choose such a moment for investment which maximizes his expected net present value (NPV) from the given project. For this case both criteria and "investment rule" depend on proposed (by the state) depreciation policy. For the simplicity we will suppose that the purpose of the state for a given project is a maximi- tion of a discounted tax payments into the budget from the enterprise after its creation. Of course, these payments depend on the moment of investor's entry and, therefore, on the depreciation policy established by the state.