ppxscal/embedding_network huggingface dataset:
Program Generators with XML and Java with CD-ROM
Authors: Craig Craig Cleaveland, J. Craig Cleaveland
Venue:  (2001)

From the Book:PREFACE: PrefaceI've dreamed about writing this book for many years, but it did not turn out as I imagined. XML and Java are recent technologies that did not appear in my dreams. I've been working with program generators and domain engineering for nearly 20 years using primarily C and hand-crafted plain text languages. XML and Java provide a new context for these older technologies and they fit together. It was a joy to retrace the steps I had taken many years ago, and see how much easier and more elegant the trek is using XML and Java.I toyed with the idea of titling the book, "Program Generators for Fun and Profit." Writing a program generator is a lot of fun because instead of just writing a program, you write a program that writes programs. You think about how smart you can make your program generator. Some program generators are called "wizards!" Program generators are also very profitable. They are a critical piece of many software engineering development environments, particularly in the areas of user interfaces, databases, middleware, and language parsers and lexers.Once you've written a couple of program generators, you begin to wonder: Is there a better approach to figuring out what a program generator should do? The answer is yes, but it's been kept a secret. The better approach is called domain engineering, which is a systematic approach that identifies the important elements and requirements in a domain. This information is essential for efficiently building a program generator that meets customer needs.Many computer scientists, including myself, are fascinated with self-referential structures. One such structure isaprogram generator generator. A program generator generator is a program generator that generates program generators. It is a program that writes programs that write programs. Chapter 12 recapitulates some of the work I did at Bell Labs in this area, but this time in a simpler and more elegant style using XML and Java. It is simple enough that anyone can create his or her own program generator generator in a matter of days.
Persistence of Excitation Properties for Time-Varying Autoregressive Systems
Authors: Sergio Bittanti, M. C. Campi
Venue: SIAM Journal on Control and Optimization (2000)

It is well known that a crucial property for the effective identification of time-varying systems is that the data carry continual information on the parameters to be estimated. As a matter of fact, only in this case can the identification algorithm rely on fresh information in forming a reliable estimate of the current value of these parameters. This concept has been formalized in the system identification literature under the name of persistence of excitation.In this paper, the persistence of excitation property is studied for a class of time-varying systems (that includes the standard autoregressive model as a particular case) and conditions for it to hold are derived.
Event based resource estimation in admission control for wireless networks with heterogeneous traffic
Authors: Jelena Mišić, Samuel T. Chanson, Frederick S. Lai
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1997)

A technique for estimating the resources needed to maintain an upper bound on handoff dropping probability in wireless networks with heterogeneous traffic is presented. The calculation is based on the number and characteristics of connections in the surrounding cells. The information is collected from the base stations in the S surrounding rings and is updated at handoff and call termination events which involves simple arithmetic operations only. Based on the resource requirement estimation, a distributed adaptive admission control algorithm is proposed. We have evaluated the performance of the admission algorithm for the single traffic type case and derived the performance bounds as functions of traffic descriptors, cell capacity and value of the tuning parameter. It is shown that by adjusting the tuning parameter, the constraints imposed on the handoff dropping probability for a given type of traffic can be met while maximizing the cell capacity utilization and minimizing the new call blocking probabilities.
Mathematical Foundations for Computational Engineering: A Handbook
Authors: A. Jan Pahl, R. Damrath
Venue:  (2001)

:This book serves as a comprehensive handbook, bringing the fundamental mathematics of engineering computation into a suitable order for specific engineering purposes, showing their significance for typical applications. The relevant definitions, notations and theories are presented in a durable form which is independent of the fast development of information technology.
Lawyer's Guide to Internet Research
Authors: Kathy Biehl, Tara Calishain
Venue:  (2001)

:The law library of the future is already here! This down-to-earth, practical guide (written from the perspective of a working attorney) takes the problem-solving steps that lawyers already use and shows how-and where-to do them on the Internet. It zeroes in on the best sites, sources, and techniques for finding cases, statutes, regulations, legislative history, government forms, public records, other attorneys, experts, and more. It identifies the governments and agencies that accept online communication-not to mention filings-and lists research sites, legal news sources, and general reference aids. It also demystifies search engines and other Internet tools and recommends hundreds of Web sites for both legal and general research problems. Includes a painless crash course on using e-mail and news groups and maximizing the efficient use of web browsers. "The Lawyer's Guide to Internet Research" is a pioneering book that leads lawyers, paralegals, legal assistants, and students through the transition from traditional to Internet research, and teaches them how to use the Internet to do the same work that they have been doing for years in their offices and libraries. Author Biography: Kathy Biehl maintained a solo law practice for 16 years before turning to full-time writing and research. She has written more than 500 articles on legal, Internet, and general interest topics for national, regional, and online publications. A member of the State Bar of Texas, she has taught legal research and writing at the University of Houston Law Center and business law at Rice University.Tara Calishain is the owner of CopperSky Writing & Research and the editor of ResearchBuzz. She is theauthor or co-author of several books.
Managing Active Directory for Windows 2000 Server, 1st edition
Authors: Melissa Craft, Gary Rosenfeld
Venue:  (1999)

