ppxscal/embedding_network huggingface dataset:
Programming sensor networks using abstract regions
Authors: Matt Welsh, Geoff Mainland
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Wireless sensor networks are attracting increased interest for a wide range of applications, such as environmental monitoring and vehicle tracking. However, developing sensor network applications is notoriously difficult, due to extreme resource limitations of nodes, the unreliability of radio communication, and the necessity of low power operation. Our goal is to simplify application design by providing a set of programming primitives for sensor networks that abstract the details of low-level communication, data sharing, and collective operations. We present abstract regions, a family of spatial operators that capture local communication within regions of the network, which may be defined in terms of radio connectivity, geographic location, or other properties of nodes. Regions provide interfaces for identifying neighboring nodes, sharing data among neighbors, and performing efficient reductions on shared variables. In addition, abstract regions expose the trade-off between the accuracy and resource usage of communication operations. Applications can adapt to changing network conditions by tuning the energy and bandwidth usage of the underlying communication substrate. We present the implementation of abstract regions in the TinyOS programming environment, as well as results demonstrating their use for building adaptive sensor network applications.
Using student feedback to improve instruction in engineering calculus
Authors: B. M. Moskal
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The purpose of this paper is to describe and evaluate the instructional techniques that were used in a two-course sequence of engineering calculus. These techniques included a course Web site that contained solutions to exams from prior years, course notes and solutions to quizzes. Manipulatives, Mathematica and group work were also incorporated into the original design.
Wireless Bonding for Maximizing Throughput in Multi-Radio Mesh Networks
Authors: Sung-Ho Kim, Young-Bae Ko
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

To enhance the per node throughput, mesh nodes in wireless mesh networks can be equipped with multiple network interfaces (NIC). In this paper, we propose a new multi-interface equipped architecture, named "Wireless Bonding (WBond)", which enables each node to fully utilize all its available interfaces, resulting in increased throughput. The proposed WBond provides a method for exposing a single virtual interface by bonding multiple NICs. When a node needs to transfer a packet, WBond selects one among the multiple interfaces depending upon the channel quality assigned to each interface. A novel method for measuring channel quality, called as "ChanQual", is presented and used by the WBond with high accuracy and no additional overhead. Comparison studies using ns-2 simulations show that our WBond scheme can achieve the most reliable and highest performance (i.e., network throughput) compared to traditional multi-interface architectures.
Mobile Agent-Based Digital Rights Management Scheme
Authors: Bartlomiej Ziolkowski, Janusz Stoklosa
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In the paper, we introduce a mobile software agent-based scheme for digital rights management targeted for personal mobile devices . The goal of the proposed scheme is to provide a solution secure yet simple to implement and maintain for controlled consumption of digital media objects. In order to protect the digital content in transport and to prevent non-authorized use, we apply a combination of a threshold scheme, one-time password system, key agreement protocol, and clueless mobile agents. Here, every participating software agent receives a share from a dealer and only the end user is able to decrypt the DRM content after gathering all the shares. Clueless mobile agents traveling between the participants' sites do the distribution and the gathering of the shares. The proposed DRM scheme is compared to the industry-leading Open Mobile Alliance's digital rights management specification and their applicability and the differences are thoroughly discussed. Finally, we evaluate the weaknesses of the scheme and propose few variants satisfying different security requirements.
Identifiability and manifold ambiguity in DOA estimation for nonuniform linear antenna arrays
Authors: Y. I. Abramovich
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

This paper considers the direction-of-arrival (DOA) estimation identifiability problem for uncorrelated Gaussian sources and nonuniform antenna arrays. It is now known that sparse arrays always suffer from manifold ambiguity, which arises due to linear dependence amongst the columns of the array manifold matrix (the "steering vectors"). While the standard subspace DOA estimation algorithms such as MUSIC fail to provide proper unambiguous estimates under these conditions, we demonstrate that in most cases involving uncorrelated Gaussian sources, manifold ambiguity does not necessarily imply nonidentifiability. An effective manifold ambiguity resolution algorithm is introduced. A superior number of uncorrelated Gaussian sources (more than sensors) may also be unambiguously localised by sparse arrays under specified identifiability conditions. While manifold ambiguity does not apply to superior scenarios, a similar "co-array manifold ambiguity" phenomenon may compromise DOA estimation. The proposed algorithm can also resolve such ambiguity in all identifiable cases.
Computational Auditory Scene Analysis and Its Application to Robot Audition: Five Years Experience
Authors: Hiroshi G. Okuno, Tetsuya Ogata, Kazunori Komatani
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

