ppxscal/embedding_network huggingface dataset:
Discontinuous Galerkin method based on non-polynomial approximation spaces
Authors: Ling Yuan, Chi-Wang Shu
Venue: Journal of Computational Physics (2006)

In this paper, we develop discontinuous Galerkin (DG) methods based on non-polynomial approximation spaces for numerically solving time dependent hyperbolic and parabolic and steady state hyperbolic and elliptic partial differential equations (PDEs). The algorithm is based on approximation spaces consisting of non-polynomial elementary functions such as exponential functions, trigonometric functions, etc., with the objective of obtaining better approximations for specific types of PDEs and initial and boundary conditions. It is shown that L2 stability and error estimates can be obtained when the approximation space is suitably selected. It is also shown with numerical examples that a careful selection of the approximation space to fit individual PDE and initial and boundary conditions often provides more accurate results than the DG methods based on the polynomial approximation spaces of the same order of accuracy.
Revisiting the Rossby-Haurwitz wave test case with contour advection
Authors: Robert K. Smith, David G. Dritschel
Venue: Journal of Computational Physics (2006)

This paper re-examines a basic test case used for spherical shallow-water numerical models, and underscores the need for accurate, high resolution models of atmospheric and ocean dynamics. The Rossby-Haurwitz test case, first proposed by Williamson et al. [D.L. Williamson, J.B. Drake, J.J. Hack, R. Jakob, P.N. Swarztrauber, A standard test set for numerical approximations to the shallow-water equations on the sphere, J. Comput. Phys. (1992) 221-224], has been examined using a wide variety of shallow-water models in previous papers. Here, two contour-advective semi-Lagrangian (CASL) models are considered, and results are compared with previous test results. We go further by modifying this test case in a simple way to initiate a rapid breakdown of the basic wave state. This breakdown is accompanied by the formation of sharp potential vorticity gradients (fronts), placing far greater demands on the numerics than the original test case does. We also go further by examining other dynamical fields besides the height and potential vorticity, to assess how well the models deal with gravity waves. Such waves are sensitive to the presence or not of sharp potential vorticity gradients, as well as to numerical parameter settings. In particular, large time steps (convenient for semi-Lagrangian schemes) can seriously affect gravity waves but can also have an adverse impact on the primary fields of height and velocity. These problems are exacerbated by a poor resolution of potential vorticity gradients.
Middleware for streaming 3D progressive meshes over lossy networks
Authors: H. Li, M. Li, B. Prabhakaran
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2006)

Streaming 3D graphics have been widely used in multimedia applications such as online gaming and virtual reality. However, a gap exists between the zero-loss-tolerance of the existing compression schemes and the lossy network transmissions. In this article, we propose a generic 3D middleware between the 3D application layer and the transport layer for the transmission of triangle-based progressively compressed 3D models. Significant features of the proposed middleware include. 1) handling 3D compressed data streams from multiple progressive compression techniques. 2) considering end user hardware capabilities for effectively saving the data size for network delivery. 3) a minimum cost dynamic reliable set selector to choose the transport protocol for each sublayer based on the real-time network traffic. Extensive simulations with TCP/UDP and SCTP show that the proposed 3D middleware can achieve the dual objectives of maintaining low transmission delay and small distortion, and thus supporting high quality 3D streaming with high flexibility.
Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
Venue: International Symposium on Field Programmable Gate Arrays (2007)

It is our great pleasure to welcome you to the 15th ACM International Symposium on Field-Programmable Gate Arrays -- FPGA'07 -- the premier conference for the presentation of new research results on programmable architectures, FPGA-based applications and systems and the associated CAD algorithms and tools.This year the call for papers attracted 92 submissions from around the globe: the United States, Canada, UK, Germany, France, Ireland, Spain, The Netherlands, Greece, Iran, The UAE, India, China, Japan and Korea. We had submissions from universities, research institutes, national labs and industry. From this list the program committee selected 22 high-quality papers for a full presentation and invited 35 authors to present their work as an interactive poster. We will see research results on FPGA architecture and technology, and CAD tools from the system-level through synthesis and physical design. A number of application/implementation papers targeting security, video and image processing, and other topics will not only highlight the usefulness of FPGAs, but also give us new insights into how to improve both FPGA design and CAD flows. Process variation and power continue to be important topics for FPGAs and we have several new results in this area.For the first time we are also pleased to have a special invited session at FPGA. The topic is the integration of FPGAs into high-performance computing systems, with three speakers from industry to give their perspectives on this emerging topic.As FPGAs gain an even wider user base, the question of programming methods becomes more important, and the traditional FPGA evening panel will explore this topic, answering the question of whether high-level languages will address the future needs of FPGA programmers.
Rapid and brief communication: Two-class fingerprint matcher
Authors: Alessandra Lumini, Loris Nanni
Venue: Pattern Recognition (2006)

