ppxscal/embedding_network huggingface dataset:
Network + Certification Study Guide, Third Edition, 3 edition
Authors: Glen E. Clarke
Venue:  (2005)

Explains not only what -- but HOW to study Network+ Study Guide, Third Edition is the most exam focused self-study preparation available for this vendor-neutral networking certification. The book covers all the official objectives for the exam and includes 300+ practice exam questions, step-by-step exercises, and chapter self-tests. The CD-ROM features MasterExam software with hundreds of practice questions, CertCam training videos, an electronic copy of the book, and more. NEW coverage of wireless networking, gigabit Ethernet, and other wireless technologies Covers the latest hardware including CAT 6, SANs, NAS, and RAID Full details on Windows XP, Windows Server 2003, Netware, and Linux Table of contentsABOUT THE CONTRIBUTORSACKNOWLEDGMENTSPREFACEINTRODUCTIONChapter 1: Basic Network ConceptsChapter 2: Network Protocols and StandardsChapter 3: Networking ComponentsChapter 4: TCP/IP FundamentalsChapter 5: Subnetting and RoutingChapter 6: TCP/IP UtilitiesChapter 7: Remote ConnectivityChapter 8: Wide Area Network TechnologiesChapter 9: Implementing a NetworkChapter 10: Maintaining and Supporting a NetworkChapter 11: Network SecurityChapter 12: Troubleshooting the NetworkAPPENDIX A: ABOUT THE CDINDEX 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
Target motion analysis and track association with a network of proximity sensors
Authors: Régis Donati, Jean-Pierre Le Cadre
Venue: Information Fusion (2006)

Target motion analysis and track association are the aims of this paper. It is assumed that the target trajectory is only partially observable by using temporal processing of a single sensor. Thus, original algorithms have been developed for fusing local estimates. Though suboptimal, such algorithms are feasible and close to optimality. Their performances have been theoretically investigated. Another problem is track-to-track association, the aim of which is to perform decision if the tracks estimated by two local subsystems are related to a single target or not and for which an original approach has been developed. This study is illustrated by a specific case study: the detection of a moving target by stationary electric sensors.
Semi-Supervised Classification with Spectral Subspace Projection of Data
Authors: Weiwei Du, Kiichi Urahama
Venue: IEICE - Transactions on Information and Systems (2007)

A semi-supervised classification method is presented. A robust unsupervised spectral mapping method is extended to a semi-supervised situation. Our proposed algorithm is derived by linearization of this nonlinear semi-supervised mapping method. Experiments using the proposed method for some public benchmark data reveal that our method outperforms a supervised algorithm using the linear discriminant analysis for the iris and wine data and is also more accurate than a semi-supervised algorithm of the logistic GRF for the ionosphere dataset.
Understanding gestures with systematic variations in movement dynamics
Authors: Sylvie C. W. Ong, Surendra Ranganath, Y. V. Venkatesh
Venue: Pattern Recognition (2006)

Sign language communication includes not only lexical sign gestures but also grammatical processes which represent inflections through systematic variations in sign appearance. We present a new approach to analyse these inflections by modelling the systematic variations as parallel channels of information with independent feature sets. A Bayesian network framework is used to combine the channel outputs and infer both the basic lexical meaning and inflection categories. Experiments using a simulated vocabulary of six basic signs and five different inflections (a total of 20 distinct gestures) obtained from multiple test subjects yielded 85.0% recognition accuracy. We also propose an adaptation scheme to extend a trained system to recognize gestures from a new person by using only a small set of data from the new person. This scheme yielded 88.5% recognition accuracy for the new person while the unadapted system yielded only 52.6% accuracy.
Visual Basic 2005 Jumpstart
Authors: Wei Meng Lee
Venue:  (2005)

Okay, all you VB6 developers--time's up. As of March 2005, Microsoft no longer supports this version of Visual Basic. And you can't blame them. Three years ago, they introduced the .NET Framework--an elegant, powerful platform--along with the new component-based VB.NET language. But roughly five million of you decided to stick with VB6, mostly to maintain legacy Windows and COM projects. Now, with the upcoming release of VB 2005, Microsoft has several attractive reasons to upgrade that you'll find hard to resist, including the return of some VB6 features. And we have the perfect book to help you make the conversion: Visual Basic 2005 Jumpstart. Now, you can test-drive the beta version of VB 2005 with three hands-on projects that enable you to learn the syntax of this new language quickly.VB 2005 not only lets you convert the bulk of your existing VB6 code, but offers several familiar features, such as compile-and-run debugging, new MyClasses that simplify use of .NET libraries and frameworks, lots of IDE support for Windows, web and mobile GUI development, and data access controls that closely resemble what you use now. The real plus is that you'll be using these features with the .NET platform, which is more secure, less complex than COM, and offers OneClick deployment.Visual Basic 2005 Jumpstart lets you get the feel of this platform for building smart/rich Windows Forms clients, ASP.NET web applications, and web services. Author Wei-Meng Lee, a Microsoft .NET MVP, veteran O'Reilly author and frequent contributor to the O'Reilly Network, has put together three useful test-drive projects, complete with code samples, that let you develop:A personal library Windows applicationA Web-based shopping cart applicationA stock enquiry Web Service Our jumpstart guide is the quick, painless way to migrate from VB6 to VB 2005, and the perfect training manual for moving your organization to the more robust, dynamic and secure world of .NET.
Using simulation and evolutionary algorithms to evaluate the design of mix strategies of decoy and jammers in anti-torpedo tactics
Authors: Ko-Hsin Liang, Kuei-Ming Wang
Venue: Proceedings of the 38th conference on Winter simulation (2006)

