ppxscal/embedding_network huggingface dataset:
Analysis of Receiver Adaptation for Layered Video Transmission over Heterogeneous Networks: A Microscopic Perspective
Authors: Po-Chin Hu, Zhi-Li Zhang, Mostafa Kaveh
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Receiver adaptation layered multicast video has been proposed to address the issue of network bandwidth heterogeneity in multi-party video communication over networks. An important issue in this approach is how to conduct layer adaptation to achieve the "optimal level" of subscription to maximize the perceived video quality at receivers while utilize bandwidth efficiently.In the current work, optimal layers are typically determined by congestion signals fed back from networks. This approach implies that instantaneous congestion is a key parameter; however, in random traffic, such an implication somewhat under-estimates other parameters.In order to investigate the performance of "layer adaptation" in random traffic for improving the network-based multi-party video communication system, in this paper we present an analytical studying of the issue of receiver layer adaptation for layered video transmission. In this work, we use the notion of congestion probability as a partial and indirect measure of the perceived layered video quality at a receiver. The system's efficiency under a given receiver layer adaptation scheme is also defined and used as a metric to study the performance of a receiver layer adaptation scheme. Through the analysis, we determine the optimal receiver layer adaptation scheme, which maximizes the system efficiency while providing best sustainable video quality to a receiver.We show that the greedy receiver layer adaptation scheme is indeed optimal if the traffic generated by various layers of a layered video as well as the cross traffic are constant. However, in a more realistic setting where layered video traffic or the cross traffic varies over the time, the greedy receiver layer adaptation scheme is in general not optimal.To verify our theory, we conduct simulations using both stationary and non-stationary traffic. Our simulation results demonstrate the superior performance of the optimal receiver layer adaptation scheme.
A General Approach to Performance Analysis and Optimization of Asynchronous Circuits
Authors: Tak K Lee
Venue:  (1995)

A systematic approach for evaluating and optimizing the performance of asynchronous VLSI circuits is presented. Index-priority simulation is introduced to efficiently find minimal cycles in the state graph of a given circuit. These minimal cycles are used to determine the causality relationships between all signal transitions in the circuit. Once these relationships are known, the circuit is then modeled as an extended event-rule system, which can be used to describe many circuits, including ones that are inherently disjunctive. An accurate indication of the performance of the circuit is obtained by analytically computing the period of the corresponding extended event-rule system.
The Wireless Networking Starter Kit
Authors: Adam Engst, Glenn Fleishman
Venue:  (2002)

:Once authors Adam C. Engst and Glenn Fleishman discovered that the freedom of a wireless network meant they could access the Internet from bed, the living room, the coffee house down the street, most major airports, and even some city parks, there was no going back to the days of clumsy wired networks. Now they're here to share their knowledge in the new book The Wireless Networking Starter Kit Whether you're a Mac or PC user, if you're ready to embrace the freedom of wireless, this is the place to start. In these pages you'll learn first about the underpinnings of wireless technology and network basics before getting down to the real business at hand: setting up, configuring, and maintaining a wireless network. Step-by-step instructions delivered in easily digestible chunks make it easy to get your own network humming. Along the way you'll learn about security, sharing Internet connections among multiple computers, bridging two Ethernet networks, and more. And if you do run into trouble, there's a handy troubleshooting guide to answer your questions. If you have a couple of computers and the desire to connect them, you'll find everything you need to do so here.
IBM Websphere Application Server: The Complete Reference
Authors: Ron Ben-Natan, Ori Sasson
Venue:  (2002)

:"This book is an excellent tool for anyone interested in gaining a breadth of knowledge about the WebSphere Application Server 4. 0"Dave Draeger,Software Engineer,IBM WebSphere Execution Team. Get started with IBM WebSphere Application Server 4. 0 using this definitive and detailed reference. Learn to develop and deploy powerful Web-based application and discover all of the new features including JMS,JSP taglibs,EJB extensions,Web services and J2EE compliance. Including numerous examples of Web services,multi-lingual applications and directories,as well as coverage of core Web technologies such as servlets and JSP,this is the ultimate one-stop resource for working with IBM WebSphere Application Server.
Automatic Correction of Syntax Errors in Programming Languages
Authors: Jean Levy
Venue:  (1971)

