ppxscal/embedding_network huggingface dataset:
Optimal buffer sharing
Authors: I. Cidon, A. Khamisy, L. Georgiadis, R. Guerin
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Addresses the problem of designing optimal buffer management policies in shared memory switches when packets already accepted in the switch can be dropped (pushed-out). The goal is to maximize the overall throughput, or equivalently to minimize the overall loss probability in the system. For a system with two output ports, the authors prove that the optimal policy is of pushout with threshold type (POT). The same result holds if the optimality criterion is the weighted sum of the port loss probabilities. For this system, the authors also give an approximate method for the calculation of the optimal threshold, which they conjecture to be asymptotically correct. For the N-ported system, the optimal policy is not known in general, but it is shown that for a symmetric system (equal traffic on all ports) it consists of always accepting arrivals when the buffer is not full, and dropping one from the longest queue to accommodate the new arrival when the buffer is full. Numerical investigations show that under the optimal POT policy the loss probability of a port is insensitive to traffic fluctuations in the other port.
Localizer
Authors: Laurent Michel, Pascal Van Hentenryck
Venue:  (1998)

Local search is a traditional technique to solve combinatorial search problems which has raised much interest in recent years. The design and implementation of local search algorithms is not an easy task in general and may require considerable experimentation and programming effort. However, contrary to global search, little support is available to assist the design and implementation of local search algorithms. This paper describes the design and implementation of LOCALIZER, a domain-specific language for implementing local search algorithms. LOCALIZER makes it possible to express local search algorithms in a notation close to their informal descriptions in scientific papers. Experimental results on Boolean satisfiability, graph coloring, graph partitioning, and job-shop schedulingq show the feasibility of the approach.
Stability of Finite Element Mixed Interpolations for Contact Problems
Authors: K. Bathe, F. Brezzi
Venue:  (2001)

We consider the formulation of contact problems using a Lagrange multiplier to enforce the contact no-penetration constraint. The finite element discretization of the formulation must satisfy stability conditions which include an inf-sup condition. To identify which finite element interpolations in the contact constraint lead to stable ( and optimal ) numerical solutions we focus on the finite element discretization and solution of a '' simple'' model problem. While a simple problem to avoid the need for technicalities, the analysis of the finite element discretizations to solve the problem gives valuable insight and allows quite general conclusions on the use of different interpolation schemes.
The Object Complexity Model of Hidden-Surface Rendering
Authors: F E Grove, M T Murali, Scott J Vitter
Venue:  (1995)

We define a new complexity measure, called {\em object complexity}, for hidden-surface elimination algorithms. This model is more appropriate than the standard scene complexity measure used in computational geometry for predicting the performance of these algorithms on current graphics rendering systems. We also present an algorithm to determine the set of visible windows in 3-D scenes consisting of $n$ isothetic windows. It takes time $O(n \log n)$, which is optimal. The algorithm solves in the object complexity model the same problem that Bern addressed for the standard scene complexity model.
Hack Attacks Revealed: A Complete Reference with Custom Security Hacking Toolkit
Authors: John Chirillo
Venue:  (2002)

:The #1 menace for computer systems worldwide, network hacking can result in mysterious server crashes, data loss, and other problems that are not only costly to fix but difficult to recognize. Author John Chirillo knows how these can be prevented, and in this book he brings to the table the perspective of someone who has been invited to break into the networks of many Fortune 1000 companies in order to evaluate their security policies and conduct security audits. He gets inside every detail of the hacker's world, including how hackers exploit security holes in private and public networks and how network hacking tools work. As a huge value-add, the author is including the first release of a powerful software hack attack tool that can be configured to meet individual customer needs.
Handover in a micro-cell packet switched mobile network
Authors: R. Cohen, B. Patel, A. Segall
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper proposes a distributed handover protocol for a micro-cell packet switched mobile network. In such a network, users move from one cell to another very often, and each change of location may result in misrouted and lost packets. The purpose of the new protocol is to minimize these consequences of location changes: as long as a mobile moves from one cell to another but stays in the same region, the protocol avoids loss of packets and preserves order of transmission. Thus it increases the performance of the transport layer protocol by minimizing the need to retransmit packets.
Fast and Efficient Lossless Image Compression
Authors: G P Howard, Scott J Vitter
Venue:  (1994)

