ppxscal/embedding_network huggingface dataset:
Two Element-by-Element Iterative Solutions for Shallow Water Equations
Authors: C. C. Fang, Tony W. H. Sheu
Venue: SIAM Journal on Scientific Computing (2000)

In this paper we apply the generalized Taylor--Galerkin finite element model to simulate bore wave propagation in a domain of two dimensions. For stability and accuracy reasons, we generalize the model through the introduction of four free parameters. One set of parameters is rigorously determined to obtain the high-order finite element solution. The other set of free parameters is determined from the underlying discrete maximum principle to obtain the monotonic solutions. The resulting two models are used in combination through the flux correct transport technique of Zalesak, thereby constructing a finite element model which has the ability to capture hydraulic discontinuities. In addition, this paper highlights the implementation of two Krylov subspace iterative solvers, namely, the bi-conjugate gradient stabilized (Bi-CGSTAB) and the generalized minimum residual (GMRES) methods. For the sake of comparison, the multifrontal direct solver is also considered. The performance characteristics of the investigated solvers are assessed using results of a standard test widely used as a benchmark in hydraulic modeling. Based on numerical results, it is shown that the present finite element method can render the technique suitable for solving shallow water equations with sharply varying solution profiles. Also, the GMRES solver is shown to have a much better convergence rate than the Bi-CGSTAB solver, thereby saving much computing time compared to the multifrontal solver.
Critical blowup exponents for a system of reaction-diffusion equations with absorption
Authors: Nabil Bedjaoui, Philippe Souplet
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

We consider a system of two reaction-diffusion equations with absorption, under Dirichlet boundary conditions, modelling the cooperative interaction of two diffusing biological species. We obtain optimal conditions on the exponents of the reaction and absorption terms for the existence of blowing up solutions, or for the global existence and boundedness of all solutions. The proofs of blowup rely on comparison with carefully constructed self-similar weak subsolutions with compact support.
LBGK Simulations of Turing Patterns in CIMA Model
Authors: Qing Li, Chu-Guang Zheng, Neng-Chao Wang, Bao-Chang Shi
Venue: Journal of Scientific Computing (2001)

A lattice Bhatnagar&ndash;Gross&ndash;Krook (LBGK) model for reaction-diffusion systems is presented. This model provides a mesoscopic approach to the dynamics of spatially-distributed reacting systems. Pure diffusion phenomena are computed and the results are agreement with the theoretical predictions. This method is also applied to formation of Turing patterns in chloride-iodide-malonic acid (CIMA) reactive model. We get hexagonal structures and stripes which are agreement with other numerical results and experimental results.
Parallel programming using visual patterns
Authors: A. S. M. Sajeev
Venue: Progress in computer research (2001)

Parallel programming is significantly more complex than sequential programming because the programmer has the additional tasks of both specifying processes, and their communication and synchronization requirements. In this paper we propose a visual environment in which a non-expert in parallel programming can concentrate on the sequential aspects of a parallel program and specify its communication and synchronization using visual tools. The visual environment provides, as patterns, encapsulations of common communication and synchronization strategies. In addition, an expert parallel programmer can add new patterns to the repository either by defining it completely, or by extending the existing patterns in the repository.
Digital Signal Processing Using MATLAB, 1st edition
Authors: Vinay K. Ingle, John G. Proakis
Venue:  (1999)

:This supplement to any standard DSP text is one of the first books to successfully integrate the use of MATLAB&reg; in the study of DSP concepts. In this book, MATLAB&reg; is used as a computing tool to explore traditional DSP topics, and solve problems to gain insight. This greatly expands the range and complexity of problems that students can effectively study in the course. Since DSP applications are primarily algorithms implemented on a DSP processor or software, a fair amount of programming is required. Using interactive software such as MATLAB&reg; makes it possible to place more emphasis on learning new and difficult concepts than on programming algorithms. Interesting practical examples are discussed and useful problems are explored. This updated printing revises the scripts in the book, available functions, and m-files (available for downloading from the Brooks/Cole Bookware Companion Resource Series Center Web site) to MATLAB&reg; V5 (created with 5.3).
Security and Data Protection with Sap Systems, 1st edition
Authors: Werner Hornberger, Jurgen M. Schneider
Venue:  (2001)

