ppxscal/embedding_network huggingface dataset:
Approximate String Matching: A Simpler Faster Algorithm
Authors: Richard Cole, Ramesh Hariharan
Venue: SIAM Journal on Computing (2002)

We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The first algorithm, which is quite simple, runs in time $O(\frac{nk^3}{m}+n+m)$ on all patterns except k-break periodic strings (defined later). The second algorithm runs in time $O(\frac{nk^4}{m}+n+m)$ on k-break periodic patterns. The two classes of patterns are easily distinguished in O(m)time.
Time and Space Lower Bounds for Nonblocking Implementations
Authors: Prasad Jayanti, King Tan, Sam Toueg
Venue: SIAM Journal on Computing (2000)

We show the following time and space complexity lower bounds. Let $\cal{I}$ be any randomized nonblocking n-process implementation of any object in set A from any combination of objects in set B, where A = {increment, fetch&add, modulo k counter (for any $k \ge 2n$), LL/SC bit, k-valued compare&swap (for any $k \ge n$), single-writer snapshot}, and B = {resettable consensus} $\cup$ {historyless objects such as registers and swap registers}. The space complexity of $\cal{I}$ is at least n-1. Moreover, if $\cal{I}$ is deterministic, both its time and space complexity are at least n-1. These lower bounds hold even if objects used in the implementation are of unbounded size.This improves on some of the $\Omega(\sqrt{n})$ space complexity lower bounds of Fich, Herlihy, and Shavit [i Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, Ithaca, NY, 1993, pp. 241--249; J. Assoc. Comput. Mach., 45 (1998), pp. 843--862]. It also shows the near optimality of some known wait-free implementations in terms of space complexity.
On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
Authors: C. Kirjner-Neto, E. Polak
Venue: SIAM Journal on Optimization (1998)

