ppxscal/embedding_network huggingface dataset:
Why is the internet traffic bursty in short time scales?
Authors: Hao Jiang, Constantinos Dovrolis
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Internet traffic exhibits multifaceted burstiness and correlation structure over a wide span of time scales. Previous work analyzed this structure in terms of heavy-tailed session characteristics, as well as TCP timeouts and congestion avoidance, in relatively long time scales. We focus on shorter scales, typically less than 100-1000 milliseconds. Our objective is to identify the actual mechanisms that are responsible for creating bursty traffic in those scales. We show that TCP self-clocking, joint with queueing in the network, can shape the packet interarrivals of a TCP connection in a two-level ON-OFF pattern. This structure creates strong correlations and burstiness in time scales that extend up to the Round-Trip Time (RTT) of the connection. This effect is more important for bulk transfers that have a large bandwidth-delay product relative to their window size. Also, the aggregation of many flows, without rescaling their packet interarrivals, does not converge to a Poisson stream, as one might expect from classical superposition results. Instead, the burstiness in those scales can be significantly reduced by TCP pacing. In particular, we focus on the importance of the minimum pacing timer, and show that a 10-millisecond timer would be too coarse for removing short-scale traffic burstiness, while a 1-millisecond timer would be sufficient to make the traffic almost as smooth as a Poisson stream in sub-RTT scales.
An Investigation of Factors Affecting Student Group Project Outcomes
Authors: Pearl Brereton, Sue Lees
Venue: Proceedings of the 18th Conference on Software Engineering Education & Training (2005)

This paper describes an investigation of factors affecting the outcome of undergraduate student group projects. The data used relates to 2 cohorts of 2nd year students. The factors addressed are group size, the range of abilities within a group, the presence/absence of women in a group and the mix of expertise (other than in computing) within a group. Results suggest that group size is not a significant factor in determining outcome, weak students do no better when grouped with more able students (than when grouped with those of similar ability), men only groups do not perform as well as groups having women in them and outcome is independent of the range of 'other' expertise within the group.
Knowledge-Based Systems for Management Decisions by Robert J. Mockler (Prentice Hall, 1989)
Venue: ACM SIGART Bulletin (1990)

This book has a fairly specific audience, it "is intended for anyone." It is an introductory book for managers, rather than a highly technical book for computer scientists. The author has succeeded in his goal of producing an introduction to Knowledge-Based systems accessible to a broad audience. Computer scientists will find no fundamental errors and managers should find it accessible. I would characterize it as a book your customers should read.
Information coding by ensembles of resonant neurons
Authors: J. A. Villacorta, F. Panetsos
Venue: Biological Cybernetics (2005)

In the present paper, we propose a novel neural procedure for signal processing and coding based on the subthreshold oscillations and resonance of the neural membrane potential that could be used by real neurons to perform frequency spectra analysis and information coding of incoming signals. Taking into account the biophysical properties of the neural membranes, we note that the subthreshold resonant behaviour they exhibit can be used to analyse incoming signals and represent them in the frequency domain. We study the reliability of the representation of signals depending on the biophysical parameters of the neurons, the fault-tolerance of this coding scheme and its robustness against noise and in the presence of spikes. The principal characteristics of our system are the use of the physical phenomenon of neural resonance (rarely considered in the literature for signal coding); it fits well with the biophysical parameters of most neurons that exhibit subthreshold oscillations; it is compatible with experimental data; and it can be easily integrated in a more general model of information processing and coding that includes communication between neurons based on spikes.
Mathematical models governing dynamic user-driven resource allocation
Authors: Michael Massimi, Eric Tarn
Venue: Journal of Computing Sciences in Colleges (2004)

In many complex computer-driven tasks, select information is hidden from users, either on purpose or inadvertently. When this is the case, users may become frustrated because they are not alerted to the causes of delays or other malfunctions. In turn, overall efficiency of a system can decrease while users wait for the system to time out or otherwise resolve the delay. One way to minimize the ill effects of resource conflicts is to involve users in the process of determining resource allocation by providing a forum for self-governance and problem resolution.
Formalisation and implementation of Access control models
Authors: Mathieu Jaume, Charles Morisset
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies between the model and the code. In this paper, we first present a formalisation of access control models based on the work on an algebra of security models by J.McLean. Then, we describe the implementation of this framework and show how it can be used to obtain a particular security model: the Bell and La Padula security model. Last, as an example, we show how such a program can be integrated for secure databases. All our development is done within the Focal programming environment which provides a language with object-oriented features allowing to write formal specifications, proofs and programs at the same level.
Causality and virtual reality art
Authors: Marc Cavazza, Jean-Luc Lugrin, Sean Crooks, Alok Nandi, Mark Palmer, Marc Le Renard
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

