ppxscal/embedding_network huggingface dataset:
Learning Python, 2 edition
Authors: Mark Lutz
Venue:  (2003)

: Learning Python is an introduction to the increasingly popular Python programming language. Python is an interpreted, interactive, object-oriented scripting language. Python is growing in popularity because: It is available on all important platforms: Windows NT, Windows 95, Windows 98, Linux, all major UNIX platforms, MacOS, and even the BeOS. It is open-source software, copyrighted but freely available for use, even in commercial applications. Its clean object-oriented interface makes it a valuable prototyping tool for C++ programmers. It works well with all popular windowing toolkits, including MFC, Tk, Mac, X11, and Motif. Learning Python is written by Mark Lutz, author of Programming Python and Python Desktop Reference; and David Ascher, a vision scientist and Python user. This book starts with a thorough introduction to the elements of Python: types, operators, statements, functions, modules, and exceptions. By reading the first part of the book, the reader will be able to understand and construct programs in the Python language. In the second part of the book, the authors present more advanced information, demonstrating how Python performs common tasks and presenting real applications and the libraries available for those applications. All the examples use the Python interpreter, so the reader can type them in and get instant feedback. Each chapter ends with a series of exercises. Solutions to the exercises are in an appendix.
A protocol synthesis algorithm: a relational approach
Authors: K. Zeroual, M. El Yassini
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

The protocol engineering plays an important role in computer networks. Designing a protocol is a challenging activity because of the complexity of the rules defining the interaction between the communicating entities. At this point, formal approaches have been proposed: Analysis and Synthesis. The synthesis approach has the advantage of avoiding errors a priori and ensuring some desirable properties during the protocol design process. In this paper, we propose a relational protocol synthesis method. The method outcome is specifications of all protocol entities serving the different service access points, which are represented in R-net diagrams
A termination proof for epsilon substitution using partial derivations
Authors: G. Mints
Venue: Theoretical Computer Science (2003)

Epsilon substitution method introduced by Hilbert is a successive approximation process providing numerical realizations from proofs of existential formulas. Most convergence (termination) proofs for it use assignments of decreasing ordinals to stages of the process and work only for predicative systems. We describe a new ordinal assignment for the case of first-order arithmetic admitting extension to impredicative systems. It is based on an interpretation of individual epsilon substitutions forming the substitution process as incomplete finite proofs, each encoding a complete but infinite proof.
Clock Scheduling for Power Supply Noise Suppression using Genetic Algorithm with Selective Gene Therapy
Authors: Wai-Ching Douglas Lam, Cheng-Kok Koh, Chung-Wen Albert Tsao
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Simultaneous switching events in the clock lines and almost simultaneousswitching events of sequential and combinational logic elementscause large L·di/dt and IR voltage variations in the power andground network of a circuit. This is known as power supply noise and itaffects the performance and reliability of the entire circuit. In this paper,we propose a genetic algorithm based clock scheduling approachfor minimizing the number of simultaneous switching events such thatthe power supply noise is suppressed. We ensure that in any generationof the genetic algorithm process, there will be feasible clock schedulespresent in the gene pool by the use of gene therapy. Experimental resultson benchmark circuits show an average reduction of 26.2% inthe peak current, an average reduction of 37.9% in the current swing,and an average reduction of 46.2% in voltage variations in the powerlines.
Windows Terminal Services (Mark Minasi Windows Administrator Library), 1 edition
Authors: Christa Anderson
Venue:  (2002)

