ppxscal/embedding_network huggingface dataset:
Simulation and Evaluation of On-Chip Interconnect Architectures: 2D Mesh, Spidergon, and WK-Recursive Network
Authors: S. Suboh, M. Bakhouya, T. El-Ghazawi
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

Network-on-chip has been proposed as an alternative to bus-based system to achieve high performance and scalability. The topology of on-chip interconnect plays a crucial role in System on chip performance, energy, and area requirements. In this paper, an on-chip interconnects architecture based on WK-recursive network is proposed. WK-recursive structure is analyzed and compared to 2D mesh and Spidergon structures. Simulation results show that WK-Recursive on-chip interconnect generally outperforms the other architectures.
Dynamic data replication in LCG 2008
Authors: C. Nicholson, D. G. Cameron, A. T. Doyle, A. P. Millar, K. Stockinger
Venue: Concurrency and Computation: Practice Experience (2008)

To provide performance access to data from high-energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dynamic, automated replication in response to jobs may also be useful and has been investigated using the grid simulator OptorSim. In this paper, results are presented from simulations of the LHC Computing Grid in 2008, in a physics analysis scenario. These show, first, that dynamic replication does give improved job throughput; second, that for this complex grid system, simple replication strategies such as Least Recently Used and Least Frequently Used are as effective as more advanced economic models; third, that grid site policies that allow maximum resource sharing are more effective; and lastly, that dynamic replication is particularly effective when data access patterns include some files being accessed more often than others, such as with a Zipf-like distribution. Copyright &copy; 2008 John Wiley & Sons, Ltd. (Cameron) Work done while at CERN, the European Organization for Nuclear Research, 1211 Geneva, Switzerland. (Stockinger) Work done while at Lawrence Berkeley National Laboratory, Berkeley, CA 94720, U.S.A.
LOFT: Low-Overhead Freshness Transmission in Sensor Networks
Authors: Chin-Tser Huang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Sequence numbers have been used by a variety of network protocols as freshness identifiers to achieve reliable transmission and provide protection against replay attacks. The number of bits allocated for a sequence number shall not be too small in order to avoid frequent wraparounds and replay attacks. However, in a sensor network consisting of resource-constrained sensor nodes, transmitting a full sequence number along with a message represents considerable overhead that is desirable to be avoided. In this paper, we propose LOFT, a protocol that lowers the overhead of transmitting freshness identifiers along with messages. In LOFT, the sender and receiver still maintain a sequence number of the same number of bits, but when the sender sends a new message, it only transmits a less significant portion of the sequence number bits in order to save energy. All the bits of the sequence number are involved in the computation of a message authentication code, so that the receiver can verify the freshness of the message. Moreover, LOFT makes use of Bloom filter to mitigate the overhead of freshness check caused by DoS attacks. We use simulations to analyze how much a portion of the sequence number should be transmitted to achieve best performance in terms of efficiency and effectiveness.
Association rule mining for product and process variety mapping
Authors: J. Jiao, L. Zhang, Y. Zhang, S. Pokharel
Venue: International Journal of Computer Integrated Manufacturing (2008)

Today's manufacturers strive to design and produce a large number of customized products at low cost and quick turnround in order to survive market competition. The consequence of high product variety manifests itself through an exponentially increased number of process variants, which introduces significant constraints to production planning and control. Leveraging upon product and process families has been well recognized as an important area in which manufacturers can exploit mass production efficiency, wherein the linchpin of managing variety propagation from design to production lies in the mapping relationships between product differentiation and process variation. Taking advantage of knowledge discovery from historical data, this paper applies an association rule mining technique to deal with product and process variety mapping. The mapping relationships are embodied in association rules, which can be deployed to support production planning of product families within existing production processes. A case study of mass customization of vibration motors is presented to demonstrate how the association rule mining mechanism helps maintain the coherence between product and process variety. The performance of the association rule mining approach is further evaluated through sensitivity analysis.
Partial visibility for stylized lines
Authors: Forrester Cole, Adam Finkelstein
Venue: Proceedings of the 6th international symposium on Non-photorealistic animation and rendering (2008)