A very substantial fraction of the time and efforts required to develop a program is devoted to the removal of errors. In order to simplify this task, a model to automatize the correction of syntax errors is developed. It is the first model which is both formal and fairly realistic to appear in the literature. The notion of error is defined and studied formally. Then, using this definition, a systematic error-correction process is modelled. This process makes local corrections over clusters of errors, using the context around the errors to determine the corrections and to insure that the different local corrections performed on the string do not interfere with one another. The error-correction process can be naturally embedded in many left-to-right syntax checking processes. It uses the recognizer both to detect errors and to find possible corrections. The process has two modes: a ``standard mode'''' used for syntax checking and an ``error-correction mode'''' used for determining the context of a cluster of errors and for finding all possible corrections of these errors. In the ``standard mode'''', the syntax is checked at the same speed as if no error-correction mechanism is implemented. Thus, for programs which contain no errors, no price is paid for the presence of this mechanism. The ``error-correction mode'''' consist of two phases: the backward move which locates the left context of the cluster, and the forward move which construct possible corrections and locates the right context of the cluster. This process seems the most natural way to perform left-to-right syntax checking and error correction. Some techniques for efficiently finding the range of the backward move are developed. The formal model is not practical when using the conventional context-free description of programming languages. In order to make it more practical, the notion of bracketed context-free language is introduced and proposed as a model for the syntax fo programming languages. Then, heuristic restrictions on the type of errors corrected are discussed. They may lead to a simpler process. In particular, assuming that brackets are corrected only when no other correction is possible, and that errors in deep levels of nesting (with respect to the point where the errors are detected) are neglected, it is shown how the process can be used to correct syntax errors in programming languages.
Span-disjoint paths for physical diversity in networks
Authors: S. Z. Shaikh
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Diversity has been widely recognized as a critical factor for robustness in networks. In order to resist isolations due to link and node failures, we need to route along paths which are both span-disjoint (physically disjoint) and node-disjoint. In this way we can design the network for fault tolerance or graceful degradation. We demonstrate the procedure to obtain span-disjoint paths. This procedure may be applied to an arbitrary network topology, without restrictions on the span sharing configurations. In those cases where two completely disjoint paths do not exist, the procedure still tries to find a pair of paths which are as diverse as possible. The solution path pair we obtain is not guaranteed to be optimal, but gives us an optimal or near-optimal design, relatively quickly. The algorithm also accepts parameters which can be used to specify the cost-robustness tradeoffs.
A Family of Design Patterns For Flexibly Configuring Network Services in Distributed Systems
Authors: Douglas C. Schmidt
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

This paper describes a family of design patterns that enhance the flexibility and extensibility of communication software by permitting network services to evolve independently of the strategies used to passively initialize the services. The paper makes three contributions to the study and development of configurable distributed systems. First, it identifies five orthogonal dimensions of passive service initialization: service advertisement, endpoint listening, service handler creation, passive connection establishment, and service handler activation. Second, the paper illustrates how a family of design patterns have been used to build a communication software framework that supports flexible configuration of different strategies for each of these five dimensions. Third, the paper demonstrates how design patterns and frameworks are being used successfully to develop configurable large-scale production distributed systems.
Cyclone User''s Manual, Version 0.1.3
Authors: Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, James Cheney
Venue:  (2001)