We have been engaged in research on computational auditory scene analysis to attain sophisticated robot/computer human interaction by manipulating real-world sound signals. The objective of our research is the understanding of an arbitrary sound mixture including non-speech sounds and music as well as voiced speech, obtained by robot's ears, that is, microphones embedded in the robot. We have coped with three main issues in computational auditory scene analysis, that is, sound source localization, separation, and recognition of separated sounds for a mixture of speech signals as well as polyphonic music signals. This paper overviews our results in robot audition, in particular, Missing Feature Theory based integration of sound source separation and automatic speech recognition, and those in music information processing, in particular, drum sound equalizer.
Encryption-enforced access control in dynamic multi-domain publish/subscribe networks
Authors: Lauri I. W. Pesonen, David M. Eyers, Jean Bacon
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Publish/subscribe systems provide an efficient, event-based, wide-area distributed communications infrastructure. Large scale publish/subscribe systems are likely to employ components of the event transport network owned by cooperating, but independent organisations. As the number of participants in the network increases, security becomes an increasing concern. This paper extends previous work to present and evaluate a secure multi-domain publish/subscribe infrastructure that supports and enforces fine-grained access control over the individual attributes of event types. Key refresh allows us to ensure forward and backward security when event brokers join and leave the network. We demonstrate that the time and space overheads can be minimised by careful consideration of encryption techniques, and by the use of caching to decrease unnecessary decryptions. We show that our approach has a smaller overall communication overhead than existing approaches for achieving the same degree of control over security in publish/subscribe networks.
Local Bigraphs and Confluence: Two Conjectures
Authors: Robin Milner
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The notion of confluence is studied on the context of bigraphs. Confluence will be important in modelling real-world systems, both natural (as in biology) and artificial (as in pervasive computing). The paper uses bigraphs in which names have multiple locality; this enables a formulation of the lambda calculus with explicit substitutions. The paper reports work in progress, seeking conditions on a bigraphical reactive system that are sufficient to ensure confluence; the conditions must deal with the way that bigraphical redexes can be intricately intertwined. The conditions should also be satisfied by the lambda calculus. After discussion of these issues, two conjectures are put forward.
Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF
Authors: Lamine BOUGUEROUA, Laurent GEORGE, Serge MIDONNET
Venue: Proceedings of the Second International Conference on Systems (2007)

This paper presents a mechanism for execution-overrun management in preemptive real-time systems composed of sporadic tasks. We consider faults due to Worst Case Execution Time violations. Based on fault prevention, we determine the allowance of a task defined as the maximum extra duration that can be granted to a faulty task without compromising the timeliness constraints of the tasks. We propose a solution to implement the allowance principle that we call the Latest Execution Time (LET), defined for a task as the latest absolute time a faulty task can proceed with its execution without compromising the real-time constraints of all the tasks in the system. This mechanism enables to cope with execution overruns before a deadline miss and is not based on execution overruns handlers. We show how to determine the LET based on existing real-time feasibility conditions for Fixed Priority (FP) and Earliest Deadline First (EDF) schedulings. We compare the performances of the LET mechanism with FP and EDF scheduling to classical execution overrun management solutions.
A joint scheduling, power control, and routing algorithm for ad hoc wireless networks
Authors: Yun Li, Anthony Ephremides
Venue: Ad Hoc Networks (2007)

In wireless networks there is strong coupling among the traditional layers of the architecture, and these interactions cannot be ignored. One example is the interaction between routing in the network layer and access control in the MAC layer. Another one is the coupling between power control in the physical layer and scheduling in the MAC layer. In this paper, we assume a TDMA-based wireless ad hoc network and provide a centralized algorithm of joint power control, scheduling, and routing. Simulation results show the improvement of the network performance, in terms of throughput, delay, and power consumption, through use of the joint algorithm. Energy efficiency is another important aspect of ad hoc networking, and is considered in our algorithm. Our simulation also shows the trade-off between energy consumption and network throughput or delay performance.
Context-Sensitive Service Discovery Meets Information Retrieval
Authors: Julia Kuck, Melanie Gnasa
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

