ppxscal/embedding_network huggingface dataset:
Web 101: Making the Net Work for You, 2nd edition
Authors: Wendy G. Lehnert
Venue:  (2002)

:B> This book presents a completely new and innovative approach to the Web that is tailored to individual users' needs, as opposed to simply studying tools that are used on the Web. It is designed around important issues that all users of the World Wide Web need to know to take full advantage of its power. Upon using this book, readers will be familiar with: protecting themselves on the Internet by studying potential consequences, including legal ramifications and technical and personal complications; selecting the mail software that best suits their needs, and then using the best options and techniques for managing the vast amounts of mail that will follow; how to quickly and accurately access the best information on the Internet through effective search techniques; determining the value of Virtual Communities on the Web, and mastering the software options that are of value when a part of Virtual Communities (i.e. mail digests, listerv commands, Usenet display options, and kill files); creating Web Pages, both with a minimal knowledge of HTML in combination with key tools, or with HTML and JavaScript, in order to create good-looking Web pages; how to locate software worth having, and how to safely download and install software while protecting themselves from computer viruses, as well as understanding the most commonly used file formats, file utilities, file archives, self-extracting files, installers, and uninstallers; how to make their browser take full advantage of multimedia Web sites, including use of audio and video files, creating a music library, burning their own music CDs, putting photos and sounds on their Web pages, and expanding their bandwidth withoutshrinking their wallets; how to make the most out of e-commerce, including comparison shopping, safe use of credit cards online, protecting themselves in an online auction, and the privacy trade-offs and prospective pitfalls of shopping in the online world; how to encrypt their online communication to ensure privacy; and how to coordinate their Internet access from multiple points-of-access, including Telnet and FTP. This book is right for anyone who wants enhance their Web experience, from novice surfers to experienced programmers.
Fine Art PhotoShop: Lessons in Digital Drawing and Painting
Authors: Renee LeWinter, Michael J. Nolan
Venue:  (1998)

:Create expressive artistic effects and polish your individual style with Fine Art Photoshop. Learn digital art techniques to make your work more original and intuitive - without third-party programs or filters. These simple exercise, practical examples, and step-by-step lessons help you master Photoshop and unleash your imagination and creativity. Explore the latest features of Photoshop 4, including advanced color correction, the Free Transform function, guides and grids, and more. Based on traditional art instruction techniques, Fine Art Photoshop is like having your own painting class - in one book.
A multidisciplinary approach to improving the user experience: information development, test, and user experience design teams working together
Authors: Erin E. Heximer, Uliyana Markova, Lisa Wu, Justine Yoon
Venue: Proceedings of the 20th annual international conference on Computer documentation (2002)

In this paper we discuss how the combined efforts of three teams, Information Development (ID), Test, and User Experience Design (UED), improved the overall customer experience with store development in IBM® WebSphere® Commerce, a software package that enables merchants to host their businesses online.The project began in the spring of 2001 with a formal effort to solicit customer feedback on documentation. A few months later, a test team was created to simulate the customer experience. The test team performed the store development tasks as customers would, following only the instructions in the documentation. As ID and Test continued working together, they began to realize that, in order to improve the documentation, they had to revisit and improve the actual store development. This led to the involvement of the UED team.UED, Test, and ID continued working together to understand the store development processes our customers follow and the challenges they face. Through collaboration, the team identified areas for improvement in both the tools and the documentation, and developed an action plan to address these problems.
A portable-approach to dynamic optimization in run-time specialization
Authors: Hidehiko Masuhara, Akinori Yonezawa
Venue: New Generation Computing (2002)

This paper proposes a run-time bytecode specialization (BCS) technique that analyzes programs and generates specialized programs at run-time in an intermediate language. By using an intermediate language for code generation, a back-end system can optimize the specialized programs after specialization. The system uses Java virtual machine language (JVML) as the intermediate language, which allows the system to easily achieve practical portability and to use existing sophisticated just-in-time (JIT) compilers as its back-end. The binding-time analysis algorithm is based on a type system, and covers a non-object-oriented subset of JVML. The specializer generates programs on a per-instruction basis, and can perform method inlining at run-time. Our performance measurements show that a non-trivial application program specialized at run-time by BCS runs approximately 3-4 times faster than the unspecialized one. Despite the large overhead of JIT compilation of specialized code, we observed that the overall performance of the application can be improved.
From UML sequence diagrams and statecharts to analysable petri net models
Authors: Simona Bernardi, Susanna Donatelli, José Merseguer
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

