ppxscal/embedding_network huggingface dataset:
On the interaction among self-interested users of network resources
Authors: Donald Towsley
Venue:  (2006)

We study the interactions among self-interested users of network resources in the context of congestion control and routing protocols in computer networks. In the context of congestion control, we propose a game-theoretic study of the selfish behavior of TCP users when they are allowed to use multiple concurrent TCP connections so as to maximize their goodputs (or other utility function). We refer to this as the TCP connection game. We demonstrate the existence and uniqueness of Nash equilibrium in several variants of this game. We also generalize this game to model peer-to-peer unstructured file sharing networks. The bad news is that the loss of efficiency (the price of anarchy) at the Nash Equilibrium can be arbitrarily large if users have no resource limitations and are not socially responsible. The good news is that, if either of these two factors is considered, the loss of efficiency is bounded. We then study the interaction between overlay routing controller and underlay native network routing controller using two approaches. In the first approach, we formulate this interaction as a two-player game, in which the overlay network seeks to minimize the delay of its overlay traffic while the underlay network seeks to minimize the network cost as a whole. We show that the selfish behavior of the overlay network can cause huge cost increase and oscillation in the entire network. Even worse, we have identified cases in which the overlay network's cost increases as the game proceeds even though the overlay plays optimally in response to the underlay network's routing at each round. To solve this conflict, we propose that the overlay network plays as a leader in a Stackelberg game. In the second approach, we investigate the ability of an overlay network to compensate for "careless" routing in the native network layer, i.e., for network-layer routes not optimized for the performance of application overlays. In particular, we investigate the extent to which overlay-over-careless-underlay can achieve performance close to that attainable when underlay routing is performed in an optimal ("careful") manner. We find that the overlay network can compensate for careless underlay routing only when the sub-graph formed by the underlay network's routes is rich, which can be collectively characterized by three graph-theoretic metrics. This result suggests that ISPs can simplify underlay network management by relegating responsibility for performance to application overlays.
Economic mechanism design for computerized agents
Authors: Hal R. Varian
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

The field of economic mechanism design has been an active area of research in economics for at least 20 years. This field uses the tools of economics and game theory to design "rules of interaction" for economic transactions that will, in principle, yield some desired outcome. In this paper I provide an overview of this subject for an audience interested in applications to electronic commerce and discuss some special problems that arise in this context.
Parallel Viterbi algorithm for a VLIW DSP
Authors: S. Ahmad Khan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The Viterbi decoder algorithm for a very high data-rate satellite receiver is computationally very intensive. Dedicated commercially available chips are used for high rate convolutional decoders. With the advent of high speed DSPs, these computationally intensive algorithms can be mapped on programmable DSPs running test of the receiver algorithm. This paper presents the Viterbi algorithm specially designed for VLIW DSPs and its implementation on a commercially available DSP for a very high data rate coherent burst demodulator satellite receiver.
Image Watermarking Using Krawtchouk Moments
Authors: A. Venkataramana, P. Ananth Raj
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper proposes a watermark insertion and detection scheme using Krawtchouk moments. These moments are selected for image watermarking because image reconstruction with these moments is better than other orthogonal moments like Legendre, Zernike and Tchebichef. The watermark signal is obtained by modifying some of the Krawtchouk moments of the original image. Further, the strength of the watermark is adjusted based on a threshold value(T) which is obtained by maximum root mean square error(rms value) between Krawtchouk moment invariants of the original image and Krawtchouk moment invariants of original image subjected to possible distortions like rotation, scale and translation. Krawtchouk moment invariants are used since they are invariant to image rotation, scale and translation. In order to detect the added watermark, we calculate the rms value between Krawtchouk moment invariants of test image and Krawtchouk moment invariants of the watermarked image. The watermark is detected if the above rms value is less than a threshold (T). It is noted from the simulation results that the proposed approach is robust with respect to geometric distortions like scale, translation and rotation.
From Gaussian scale-space to B-spline scale-space
Authors: Yu-Ping Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The Gaussian kernel has long been used in the classical multiscale analysis. The purpose of the paper is to propose the uniform B-spline as an alternative for the visual modeling. A general framework for various scale-space representations is formulated using the B-spline approach. In particular, the evolution of the wavelet models can be well understood from such an approach. Most of the wavelet representations can be factored into B-spline bases and hence can be implemented efficiently using the spline technique. Besides, it is shown that the B-spline scale-space representations not only inherit most of the properties of the Gaussian scale-space but also have many advantages with respect to the efficiency, compactness and parallel structure.
JEcoSys - a framework for interactive plants simulation
Authors: L. C. Y. Endo, C. H. Morimoto, A. E. Fabris
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper introduces JEcoSys, an extensible framework developed in Java to generate interactive simulations of plants. JEcoSys uses a simple physical model of plants, based on dynamic constraints, and pre-computations to achieve realism and efficiency during animation. The framework also includes a force field based technique to model the interaction of plants with different agents, that can simulate natural phenomena such as wind and rain. Experimental results show that JEcosys is able to simulate complex scenes containing hundreds of tufts of grass and flowers in real-time.
Multiple codebook decoding of VQ compressed images
Authors: A. Narayan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper proposes an implementation for vector quantizers (VQ) with one-codebook encoding and multiple-codebook decoding. The technique uses a convex projections (CP) based algorithm to iteratively project a coarsely encoded image onto a better codebook(s) during decoding. The objective of this approach is to encode edge vectors vestigially. This drastically reduces the number of edge vector representations at the encoder and hence results in fast searches. Also this method works better on images outside the training set since encoding is less dependent on the edges.
The Future of Empirical Methods in Software Engineering Research
Authors: Dag I. K. Sjoberg, Tore Dyba, Magne Jorgensen
Venue: 2007 Future of Software Engineering (2007)