We present a system for fingerprint verification that approaches the problem as a two-class pattern recognition problem. The features extracted by ''FingerCode'' are used to capture the ridge strength. This feature vector is then classified as genuine or impostor according to a novel approach to handle the fingerprint verification as a two-class problem. Moreover, we show that extracting the features from sub-images around the core permits to better represent the local information.
Digital Video Production Cookbook (Cookbooks (O'Reilly))
Authors: Chris Kenworthy
Venue:  (2005)

Have you ever watched a big-budget Hollywood movie and wondered "How did they do that?" or, perhaps, "How can I do that?" While digital technology greatly simplifies the filmmaking process, there are many tried-and-true production tricks that only those lucky enough to work in the world of high-budget professional film production get to know. The truth is that setting up a car chase, making a realistic-looking alien, staging a fistfight, creating atmospheric lighting, and using special effects are often not as difficult to master as you might think. Digital Video Production Cookbook will show you how to create sophisticated-looking visual effects, dramatic shots, and powerful sequences using low-cost methods adapted from high-end professional techniques. Author and award-winning filmmaker Chris Kenworthy explains how you can use a digital video camera and basic editing software, to create high-end production values with household equipment and a little imagination. The book includes easy-to-follow recipes for: Creating bluescreen effects Simulating rain, snow, and other natural phenomena Working with backlighting, simulated candlelight, and special lighting effects Shooting day for night Staging safe stunts, chase scenes, and fistfights Makeup techniques for aging, bruises, and serious injuries Shooting at night Working with camera movement Adding special effects such as laser bolts, holograms, and explosions and much more. Packed with full-color, step-by-step instructions, inspirational examples, and authoritative information and advice, this book is the ultimate, no-nonsense cookbook for every aspiring digital filmmaker. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Dynamic allocation of fires and sensors (DAFS): a low-resolution simulation for rapid modeling
Authors: Arnold H. Buss, Darryl K. Ahner
Venue: Proceedings of the 38th conference on Winter simulation (2006)

High-resolution combat models have become so complex that the time necessary to create and analyze a scenario has become unacceptably long. A lower resolution approach to entity-level simulation can complement such models. This paper presents Dynamic Allocation of Fires and Sensors (DAFS), a low-resolution, constructive entity-level simulation framework, that can be rapidly configured and executed. Through the use of a loosely-coupled component architecture, DAFS is extremely flexible and configurable. DAFS allows an analyst to very quickly create a simulation model that captures the first-order effects of a scenario. Although the modeling of entities is done at a low-resolution, DAFS contains some sophisticated capabilities: within the model, commander entities can formulate and solve optimization problems dynamically. DAFS can be used to explore large areas of the parameter space and identify interesting regions where high-resolution models can provide more detailed information.
Sampling Search-Engine Results
Authors: Aris Anagnostopoulos, Andrei Z. Broder, David Carmel
Venue: World Wide Web (2006)

We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as: .Determining the set of categories in a given taxonomy spanned by the search results;Finding the range of metadata values associated with the result set in order to enable "multi-faceted search";Estimating the size of the result set;Data mining associations to the query terms We present and analyze efficient algorithms for obtaining uniform random samples applicable to any search engine that is based on posting lists and document-at-a-time evaluation. (To our knowledge, all popular Web search engines, for example, Google, Yahoo Search, MSN Search, Ask, belong to this class.) Furthermore, our algorithm can be modified to follow the modern object-oriented approach whereby posting lists are viewed as streams equipped with a next method, and the next method for Boolean and other complex queries is built from the next method for primitive terms. In our case we show how to construct a basic sample-next(p) method that samples term posting lists with probability p, and show how to construct sample-next(p) methods for Boolean operators (AND, OR, WAND) from primitive methods. Finally, we test the efficiency and quality of our approach on both synthetic and real-world data.
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
Authors: Xiaojun Lin, Ness B. Shroff
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In this paper, we study cross-layer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal cross-layer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the underlying layers. However, the scheduling component in this optimal cross-layer congestion control scheme has to solve a complex global optimization problem at each time, and is hence too computationally expensive for online implementation. In this paper, we study how the performance of cross-layer congestion control will be impacted if the network can only use an imperfect (and potentially distributed) scheduling component that is easier to implement. We study both the case when the number of users in the system is fixed and the case with dynamic arrivals and departures of the users, and we establish performance bounds of cross-layer congestion control with imperfect scheduling. Compared with a layered approach that does not design congestion control and scheduling together, our cross-layer approach has provably better performance bounds, and substantially outperforms the layered approach. The insights drawn from our analyzes also enable us to design a fully distributed cross-layer congestion control and scheduling algorithm for a restrictive interference model.
Coverage metrics for formal verification
Authors: Hana Chockler, Orna Kupferman, Moshe Vardi
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2006)

In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complete the specification is and whether it really covers all the behaviors of the system. The challenge of making the verification process as exhaustive as possible is even more crucial in simulation-based verification, where the infeasible task of checking all input sequences is replaced by checking a test suite consisting of a finite subset of them. It is very important to measure the exhaustiveness of the test suite, and indeed there has been extensive research in the simulation-based verification community on coverage metrics, which provide such a measure. It turns out that no single measure can be absolute, leading to the development of numerous coverage metrics whose usage is determined by industrial verification methodologies. On the other hand, prior research of coverage in formal verification has focused solely on state-based coverage. In this paper we adapt the work done on coverage in simulation-based verification to the formal-verification setting in order to obtain new coverage metrics. Thus, for each of the metrics used in simulation-based verification, we present a corresponding metric that is suitable for the setting of formal verification and describe an algorithmic way to check it.
Introducing Microsoft Windows Vista
Authors: William R. Stanek
Venue:  (2006)

Get a head start with the newest release of Microsoft Windows Vista-with insights from expert author and MVP William Stanek. Preview and evaluate the latest features, capabilities, and improvements to Microsoft Windows®-and hit the ground running.
Domain described support vector classifier for multi-classification problems
Authors: Daewon Lee, Jaewook Lee
Venue: Pattern Recognition (2007)

In this paper, a novel classifier for multi-classification problems is proposed. The proposed classifier, based on the Bayesian optimal decision theory, tries to model the decision boundaries via the posterior probability distributions constructed from support vector domain description rather than to model them via the optimal hyperplanes constructed from two-class support vector machines. Experimental results show that the proposed method is more accurate and efficient for multi-classification problems.
Fully asynchronous behavior of double-quiescent elementary cellular automata
Authors: Nazim Fatès, Éric Thierry, Michel Morvan, Nicolas Schabanel
Venue: Theoretical Computer Science (2006)

In this paper we propose a probabilistic analysis of the fully asynchronous behavior (i.e., two cells are never simultaneously updated, as in a continuous time process) of elementary finite cellular automata (i.e., {0, 1} states, radius 1 and unidimensional) for which both states are quiescent (i.e., (0, 0, 0) ↦ 0 and (1, 1, 1) ↦ 1). It has been experimentally shown in previous works that introducing asynchronism in the global function of a cellular automata was perturbing its behavior, but as far as we know, only few theoretical work exists on the subject. The cellular automata we consider live on a ring of size n and asynchronism is introduced as follows: at each time step one cell is selected uniformly at random and the transition is made on this cell while the others stay in the same state. Among the 64 cellular automata belonging to the class we consider, we show that 9 of them diverge on all non-trivial configurations while the 55 other converge almost surely to a random fixed point. We show that the exact convergence time of these 55 automata can only take the following values: either 0, Θ(n ln n), Θ(n2), Θ(n3 ) or Θ(n2n). Furthermore, the global behavior of each of these cellular automata is fully determined by reading its code.
Quicken 2007 On Demand
Authors: Gina Carrillo
Venue:  (2006)

Learn how to make the most of the latest version of one of the most popular personal finance software applications available with Quickenï¾ 2007 On Demand. This book uses step-by-step, visual instructions to show you how to get up and running quickly using this latest version of Quicken. You will learn how to utilize the program's many features to take control of and monitor your finances, including investments, credit cards, and savings. You'll also learn how to record or download transactions, pay bills online, track and forecast financial goals, and prepare tax reports. Managing your finances has never been easier, thanks to Quickenï¾ 2007 On Demand.
Technical writing
Authors: Diana Patterson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1975)

