ppxscal/embedding_network huggingface dataset:
Network+ Certification Study Guide, 2 edition
Authors: Duncan Anderson
Venue:  (2002)

:The only Network+ study system based on 200,000+ hours of IT training experience Runaway certificationover 25,000 Network+ exams were taken in 2000; 300% more than the previous year Previous edition sold 20,000 units Covers all CompTIA exam objectives,contains over 200 practice exam questions,and includes CD-ROM with CertTrainer interactive tutorials and lab simulation software and ExamSim practice exam software The Only Certification Study System Based on 200,000+ Hours of IT Training Experience100% Complete CoverageAll official test objectives for the Network+ exam are covered in detail Hands-on ExercisesStep-by-step instruction modeled after classroom labs Exam WatchWarnings based on thorough post-exam research identifying the most troublesome exam topics and how to answer them correctly Three Types of Practice QuestionsKnowledge,scenario,and lab-based questions,all with in-depth answers From the ClassroomDiscussions of important issues direct from the classrooms of Global Knowledge's award-winning instructors Full coverage of the topics you need to review,including how to:Demonstrate an understanding of basic network structure,including network operating systems,network protocols,and networking media and connectors Define the layers of the OSI model and identify the protocols,services,and functions that pertain to each layer Understand TCP/IP addressing and configure TCP/IP on workstations Troubleshoot TCP/IP connectivity problems using various utilities,including ARP,Telnet,NBTSTAT,Tracert,Netstat,IPCONFIG/WINIPCFG,FTP,ping,and NSLOOKUP Implement remote connectivity withdial-up networking Identify the characteristics of WAN technologies,including ISDN,FDDI,ATM,Frame Relay,Sonet/SDH,T3/E3,and more Identify the basic capabilities of UNIX/Linux,Netware,Windows,and Macintosh platforms CD-ROM features full CertTrainer CBT software and the ExamSim test engine&shy;&shy;more than 250 questions on CDCertTrainere-TrainingSelf-paced review of key Network+ topics,including exam tips CertCamsInstructional step-by-step animations with audio explanation In-depth LinksNeed more explanation? Topically relevant links provide detailed instruction Skill AssessmentTest your knowledge with more than 200 challenging practice exam questions Score ReportsIndicate subject areas requiring further study ExamSimComplete Practice ExamA realistic Network+ certification exam with questions found only on the CD-ROM Review ModeAnalyze what you got wrong and why Detailed AnswersExplain why the correct options are right and why the incorrect options are wrong Score ReportProvides an overall assessment of your performance PLUSElectronic GlossaryMore than 100 pages of key networking terms on CD-ROM DriveTimeMore than 30 minutes of CD audio for exam prep on the go E-bookElectronic,searchable version of the Study Guide
From Continuous to Multiple-valued Data
Authors: Denis V. Popel
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In modern science, significant advances are typicallymade at cross-roads of disciplines. Thus, manyoptimization problems in Multiple-valued Logic Designhave been successfully approached using ideas andtechniques from Artificial Intelligence. In particular,improvements in multiple-valued logic design have beenmade by utilizing information/uncertainty measures.In this respect, the paper addresses the problem knownas discretization and introduces a method of findingan optimal representation of continuous data in themultiple-valued domain. The paper introduces newinformation density measures and an optimizationcriterion. We propose an algorithm that incorporatesnew measures and is applied to both unsupervisedand supervised discretization. The experimentalresults on continuous-valued benchmarks are givento demonstrate the efficiency and robustness of thealgorithm.
A note on the hermite basis computation of large integer matrices
Authors: Ulrich Vollmer
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

A new algorithm is given and analyzed for the computation of the Hermite basis of a large integer matrix whose HNF has small essential part. The algorithm improves the results from [3] by dropping two key requirements on the matrix considered---sparsity and small kernel dimension---at the cost of relying on small determinant size.
Where to Draw the Line
Authors: Ashim Garg
Venue:  (1996)

