ppxscal/embedding_network huggingface dataset:
Performance Evaluation of the Managed Bandwidth Service with QoS Guarantees
Authors: Christos Bouras, Vaggelis Kapoulas, Dimitris Primpas
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

This paper describes a solution to extend the Managed Bandwidth Service (MBS), which is provided on a backbone network using MPLS VPNs, to non-MPLS domains and also evaluates it. It is based on the Class Based Weighted Fair Queueing mechanism (CBWFQ) [4]and describes the way it should be implemented to provide guaranteed bandwidth connections. In particular, CBWFQ can provide assured bandwidth connections when simultaneously leads to efficient bandwidth utilization. In addition, the proposed solution is being tested on simulation environment (using the Network Simulator) in order to evaluate its performance characteristics. On the simulation tests had been reserved specific amount of bandwidth for specific flows and their throughput was measured in order to understand if theproposed solution works well. Finally, the results are very well and prove that this method can guarantee bandwidth for every flow in all network conditions (congested or uncongested). At last, the paper presents a technical example of router configuration for implementing the MBS service according to the basic proposed solution.
A poor man's concurrency monad
Authors: Koen Claessen
Venue: Journal of Functional Programming (1999)

Without adding any primitives to the language, we define a concurrency monad transformer in Haskell. This allows us to add a limited form of concurrency to any existing monad. The atomic actions of the new monad are lifted actions of the underlying monad. Some extra operations, such as fork, to initiate new processes, are provided. We discuss the implementation, and use some examples to illustrate the usefulness of this construction.
PHIDEO: a silicon compiler for high speed algorithms
Authors: P. E. R. Lippens, J. L. van Meerbergen, A. van der Werf, W. F. J. Verhaegh, B. T. McSweeney, J. O. Huisken, O. P. McArdle
Venue: Proceedings of the conference on European design automation (1991)

PHIDEO is a silicon compiler targeted at the design of high performance real time systems with high sampling frequencies such as HDTV. It supports the complete design trajectory starting from a high level specification all the way down to layout. New techniques are used to perform global optimisations across loop boundaries in hierarchical flow graphs. The compiler is based on a new target architectural model. Apart from the data-paths special attention is paid to memory optimisation. The new techniques are demonstrated using a progressive scan conversion algorithm.
Still a stranger here: attitudes among secondary school students towards computer science
Authors: Phoenix Moorman, Elizabeth Johnson
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Numerous studies have examined the possible explanations for the paucity of women with computer science majors in undergraduate studies. Much of this work has focused on the undergraduate years themselves. We present results from a survey of American secondary school students in advanced mathematics and computer science classes. We conclude that both male and female students continue to see computer science as a primarily "male" field and to make their career choices accordingly. We suggest two means to combat this perception - single-sex summer workshops for secondary school girls and mother-daughter computer science clubs for elementary school girls.
A Convex Approach to Robust Stability for Linear Systems with Uncertain Scalar Parameters
Authors: Pierre-Alexandre Bliman
Venue: SIAM Journal on Control and Optimization (2003)

In this paper, robust stability for linear systems with several uncertain (complex and/or real) scalar parameters is studied. A countable family of conditions sufficient for robust stability is given, in terms of solvability of some simple linear matrix inequalities (LMIs). These conditions are of increasing precision, and it is shown conversely that robust stability implies solvability of these LMIs from a certain rank and beyond. This result constitutes an extension of the characterization by solvability of Lyapunov inequality of the asymptotic stability for usual linear systems. It is based on the search of parameter-dependent quadratic Lyapunov functions, polynomial of increasing degree in the parameters.
Emotional design
Authors: Donald A. Norman
Venue: Ubiquity (2004)

Beauty and brains, pleasure and usability go hand-in-hand in good design.
A generate and sense approach to automated music composition
Authors: Sunjung Kim, Elisabeth André
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Nobody would deny that music may evoke deep and profound emotions. In this paper, we present a perceptual music composition system that aims at the controlled manipulation of a user's emotional state. In contrast to traditional composing techniques, the single components of a composition, such as melody, harmony, rhythm and instrumentation, are selected and combined in a user-specific manner without requiring the user to continuously provide comments on the music employing input devices, such as keyboard or mouse.
On combinatorial design spaces for the configuration design of product families
Authors: Zahed Siddique, David W. Rosen
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

