ppxscal/embedding_network huggingface dataset:
On the Stability of Residual-Free Bubbles for Convection-Diffusion Problemsand their Approximation by a Two-Level Finite Element Method.
Authors: L. P. Franca, A. Nesliturk, M. Stynes
Venue:  (1997)

We consider the Galerkin finite element method for partial diffferential equations in two dimensions, where the finite-dimensional space used consists of piecewise (isoparametric) polynomials enriched with bubble functions. Writing $L$ for the differential operator, we show that for elliptic convection-diffusion problems, the component of the bubble enrichment that stabilizes the method is essentially equivalent to a Petrov-Galerkin method with an $L$-spline (exponentially fitted) trial space and piecewise polynomial test space; the remaining component of the bubble influences the accuracy of the method. A stability inequality recently obtained by Brezzi, Franca and Russo for a limiting case of bubbles applied to convection-diffusion problems is shown to be slightly weaker than the standard stability inequality that is obtained for the SDFEM/SUPG method, thereby demonstrating that the bubble approach is in general slightly less stable than the streamline diffusion method. When the trial functions are piecewise linear, we show that residual-free bubbles are as stable as SDFEM/SUPG, and we extend this stability inequality to include positive mesh-Peclet numbers in the convection-dominated regime. Approximate computations of the residual-free bubbles are performed using a two-level finite element method.
Mastering Jakarta Struts, 2 edition
Authors: James Goodwill
Venue:  (2003)

:Developing Web applications with Java became considerably easier with the advent of JavaServer Pages (JSP) and servlets. Unfortunately, when used for large-scale applications, JSPs have been less successful -- they can become bloated with code, resulting in applications that are slow and inefficient. Jakarta Struts helps provide the solution to this problem. Struts handles a number of specific tasks involved in controlling how servlets, EJBs, and other components work together. It also makes use of JSP custom tags to help developers create interactive, form-based applications. James Goodwill has loaded each chapter with real-world code examples that show how to build applications using Jakarta Struts. Written for experienced Java programmers who need to learn how to use Struts to build enterprise-level applications, this book begins by examining the concepts and architecture of the Struts Framework of technologies.
Photoshop Elements 2 Face Makeovers
Authors: Friends of Ed, Josh Fallon, Jim Hannah, Katy Freer
Venue:  (2003)

:Bored with your family snapshots? Ugly friends? Well show you how to harness the power of Photoshop Elements 2 to subtly improve or distort them beyond all recognition as you see fit! Packed full of creative, fun ideas, each explained with step-by-step tutorials, and with all the source files on the accompanying CD, this book will show you how to: Produce caricatures by distorting faces with the popular Liquify tool Transform ordinary snapshots into works of art by Warhol, Lichtenstein, and Van Gogh Turn your kids into clowns, or tigers, or anything else they can dream up with digital face paint Eliminate red eye and achieve perfect skin tone on your everyday shots Tweak out to freak out! Give your nearest and dearest the cosmetic surgery you think they deserve! Enter the world of fantasy with some sumptuous mystical makeovers ...and more!
CLIQUES: A New Approach to Group Key Agreement
Authors: Michael Steiner, Michael Waidner, Gene Tsudik
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the well-known Diffie-Hellman key agreement method to support dynamic group operations. Constituent protocols are provably secure and efficient.
Stereo Matching Using Belief Propagation
Authors: Jian Sun, Nan-Ning Zheng, Heung-Yeung Shum
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

In this paper, we formulate the stereo matching problem as a Markov network and solve it using Bayesian belief propagation. The stereo Markov network consists of three coupled Markov random fields that model the following: a smooth field for depth/disparity, a line process for depth discontinuity, and a binary process for occlusion. After eliminating the line process and the binary process by introducing two robust functions, we apply the belief propagation algorithm to obtain the maximum a posteriori (MAP) estimation in the Markov network. Other low-level visual cues (e.g., image segmentation) can also be easily incorporated in our stereo model to obtain better stereo results. Experiments demonstrate that our methods are comparable to the state-of-the-art stereo algorithms for many test cases.
Occlusion Culling Using Minimum Occluder Set and Opacity Map
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The aim of occlusion culling is to cull away a significant amount of invisible primitives at different viewpoints. We present two algorithms to improve occlusion culling for a highly occluded virtual environment. The first algorithm is used in pre-processing stage. It considers the combined gain and cost of occluders to select an optimal set of occluders, called minimum occluder set, for each occludee. The second algorithm uses the improved opacity map and sparse depth map for efficient run-time overlap tests and depth tests, respectively. Without using pixel-wise comparison, this algorithm uses only three integer operations to perform an overlap test, and carry out a depth comparison sparsely. Both algorithms have been implemented and applied to test a model composed of about three hundred thousand polygons. Significant speedup in walkthroughs of the test model due to our algorithms has been observed.
UML: A Beginner's Guide, 1 edition
Authors: Jason T. Roff
Venue:  (2002)