With the emergence of mobile devices, Web Services are made available for users in nearly all situations of every day life. While the WWW offers a multitude of Web Services there is a lack of search engines which support the users in finding adequate services out of the bulk of available Web Services. Within this paper, we will introduce a context-sensitive approach for effective Web Service discovery. As a huge amount of context information could be gathered by the use of mobile devices, this approach is especially directed towards users of these mobile devices. Examples for context information are the actual visited place, the actual temperature, the recent illumination, etc. Also communities of users who share common contexts, interests and service needs arise. While existing systems for Web Service discovery generally do not consider context and community information of their users, we will focus on these topics, taking advantage of an novel adaption of information retrieval techniques.
Kernel-based Algorithms and Visualization for Interval Data Mining
Authors: Thanh-Nghi Do, Francois Poulet
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Our investigation aims at extending kernel methods to interval data mining and using graphical methods to explain the obtained results. Interval data type can be a good way to aggregate large datasets into smaller ones or to represent data with uncertainty. No algorithmic changes are required from the usual case of continuous data other than the modification of the Radial Basis Kernel Function evaluation. Thus, kernel-based algorithms can deal easily with interval data. The numerical test results with real and artificial datasets show that the proposed methods have given promising performance. We also use interactive graphical decision tree algorithms and visualization techniques to give an insight into support vector machines results. The user has a better understanding of the models' behaviour.
Performative roles of materiality for collective creativity
Authors: Giulio Jacucci, Ina Wagner
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This paper seeks to develop a better understanding of the contribution of materiality for creativity in collaborative settings, exploring the ways in which it provides resources for persuasive, narrative and experiential interactions. Based on extensive field studies of architectural design workplaces and on examples from art works, we show: how the variety of material features expands communicative resources and provide border resources for action, in their peripheral, evocative, and referential function; how spatiality supports the public availability of artefacts as well as people's direct, bodily engagement with materiality; and finally how materiality is part of performative action, looking at temporal frames of relevance and emergence in specific events. We conclude with implications for the development of novel interface technologies.
A novel frequency-domain frame synchronization algorithm for digital communication systems
Authors: Y. Wang, Y. L. Guan, T. T. Lie
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A novel frequency-domain frame synchronization algorithm based on phase-only FFT operation is proposed and studied. Compared to the conventional time-domain approach based on sliding correlation detection, the proposed phase-only FFT algorithm is shown to be capable of achieving considerable performance advantage in channels with linear phase variation, as well as in Rayleigh fading channels. In addition, it is also shown to enjoy significantly lower computational complexity.
Noise model adaptation in model based speech enhancement
Authors: B. L. McKinley
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper presents a noise model adaptation algorithm for model based speech enhancement (MBSE). Noise model adaptation is essential for proper operation of MBSE in non-stationary noise environments. The proposed algorithm updates the model to reflect changes in the amplitude, spectral shape and sources of the noise. Noise model codewords are selected for retraining based on a distance measure from noise-only input vectors, and a new centroid is formed based on a moving-average window length which determines the adaptation characteristics. An efficient algorithm for updating the probability structure of the noise model is presented. The adaptation algorithm is evaluated and shown to improve the performance of minimum mean-square error MBSE against actual non-stationary noise environments.
Cluster Organization based Design of Hybrid MAC Protocol in Wireless Sensor Networks
Authors: Mustafa Shakir, Irfan Ahmed, Mugen Peng, Wenbo Wang
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Wireless sensor networks have the limitations of energy. An efficient MAC protocol has to be applied to serve the purpose of energy saving and also aiming to make it cost efficient. This paper presents a novel hybrid MAC protocol that uses the information of clusters from routing layer to divide the MAC layer functionality into two types, namely, TDMA based intra-cluster communication and CSMA based inter-cluster communication. A distinctive feature of this approach is its robustness to synchronization errors and the associated power consumptions and delay performances are also computed resulting due to optimized performance of the hybrid mode for cluster organization. Simulation results show that this hybrid MAC layer thus considerably reduces the energy consumption in network nodes thereby increasing the total network lifetime.
Weak Probabilistic Anonymity
Authors: Yuxin Deng, Catuscia Palamidessi, Jun Pang
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be described probabilistically. In this paper we propose a notion of weak probabilistic anonymity, where weak refers to the fact that some amount of probabilistic information may be revealed by the protocol. This information can be used by an observer to infer the likeliness that the action has been performed by a certain user. The aim of this work is to study the degree of anonymity that the protocol can still ensure, despite the leakage of information. We illustrate our ideas by using the example of the dining cryptographers with biased coins. We consider both the cases of nondeterministic and probabilistic users. Correspondingly, we propose two notions of weak anonymity and we investigate their respective dependencies on the biased factor of the coins.
Formal meaning of coverage metrics in simulation-based hardware design verification
Authors: I. Ugarte, P. Sanchez
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