In this paper we study the use of Sequence Diagrams and Statecharts of the Unified Modeling Language (UML) for the validation and the performance evaluation of systems. We assume that the system is specified as a set of Statecharts and that Sequence Diagrams are used to represent "executions of interest". UML lacks a formal semantics and hence it is not possible to apply, directly, mathematical techniques on UML models for system validation. To reach this goal we propose an automatic translation of Statecharts and Sequence Diagrams into Generalized Stochastic Petri Nets, and a composition of the resulting net models suitable for reaching a given analysis goal. The translation into Petri nets is based on the abstract syntax of the UML Collaborations and of the State Machines packages (from which Sequence Diagrams and Statecharts are derived) and the construction of the complete model heavily uses compositionality.
Does snooping help?
Authors: V. V. V'yugin
Venue: Theoretical Computer Science (2002)

One of the most efficient way of improving the performance of learning algorithms is "snooping", i.e. using some information about the data to be predicted for choosing the parameters of the learning algorithm or the learning algorithm itself. Allowing different degrees of snooping makes it possible to attain a better performance LossP(x) of a prediction strategy P on the given data set x. We study the "snooping curves" Lx()=infK(P)LossP(x), where K(P) is the Kolmogorov complexity of the prediction strategy P. We prove that every non-increasing function can be approximated with arbitrary precision by some snooping function Lx. Our framework is that of on-line prediction; for simplicity we assume that sequences x are binary.
The future of fibre access systems?
Authors: D. B. Payne, R. P. Davey
Venue: BT Technology Journal (2002)

It is clear that there is a huge potential demand for high bandwidth services that, at some point in the future, could be delivered over the fixed network. The most promising technology to provide the delivery mechanism to the customer is optical access networks. The major issue for the telecommunications industry is how to do this at sufficiently low cost. This paper looks at the economic issues and suggests some possible ways forward if we are to move to delivery of services well beyond the capability of ADSL and cable-modem technologies.
10 Minute Guide to OS/2 2.1
Authors: Herbert L. Tyson, Oliver Kelly
Venue:  (1993)

:This guide quickly teaches readers how to navigate the latest version of OS/2. Effective, 10-minute lessons teach the most crucial features of this operating environment.Features a Quick Reference of the most often-used features of the latest version of OS/2Over 20 mini-tutorials teach specific tasks in 10 minutes or lessOffers Plain English definitions for unfamiliar terms
Minimal reducible bounds in the lattice of additive hereditary graph properties
Authors: Amelie J. Berger
Venue: Discrete Mathematics (2002)

An additive hereditary property of graphs is any class of graphs closed under subgraphs, disjoint unions and isomorphisms. These properties can be ordered under set inclusion to form a lattice. In this lattice, we show that every irreducible property has at least one minimal reducible bound, and that if an irreducible property is contained in a reducible property, there exists a minimal reducible bound for the irreducible property between them. We give an example of a property with uncountably many minimal reducible bounds. In addition we show that if a reducible property strictly contains another property, then the reducible property is a minimal reducible bound for some property between them.
Data visualization: parallel coordinates and dimension reduction
Authors: Jim X. Chen, Shuangbao Wang
Venue: Computing in Science and Engineering (2001)

Visualization techniques deal with multidimensional multivariable data sets. We introduce visualization methods for multidimensional data sets, including an effective dimension reduction method for the multivariate genetic algorithm data set.
MCSE: TCP/IP for NT Server 4 Study Guide
Authors: Todd Lammle, James Chellis, Monica Lammle
Venue:  (2000)

:Here's the book you need to prepare for Exam 70-059, Internetworking with Microsoft TCP/IP on Microsoft Windows NT 4.0. This Microsoft Certified Professional Approved Study Guide provides full coverage of every exam objectiveall the information you need to know, hundreds of challenging review questions, in the book and on the CD, and practical information on TCP/IP internetworking in an NT environment
Microsoft Flight Simulator 98: Unauthorized Game Secrets
Authors: Douglas Kiang, Kiang Douglas
Venue:  (1997)

:The only PC flight simulator endorsed by FlightSafety, International, Learjet, and Cessna, Microsoft Flight Simulator 98 is the next best thing to flying a real airplane. Author Douglas Kiang leads prospective pilots through the game's new adventures, new sights and sounds, and the multiplayer capability.
HD-Eye: visual clustering of high dimensional data
Authors: Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for guiding the clustering process and understanding the results, which is especially important for high dimensional data. Visualization technology may help to solve this problem since it provides effective support of different clustering paradigms and allows a visual inspection of the results. The HD-Eye (high-dim. eye) system shows that a tight integration of advanced clustering algorithms and state-of-the-art visualization techniques is powerful for a better understanding and effective guidance of the clustering process, and therefore can help to significantly improve the clustering results.
Office 2000: Introduction to Concepts and Techniques, 1st edition
Authors: Cashman Shelly, Gary B. Shelly, Misty E. Vermaat, Thomas J. Cashman
Venue:  (2000)