We present a new method for lossless image compression that gives compression comparable to JPEG lossless mode with about five times the speed. Our method, called {\em FELICS}, is based on a novel use of two neighboring pixels for both prediction and error modeling. For coding we use single bits, adjusted binary codes, and Golomb or Rice codes. For the latter we present and analyze a provably good method for estimating the single coding parameter.
Specialization classes: an object framework for specialization
Authors: C. Cowan, A. Black, C. Krasic, C. Pu, J. Walpole, C. Consel, E.-N. Volanschi
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

This paper presents an object-oriented framework for specifying specializations in long-running programs such as operating systems. This model is based on the following concepts: Inheritance allows replacement implementations of member functions. We thus use a graph of sub-classes to specify a set of potential specializations of a given facility by replacing generic implementations with specialized implementations. Specializations in long-running programs are temporary, because the particular circumstances that permit the use of a specialized implementation are likely to change eventually. We thus support temporary and even optimistic specializations. Ensuring that it is valid to use a specialized implementation can be more difficult than creating the specialized implementation. We thus use a formal method to specify when a specialization is valid. This lets us automatically detect when specialization circumstances have changed, and also automatically generate specialized implementations using partial evaluation.
Search: The Graphics Web Guide
Authors: Ken Coupland
Venue:  (2002)

:Like everyone else with access to the internet, designers now have a wealth of information at their fingertips-if only they knew how to find it. Design resources are proliferating on the World Wide Web and, as they mature, their value to design students, researchers, and practitioners can only increase. Search provides a timely guide to graphic design resources on the internet, focusing on design, typography, illustration, photography, film, and video. Websites are organized according to category-background, learning, media, practice, experiments, groups, and events-and illustrated with vignettes created from screen grabs. With reviews of more than 300 significant websites, and with indexes and crossindexes to ensure that readers can access the most relevant information with minimum effort.Author Biography: Ken Coupland writes about the visual arts-with a focus on the digital revolution-for publications internationally. He has also edited a number of books on web design, most recently, Webworks: Navigation, and has curated several exhibitions devoted to digital art. 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
Fully stressed structure design using ranked BESO
Authors: C.-H. Ryu, Y.-S. Lee, C.-M. Myung
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Ranked Bidirectional Evolutionary Structural Optimization (R-BESO) method is one of the topology optimization using the evolutionary algorithm. The method may get an optimum design at less iteration number comparing with the previous several ESO methods. It includes the displacement sensitivity analysis by nodal displacement to determine the rank for each free edge or free surface of the candidate elements having any free edge or free surface. In this study, developed RBESO method is introduced to search the topology of a fully stressed structure under several mechanical environments. Considered design problems are nozzle problems, which are 2 dimensional axisymmetric structures, and a bracket problem, which is a 3 dimensional structure.
Fixed Points for Fuzzy Rule Bases and Fuzzy Chaining Syllogism
Authors: Khosro Soleimani, M. Mashinchi, H. R. Maleki
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In this paper we review the notion of fixed points forfuzzy if-then rules. Some known results on fixed pointsfor fuzzy if-then rules are given and more new ones areadded. Then we extend this notion for fuzzy chainingsyllogism with rule bases and we obtain new andinteresting results.
A Data Base for Arabic Handwritten Text Recognition Research
Authors: Somaya Al-Ma'adeed, Dave Elliman, Colin A. Higgins
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper we present a new database for offline Arabic handwriting recognition, together with associated preprocessing procedures. We have developed a new database for the collection, storage and retrieval of Arabic handwritten text (AHDB). This is an advance bothin terms of the size of the database as well as the number of different writers involved. We further designed an innovative, simple yet powerful, in place tagging procedure for our database. It enables us to easily extract the bitmaps of words. We also constructed apreprocessing class, which contains some useful preprocessing operations. In this paper the most popular words in Arabic writing were identified for the first time, using an associated program.
Explore! Microsoft PowerPoint 2000 - Brief
Authors: John Zeanchock
Venue:  (2002)