:As SAP systems grow more closely integrated with the open environment of the internet, the effective use of SAP security and data protection functions has become an essential focus of corporate attention. Security and Data Protection with SAP Systems offers a complete overview of SAP security functions and their place in a company-wide security policy. It also covers the fundamentals of data protection and their global implementation with mySAP.com, SAP Business Warehouse and R/3. Written by two of SAP's foremost security professionals, and focusing strongly on practical measures, Security and Data Protection with SAP Systems provides a unique guide to best practice in this vital field. Contents include: Basic principles of enterprise security Security in SAP systems and the SAP system landscape mySAP.com  security and data protection on the Internet Basic principles and goals of data protection Data protection and the law The role of the data protection officer The special role of the administrator Remote support Data protection and the SAP Business Information Warehouse
Preconditioners for Nondefinite Hermitian Toeplitz Systems
Authors: Raymond H. Chan, Daniel Potts, Gabriele Steidl
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

This paper is concerned with the construction of circulant preconditioners for Toeplitz systems arising from a piecewise continuous generating function with sign changes.If the generating function is given, we prove that for any $\varepsilon >0$, only ${\cal O} (\log N)$ eigenvalues of our preconditioned Toeplitz systems of size N &times; N are not contained in $[-1-\varepsilon, -1+\varepsilon] \cup [1 -\varepsilon, 1+\varepsilon]$. The result can be modified for trigonometric preconditioners. We also suggest circulant preconditioners for the case that the generating function is not explicitly known and show that only ${\cal O} (\log N)$ absolute values of the eigenvalues of the preconditioned Toeplitz systems are not contained in a positive interval on the real axis.Using the above results, we conclude that the preconditioned minimal residual method requires only ${\cal O} (N \log ^2 N)$ arithmetical operations to achieve a solution of prescribed precision if the spectral condition numbers of the Toeplitz systems increase at most polynomial in N. We present various numerical tests.
Novell's Guide to Resolving Critical Server Issues with Cdrom, 1st edition
Authors: Rich Jensen, Brad W. Dayley
Venue:  (1998)

:Are network crashes and server malfunctions costing your employees lost time and your company lost revenue? Do you spend too much of your workday debugging and troubleshooting? Now you can resolve critical server issues quickly and minimize IS headaches with Novells Guide to Resolving Critical Server Issues. Certified Novell engineers Brad Dayley and Rich Jensen apply their real-world experience to both common and complicated server issues. With Novells Guide to Resolving Critical Server Issues, youll learn how to rectify ABENDs, lockups, and high utilization. Youll also master the NetWare operating system, prevent server lockups, and reduce time spent debugging by deploying virtual debuggers. Novells Guide to Resolving Critical Server Issues also includes a companion CD-ROM with exclusive software. You can sample Remote Debugger, Filer NLM, ABEND Demo NLM, NetAlive NLM, MakeLog, and much more. Plus, the CD features a two-hour video lecture by the authors. So free yourself from "server error hell" and prepare for crashes before they occur with Novells Guide to Resolving Critical Server Issues.
An Enumerative Geometry Framework for Algorithmic Line Problems in $\mathbb R^3$
Authors: Thorsten Theobald
Venue: SIAM Journal on Computing (2002)

We investigate the enumerative geometry aspects of algorithmic line problems when the admissible bodies are balls or polytopes. For this purpose, we study the common tangent lines/transversals to k balls of arbitrary radii and 4-k lines in ${\mathbb R}^3$. In particular, we compute tight upper bounds for the maximum number of real common tangents/transversals in these cases. Our results extend the results of Macdonald, Pach, and Theobald who investigated common tangents to four unit balls in ${\mathbb R}^3$ [Discrete Comput. Geom., 26 (2001), pp. 1--17].
Diagnosis of discrete-event systems from uncertain temporal observations
Authors: Gianfranco Lamperti, Marina Zanella
Venue: Artificial Intelligence (2002)

