ppxscal/embedding_network huggingface dataset:
Generalized Solutions in Nonlinear Stochastic Control Problems
Authors: F. Dufour, Boris M. Miller
Venue: SIAM Journal on Control and Optimization (2001)

An optimal stochastic control problem is considered for systems with unbounded controls satisfying an integral constraint. It is shown that there exists an optimal control within the class of generalized controls leading to impulse actions. Applying an approach of time transformation, developed recently for deterministic systems, the original control problem is shown to be equivalent to an optimal stopping problem. Moreover, the description of generalized solutions is given in terms of stochastic differential equations governed by a measure.
Suboptimal measures of predictive complexity for absolute loss function
Authors: V. V. V'yugin
Venue: Information and Computation (2002)

The problem of existence of predictive complexity for the absolute loss game is studied. Predictive complexity is a generalization of Kolmogorov complexity which bounds the ability of any algorithm to predict elements of a sequence of outcomes. For perfectly mixable loss functions (logarithmic and squared difference are among them) predictive complexity is defined like Kolmogorov complexity to within an additive constant. The absolute loss function is not perfectly mixable, and the question of existence of the corresponding predictive complexity, which is defined to within an additive constant, is open. We prove that in the case of the absolute loss game the predictive complexity can be defined to within an additive term O (), where n is the length of a sequence of outcomes. We prove also that in some restricted settings this bound cannot be improved.
Intelligent Broadband Networks, 1st edition
Authors: Heinrich Hussman
Venue:  (1998)

:Intelligent Networks (IN) are driven by 'inferencing engines' which monitor traffic flow information to automatically manage transmission, connection and service allocation across themselves. Signaling intelligent networks can handle and control complex multimedia services. Relating to practical system development, this title provides an excellent overview of the current status and future trends in broadband network evolution and multimedia services.
An improved method for creating dynamic web forms using APL
Authors: Steven J. Halasz
Venue: Proceedings of the international conference on APL-Berlin-2000 conference (2000)

The subject of this paper is "active" or "dynamic" web forms handled by Dyalog APL running on a web server. With "active" web forms, the HTML which specifies form controls is generated dynamically by a server program, in contrast to "static" web forms in which the HTML is fixed and does not vary from one page hit to the next. Also, I will be discussing only "thin client" approaches which minimize the amount of code which runs on the client machine. The method shown, which I call a "standard template" method, allows source pages to be maintained with visual tools such as Macromedia Dreamweaver and minimizes the amount of coding required when new forms are created in the same general format.
Global Consistency of Tolerances: Proceedings of the 6th CIRP International Seminar on Computer-Aided Tolerancing, University of Twente, Enschede, The
Authors: Fred Van Houten, Hubert Kals
Venue:  (1999)

:This book contains selected contributions from the 6th CIRP International Seminar on Computer-Aided Tolerancing, which was held on 22-24 March, 1999, at the University of Twente, Enschede, The Netherlands. This book is well suited to users of new generation CADCAM systems who want to use the available tolerancing possibilities properly. It can also be used as a starting point for research activities.
Java Elements: Principles of Programming in Java, 1st edition
Authors: Duane A. Bailey, Duane W. Bailey
Venue:  (1999)

:This book was written for the first course in Computer Science. The content of this text will fit in well at mid to upper level schools for the computer science major. The book contains over 20,000 lines of Java code that are unique to this book. The source code, as well as other electronic material, will be available on the McGraw-Hill website.
Review of How to Solve It: Modern Heuristics: Zbigniew Michalewicz and David B Fogel
Authors: Hassan Masum
Venue: ACM SIGACT News (2001)