In this paper, we discuss how a cognitive concept, causality, can be used for the conceptual underpinning of Virtual Reality Art installations. Causality plays an important role in our construction of reality and, as such, it makes sense to use it as a principle to define VR experiences. We have developed a VR platform using cognitive data on causal perception to create artificial event co-occurrences in virtual worlds, which can be perceived as possible outcomes for user actions. After a preliminary validation of this technology by user experiments, it has been used to implement prototypes of artistic installations by two different artists. We describe the technical approach behind the elicitation of causal perception in virtual reality, and illustrate its use through the two artistic installations being developed with this new VR platform.
There once was a whiteboard in verse...
Authors: Elizabeth Buie
Venue: interactions (2005)

Your editor of Whiteboard, E. Buie,Had a notion that sounded like hooey:"Some poems I'll solicitFrom colleagues complicit---On design, interaction, and GUI!"
Fair distributed congestion control in multirate multicast networks
Authors: Saswati Sarkar, Leandros Tassiulas
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

We study fairness of resource allocation in multirate, multicast networks. In multirate networks, different receivers of the same multicast session can receive service at different rates. We develop a mathematical framework to model the maxmin fair allocation of bandwidth with minimum and maximum rate constraints. We present a necessary and sufficient condition for a rate allocation to be maxmin fair in a multirate, multicast network. We propose a distributed algorithm for computing the maxmin fair rates allocated to various source-destination pairs. This algorithm has a low message exchange overhead, and is guaranteed to converge to the maxmin fair rates in finite time.
A Band-Weighted Landuse Classification Method for Multispectral Images
Authors: Chunhong Pan, Gang Wu, Veronique Prinet, Qing Yang, Songde Ma
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Landuse classification is an important problem in the remote sensing field. It can be used in a wide range of applications. In this paper, we propose a hybrid method fusing edges and regions information for the landuse classification of multispectral images. It mainly includes the steps of image pre-processing, initial segmentation and region merging. Especially, a novel spatial mean shift procedure is proposed so that some information can be extracted and used in the successive steps. Aiming at the multispectral images processing, we also design a band weighting strategy that give a proper weight to each band adaptively according to the region to be processed. Experimental results on the Landsat TM and ETM+ images validate the performance of the proposed method.
Target acquisition in multiscale electronic worlds
Authors: Yves Guiard, Michel Beaudouin-Lafon
Venue: International Journal of Human-Computer Studies (2004)

Since the advent of graphical user interfaces, electronic information has grown exponentially, whereas the size of screen displays has stayed almost the same. Multiscale interfaces were designed to address this mismatch, allowing users to adjust the scale at which they interact with information objects. The technology has progressed quickly and the theory has lagged behind. Multiscale interfaces pose a stimulating theoretical challenge: reformulating the classic target-acquisition problem from the physical world into an infinitely rescalable electronic world. We address this challenge by extending Fitts' original pointing paradigm: we introduce the scale variable, thus defining a multiscale pointing paradigm. This article reports on our theoretical and empirical results. We show that target-acquisition performance in a zooming interface must obey Fitts' law and, more specifically, that target-acquisition time must be proportional to the index of difficulty. Moreover, we complement Fitts' law by accounting for the effect of view size on pointing performance, showing that performance bandwidth is proportional to view size, up to a ceiling effect. Our first empirical study shows that Fitts' law does apply to a zoomable interface for indices of difficulty up to and beyond 30 bits. whereas classical Fitts' law studies have been confined in the 2-10 bit range. Our second study demonstrates a strong interaction between view size and task difficulty for multiscale pointing, and shows a surprisingly low ceiling. We conclude with implications of these findings for the design of multiscale user interfaces.
7th international workshop on economics-driven software engineering research
Authors: Kevin Sullivan
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The 7th International Workshop on Economics-Driven Software Engineering Research (EDSER-7) continues to be the leading forum for the discussion of emerging research ideas in software economics. The focus of the workshop is on the use of economic models for reasoning about technical issues and decisions in the definition, design, development, deployment, and evolution of software and software-intensive systems.
Transmission error in anti-backlash conical involute gear transmissions: a global-local FE approach
Authors: Jesper Brauer
Venue: Finite Elements in Analysis and Design (2005)