As the latest version of the International Technology Roadmap for Semiconductors highlights, verification has become the dominant cost of the electronic system design process. Although advances in formal methods have improved some aspects of the task, software simulation remains the primary method of functional verification. Traditionally, heuristic coverage metrics have been used to evaluate the simulation-based validation process and the development of coverage-driven random-based test bench generation techniques is allowing the automation of the functional verification process. This coverage-based approach has a very serious disadvantage: the metrics have no formal meaning and so there is no direct correlation between classes of bugs and coverage metrics. The main goal of this paper is to explore methods that provide a formal meaning to coverage metrics with random test benches. They are independent of a particular fault or bug model. The methods are based on polynomial models of the system under verification and they can evaluate data and control statements.
Hierarchical Nonlinear Approximation for Experimental Design and Statistical Data Fitting
Authors: Daniel Busby, Chris L. Farmer, Armin Iske
Venue: SIAM Journal on Scientific Computing (2007)

This paper proposes a hierarchical nonlinear approximation scheme for scalar-valued multivariate functions, where the main objective is to obtain an accurate approximation with using only very few function evaluations. To this end, our iterative method combines at any refinement step the selection of suitable evaluation points with kriging, a standard method for statistical data analysis. Particular improvements over previous nonhierarchical methods are mainly concerning the construction of new evaluation points at run time. In this construction process, referred to as experimental design, a flexible two-stage method is employed, where adaptive domain refinement is combined with sequential experimental design. The hierarchical method is applied to statistical data analysis, where the data is generated by a very complex and computationally expensive computer model, called a simulator. In this application, a fast and accurate statistical approximation, called an emulator, is required as a cheap surrogate of the expensive simulator. The construction of the emulator relies on computer experiments using a very small set of carefully selected input configurations for the simulator runs. The hierarchical method proposed in this paper is, for various analyzed models from reservoir forecasting, more efficient than existing standard methods. This is supported by numerical results, which show that our hierarchical method is, at comparable computational costs, up to ten times more accurate than traditional nonhierarchical methods, as utilized in commercial software relying on the response surface methodology (RSM).
Design as traversal and consequences: an exploration tool for experimental designs
Authors: Christopher G. Jennings, Arthur E. Kirkpatrick
Venue: Proceedings of Graphics Interface 2007 (2007)

We present a design space explorer for the space of experimental designs. For many design problems, design decisions are determined by the consequences of the design rather than its elemental parts. To support this need, the explorer is constructed to make the designer aware of design-level options, provide a structured context for design, and provide feedback on the consequences of design decisions. We argue that this approach encourages the designer to consider a wider variety of designs, which will lead to more effective designs overall. In a qualitative study, experiment designers using the explorer were found to consider a wider variety of designs and more designs overall than they reported considering in their normal practice.
An in-depth case study of art-technology collaboration
Authors: Yun Zhang, Linda Candy
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This paper presents an in-depth case study of the collaborative process of a creative art-technology project. We begin by providing a brief description of art-technology collaboration research and go on to describe the particular art-technology collaboration project called "GEO Narrative Landscapes". This is followed by an account of a novel method for the analysis of the interaction between artists and technologists based on five communication modes. Findings include common types of conversation topics of communication modes, how these modes related to each other and how they were distributed in terms of frequencies and duration across meetings. Finally, we discuss the contribution of this work to our understanding of art-technology collaboration.