Observations play a major role in diagnosis. The nature of an observation varies according to the class of the considered system. In static systems, an observation is the value of a variable at a single time point. In dynamic continuous systems, such a value is observed over a time interval. In discrete-event systems, an observation consists of a sequence of temporally ordered events. In any case, what is observed is assumed not to be ambiguous. This certainty principle, whilst being a useful simplification for a variety of contexts, may become inappropriate for a wide range of real systems, where the communication between the system and the observer is either bound to generate spurious messages, to randomly lose messages, or to lose temporal constraints among them. Consequently, the observation may be underconstrained. To cope with this uncertainty, a number of principles affecting both the observations and the modeled behavior of a system are introduced, that are independent of any specific processing technique. Furthermore, the notion of an uncertain temporal observation for discrete-event systems is introduced and accommodated within a graph whose nodes are labeled by uncertain messages, while edges define a partial temporal ordering among messages. This way, an uncertain observation implicitly defines a finite set of observations in the traditional sense. Thus, solving an uncertain diagnostic problem amounts to solving at one time several traditional diagnostic problems. The notion of an uncertain observation is further generalized to that of a complex observation. Both notions can be exploited by any diagnostic approach pertinent to discrete-event systems. Complex observations are contextualized in the framework of diagnosis of active systems and substantiated by a sample application in the domain of power transmission networks.
The revenge of the JD
Authors: David Maier, Jeffrey D. Ullman, Moshe Y. Vardi
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

Manifestations of the "universal relation assumption" can be seen either as definitions of a one-relation user view of data, or as algorithms for answering queries about arbitrary sets of attributes. In this paper we explore equivalences between these two points of view. We show that if the user's view is the representative instance, then our ability to answer queries about the universal relation, by applying relational algebra to the actual database, is equivalent to a "boundedness" condition on the dependencies of the database scheme. Further, whenever this condition holds, there is a finite union of lossless tableau mappings that produces the desired relation.
The Complete Idiot's Guide to e-Commerce
Authors: Rob S. Smith, Mark Thompson, Mark Speaker
Venue:  (2000)

:The Complete Idiot's Guide to e-Commerce shows you what makes e-businesses successful, what to consider when starting an on-line business, where the Internet is heading and how to avoid the pitfalls that are on the horizon. It also includes an e-commerce business model at the end of the book that brings all the content together in one cohesive strategy. You can surf the Internet to an on-line website for real examples of some e-commerce concepts like 'real-time' supply chain objects or secure electronic payment forms. The book also includes links to e-commerce suppliers, information and new technology.
Machine learning and inductive logic programming for multi-agent systems
Authors: Dimitar Kazakov, Daniel Kudenko
Venue: Mutli-agents systems and applications (2001)

Learning is a crucial ability of intelligent agents. Rather than presenting a complete literature review, we focus in this paper on important issues surrounding the application of machine learning (ML) techniques to agents and multi-agent systems (MAS). In this discussion we move from disembodied ML over single-agent learning to full multi-agent learning. In the second part of the paper we focus on the application of Inductive Logic Programming, a knowledge-based ML technique, to MAS, and present an implemented framework in which multi-agent learning experiments can be carried out.
Stochastic Linear Quadratic Regulators with Indefinite Control Weight Costs. II
Authors: Shuping Chen, Xun Yu Zhou
Venue: SIAM Journal on Control and Optimization (2000)

