ppxscal/embedding_network huggingface dataset:
Enterprise Application Architecture W/VB ASP
Authors: Joseph Moniz
Venue:  (1999)

:This book is about delivering professional Enterprise systems in Visual Basic 6. This book begins where Professional VB5/6 Business Objects left off. It offers a sophisticated response to the Business Objects book, and takes the dialog further. It also offers an aware response to the techno-political situation at the Enterprise level for Visual Basic. By definition, the task of delivering an enterprise is a huge undertaking. Microsoft's enterprise offerings have evolved to the point where they pose a serious threat to existing enterprise level platforms. Microsoft's promised lower total cost of ownership is driving many companies to replace at least a portion of their enterprise systems with Windows NT Enterprise Server and Back Office suite of servers. While there are many books that consider some portion or another of the enterprise, there few if any that address the enterprise as a whole while still providing the technical details developers and integration teams require for real-world execution and delivery. The information required to stitch together the components essential for an enterprise system can only be found scattered across several tens of manuals that span many disciplines. Managers and developers alike need a clear vision of what constitutes an enterprise system. This book is designed to consider the problem of delivering an enterprise as a whole. It covers hardware from a developer's perspective. It provides step-by-step installation and configuration instructions for Windows NT Cluster server and the Back Office suite of servers. Then it expands upon and improves the Professional Visual Basic 5.0 Object methodology.
Visualizing multi-dimensional clusters, trends, and outliers using star coordinates
Authors: Eser Kandogan
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

Interactive visualizations are effective tools in mining scientific, engineering, and business data to support decision-making activities. Star Coordinates is proposed as a new multi-dimensional visualization technique, which supports various interactions to stimulate visual thinking in early stages of knowledge discovery process. In Star Coordinates, coordinate axes are arranged on a two-dimensional surface, where each axis shares the same origin point. Each multi-dimensional data element is represented by a point, where each attribute of the data contributes to its location through uniform encoding. Interaction features of Star Coordinates provide users the ability to apply various transformations dynamically, integrate and separate dimensions, analyze correlations of multiple dimensions, view clusters, trends, and outliers in the distribution of data, and query points based on data ranges. Our experience with Star Coordinates shows that it is particularly useful for the discovery of hierarchical clusters, and analysis of multiple factors providing insight in various real datasets including telecommunications churn.
Secure and efficient key management for dynamic multicast groups
Authors: Chang-Seop Park, Dong-Hoon Lee
Venue: ACM SIGOPS Operating Systems Review (2001)

Proposals for key management of secure multicast that have been published so far are concentrated on reducing the complexity of communication for rekeying. If a group manager controls several multicast application groups and each of them involves a large number of members, it is important to maintain a set of secret keys as small as possible in order to reduce the group manager's storage for key management. In this paper, we propose a tree-based key management scheme, where the group manager can access keys by computing on the fly, without storing them. Using a concept of ID-based key generation and node bits on the tree, a storage for key management by the group manager can be greatly reduced.
Automatic layout of domain-specific reconfigurable subsystems for system-on-a-chip
Authors: Shawn Phillips, Scott Hauck
Venue: Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays (2002)

When designing SOCs, a unique opportunity exists to generate custom FPGA architectures that are specific to the application domain in which the device will be used. The inclusion of such a device will provide an efficient compromise between the flexibility of software and the performance of hardware, while at the same time allowing for post-fabrication modification of circuits. To automate the layout of reconfigurable subsystems for system-on -a-chip we present template reduction, standard cell, and circuit generator methods. We explore the standard cell method, as well as the creation of FPGA-specific standard cells. Compared to full custom circuits, we achieve designs that are 46% smaller and 36% faster when the application domain is well known in advance. In cases where no reduction from the full functionality is possible, the standard cell approach is 42% larger and 64% slower than full-custom circuits. Standard cells can thus provide competitive implementations, with significantly greater opportunity for adaptation to new domains.
Winter simulation: development of a fast all-seasons model for the state of the ground
Authors: Mary Albert, George Koenig, George Mason
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