:Finally: Server-Side Computing Based on Functionality Native to Windows With the inclusion of Terminal Services as a core part of Windows 2000 Server, building and maintaining an effective server-based computing environment became a lot easier. Windows Terminal Services makes it easier still, teaching you all the techniques required to deliver the Windows desktop and Windows applications to a wide range of client devices and machines. Clear, consistent examples illustrate these techniques in detail-so you stay on track and accomplish all your goals. Coverage includes: Understanding the client display features associated with each protocol and version Understanding the Terminal Services and MetaFrame XP licensing models Building better application servers Installing and configuring Terminal Services and MetaFrame XP Automatically distributing RDP and ICA clients Planning client access to server and network resources Troubleshooting client connection problems Managing user sessions Installing and configuring printer access for terminal sessions Installing and configuring applications on application servers Securing application servers at the network, server, and client levels Tuning application server performance About the Series The Mark Minasi Windows Administrator Library equips system administrators with in-depth technical solutions to the many challenges associated with administering Windows in an enterprise setting. The series editor is leading Windows expert Mark Minasi, who selects the topics and authors, then develops and reviews each book to ensure that it meets your needs and helps you achieve your goals. About the Author Christa Anderson is senior contributing editor for Windows and .NET Magazine and co-author of Mastering Windows 2000 Server, from Sybex. An internationally known expert on terminal services, she is frequently a featured speaker on the subject at conferences and other events.
Memory Hierarchy Optimization of Multimedia Applications on Programmable Embedded Cores 1
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Data Memory hierarchy optimization and partitioning for a widely used multimedia application kernel known as the hierarchical motion estimation algorithm is undertaken, with the use of global loop and data-reuse transformations for three different embedded processor architecture models. Exhaustive exploration of the obtained results clarifies the effect of the transformations on power, area, and performance and also indicates a relation between the complexity of the application and the power savings obtained by this strategy. Furthermore, the significant contribution of the instruction memory, even after the application of performance optimizations to the total power budget becomes evident and a methodology is introduced in order to reduce this component. 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
A Fuzzy Shape Database for Creative Design
Authors: Jinglan Zhang, Binh Pham, Phoebe Chen
Venue:  (2000)

At the conceptual stage of design, designers only have vague ideas of initial shapes which they gradually refine. These imprecise shapes may be specified by a set of fuzzy shape descriptors which represent the intent of a designer. It is also desirable to be able to save them in a database for future reference or for use as initial shapes for new designs. Most research on fuzzy databases has been focused on theoretical aspects while a fuzzy database is rarely seen in practice, especially in the design area. This paper aims to construct a fuzzy shape database to support shape design by integrating fuzzy data processing and fuzzy querying functions into a conventional database. A possibility-based framework is used for a fuzzy relational database model.
Improved Algorithms via Approximations of Probability Distributions
Authors: Suresh Chari, Pankaj Rohatgi
Venue:  (1997)

We present two techniques for approximating probability distributions. The first is a simple method for constructing the small-bias probability spaces introduced by Naor and Naor. We show how to efficiently combine this construction with the method of conditional probabilities to yield improved NC algorithms for many problems such as set discrepancy, finding large cuts in graphs, finding large acyclic subgraphs etc. The second is a construction of small probability spaces approximating general independent distributions, which is of smaller size than the constructions of Even, Goldreich, Luby, Nisan and Velickovic. Such approximations are useful, e.g., for the derandomization of certain randomized algorithms. In addition to other support, Aravind Srinivasan''s research was supported in part by NSF grant NSF-STC91-19999 to DIMACS and by support to DIMACS from the New Jersey Commission on Science and Technology.
Load Balancing Study in PCS Wireless Networks
Authors: Azzedine Boukerche, Alessandro Fabbri
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Wireless networking technologies and mobile cellular communication systems are growing at an ever-faster rate, and this is likely to continue in the foreseeable future. Higher reliability, better coverage and services, higher capacity, mobility management, and wireless multimedia are all parts of the potpourri. The evolution of new systems and improved designs will always depend on the ability to predict system performance using analytical or simulation methods. T o date, mathematical analysis has brought some insight into the design of such systems. However, analytical methods are often not general or detailed enough for evaluation and comparison of various proposed mobile and/or wireless systems and their services. Distributed simulation techniques have been investigated in a number of studies to decrease the execution times of PCS simulations. In this paper, we study the load-balancing problem for PCS wireless simulation systems, and focus upon static strategies in order to reduce the synchronization overhead of SWiMNet, a parallel PCS simulation testbed developed at UNT.
Majority Manchester decoding for active redundant data transmission
Authors: T. Sauter, N. Kero
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Reliable real time data transmission ought to be able to tolerate both transient faults and line failures. The former are readily dealt with by employing appropriate error control coding, whereas the latter require multiple transmission lines. The conventional approach is to use one active and several standby channels. However, utilizing all available channels through multiple feeding and implementing active redundant receivers allows instantaneous recovery from line failures. We investigate such receiver structures for a data transmission system based on a double-error correcting BCH-code with underlying Manchester line coding and three parallel data links. Different approaches for implementing majority voting strategies are compared with respect to overall error handling capabilities. As a result we will propose an optimal structure called majority Manchester decoder requiring only moderate implementation overhead.
A Structured Approach to Parallel Programming
Authors: Berna Massingill
Venue:  (1997)