A variety of non-photorealistic rendering styles include lines extracted from 3D models. Conventional visibility algorithms make a binary decision for each line fragment, usually by a depth test against the polygons of the model. This binary visibility test produces aliasing where lines are partially obscured by polygons or other lines. Such aliasing artifacts are particularly objectionable in animations and where lines are drawn with texture and other stylization effects. We introduce a method for anti-aliasing the line visibility test by supersampling, analogous to anti-aliasing for polygon rendering. Our visibility test is inexpensive using current graphics hardware and produces partial visibility that largely ameliorates objectionable aliasing artifacts. In addition, we introduce a method analogous to depth peeling that further addresses artifacts where lines obscure other lines.
On-Chip Process Variation Detection and Compensation Using Delay and Slew-Rate Monitoring Circuits
Authors: Amlan Ghosh, Rahul M. Rao, Ching-Te Chuang, Richard B. Brown
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

In the nm design era, post-fabrication process characterization and compensation have become extremely important for mitigating the impact of process variations on the parametric yield. In this paper, a new variation detection and compensation scheme is presented that uses both slew and delay metrics to gauge the drive-strengths of and mismatch of NMOS and PMOS devices. The importance of considering both of these metrics is illustrated. Four compensation schemes are analyzed, based on delay or slew as the detection metric, with the ability to apply forward and reverse body-biasing. Design considerations, simulation results and power-performance characteristics of these schemes in a 45 nm SOI technology are presented. These schemes are shown to be capable of adjusting the critical path delay of the die to within the desired ± 3% of the nominal delay while reducing the total power dissipation by an average of ~8% across various process corners.
Study of the effects of MBUs on the reliability of a 150 nm SRAM device
Authors: Juan Antonio Maestro, Pedro Reviriego
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Soft errors induced by radiation are an increasing problem in the microelectronic field. Although traditional models estimate the reliability of memories suffering Single Event Upsets (SEUs), Multiple Bit Upsets (MBUs) are becoming more and more important as technology scales. In this paper, a model that deals with MBUs in memory systems, which allows calculating reliability in a fast way similar to the SEU case, has been used to analyze the Mean Time To Failure (MTTF) of a 150 nm device under radiation. This analysis illustrates the importance that physical factors, as the energy, have on the system reliability.
Computing a shortest k-link path in a polygon
Authors: J. S. B. Mitchell
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors consider the problem of finding a shortest polygonal path from s to t within a simple polygon P, subject to the restriction that the path have at most k links (edges). They give an algorithm to compute a k-link path with length at most (1 + epsilon ) times the length of a shortest k-link path, for any error tolerance epsilon >0. The algorithm runs in time O(n/sup 3/k/sup 3/ log (Hk/ epsilon /sup 1/k/)), where N is the largest integer coordinate among the n vertices of P. They also study the more general problem of approximating shortest k-link paths in polygons with holes. In this case, they give an algorithm that returns a path with at most 2k links and length at most that of a shortest k-link path; the running time is O(kE/sup 2/), where E is the number of edges in the visibility graph. Finally, they study the bicriteria path problem in which the two criteria are link length and 'total turn' (the integral of mod Delta theta mod along a path). They obtain in an exact polynomial-time algorithm for polygons with holes.
A characterization of P4-indifference graphs
Authors: Chính T. Hoàng, Frédéric Maffray, Marc Noy
Venue: Journal of Graph Theory (1999)

A graph is a P4-indifference graph if it admits a linear ordering $\prec$ on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has either a $\prec$ b $\prec$ c $\prec$ d or d $\prec$ c $\prec$ b $\prec$ a. P4-indifference graphs generalize indifference graphs and are perfectly orderable. We give a characterization of P4-indifference graphs by forbidden induced subgraphs. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 155-162, 1999
A Probabilistic Characterization of Fault Rings in Adaptively-Routed Mesh Interconnection Networks
Authors: Farshad Safaei, Ahmad Khonsari, Aresh Dadlani, Mohamed Ould-Khaoua
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

With increase in concern for reliability in the current and next generation of Multiprocessors System-on-Chip (MP-SoCs), multi-computers, cluster computers, and peer-to-peer communication networks, fault-tolerance has become an integral part of these systems. One of the fundamental issues regarding fault-tolerance is how to efficiently route a faulty network where each component is associated with some probability of failure. Adaptive fault-tolerant routing algorithms have been frequently suggested in the literature as means of improving communication performance and fault-tolerant demands in computer systems. Also, several results have been reported on usage of fault rings in providing detours to messages blocked by faults and in routing messages adaptively around the rectangular faulty regions. In order to analyze the performance of such routing schemes, one must investigate the characteristics of fault rings. In this paper, we derive mathematical expressions to compute the probability of message facing the fault rings in the well-known mesh interconnection network. We also conduct extensive simulation experiments using a variety of faults, the results of which are used to confirm the accuracy of the proposed models.
Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Venue: Joint International Conference on Measurement and Modeling of Computer Systems (2008)