We present the vision that for all fields of software engineering (SE), empirical research methods should enable the development of scientific knowledge about how useful different SE technologies are for different kinds of actors, performing different kinds of activities, on different kinds of systems. It is part of the vision that such scientific knowledge will guide the development of new SE technology and is a major input to important SE decisions in industry. Major challenges to the pursuit of this vision are: more SE research should be based on the use of empirical methods; the quality, including relevance, of the studies using such methods should be increased; there should be more and better synthesis of empirical evidence; and more theories should be built and tested. Means to meet these challenges include (1) increased competence regarding how to apply and combine alternative empirical methods, (2) tighter links between academia and industry, (3) the development of common research agendas with a focus on empirical methods, and (4) more resources for empirical research.
Experience with a language for writing coherence protocols
Authors: Satish Chandra, Michael Dahlin, Bradley Richards, Randolph Y. Wang, Thomas E. Anderson, James R. Larus
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

In this paper we describe our experience with Teapot [7], a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distributed computing systems make local replicas of shared data to improve scalability and performance. In both distributed shared memory systems and distributed file systems, a coherence protocol maintains agreement among the replicated copies as the underlying data are modified by programs running on the system. Cache coherence protocols are notoriously difficult to implement, debug, and maintain. Unfortunately, protocols are not off-the-shelf items, as their details depend on the requirements of the system under consideration. This paper presents case studies detailing the successes and shortcomings of using Teapot for writing coherence protocols in two systems. The first system, loosely coherent memory (LCM) [16], implements a particular type of distributed shared memory suitable for data-parallel programming. The second system, the xFS distributed file system [9], implements a high-performance, serverless file system. Our overall experience with Teapot has been very positive. In particular, Teapot's language features resulted in considerable simplifications in the protocol source code for both systems. Furthermore, Teapot's close coupling between implementation and formal verification helped to achieve much higher confidence in our protocol implementations than previously possible and reduced the time to build the protocols. By using Teapot to solve real problems in complex systems, we also discovered several shortcomings of the Teapot design. Most noticeably, we found Teapot lacking in support for multithreaded environments, for expressing actions that transcend several cache blocks, and for handling blocking system calls. We believe that domain-specific languages are valuable tools for writing cache coherence protocols.
Flattened butterfly: a cost-efficient topology for high-radix networks
Authors: John Kim, William J. Dally, Dennis Abts
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

