ppxscal/embedding_network huggingface dataset:
Enhancing qos provisioning and granularity in next generation internet
Authors: Symeon Papavassiliou
Venue:  (2004)

Next Generation IP technology has the potential to prevail, both in the access and in the core networks, as we are moving towards a multi-service, multimedia and high-speed networking environment. Many new applications, including the multimedia applications, have been developed and deployed, and demand Quality of Service (QoS) support from the Internet, in addition to the current best effort service. Therefore, QoS provisioning techniques in the Internet to guarantee some specific QoS parameters are more a requirement than a desire. Due to the large amount of data flows and bandwidth demand, as well as the various QoS requirements, scalability and fine granularity in QoS provisioning are required. In this dissertation, the end-to-end QoS provisioning mechanisms are mainly studied, in order to provide scalable services with fine granularity to the users, so that both users and network service providers can achieve more benefits from the QoS provisioned in the network. To provide the end-to-end QoS guarantee, single-node QoS provisioning schemes have to be deployed at each router, and therefore, in this dissertation, such schemes are studied prior to the study of the end-to-end QoS provisioning mechanisms. Specifically, the effective sharing of the output bandwidth among the large amount of data flows is studied, so that fairness in the bandwidth allocation among the flows can be achieved in a scalable fashion. A dual-rate grouping architecture is proposed in this dissertation, in which the granularity in rate allocation can be enhanced, while the scalability of the one-rate grouping architecture is still maintained. It is demonstrated that the dual-rate grouping architecture approximates the ideal per-flow based PFQ architecture better than the one-rate grouping architecture, and provides better immunity capability. On the end-to-end QoS provisioning, a new Endpoint Admission Control scheme for Diffserv networks, referred to as Explicit Endpoint Admission Control (EEAC), is proposed, in which the admission control decision is made by the end hosts based on the end-to-end performance of the network. A novel concept, namely the service vector, is introduced, by which an end host can choose different services at different routers along its data path. Thus, the proposed service provisioning paradigm decouples the end-to-end QoS provisioning from the service provisioning at each router, and the end-to-end QoS granularity in the Diffserv networks can be enhanced, while the implementation complexity of the Diffserv model is maintained. (Abstract shortened by UMI.)
Truss: A Reliable, Scalable Server Architecture
Authors: Brian T. Gold, Jangwoo Kim, Jared C. Smolens, Eric S. Chung, Vasileios Liaskovitis, Eriko Nurvitadhi, Babak Falsafi, James C. Hoe, Andreas G. Nowatzyk
Venue: IEEE Micro (2005)

Traditional reliable servers require costly design changes to the processor, use custom system or application software, or cannot scale beyond a few processing elements. We present TRUSS, a family of server architectures providing reliable, scalable computation from distributed shared-memory hardware while requiring no changes to software. The TRUSS paradigm centers around a logical division of computation and memory that isolates errors in processing from memory storage and vice versa. In this paper, we present the key mechanisms that enable this separation and use full-system simulation to evaluate the impact on a range of commercial and scientific workloads.
Computation of the resonant frequency of a dielectrometer by the method of moments
Authors: Ercument Arvas
Venue:  (2005)

In this thesis, a method of obtaining the dielectric constant (relative permittivity) of a sample of dielectric material is described. Insertion of a dielectric sample into an empty cavity will lower the resonant frequency of the cavity. In the method, a new numerical solution by the method of moments is programmed on a digital computer to calculate the resonant frequency of the cavity when it contains a hypothetical sample whose dielectric constant is an arbitrarily chosen number. This numerical solution is then used to plot a curve of the resonant frequency versus the dielectric constant of the hypothetical inserted sample for the range of dielectric constant in which the dielectric constant of the actual sample is thought to be. The dielectric constant for which the resonant frequency is equal to the resonant frequency that is measured when the actual sample is inserted into the cavity is then the dielectric constant of the actual sample. Called the dielectrometer, the cavity possesses the rotational symmetry of a body of revolution. The resonant field in it is assumed to be not much different from the TE011 circular cavity mode. A gap in the perfectly conducting walls allows for insertion of the dielectric sample. After the dielectric sample is inserted, the interior of the cavity is divided into three regions: the dielectric region and two separate regions outside the dielectric. In the numerical solution by the method of moments, the electromagnetic field in each region is produced by surface currents on the boundary of each region. Boundary conditions give surface integral equations which are solved by the method of moments. Advantage is taken of both rotational symmetry and symmetry about a central plane. Dielectric constants obtained by using the method described in this thesis are in excellent agreement with other results.
Deposition of 60 nm thin Sr0.8Bi2.2Ta2O9 layers for application in scaled 1T1C and 1T FeRAM devices
Authors: L. Goux, Z. Xu, B. Kaczer, G. Groeseneken, D. J. Wouters
Venue: Microelectronic Engineering (2005)

