ppxscal/embedding_network huggingface dataset:
Windows Multi-DBMS Programming: Using C Plus Plus, Visual Basic, ODBC & Tools for DBMS Projects (with Diskette)
Authors: Ken E. North
Venue:  (1994)

:This book on Windows database programming uses a new Windows programming interface, Open Database Connectivity (ODBC), created by Microsoft. Allows programmers to write portable object-oriented database applications using different languages and protocols that run together on Windows. The CD-ROM includes 20 demonstration programs. Gives full profiles of the products that support ODBC and has example programs in C++ and Visual Basic 3. The disk includes source code that can be used to develop software and value-added software that expands on the example programs in the book. 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 Characterization of Bent Functions in Terms of Strongly Regular Graphs
Authors: Anna Bernasconi, Bruno Codenotti, Jeffrey M. VanderKam
Venue: IEEE Transactions on Computers (2001)

In this note, we prove that bent functions can be precisely characterized in terms of a special class of strongly regular graphs, thus providing a positive answer to a question raised in the paper ¿Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem.¿
Service specific anomaly detection for network intrusion detection
Authors: Christopher Krügel, Thomas Toth, Engin Kirda
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

The constant increase of attacks against networks and their resources (as recently shown by the CodeRed worm) causes a necessity to protect these valuable assets. Firewalls are now a common installation to repel intrusion attempts in the first place. Intrusion detection systems (IDS), which try to detect malicious activities instead of preventing them, offer additional protection when the first defense perimeter has been penetrated. ID systems attempt to pin down attacks by comparing collected data to predefined signatures known to be malicious (signature based) or to a model of legal behavior (anomaly based).Anomaly based systems have the advantage of being able to detect previously unknown attacks but they suffer from the difficulty to build a solid model of acceptable behavior and the high number of alarms caused by unusual but authorized activities. We present an approach that utilizes application specific knowledge of the network services that should be protected. This information helps to extend current, simple network traffic models to form an application model that allows to detect malicious content hidden in single network packets. We describe the features of our proposed model and present experimental data that underlines the efficiency of our systems.
The Java developers almanac 1.4
Authors: Patrick Chan
Venue:  (2002)

The Java Developers Almanac 1.4 is the most up-to-date and complete quick reference for the Java Class LibrariesJDK1.0, 1.1, and J2SE v1.2, v1.3. (Due to space constraints, the javax.swing.plaf. packages are not included.) No other quick reference includes as much information in a single convenient volume. Information from 2,100 classes and 24,000 members is carefully formatted and arranged for easy lookup. In this book you will find: * More than 300 examplets that succinctly demonstrate the most common operations for a package * More than 300 examplets that succinctly demonstrate the most common operations for a package * More than 300 examplets that succinctly demonstrate the most common operations for a package * An extensive cross-reference section * Detailed analysis of API changes for each major release * Quick reference information for the language, the virtual machine, Java Native Interface, PersonalJava platform, and more. No matter what level programmer you are, you will find this book an invaluable tool for everyday developments.
Configuration prefetching techniques for partial reconfigurable coprocessor with relocation and defragmentation
Authors: Zhiyuan Li, Scott Hauck
Venue: Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays (2002)

One of the major overheads for reconfigurable computing is the time it takes to reconfigure the devices in the system. This overhead limits the speedup possible in this paradigm. In this paper we explore configuration prefetching techniques for reducing this overhead. By overlapping the configuration loadings with the computation on the host processor the reconfiguration overhead can be reduced. Our prefetching techniques target to the reconfigurable systems containing a Partial Reconfigurable FPGA with Relocation + Defragmentation (R+D model) since the R+D FPGA showed high hardware utilization. We have investigated various techniques including static configuration prefetching, dynamic configuration pre-fetching, and hybrid prefetching. We have developed prefetching algorithms that significantly reduce the reconfiguration overhead.
A context vector model for information retrieval
Authors: Holger Billhardt, Daniel Borrajo, Victor Maojo
Venue: Journal of the American Society for Information Science and Technology (2002)

In the vector space model for information retrieval, term vectors are pair-wise orthogonal, that is, terms are assumed to be independent. It is well known that this assumption is too restrictive. In this article, we present our work on an indexing and retrieval method that, based on the vector space model, incorporates term dependencies and thus obtains semantically richer representations of documents. First, we generate term context vectors based on the co-occurrence of terms in the same documents. These vectors are used to calculate context vectors for documents. We present different techniques for estimating the dependencies among terms. We also define term weights that can be employed in the model. Experimental results on four text collections (MED, CRANFIELD, CISI, and CACM) show that the incorporation of term dependencies in the retrieval process performs statistically significantly better than the classical vector space model with IDF weights. We also show that the degree of semantic matching versus direct word matching that performs best varies on the four collections. We conclude that the model performs well for certain types of queries and, generally, for information tasks with high recall requirements. Therefore, we propose the use of the context vector model in combination with other, direct word-matching methods.
Peter Coffee Teaches PCs, 1st edition
Authors: Peter Coffee
Venue:  (1998)