How to Solve It is a friendly gem of a book which introduces the basic principles of traditional optimization, evolutionary optimization, neural nets, and fuzzy methods. In the spirit of Polya's classic of the same name, the authors emphasize the "how and why" of the problem-solving process, constantly prodding the reader to stop and solve subproblems, or come up with new heuristics, or indeed question whether or not the problem has been posed correctly in the first place.This book is clear, concise, and fun to read. It is not a handbook of heuristics, but rather an accessible high-level overview of the pros, cons, and applicability of the major categories of heuristic methods, with particular emphasis on optimization methods utilizing evolutionary computation. The presentation is lucid, and the authors do a good job of picking out key properties of algorithms and problem domains. The only prerequisites are basic mathematics and some problem-solving talent.
Residue Number Systems: Algorithms and Architectures
Authors: P. V. Mohan
Venue:  (2002)

:"This text is an excellent reference for both professional and academic researchers in the field of VLSI using residue number systems. It is also of interest to those working in the general fields of VLSI design, DSP design, and cryptography." Residue Number Systems: Algorithms and Architectures is also suitable for a graduate-level course as part of a VLSI curriculum.
Introduction to the Internet for Education
Authors: Daniel J. Kurland, Richard M. Sharp, Vicki F. Sharp
Venue:  (1996)

:Because of the astronomical rise in interest for technology in classrooms across the nation along with the proliferation of computers and technology in the schools, the Internet has become integral to the education major. Consequently, we have come up with a short and inexpensive supplemental book that will guide first time users or experienced users on how to use the Internet in education.
A WFS-based mediation system for GIS interoperability
Authors: Omar Boucelma, Mehdi Essid, Zoé Lacroix
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

The proliferation of spatial data on the Internet is beginning to allow a much wider access to data currently available in various Geographic Information Systems (GIS). In order to move to a real Web-based community where geographical data can be accessed and exchanged, we need to provide flexible and powerful GIS data integration solutions. Indeed, GIS are highly heterogeneous: not only they differ by their data representations, but they also offer radically different query languages. A GIS mediation approach should provide (1) an integrated view of the data supplied by all sources, and (2) a geographical query language to access and manipulate integrated data.In this paper we propose an approach that not only focuses on the data integration, but also addresses the integration of query capabilities available at the sources. A GIS may provide a query capability inexistent at another GIS, whereas two query capabilities may be similar but with a slightly different semantics. We introduce the notion of derived wrappers that capture additional query capabilities to either compensate capabilities lacking at a source, or to adjust an existing capability in order to make it homogeneous with other similar capabilities, wrapped at other sources. Finally we describe the implementation of the presented approach that complies with OpenGIS WFS recommendation.
MCSE Windows NT Server 4 in the Enterprise for Dummies with CD-ROM, 1st edition
Authors: Kenneth Majors, Dave Dermon, Jeffrey Ferris
Venue:  (1998)

:Complete with a CD-ROM loaded with exam questions written just for this book by Microsoft-certified experts, MCSE Windows NT Server 4 in the Enterprise For Dummies brings you everything you need to pass the exam - and make every second count!
Sed and AWK Pocket Reference, 2nd edition
Authors: Arnold Robbins
Venue:  (2002)

:For people who create and modify text files, sed and awk are power tools for editing. sed, awk, and regular expressions allow programmers and system administrators to automate editing tasks that need to be performed on one or more files, to simplify the task of performing the same edits on multiple files, and to write conversion programs. The sed, awk, and Regular Expressions Pocket Reference is a companion volume to sed awk, 2nd Edition, and Unix in a Nutshell. This small book is a handy reference guide to the information presented in the larger volumes, presenting a concise summary of regular expressions and pattern matching, and summaries of sed and awk.
Implementing DITA XML in a production environment
Authors: Susan G. Carpenter
Venue: Proceedings of the 20th annual international conference on Computer documentation (2002)

This paper describes one information development team's experience with implementing a prototype XML vocabulary in a production environment. This implementation included the migration of pre-existing content, the writing of XSLT and Perl scripts to direct migration and production, and the training of team members.
WebThumb: interaction techniques for small-screen browsers
Authors: Jacob O. Wobbrock, Jodi Forlizzi, Scott E. Hudson, Brad A. Myers
Venue: Proceedings of the 15th annual ACM symposium on User interface software and technology (2002)