Voltage scaling of 1T1C and 1T FeRAM devices requires the optimization of very thin ferroelectric layers. A current challenge is to deposit thin films on relevant substrates with minimized degradation of bulk ferroelectric properties. In this work, we characterize the microstructure of 60 nm thin SBT films deposited either by MOD or MOCVD on Pt, SiO2, Si3N4, and HfO2. We show that MOCVD is more suited than MOD to deposit layers with dense microstructure, and that the substrate dependence of the microstructure is strongly reduced for MOCVD layers. We discuss crystallization mechanisms for both techniques and we correlate them to the better ferroelectric properties of MOCVD films.
Industry Track: Refining production strategy optimization model based on mixed bi-level programming method
Authors: WANG Wei, ZHANG Qiang, LI Ze-fei, MEI Wei
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Abstract: The production process of a refinery is a complicated process, which consists of immense units. For some units, the products are multiple, so does the feasible operation mode of products of certain units. Which kind of operation mode is utilized decides the production strategy of a refinery. In this paper, how to gain reasonable production strategy is focused on due to the immense benefit it can bring to, and a production strategy optimization model based on mixed bi-level programming method is presented to solve this problem. All the units included in the production process are divided into two levels, and most of the production information of them is integrated by a database system in the model. How the optimization model can be used as a viable tool is also showed by a simple case study at Daqing refinery. Key Words: Refinery, Production strategy, Optimization, Mixed bi-level model
Tools for large graph mining
Authors: Deepayan Chakrabarti
Venue:  (2005)

Graphs show up in a surprisingly diverse set of disciplines, ranging from computer networks to sociology, biology, ecology and many more. How do such &ldquo;normal&rdquo; graphs look like? How can we spot abnormal subgraphs within them? Which nodes/edges are &ldquo;suspicious?&rdquo; How does a virus spread over a graph? Answering these questions is vital for outlier detection (such as terrorist cells, money laundering rings), forecasting, simulations (how well will a new protocol work on a realistic computer network?), immunization campaigns and many other applications. We attempt to answer these questions in two parts. First, we answer questions targeted at applications : what patterns/properties of a graph are important for solving specific problems? Here, we investigate the propagation behavior of a computer virus over a network, and find a simple formula for the epidemic threshold (beyond which any viral outbreak might become an epidemic). We find an &ldquo;information survival threshold&rdquo; which determines whether, in a sensor or P2P network with failing nodes and links, a piece of information will survive or not. We also develop a scalable, parameter-free method for finding groups of &ldquo;similar&rdquo; nodes in a graph, corresponding to homogeneous regions (or CrossAssociations) in the binary adjacency matrix of the graph. This can help navigate the structure of the graph, and find un-obvious patterns. In the second part of our work, we investigate recurring patterns in real-world graphs, to gain a deeper understanding of their structure. This leads to the development of the R-MAT model of graph generation for creating synthetic but &ldquo;realistic&rdquo; graphs, which match many of the patterns found in real-world graphs, including power-law and lognormal degree distributions, small diameter and &ldquo;community&rdquo; effects.
Grouping Text Lines in Freeform Handwritten Notes
Authors: Ming Ye, Herry Sutanto, Sashi Raghupathy, Chengyang Li, Michael Shilman
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Handwritten text lines are prominent structures in freeform digital ink notes and their reliable detection is the foundation to a natural and intelligent interface for note editing and repurposing. This paper presents an optimization method for text line grouping. The global cost function is designed to find the simplest stroke partitioning to maximize the likelihood of the resulting lines and the consistency of their configuration. A dynamic programming algorithm provides an initial segmentation of the time-ordered stroke sequence. Then a local gradient-descent algorithm iteratively evaluates splitting and merging hypotheses to minimize the global cost function. On average, the proposed technique processes each note page in less than a second at a 90% accuracy.
Technology to facilitate ethical action: a proposed design
Authors: H. Wightman, G. Jurkovic, E. Chan
Venue: AI Society (2005)

As emerging technologies support new ways in which people relate, ethical discourse is important to help guide designers of new technologies. This article endeavors to do just that by presenting an ethical analysis and design of technology intended to gather and act upon information on behalf of its users. The article elaborates on socio-technological factors that affect the development of technology to support ethical action. Research and practice implications are outlined.
Predictive Haptic Guidance: Intelligent User Assistance for the Control of Dynamic Tasks
Authors: Benjamin A. C. Forsyth Karon E. MacLean
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