For predicting soil conditions in support of mobility, combat, or engineering simulations, it is important to have verified models that can reliably predict the state of the ground in all weather conditions. While variations in the state of the ground in summer are due primarily to soil type, vegetation, and slope, the winter and spring seasons present additional challenges that are currently not addressed by most Army models. Because the depth of snow on the ground varies greatly through the winter, a prediction capability is needed for the rate of snow accumulation and melt that will allow predictions of snow depth. Ground freezing/thawing or the presence of mud can significantly change soil strength, requiring a prediction capability for soil moisture and freeze/thaw. This paper describes progress in the development of FASST, the Fast All-Seasons Soil STate model. FASST is a physically based model currently under development to predict the state of the ground using minimal computational time and resources. FASST predicts soil moisture, snow depth, frost depth, snowpack melt outflow, soil temperature, and soil strength on an hourly basis. The physical basis of the model is presented, and preliminary model predictions are compared to measured field data.
Proceedings of the ACM symposium on Virtual reality software and technology
Venue: Virtual Reality Software and Technology (2001)

VRST 2001 is the Eighth Annual ACM Conference on Virtual Reality Software and Hardware Technology. The aim is to provide a varied program that covers basic research and applications, with papers from a wide range of countries. This year's technical program includes refereed papers from 13 countries, plus two panel sessions organized around the them of VR as a cultural artifact.Each paper in the program was reviewed by three members of the International Program Committee. Of the 49 papers submitted, the International Program Committee selected 24 for inclusion in the program.
Vibration Simulation Using MATLAB and ANSYS, 1st edition
Authors: Michael R. Hatch
Venue:  (2000)

:Transfer function form, zpk, state space, modal, and state spacemodal forms. For someone learning dynamics for the first time or for engineers who use the tools infrequently, the options available for constructing and representing dynamic mechanical models can be daunting. It is important to find a way to put them all in perspective and have them available for quick reference. It is also important to have a strong understanding of modal analysis, from which the total response of a system can be constructed. Finally, it helps to know how to take the results of large dynamic finite element models and build small MATLAB(r) state space models. Vibration Simulation Using MATLAB and ANSYS answers all those needs. Using a three degree-of-freedom (DOF) system as a unifying theme, it presents all the methods in one book. Each chapter provides the background theory to support its example, and each chapter contains both a closed form solution to the problem-shown in its entirety-and detailed MATLAB code for solving the problem. Bridging the gap between introductory vibration courses and the techniques used in actual practice, Vibration Simulation Using MATLAB and ANSYS builds the foundation that allows you to simulate your own real-life problems. Features o Demonstrates how to solve real problems, covering the vibration of systems from single DOF to finite element models with thousands of DOF o Illustrates the differences and similarities between different models by tracking a single example throughout the book o Includes the complete, closed-form solution and the MATLAB code used to solve each problem o Shows explicitly how to take the results of a realistic ANSYS finite element model and develop a small MATLAB state-space model o Provides a solid grounding in how individual modes of vibration combine for overall system response
Bounding Cache-Related Preemption Delay for Real-Time Systems
Authors: Chang-Gun Lee, Kwangpo Lee, Joosun Hahn, Yang-Min Seo, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Minsuk Lee, Chong Sang Kim
Venue: IEEE Transactions on Software Engineering (2001)

Cache memory is used in almost all computer systems today to bridge the ever increasing speed gap between the processor and main memory. However, its use in multitasking computer systems introduces additional preemption delay due to the reloading of memory blocks that are replaced during preemption. This cache-related preemption delay poses a serious problem in real-time computing systems where predictability is of utmost importance. In this paper, we propose an enhanced technique for analyzing and thus bounding the cache-related preemption delay in fixed-priority preemptive scheduling focusing on instruction caching. The proposed technique improves upon previous techniques in two important ways. First, the technique takes into account the relationship between a preempted task and the set of tasks that execute during the preemption when calculating the cache-related preemption delay. Second, the technique considers the phasing of tasks to eliminate many infeasible task interactions. These two features are expressed as constraints of a linear programming problem whose solution gives a guaranteed upper bound on the cache-related preemption delay. This paper also compares the proposed technique with previous techniques using randomly generated task sets. The results show that the improvement on the worst-case response time prediction by the proposed technique over previous techniques ranges between 5 percent and 18 percent depending on the cache refill time when the task set utilization is 0.6. The results also show that as the cache refill time increases, the improvement increases, which indicates that accurate prediction of cache-related preemption delay by the proposed technique becomes increasingly important if the current trend of widening speed gap between the processor and main memory continues.
Code Optimization Techniques for Embedded Processors: Methods, Algorithms, and Tools
Authors: Rainer Leupers
Venue:  (2000)