When a submarine uses an anti-torpedo tactic, it is a matter of life or death. In terms of diesel submarine, the torpedo has the advantage of high speed, and acoustic homing to target. The disadvantages of submarine are the not-so-fast evasive speed, and the limited capability of torpedo counter-measure systems. There are two types of countermeasures: decoys and jammers. A successful anti-torpedo tactic should consist of the deployment of mixed decoys and jammers and the coordination with the submarine's maneuver. This paper would like to discuss the anti-torpedo tactics from the classical viewpoint. A simulation scenario is implemented in order to study the interaction among the submarine, torpedo, decoy and jammers. After applying the evolutionary algorithm, it is interesting to discover some points about anti-torpedo tactics using a mix of decoys and jammers that would make a significant contribution to the survivability of submarine in the torpedoes engagement scenario.
A note to a response to a note
Authors: Peter Kornerup
Venue: ACM SIGMICRO Newsletter (1979)

Although I hate to drag on a discussion on a matter which may only have a limited interest to the audience of SIGMICRO Newsletter, I find that the response by Thacker and Gorsline [1] missed my point in [2].
Intelligent anticipated exploration of Web sites
Authors: Giovambattista Ianni
Venue: AI Communications (2001)

In this paper we describe a Web search agent, called Global Search Agent (hereafter GSA for short). GSA integrates and enhances several search techniques in order to achieve significant improvements in the user&dash;perceived quality of delivered information as compared to usual Web search engines. GSA features intelligent merging of relevant documents from different search engines, anticipated selective exploration and evaluation of links from the current result set, automated derivation of refined queries based on user relevance feedback. System architecture as well as experimental accounts are also illustrated.
Emergent (mis)behavior vs. complex software systems
Authors: Jeffrey C. Mogul
Venue: ACM SIGOPS Operating Systems Review (2006)

Complex systems often behave in unexpected ways that are not easily predictable from the behavior of their components; this is known as emergent behavior. As software systems grow in complexity, interconnectedness, and geographic distribution, we will increasingly face unwanted emergent behavior.Unpredictable software systems are hard to debug and hard to manage. We need better tools and methods for anticipating, detecting, diagnosing, and ameliorating emergent misbehavior. These tools and methods will require research into the causes and nature of emergent misbehavior in software systems.
Oracle PL/SQL Programming, 4th Edition
Authors: Steven Feuerstein, Bill Pribyl
Venue:  (2005)

For the past ten years, O'Reilly's Oracle PL/SQL Programming has been the bestselling book on PL/SQL, Oracle's powerful procedural language. Packed with examples and helpful recommendations, the book has helped everyone--from novices to experienced developers, and from Oracle Forms developers to database administrators--make the most of PL/SQL. The fourth edition is a comprehensive update, adding significant new content and extending coverage to include the very latest Oracle version, Oracle Database 10g Release 2. It describes such new features as the PL/SQL optimizing compiler, conditional compilation, compile-time warnings, regular expressions, set operators for nested tables, nonsequential collections in FORALL, the programmer-defined quoting mechanism, the ability to backtrace an exception to a line number, a variety of new built-in packages, and support for IEEE 754 compliant floating-point numbers.The new edition adds brand-new chapters on security (including encryption, row-level security, fine-grained auditing, and application contexts), file, email, and web I/O (including the built-in packages DBMS_OUTPUT, UTL_FILE, UTL_MAIL, UTL_SMTP, and UTL_HTTP) and globalization and localization.Co-authored by the world's foremost PL/SQL authority, Steven Feuerstein, this classic reference provides language syntax, best practices, and extensive code, ranging from simple examples to complete applications--making it a must-have on your road to PL/SQL mastery. A companion web site contains many more examples and additional technical content for enhanced learning.
Firewall Policies and VPN Configurations
Authors: Mark Lucas, Abhishek Singh, Chris Cantrell, Anne Henmi
Venue:  (2006)