In part I of this paper [S. Chen, X. Li, and X. Zhou, SIAM J. Control Optim., 36 (1998), pp. 1685--1702], an optimization model of stochastic linear quadratic regulators (LQRs) with indefinite control cost weighting matrices is proposed and studied. In this sequel, the problem of solving LQR models with system diffusions dependent on both state and control variables, which is left open in part I, is tackled. First, the solvability of the associated stochastic Riccati equations (SREs) is studied in the normal case (namely, all the state and control weighting matrices and the terminal matrix in the cost functional are nonnegative definite, with at least one positive definite), which in turn leads to an optimal state feedback control of the LQR problem. In the general indefinite case, the problem is decomposed into two optimal LQR problems, one with a forward dynamics and the other with a backward dynamics. The well-posedness and solvability of the original LQR problem are then obtained by solving these two subproblems, and an optimal control is explicitly constructed. Examples are presented to illustrate the results.
The World Wide Web (Unleashed)
Authors: John December, Neil Randall
Venue:  (1994)

:This is the only book to cover the Web-its uses, resources, and tools-in complete detail. Readers explore the farthest, most exotic reaches of the Web, and find out how to create and maintain Web servers for all types and uses.Explores the Web's amazing world of electronic art museums, online magazines and catalogs, virtual malls, and video and music librariesShows how to navigate the World Wide Web, find Web resources and create Web pagesIncludes a complete guide to using Mosaic and other Web tools
Making web sites be places for social interaction
Authors: Andreas Girgensohn, Alison Lee
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Technology can play an important role in enabling people to interact with each other. The Web is one such technology with the affordances for sharing information and for connecting people to people. In this paper, we describe the design of two social interaction Web sites for two different social groups. We review several related efforts to provide principles for creating social interaction environments and describe the specific principles that guided our design. To examine the effectiveness of the two sites, we analyze the usage data. Finally, we discuss approaches for encouraging participation and lessons learned.
Simulation Modeling and Analysis, 3rd edition
Authors: Averill M. Law, David M. Kelton
Venue:  (1999)

:This senior/graduate-level text is the classic text in its field and established itself as the authoritative source on the theory & practice of simulation over 15 years ago. It is used in most of the better schools of engineering and in some business programs as well.
Multigrid Preconditioning for Krylov Methods for Time-Harmonic Maxwell's Equations in Three Dimensions
Authors: D. A. Aruliah, U. M. Ascher
Venue: SIAM Journal on Scientific Computing (2002)

We consider the rapid simulation of three-dimensional electromagnetic problems in geophysical parameter regimes, where the conductivity may vary significantly and the range of frequencies is moderate. Toward developing a multigrid preconditioner, we present a Fourier analysis based on a finite-volume discretization of a vector potential formulation of time-harmonic Maxwell's equations on a staggered grid in three dimensions. We prove grid-independent bounds on the eigenvalue and singular value ranges of the system obtained using a preconditioner based on exact inversion of the dominant diagonal blocks of the non-Hermitian coefficient matrix. This result implies that a preconditioner that uses single multigrid cycles to effect inversion of the diagonal blocks also yields a preconditioned system with an $\ell_2$-condition number bounded independent of the grid size. We then present numerical examples for more realistic situations involving large variations in conductivity (i.e.,\ jump discontinuities). Block-preconditioning with one multigrid cycle using Dendy's BOXMG solver is found to yield convergence in very few iterations, apparently independent of the grid size. The experiments show that the somewhat restrictive assumptions of the Fourier analysis do not prohibit it from describing the essential local behavior of the preconditioned operator under consideration. A very efficient, practical solver is obtained.
Special Edition Using Microsoft PowerPoint 2002
Authors: Patrice-Anne Rutledge, Tom Mucciolo
Venue:  (2001)

:Special Edition Using Microsoft PowerPoint 2002 is created for experienced users who want to be able to use PowerPoint's more sophisticated features, as well as its basic ones. Because creating successful presentations is more than just becoming a PowerPoint power user, included is a special section in the book on presentation skills. With the addition of this special section, it makes this title uniquely different from all other titles out in the marketplace.Topics covered include:Working with tablesCollaborating on presentationsWorking with speech toolsAdding movies and soundWorking with PowerPoint in the WebCreating macrosCreating and editing Web scripts
MySQL and mSQL, 1st edition
Authors: Randy Jay Yarger, George Reese, Tim King
Venue:  (1999)