This paper reports on a theoretical study of transmission errors in anti-backlash conical involute gear transmissions. Such transmissions are used to reduce or eliminate the backlash in mechatronic products such as industrial robots and thereby improving system stability. A global-local finite-element (FE) approach reduced the total computation time needed to solve the non-linear contact problems. This approach yields a dense FE mesh in the contact regions and a coarse mesh in the rest of the teeth.
GAP Test: A Cognitive Evaluation Procedure for Shape Descriptors
Authors: Anarta Ghosh, Nicolai Petkov
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

With inspiration from psychophysical researches of the human visual system we propose a novel method for performance evaluation of contour based shape recognition algorithms. We use complete contour representations of objects as a training set. Incomplete contour representations of the same objects are used as a test set and the recognition performance of two shape based methods is investigated. The amount of incompleteness in test cases is quantified using the percentage of contour pixels retained. The performances of the methods are reported using the recognition rate as a function of the degree of incompleteness. We consider three types of incomplete contour representations, viz. segment-wise deletion, occlusion and random pixel depletion. The methods compared in this framework use shape context and distance multiset as local shape descriptors. Qualitatively, both methods mimic human visual perception in the sense that they perform best in the case of random depletion and worst in the case of occluded contours. Quantitatively, the distance multiset method performs better than the shape context method in this test framework.
Voices of women in a software engineering course: reflections on collaboration
Authors: Sarah B. Berenson, Kelli M. Slaten, Laurie Williams, Chih-Wei Ho
Venue: Journal on Educational Resources in Computing (JERIC) (2004)

Those science, mathematics, and engineering faculty who are serious about making the education they offer as available to their daughters as to their sons are, we posit, facing the prospect of dismantling a large part of its traditional pedagogical structure, along with the assumptions and practice which support it. [Seymour and Hewett 1997].Prior research indicates that female students can be concerned about the insularity of working alone for long periods of time, as they perceive to be the case with computer science and information technology careers. We studied an advanced undergraduate software engineering course at North Carolina State University to characterize the potential of collaborative learning environments created via pair-programming and agile software development to ameliorate this concern. A collective case study of three representative women in the course revealed that they held the following four themes in common: working with others; productivity; confidence; and interest in IT careers. Three conjectures concerning collaboration emerged from our study, including the importance of face-to-face meetings, an increased confidence among women based on product quality, and a reduction in the amount of time spent on assignments. While our findings are not generalized to early undergraduate courses, the young women we studied were at a critical junction in deciding whether to pursue a career in IT upon their near-term graduation. Additionally, we propose a model for future testing with both males and females that connects these three factors with an increased interest in IT careers.
Some a priori error estimates with respect to Hθ norms, 0 < θ < 1,for the h-extension of the finite element method in two dimensions
Authors: G. Tsamasphyros, S. Markolefas
Venue: Applied Numerical Mathematics (2005)

The error with respect to lower (fractional) order norms, ||*||θ, 0 < θ < 1, for the h-extension of the finite element method in 2-D, is studied and some new improved error estimates are deduced. In particular, it is shown that in polygonal domains, where the singularities dominate the regularity of the exact solution (e.g., u ∈ H1+δ-ε(Ω), ∀ε > 0, 0 < δ < 1), the optimal rate of convergence is recovered for θ > 1 - δ. Moreover, for θ ≤ 1 - δ the deduced error upper bound has the same order as the classical error estimate with respect to L2 norm (based upon the Aubin-Nitsche method). Finally, lower bound estimates of the form ||eh||θ ≥ C||eh||12, for some values of θ and positive definite unsymmetric bilinear functionals, are deduced.
Set of programs for automated digital systems design
Authors: M. Přibáñ, M. Jakl, A. Janků, P. Kunc, J. Veselý
Venue: ACM SIGDA Newsletter (1975)