Increasing integrated-circuit pin bandwidth has motivateda corresponding increase in the degree or radix of interconnection networksand their routers. This paper introduces the flattened butterfly, a cost-efficient topology for high-radix networks. On benign (load-balanced) traffic, the flattened butterfly approaches the cost/performance of a butterfly network and has roughly half the cost of a comparable performance Clos network.The advantage over the Clos is achieved by eliminating redundant hopswhen they are not needed for load balance. On adversarial traffic, the flattened butterfly matches the cost/performance of a folded-Clos network and provides an order of magnitude better performance than a conventional butterfly.In this case, global adaptive routing is used to switchthe flattened butterfly from minimal to non-minimal routing - usingredundant hops only when they are needed. Minimal and non-minimal, oblivious and adaptive routing algorithms are evaluated on the flattened butterfly.We show that load-balancing adversarial traffic requires non-minimalglobally-adaptive routing and show that sequential allocators are required to avoid transient load imbalance when using adaptive routing algorithms.We also compare the cost of the flattened butterfly to folded-Clos, hypercube,and butterfly networks with identical capacityand show that the flattened butterfly is more cost-efficient thanfolded-Clos and hypercube topologies.
Texture-space segmentation and multi-resolution mapping for forestry applications
Authors: M. Hill
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Forestry management requires careful and intensive planning efforts to ensure optimal yield, ecological stability, and regulatory compliance. We describe a method of identifying wetlands and producing maps of their extent from commonly available, remotely-sensed imagery. This method provides a large labor savings over both field inspections and manual photo inspections. The enhanced accuracy translates into better timber harvest planning and better conservation of the wetlands.
Time-frequency signal decomposition using energy mixture models
Authors: M. Coates
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We address the problem of signal decomposition. We specify signal components by the property that their energies are localised and disjoint in the time-frequency plane. Rather than modelling the signal directly, we represent the time-frequency energy of the signal using a finite mixture model. This model is used to develop a partitioning of the time-frequency plane, allowing the application of time-frequency filtering to isolate components. Modelling energy rather than specifying a dictionary of allowable waveforms imposes fewer constraints on what a component may be. We demonstrate how the approach can be applied in the context of vibration analysis, where we wish to isolate the structure of individual bending waves travelling through a beam.
Mesh resolution augmentation using 3D skin bank
Authors: Won-Sook Lee, Andrew Soon
Venue: Computer-Aided Design (2007)

We present a 3D skin containing the 3D detail information of a high resolution facial mesh. Our 3D skin bank is derived from several scanned faces with resolutions up to several million triangles where even the pores are clearly visible. We present a method to raise the resolution of any given low quality face's geometry by making use of the 3D skin, where the resultant model's final resolution is high enough to be used in computer-generated films. Our method can be deployed to produce numerous high resolution versions of a single low quality face, each bearing different skin characteristics.
Energy evaluation of software implementations of block ciphers under memory constraints
Authors: Johann Großschädl, Stefan Tillich, Christian Rechberger, Michael Hofmann, Marcel Medwed
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Software implementations of modern block ciphers often require large lookup tables along with code size increasing optimizations like loop unrolling to reach peak performance on general-purpose processors. Therefore, block ciphers are difficult to implement efficiently on embedded devices like cell phones or sensor nodes where run-time memory and program ROM are scarce resources. In this paper we analyze and compare the performance, energy consumption, run-time memory requirements, and code size of the five block ciphers RC6, Rijndael, Serpent, Twofish, and XTEA on the StrongARM SA-1100 processor. Most previous evaluations of block ciphers considered performance as the sole metric of interest and did not care about memory requirements or code size. In contrast to previous work, our study of the performance and energy characteristics of block ciphers has been conducted with "lightweight" implementations which restrict the size of lookup tables to 1 kB and also impose constraints on the code size. We found that Rijndael and RC6 can be well optimized for high performance and energy efficiency, while at the same time meeting the demand for low memory (RAM and ROM) footprint. In addition, we discuss the impact of key expansion and modes of operation on the overall performance and energy consumption of each block cipher. Our simulation results show that RC6 is the most energy-efficient block cipher under memory constraints and thus the best choice for resource-restricted devices.
Efficient CRCW PRAM Emulation on Practical Networks
Authors: Mounir Hamdi
Venue: ICPP (1994)