It is with great pleasure that I welcome you to SIGMETRICS 2008. Performance modeling and measurement are critical in the design and development of information technologies, ranging from computer systems to computer networks and the World Wide Web. Over the past decades we have seen an increasing influence of the modeling and measurement work in various disciplines in computer science. As a result, our community has been growing with broader application backgrounds and technical interests. This year's conference program is particularly exciting, with a number of new features. For the first time, the main conference has grown to a program of three full days with 36 papers. Also for the first time, we have a demo competition and a student thesis panel. In addition, there are three keynotes given by illustrious scholars from academia, François Baccelli (member of the French Academy of Sciences); from a funding agency, Jeannette Wing (Assistant Director of the Computer and Information Science and Engineering Directorate of the National Science Foundation); and from industry, Harrick Vin (Vice President of Research and Development at Tata Consultancy Services). Also new this year is a panel on Performance Analysis in the Real World, where all the panelists come from industrial production environments and will provide an industrial perspective of performance modeling and analysis. The conference program is further augmented with stimulating tutorials and workshops. This year, there are nine excellent tutorials on topics ranging from analysis and control techniques to performance engineering methodology and network economics. The MAthematical performance Modeling and Analysis (MAMA) workshop continues its success with its 10th edition in 2008. The Workshop on Hot Topics in METRICS (HotMetrics) will be inaugurated immediately after the main conference, in parallel with the third International Workshop on Feedback Control Implementation and Design in Computing Systems and Networks (FeBID). These tutorials and workshops complement the main conference and significantly enhance SIGMETRICS 2008.
A Comparative Analysis of Anti-Malware Software, Patch Management, and Host-Based Firewalls in Preventing Malware Infections on Client Computers
Authors: Moses Garuba, Chunmei Liu, Nicki Washington
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This purpose of this paper is to provide a comparative analysis of three methods used by organizations to prevent malware on client computers. These methods include anti-malware software, patch management, and host-based firewalls. Each method will be briefly described and then compared based on an evaluation of administrative and operational features. This comparative analysis may serve as a useful guide for organizations with limited security budgets and resources looking to invest in a malware prevention solution.
Race conditions in coexisting overlay networks
Authors: Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluca Iannaccone
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multiple similar or dissimilar overlay networks could experience race conditions, resulting in oscillations (in both route selection and network load) and cascading reactions. We pinpoint the causes for synchronization and derive an analytic formulation for the synchronization probability of two overlays. Our model indicates that the probability of synchronization is non-negligible across a wide range of parameter settings, thus implying that the ill effects of synchronization should not be ignored. Using the analytical model, we find an upper bound on the duration of traffic oscillations. We also show that the model can be easily extended to include a large number of co-existing overlays. We validate our model through simulations that are designed to capture the transient routing behavior of both the IP- and overlay-layers. We use our model to study the effects of factors such as path diversity (measured in round trip times) and probing aggressiveness on these race conditions. Finally, we discuss the implications of our study on the design of path probing process in overlay networks and examine strategies to reduce the impact of race conditions.
Web application hacking 101: pre-conference workshop
Authors: Mark Hicks
Venue: Journal of Computing Sciences in Colleges (2008)

While most security precautions focus on web server infrastructure, 75% of security attacks today are now at the application layer. You will learn in this workshop why hacking has shifted to the application tier, what are the top 10 web application vulnerabilities and what enterprise development teams are doing about it. The presenter will demonstrate the top two vulnerabilities: Cross Site Scripting and SQL Injection. Six hands-on labs will be offered that you can do in the workshop (assuming Internet access is available) or that you can do later as a demo for your students. This is a beginner's workshop geared to those who want an overview of web application vulnerabilties and those who look for resources to teach their students.
Computing in social networks with relationship algebra
Authors: Javed I. Khan, Sajid S. Shaikh
Venue: Journal of Network and Computer Applications (2008)

Communities are the latest phenomena on the Internet. At the heart of each community lies a social network. In this paper, we show a generalized framework to understand and reason in social networks. Previously, researchers have attempted to use inference-specific type of relationships. We propose a framework to represent and reason with general case of social relationship network in a formal way. We call it relationship algebra. In the paper, we first present this algebra then show how this algebra can be used for various interesting computing on a social network weaved in the virtual communities. We show applications such as determining reviewers in a semi-professional network maintained by conference management systems, finding conflict of interest in a publication system, or to infer various trust relationships in a community of close associates, etc. We also show how future community networks can be used to determine who should be immunized in the case of a contagious disease outbreak and how these networks could be used in crime prevention, etc.
SPIHT modification for erdge preserving wavelet lossy image coding: an application for automatic inspection
Authors: Raúl Pinto Elías, Osslan Vergara Villegas, Máximo López Sánchez, Vianey Guadalupe Cruz Sánchez
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