Essential skills for first-time programmers! This easy-to-use book explains the fundamentals of UML. You'll learn to read, draw, and use this visual modeling language to create clear and effective blueprints for software development projects. The modular approach of this series--including drills, sample projects, and mastery checks--makes it easy to learn to use this powerful programming language at your own pace.Table of contents 1: UML Fundamentals 2: Use Case Diagrams 3: Introduction to Object-Oriented Design 4: Workflow Modeling with Activity Diagrams 5: Modeling Behavior with Sequence Diagrams 6: Defining Domain Models Using Class Diagrams 7: Collaboration Diagrams 8: Further Explanation of Class Diagrams 9: Further Explanation of Sequence Diagramming 10: Modeling Behavior with Statechart Diagrams 11: Architecting with Implementation Diagrams 12: Using the Object Constraint Language A: Answers to Mastery Checks
Visual FoxPro Certification Exams
Authors: Cindy Winegarden, Evan Delay
Venue:  (2002)

:Covered here are both the Desktop and Distributed exams in one book. Visual FoxPro certification is the way to present contract customers and employers with an objective assessment of one's technical skills as Visual FoxPro developer. Microsoft certification also provides contract customers and employers with additional confidence in their decision to contract with, or hire developers as they solve business problems and move forward in our data-driven, digital economy. Microsoft has moved their certification emphasis from knowledge assessment to measuring real-life skills. This study guide will assist developers in efficient, focused, VFP certification exam preparation.
Paging cost minimization under delay constraints
Authors: C. Rose, R. D. Yates
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Efficient paging procedures help minimize the amount of bandwidth expended in locating a mobile unit. Given a probability distribution on user location, the optimal paging strategy which minimized the expected number of locations polled E[L] is to query each location sequentially in order of decreasing probability. However, since sequential search over many locations may impose unacceptable polling delay, D, optimal paging subject to delay constraints is considered. Substantial reductions in E[L] can be had even after moderate constraints are imposed on acceptable D (i.e., D/spl les/3) Since all methods of mobility management eventually reduce to considering a time-varying probability distribution on user location, this work should be applicable to a wide range of problems in the area. Most notably those with additive cost structures.
Special Edition Using Crystal Enterprise 8.5
Authors: Steve S. Lucas, Roger Sanborn
Venue:  (2002)

:The only reference available on Crystal Enterprise written by employees of Crystal Decisions, creator of Crystal Enterprise. Special Edition Using Crystal Enterprise 8.5 provides a comprehensive reference for the enterprise information delivery solution, Crystal Enterprise. This book will help readers understand where and how Crystal Enterprise can be applied to solve business problems. Written as a guide through planning, deploying, administering, and managing an enterprise reporting system based on Crystal Enterprise. Using practical examples of how Crystal Enterprise can be deployed in complex network environments to solve some of the toughest reporting and information delivery challenges. This book focuses on the entire solution that Crystal Enterprise and its supporting suite of report design tools (Crystal Reports and Crystal Analysis Professional) can deliver.This book picks up where standard Crystal Reports books leave off - it focuses on the actual delivery of interactive report content created with Crystal Reports.
CORBA-based Real-time Trader Service for Adaptable Command and Control Systems
Authors: Steven Wohlever, Victor Fay-Wolfe, Bhavani Thuraisingham, Richard Freedman, John Maurer
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

This paper describes an approach to building adaptable real-time command and control (C2) systems. In particular, it presents an overview of the Adaptable Real-Time Distributed Object Management (ARTDOM) project in progress at the MITRE Corporation. This project is currently developing real-time extensions for the Common Object Request Broker Architecture (CORBA) Trading Object Service. The goal of the project is to demonstrate how current C2 systems can be more easily upgraded and made more adaptable by using emerging distributed computing technology. This goal is being accomplished by investigating and developing real-time middleware that is reflexive (i.e., capable of examining its current state and processing demands) and self-adapting (i.e., capable of reconfiguring itself based on its reflective findings).
Proposal of Semantics-Based Web Service Matchmaking
Authors: Takahiro Kawamura, Tetsuo Hasegawa, Akihiko Ohsuga
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Web services and Web applications are expected to grow rapidly in near future.Thusthe demand for a search engine for Web services in the Internet will become increasinglysignificant.Nowadays there are extensive efforts underway to make such a mechanism likeUDDI.The mechanism, however, has no matchmaking functionality to find services whichmatch a given service interface.Therefore, we propose a method to find similarity amongservice interfaces.In this paper, we represent semantics of service interfaces in a logicalformat, and show the method to determine whether any pairs of services semantically match.
NESL: A Nested Data-Parallel Language (Version 2.6)
Authors: Guy E. Blelloch
Venue:  (1993)