The proliferation of wireless handheld devices is placing the World Wide Web in the palms of users, but this convenience comes at a high interactive cost. The Web that came of age on the desktop is ill-suited for use on the small displays of handhelds. Today, handheld browsing often feels like browsing on a PC with a shrunken desktop. Overreliance on scrolling is a big problem in current handheld browsing. Users confined to viewing a small portion of each page often lack a sense of the overall context --- they may feel lost in a large page and be forced to remember the locations of items as those items scroll out of view. In this paper, we present a synthesis of interaction techniques to address these problems. We implemented these techniques in a prototype, WebThumb, that can browse the live Web.
Edutopia: Success Stories for Learning in the Digital Age, 1st edition
Authors: Milton Chen
Venue:  (2002)

:Edutopia offers a tantalizing glimpse into the classrooms of innovative educators who are using technology to connect with students, colleagues, the local community, and the world beyond. Edutopia offers a unique perspective on education in which technology is employed to make schools more exciting and dynamic for everyone involved -- students work on real-world projects and consult with the best outside experts; teachers learn by tapping into the best people and practices in their field; and classrooms regularly connect with the rich resources of their communities and the world beyond. A lively resource that teachers and parents will want to refer to again and again, Edutopia is filled with more than forty full-color photos, has a useful resource section, and comes with a unique CD-ROM that contains more than seventy minutes of video footage of these classrooms in action.
Window Query Processing in Linear Quadtrees
Authors: Ashraf Aboulnaga, Walid G. Aref
Venue: Distributed and Parallel Databases (2001)

The linear quadtree is a spatial access method that is built by decomposing the spatial objects in a database into quadtree blocks and storing these quadtree blocks in a B-tree. The linear quadtree is very useful for geographic information systems because it provides good query performance while using existing B-tree implementations. An algorithm and a cost model are presented for processing window queries in linear quadtrees. The algorithm can handle query windows of any shape in the general case of spatial databases with overlapping objects. The algorithm recursively decomposes the space into quadtree blocks, and uses the quadtree blocks overlapping the query window to search the B-tree. The cost model estimates the I/O cost of processing window queries using the algorithm. The cost model is also based on a recursive decomposition of the space, and it uses very simple parameters that can easily be maintained in the database catalog. Experiments with real and synthetic data sets verify the accuracy of the cost model.
Programming the World Wide Web, 1st edition
Authors: Robert W. Sebesta
Venue:  (2001)

:B> Robert Sebesta is the author of the worldUs leading book on comparative programming languages, Concepts of Programming Languages. Hundreds of thousands of people have learned how to program from his books. He has written Programming the World Wide Web not just as a reference of various methods for programming the WWW, but rather to focus in on the core concepts that web programmers must understand. This book provides readers with a comprehensive introduction to the programming and scripting languages currently used to create web sites and applications. In this holistic approach, readers are guided through concepts relating to client-side and server-side programming, including JavaScript, Perl, Java Servlets, Java Applets, Web Databases, and the Apache Web Server. This book is ideal for readers with knowledge of Java or C programming, as well as programmers looking to expand their skills onto the World Wide Web.
OCR with a Smile!: An Operator's Guide to Optical Character Recognition
Authors: Fred F. Ross
Venue:  (1998)

:This book is about Optical Character Recognition (OCR) Systems; how to operate them for maximum throughput and achieve the highest possible accuracy in the process. With this comprehensive reference you will get a clear idea of what must be done and how to start doing it when no software manual addresses your specific problem.
Linear-Time Preprocessing in Optimal Numerical Range Partitioning
Authors: Tapio Elomaa, Juho Rousu
Venue: Journal of Intelligent Information Systems (2002)