:The building blocks of today's embedded systems-on-a-chip are complex IP components and programmable processor cores. This means that more and more system functionality is implemented in software rather than in custom hardware. In turn, this indicates a growing need for high-level language compilers, capable of generating efficient code for embedded processors. However, traditional compiler technology hardly keeps pace with new developments in embedded processor architectures. Many existing compilers for DSPs and multimedia processors therefore produce code of insufficient quality with respect to performance and/or code size, and a large part of software for embedded systems is still being developed in assembly languages. As both embedded software as well as processor architectures are getting more and more complex, assembly programming clearly violates the demands for a short time-to-market and high dependability in embedded system design. The goal of this book is to provide new methods and techniques to software and compiler developers, that help to make the necessary step from assembly programming to the use of compilers also in embedded system design. Code Optimization Techniques for Embedded Processors discusses the state-of-the-art in the area of compilers for embedded processors. It presents a collection of new code optimization techniques, dedicated to DSP and multimedia processors. These include: compiler support for DSP address generation units, efficient mapping of data flow graphs to irregular architectures, exploitation of SIMD and conditional instructions, as well as function inlining under code size constraints. Comprehensive experimental evaluations are given for real-life processors, that indicate the code quality improvements which can be achieved as compared to earlier techniques. In addition, C compiler frontend issues are discussed from a practical viewpoint. Code Optimization Techniques for Embedded Processors is intended for researchers and engineers active in software development for embedded systems, and for compiler developers in academia and industry.
America Online for Busy People, 2nd edition
Authors: David Einstein
Venue:  (1998)

:Whether you're new to America Online or looking to improve your skills, America Online For Busy People, Second Edition has even more time-saving techniques and vital shortcuts for mastering AOL quickly and efficiently. From connecting with the Internet to customizing AOL, Busy People Books put you on the fast track to success. 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
LabVIEW: Data Acquisition and Analysis for the Movement Sciences with Disk, 1st edition
Authors: Andrew L. McDonough
Venue:  (2000)

:A one of a kind book that connects the LabView programming language with data acquisition and analysis. The hands-on approach includes ample practice exercises and provides a practical and direct way to learn, write and use programs for the purpose of collecting and analyzing human performance data. : Includes CD-ROM disk containing ready-to-use virtual instruments. The manual shows users how to build and run basic and more advanced computer programs within the flexible graphical framework of LabVIEW. For anyone interested in applying LabView programming language to the movement sciences. 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
Learning algebraic structures from text
Authors: Frank Stephan, Yuri Ventsov
Venue: Theoretical Computer Science (2001)

The present work investigates the learnability of classes of substructures of some algebraic structures: submonoids and subgroups of given groups, ideals of given commutative rings, subfields of given vector spaces. The learner sees all positive data but no negative one and converges to a program enumerating or computing the set to be learned. Besides semantical (BC) and syntactical (Ex) convergence also the more restrictive ordinal bounds on the number of mind changes are considered. The following is shown: (a) Learnability depends much on the amount of semantic knowledge given at the synthesis of the learner where this knowledge is represented by programs for the algebraic operations, codes for prominent elements of the algebraic structure (like 0 and 1 fields) and certain parameters (like the dimension of finite-dimensional vector spaces). For several natural examples, good knowledge of the semantics may enable to keep ordinal mind change bounds while restricted knowledge may either allow only BC-convergence or even not permit learnability at all. (b) The class of all ideals of a recursive ring is BC-learnable iff the ring is Noetherian. Furthermore, one has either only a BC-learner outputting enumerable indices or one can already get an Ex-learner converging to decision procedures and respecting an ordinal bound on the number of mind changes. The ring is Artinian iff the ideals can be Ex-learned with a constant bound on the number of mind changes, this constant is the length of the ring. Ex-learnability depends not only on the ring but also on the representation of the ring. Polynomial rings over the field of rationals with n variables have exactly the ordinal mind change bound in the standard representation. Similar results can be established for unars. Noetherian unars with one function can be learned with an ordinal mind change bound a&ohgr; for some a. Copyright 2001 Elsevier Science B.V. All rights reserved.
On clustering and retrieval of video shots
Authors: Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang
Venue: Proceedings of the ninth ACM international conference on Multimedia (2001)