:Windows 2000's Active Directory provides a single uniform interface to all of the network's resources, including printers, documents, e-mail addresses, databases, and users. It also manages naming, querying, registration, and resolution needs. This book introduces readers to all of Active Directory's capabilities.
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
Authors: Guoliang Xue, Yinyu Ye
Venue: SIAM Journal on Optimization (1997)

In recent years rich theories on polynomial-time interior-point algorithms have been developed. These theories and algorithms can be applied to many nonlinear optimization problems to yield better complexity results for various applications. In this paper, the problem of minimizing a sum of Euclidean norms is studied. This problem is convex but not everywhere differentiable. By transforming the problem into a standard convex programming problem in conic form, we show that an $\epsilon$-optimal solution can be computed efficiently using interior-point algorithms. As applications to this problem, polynomial-time algorithms are derived for the Euclidean single facility location problem, the Euclidean multifacility location problem, and the shortest network under a given tree topology. In particular, by solving the Newton equation in linear time using {\em Gaussian elimination on leaves of a tree}, we present an algorithm which computes an $\epsilon$-optimal solution to the shortest network under a given full Steiner topology interconnecting N regular points, in $O(N \sqrt{N}(\log(\bar c/\epsilon)+\log N))$ arithmetic operations where $\bar c$ is the largest pairwise distance among the given points. The previous best-known result on this problem is a graphical algorithm which requires O(N2) arithmetic operations under certain conditions.
Educational models and open source: resisting the proprietary university
Authors: Brenton D. Faber
Venue: Proceedings of the 20th annual international conference on Computer documentation (2002)

This paper presents an educational model derived from open source methods for computer programming. The article places this search for an alternative model within a framework of proprietary educational practices that are driven by a need for efficiency and rationalization. As an alternative model, the paper suggests that an open source derived educational process would emphasize collaborative problem based learning, working through drafts, risk taking, mentoring, user testing, releasing early and often, developing in collaboration with users, and rewarding and building from failure.At the same time, the paper notes that such a system would have much in common with existing theories of project-based or activity-based learning and with traditional methods of research and publication in scientific endeavors. However, the paper also argues that such a method is different from the open-course or open-curriculum projects recently publicized by several well-known universities as these practices appear to emphasize derived content rather than an open representation of process, or how the content was developed.Collaborative, problem-based learning provides constructive approaches for building corporate and community partnerships on university campuses. At the same time, the model teaches students about collaborative work practices, working as part of a larger community, and the nature of collaborative knowledge building. As such, the model reconnects knowledge creation to research communities and to communities of users and it complicates the belief that sustainable, useful innovation can occur within proprietary systems.
Dynamic HTML in Action, 1st edition
Authors: Michele Petrovsky
Venue:  (1997)

:An early book on the next major step forward in the HTML revolution-keep your programming related customers uup-to-date on the newest technology. Book shows reader how to put dynamic HTML "In Action" to create Web pages with more snap and interactivity-step-by-step instruction to build dynamic Web content. Special Dynamic HTML Web Site from Osborne to accompany the Web site building project in the book-the perfect template for readers who want to build a highly active and dynamic Web page.
Inside Adobe PhotoShop 5 with Cdrom, 1st edition
Authors: Gary David Bouton, Barbara Mancuso Bouton, Gary Kubicek
Venue:  (1998)

:Inside Adobe Photoshop.0 teaches Photoshop s capabilities through step-by-step techniques that are specifically designed to create knowledge and effects that readily transfer to other uses of image editing in Photoshop. Inside Photoshop.0 offers tips, tricks, and invaluable high-end techniques that result in top quality professional images. Topics will include: Customizing Photoshop and working with New Features Working with Selections, Paths, and Layers Retouching a Photograph Working with Mixed Media Creating a Perfect Image Batch Processing Filters and Special Effects Outputting your Input Creating Graphics for the Web and building AnimationsInside Photoshop.0 is the only book you need to master the latest release of Photoshop! The new edition is completely revised with all new artwork and tutorials.Returning author Gary Bouton s creative style and technical know-how is famous among Photoshop users.Photoshop.0 is a significant update over previous versions and even expert users will need books to quickly take advantage of the new features and tools.
On Green's Matrices of Trees
Authors: Reinhard Nabben
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