Graph Drawing (also known as Graph Visualization) tackles the problem of representing graphs on a visual medium such as computer screen, printer etc. Many applications such as software engineering, data base design, project planning, VLSI design, multimedia etc., have data structures that can be represented as graphs. With the ever increasing complexity of these and new applications, and availability of hardware supporting visualization, the area of graph drawing is increasingly getting more attention from both practitioners and researchers. In a typical drawing of a graph, the vertices are represented as symbols such as circles, dots or boxes, etc., and the edges are drawn as continuous curves joining their end points. Often, the edges are simply drawn as (straight- or poly-) lines joining their end points (and hence the title of this thesis), followed by an optional transformation into smooth curves. The goal of research in graph drawing is to develop techniques for constructing good drawings of the input graphs. Informally speaking, a drawing is considered ``good'''' if it is able to communicate effectively and clearly, the information being displayed in the drawing. Several desirable properties of a good drawing, that have been identified are: small area, minimum edge crossings, large angles between edges, symmetry, small number of edge-bends, upwardness, clustering or aligning of related vertices etc. In this thesis, we have addressed the problem of constructing drawings that exhibit some of these properties, and have presented several new techniques that provide answers to these problems. The problems we have considered relate to the following drawings: - Planar upward drawings of directed acyclic graphs, i.e., planar drawings in which edges flow in the same direction (usually along $y$-axis). - Planar straight-line drawings of planar graphs, in which the angles between edges incident on the same vertex have large magnitudes. - Drawings of angle graphs, i.e., graphs with angles specified between edges incident on the same vertex. - Planar orthogonal drawings (edges drawn as a chain of horizontal and vertical line-segments) of degree-four graphs, with minimum number of edge-bends.
Autonomous Successive Construction Technology without Stopping System Operation for Real-Time System
Authors: Kazuo Kera, Keisuke Bekki, Hideki Osumi, Kinji Mori
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The recent large real time systems have the needs of system expandability with heterogeneous functions and operations. High assurance system is very important for such systems. In order to realize the high assurance system, we research the autonomous successive construction technology without stopping system operation for real time system. This technology is also called step-by-step system construction. In this paper we propose the functional reliability and the online functional availability as the best index to indicate the assurance performance for system construction. According to this new index, the best solution for the system construction is the construction pattern to put the large subsystems into online at first, and to put the small subsystems into online gradually. Moreover we proposed the importance rating as the index to determine online input sequence.
Recovery and Tracking of Continuous 3D Surfaces from Stereo Data Using a Deformable Dual-Mesh
Authors: Yusuf Sinan Akgul, Chandra Kambhamettu
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We propose a novel method for continuous 3D depth recovery and tracking using calibrated stereo. The method integrates stereo correspondence, surface reconstruction and tracking by using a new single deformable dual mesh optimization, resulting in simplicity, robustness and efficiency.In order to combine stereo correspondence and structure recovery, the method introduces an external energy function defined for a 3D volume based on cross-correlation between the stereo pairs. The internal energy functional of the deformable dual mesh imposes smoothness on the surfaces and it serves as a communication tool between the two meshes. Under the forces produced by the energy terms, the dual mesh deforms to recover and track the 3D surface.The newly introduced dual-mesh model, which is one of the main contributions of this paper, makes the system robust against local minima and yet it is efficient. A coarse-to-fine minimization approach makes the system even more efficient. Tracking is achieved by using the recovered surface as an initial position for the next time frame. Although the system can effectively utilize initial surface positions and disparity data, they are not needed for a successful operation, which makes this system applicable to a wide range of areas. We present the results of a number of experiments on stereo human face and cloud images, which proves that our new method is very effective.
Statistical Quality Control Using Excel, 2 edition
Authors: Steven M. Zimmerman, Vahe A. Kazandjian, Marjorie L. Icenogle
Venue:  (2003)

:Quality practitioners from every industry have long used statistical quality control (SQC) to ensure that their products and services meet customer expectations. Whether you're new to SQC or the software product Excel, you'll find all the information you need to understand and incorporate the two in Statistical Quality Control Using Excel. Nonmathematical descriptions guide you through the basics of both SQC and the methods of creating control charts using Excel. You'll discover easy-to-read explanations of statistical distribution, outliers, and the analysis required for SQC methods. Statistical process control methods such as p and np control charts and Pareto charts are also demonstrated.
Some Ideas on Data Types in High Level Languages
Authors: David Gries, Narain Gehani
Venue:  (1975)

WE explore some new and old ideas concerning data types; what a data type is, overloading operators, when and how implicit conversions between programmer data types should be allowed and so forth. The current notion that a data type is a set of values together with basic operations in that set leads us to conclude that formal parameter types need not be so explicitly stated. Given a formal parameter X with operations $o_{1},\ldots o_{n}$ being performed on X within a procedure, one should be able to supply, as actual parameter in call, a variable of any type which has operations $o_{1},\ldots o_{n}$ defined on it. We introduce a notation for this, using PASCAL as a basic language, illustrate the added flexibility it gives us, and show briefly how to implement the idea efficiently.
Generalized Selective XML Markup of Source Code Using Agile Parsing
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Increasingly focus in the software comprehension community is shifting from representing the results of analysis in the graph and database domain to reflecting insights directly into source. The obvious modern representation for this reflection is XML markup. In the simplest case, XML markup of the abstract syntax tree itself can be represented in source, although the result is wordy, overly detailed and cumbersome to deal with. A more realistic solution is to use island or multi-weight parsing to mark up the AST in only those sections of source of interest to the current task.In this paper we outline a method for extending and generalizing the partial markup idea to minimize source markup not only by marking only sections, but by selectively marking up the source with only a subset of the AST nodes relevant to each particular task as well. By exploiting agile parsing, this idea is further extended to allow for task-directed selective markup as a natural extension of selective syntactic markup.
The Complexity of Optimization Problems
Authors: Mark W. Krentel
Venue:  (1985)

Many important problems in computer science, such as CLIQUE, COLORING, and TRAVELLING SALESPERSON, arise naturally as optimization problems. Typically one considers these problems as decision procedures, which are often in NP, and one shows intractibility by showing them NP-complete. We generalize the notion of an NP problem, in a manner analogous to Valiant''s class #P, by considering the optimization version of the problem itself, and we show that this idea yields a natural class of problems that we call OptP. This class allows us to make finer distinctions on the complexity of optimization problems than is possible in NP. For example, assuming P $\neq$ NP, we can show that TRAVELLING SALESPERSON is strictly harder than CLIQUE and CLIQUE is strictly harder than BIN PACKING. We then relate OptP to the class of functions computable in polynomial time with an oracle for NP, by showing that every $P^{SAT}$ function decomposes into an OptP function followed by a polynomial-time computation. This allows us to clear up a misconception on the role of uniqueness for the problem of UNIQUELY OPTIMAL TRAVELLING SALESPERSON as considered by Papadimitriou is the 1982 FOCS conference.
Using Generic Method Chunks to Generate Process Models Fragments
Authors: C. Rolland, V. Plihon
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The need for process models which are easy to construct, adapt and change is acknowledged by both the Information System community and the Software Engineering community. Our contribution to this problem is the definition of a systematic way by which fragments of process models can be generated by reusing method knowledge acquired in previous projects. We propose in this paper a method for generating methods i.e. a meta-method. The meta-method uses method construction patterns that are named method chunks. The paper presents the meta-method, illustrates its use for the construction of requirements engineering centred methods and gives details of some method chunks necessary to support this construction.
Between Well-Founded Semantics and Stable Model Semantics
Authors: V. Phan Luong
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Using fixpoint operations, we define a new semantics for Datalog programs with negation. The semantics is deterministic. Given a program ? the model of ? in the new semantics includes the well-founded model, and is included in all stable models, if such models exist. In particular, there exist programs that have no stable models, or their well-founded model is empty, but their model in the new semantics is meaningful. 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
Automated Dependability Analysis of UML Designs
Authors: Andrea Bondavalli, Ivan Mura, Istvan Majzik
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

This paper deals with the automatic dependability analysis of systems designed using UML. An automatic transformations is defined for the generation of models to capture systems dependability attributes, like reliability. The transformation concentrates on structural UML views, available early in the design, to operate at different levels of refinement, and tries to capture only the information relevant for dependability to limit the size (state space) of the models. Due to the modular construction, these models can be refined later as more detailed, relevant information becomes available. Moreover a careful selection of those, critical, parts to be detailed allows to avoid explosion of the size. An implementation of the transformation is in progress and will be integrated in the toolsets available for the ESPRIT LTR HIDE project.
Talking about watching: using the video card game and wiki-web technology to engage IT students in developing observational skills
Authors: Margot Brereton, Jared Donovan, Stephen Viller
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

Designers need to develop good observational skills in order to conduct user studies that reveal the subtleties of human interactions and adequately inform design activity. In this paper we describe a game format that we have used in concert with wiki-web technology, to engage our IT and Information Environments students in developing much sharper observational skills. The Video Card Game is a method of video analysis that is suited to design practitioners as well as to researchers. It uses the familiar format of a card game similar to "Happy Families,, to help students develop themes of interactions from watching video clips. Students then post their interaction themes on wiki-web pages, which allows the teaching team and other students to edit and comment on them. We found that the tangible (cards), game, role playing and sharing aspects of this method led to a much larger amount of interaction and discussion between student groups and between students and the teaching team, than we have achieved using our traditional teaching methods, while taking no more time on the part of the teaching staff. The quality of the resulting interaction themes indicates that this method fosters development of observational skills.In the paper we describe the motivations, method and results in full. We also describe the research context in which we collected the videotape data, and how this method relates to state of the art research methods in interaction design for ubiquitous computing technology.
JBoss 3.0 Deployment and Administration Handbook, 1 edition
Authors: Meeraj Moidoo Kunnumpurath
Venue:  (2002)

:The Deployment and Administration Handbooks simply the varied and often complex task of getting J2EE applications up and running on a J2EE 1.3 certified application server. Despite the J2EE standard, every application server is different. Each has its own administrative interface, and deployment process. Each interprets and implements the specifications slightly differently, adding its own proprietary features and functionality.To develop powerful J2EE applications that fully utilize the runtime services provided by the platforms in which they run, you need to be well versed with the configuration and deployment of J2EE components on the application server. The JBoss 3.0 Deployment and Administration Handbook is a guide to the variety of configurative, administrative and deployment tasks that are associated with setting up and running J2EE components on the JBoss 3.0 application server. The book covers: The JBoss JMX-based configuration architecture Deploying J2EE components: WAR, EJB JAR, and EAR Configuring JBoss Security Configuring JCA and Datasources Configuring JBossMQ for JMS and JavaMail Configuring the Jetty and Tomcat Web Containers Configuring JBoss Clustering Configuring Log4J Logging Configuring EJB deployments Configuring Container-Managed Persistence for Entity Beans Proprietary JBoss features such as Scheduling This Handbook assumes that you are familiar with J2EE development and is focused only on deployment and administrative tasks for the JBoss application server.
Multigrid approaches to non-linear diffusion problems on unstructured meshes
Authors: Mavriplis Dimitri J.
Venue:  (2001)

The efficiency of three multigrid methods for solving highly non-linear diffusion problems on two-dimensional unstructured meshes is examined. The three multigrid methods differ mainly in the manner in which the nonlinearities of the governing equations are handled. These comprise a non-linear full approximation storage (FAS) multigrid method which is used to solve the non-linear equations directly, a linear multigrid method which is used to solve the linear system arising from a Newton linearization of the non-linear system, and a hybrid scheme which is based on a non-linear FAS multigrid scheme, but employs a linear solver on each level as a smoother. Results indicate that all methods are equally effective at converging the non-linear residual in a given number of grid sweeps, but that the linear solver is more efficient in cpu time due to the lower cost of linear versus non-linear grid sweeps.
Automated Protocol Implementations Based on Activity Threads
Authors: Peter Langendoerfer, Hartmut Koenig
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

In this paper we present a new approach for the automated mapping of formal descriptions into activity thread implementations. Our approach resolves semantic conflicts by reordering of statements at compile time. This simplifies the mapping process and considerably improves the efficiency of the generated code. The approach is implemented in the SDL compiler {\it COCOS}. We describe the approach as well as its implementation and prove how semantic conflicts are resolved. Finally we present measurements which show the achieved performance gain that is up to 120 per cent in comparison with commercially available tools.
Using Graph Parsing for Automatic Graph Drawing
Authors: C. L. McCreary, F. S. Shieh
Venue:  (1995)

This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clans) in the graph and to produce a parse tree. The tree is given attributes that specify the node layout. CG then uses tree properties with the addition of "routing nodes" to route the edges. The objective of the system is to provide, automatically, an aesthetically pleasing visual layout for arbitrary directed graphs. The prototype has shown the strengths of this approach. The innovative strategy of clan-based graph decomposition is the first digraph drawing technique to analyse locality in the graph in two dimensions. The typical approach to drawing digraphs uses a single dimension, level, to arrange the nodes.
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems
Authors: Liqun Qi, Soon-Yi Wu, Guanglu Zhou
Venue: Journal of Global Optimization (2003)

In this paper we present some semismooth Newton methods for solving the semi-infinite programming problem. We first reformulate the equations and nonlinear complementarity conditions derived from the problem into a system of semismooth equations by using NCP functions. Under some conditions a solution of the system of semismooth equations is a solution of the problem. Then some semismooth Newton methods are proposed for solving this system of semismooth equations. These methods are globally and superlinearly convergent. Numerical results are also given.
Can Industrial Robots Be Connected with Each Other? - Open and Networked Industrial Robots
Authors: Akihiro Matsumoto, Makoto Mizukawa, Toshihiko Koyama, Hideo Matsuka
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper reports the status of the standardization activities for the open and networked industrial robots in Japan. First, historical and technical background for the standardization of the programming interface for industrial robots is described. Second, the requirement of the PC-based approach for networking is explained and design philosophy is explained. Last, the current situation of the implementation and technical issues left are shown with the prospective plan to the international standard and the de-facto standard.