:Part of the highly successful Shelly Cashman series this introductory text leads the student through a clear step-by-step screen-by-screen approach to learning Microsoft Office 2000.
Parallel algorithms for multi-diemsnional integration
Authors: J. M. Bull, T. L. Freeman
Venue: Progress in computer research (2001)

A central feature of adaptive algorithms for the numerical approximation of definite integrals is the manipulation of the list containing the sub-intervals and corresponding error estimates. Fundamentally different parallel algorithms result depending on whether the list is maintained as a single shared data structure accessible to all processors, or else as the union of non-overlapping sublists, each private to a processor. We describe several variants of these approaches, and compare numerical performances of the algorithms on multi-dimensional problems.
A scaleable event infrastructure for peer to peer grids
Authors: Geoffrey Fox, Shrideep Pallickara, Xi Rao
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

In this paper we propose a peer-to-peer (P2P) grid comprising resources such as relatively static clients, high-end resources and a dynamic collection of multiple P2P subsystems. We investigate the architecture of the messaging and event service that will support such a hybrid environment. We designed a distributed publish-subscribe system NaradaBrokering for XML specified messages. NaradaBrokering interpolates between centralized systems like JMS (Java Message Service) and P2P environments. Here we investigate and present our strategy for the integration of JXTA into NaradaBrokering. The resultant system naturally scales with multiple Peer Groups linked by NaradaBrokering.
Integral equation of mixed type and integrals of orthogonal polynomials
Authors: M. A. Abdou
Venue: Journal of Computational and Applied Mathematics (2002)

A method is used to obtain the general solution of the Fredholm-Volterra integral equation of the first kind (FVIEFK) in the space L2(0,a) × C(0, T), 0 ≤ x ≤ a < ∞, 0 ≤ t ≤ T < ∞. The kernel of the Fredholm integal term is considered in a generalized discontinuous form which belongs to C([0,a] × [0,a]), while the kernel of Volterra integral term is a positive continuous function in the class C(0, T). Many interesting cases of integrals of orthogonal polynomials and spectral relationships are obtained and established from this work.
Enterprise JMS Programming
Authors: Shaun Terry, Terry Shawn
Venue:  (2002)

:Your Enterprise JMS Road Map J2EE's Java Message Service provides a common API for a variety of publish/subscribe and point-to-point messaging products commonly used in high-performance enterprise environments. Message types supported include XML, Java objects, and a variety of other basic formats. Written by one of Sun's senior Java architects, this clear and concise guide shows you how to put JMS to work in mission-critical enterprise applications  and helps you stay at the forefront of enterprise computing trends, including peer-to-peer and loosely-coupled application development. Robust examples and detailed coverage of advanced topics like JMS security and enterprise integration make this the most complete JMS reference available. Put JMS to Work Integrate JMS-based systems in Internet and application server environments Enable loosely-coupled applications to communicate with each other Find out when  and when not  to use JMS for network-oriented messaging Build message-driven Enterprise JavaBeans Maximize JMS performance for mission-critical applications Learn system architectures for data distribution, workflow, Internet order-taking, and more
C Programming: The Essentials for Engineering and Scientists, 1st edition
Authors: David R. Brooks
Venue:  (1999)

:This text presents the essentials of the C language, concentrating on what engineering and science students need to know to solve typical computational problems. It uses a learn-by-doing approach, with many examples of complete programs and exercises drawn from science and engineering disciplines. The text is written for undergraduate and graduate students who have had no previous formal introduction to a programming language. However, the text does assume that students are familiar with basic computer hardware, terminology, and applications.
Design pattern implementation in Java and aspectJ
Authors: Jan Hannemann, Gregor Kiczales
Venue: ACM SIGPLAN Notices (2002)

AspectJ implementations of the GoF design patterns show modularity improvements in 17 of 23 cases. These improvements are manifested in terms of better code locality, reusability, composability, and (un)pluggability.The degree of improvement in implementation modularity varies, with the greatest improvement coming when the pattern solution structure involves crosscutting of some form, including one object playing multiple roles, many objects playing one role, or an object playing roles in multiple pattern instances.
Wireless Networks: Catching the Mobile Future, 1st edition
Authors: R. Prasad, J. H. Weber, J. C. Arnbak
Venue:  (1994)