Only a subset of the boundary points&mdash;the segment borders&mdash;have to be taken into account in searching for the optimal multisplit of a numerical value range with respect to the most commonly used attribute evaluation functions of classification learning algorithms. Segments and their borders can be found efficiently in a linear-time preprocessing step.In this paper we expand the applicability of segment borders by showing that inspecting them alone suffices in optimizing any convex evaluation function. For strictly convex evaluation functions inspecting all segment borders is also necessary. These results are derived directly from Jensen's inequality.We also study the evaluation function Training Set Error which is not strictly convex. With that function the data can be preprocessed into an even smaller number of cut point candidates, called alternations, when striving for optimal partition. Examining all alternations also seems necessary, since&mdash;analogously to strictly convex functions&mdash;the placement of neighboring cut points affects the optimality of an alternation. We test empirically the reduction of the number of cut point candidates that can be obtained for Training Set Error on real-world data.
On admission control and scheduling of multimedia burst data for CDMA systems
Authors: Yu-Kwong Kwok, Vincent K. N. Lau
Venue: Wireless Networks (2002)

In order to support transmissions of multimedia data (high data rate and burst) with performance guarantees in a wideband CDMA system, it is crucial to design a judicious algorithm for burst data admission control and scheduling. However, in the current literature there are only simple techniques (such as first-come-first-served and equal sharing) suggested for tackling the problem. Indeed, these existing schemes are not designed for optimizing the precious bandwidth resources while providing performance guarantees (e.g., a user admitted with a certain data rate can enjoy the assigned rate without interruption). In this paper, we first present our novel integer programming formulation of the burst data admission control and scheduling problem. The objective of the optimization can be maximizing the utilization of the bandwidth resources or minimizing the delays of the user transmissions. Taking into account all the important factors such as mobility, power control, and soft handoff, our formulation induces an algorithm for generating an optimal admission control solution which consists of: (1) the burst data rate (in terms of the number of channels); (2) the burst duration; and (3) the burst start time. For practical implementation, we also suggest a near-optimal version of the algorithm, which is evaluated via static and dynamic simulations, and comparisons with two existing schemes.
Initial Values for the Inverse Toeplitz Eigenvalue Problem
Authors: Dirk Laurie
Venue: SIAM Journal on Scientific Computing (2000)

We show how to find a symmetric Toeplitz matrix whose eigenvalues are close to a specified target set of n real numbers.
A framework for facial surgery simulation
Authors: R. M. Koch, S. H. M. Roth, M. H. Gross, A. P. Zimmermann, H. F. Sailer
Venue: Proceedings of the 18th spring conference on Computer graphics (2002)

The accurate prediction of the post-surgical facial shape is of paramount importance for surgical planning in facial surgery. In this paper we present a framework for facial surgery simulation which is based on volumetric finite element modeling. We contrast conventional procedures for surgical planning against our system by accompanying a patient during the entire process of planning, medical treatment and simulation. In various preprocessing steps a 3D physically based facial model is reconstructed from CT and laser range scans. All geometric and topological changes are modeled interactively using Alias.&trade; Applying fully 3D volumetric elasticity allows us to represent important volumetric effects such as incompressibility in a natural and physically accurate way. For computational efficiency, we devised a novel set of prismatic shape functions featuring a globally C1-continuous surface in combination with a C0 interior. Not only is it numerically accurate, but this construction enables us to compute smooth and visually appealing facial shapes.
Special Edition Using XML, 2nd edition
Authors: David Gulbransen
Venue:  (2002)

:Special Edition Using XML, Second Edition gives developers a formal introduction to XML technology, starting with in-depth coverage of basic syntax and fundamental "pieces" of XML, including DTDs, Schemas, and Namespaces. The authors then cover various applications of XML, including transforming and displaying XML documents using CSS and XSL, locating data within XML documents using Xpath, Xlink and Xpointer, programming XML with SAX or DOM, including XML in Java or .NET applications, XML Scripting with Perl, XHTML and WML for presentation on traditional and hand-held Web browsers, and querying data or documents with Xquery. The final chapters cover technologies related to XML such as SVG, SMIL, and RDF, focusing on the practical features developers can put to use today.
Networking lessons in delivering &lsquo;Software as a Service&rsquo;---part I
Authors: David Greschler, Tim Mangan
Venue: International Journal of Network Management (2002)