This report describes NESL, a strongly-typed, applicative, data-parallel language. NESL is intended to be used as a portable interface for programming a variety of parallel and vector supercomputers, and as a basis for teaching parallel algorithms. Parallelism is supplied through a simple set of data-parallel constructs based on sequences (ordered sets), including a mechanism for applying any function over the elements of a sequence in parallel and a rich set of parallel functions that manipulate sequences. NESL fully supports nested sequences and nested parallelism -- the ability to take a parallel function and apply it over multiple instances in parallel. Nested parallelism is important for implementing algorithms with complex and dynamically changing data structures, such as required in many graph and sparse matrix algorithms. NESL also provides a mechanism for calculating the asymptotic running time for a program on various parallel machine models, including the parallel random access machine (PRAM). This is useful for estimating running times of algorithms on actual machines and, when teaching algorithms, for supplying a close correspondence between the code and the theoretical complexity. This report defines NESL and describes several examples of algorithms coded in the language. The examples include algorithms for median finding, sorting, string searching, finding prime numbers, and finding a planar convex hull. NESL currently compiles to an intermediate language called Vcode, which runs on the Cray Y-MP, Connection Machine CM-2, and Encore Multimax. For many algorithms, the current implementation gives performance close to optimized machine-specific code for these machines. Note: This report is an updated version of CMU-CS-92-103, which described version 2.4 of the language. The most significant changes in version 2.6 are that it supports polymorphic types, has an ML-like syntax instead of a lisp-like syntax, and includes support for I/O.
Exact and approximate analysis of ATM cell loss correlation
Authors: J.-L. Tseng, J. F. Meyer
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

Cell loss behavior is analyzed for an ATM switch with homogeneous Markov sources. While prior work in this regard has focused mainly on measures such as the steady-state loss probability and conditional loss probability, we consider a more refined measure, namely the probability distribution of a cell loss period. Evaluation is based on a discrete-time, finite-state Markov process where cell arrivals at each input port are represented by an (M+1)-state source model (M ON states and one OFF state). Although we are able to formulate the loss period distribution exactly, for switches with realistic dimensions, the associated computational cost is high. As an alternative, we find that the loss period distribution is essentially insensitive to the buffer capacity K and, more importantly, its companion tail distribution can be accurately approximated by a relatively simple expression. As evidenced by numerical results, the errors of approximation are small and indeed, in many instances, the results obtained are effectively the same as those of an exact analysis.
Visualization Schemas for Flexible Information Visualization
Authors: Chris North, Nathan Conklin, Varun Saini
Venue: Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02) (2002)