From the Book:This book teaches you how to use MySQL and mSQL, two popular, easy-to-use databases forLinux and UNIX systems that support key subsets of SQL. Anyone who knows basic C, Java, Perl,or Python can write a program to interact with a database, either as a stand-alone application orthrough a Web page. This book takes you through the whole process, from installation andconfiguration to programming interfaces and basic administration. Includes ample tutorial material.
An Explicit Formula for the Derivative of a Class of Cost Functionals with Respect to Domain Variations in Stokes Flow
Authors: Thomas Slawig
Venue: SIAM Journal on Control and Optimization (2000)

Domain optimization problems for the two-dimensional stationary Stokes equations are studied. Fr&eacute;chet differentiability of a class of cost functionals with respect to the variation of the shape of the computational domain is established. An embedding domain technique provides an equivalent formulation of the problem on a fixed domain and, moreover, a simply computable formula for the derivative of the cost functional with respect to the domain. Existence of a solution to the class of domain optimization problems is proved. Numerical examples show the reliability of the derivative formula.
Control Language Programming for the AS/400, 2nd edition
Authors: Bryan Meyers, Dan Riehl
Venue:  (1998)

:Since its introduction in 1993, "Control Language Programming for the AS/400" has become an integral part of hundreds of AS/400 college courses. The textbook has proven to be a boon to students who plan to initiate careers as AS/400 programming professionals, as well as a must-read for programmers already in the AS/400 workforce who need to brush up on their CL techniques.In this second edition, Bryan Meyers and Dan Riehl have updated the text to include discussion of the Integrated language Environment (ILE)....The authors, with more than 20 years' experience in CL programming between them, write from an up-to-the-minute knowledge of the skills required in today's MIS environment.Student progresses methodically to more complex processes and concepts, it guides readers smoothly toward a professional grasp of CL programming techniques and style. Control Students without previous knowledge of CL will learn the basics quickly. As the book Language Programming for the AS/400, Second Edition, is organized into five sections containing 25 chapters. Each chapter ends with review questions and practical exercises and includes graduated programming assignments. Throughout, concise "Coding in Style" sidebars offer tips on style issues that give students the benefit of the authors' years of practical experience. Two appendices cover essentials of AS/400 features needed for program development and SEU. A third appendix serves as a condensed reference to the CL commands used most often in CL programs.
Dynamic triangulation of variational implicit surfaces using incremental Delaunay tetrahedralization
Authors: B. Crespin
Venue: Proceedings of the 2002 IEEE symposium on Volume visualization and graphics (2002)

In this paper, we present a novel method to triangulate variational implicit surfaces. The core of the algorithm is an incremental Delaunay tetrahedralization of the constraint points defining the surface; it can be refined over time by adding new points around the surface as needed. Each tetrahedron that crosses the surface can then be triangulated to locally approximate the surface. This method allows getting several meshes of the same shape at different resolutions, which can be updated dynamically when adding new constraint points. This level-of-detail property makes variational surfaces more appealing for applications such as interactive modeling.
Spectral Viscosity Approximations to Hamilton--Jacobi Solutions
Authors: Olga Lepsky
Venue: SIAM Journal on Numerical Analysis (2000)

The spectral viscosity approximate solution of convex Hamilton--Jacobi equations with periodic boundary conditions is studied. It is proved in this paper that the approximation and its gradient remain uniformly bounded, formally spectral accurate, and converge to the unique viscosity solution. The L1-convergence rate of the order $1-\varepsilon \forall \varepsilon >0$ is obtained.
SQR in PeopleSoft and Other Applications, 1st edition
Authors: Vlad Landres
Venue:  (1999)

:This hands-on tutorial on Structured Query Report Writer is for novices and anyone interested in improving their grasp of SQR and its interaction with PeopleSoft. Author on-line support is available to book purchasers, along with source code, examples, and updates on the Manning Web site.