ppxscal/embedding_network huggingface dataset:
The Cooperative Work of Gaming: Orchestrating a Mobile SMS Game
Authors: Andy Crabtree, Steve Benford, Mauricio Capra, Martin Flintham, Adam Drozd, Nick Tandavanitj, Matt Adams, Ju Row Farr
Venue: Computer Supported Cooperative Work (2007)

This paper focuses on orchestration work in the first iteration of a mobile game called Day Of The Figurines, which explores the potential to exploit text messaging as a means of creating an engaging gaming experience. By focusing on orchestration we are especially concerned with the `cooperative work that makes the game work'. While the assemblage or family of orchestration practices uncovered by our ethnographic study are specific to the game --- including the ways in which behind the scenes staff make sense of messages, craft appropriate responses, and manage and track the production of gameplay narratives as the game unfolds --- orchestration work is of general significance to our understanding of new gaming experiences. The focus on orchestration work reveals that behind the scenes staff are co-producers of the game and that the playing of games is, therefore, inseparably intertwined with their orchestration. Furthermore, orchestration work is `ordinary' work that relies upon the taken for granted skills and competences of behind the scenes staff; `operators' and `authors' in this case. While we remain focused on the specifics of this game, explication of the ordinary work of orchestration highlights challenges and opportunities for the continued development of gaming experiences more generally. Indeed, understanding the specificities of orchestration work might be said to be a key ingredient of future development.
Aggressive prefetching: an idea whose time has come
Authors: Athanasios E. Papathanasiou, Michael L. Scott
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

I/O prefetching serves to hide the latency of slow peripheral devices. Traditional OS-level prefetching strategies have tended to be conservative, fetching only those data that are very likely to be needed according to some simple heuristic, and only just in time for them to arrive before the first access. More aggressive policies, which might speculate more about which data to fetch, or fetch them earlier in time, have typically not been considered a prudent use of computational, memory, or bandwidth resources. We argue, however, that technological trends and emerging system design goals have dramatically reduced the potential costs and dramatically increased the potential benefits of highly aggressive prefetching policies. We propose that memory management be redesigned to embrace such policies.
Path Computation for Incoming Interface Multipath Routing
Authors: Merindol Pascal, Pansiot Jean-Jacques, Cateloin Stephane
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS extension: ECMP). If we want to use the underlying physical network with multipath routing efficiently, the loopfreeness of the used paths has to be guaranteed especially with distributed computation. Indeed different types of traffic engineering with source computation like OMP-MPLS or MATE-MPLS do not have to pay attention to loops. However the positioned paths, with CR-LDP or RSVP-TE for example, are not flexible enough to support strong load oscillations. Load balancing is only possible on the ingress node which labels the different paths (with a hash function to avoid packet mis-ordering for TCP traffic) even though the congestion spot can be very far from the ingress node. This is why distributed techniques can react more quickly to prevent congestion when possible. But such techniques do not generate enough paths in poorly connected topologies in so far as the loopfreeness condition employed (equal cost path, Loop Free Alternate or Loop Free Invariant) is stricter than necessary. In this article, we propose a multipath routing scheme able to compute more loopfree paths (with a low complexity algorithm such as Dijkstra in the worst case and a light communication protocol between directly adjacent nodes) than with existing propositions.
EDDS: An Efficient Data Delivery Scheme for Address-Free Wireless Sensor Networks
Authors: Weiwei Fang, Yi Liu, Depei Qian
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Addressing plays an important role in traditional networks but incurs much overhead for resource-constrained Wireless Sensor Networks (WSNs).Therefore, address-free sensor network has been proposed by researchers. However, current data delivery schemes are mainly proposed for address-based sensor networks and can't be directly applied to the new architecture. In this paper, we propose an Efficient Data Delivery Scheme (EDDS) for address-free wireless sensor networks, in which data source nodes randomly select a probabilistically unique identifier for each data flow instead of statically assigned node addresses. The packet forwarding mechanism in EDDS combines the tasks of routing and MAC layer via cross-layer design, which simplifies the protocol stack while maintaining the necessary functionality. EDDS can also efficiently handle the changes of the network, such as node death and replenishment. Through analysis and simulations, we evaluate the performance of the proposed scheme and compare it with some previous work.
Block-recursive, multirate filterbanks with arbitrary time-frequency plane tiling
Authors: U. K. Laine
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

A new method to realize arbitrary time-frequency plane tilings together with critical sampling in block-recursive filterbanks is presented. The method leads to pole-zero approximation of the target channel transfer functions. Perfect reconstruction within the limits of the approximation error can be achieved.
Joint spatial and temporal delta-sigma modulation for wideband antenna arrays and video halftoning
Authors: D. P. Scholnik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Extending an existing architecture for delta-sigma conversion of vector inputs, we suggest spectrally shaping quantization noise jointly in the temporal and spatial frequency domains with delta-sigma modulation, and we examine the application of the idea to wideband antenna or acoustic arrays and to halftoning of video imagery.
A Built-in Self-test and Diagnosis Strategy for Chemically Assembled Electronic Nanotechnology
Authors: Jason G. Brown, R. D. Blanton
Venue: Journal of Electronic Testing: Theory and Applications (2007)

Chemically assembled electronic nanotechnology (CAEN) is under intense investigation as a possible alternative or complement to CMOS-based computing. CAEN is a form of molecular electronics that uses directed self-assembly and self-alignment to construct electronic circuits from nanometer-scale devices that exploit quantum-mechanical effects. Although expected to have densities greater than 108 gate-equivalents/cm2, CAEN-based systems may possibly exhibit defect densities of up to 10%. The highly defective CAEN circuits will therefore require a completely new approach to manufacturing computational devices. In order to achieve any level of significant yield, it will no longer be possible to discard a device once a defect is found. Instead, a method of using defective chips must be devised. A testing strategy is developed for chemically assembled electronic nanotechnology (CAEN) that takes advantage of reconfigurability to achieve 100% fault coverage and nearly 100% diagnostic accuracy. This strategy is particularly suited for regular architectures with high defect densities.
Sequential equivalence checking based on k-th invariants and circuit SAT solving
Authors: Feng Lu, K.-T. Cheng
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

In this paper, we first present the concept of the k-th invariant. In contrast to the traditional invariants that hold for all cycles, k-th invariants guarantee to hold only after the k-th cycle from the initial state. We then present a bounded model checker BMChecker and an invariant prover IProver, both of which are based on circuit SAT techniques. Jointly, BMChecker and IProver are used to compute the k-th invariants, and are further integrated with a sequential SAT solver for checking sequential equivalence. Experimental results demonstrate that the sequential equivalence checking framework can efficiently verify large industrial designs.
High Level Synthesis of Degradable ASICs Using Virtual Binding
Authors: N. Honarmand, A. Shahabi, H. Sohofi, M. Abbaspour, Z. Navabi
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

As the complexity of the integrated circuits increases, they become more susceptible to manufacturing faults, decreasing the total process yield. Thus, it would be desirable to develop techniques for reusing faulty dies, even with a degraded performance. In this paper, a new method for high level synthesis of degradable ASICs is presented. Our technique introduces the concept of Virtual Binding. In this approach, the operations are bound to virtual components that are linked with actual non-faulty components using a set of configuration multiplexers and flip-flops embedded in the data-path. Using virtual components simplifies the synthesis algorithm and decreases the size of generated control unit. Virtual-to-physical mapping of the components will be established by programming the configuration flip-flops after diagnosing the faulty components. The experimental results show that the area and delay overhead of the resulting circuits have acceptable values compared to the original, non-degradable circuits.
Limitations of VCG-based mechanisms
Authors: Shahar Dobzinski, Noam Nisan
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We consider computationally-efficient incentive-compatiblemechanisms that use the VCG payment scheme, and study how well theycan approximate the social welfare in auction settings. We present anovel technique for setting lower bounds on the approximation ratioof this type of mechanisms. Specifically, for combinatorial auctionsamong submodular (and thus also subadditive) bidders we prove an Ω(m1/6) lower bound, which is close to the knownupper bound of O(m1/2), and qualitatively higher than theconstant factor approximation possible from a purely computationalpoint of view.
Simulation of coupled transmission lines by multidimensional wave digital filters
Authors: H. Krauss
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The application of multidimensional wave digital filters to the numerical solution of partial differential equations (PDEs) has been described in several publications for various physical problems under investigation. It has been shown how linear boundary conditions imposed on the PDEs can be incorporated into the resulting discrete algorithms. This was done for a transmission line of finite extent, which was terminated by lumped element circuits at both ends, as the physical system to be simulated. A generalization of this approach is presented showing how uniform coupled transmission lines with lumped circuit terminations can be treated as well. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Very fast containment of scanning worms
Authors: Nicholas Weaver, Stuart Staniford, Vern Paxson
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

Computer worms - malicious, self-propagating programs - represent a significant threat to large networks. One possible defense, containment, seeks to limit a worm's spread by isolating it in a small subsection of the network. In this work we develop containment algorithms suitable for deployment in high-speed, low-cost network hardware. We show that these techniques can stop a scanning host after fewer than 10 scans with a very low false-positive rate. We also augment this approach by devising mechanisms for cooperation that enable multiple containment devices to more effectively detect and respond to an emerging infection. Finally, we discuss ways that a worm can attempt to bypass containment techniques in general, and ours in particular.
Careers decisions in computer technology fields: influences, barriers, and gender issues
Authors: Lynna Ausburn
Venue:  (2006)

Scope and method of study. The study used survey methodology and was descriptive and was quantitative in approach. Descriptive statistics and graphic presentation were used to analyze data obtained from an online survey by 424 students attending Oklahoma's CareerTech Technology Centers to determine influences and barriers on career decisions. The 60-item online survey yielded information about demographics, exposure to technology, and personal influences on career choice decisions. Students attending computer technology programs were compared to students attaching non technology programs to determine similarities and differences. Female and male students were compared to identify areas of gender variances in career influences and decisions. Analysis of these differences produced information to enhance creation of a new career decision model for career counseling to develop further methods of recruiting students, including female students, into computer technology programs. Findings and conclusions. Although literature reports that negative images of technology professionals, derogatory comments about technology, and perceived working conditions have a negative influence on selecting technology careers, these were not important factors in this study. Also, gender discrimination did not appear to have an influence in avoiding or selecting technology careers as indicated in current research. Counselors and technology teachers at the high school level were extremely positive and influential in selecting a career. All groups were positively influence by family and friends. Previous usage of technology in school and at home did not appear to influence decisions when selecting a career, but opportunities to use and learn new technologies did appear to influence career decisions. Lack of these opportunities may be a barrier to choosing a computer technology career. The females were older than the males and had more opportunities to use and learn technology, which may have been instrumental in their career choices. Computer technology programs were represented by more females than males in this study. The computer technology students were more comfortable, supportive, positive, and impressed with computers than the non-technology students, which may have been factors for selecting or not selecting technology careers. A career model was developed to identify influences and barriers for males and females at the CareerTech level. The new model, Moody's Model, was designed by integrating the findings from this study and research to assist students interested in attending a CareerTech program to comprehend the influences and barriers affecting career decisions.
Symmetric-embedding prediction of the CATS benchmark
Authors: P. F. Verdes, P. M. Granitto, M. I. Széliga, A. Rébola, H. A. Ceccatto
Venue: Neurocomputing (2007)

We present a general strategy for filling the missing data of the CATS benchmark time series prediction competition. Our approach builds upon a time-symmetric embedding of this time series and the use of a one-shot forecasting for each missing value inside the gaps from distant-enough delayed and forwarded predictors. In the extrapolation region we perform standard, non-iterated forward predictions. For modeling purposes we consider bagging of multi-layer perceptrons (MLPs). We discuss two different implementations of this strategy: The first one is based on a simultaneous modeling of both large- and short-scale dynamics information, using (suitably delayed and forwarded) original CATS values and their first differences as inputs to MLPs. The second one follows a two-stage strategy, in which behaviors at different scales are modeled separately. First, the overall behavior at large scales is fitted with a smooth curve obtained by repeated application of a Savitzky-Golay filter. Then, the remaining short-scale variability is approximated using bagged MLPs. Expected error levels for these two implementations are provided according to performance on test data.
Toward Agent-Based Microsimulation--Another Approach
Authors: Istvan Molnar, Imre Sinka
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper describes the use of agent-based modeling in large, generalized data systems for microsimulation studies. First, authors present the relevant characteristics of the microsimulation application field, where agent-based models can be developed, and examine some of the salient problems and opportunities. After a short analysis of a specific meta-database, Web-service technologies, agent-based modeling techniques are discussed. Authors show how selected technologies can be applied to support agent-based, dynamic microsimulation model development. Finally, references are made to the practical use and an example is presented. The paper concludes with a summary of research results and future plans.
The issue of phase in specular multipath parameter estimation
Authors: Z. I. Mitrovski
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Phase differences between multipath reflections come from properties inherent to every multipath channel and they produce problems in previously introduced multipath parameter (delay, Doppler shift and amplitude) estimators. Ways of overcoming these problems are suggested, and the phase is considered as a parameter to be estimated, as well. Phase estimates are important if multipath components are to be eliminated, or recombined with the direct signal. Cramer-Rao bounds for the estimates of one-path channel parameters (with and without phase) are derived, and final expressions are discussed in light of the influence of phase.
Adaptive fuzzy control for a class of uncertain nonaffine nonlinear systems
Authors: Yan-Jun Liu, Wei Wang
Venue: Information Sciences: an International Journal (2007)

An adaptive fuzzy control approach is proposed for a class of multiple-input-multiple-output (MIMO) nonlinear systems with completely unknown nonaffine functions. The MIMO systems are composed of n subsystems and each of subsystems is in the nested lower triangular form. It is difficult and complicated to control this class of systems due to the existence of unknown nonaffine functions and the couplings among the nested subsystems. This difficulty is overcome by introducing some special type Lyapunov functions and taking advantage of the mean-value theorem, the backstepping design method and the approximation property of the fuzzy systems. The proposed control approach can guarantee that all the signals in the closed-loop system are bounded. A simulation experiment is utilized to verify the feasibility of the proposed approach.
Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
Authors: Zdene&caron;k Dosta´l, David Hora´k
Venue: SIAM Journal on Numerical Analysis (2007)

The FETI method with a natural coarse grid is combined with recently proposed optimal algorithms for the solution of bound and/or equality constrained quadratic programming problems in order to develop a scalable solver for elliptic boundary variational inequalities such as those describing equilibrium of a system of bodies in mutual contact. A discretized model problem is first reduced by the duality theory of convex optimization to the quadratic programming problem with bound and equality constraints. The latter is then modified by means of orthogonal projectors to the natural coarse grid introduced by Farhat, Mandel, and Roux [Comput. Methods Appl. Mech. Engrg., 115 (1994), pp. 365-385]. Finally, the classical results on linear scalability for linear problems are extended to boundary variational inequalities. The results are validated by numerical experiments. The experiments also confirm that the algorithm enjoys the same parallel scalability as its linear counterpart.
AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems
Authors: Ramses Morales, Indranil Gupta
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

This paper addresses the problem of selection and discovery of a consistent availability monitoring overlay for computer hosts in a large-scale distributed application, where hosts may be selfish or colluding. We motivate six significant goals for the problem - consistency, verifiability, and randomness, in selecting the availability monitors of nodes, as well as discoverability, load-balancing, and scalability in finding these monitors. We then present a new system, called AVMON, that is the first to satisfy these six requirements. The core algorithmic contribution of this paper is a protocol for discovering the availability monitoring overlay in a scalable and efficient manner, given any arbitrary monitor selection scheme that is consistent and verifiable. We mathematically analyze the performance of AVMON's discovery protocols, and derive an optimal variant that minimizes memory, bandwidth, computation, and discovery time of monitors. Our experimental evaluations of AVMON use three types of availability traces - synthetic, from PlanetLab, and from a peer-to-peer system (Overnet) - and demonstrate that AVMON works well in a variety of distributed systems.
A new class of test functions for global optimization
Authors: Bernardetta Addis, Marco Locatelli
Venue: Journal of Global Optimization (2007)

In this paper we propose a new class of test functions for unconstrained global optimization problems. The class depends on some parameters through which the difficulty of the test problems can be controlled. As a basis for future comparison, we propose a selected set of these functions, with increasing difficulty, and some computational experiments with two simple global optimization algorithms.
Architecture and Clock Programmable Baseband of an 800 MHz-6 GHz Software-Defined Wireless Receiver
Authors: R. Bagheri, A. Mirzaei, S. Chehrazi, A. A. Abidi
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

A software-defined radio receiver is designed from a low power ADC perspective, exploiting programmability of windowed integration sampler and clock-programmable discrete-time analog filters. To cover the major frequency bands in today use a wideband RF front-end, including the low noise amplifier and a wide tuning-range synthesizer, spanning over 800 MHz-6 GHz is designed. The entire receiver circuits are implemented in 90 nm CMOS technology. Programmability of the receiver is tested for GSM and 802.11g standards.