Parallel programs are more difficult to develop and reason about than sequential programs. There are two broad classes of parallel programs: (1) programs whose specifications describe ongoing behavior and interaction with an environment, and (2) programs whose specifications describe the relation between initial and final states. This thesis presents a simple, structured approach to developing parallel programs of the latter class that allows much of the work of development and reasoning to be done using the same techniques and tools used for sequential programs. In this approach, programs are initially developed in a primary programming model that combines the standard sequential model with a restricted form of parallel composition that is semantically equivalent to sequential composition. Such programs can be reasoned about using sequential techniques and executed sequentially for testing. They are then transformed for execution on typical parallel architectures via a sequence of semantics-preserving transformations, making use of two secondary programming models, both based on parallel composition with barrier synchronization and one incorporating data partitioning. The transformation process for a particular program is typically guided and assisted by a parallel programming archetype, an abstraction that captures the commonality of a class of programs with similar computational features and provides a class-specific strategy for producing efficient parallel programs. Transformations may be applied manually or via a parallelizing compiler. Correctness of transformations within the primary programming model is proved using standard sequential techniques. Correctness of transformations between the programming models and between the models and practical programming languages is proved using a state-transition-based operational model. This thesis presents: (1) the primary and secondary programming models, (2) an operational model that provides a common framework for reasoning about programs in all three models, (3) a collection of example program transformations with arguments for their correctness, and (4) two groups of experiments in which our overall approach was used to develop example applications. The specific contribution of this work is to present a unified theory/practice framework for this approach to parallel program development, tying together the underlying theory, the program transformations, and the program-development methodology.
Visualization in algorithm engineering: tools and techniques
Authors: Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

The process of implementing, debugging, testing, engineering and experimentally analyzing algorithmic codes is a complex and delicate task, fraught with many difficulties and pitfalls. In this context, traditional low-level textual debuggers or industrial-strength development environments can be of little help for algorithm engineers, who are mainly interested in high-level algorithmic ideas and not particularly in the language and platform-dependent details of actual implementations. Algorithm visualization environments provide tools for abstracting irrelevant program details and for conveying into still or animated images the high-level algorithmic behavior of a piece of software.In this paper we address the role of visualization in algorithm engineering. We survey the main approaches and existing tools and we discuss difficulties and relevant examples where visualization systems have helped developers gain insight about algorithms, test implementation weaknesses, and tune suitable heuristics for improving the practical performances of algorithmic codes.
WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents
Authors: Abdelsalam Heddaya, Sulaiman Mirdad
Venue:  (1996)

Abstract Document publication service over such a large network as the Internet challenges us to harness available server and network resources to meet fast growing demand. In this paper, we show that large-scale dynamic caching can be employed to globally minimize server idle time, and hence maximize the aggregate throughput of the whole service. Given the distributed nature of the system, a successful caching mechanism must satisfy three properties: (1) that it maximize the global throughput of the system, (2) that it be completely distributed in the sense of operating only on the basis of local information, and (3) that it require no naming service that introduces a scalability bottleneck. In this paper, we develop a precise definition, which we call "tree load-balance", of what it means for a mechanism to satisfy these three goals, and present two algorithms that achieve them. Both algorithms compute the request rate that should be allocated to each cache server, so that global throughput is maximized. The first algorithm, WebFold, is a centralized one that is provably optimal with respect to throughput. The second algorithm, WebWave, whose optimality is evidenced by simulation, is a fully distributed diffusion-based protocol. Both algorithms assume that cache copies are placed on the routing tree that connects the cached document''s home server with its clients. As a consequence, document requests can find cache copies without resorting to a cache directory of any kind. The results herein apply only to immutable documents; we do not consider the cache consistency problem.
Explicit Interpolation Sets Using Perfect Hash Families
Authors: Sun Xiaodong
Venue:  (2000)