The security provided by firewalls and VPNs is only as strong as the protocol rules and policies that you create. The concepts of "defense-in-depth" and "least privilege" are merely holes in your perimeter waiting to be exploited, unless you can define and maintain protocol rules that allow only the minimum protocols required to provide your requisite services. This book provides fundamental information necessary to configure firewalls and build VPNs and DMZs to survive the dangers of today's internet. The book includes a bonus chapter from the companion Web site on using Ethereal to monitor and analyze network traffic. While you may now feel overwhelmed by the countless firewalls with a dizzying array of features, you will feel empowered by the knowledge gained from this book. This book covers the leading firewall products. It describes in plain English what features can be controlled by a policy, and walks the reader through the steps for writing the policy to fit the objective. Because of their vulnerability and their complexity, VPN policies are covered in more depth with numerous tips for troubleshooting remote connections. Products covered include Cisco PIX Firewall, ISA Server 2004, Check Point NGX, Juniper'?s NetScreen Firewalls, SonicWall, and Nokia.
Using self-dissimilarity to quantify complexity: Research Articles
Authors: David H. Wolpert, William Macready
Venue: Complexity (2007)

For many systems characterized as &ldquo;complex&rdquo; the patterns exhibited on different scales differ markedly from one another. For example, the biomass distribution in a human body &ldquo;looks very different&rdquo; depending on the scale at which one examines it. Conversely, the patterns at different scales in &ldquo;simple&rdquo; systems (e.g., gases, mountains, crystals) vary little from one scale to another. Accordingly, the degrees of self-dissimilarity between the patterns of a system at various scales constitute a complexity &ldquo;signature&rdquo; of that system. Here we present a novel quantification of self-dissimilarity. This signature can, if desired, incorporate a novel information-theoretic measure of the distance between probability distributions that we derive here. Whatever distance measure is chosen, our quantification of self-dissimilarity can be measured for many kinds of real-world data. This allows comparisons of the complexity signatures of wholly different kinds of systems (e.g., systems involving information density in a digital computer vs. species densities in a rain forest vs. capital density in an economy, etc.). Moreover, in contrast to many other suggested complexity measures, evaluating the self-dissimilarity of a system does not require one to already have a model of the system. These facts may allow self-dissimilarity signatures to be used as the underlying observational variables of an eventual overarching theory relating all complex systems. To illustrate self-dissimilarity, we present several numerical experiments. In particular, we show that the underlying structure of the logistic map is picked out by the self-dissimilarity signature of time series produced by that map. &copy; 2007 Wiley Periodicals, Inc. Complexity 12: 77&ndash;85, 2007This paper was submitted as an invited paper resulting from the &ldquo;Understanding Complex Systems&rdquo; conference held at the University of Illinois-Urbana Champaign, May 2005.This article is a US Government work, and as such, is in the public domain in the United States of America.
Partial moment entropy approximation to radiative heat transfer
Authors: Martin Frank, Bruno Dubroca, Axel Klar
Venue: Journal of Computational Physics (2006)

We extend the half moment entropy closure for the radiative heat transfer equations presented in Dubroca and Klar [B. Dubroca, A. Klar, Half moment closure for radiative transfer equations, J. Comput. Phys. 180 (2002) 584-596] and Turpault et al. [R. Turpault, M. Frank, B. Dubroca, A. Klar, Multigroup half space moment approximations to the radiative heat transfer equations, J. Comput. Phys. 198 (2004) 363-371] to multi-D. To that end, we consider a partial moment system with general partitions of the unit sphere closed by an entropy minimization principle. We give physical and mathematical reasons for this choice of model and study its properties. Several numerical examples in different physical regimes are presented.
Personalized ambient media experience: move.me case study
Authors: Lora Aroyo, Frank Nack, Thecla Schiphorst, Hielke Schut, Michiel KauwATjoe
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

The move.me prototype illustrates a scenario for social interaction in which users can manipulate audio-visual sources presented on various screens through an interaction with a sensor-enhanced pillow. The technology developed for move.me uses the surface of a pillow as a tactile interface. We describe the underlying concepts of move.me and its motivations. We present a case study of the environment as the context of evaluating aspects of our approach and conclude with plans for future work.
Proceedings of the 12th international conference on Intelligent user interfaces
Venue: International Conference on Intelligent User Interfaces (2007)