In this paper, we address the problem of design a wavelet lossy image coder that allows preservation of image features such as edges using a modified version of SPIHT algorithm. The modification is made by changing the concept of pixel significance, a coefficient is selected not only by magnitude but as part of a Feature Of Interest (FOI) map obtained with SUSAN edge detector and mapping the correspondent positions to the wavelet domain. The bit rate spends mores bits in those important zones, and finally the bit stream is entropy coded. We show experiments in which is demonstrated the edge preserving by using the decompressed images as inputs to quality automatic inspection process using the commercial software "Vision Builder".
3D reconstruction of irregular spaced LIDAR
Authors: Nicholas Shorter, Takis Kasparis
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

Preprocessing techniques are proposed for the development of a 3D Reconstruction algorithm designed for autonomously reconstructing three dimensional models from urban and residential buildings depicted in raw LIDAR data. First, a greedy insertion triangulation algorithm, modified with a novel noise filtering technique, triangulates the raw LIDAR data. Second, the normal vectors of the triangulated raw LIDAR data are then passed to an unsupervised clustering algorithm - Fuzzy Simplified Adaptive Resonance Theory (Fuzzy SART). Fuzzy SART returns a rough grouping of the coplanar triangles. Then, a proposed multiple regression algorithm further refines the coplanar grouping by further removing outliers and deriving an improved planar segmentation of the raw LIDAR data. Finally, further refinement is achieved by calculating the intersection of the best fit roof planes and moving nearby points close to that intersection to exist at the intersection, resulting in straight, straight roof ridges.
Batch kernel SOM and related Laplacian methods for social network analysis
Authors: Romain Boulet, Bertrand Jouve, Fabrice Rossi, Nathalie Villa
Venue: Neurocomputing (2008)

Large graphs are natural mathematical models for describing the structure of the data in a wide variety of fields, such as web mining, social networks, information retrieval, biological networks, etc. For all these applications, automatic tools are required to get a synthetic view of the graph and to reach a good understanding of the underlying problem. In particular, discovering groups of tightly connected vertices and understanding the relations between those groups is very important in practice. This paper shows how a kernel version of the batch self-organizing map can be used to achieve these goals via kernels derived from the Laplacian matrix of the graph, especially when it is used in conjunction with more classical methods based on the spectral analysis of the graph. The proposed method is used to explore the structure of a medieval social network modelled through a weighted graph that has been directly built from a large corpus of agrarian contracts.
Situation-aware radio resource management for multi-rate MC-CDMA wireless networks targeted at multimedia data exchanges in local areas
Authors: Leandro D'Orazio, Claudio Sacchi, Fabrizio Granelli, Francesco G. B. De Natale
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

In this work, a novel methodology for radio resource management is considered for multi-rate MC-CDMA WLAN indoor networking. The proposed strategy is based on resource reallocation and rate adaptation depending on the network situation, monitored in terms of achieved QoS by an intelligent access-point (AP). As they access the medium, all users send bit-rate requests on the basis of their application requirements. Then, the AP monitors the QoS in terms of frame-error-rate (FER) and decides a) to reallocate the radio resources (in terms of number of orthogonal subchannels) and b) to reduce the data rate, in order to improve throughput performances for those users penalized by heavy FER. The "rate downshift" process is continued until the FER measured by the AP allows data transfer with an acceptable QoS. The intelligent AP can also issue a "rate upshift" for users previously downshifted, or in presence of explicit requests, when the channel situation improves. Simulation results underline a general improvement of the aggregated throughput deriving from adaptively manage the QoS requirements with respect to the network situation, thus enabling good resource usage with the WLAN cell.
The amateur search
Authors: Michael Olson
Venue: ACM SIGMOD Record (2008)

In the days that followed Jim's disappearance at sea, his family, friends and colleagues came together in a remarkable effort to help find him. The group gathered, analyzed and filtered information from many sources. In concert with the Coast Guard, the results were used to focus the search in the places where Jim and his sailboat Tenacious were most likely to be. The scope and breadth -- indeed, the very existence -- of this amateur search effort reflect Jim at his best. The group was at first composed of those whose lives he had touched directly, who used skills and knowledge he had helped them to gain in hopes of finding him. As time passed, others joined in who were inspired by the unfolding story. In the end, thousands came together to search for Jim.