Some of the success of automated documentation, unavoidably, depends on the final output terminal. All UPPER CASE LETTERS HAVE A TENDANCY TO MAKE BLOCKS OF SOLID TEXT TO BE EXCEEDINGLY DIFFICULT TO READ (AND FULLY JUSTIFIED TEXT MAKES THINGS EVEN WORSE). You want an upper and lower case terminal, clean, even printing, and, probably, the capability to change print faces and paper stock. Not many terminal manufacturers are sensitive to these requirements. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The use of simulation to determine maximum capacity in the surgical suite operating room
Authors: Sarah M. Ballard, Michael E. Kuhl
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Utilizing ambulatory care units at optimal levels has become increasingly important to hospitals from both service and business perspectives. With the inherent variation in hospitals due to unique procedures and patients, performing capacity analysis through analytical models is difficult without making simplifying assumptions. Many hospitals calculate efficiency by comparing total operating room minutes available to total operating minutes used. This metric both fails to account for the required non-value added tasks between surgeries and the delicate balance necessary between having patients ready for surgery when an operating room becomes available, which can result in increased waiting times, and maximizing patient satisfaction. We present a general methodology for determining the maximum capacity within a surgical suite through the use of a discrete-event simulation model. This research is based on an actual hospital concerned with doctor/resource acquisition decisions, patient satisfaction improvements, and increased productivity.
Car PC Hacks
Authors: Damien Stolarz
Venue:  (2005)