In March 1988, a group of researchers gathered in Monterey, California to participate in a workshop titled: "Architectures for Intelligent Interfaces". It was the beginning of what at first would be a slow but steady development of the field of Intelligent User Interfaces. Three years later, the book "Intelligent User Interfaces" was published edited by Joe Sullivan and Sherman Tyler, the organizers of the workshop. The book highlighted the main papers presented in the workshop and served as a basis for not only future work, but also future events that continued that work. It was not until 1993, however, that Bill Hefley organized the First International Workshop on Intelligent User Interfaces, which took place in Orlando, Florida. The event, sponsored by ACM, attracted a nascent group of researchers whose work clearly defined the field as a novel and promising intersection of Artificial Intelligence and Human-Computer Interaction.With a growing body of work in the field of IUI and a lack of an established outlet for such work at the time, Angel Puerta and Ernest Edmonds led an effort to create a permanent leading forum for research in intelligent user interfaces. The result was the first IUI conference in 1997 defined as a yearly event and conceived from the start as a highly selective program focusing on the quality of research, and on the value of the contribution of each accepted paper. Over the ten-year span since that initial event, the IUI conferences have established the significance and breadth of the field, and have built a valuable reference body that inspires new research every day across the globe.With IUI2007, we start the second decade of the IUI conferences. Our program this year highlights 26 papers accepted from a total of 118 submissions. Topics range from foundation items, such as user modeling, demonstration-based interfaces, and information retrieval, to current trends, such as social software, personal assistants, and recommender systems, to intelligent interaction methods including multi-modal, natural language, and gesture-based interfaces. The papers program is complemented by the always popular Posters and Demonstrations session where authors of accepted short papers can showcase their work and where many published authors present live demos of their systems. In addition, this year we count with two outstanding invited speakers: Susan Dumais of Microsoft Research and Thomas Strothotte of the University of Rostock. Finally, the main conference program is greatly augmented by an excellent offer of Tutorials and dedicated Workshops.
Sams Teach Yourself Microsoft Office 2003 in 24 Hours
Authors: Greg Perry
Venue:  (2003)

Learn all the Office 11 essentials! Become a productive user, quickly and easily! Whether new to Office 11 or upgrading from an earlier version, the reader can use the step-by-step tutorial lessons to accomplish everyday Office tasks. The series is organized into 24 one-hour long sessions, allowing readers to quickly learn to use the software. 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
Minimal invariant sets in a vertex-weighted graph
Authors: Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
Venue: Theoretical Computer Science (2006)

A weighting of vertices of a graph is admissible if there exists an edge weighting such that the weight of each vertex equals the sum of weights of its incident edges. Given an admissible vertex weighting of a graph, an invariant set is an edge set such that the sum of the weights of its edges is the same for every edge weighting, and a nonempty invariant set is minimal if none of its nonempty proper subsets is an invariant set. It is easily seen that every nonempty invariant set is a disjoint union of minimal invariant sets. A graphical characterisation of minimal invariant sets in a bipartite graph is known both in the case the vertex weights are reals and in the case the vertex weights are nonnegative reals. We shall state a graphical characterisation of minimal invariant sets in an arbitrary vertex-weighted graph. Moreover, we give a linear algorithm to test an invariant set for minimality. Finally, we state a complete axiomatisation of invariant sets and give a polynomial algorithm to find a set of minimal invariant sets that completely characterise the set of all invariant sets.
Work smarter, not harder: guidelines for designing simulation experiments
Authors: Susan M. Sanchez
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We present the basic concepts of experimental design, the types of goals it can address, and why it is such an important and useful tool for simulation. A well-designed experiment allows the analyst to examine many more factors than would otherwise be possible, while providing insights that cannot be gleaned from trial-and-error approaches or by sampling factors one at a time. We focus on experiments that can cut down the sampling requirements of some classic designs by orders of magnitude, yet make it possible and practical to develop a better understanding of a complex simulation model. Designs we have found particularly useful for simulation experiments are illustrated using simple simulation models, and we provide links to other resources for those wishing to learn more. Ideally, this tutorial will leave you excited about experimental designs---and prepared to use them---in your upcoming simulation studies.
Classification of acoustic events using SVM-based clustering schemes
Authors: Andrey Temko, Climent Nadeu
Venue: Pattern Recognition (2006)

Acoustic events produced in controlled environments may carry information useful for perceptually aware interfaces. In this paper we focus on the problem of classifying 16 types of meeting-room acoustic events. First of all, we have defined the events and gathered a sound database. Then, several classifiers based on support vector machines (SVM) are developed using confusion matrix based clustering schemes to deal with the multi-class problem. Also, several sets of acoustic features are defined and used in the classification tests. In the experiments, the developed SVM-based classifiers are compared with an already reported binary tree scheme and with their correlative Gaussian mixture model (GMM) classifiers. The best results are obtained with a tree SVM-based classifier that may use a different feature set at each node. With it, a 31.5% relative average error reduction is obtained with respect to the best result from a conventional binary tree scheme.