Intelligent systems are increasingly able to offer real-time information relevant to a user's manual control of an interactive system, such as dynamic system control space constraints for animation control and driving. However, it is difficult to present this information in a usable manner and other approaches which have employed haptic cues for manual control in "slow¿ systems often lead to instabilities in highly dynamic tasks. We present a predictive haptic guidance method based on a look-ahead algorithm, along with a user evaluation which compares it with other approaches (no guidance and a standard potential-field method) in a 1-DoF steered path-following scenario. Look-ahead guidance outperformed the other methods in both quantitative performance and subjective preference across a range of path complexity and visibility and a force analysis demonstrated that it applied smaller and fewer forces to users. These results (which appear to derive from the predictive guidance's supporting users in taking earlier and more subtle corrective action) suggest the potential of predictive methods in aiding manual control of dynamic interactive tasks where intelligent support is available.
A New Technique to Reduce False Sharing in Parallel Irregular Codes Based on Distance Functions
Authors: Juan C. Pichel, Dora B. Heras, Jose C. Cabaleiro, Francisco F. Rivera
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper a technique to deal with the problem of poor locality and false sharing in irregular codes on shared memory multiprocessors (SMPs) is proposed. This technique is based on the locality model for irregular codes previously developed and extensively proven by the authors on monoprocessors and multiprocessors. In the model, locality is established in run-time considering parameters that describe the structure of the sparse matrix which characterizes the irregular accesses. As an example of irregular code with false sharing a particular implementation of the sparse matrixvector product (SpM×V) was selected. The problem of increasing locality and decreasing false sharing for a irregular problem is formulated as a graph. An adequate distribution of the graph among processors followed by a reordering of the nodes inside each processor produces the solution. The results show important improvements in the behavior of the irregular accesses: reductions in execution time and an improved program scalability.
Power performance and scalability study of AlGaAs/GaAs double-recessed pseudomorphic high electron mobility transistors on unthinned substrate for coplanar waveguide circuit applications
Authors: Cheeleong Tan, K. Radhakrishnan, Hong Wang
Venue: Microelectronic Engineering (2005)

We have investigated the power performance and scalability of AlGaAs/GaAs Double-Recessed Pseudomorphic High Electron Mobility Transistors (DR-PHEMTs) at 10GHz on an unthinned GaAs substrate for CoPlanar Waveguide (CPW) circuit applications. It was found that the output power varied linearly with the logarithm of the device's gate width ranging from 200 to 1000@mm. It increased at a rate of 0.01dB/@mm. That worked out to a doubling of output power (or 3dB) for every 300@mm increase in the gate width. Gain decreased at a rate of about 0.005dB/@mm while PAE generally improved when the gate width was increased. As for DC measurement, the maximum transconductance of the device was about 375mS/mm at V"G=-0.5V and V"D"S=3V. The gate-drain breakdown voltage (BV"G"D) measured was -20V, defined at I"G=-1mA/mm. The microwave performance of the devices was measured on-wafer using a load-pull system at a bias of V"G=-0.5V and V"D"S=8V. For a device with a gate width of 1mm, its saturated CW output power, gain and PAE value at 10GHz was 27.5dBm (0.55W), 8dB and 48%, respectively. At this same set of bias conditions, the value of f"t and f"m"a"x was 40 and 80GHz, respectively.
Optimizing Network Performance In Replicated Hosting
Authors: Ningning Hu, Peter Steenkiste, Oliver Spatscheck, Jia Wang
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