A car PC or carputer is a car tricked-out with electronics for playing radio, music and DVD movies, connecting to the Internet, navigating and tracking with satellite, taking photos, and any electronic gadget a person wants in a car. All these devices are managed and controlled through a single screen or interface. The only place car PC enthusiasts can go for advice, tips and tools is a handful of hard-to-find Web sites--until now. Car PC Hacks is your guide into the car PC revolution. Packing MP3 players, handheld devices, computers and video-on-demand systems gives you a pile too heavy to carry. But add a car and put them together, you've got a powerful and mobile multimedia center requiring no lifting. The next time you give kids a lift, you won't hear, "Are we there yet?" Instead, expect "We're there already?" as they won't want to leave the car while playing video games from multiple consoles. Car PC Hacks is the first book available to introduce and entrench you into this hot new market. You can count on the book because it hails from O'Reilly, a trusted resource for technical books. Expect innovation, useful tools, and fun experiments that you've come to expect from O'Reilly's Hacks Series. Maybe you've hacked computers and gadgets, and now you're ready to take it to your car. If hacking is new and you would like to mix cars and computers, this book gets you started with its introduction to the basics of car electrical systems. Even when you're unclear on the difference between amps and watts, expect a clear explanation along with real-life examples to get on track. Whether you're venturing into car PC for the first time or an experienced hobbyist, hop in the book for a joy ride. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A numerical recipe for accurate image reconstruction from discrete orthogonal moments
Authors: Bulent Bayraktar, Tytus Bernas, J. Paul Robinson, Bartek Rajwa
Venue: Pattern Recognition (2007)

Recursive procedures used for sequential calculations of polynomial basis coefficients in discrete orthogonal moments produce unreliable results for high moment orders as a result of error accumulation. This paper demonstrates accurate reconstruction of arbitrary-size images using full-order (orders as large as the image size) Tchebichef and Krawtchouk moments by calculating polynomial coefficients directly from their definition formulas in hypergeometric functions and by creating lookup tables of these coefficients off-line. An arbitrary precision calculator is used to achieve greater numerical range and precision than is possible with software using standard 64-bit IEEE floating-point arithmetic. This reconstruction scheme is content and noise independent.