A new interconnection network is proposed for the construction of massively parallel computers. The systematic construction of this network, denoted RCNFULL, is performed by methodically connecting together a number of basic atoms where a basic atom is a set of fully connected nodes. Key communication characteristics and efficient routing algorithms are derivedfor RCN-FULL. An 0(log(N)) sorting algorithm is shown for RCN-FULL and RCN-FULL is proven to deterministically emulate the CRCW PRAM model, with only O(log{N)) degradation in time performance. Finally, the hardware cost for the RCNFULL is estimated as a function of its pin limitations and compared favorably to that of the hypercube.
Efficient Routing Heuristics for Internet Traffic Engineering
Authors: Ronaldo M. Salles, Vitor G. Rolla
Venue: Computer Communications (2007)

This work presents an alternative analysis for the shortest path optimal routing problem and proposes novel heuristics methods to solve it. In practical terms, a solution for the shortest path optimal routing problem determines the link weights that optimize a computer network operating under standard routing protocols (e.g. OSPF). We base our solution on traffic engineering techniques that respect the shortest path routing model. We consider the main objectives of traffic engineering, such as: load balancing, efficient use of available resources and capacity to support growing traffic demands. Our proposals present better results than traditional approaches and follow closely theoretical optimal points.
Full abstraction for nominal general references
Authors: Nikos Tzevelekos
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Game semantics has been used with considerable suc- cess in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computa- tional effects. Recently, nominal games have been proposed for modeling functional languages with names. These are ordinary games cast in the theory of nominal sets devel- oped by Pitts and Gabbay. Here we take nominal games one step further, by developing a fully abstract semantics for a language with nominal general references.
A Pattern-Driven Process Model for Quality-Centered Software Architecture Design--A Case Study on Usability-Centered Design
Authors: Jukka Kaartinen, Jarmo Palviainen, Kai Koskimies
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Quality requirements of software systems typically affect large portions of the system, and should be taken into account early in the design process. Patterns have become a mainstream technique to associate frequent quality-related design problems with proven solutions. We present a generic pattern-driven design process model, and apply this to usability, obtaining a usability-centered design process model. As a case study, we have applied the model to the usability-centered software architecture design of a stone crusher control system.
Membrane Computing and Brane Calculi (Some Personal Notes)
Authors: Gheorghe Păun
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This is a very short discussion of similarities and dissimilarities between membrane computing and brane calculi, insisting mainly on some recent ideas of bridging the two areas of research (from this last point of view, the bibliography tries to be as complete as possible) and proving that, in fact, there is no real dissimilarity...
Transition Fault Testability in Bit Parallel Multipliers over GF(2^{m})
Authors: H. Rahaman, J. Mathew, B. K. Sikdar, D. K. Pradhan
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

This paper presents a C-testable technique for detecting transition faults with 100% fault coverage in the polynomial basis (PB) bit parallel (BP) multiplier circuits over GF(2^{m}). The proposed technique requires only 10 vectors, which is independent of multiplier size, at the cost of 6% (avg.) extra hardware and three control pins. The proposed constant test vectors which are sufficient to detect both the transition and stuck-at faults in the multiplier circuits can be derived directly without any requirement of an ATPG tool. As the GF(2^{m}) multipliers have found critical applications in public key cryptography and need secure internal testing, a Built-in Self-Test (BIST) circuit is proposed for generating test patterns internally. This obviates the need of having three extra pins for the control inputs and also provides public key security in cryptography. Area and delay of the testable circuit are analyzed using 0.18\mu CMOS technology library from UMC.
Learning Business Strategies for Competitive Electronic Marketplaces
Authors: Isabel Praca, Maria Joao Viamonte, Carlos Ramos, Zita Vale
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper presents a Multi-Agent Market simulator designed for developing new agent market strategies based on a complete understanding of buyer and seller behaviors, preference models and pricing algorithms, considering user risk preferences and game theory for scenario analysis. This tool studies negotiations based on different market mechanisms and, time and behavior dependent strategies. The results of the negotiations between agents are analyzed by data mining algorithms in order to extract rules that give agents feedback to improve their strategies. The system also includes agents that are capable of improving their performance with their own experience, by adapting to the market conditions, and capable of considering other agent reactions.