Let $S$ be a set of functions with common domain $D$. We say $X$, a subset of $D$, an interpolation set for $S$ if the values on $X$ uniquely determine a function $f$ in $S$. Recently, Piotr Indyk gave an explicit construction of interpolation sets of size $O(k^4 \log ^4 n)$ for the family of boolean functions on $n$ variables which depend symmetrically on at most $k$ variables. Using perfect hash families, we have a variant of Indyk''s method to get an explicit construction of interpolation sets of size $O(k^{10}\log n\log\log n/\log\log\log n)$ for this family of functions.
Faster Time-to-Market, Lower Cost of Development and Test for Standard Analog IC
Authors: Paolo Migliavacca
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This paper deals with one idea to minimize cost of development and test for standard analog IC. At the same time, it gives an industrial approach of a method with the aim of optimizing the time-to-market of a whole family of products. This can be implemented without loosing the product quality and with the opportunity of proceeding to a fast technical improvement of the family performances. The process methodology, based on array of devices on a single wafer is described. Particular emphasis is given to the design and test phases. A short comparison of virtual cycle time between a conventional standard analog IC and a product following the method is illustrated. An estimation of gain on Voltage References family development, in term of test resources, mask levels and time-to-market is given.
Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms
Authors: Shudong Jin, Azer Bestavros
Venue:  (1999)

Abstract Web caching aims to reduce network traffic, server load, and user-perceived retrieval delays by replicating ``popular'''' content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather, other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an on-line fashion, are used to indirectly infer popularity information, and hence drive cache replacement policies. Recent studies suggest that the correlation between these secondary properties and popularity is weakening due in part to the prevalence of efficient client and proxy caches (which tend to mask these correlations). This trend points to the need for proxy cache replacement algorithms that directly capture and use popularity information. In this paper, we (1) present an on-line algorithm that effectively captures and maintains an accurate popularity profile of Web objects requested through a caching proxy, (2) propose a novel cache replacement policy that uses such information to generalize the well-known GreedyDual-Size algorithm, and (3) show the superiority of our proposed algorithm by comparing it to a host of recently-proposed and widely-used algorithms using extensive trace-driven simulations and a variety of performance metrics.
Performance Visualization: 2-D, 3-D, and Beyond
Authors: Daniel A. Reed, Matthew J. Gardner, Evgenia Smirni
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

During the past ten years, performance data visualization techniques have evolved from static, two-dimensional graphics to dynamic graphics and immersive virtual environments. We sketch the domain of applicability for each visualization technique using analysis of input/output behavior and WWW traffic as example problem domains. With this background, we describe experiences with virtual environment representations of complex performance data and the potential for immersive interaction with complex software.
Macromedia Dreamweaver MX: Training from the Source
Authors: Khristine Annwn Page
Venue:  (2002)

:Macromedia Dreamweaver MX: Training from the Source leads you through a series of 17 project-based lessons in which you learn how to create and maintain Web sites using Macromedia's popular Web design software. The book's step-by-step exercises use the "Lights of the Coast" project Web site to introduce you to Dreamweaver's powerful tools and the best ways to use them. By recreating the sample Web site through the lessons, you'll gather the skills you need to develop sites, working in both visual and code editing environments, that are accessible to a wide audience. The lessons in this easy-to-follow guide provide 18-20 hours of tutorials, which start with the basics of creating a Web page and progressively add in more complex tasks such as working with text, graphics, and tables. You don't need any prior Dreamweaver experience to grasp these easy-to-follow lessons, which, while based on a sample project, provide you with all of the techniques and confidence to build your own full-featured Web sites.
Smart Cars as Autonomous Intelligent Agents
Authors: Nikolaos Bourbakis, Michael Findler
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

This paper presents a study on the behavior of smart cars by considering them as autonomous intelligent agents. In particular, a smart car could behave as autonomous agent by extracting information from the surrounding environment (road, highway) and determining its position in it, detecting the motion and tracking the behavioral patterns of other moving objects (automobiles) in its own surrounding space, exchanging information via internet with other moving objects (if possible) and negotiating its safety during travel with the other moving objects.
Software Development & Testing Methodology Used for Subscriber Digital Concentrator ACK-2000
Authors: M. Popovic, V. Kovacevic, M. Skrbic
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The paper presents software development and testing methodology, which was used for the new version of the subscriber digital concentrator ACK-2000. This concentrator was developed for the Russian telecommunication network. During the development process special attention was paid to precise software specification, professional implementation, and testing/redesign, in order to reach the given criterion of 0.1 % of unsuccessful calls. The tests, which were conducted, include functional tests and real-time load tests, with the real exchange and the call generator connected to the subscriber lines. The results of this tests, and software reliability analysis are reported.