This is a two-part paper. In part I, we describe the origins of Software as a Service (SaaS) and its value proposition to Corporate IT, Service Providers, Independent Software Vendors, and End Users. In part II, we examine the networking lessons learned in researching, building, and running a SaaS service.
Signal Coding & Processing, 2nd edition
Authors: Graham Wade, J. G. Wade
Venue:  (1994)

:A revised and greatly expanded edition of a textbook originally published in 1987 provides a thorough introduction to the complex fields of signal coding and signal processing, complete with problems and solutions. It will be a useful reference for engineers as well as undergraduate students.
Special Edition Using Act! 2000
Authors: Curtis Knight, Nancy Sparks
Venue:  (1999)

:Special Edition Using ACT! 2000 anticipates your needs as an everyday user and supports you ergonomically. You will be quite able to navigate and utilize the information in the text no matter your ultimate goal might be. You may look at the text from a mainly referential organization, with task-based tutorials offered to augment and support your experience. With the use of indices, jump tables, margin notes, and exercise tracks, you should have no trouble navigating the text and making full use of all the information provided.
Data Communication and Networks: An Engineering Approach
Authors: David Harle, James R. Irvine
Venue:  (2000)

:Data Communications and Networks uses a top-down, Internet-focussed approach to tackle the problem of communication system design. An integrated method is taken to networks and data communications, with an emphasis that starts from the top level requirements and works downwards, describing how such requirements are fulfilled by lower layers of the transmission chain. While the book contains sufficient detail to provide an excellent foundation, clarity is paramount and care is taken not to swamp the reader with information to the point where the underlying concepts are obscured.
Interactive analysis and display of the electroencephalogram (EEG) in real time
Authors: A. S. Gevins, C. L. Yeager, S. L. Diamond
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

The development of fast, relatively inexpensive graphics terminals permits the integration of interactive display with on-line, real time signal analysis in dedicated minicomputer systems. Interactive display in the context of electroencephalogram (EEG) analysis includes: 1. control over form and parameters of an isometric plot using hidden line suppression and floating level; 2. selection of function and transform to graph; and 3. expansion or contraction of coordinate axes and time scale, from "wide angle" views of the course of several hours of recording of the entire scalp, to "telescopic" blow-ups of the details of two or three seconds of activity in a single channel.The analysis paradigms function on-line and in real time, and incorporate parallel time domain and spectral analysis on data from eight or fewer electrode placements. Spectral estimates of power and simple coherences are typically formed using ensemble averages of non-overlapping one-half to two second periodograms obtained by Fast Fourier Transform. Transient analysis uses heuristic strategies to isolate clinically significant patterns, such as the sharp paroxysmal wave forms associated with the epilepsies. Instrumental and extra-cerebral artifacts are partially eliminated by algorithms based upon heuristic criteria. Parameters of spectral and transient analysis are interactively alterable to facilitate varying experimental paradigms.To implement such systems, which can be both compute and I/0 bound, it is necessary to optimize systems software. A simple and multitasking executive coordinates program task modules. Memory space and computing time are conserved through extensive use of dynamic buffer allocation and double precision integer arithmetic.
Resolution Proofs of Matching Principles
Authors: Alasdair Urquhart
Venue: Annals of Mathematics and Artificial Intelligence (2003)

This paper discusses current techniques for proving lower bounds on the size of resolution proofs from sets of clauses expressing assertions about matchings in bipartite graphs (a class including the well-known pigeon-hole clauses). The techniques are illustrated by demonstrating an improved lower bound for some examples discussed by Kleine B&uuml;ning. The final section discusses some problems where current techniques appear inadequate, and new ideas seem to be required.