The inverse C = [ci,j] of an irreducible nonsingular symmetric tridiagonal matrix is a so-called Green's matrix. A Green's matrix is a symmetric matrix which is given by two sequences of real numbers {ui} and {vi} such that ci,j = uivj for $i \leq j$. A similar result holds for nonsymmetric matrices. An open problem on nonsingular sparse matrices is whether there exists a similar structure for their inverses as in the tridiagonal case. Here we positively answer this question for irreducible acyclic matrices, i.e., matrices whose undirected graphs are trees. We prove that the inverses of irreducible acyclic symmetric matrices are given as the Hadamard product of three matrices, a type D matrix, a flipped type D matrix, and a matrix of tree structure which is closely related to the graph of the original matrix itself. For nonsymmetric matrices we obtain a similar structure. Moreover, our results include the result for symmetric and nonsymmetric tridiagonal matrices.
Some permutation routing algorithms for low-dimensional hypercubes
Authors: F. K. Hwang, Y. C. Yao, B. Dasgupta
Venue: Theoretical Computer Science (2002)

Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such that all the 2d destinations are distinct. Kaklamanis et al. (Math. Syst. Theory 24 (1991) 223-232) used the decomposability of hypercubes into Hamiltonian circuits to give an asymptotically optimal routing algorithm. The notion of "destination graph" was first introduced by Borodin and Hopcroft to derive lower bounds on routing algorithms. This idea was recently used by Grammatikakis et al. (Proceedings of the Advancement in Parallel Computing, Elsevier, Amsterdam, 1993) to construct many-one routing algorithms for the binary 2-cube and 3-cube. In the present paper, further theoretical development is made along this line. It is then applied to obtain algorithms for binary d-cubes with d up to 12, which compare favorably with the above-mentioned "Hamiltonian circuit" algorithm. Some results on t-nary cubes with t&ge;3 are also obtained.
Information Appliances and Beyond, 1st edition
Authors: Eric Bergman
Venue:  (2000)

:"This book is both visionary and practical: future consumer electronics, toys, and games need great usability or customers will abandon them. "My new cell-phone is so complicated that I need a two-week training class." Not!" Jakob Nielsen Usability Guru, Nielsen Norman Group "An important book. Anyone involved in either interaction design or the development of information appliances will find food for thought, and everyone in the industry should read Rob Haitani's observations about designing the PalmPilot." Alan Cooper, Cooper Interaction Design Information appliances and other interactive products "beyond the desktop" present user interface design challenges that are only beginning to be understood. In this one-of-a-kind book, interaction designers examine the issues they confronted in their projects: Microsoft Windows CE, a vehicle navigation system, interactive children's toys, and more. You'll enjoy reading their engaging and sometimes surprising stories, but more importantly you'll gain insights that will benefit your own design and development work. Features Begins with an interview in which design expert Don Norman details his vision of "making technology invisible." Includes an eight-page, full-color insert containing screen shots, product diagrams, and other illustrations. Presents inside accounts of information appliance success stories including: An interview with Rob Haitani, lead interaction designer of the original PalmPilot The design and evaluation methodologies behind Nokia's mobile phones The high-level information appliance design considerations emphasized by Sun Microsystems Essential reading for interaction designers, human factors engineers, usability specialists, software engineers and project managers working in all of these areas.
Smart Card Manufacturing: A Practical Guide
Authors: Yahya Haghiri, Thomas Tarantino
Venue:  (2001)

:Demand for the increased protection of personal data has caused a significant rise in the profile of smart cards, and this will continue to be a major growth area with secure mobile communication and e-commerce applications . An understanding of the structure and manufacturing of smart cards is key to the continued development of intelligent systems. First published in German, Hanser, Haghiri and Tarantino have produced the standard reference on the structure of smart cards and the technologies for embedding chips into smart cards. Detailed coverage of the practicalities and mechanics of smart card manufacture will appeal to a range of software developers, practitioners and students from within the electronics, security, and communications arenas. * Details the structure and manufacturing processes of smart cards, an area largely omitted from other recent publications. * Coverage of the full range of techniques applied to the development and production of smart cards. * Presents an overview of the development of smartcards and the range of their evolving applications.
Graphical problem solving and visual communication in the beginning computer graphics course
Authors: Steve Cunningham
Venue: ACM SIGCSE Bulletin (2002)

The beginning computer graphics course can teach much more than just computer graphics. It can also provide an excellent introduction to graphical problem solving and visual communication, and in so doing can be an excellent complement to other computer science courses that teach more analytical problem solving. This paper describes the graphical problem-solving and visual communication contexts and discusses how they can be supported by the beginning computer graphics course.
Neural Network Time Series Forecasting of Financial Markets, 1st edition
Authors: E. Michael Azoff
Venue:  (1994)