:Personal computing might seem to be nearing a sort of maturity. The beige box you buy today is faster, and has more data storage capacity, than the PCs of fifteen years ago, but most people are still running the same basic applications that we ran on those early machines: spreadsheets, word processors, databases, and of course the latest games. The real growth in PC power, however, is not in the box on the desktop, or even in the notebook-sized device that we carry with ease. The real explosion of power is in the devices that plug into our PCs, turning them into intelligent hubs for refining and storing richer forms of data. New digital cameras, for example, combine raw image sensing with editing and artistic options that used to require a high-end graphics workstation. Instead of making you wait while the camera stores the image, the newest cameras have generous memory buffers that let you capture an action sequence. You can take the next step to full-scale digital video: you can either capture bits to begin with, using new digital tape formats, or you can digitize your old home VHS tapes with a simple MPEG compressor. One 100 MB Zip disk can hold seven minutes of broadcast-quality video, or you can go to larger-capacity storage devices and store hours of memories in durable form. Digital voice recorders now capture the level of detail that's needed for reliable speech recognition, while page scanners come with ever more accurate optical character recognition software: either option reduces the need for typing. Wireless connections, and intelligent protocols like Sun's new Jini, will let us interconnect these smart devices without cumbersome plugs and sockets or complex configuration. Whether the goal is to inform, or to entertain, future PCs will make it easier. 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
Perspectives on software product lines: report on first international workshop on software product lines: economics, architectures, and implications workshop #15 at 22nd international conference on software engineering (ICSE)
Authors: Peter Knauber, Giancarlo Succi
Venue: ACM SIGSOFT Software Engineering Notes (2001)

Product line engineering is a concept that has emerged in the 80's in the business schools and is now among the hottest topics in software engineering.Software product lines aim at achieving scope economies through synergetic development of software products. Diverse benefits like cost reduction, decreased time-to-market, and quality improvement can be expected from reuse of domain-specific software assets. But also non-technical benefits can be expected as result of network externalities, product branding, and sharing organizational costs.Product lines introduce additional complexity. In a sense they go against the common adage of "divide and conquer." Planning and/or developing of more than one product at a time have to be managed technically and organizationally.However, the rate of innovation of the technology and the intrinsic nature of software products do not let alternatives to developers: users like to jump into the bandwagon of new products, and old products often drive preferences to new products.Research has been conducted in software product lines for the past few years. Some of it has focused on demonstrating that existing systems and approaches were indeed instrumental for product line development, such as generative techniques, domain analysis and engineering and software components. Another portion of the research effort has tried to determine how it is possible to create a comprehensive methodology and an associated tool for product lines, starting from the business idea of line of products down to the development of a product and trying to exploit all the possible synergies existing at each phase, from network externalities to component reuse.
ArcView GIS/Avenue Developer's Guide with 3.5 Disk, 3rd edition
Authors: Amir H. Razavi
Venue:  (1999)

:The ArcView GIS/Avenue Developer's Guide shows how to customize the ArcView 3.x interface and develop individualized applications using Avenue, a simple but sophisticated object oriented development language. This book provides a practical, rapid introduction to object oriented programming languages, and easy-to-use instructions and examples in writing scripts for all ArcView GIS functions." "Whether you're completely new to object oriented development languages or an experienced developer requiring quick access to information on Avenue, you'll find this guide valuable.
Adobe PageMaker: MacIntosh Version 6
Authors: Adobe Press
Venue:  (1995)

:Classroom in a Book: Adobe PageMaker for Macintosh covers ten lessons that allow you to maximize the power, extensibility and sophistication of the world's leading publishing program, using the tools and features of Adobe PageMaker with the CD's professionally created electronic files. Classroom in a Book: Adobe PageMaker for Macintosh supports Adobe PageMaker version 6 or later. Topics covered include using the tool and control palettes, importing text and graphics, cropping, sizing and linking graphics, applying special type effects, working with groups and layers, defining colors and tints, creating and editing styles, assembling multiple master pages, building custom libraries, creating custom templates, converting files to PDF formats, and preparing files for final output.
Voices from the Net
Authors: Clay Shirky
Venue:  (1995)