Clustering of video data is an important issue in video abstraction, browsing and retrieval. In this paper, we propose a two-level hierarchical clustering approach by aggregating shots with similar motion and color features. Motion features are computed directly from 2D tensor histograms, while color features are represented by 3D color histograms. Cluster validity analysis is further applied to automatically determine the number of clusters at each level. Video retrieval can then be done directly based on the result of clustering. The proposed approach is found to be useful particularly for sports games, where motion and color are important visual cues when searching and browsing the desired video shots. Since most games involve two teams, clsssification and retrieval of teams becomes an interesting topic. To achieve these goals, nevertheless, an initial as well as critical step is to isolate team players from background regions. Thus, we also introduce approach to segment foreground objects (players) prior to classification and retrieval.
Financial engineering and computation: principles, mathematics, and algorithms
Venue:  (2001)

During the past decade many sophisticated mathematical and computational techniques have been developed for analyzing financial markets. Students and professionals intending to work in any area of finance must not only master advanced concepts and mathematical models but must also learn how to implement these models computationally. This comprehensive text combines a thorough treatment of the theory and mathematics behind financial engineering with an emphasis on computation, in keeping with the way financial engineering is practiced in today's capital markets. Unlike most books on investments, financial engineering, or derivative securities, the book starts from basic ideas in finance and gradually builds up the theory. The advanced mathematical concepts needed in modern finance are explained at accessible levels. Thus it offers a thorough grounding in the subject for MBAs in finance, students of engineering and sciences who are pursuing a career in finance, researchers in computational finance, system analysts, and financial engineers.
David McCarter's VB Tips and Techniques, 1st edition
Authors: David McCarter
Venue:  (2000)

:Visual Basic is the most popular programming language in the world today. While there are many books on how to learn Visual Basic, none focus on the "bite sized" tips and techniques that maximize a Visual Basic professionals productivity in the real, day-to-day, programming world. McCarter's many tips and techniques solve the kinds of "gotchas" that professionals could previously learn only from through many years of experience
CNE Testing Guide for Intranetware with Cdrom
Authors: Frank Cabiroy
Venue:  (1997)

:The CNE certification is one of the most notoriously difficult tests to pass--so why let the exam be the first time to practice answering test questions? This book contains nearly two thousand sample questions covering topics that appear on the various CNE tests, providing detailed answers that give the reader instant access to the vital information. Includes a CD with additional test simulations. 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
Netpractice: A Beginner's Guide to Healthcare Networking on the Internet, 1st edition
Authors: Mary F. Miller
Venue:  (1996)

:This new self-instructional guide is designed to give everyone from medical staff professionals to information managers to physicians and nurses a no-nonsense approach to navigating on the Internet. NetPractice assumes you know nothing about the Internet. It doesn't try to overwhelm you with the gamut of Internet services and protocols. Instead, it lays the foundation for the most common and practical use for the Internet - global communications. Comprised of over 200 pages of practical, user-friendly tips and step-by-step instructions, NetPractice provides tutorials, exercises, checklists, and fundamental strategies to maximize your online experience. 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
Benchmarking for Effective Network Management
Authors: Kornel Terplan
Venue:  (1995)

:The increasing complexity of today's communications networks has left many network managers and CIOs unable to answer certain basic questions. What is the network they manage worth? How does the network management stand up to industry norms? What is the best way to improve the efficiency of network management? This confusion has led to the growing practice of benchmarking: an in-depth comparison of network management functions and instruments of two or more companies in order to establish quantifiable indicators of network management efficiency. Featuring dozens of practical real-world examples, this easy-to-use text contains complete guidelines for conducting effective benchmark analyses. Packed with techniques for gathering the hard data upon which to base such crucial decisions as whether or not to outsource network management, this unique reference will teach you how to: evaluate management expenses ... review processes and instruments ... conduct effective personnel interviews ... observe and analyze day-to-day operations ... and much more.