Most important commercial Web sites maintain multiple replicas of their server infrastructure to increase both reliability and performance. In this paper, we study how many replicas should be used and where they should be placed in order to improve client network performance, including both the latency (e.g., round-trip time) between clients and the replicas, and the bandwidth performance between them. This study is based on a large scale measurement study from an 18-node infrastructure, which reveals for the first time the distribution of today¿s Internet end-user access bandwidth. For example, we find that 50% of end users have access bandwidth less than 4.2Mbps. Using a greedy algorithm, we show that the first five replicas dominate latency optimization in our measurement infrastructure, while the first two replicas dominate bandwidth optimization. We also found that geographic diversity does not help as much for bandwidth optimization as it does for latency. To determine the proper trade-off between latency and bandwidth, we use a simplified TCP model to show that, when content size is less than 10KB, the deployment should focus on optimizing latency, while for content sizes larger than 1MB, the deployment should focus on optimizing bandwidth.
Variable Thresholding Based Multiple Description Video Coding
Authors: S. Pavan, G. Sridhar, V. Sridhar
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Video streaming applications have become increasingly popular in the recent years, and their use will continue to grow in the future. However, variations in channel conditions cause delays and packet erasures resulting in degradation of Quality of Service (QoS). Multiple Description (MD) coding is one method to reduce the detrimental effects caused by these channel variations. In this paper we have presented a novel pre-processing MD approach, which makes use of the redundancies already present in the original sequence to create multiple descriptions. The proposed approach is compatible with the commonly used video coding standards such as the H.26x and MPEG. The proposed scheme improves performance in terms of the coding efficiency and error resiliency compared to the approaches present in the literature.
Opportunities, Challenges, and Projections for Superconductor RSFQ Microprocessors
Authors: Mikail Dorojevets
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Superconductor processors based on Rapid Single Flux Quantum (RSFQ) circuit technology can reach and exceed operating frequencies of 100 GHz, while keeping processor power consumption low. These features provide an opportunity to build compact, multi-petaflops systems with ultra-high-speed 64/128-bit single-chip microprocessors to address the government's critical mission needs for high end-computing (HEC).
Unix: old school
Authors: Matthew Hoskins
Venue: Linux Journal (2005)

Want to walk down "Virtual Memory" lane? SIMH allows you to emulate historical UNIX implementations, like UNIX V5 from back in 1974.
Simulation of Motion of a Collection of Rigid Bodies, Taking into Account Their Collisions and Joints
Authors: A. V. Anisimov, S. F. Zabaryanskii
Venue: Cybernetics and Systems Analysis (2005)

Existing methods of simulation of motion of rigid bodies are considered that take into account collisions and joints of such bodies. A new fast universal fixed-step-size algorithm of speed constraints is proposed. This algorithm combines all the advantages of well-known algorithms and is deprived of their drawbacks. Using a modified Dantzig method, the upper time estimate equal to O(4k) is obtained for the algorithm.
Blowtorch: a framework for firewall test automation
Authors: Daniel Hoffman, Kevin Yoo
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Firewalls play a crucial role in network security. Experience has shown that the development of firewall rule sets is complex and error prone. Rule set errors can be costly, by allowing damaging traffic in or by blocking legitimate traffic and causing essential applications to fail. Consequently, firewall testing is extremely important. Unfortunately, it is also hard and there is little tool support available.Blowtorch is a C++ framework for firewall test generation. The central construct is the packet iterator: an event-driven generator of timestamped packet streams. Blowtorch supports the development of packet iterators with a library for packet header creation and parsing, a transmit scheduler for multiplexing of multiple packet streams, and a receive monitor for demultiplexing of arriving packet streams. The framework provides iterators which generate packet streams using covering arrays, production grammars, and replay of captured TCP traffic. Blowtorch has been used to develop tests for industrial firewalls that are placed between an IT network and a process control network.
Cache characterization and performance studies using locality surfaces
Authors: J. Kelly Flanagan
Venue:  (2005)

Today's processors commonly use caches to help overcome the disparity between processor and main memory speeds. Due to the principle of locality, most of the processor's requests for data are satisfied by the fast cache memory, resulting in a significant performance improvement. Methods for evaluating workloads and caches in terms of locality are valuable for cache design. In this dissertation, we present a locality surface which displays both temporal and spatial locality on one three-dimensional graph. We provide a solid, mathematical description of locality data and equations for visualization. We then use the locality surface to examine the locality of a variety of workloads from the SPEC CPU 2000 benchmark suite. These surfaces contain a number of features that represent sequential runs, loops, temporal locality, striding, and other patterns from the input trace. The locality surface can also be used to evaluate methodologies that involve locality. For example, we evaluate six synthetic trace generation methods and find that none of them accurately reproduce an original trace's locality. We then combine a mathematical description of caches with our locality definition to create cache characterization surfaces. These new surfaces visually relate how references with varying degrees of locality function in a given cache. We examine how varying the cache size, line size, and associativity affect a cache's response to different types of locality. We formally prove that the locality surface can predict the miss rate in some types of caches. Our locality surface matches well with cache simulation results, particularly caches with large associativities. We can qualitatively choose prudent values for cache and line size. Further, the locality surface can predict the miss rate with 100% accuracy for some fully associative caches and with some error for set associative caches. One drawback to the locality surface is the time intensity of the stack-based algorithm. We provide a new parallel algorithm that reduces the computation time significantly. With this improvement, the locality surface becomes a viable and valuable tool for characterizing workloads and caches, predicting cache simulation results, and evaluating any procedure involving locality.