:Hands-on, computer-based-training helps students learn beginning Microsoft PowerPoint 2000 skills.
Efficient Full-Chip Yield Analysis Methodology for OPC-Corrected VLSI Designs
Authors: V. Axelrad, N. Cobb, M. O'Brien, T. Do, T. Donnelly, Y. Granik, E. Sahouria, V. Boksha, A. Balasinski
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Degradation of lithographic pattern fidelity is a major cause of yield loss in VLSI manufacturing. A general methodology for full-chip analysis and improvement of yield loss due to lithographic effects is proposed. The approach is based on: a) extraction of pattern fidelity statistics using a full-chip layout engine, b) full-chip Optical Proximity Correction (OPC) to improve pattern reproduction, and c) estimation of yield losses due to line variability, using transistor sensitivity to pattern registration obtained from physical transistor modeling. As a result, yield estimates related to either pattern reproduction fidelity or transistor parametric data variations (such as leakage or drive current) are generated. The method is efficient and well suited for application to modern VLSI designs of memory or logic devices.
MoCCA: A Mobile Communication and Computing Architecture
Authors: Asim Smailagic, Dan Siewiorek, Len Bass
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Bob Iannucci, Anton Dahbura, Steve Eddleston, Bob Hanson and Ed ChangCompaqIn this paper we present an integrated computing system designed to help increase the efficiency of mobile workers, specifically field service engineers. Our solution, a Mobile Communications and Computing Architecture (MoCCA), consists of both a futuristic award-winning concept design and a first-generation working prototype. The prototype has support for collaborative multimedia: on-the-move networking for high-tech equipment maintenance using voice, video clips, and access to maintenance databases. We describe the user interface, software, and hardware architectures of our prototype. The hardware architecture uses a multi-tier networking scheme to trade off a small lightweight client and high computation power and battery life. Finally, we present lessons learned from user tests in applying a novel mobile computing architecture to a complex real-world task.
GLACIER: A Hot Carrier Gate Level Circuit Characterization and Simulation System for VLSI Design
Authors: Lifeng Wu, Jingkun Fang, Heting Yan, Ping Chen, Alvin I-Hsien Chen, Yoshifumi Okamoto, Chune-Sin Yeh, Zhihong Liu, Nobufusa Iwanishi, Norio Koike Hirokazu Yonezawa, Yoshiyuki Kawakami
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Gate level circuit simulation on hot carrier degradation is introduced for the first time by the GLACIER system presented in this paper. The inherent advantages such as high speed and high capacity of the gate level simulation as compared to the traditional transistor level hot carrier simulation makes the design-in reliability simulation possible and practical for the deep submicron VLSI circuit designs with millions of transistors. By virtue of a unique ratio based modeling technique, GLACIER system provides a very high accuracy, which is mostly within 1% difference of transistor level hot carrier simulation.
Asymptotic behaviors of support vector machines with Gaussian kernel
Authors: S. Sathiya Keerthi, Chih-Jen Lin
Venue: Neural Computation (2003)

Support vector machines (SVMs) with the gaussian (RBF) kernel have been popular for practical use. Model selection in this class of SVMs involves two hyperparameters: the penalty parameter C and the kernel width σ. This letter analyzes the behavior of the SVM classifier when these hyperparameters take very small or very large values. Our results help in understanding the hyperparameter space that leads to an efficient heuristic method of searching for hyperparameter values with small generalization errors. The analysis also indicates that if complete model selection using the gaussian kernel has been conducted, there is no need to consider linear SVM.
Professional UML with Visual Studio .NET: Unmasking Visio for Enterprise Architects, 1 edition
Authors: Tony Loton, John Slater, Kevin McNeish, Andrew Filev, Gary Wu
Venue:  (2002)

:If you want to use Visio for Enterprise Architects to quickly design and create enterprise software, this is the book for you. The integration of Visual Studio .NET Enterprise Architect and Visio for Enterprise Architects is a formidable combination. Visio offers powerful diagramming capabilities, including such things as creating UML models, mapping out and generating databases, and aiding the development of distributed systems. Visio's integration with Visual Studio .NET Enterprise Architect means that C# or Visual Basic .NET code can be generated from UML diagrams, thus giving your projects a significant kick-start, and Visual Studio .NET projects can also be reverse engineered to UML models. It is this book that will finally help you to realize Visio's time- and labor-saving features, and unleash Visio's power for your enterprise development.
Characterizing Observability and Controllability of Software Components
Authors: Bruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Two important objectives when designing a specification for a reusable software component are understandability and utility. For a typical component defining a new abstract data type, a significant common factor affecting both of these objectives is the choice of a mathematical model of the (state space of the) ADT, which is used to explain the behavior of the ADT's operations to potential clients. There are subtle connections between the expressiveness of this mathematical model and the functions computable using the operations provided with the ADT, giving rise to interesting issues involving the two complementary system-theoretic principles of "observability" and "controllability". This paper discusses problems associated with formalizing intuitively-stated observability and controllability principles in accordance with testing for these properties. Although the example we use for illustration is simple, the analysis has implications for the design of reusable software components of every scale and conceptual complexity.
A Parallel Programming Model with Sequential Semantics
Authors: John Thornley
Venue:  (1996)