For typical optimization problems, the design space of interest is well defined: It is a subset of Rn, where n is the number of (continuous) variables. Constraints are often introduced to eliminate infeasible regions of this space from consideration. Many engineering design problems can be formulated as search in such a design space. For configuration design problems, however, the design space is much more difficult to define precisely, particularly when constraints are present. Configuration design spaces are discrete and combinatorial in nature, but not necessarily purely combinatorial, as certain combinations represent infeasible designs. One of our primary design objectives is to drastically reduce the effort to explore large combinatorial design spaces. We believe it is imperative to develop methods for mathematically defining design spaces for configuration design. The purpose of this paper is to outline our approach to defining configuration design spaces for engineering design, with an emphasis on the mathematics of the spaces and their combinations into larger spaces that more completely capture design requirements. Specifically, we introduce design spaces that model physical connectivity, functionality, and assemblability considerations for a representative product family, a class of coffeemakers. Then, we show how these spaces can be combined into a &ldquo;common&rdquo; product variety design space. We demonstrate how constraints can be defined and applied to these spaces so that feasible design regions can be directly modeled. Additionally, we explore the topological and combinatorial properties of these spaces. The application of this design space modeling methodology is illustrated using the coffeemaker product family.
Just What Could Possibly Go Wrong In B2B Integration?
Authors: Dean Kuo, Alan Fekete, Paul Greenfield, Julian Jang, Doug Palmer
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

One important trend in enterprise-scale IT has beenthe increasing use of business-to-business integration(B2Bi) technologies to automate business processes thatcross organisational boundaries, such as the interactionsbetween partner companies along a supply chain. It isrelatively easy to describe a pattern of interaction, orchoreography, in the case where everything proceedssmoothly. However, the abnormal cases, such as where aprocess fails or a message is lost, are much morecomplicated, and risk introducing data and processinconsistencies into computer-based systems. CurrentB2Bi technologies do not supply an infrastructure thatcan provide reliability without considerablesophistication from the architects and developers As afirst step towards guiding architects to the design of B2Bisystems that maintain consistency despite failures, thispaper describes a variety of types of failure that can arisein practice, based on a realistic e-procurement scenario.We describe these failures in terms of the different typesof state that naturally occur within the distributed system.Understanding the types of failure that need to behandled, or prevented, is essential to an architect ordeveloper who must design and write handlers for all theexceptions that can occur in their workflows.
BioSonics: sensual explorations of a complex system
Authors: Daniel Bisig
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Complex systems abound in nature and are becoming increasingly important in artificial systems. The understanding and controlling of such systems is a major challenge. This paper tries to take a fresh approach to these issues by describing an interactive art project that involves cross-modal interaction with a complex system. By combining sound and vision, the temporal and spatial dynamics of the system are conveyed simultaneously. Users can influence its dynamics in real time by using acoustics. Preliminary experiments with this system show that the combination of sound and vision can help users to obtain an intuitive understanding of the system's behavior. In addition, usability profits from the fact that the same modality is employed for both interaction and feedback.
Single damascene integration of porous ZirkonTM version 1 low-k dielectric films
Authors: S. Malhouitre, C. Jehoul, J. Van Aelst, H. Struyf, S. Brongersma, L. Carbonell, I. Vos, G. Beyer, M. Van Hove, D. Gronbeck, M. Gallagher, J. Calvert, K. Maex
Venue: Microelectronic Engineering (2003)

ZirkonTM LK2000 version 1 dielectric film (ZirkonTM is a trademark of Shipley Company L.L.C), a porous methylsilsesquioxane (MSQ)-based spin-on dielectric with a k value targeted at 2.0, has been integrated in single damascene structures. For patterning, a dual SiC/SiO2 CVD hard-mask was used. Surface treatments (DUV ozone (DUV-O3), plasma treatments) were tested to solve the adhesion issues encountered at the CVD hard-mask and the low-k interface. Adhesion is only improved when plasma treatments are used. Analyses (FTIR, TDS, nano-indentation) show that the plasma treatments only modify the low-k surface. For integration, a plasma treatment (He, NH3, N2/O2) prior to deposition of the CVD hard-mask was included. After patterning, copper metallization and CMP of the wafers, electrical evaluation shows that, compared to the reference wafer (no plasma treatment), plasma-treated wafers have a higher yield and a lower sheet resistance. The RC delay is slightly higher for the plasma-treated wafers than for the reference wafer.
Space-time coding and signal processing for MIMO communications
Authors: Inaki Berenguer, Xiaodong Wang
Venue: Journal of Computer Science and Technology (2003)