:Hosting philosophers and rebels, historymakers and historians, the net has more friction and fewer rules than the Annual Meeting of Anarchists. Still, on the Internet stage, people from everywhere continue to rapidly develop a unique and fascinating culture of their own, complete with all the benefits, and problems, of a real-life society. In Voices from the Net, author Clay Shirky takes you on a tour of the communities of the net - a tour that shows you where and how they form, and how they have made the Internet the most dynamic, far-reaching online phenomenon to date. It is only in the cyberspace communities on the net that webs of words become more vital than their counterparts in the "real" world. Drawing from many arenas and many voices, the author weaves together the threads of individuality and community that gather the net into one fabric where groups of people create their own online universe. Although many of the voices in Voices from the Net aren't in tune, you'll find that they form a fascinating choir that is as full as the net itself. 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
300 Best Aviation Web Sites
Authors: John Allen Merry
Venue:  (1999)

:The quick-access,easy-to-follow A-to-Z directory to the aviation world in cyberspace. Packed with 150 new sites,this guide is completely updated with current rankings and descriptions of all featured sites. Online updates are available at the book's corresponding web site maintained by author. A runaway bestseller! "Best of the best. . . save[s] you search time when browsing for aviation topics. "AOPA Pilot. "If you don't have time to sift through lots of mediocre aviation Web sites. . . John A. Merry catalogs the best. "Flying Magazine. The only aviation-dedicated Internet directory out there,300 Best Aviation Web Sites. . . and 100 More Worth Bookmarking quickly narrows the field,giving you the cream of the cropthe best,award-wining aviation sites in cyberspace. Now expanded with 150 new sites,this time-saving,cut-to-the-chase guide grades each topically organized Web site on content,design,functionality,and overall intended audience. Ratings are indicated on a one-to-five "plane" scale (five is best) and are paired with clever,engaging reviews. Page after page,300 Best Aviation Web Sites features: 150 new sites; additional category-airlines; contact e-mail addresses for each site; the information you want with categorized,alphabetized listings,summaries,rankings,URLs,and online updates; "hidden gem" aviation sites; heads-up warnings of advance fee requirements; searching tips that save time both inside and outside Web sites; step-by-step instructions for first-time Web users. 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
Soft digital signal processing
Authors: Rajamohana Hegde, Naresh R. Shanbhag
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2001)

In this paper, we propose a framework for low-energy digital signal processing (DSP), where the supply voltage is scaled beyond the critical voltage imposed by the requirement to match the critical path delay to the throughput. This deliberate introduction of input-dependent errors leads to degradation in the algorithmic performance, which is compensated for via algorithmic noise-tolerance (ANT) schemes. The resulting setup that comprises of the DSP architecture operating at subcritical voltage and the error control scheme is referred to as soft DSP. The effectiveness of the proposed scheme is enhanced when arithmetic units with a higher "delay imbalance" are employed. A prediction-based error-control scheme is proposed to enhance the performance of the filtering algorithm in the resence of errors due to soft computations. For a frequency selective filter, it is shown that the proposed scheme provides 60-81% reduction in energy dissipation for filter bandwidths up to 0.5&pi; (where 2&pi; corresponds to the sampling frequency fs) over that achieved via conventional architecture and voltage scaling, with a maximum of 0.5-dB degradation in the output signal-to-noise ratio (SNRO). It is also shown that the proposed algorithmic noise-tolerance schemes can also be used to improve the performance of DSP algorithms in presence of bit-error rates of up to 10&minus;3 due to deep submicron (DSM) noise.
Learn Java with JBuilder 6
Venue:  (2002)

Learn Java with JBuilder 6 teaches you how to become a productive JBuilder developer by creating bite-size examples that introduce new aspects of the Java programming language and the core Java libraries. Learn to use many of the JBuilder wizards and JavaBeans Express to automatically generate the common development framework, leaving you to just fill-in the business logic. Build and connect JavaBean components in JBuilder's drag-and-drop development environment. Learn to utilize the Model-View-Controller architecture found in Swing's GUI components to build complex user interfaces. Learn about multithreading and how to debug multithreaded programs, and much more! Author is a leading authority on Java technology. Features a chapter on JBuilder for wireless technologies. Can be used as a predecessor to other Java titles available from Apress.
Distributed shared memory: experience with Munin
Authors: J. K. Bennett, J. B. Carter, A. L. Cox, E. N. Elnozahy, D. B. Johnson, P. Keleher, W. Zwaenepoel
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