The current version of this manual should be available at http://www.cs.cornell.edu/projects/cyclone/ and http://www.research.att.com/projects/cyclone/. The version here describes Cyclone Version 0.1.3, although minor changes may have occurred before the release.
Quantum Walk on the Line
Authors: Nayak Ashwin, Vishwanath Ashvin
Venue:  (2000)

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider {\em quantum\/} walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the ``Hadamard walk''''. In particular, we show that after~$t$ time steps, the probability distribution on the line induced by the Hadamard walk is almost uniformly distributed over the interval~$[-t/\sqrt{2},\;t/\sqrt{2}]$. This implies that the same walk defined on the circle mixes in {\em linear\/} time. This is in direct contrast with the quadratic mixing time for the corresponding classical walk. We conclude by indicating how our techniques may be applied to more general graphs.
How to Do Everything with Windows XP, 2 edition
Authors: Curt Simmons
Venue:  (2003)

:Get the most out of Windows XP using this friendly,solutions-oriented guide. See how much you can do with the world's most popular operating systemincluding making movies and playing musicand learn about all its new updates such as networking for both home and office,faster boot features,better security,and improved Web browsing. Learn to run this sophisticated operating system with ease and enjoy the many features that make XP an efficient,rock-solid computing environment. Tap powerful functionality like home and small-office networking,Media Player,system security,and privacy protection. Manage files and folders,searches,and taskbar grouping with the simplified visual design. Communicate through text messaging,voice,or video through Windows Messenger. View,store,and organize digital photographs with My Pictures. Quickly change custom desktop configurations with fast user-switching. How To Do Everything with Windows XP will help you accomplish more in less time than you ever imagined. Operate effectively in the Home or Professional environments Configure the XP desktop and master the XP Control Panel Use the innovative features of Internet Explorer 6 and Network Setup Wizard Access and run a virtual desktop through Remote Desktop and Remote Assistance Capture,edit,organize,and share home movies with Windows Movie Maker Play DVDs,store digital music,or burn CDs with the media player Unleash greater networking capabilities Bridge networks,create firewalls,and use new security features Play games with greater stability and support features Learn the advantages of Windows 2000-generation code
First Order Semantics: A Natural Programming Logic for Recursively Defined Functions
Authors: Robert Cartwright
Venue:  (1978)

NO SUPPLIED
WDM Multicasting in IP over WDM Networks
Authors: Chunming Qiao, Myoungki Jeong, Amit Guha, Xijun Zhang, John Wei
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Supporting WDM multicasting in an IP over WDM network poses interesting problems because some WDM switches may be incapable of switching an incoming signal to more than one output interface. An approach to WDM multicasting based on wavelength-routing, which constructs a multicast forest for each multicast session so that multicast-incapable WDM switches do not need to multicast, was proposed and evaluated. Such an approach requires global knowledge of the WDM layer. In this paper, we study WDM multicasting in an IP over WDM network under the framework of Multi-protocol Label Switching (MPLS) using optical burst/label switching (OBS/OLS). We propose a protocol which modifies a multicast tree constructed by distance vector multicast routing protocol (DVMRP) into a multicast forest based on the local information only.
Document Length Normalization
Authors: Amit Singhal, Gerard Salton, Mandar Mitra, Chris Buckley
Venue:  (1995)

In the TREC collection -a large full-text experimental text collection with widely varying document lengths -we observe that the likelihood of a document being judged relevant by a user increases with the document length. We show that a retrieval strategy, such as the vector-space cosine match, that retrieves documents of different lengths with roughly equal probability, will not optimally retrieve useful documents from such a collection. We present a modified technique that attempts to match the likelihood of retrieving a document of a certain length to the likelihood of documents of that length being judged relevant, and show that this technique yields significant improvements in retrieval effectiveness.
Optimal Prediction for Prefetching in the Worst Case
Authors: Krishnan,  P, Scott J Vitter
Venue:  (1993)

Response time delays caused by I/O is a major problem in many systems and database applications. Prefetching and cache-replacement methods are attracting renewed attention because of their success in avoiding costly I/Os. Prefetching can be looked upon as a type of online sequential prediction, where the predictions must be accurate as well as made in a computationally efficient way. Unlike other online problems, prefetching cannot admit a competitive analysis, since the optimal offline prefetcher incurs no cost when it knows the future page requests. Previous analytical work on prefetching [ViK] consisted of modeling the user as a probabilistic Markov source. In this paper, we look at the much stronger form of worst-case analysis and derive a randomized algorithm that we prove analytically {\em converges almost surely to the optimal fault rate in the worst case for every sequence of page requests\/} with respect to the important class of finite state prefetchers. In particular, we make no assumption about how the sequence of page requests is generated. This analysis model can be looked upon as a generalization of the competitive framework, in that it compares an online algorithm in a worst-case manner over all sequences against a powerful yet non-clairvoyant opponent. We simultaneously achieve the computational goal of implementing our prefetcher in optimal constant expected time per prefetched page, using the optimal dynamic discrete random variate generator of [MVN].
Information Processing Research
Authors: Allen Newell, Scott E. Fahlman, Dales A. James, C. R Taylor
Venue:  (1992)

This report documents a broad program of basic and applied information processing research conducted by Carnegie Mellon''s School of Computer Science during the period 15 July 1987 through 14 July 1990, and extended through 31 December 1990. We present in detail our seven major research areas: Artificial Intelligence, Image Understanding, Reliable Distributed Systems, Programming Environments, Reasoning About Programs, Uniform Workstation Interfaces, and Very Large Scale Integration. Sections in each chapter present the area''s general research context, the specific problems we addressed, our contributions and their significance, and a bibliography for each chapter.
An Investigation of CC's Contribution to Confidence in Security
Authors: Wenchang Shi, Yufang Sun
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

To facilitate the availability of commercial computer products with sufficient security, excellent evaluation criteria have to be of the potential to drive the course of the security marketplace. The newness and the lack of experiences in the exercise of the Common Criteria (CC), which w s adopted in 1999 as an international standard for security product evaluation, make it imperative that efforts be exerted to investigate the prospective influence of the CC in advancing the state of computer security. This paper casts light on the contribution of the CC to establishing confidence in security, which is still barren land in need of cultivation. A picture of the process of the work to produce security product is outlined. The roles each parts of the work may pl y in obtaining confidence are examined. In practice, research experiment iscarried out aiming at building a secure operating system in accordance with the CC philosophy
Design of a Quaternary Latch Circuit Using a Binary CMOS RS Latch
Authors: K. W. Current
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A new voltage-mode quaternary CMOS static latch circuit is presented that is built around a binary standard CMOS logic clocked RS latch circuit. Only devices available in standard digital CMOS fabrication technology enhancement-mode NMOS and PMOS transistors with single threshold voltage value are used. No depletion-mode devices or special transistor threshold voltages are required. Standard CMOS logic design practice has produced a quaternary static latch that has zero DC power dissipation. Its operation is experimentally verified. Typical and worst-case on-chip setup and hold times are simulated to be approximately 2.8ns and 6.8ns, respectively.
An improvement of the two-line algorithm for proving q-hypergeometric identities
Authors: Bao-Yin Zhang, Jie Li
Venue: Discrete Mathematics (2003)

Yen (J. Math. Anal. Appl. 213 (1996) 1) gives a two-line algorithm to show that q-hypergeometric identities Σk F(n, k) = 1, n ≥ n0 can be proved by checking that they are correct for n ∈ {n0, n0 + 1,..., n1}. Here we generalize Sister Celine's technique and give a specific formula for n1, bounded above by a polynomial of degree of 9 in the parameters of F(n, k). This n1 is much smaller than the estimate of Yen (1996), as a polynomial of degree of 24 in the parameters of F(n, k).
Random Sampling for On-Chip Characterization of Standard-Cell Propagation Delay
Authors: S. Maggioni, A. Veggetti, A. Bogliolo, L. Croce
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

We present a methodology for on-chip characterization ofthe pin-to-pin propagation delay of single standard cells.A periodic waveform is provided to an input pin of thestandard cell under characterization, while keeping allother inputs at non-controlling logic values.Simultaneousrandom sampling is then applied to input and outputperiodic waveforms, and propagation delay measures areobtained from the joint signal probabilities of the samples.The proposed technique is suitable for on-chipimplementation because it is simple and it doesn't requiretiming-accurate control signals.On the other hand, on-chipmeasurements can be applied to a large number ofcells working in different operating conditions, providingvaluable information for characterizing and validatingtiming models.A test chip has been realized in a 0.18µm embedded NVMCMOS technology, and used to monitor the sub-nanosecondtiming behavior of a standard cell libraryduring process development.
A New Version of Toom''s Proof
Authors: Peter Gacs
Venue:  (1995)

Abstract There are several proofs now for the stability of Toom''s example of a two-dimensional stable cellular automaton and its application to fault-tolerant computation. Simon and Berman simplified and strengthened Toom''s original proof: the present report is simplified exposition of their proof.
Acquisition of state transitions in neural network
Authors: N. Ishii, C. Kondo, A. Furukawa, K. Yamauchi
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In the artificial intelligence, the breadth-first search is optimal with uniform cost. But it takes long time to obtain the solution. Neural networks process states transitions in parallel with learning ability. We developed a search procedure of states transition doing the the breadth-first, in the neural network. First, the input pattern states are self-organized in the neural network, which consists of the Kohonen layer followed by the state planning layer. The state planning layer makes lateral connections between cells of transitions. Then, the initial and the target states are given as a problem. The network shows an optimal state transition pathway in the neuron firings. Next, the state transition procedure is developed for the formation of the concept of action planning. Here, as the action planning, an integration between the symbols and the action pattern is carried out in the extended neural network.
Stability and Performance of Alternate Two-level Interconnection Networks
Authors: Shyamal Chowdhury, A M Holliday
Venue:  (1991)

\indent Packaging constraints motivate a two-level interconnection network for a multiprocessor. A single node in the global network contains multiple processors connected by a local network. An important issue in two-level networks is how alternative numbers of processors per node changes the per link traffic in the global network. In the case of a hypercube global network we consider three communications schemes. We derive system stability conditions for each scheme under very general assumptions. Assuming the packets sent by a processor form a Poisson process, we also derive the worst-case mean end-to-end packet delay for the three schemes. We then use these results to compare alternative numbers of processors per node for the system size of a given multiprocessor.