:The professional fields of Wireless Computer Networks and Personal, Indoor and Mobile Radio Communications have, within a few years, become the fastest growing business area of telecommunications. The papers presented in these volumes on WCN focus on the emerging wireless extensions of intelligent networking and other computer services. The contributions on PIMRC concentrate on the latest developments in radio technologies and network access.
A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
Authors: Stephen C. Billups, Layne T. Watson
Venue: SIAM Journal on Optimization (2002)

Convergence theory for a new probability-one homotopy algorithm for solving non-smooth equations is given. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of the residual has nonglobal local minima. The algorithm is based on constructing homotopy mappings that are smooth in the interior of their domains. The algorithm is specialized to solve mixed complementarity problems (MCP) through the use of MCP functions and associated smoothers. This specialized algorithm includes an option to ensure that all iterates remain feasible. Easily satisfiable sufficient conditions are given to ensure that the homotopy zero curve remains feasible, and global convergence properties for the MCP algorithm are proved. Computational results on the MCPLIB test library demonstrate the effectiveness of the algorithm.
Fingerprint identification using space invariant transforms
Authors: Vivek A. Sujan, Michael P. Mulqueen
Venue: Pattern Recognition Letters (2002)

An optical modeless Automatic Fingerprint Identification Systems (AFISs) is presented. The system uses a segmented Fourier-Mellin transform to preprocess the images. Image identification is performed using a HAusdorff-Voronoi NETwork (HAVNET), an artificial neural network designed for two-dimensional binary pattern recognition.
A distributed persistent object store for scalable service
Authors: Chao Jin, Weimin Zheng, Feng Zhou, Yinghui Wu
Venue: ACM SIGOPS Operating Systems Review (2002)

This paper presents a distributed persistent object store designed to simplify scalable service in cluster environment. This distributed object store, called TODS (Tsinghua Object Data Store), presents a single-imaged, transparent persistent and object-oriented view of the storage devices of the whole cluster. TODS is designed to be incremental scalable and efficient, and also has the properties of the high concurrency, high throughput and availability which are necessary for scalable service. TODS supports distributed ACID transactions within the cluster, which qualifies its use in the building of complex transactional services. And the user interface of TODS is fitter for building service than that of file system, and significantly easier to use than that of RDBMS. TODS is a reusable platform for scalable service in cluster by forming many general data management functions into one independent layer. This paper gives the motivation, principle and architecture of TODS. Some technique details are also discussed. In our performance experiments, the system scales smoothly to a 36-node server cluster and achieves 11,160 In-memory reads/sec and 396 transactions/sec.
Java Software Solutions: Foundations of Program Design, 2nd edition
Authors: John Lewis, William Loftus
Venue:  (1999)

:Using Java(TM) 1.1, Java Software Solutions teaches beginning programmers how to design and implement high-quality object-oriented software. The authors emphasize problem solving through understanding requirements, exploring options, and designing conceptually clean solutions. John Lewis and Bill Loftus wrote this book from the ground up, taking full advantage of Java to teach introductory programming. Throughout the book, the authors intertwine the use of applets and applications to demonstrate computing concepts. Applets are introduced early, building on the excitement of the web, while applications are used for readers to gain a clear understanding of programming concepts.
A Class of P-Matrices with Applications to the Localization of the Eigenvalues of a Real Matrix
Authors: J. M. Peña
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

A matrix with positive row sums and all its off-diagonal elements bounded above by their corresponding row means is called a B-matrix. It is proved that the class of B-matrices is a subset of the class of P-matrices. Properties of B-matrices are used to localize the real eigenvalues of a real matrix and the real parts of all eigenvalues of a real matrix.
Optimality Conditions for Irregular Inequality-Constrained Problems
Authors: A. F. Izmailov, M. V. Solodov
Venue: SIAM Journal on Control and Optimization (2001)

We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set is not assumed to be regular in the classical sense of Robinson and obtain a constructive description of the tangent cone under a certain new second-order regularity condition. This condition contains classical regularity as a special case, while being weaker when constraints are twice differentiable. Assuming that the cone defining the constraints is finitely generated, we also derive a special form of primal-dual optimality conditions for the corresponding constrained optimization problem. Our results subsume optimality conditions for both the classical regular and second-order regular cases, while still being meaningful in the more general setting in the sense that the multiplier associated with the objective function is nonzero.
How the Internet Works, 4th edition
Authors: Preston Gralla
Venue:  (1998)

:Covering today's latest technology, How the Internet Works, Fourth Edition explains the Internet and the technologies that make it work.