:A neural network is a computer program that can recognise patterns in data, learn from this and (in the case of time series data) make forecasts of future patterns. There are now over 20 commercially available neural network programs designed for use on financial markets and there have been some notable reports of their successful application. However, like any other computer program, neural networks are only as good as the data they are given and the questions that are asked of them. Proper use of a neural network involves spending time understanding and cleaning the data: removing errors, preprocessing and postprocessing. This book takes the reader beyond the 'black-box' approach to neural networks and provides the knowledge that is required for their proper design and use in financial markets forecasting - with an emphasis on futures trading. Comprehensively specified benchmarks are provided (including weight values), drawn from time series examples in chaos theory and financial futures. The book covers data preprocessing, random walk theory, trading systems and risk analysis. It also provides a literature review, a tutorial on backpropagation, and a chapter on further reading and software. For the professional financial forecaster this book is without parallel as a comprehensive, practical and up-to-date guide to this important subject.
Interoperating Geographic Information Systems, 1st edition
Authors: Michael F. Goodchild, Cliff Kottman, Max J. Egenhofer
Venue:  (1999)

:Interoperating Geographic Information Systems is about efforts to improve the ability of GISs to interoperate, and has been assembled through a collaboration between academic researchers and the software vendor community under the auspices of the US National Center for Geographic Information and Analysis and the Open GIS Consortium Inc. It includes chapters on the basic principles and the various conceptual frameworks that the research community has developed to think about the problem. Other chapters review a wide range of applications and the experiences of the authors in trying to achieve interoperability at a practical level. Interoperability opens enormous potential for new ways of using GIS and new mechanisms for exchanging data, and these are covered in chapters on information marketplaces, with special reference to geographic information. Institutional arrangements are also likely to be profoundly affected by the trend towards interoperable systems, and nowhere is the impact of interoperability more likely to cause fundamental change than in education, as educators address the needs of a new generation of GIS users with access to a new generation of tools. The book is suitable as a secondary text for graduate level courses in computer science, geography, spatial databases, and interoperability and as a reference for researchers and practitioners in industry, commerce and government.
Systems Analysis and Design, 4th edition
Authors: Kenneth E. Kendall, Julie E. Kendall
Venue:  (1998)

:OFTEN IMITATED, NEVER DUPLICATED... There is simply no other Systems Analysis and Design textbook as exciting as Kendall & Kendall'. Their dynamic, comprehensive presentation leaves no stone unturned. With plenty of review questions and problems, hypothetical consulting situations, an ongoing case study, and even an associated Internet-based case study, this book makes the concepts of the course understandable and motivating. You are given all the tools to learn how to become a successful systems analyst, ace your exams, and have fun doing it' YOU WANT TO LEARN HOW TO BE A SYSTEMS ANALYST AND SYSTEMS DESIGNER... This book includes expanded coverage of data flow diagrams, data dictionaries, and process specifications, as it introduces examples of new software used by analysts and designers to manage projects, analyze and document systems, design new systems, and implement their plans. YOU NEED CURRENT TOPICS IN SYSTEMS ANALYSIS AND DESIGN... The fifth edition of Systems Analysis and Design has new coverage of UML, wireless technologies, ERP, Web-based systems for e-commerce, and expanded coverage on RAD and GUI design. YOU WANT YOUR SYSTEMS ANALYSIS AND DESIGN TEXT TO GIVE YOU HANDS-ON EXPERIENCE... HyperCaseoriginal, hypertext-based software created by the authorsis located on the text's Companion Web site: www.prenhall.com/kendall. This innovative software gives users firsthand experience with a business and organizational structure, allowing you to interview employees, observe office dynamics and practices, analyze prototypes, and review existing systems. The case, a businesssimulation called "Maple Ridge Engineering," is revisited throughout the text, with end-of-chapter exercises. All activities are based on real-life consulting experiences. YOU MUST HAVE INFORMATION ON HOW TO GET EXPERIENCE AS A SYSTEMS ANALYST... The authors include new coverage on analyzing e-commerceincluding thorough new material of e-commerce Web site designand more than 70 consulting opportunities, including new ones with an e-commerce focus. Students can evaluate the political, ethical, social, and economic implications of their systems design in these mini-cases. KENDALL & KENDALL, SYSTEMS ANALYSIS AND DESIGN, FIFTH EDITION giving you the tools to learn, practice, and perfect your skills in Systems Analysis and Design like no other text on the market ever has or ever will!