Relational databases provide significant flexibility to organize, store, and manipulate an infinite variety of complex data collections. This flexibility is enabled by the concept of relational data schemas, which allow data owners to easily design custom databases according to their unique needs. However, user interfaces and information visualizations for accessing and utilizing databases have not kept pace with this level of flexibility. This paper introduces the concept of Visualization Schemas, based on the Snap-Together Visualization model, which are analogous to relational data schemas. Visualization schemas enable users to rapidly construct customized multiple-view visualizations for databases in a similarly flexible fashion without programming. Since the design of appropriate visualizations for a given database depends on the data schema, visualization schemas are a natural analogy to the data schema concept.
Reconstructing While Registering: A Novel Approach for Markerless Augmented Reality
Authors: Gilles Simon, Marie-Odile Berger
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This paper addresses the registration problem for unprepared multi-planar scenes. An interactive process is proposed to get accurate results using nothing else than the texture information of the planes. In particular, the classical preparation steps (camera calibration, scene acquisition) are greatly simplified, since included in the on-line registration process. Some results are shown on indoor and outdoor scenes.
A protocol for multi-agent diagnosis with spatially distributed knowledge
Authors: Nico Roos, Annette ten Teije, Cees Witteveen
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local models of the system have to be used to detect possible faults. Traditional diagnostic tools, however, are not suitable to deal with such a set of spatially distributed local models.A Multi-Agent System of diagnostic agents, where each agent has a model\footnote[Here, we focus on Model-Based Diagnosis.] of a subsystem, may be proposed as a solution for establishing global diagnoses of large distributed systems. Unfortunately, establishing a global minimal diagnosis is NP-Hard, even if every agent is able to determine local minimal diagnoses in polynomial time. Moreover, communication overhead in establishing a global diagnosis will be high: unless Ρ = ΝΡ a super-polynomial number of messages between the agents will be required for establishing a global diagnosis.In this paper we present a protocol that overcomes this complexity issue by exchanging diagnostic precision for enables agents to determine local minimal diagnoses that are consistent with global diagnoses. Moreover, the protocol ensures that no agent acquires knowledge of global diagnoses. The protocol does not guarantee that a combination of the agents' local minimal diagnoses is also a global minimal diagnosis. However, for every global minimal diagnosis, there is a combination of local minimal diagnoses.
GDEVS: A Generalized Discrete Event Specification for Accurate Modeling of Dynamic Systems
Authors: Norbert Giambasi, Bruno Escude, Sumit Ghosh
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Given a process whose output is a dynamic function of time, the traditional discrete event specification (DEVS) approximates the input, output, and state trajectories through piecewise constant segments, where the segments correspond to discrete time intervals that are not necessarily equal in length. For processes that defy accurate modeling through piecewise constant segments, this paper presents GDEVS, a Generalized Discrete EVent Specification, wherein the trajectories are organized through piecewise polynomial segments. The utilization of arbitrary polynomial functions for segments promises higher accuracies in modeling continuous processes as discrete event abstractions. In general, discrete event systems including DEVS and GDEVS execute faster on host computers because executions occur corresponding to significant changes in the system unlike in continuous simulations where execution is on a continuous basis. GDEVS' superiority over DEVS lies in its ability to discretize a system characteristic. A key contribution of GDEVS is that it permits the development of a uniform simulation environment for hybrid, i.e. both continuous and discrete, systems. GDEVS is illustrated for a first order system and a hybrid system, with piecewise linear segments. Two representative systems have been modeled under GDEVS and executed on a simulator developed for GDEVS. Experiments reveal that the execution speed of a laboratory prototype GDEVS simulator, DiamSim, relative to the execution of a continuous simulation on the industrial grade MATLAB/Simulink software package, is faster by a factor ranging from 2 to 4.5 and it is estimated that an optimized, industrial implementation of GDEVS may be faster by a factor exceeding 10.
Information Drill-down using Web tools
Authors: Mikael Jern
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Abstract-- The paper reviews the Information Visualization and interaction techniques needed to add another dimension to surfing the Web. Information Visualization can be used to explore relationships by "drilling down" and retrieving more data within a region of interest in the visualized data, combining data mining, direct manipulation and data visualization with 3D Web tools. It is now possible to create desktop visualization applications that let users interact with databases with larger datasets over the network using both 2D and 3D interaction metaphors. The VRML standard allows users to view and navigate through 3D information data worlds and hyperlink to new worlds. Information drilling based on HTML's Image Map, VRML's anchor node and multiple predefined viewpoints will be explained and demonstrated. The image map in 2D and 3D graphics objects (glyphs etc) will represent the Visual User Interface to the information stored in the database Over the next couple of years, we shall see 3D visualization evolve in giant steps into interactive data drilling on the Web providing visualization technology closely integrated with the data warehouse and multidimensional abstract and geospatial data models. IEEE Conference on Information Visualisation (IV '97)
Stability and task complexity: a neural network model of evolution and learning
Authors: James R. Watson, Nicholas Geard, Janet Wiles
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Since Hinton and Nowlan introduced the Baldwin effect to the evolutionary computation community, agent-based studies of genetic assimilation have uncovered many details of the dynamic processes involved. In a previous paper, we demonstrated genetic assimilation with a simple food/toxin discrimination task using neural network agents that could evolve their learning rate. The study reported in this paper investigated the genetic assimilation of more complex learning tasks.Kauffman's NK landscape model, which can generate landscapes with a variable degree of correlation, was used to define learning tasks of varying levels of complexity. Simulations indicate an increased tendency of genetic assimilation to occur as the complexity of the learning task decreases and the environmental stability increases. These results are explained in terms of the shifting balance between the evolutionary costs and benefits of learning.
ASP.NET at Work: Building 10 Enterprise Projects
Authors: Eric Smith
Venue:  (2002)

:ASP.NET provides developers with more functionality and flexibility to develop dynamic Web applications while at the same time writing less code. If you're an ASP developer familiar with ASP.NET and Visual Studio .NET basics but unsure of how to connect all of these technologies to build useful applications, this book provides a unique approach to help you solve this problem. Centered on ten applications, these projects present complete programs that you can adopt and modify for use in your own organization. With special emphasis on these ASP.NET features that you'll utilize most often