Parallel programming is more difficult than sequential programming in part because of the complexity of reasoning, testing, and debugging in the context of concurrency. In this thesis, we present and investigate a parallel programming model that provides direct control of parallelism in a notation with sequential semantics. Our model consists of a standard sequential imperative programming notation extended with the following three pragmas: (1) The parallelizable sequence of statements pragma indicates that a sequence of statements can be executed as parallel threads; (2) The parallelizable for-loop statement pragma indicates that the iterations of a for-loop statement can be executed as parallel threads; (3) The single- assignment type pragma indicates that variables of a given type are assigned at most once and that ordinary assignment and evaluation operations can be used as implicit communication and synchronization operations between parallel threads. In our model, a parallel program is simply an equivalent sequential program with added pragmas. The placement of the pragmas is subject to a small set of restrictions that ensure the equivalence of the parallel and sequential semantics. We prove that if standard sequential execution of a program (by ignoring the pragmas) satisfies a given specification and the pragmas are used correctly, parallel execution of the program (as directed by the pragmas) is guaranteed to satisfy the same specification. Our model allows parallel programs to be developed using sequential reasoning, testing, and debugging techniques, prior to parallel execution for performance. Since parallelism is specified directly, sophisticated analysis and compilation techniques are not required to extract parallelism from programs. However, it is important that parallel performance issues such as granularity, load balancing, and locality be considered throughout algorithm and program development. We describe a series of programming experiments performed on up to 32 processors of a shared-memory multiprocessor system. These experiments indicate that for a wide range of problems: (1) Our model can express sophisticated parallel algorithms with significantly less complication than traditional explicit parallel programming models; (2) Parallel programs in our model execute as efficiently as sequential programs on one processor and deliver good speedups on multiple processors; (3) Program development with our model is less difficult than with traditional explicit parallel programming models because reasoning, testing, and debugging are performed using sequential methods. We believe that our model provides the basis of the method of choice for a large number of moderate-scale, medium-grained parallel programming applications.
A Novel RED-Based Hop-by-Hop Congestion Control
Authors: Bin Pang, Xi-Chen Liu, Yang-Zhao Xiang, Wen Gao
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

With the rapid emergence of new services and quick changes of traffic in the Internet, the widely used end-to-end congestion control mechanism becomes insufficient. This paper presents a novel RED-based hop-by-hop congestion control mechanism which is based on the coordination of the routers and the hosts. No per-flow state information is maintained in the routers. The application itself need not take care of the rate adaptation. The mechanism provides a uniform solution accommodating both responsive and unresponsive traffic with trivial overhead. It reduces the packet loss to zero and leads to higher network resource utilization. Response time to congestion is greatly reduced. The mechanism has been implemented in the Linux kernel. Some preliminary experiments show its advantages.
Efficient Self-stabilizing Algorithms for Tree Networks
Authors: Jean R. S. Blair, Fredrik Manne
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Many proposed self-stabilizing algorithms require an exponentialnumber of moves before stabilizing on a globalsolution, including some rooting algorithms for tree networks[1, 2, 3]. These results are vastly improved upon in[6] with tree rooting algorithms that require only O(n3 +n 2 · ch) moves, where n is the number of nodes in the networkand ch is the highest initial value of a variable. Inthe current paper, we describe a new set of tree rooting algorithmsthat brings the complexity down to O(n2) moves.This not only reduces the first term by an order of magnitude,but also reduces the second term by an unboundedfactor. We further show a generic mapping that can be usedto instantiate an efficient self-stabilizing tree algorithm fromany traditional sequential tree algorithm that makes a singlebottom-up pass through a rooted tree. The new genericmapping improves on the complexity of the technique presentedin [8].
The Role of Concepts in Program Comprehension
Authors: Václav Rajlich, Norman Wilde
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

The paper presents an overview of the role of concepts in program comprehension. It discusses concept location, in which the implementation of a specific concept is located in the code. This process is very common and precedes a large proportion of code changes. The paper also discusses the process of learning about the domain from the code, which is aprerequisite of code reengineering. The paper notes the similarities and overlaps between program comprehension and human learning.
Time-stamped graphs and their associated influence digraphs
Authors: Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman
Venue: Discrete Applied Mathematics (2003)

A time-stamped graph is an undirected graph with a real number on each edge. Vertex u influences vertex v if there is a non-decreasing path from u to v. The associated influence digraph of a time-stamped graph is the directed graph that records the influences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated influence digraph has n vertices and t arcs. We also investigate the minimum number of vertices a graph can have so that a given digraph is an induced subgraph of its associated influence digraph. A number of other questions are also explored.