Distributed shared memory (DSM) is the provision in software of a shared memory programming model on a distributed memory machine [6]. We are exploring the use of DSM in a cluster-based computing environment of workstations and servers connected by a local internetwork.We have concentrated so far on using DSM to program compute-intensive tasks on networks of workstations. For these applications, DSM is a superior programming model compared to message passing, because it relieves the programmer from having to worry about data motion. Second, DSM allows applications written for shared memory machines to be ported with relative ease to distributed memory machines. Finally, DSM offers a natural paradigm for integrating both the locally shared memory and the globally distributed memory of anticipated future networks of shared memory multiprocessors. In particular, in such an environment, local interprocess communication is likely to dominate and therefore should be implemented in the most efficient form possible, i.e., by using the (hardware) shared memory available. It then follows that to achieve a single paradigm for both local and remote interprocess communication, DSM is the natural choice.
Curvature Estimation in Oriented Patterns Using Curvilinear Models Applied to Gradient Vector Fields
Authors: Joost van de Weijer, Lucas J. van Vliet, Piet W. Verbeek, Michael van Ginkel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Curved oriented patterns are dominated by high frequencies and exhibit zero gradients on ridges and valleys. Existing curvature estimators fail here. The characterization of curved oriented patterns based on translation invariance lacks an estimation of local curvature and yields a biased curvature-dependent confidence measure. Using parameterized curvilinear models we measure the amount of local gradient energy along the model gradient as a function of model curvature. Minimizing the residual energy yields a closed-form solution for the local curvature estimate and the corresponding confidence measure. We show that simple curvilinear models are applicable in the analysis of a wide variety of curved oriented patterns.
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
Authors: Shuqian Yan, Michalis Faloutsos, Anindo Banerjea
Venue: IEEE/ACM Transactions on Networking (TON) (2002)

One of the main problems of the current Internet infrastructure is its inability to provide services at consistent quality-of-service (QoS) levels. At the same time, many emerging Internet applications, such as teleeducation, and teleconferencing, require multicast protocols that will provide the necessary QoS. In this paper, we propose QoSMIC, a multicast routing protocol for the Internet, that provides QoS-sensitive paths in a scalable, resource-efficient, and flexible way. QoSMIC differs from the previous protocols in that it identifies multiple paths and selects the one that can provide the required QoS. Two other key advantages of QoSMIC are its flexibility and adaptivity. First, the distribution tree does not have to be rooted at a preselected core router. Second, we can tradeoff between efficiency metrics depending on our needs; for example, we can tradeoff routing efficiency for a reduction in the control messages. Extensive simulations show that our protocol improves the resources utilization and the end-to-end performance compared to the current protocols. Specifically, our protocol reduces the call blocking probability by a factor of six and reduces the end-to-end delay by as much as 90% compared to the PIM protocol.
A simplified optimal algorithm for constructing the convex hull of a simple polygon
Authors: Jigang Liu, Si-Qing Zheng
Venue: Proceedings of the 30th annual Southeast regional conference (1992)

Given a simple polygon P (a polygon without self-intersections) in the plane represented by a list of vertices in the order that they appear on P, finding the convex hull of P requires &Omega;(N) time, where N is the number of vertices in P. This problem will be referred to as the CHSP (convex hull of a simple polygon) problem. Several O(N)-time algorithms for the CHSP problem have been proposed [1-5]. The algorithm by Sklansky [1] was shown by Bykat [6] that it does not always work, and the algorithm proposed by Shamos in [2] also fails in some special cases. The algorithm given by McCallum and Avis in [3] uses two stacks and is quite complicated. Graham & Yao [4], and Lee [5] independently developed simpler algorithms using one stack. Their algorithms are almost the same. In this paper, we present an algorithm based on the ones given in [4] and [5]. We show that our algorithm is not only conceptually much simpler than any of previously known algorithms, but also more efficient compared with the algorithms given in [4] and [5].
Frame Relay Networks: Specifications and Implementations, 2nd edition
Authors: Uyless D. Black
Venue:  (1995)

:In this Signature Edition of Frame Relay Networks, Uyless Black gives you straightforward data, standards, and conformances, plus invaluable comparisons with competing technologies. You get detailed FRN (Frame Relay networks) design schemes, expert routing and bridging advice, and unequaled explanations of the way the technology works alone and in combination with other systems.
J2ME in a nutshell, 1st edition
Authors: Kim Topley
Venue:  (2002)

J2ME in a Nutshell provides a solid, no-nonsense reference to the alphabet soup of micro edition programming, covering the CLDC, CDC, KVM and MIDP APIs. The book also includes tutorials for the CLDC, KVM, MIDP and MIDlets, MIDlet user interfaces, networking and storage, and advice on programming small handhelds. Combined with OReillys classic quick reference to all the core micro-edition APIs, this is the one book that will take you from curiosity to code with no frustrating frills in between.