Rapid growth in mobile computing and other wireless multimedia services is inspiring many research and development activities on high-speed wireless communication systems. Main challenges in this area include the development of efficient coding and modulation signal processing techniques for improving the quality and spectral efficiency of wireless systems. The recently emerged space-time coding and signal processing techniques for wireless communication systems employing multiple transmit and receive antennas offer a powerful paradigm for meeting these challenges. This paper provides an overview on the recent development in space-time coding and signal processing techniques for multiple-input multiple-output (MIMO) communication systems. We first review the information theoretic results on the capacities of wireless systems employing multiple transmit and receive antennas. We then describe two representative categories of space-time systems, namely, the BLAST system and the space-time block coding system, both of which have been proposed for next-generation high-speed wireless system. Signal processing techniques for channel estimation and decoding in space-time systems are also discussed. Finally, some other coding and signal processing techniques for wireless systems employing multiple transmit and receive antennas that are currently under intensive research are also briefly touched upon.
Facilitating Knowledge Transfer in Organizations through Incentive Alignment and IT Investment
Authors: Shankar Sundaresan, Zuopeng Zhang
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Knowledge transfer plays a fundamental role in the success of knowledge management systems. Information technology facilitates knowledge sharing and learning. In this paper, we study the role of incentives and information systems in knowledge transfer. We incorporate both the reward and cost for knowledge sharing and learning in a modeling framework, capture the characteristics of both information system and incentives, and explore how the IT investment complements the incentives in facilitating knowledge transfer. We investigate the appropriate incentive mechanisms that can align the individual responses with the organization's optimal level of knowledge sharing and show that various organizational objectives (e.g., maximal pro.t, maximal knowledge flow, and minimal technology threshold for full sharing) can be achieved by designing different incentive schemes. We focus on the complementarity between information systems and incentives in knowledge transfer and determine the threshold level of information technology sophistication required to support full knowledge sharing.
Comparative Study Of Low Voltage OTA Designs
Authors: Deyasini Majumdar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The increased demand for Low Power/Low Voltage(LP/LV) circuits while maintaining high bandwidth anddynamic range, has led to widespread use of current-modetechniques in the design of analog circuits. Current trends incontinual scaling down of transistor gate lengths andreduction in supply voltage have further added to the designchallenges. This paper deals with the design of buildingblocks for current-mode circuit design, namely, OperationalTransconductance Amplifier (OTA). Designs of three OTAshave been discussed. These OTAs operate at supply voltagesabout 3.3V. Simulations have been carried out in Cadence(with Hspice) for Taiwan Semiconductor ManufacturingCorporation's (TSMC's) 0.35µm CMOS process. The mainaim of this paper is to present and compare new OTA designs,which have potential for use in LV applications. One of theproposed OTAs has further been fabricated and tested forreal-time application. The application addressed is that ofdesigning spectral shaping filters for use in SecondGeneration High-bit-rate Digital Subscriber Line Technology(HDSL-2). The relative performance of all the three OTAs hasalso been presented.
Capacity assignment in Bluetooth scatternets: optimal and heuristic algorithms
Authors: Gil Zussman, Adrian Segall
Venue: Mobile Networks and Applications (2004)

Bluetooth enables portable electronic devices to communicate wirelessly via short-range ad-hoc networks. Initially Bluetooth will be used as a replacement for point-to-(multi)point cables. However, in due course, there will be a need for forming multihop ad-hoc networks over Bluetooth, referred to as scatternets. This paper investigates the capacity assignment problem in Bluetooth scatternets. The problem arises primarily from the special characteristics of the network and its solution requires new protocols. We formulate it as a problem of minimizing a convex function over a convex set contained in the matching polytope. We develop an optimal algorithm which is similar to the well-known flow deviation algorithm and that calls for solving a maximum-weight matching problem at each iteration. A centralized heuristic algorithm with a relatively low complexity is also developed. Then, since in an ad-hoc network there is no central authority that is responsible for network optimization, a distributed heuristic algorithm is proposed. Finally, numerical results are presented and it is shown that the heuristic algorithms usually converge to results that are relatively close to the optimal results.
On the Choice Number of Random Hypergraphs
Authors: Van H. Vu
Venue: Combinatorics, Probability and Computing (2000)

We generalize the notion of choice number from graphs to hypergraphs and estimate the sharp order of magnitude of the choice number of random hypergraphs. It turns out that the choice number and the chromatic number of a random hypergraph have the same order of magnitude, almost surely. Our result implies an earlier bound on the chromatic number of random hypergraphs, proved by Schmidt [23] using a different method.
Flexible Software Protection Using Hardware/Software Codesign Techniques
Authors: Joseph Zambreno, Alok Choudhary, Rahul Simha, Bhagirath Narahari
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

A strong level of trust in the software running on an embedded processor is a prerequisite for its widespread deployment in any high-risk system. The expanding field of software protection attempts to address the key steps used by hackers in attacking a software system. In this paper we present an efficient and tunable approach to some problems in embedded software protection that utilizes a hardware/software codesign methodology. By coupling our protective compiler techniques with reconfigurable hardware support, we allow for a greater flexibility of placement on the security-performance spectrum than previously proposed mainly-hardware or software approaches. Results show that for most of our benchmarks, the average performance penalty of our approach is less than 20%, and that this number can be greatly improved upon with the proper utilization of compiler and architectural optimizations.
Approximation of isosurface in the marching cube: ambiguity problem
Authors: Sergey V. Matveyev
Venue: Proceedings of the conference on Visualization '94 (1994)