We consider the problem of minimizing a real-valued function f 0(x)subject to max-min constraints, i.e., constraints of the form ${\rm max}_{k\in{\bf r}}{\rm min}_{j\in{\bf q}_k} f_k^j(x) \le 0$, where for any integer r, ${\bf r} \mathrel{\buildrel\Delta\over={1,,...,r}, so that for any k \in {\bf r,\, q}_k ={1,...,qk}. Problems with this kind of constraint arise in a variety of applications, such as design of electronic circuits subject to manufacturing tolerances and postmanufacturing tuning and optimal steering of mobile robots in the presence of obstacles.An optimization problem with max-min constraints is equivalent to a collection of optimization problems with smooth inequality constraints. This collection can be very large, and hence solving an optimization problem with max-min constraints by solving each member of the collection can be exorbitantly expensive. We present a transcription of problems of this type into a single inequality constrained nonlinear programming problem with smooth constraints, which can be solved using readily available software. The transcription is based on the fact that a set of real numbers contains a nonpositive element if and only if its convex hull contains a nonpositive element. While this fact is fairly obvious, establishing a correspondence between the global and local minimizers of the original problem and those of the problem resulting from our transcription turned out to be quite difficult.The significant advantages of using our transcription are demonstrated by the numerical examples that are included in the paper to illustrate the effectiveness of our approach.
Microsoft Word 2000 Bible, 1st edition
Authors: Brent Heslop, David F. Angell
Venue:  (1998)

:Get up to speed on the world's most popular word processing software with this completely revised and up-to-date reference. The CD-ROM includes Word templates, document examples, links, Internet Explorer, and more.
Building a Web Site for Dummies
Authors: David A. Crowder, Rhonda Crowder
Venue:  (2000)

:Go from Web surfer to site developer with this friendly guide! Includes tips and tricks to jump-start your site development Size up your site needs and create a functional building plan Did you know that the Web is about 15 million sites strong today  and growing? Get it on the action using this friendly guide. Inside, you'll find helpful explanations and shortcuts on creating, publishing, and administering your site, from creating cool graphics to finding free Web space. Discover how to:*Register your site name *Find server space *Create eye-catching pages *Set up a commerce site using the latest tools *Promote your site on the Internet all this on the bonus CD-ROM*Evaluation versions of Paint Shop Pro and HomeSite 4.5 for Windows *Trial versions of Fireworks and Dreamweaver from Macromedia, Inc. *Statbot Micro by Moorglade Design Group
Computer-generated stereograms: a new dimension for the graphic arts
Authors: D. Verne Morland
Venue: ACM SIGGRAPH Computer Graphics (1976)

The discovery of stereopsis in the mid-nineteenth century presented the opportunity to simulate the visual impact of a three-dimensional entity through a pair of two-dimensional, perspective images. Modern image processing techniques now permit the extensive exploration of abstract stereograms, but most recent investigations have focused on scientific rather than aesthetic compositions. This paper describes a complete svstem for the creation of stereo artwork and discusses the implications of using stereoscopy for artistic, "three-dimensional expression.
Vertical implementation
Authors: Arend Rensink, Roberto Gorrieri
Venue: Information and Computation (2001)

We investigate criteria to relate specifications and implementations belonging to conceptually different levels of abstraction. For this purpose, we introduce the generic concept of a vertical implementation relation, which is a family of binary relations indexed by a refinement function that maps abstract actions onto concrete processes and thus determines the basic connection between the abstraction levels. If the refinement function is the identity, the vertical implementation relation collapses to a standard (horizontal) implementation relation. As desiderata for vertical implementation relations we formulate a number of congruence-like proof rules (notably a structural rule for recursion) that offer a powerful, compositional proof technique for vertical implementation. As a candidate vertical implementation relation we propose vertical bisimulation. Vertical bisimulation is compatible with the standard interleaving semantics of process algebra; in fact, the corresponding horizontal relation is rooted weak bisimulation. We prove that vertical bisimulation satisfies the proof rules for vertical implementation, thus establishing the consistency of the rules. Moreover, we define a corresponding notion of abstraction that strengthens the intuition behind vertical bisimulation and also provides a decision algorithm for finite-state systems. Finally, we give a number of small examples to demonstrate the advantages of vertical implementation in general and vertical bisimulation in part.
Java Servlet Programming, 2nd edition
Authors: Jason Hunter, William Crawford
Venue:  (2001)

:A few years ago, the hype surrounding applets put Java on the map as a programming language for the Web. Today, Java servlets stand poised to take Java to the next level as a Web development language. The main reason is that servlets offer a fast, powerful, portable replacement for CGI scripts. The Java Servlet API, introduced as the first standard extension to Java, provides a generic mechanism to extend the functionality of any kind of server. Servlets are most commonly used, however, to extend Web servers, performing tasks traditionally handled by CGI programs. Web servers that can support servlets include: Apache, Netscape's FastTrack and Enterprise Servers, Microsoft's IIS, O'Reilly's WebSite, and JavaSoft's Java Web Server. The beauty of servlets is that they execute within the Web server's process space and they persist between invocations. This gives servlets tremendous performance benefits over CGI programs. Yet because they're written in Java, servlets are far less likely to crash a Web server than a C-based NSAPI or ISAPI extension. Servlets have full access to the various Java APIs and to third-party component classes, making them ideal for use in communicating with applets, databases, and RMI servers. Plus, servlets are portable between operating systems and between servers -- with servlets you can "write once, serve everywhere." Java Servlet Programming covers everything you need to know to write effective servlets and includes numerous examples that you can use as the basis for your own servlets. The book explains the servlet life cycle, showing how you can use servlets to maintain state information effortlessly. It also describes how to serve dynamic Web content, including both HTML pages and multimedia data. Finally, it explores more advanced topics like integrated session tracking, efficient database connectivity using JDBC, applet-servlet communication, inter-servlet communication, and internationalization.
Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization
Venue: Eurographics Symposium on Parallel Graphics and Visualization; Vol. 29 (2002)

Welcome to the fourth Eurographics Workshop on Parallel Graphics and Visualization. It is held every second year in Europe, while our sister event, the IEEE Symposium on Parallel and Large-Data Visualization and Graphics takes place every other year in the USA. Together, we look into the state-of-the-art in parallel visual techniques. This year, we also had a special focus on large-data techniques which are not necessarily parallel.Several changes have taken place since the last time this event was held. Probably the most important change is that the proceedings are now published through ACM SIGGRAPH and will be available in the digital libraries of the ACM and of the Eurographics Association. This gives the contributions to our workshop a much better visibility than in the past years.This time, we received a total of 19 submissions of which we selected 14. Each of the papers was reviewed by at least three members of the international program committee. The number of accepted papers is larger than in previous years because we felt that there are more good submissions which deserve publication beyond the original planned paper limit. Additional to the 14 "regular papers", there are two full papers from our invited speakers.
Regular and irregular multi-resolution terrain models: a comparison
Authors: Leila De Floriani, Paola Magillo
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

The paper deals with the problem of modeling large-size terrain data sets. To this aim, we consider multi-resolution models based on triangle meshes. We analyze and compare two multi-resolution terrain models based on regular and irregular meshes. The two models are viewed as instances of a common multi-resolution model, that we call a multi-resolution triangle mesh. Our comparison takes into account the space requirements of the data structures implementing the two models as well their effectiveness in supporting the extraction of variable-resolution terrain representations.
Inclusion dependencies and their interaction with functional dependencies
Authors: Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou
Venue: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems (1982)

Inclusion dependencies, or INDs (which can say, for example, that every manager is an employee) are studied, including their interaction with functional dependencies, or FDs. A simple complete axiomatization for INDs is presented, and the decision problem for INDs is shown to be PSPACE-complete. (The decision problem for INDs is the problem of determining whether or not &Sigma; logically implies &sigma;, given a set &Sigma; of INDs and a single IND &sigma;). It is shown that finite implication (implication over databases with a finite number of tuples) is the same as unrestricted implications for INDs, although finite implication and unrestricted implication are distinct for FDs and INDs taken together. It is shown that, although there are simple complete axiomatizations for FDs alone and for INDs alone, there is no complete axiomatization for FDs and INDs taken together, in which every rule is k-ary for some fixed k (and in particular, there is no finite complete axiomatization.) This is true whether we consider finite implication or unrestricted implication, and is true even if no relation scheme has more than three attributes. The nonexistence of a k-ary complete axiomatization for FDs and INDs taken together is proven by giving a condition which is necessary and sufficient in general for the existence of a k-ary complete axiomatization.
A general concept for design modification of shell meshes in structural-acoustic optimization: part I: Formulation of the concept
Authors: Steffen Marburg
Venue: Finite Elements in Analysis and Design (2002)

This paper addresses a particular problem that occurs in the structural-acoustic optimization of finite element shells models. After a brief review of approaches and techniques in structural-acoustic optimization, advantages and disadvantages of geometry based models are discussed. It proves that geometry based models account for a general and reasonable type of model preparation for modification and optimization purposes. However, an alternative concept becomes necessary if detailed meshes of thin shell structures shall be analyzed, modified and optimized with respect to acoustic characteristics. The paper will discuss a number of reasons for the requirement of such a concept. This concept consists of defining modification domains, then defining global and several local modification functions in each domain. These global and local modification functions should possess certain properties and can be controlled by variables. Finally, an example is presented and discussed for these types of modification functions.
The Unofficial Guide to Online Investing
Authors: Henry F. Robb, William Arnold
Venue:  (2000)

:Online brokers are ready to roll twenty-four hours a day! Over 4 million people are logging onto the Internet to research stocks, check quotes and make investments online, and the number is growing daily. It's hard to believe that only three years ago the average person hadn't even heard about online investing. And a little over a year ago people in the bricks-and-mortar financial industry didn't believe that online brokerages could compete. Now, the likes of Merrill Lynch, Prudential Securities, and Morgan Staley are rushing to create their own online brokerage sites. In The Unofficial Guide to Investing Online, new and experienced investors learn to: Choose which computer, Internet Service Provider, and investment software is the best for online investing Find the Web sites every online investor must know Pick an online broker and set up an account Monitor investments on- and off-site Evaluate online investment clubs, bulletin boards, discussion forums and news groups, mailing lists, and magazines Avoid the scams and pitfalls of online investing - what happens if the online brokers site crashes? About the Author: Henry Robb is the author of a dozen books on business writing and language. From a family of financiers and investors, he has been investing in stocks, bonds, and other financial instruments for over twenty years. From his home in San Francisco, he trades online every day.
Asymptotics of multivariate sequences: I. Smooth points of the singular variety
Authors: Robin Pemantle, Mark C. Wilson
Venue: Journal of Combinatorial Theory Series A (2002)

Given a multivariate generating function F(z1, ...,zd) = Σ ar1, ...,rd z1r1 ...zdrd, we determine asymptotics for the coefficients. Our approach is to use Cauchy's integral formula near singular points of F, resulting in a tractable oscillating integral. This paper treats the case where the singular point of F is a smooth point of a surface of poles. Companion papers treat singular points of F where the local geometry is more complicated, and for which other methods of analysis are not known.
Wideband CDMA For Third Generation Mobile Communications: Universal Personal Communications, 1st edition
Authors: Tero Ojanpera, Ramjee Prasad
Venue:  (1998)

:Here's an in-depth, comprehensive study of the developmental trends and practical design, planning, and deployment issues associated with wideband CDMA technology. Prepared by two leading authorities in the field, this book evaluates wideband CDMA as an effective third generation technology option, and gives you a clear picture of the various wideband CDMA standardization activities currently underway worldwide. Wireless system engineers responsible for designing wideband CDMA systems will appreciate the book's depth of coverage as it compares a wide array of CDMA design techniques and examines how each affects system performance. The book also describes how third generation system applications will impact radio access system design and...  Compares and contrasts major wideband CDMA standardization proposals, including FRAMES, WCDMA in 3GPP, CDMA2000, and IS-95B  Identifies and describes various air interface access schemes for third and fourth generation mobile communications systems  Analyzes wideband CDMA performance in varying radio environments, and presents simulation results  Discusses the integration of the GSM core network with wideband CDMA 1 Examines the basic principles of CDMA, including IS-95B air interference, and includes details on EDGE/136HS
WebTeach: an integrated web-based cooperative environment for distance teaching
Authors: Franco Bagnoli, Fabio Franci, Andrea Sterbini
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

We present the WebTeach system, currently used at the Engineering Faculty, University of Florence, Italy. The system is composed by three parts: WebCheck, a web database interface for test management; WebTest, a multiple-choices quiz generation system and Web Write, a collaborative web publishing tool.
Global Optimization of 0-1 Hyperbolic Programs
Authors: Mohit Tawarmalani, Shabbir Ahmed, Nikolaos V. Sahinidis
Venue: Journal of Global Optimization (2002)

We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch and bound algorithm for 0-1 hyperbolic programs. The main feature of the algorithm is that it reformulates the problem at every node of the search tree. We demonstrate that this algorithm has a superior convergence behavior than directly solving the relaxation derived at the root node. The algorithm is used to solve a discrete i>p-choice facility location problem for locating ten restaurants in the city of Edmonton.
MCSE: Windows 2000 Network Infrastructure Administration Study Guide, 2nd edition
Authors: Michael Chacon, James Chellis
Venue:  (2001)

:Here's the book you need to prepare for Exam 70-216, Implementing and Administering a Microsoft Windows 2000 Network Infrastructure. This study guide provides: * In-depth coverage of every exam objective-all the information you need * Practical information on managing a Windows 2000 network infrastructure * Hundreds of challenging review questions, in the book and on the CD * Leading-edge exam preparation software, including a testing engine and electronic flashcards Authoritative coverage of all exam objectives, including: * DNS in a Windows 2000 network infrastructure * DHCP in a Windows 2000 network infrastructure * Remote access in a Windows 2000 network infrastructure * Network protocols in a Windows 2000 network infrastructure * WINS in a Windows 2000 network infrastructure * IP routing in a Windows 2000 network infrastructure * Certificate Services CD Description The enclosed CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine for the Windows 2000 Network Infrastructure Administration exam. Loaded with hundreds of practice questions, the CD lets you test yourself chapter by chapter or according to objective areas. You'll also find electronic flashcards for your PC and Palm devices, two bonus exams that will help you ready yourself for the test, WinSim 2000 product simulation software, and a fully searchable electronic version of this book and the Dictionary of Networking..
Hemicube shooting for non-diffuse global illumination
Authors: György Antal, László Szirmay-Kalos, Ferenc Csonka
Venue: Proceedings of the 18th spring conference on Computer graphics (2002)

The hemicube is a classical tool to transfer the light power in diffuse radiosity algorithms. The main advantage of the hemicube based light transfer is that the visible patches can easily be identified by the graphics hardware. This paper extends the hemicube approach to solve the non-diffuse global illumination problem. In order to get rid of the quadratic complexity of classical radiosity algorithms and to allow specular surfaces without storing directional finite-elements, the original iteration is replaced by stochastic iteration. Unlike classical iteration where all patches should be selected to gather the radiosity or to shoot their unshot radiosity, stochastic iteration can exploit that a randomly selected patch may represent its neighbours as well, thus accurate results can be obtained even if just a fraction of patches are selected at all. Since stochastic iteration requires just a random approximation of the patch radiance, it can use just a single variable per patch even if the general, non-diffuse problem is attacked. Random selection, however, may introduce noise that is particularly significant where the source and receiver patches are close. We also propose a solution strategy to eliminate these artifacts. The paper also discusses further improvements by applying constant radiance step and by the randomization of the hemicube.
Wireless LANs: Implementing Interoperable Networks, 1st edition
Authors: Jim T. Geier
Venue:  (1998)

:Wireless LANs: covers how and why to migrate from proprietary solutions to the 802.11 standard; explains how to realize significant cost savings through wireless LAN implementation for data collection systems; covers how to counteract common problems such as radio frequency interference; and discusses the details of upgrading from existing 902 MHz to 2.4 GHz network.
Modeling for Design Using AutoCAD AME and AutoSurf, 1st edition
Authors: James E. Bulluyt, Michael D. Stewart, Adebisi Oladipupo
Venue:  (1994)

:This book combines a successful step-by-step method for learning the underlying concepts of surface and solid modeling with specific instruction in how to use AutoCad* Release 12, AutoCad's solid modeler AME', and the AutoSurf* surface modeling tool from Autodesk. The book provides an excellent practical introduction to surface and solid modeling for a wide range of graphics and CAD applications. Working with this book, users learn how to use AutoCad AME' and AutoSurf' as true design tools rather than merely learning to follow "button-pushing" sequences by rote. Bound in is an IBM PC 3-1/2" disk containing examples and exercises that give users a head start in completing 3D modeling projects presented in the book.