Current trend of a computer development is characterized especially by large changes on a field of technology, which offers new logical solutions of a computer design. To follow that trend is necessary to use a computer equipped by appropriate problem oriented software for verifying and realizing a new design. Getting out of that fact was some years ago in the Research Institute for Mathematical Machines in Prague started a long-termed plan called "Automation of Digital Systems Design". Nowadays is realized the first part of this plan, consisting of tasks of the technical design. In the area of a logical design was created the program system for coding and testing of microprograms used for computer EC 1021 and now it is generalized for other devices. In the area of a system design we begin to use a language for the multilevel description of a computer structure, followed by programs for computer description processing and simulation. In this paper is described a set of programs for the technical design and for the design of microprograms.
An Improved Scheme for Unilateral Asymmetric Smart Card Authentication
Authors: Lanjun Dang, Weidong Kou, Yuxia Xiao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In security analyses of authentication protocols for smart cards, we usually consider two possible attacks: replay attacks and active attacks. The aims of both attacks are to try to use fake cards for successful authentication. In addition to these attacks, there are other possible attacks, the aim of which is only to let the valid cards to be unsuccessfully authenticated. These attacks are referred to as hostile attacks. The smart card authentication protocols may face a challenge of not functioning properly with the hostile attacks, the replay attacks and active attacks. In this paper, we proposed an improved authentication protocol by modifying a classic unilateral asymmetric authentication protocol to provide a strong protection to prevent the smart cards from these three kinds of attacks. The security analyses show that the improved authentication protocol is much stronger against these three kinds of attacks than the traditional protocol.
Twining: a demonstration in wearable computing
Authors: Barbara Layne, Yacov Sharir
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

Barbara Layne and Yacov Sharir will introduce their first collaborative project, Twining. The presentation will discuss wearable computing devices and the intersection of their individual research in dance/choreography and the textile arts. A demonstration of their new wearable interactive system will show how this device can affect onstage interaction and offer new communication possibilities with the audience.Wearable interactive devices are often subsumed into the personal space of the user or placed in a desired location where the performer can activate them as needed. They possess operational command systems when placed on the physical body of the user/performer and interactional constancy when used in performance: they are always on and always accessible. These devices have become an integral part and extension of the user body and operate in and around a communications "area".
Different Algorithms for Normal and Protection Paths
Authors: Rajarshi Gupta, Eric Chi, Jean Walrand
Venue: Journal of Network and Systems Management (2005)

Many network routing situations commonly require backup paths that satisfy various constraints on bandwidth, link or node selection, and ease of configuration. In this paper, we attempt to validate whether it is beneficial to have distinct algorithmic treatments of normal and backup path calculation, configuration, and maintenance. We present a modular suite of algorithms that enable us to manage normal and protection paths differently. In the process, we develop a simple extension of Minimum Interference Routing Algorithm for shared protection paths. We incorporate a distributed algorithm to separately calculate normal and backup paths in the network, using link state information, and present an evaluation of asynchronous dynamic reorganization of backup paths to reduce congestion in the network. Simulations demonstrate nontrivial quantitative reductions in blocking probabilities under certain conditions. We conclude that in order to choose an optimal algorithm for a protected QoS routing application, it is recommended to also consider a combination of two different algorithms for normal and backup paths.
Context-aware agent platform in ubiquitous environments and its verification tests
Authors: Masanori Hattori, Kenta Cho, Akihiko Ohsuga, Masao Isshiki, Shinichi Honiden
Venue: Systems and Computers in Japan (2004)

This paper deals with the &ldquo;ubiquitous personal agent,&rdquo; which distinctively provides information services to the individual user depending on his&sol;her personal contexts. This is made possible by recognition of user contexts in ubiquitous environments through an agent technology used to realize context-aware intelligent environments.This agent technology consists of a &ldquo;context reasoning agent&rdquo; and a &ldquo;lightweight intelligent mobile agent.&rdquo; The former is used for automatic recognition of various kinds of data and events which can be collected through realization of ubiquitous environments and of user &ldquo;contexts.&rdquo; The latter executes appropriate decentralization of a large variety of personalization-related processing activities between various devices and server systems existing in the ubiquitous environments. In this paper, the details of the agent technology used are discussed and its effectiveness is confirmed by evaluation in tests of agent service using home information appliances already available on the domestic market. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 13&ndash;23, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10655
Finding the search engine that works for you
Authors: Kin F. Li, Wei Yu, Shojiro Nishio, Yali Wang
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

A search engine evaluation model that considers over seventy performance and feature parameters is presented. The design of a web-based system that allows the user to tailor the model to his/her own preference, and to evaluate search engines of interest, is introduced. The results presented to the user identify the most suitable search engine that suits his/her needs.