The purpose of the present article is the consideration of the problem of ambiguity over the faces arising in the Marching Cube algorithm. The article shows that for unambiguous choice of the sequence of the points of intersection of the isosurface with edges confining the face it is sufficient to sort them along one of the coordinates. It also presents the solution of this problem inside the cube. The graph theory methods are used to approximate the isosurface inside the cell.
Psachno: A Dynamic and Generic Discovery Framework within a Peer-to-Peer Network Model
Authors: Nicholas Nicoloudis, Christine Mingins
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

This research investigates the varying discoveryprotocols available and abstracts common elements toprovide an interoperable framework. We look into avariety of discovery domains and treating alldiscoverable items as resources. An analysis andabstraction of common elements is performed to providea structured hierarchy of discovery semantics. Differentnetwork models were investigated to derive a dynamicdiscovery interface from all terminal types includingservers, workstations and PDA's. As proof of concept, asecurity model has been implemented to provide anoptimized and secure discovery framework that willintegrate with the associated protocols' security models.This analysis motivates the design of a generic discoveryframework that provides an open interface and integrateswith existing and future discovery protocols.
On local and global independence numbers of a graph
Authors: Ralph J. Faudree, Zdeněk Ryjáček, Richard H. Schelp
Venue: Discrete Applied Mathematics (2003)

The local independence number αi(G) of a graph G at a distance i is the maximum number of independent vertices at distance i from any vertex. We study the impact of restricting αi(G) on the (global) independence number α(G). Among others, we show that in graphs with bounded diameter, α(G) is bounded if and only if αi(G) is bounded for at least one i, 2 ≤ i ≤ (diam(G) - 1)/4.
P1 Nonconforming Finite Element Multigrid Method for Radiation Transport
Authors: Kab Seok Kang
Venue: SIAM Journal on Scientific Computing (2003)

The simulation of radiation transport in the optically thick flux-limited diffusion regime is one of the most time-consuming tasks within large multiphysics simulation codes. Due to multimaterial complex geometry, the radiation transport system must often be solved on unstructured grids. This paper investigates the behavior and the benefits of the unstructured P1 nonconforming finite element multigrid method, which has proven to be flexible and effective on related transport, in solving unsteady implicit nonlinear radiation diffusion problems utilizing Newton and Picard linearization methods. We use the covolume-based intergrid transfer operators to get coarse level approximations of solution, which are used for computing coarse level operators in a multigrid method. We also study the efficiency of inexact Newton methods compared with standard Newton and Picard methods.
Giving Legs to the Legacy &mdash; Web Services Integration Within the Enterprise
Authors: J. Calladine
Venue: BT Technology Journal (2004)

Behind the hype of Web Services (WS) is the reality of a sound and functional set of technologies for integration. This paper describes how the pragmatic use of WS technology has resulted in better, cheaper and faster integration for BT in its core operational support systems (OSS) system interfaces. BT has embarked upon a programme of enabling key components and middleware layers in its customer handling stack to leverage the benefits of Web Services in addressing the challenge of real-time heterogeneous interworking. It is believed that the WS-enabling of these legacy systems has helped add years to their productive use and protected the huge investment already made in these systems. As well as giving &lsquo;legs&rsquo; to such legacy systems, Web Services support the drive to implement a service-oriented architecture inside BT and this paper investigates the ways in which this is being achieved. In order to exploit Web Services on BT's mission-critical platforms we have had to understand and work with WS issues on a wide range of platforms, proving the interoperability, performance and security of the new technologies in large-scale enterprise integration projects. Integration has been the first &lsquo;killer application&rsquo; for Web Services and this paper will describe some of the business areas that have benefited from the cleaner integration that Web Services offer.
A delay optimal coterie on the k-dimensional folded Petersen graph
Authors: P. C. Saxena, Sangita Gupta, Jagmohan Rai
Venue: Journal of Parallel and Distributed Computing (2003)

Coteries are an effective tool for enforcing mutual exclusion in distributed systems. Communication delay is an important metric to measure the performance of a coterie. The topology of the interconnection network in a distributed system also has an impact on its performance. The k-dimensional folded Petersen graph, a graph with 10k nodes and diameter 2k, qualifies as a good network topology for large distributed systems. In this paper, we present a delay optimal coterie on the k-dimensional folded Petersen graph, FPk. For any positive integer k, the coterie has message complexity 4k and delay k. Moreover, this coterie is not vote-assignable.