ppxscal/embedding_network huggingface dataset:
Group-Based Mobile Messaging in Support of the Social Side of Leisure
Authors: Scott Counts
Venue: Computer Supported Cooperative Work (2007)

Communication on mobile devices plays an important role in people's use of technology for leisure, but to date this communication has largely been one-to-one. Mobile internet connectivity can support a variety of group-based messaging and media sharing scenarios. Switching to group-based messaging should enhance the social and leisure aspects of the communication, but in what ways and to what extent? An experimental system for text and photo messaging on mobile devices was tested in a research deployment to four groups of 6---8 participants who used both a group-based and one-to-one version of the system. Results highlight a significant increase in message sending, in mobile device "fun", and in the social qualities of mobile communication when messaging group-wide, along with a few minor costs. Qualitative feedback provides further explanation of the social benefits.
HLA-Based Network Simulation for Interactive Communication System
Authors: Fan Zhang, Benxiong Huang
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper presents the idea of modeling transparent network simulations to realize the communication system by using interactive network simulation technology. An interactive network simulation can be built based on High Level Architecture (HLA). With the "software bus" Run time infrastructure (RTI), users could operate the discrete-event- driven simulators while simulation is running. In these cases, users may not even distinguish themselves in a simulation environment. With HLA, we could conquer the shortcoming that the traditional discrete-event- driven simulation software could only simulate network models with fixed or simple random parameters, and therefore maximize the similarity between the simulation and the real networks.
Variational iteration method-Some recent results and new interpretations
Authors: Ji-Huan He
Venue: Journal of Computational and Applied Mathematics (2007)

This paper is an elementary introduction to the concepts of variational iteration method. First, the main concepts in variational iteration method, such as general Lagrange multiplier, restricted variation, correction functional, are explained heuristically. Subsequently, the solution procedure is systematically addressed, in particular, for nonlinear oscillators. Particular attention is paid throughout the paper to give an intuitive grasp for the method. The main motivation is to put things together in a convenient form for later reference and systematic use.
A Crypto-Based Approach to Privacy-Preserving Collaborative Data Mining
Authors: Justin Zhan, Stan Matwin
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

To conduct data mining, we often need to collect data from various parties. Privacy concerns may prevent the parties from directly sharing the data and some types of information about the data. How multiple parties collaboratively conduct data mining without breaching data privacy presents a challenge. In this paper, we propose a formal definition of privacy, develop a solution for privacy-preserving k-nearest neighbor classification which is one of data mining tasks, and show that our solution preserves data privacy according to our definition.
Optimizing a priority-discipline queueing model using fuzzy set theory
Authors: María José Pardo, David de la Fuente
Venue: Computers Mathematics with Applications (2007)

The aim of this paper is to provide a more realistic description of priority-discipline queueing models by using Fuzzy Set Theory. It develops and optimizes two fuzzy queueing models with priority-discipline, a model with nonpreemptive priorities system and a model with preemptive priorities system, denoted by M@?"i/M@?"i/1 and M@?"i/F"i/1. The first symbol is for a queueing system where arrivals and services from a single server follow a Poisson process with fuzzy parameter and the last symbol is for a queueing model with arrivals follows a Poisson process with fuzzy rate and fuzzy deterministic service rate. Zadeh's extension principle is the basic approach to this research into fuzzy stochastic processes. Our results are the basis for a discussion of optimal selection of priority-discipline. Two fuzzy queueing systems that are commonly found in real situations are solved, and serve as examples that highlight the validity of the procedure we propose. Fuzzy queueing models are more realistic than the crisp queues that are commonly used in reality. Furthermore, extending queueing models to the fuzzy environment widens their scope of application.
Applying MDE Methodologies to Design Communication Protocols for Distributed Systems
Authors: Jesus Martinez, Pedro Merino, Alberto Salmeron
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Traditionally, protocol engineers have to deal with the design and implementation of complex network services, spending considerable time and effort on creating robust and reliable final source code. Although approaches exist to assist engineers in the development of communication protocols which use several object-oriented frameworks, these do not benefit from new modelling guidelines developed in MDE and UML to exploit automatic code generation from graphical models. This paper introduces a new UML2 Profile for Communications which guides the construction of software for communications following the Client-Server architecture. The MDE process is then used to design suitable platform-specific models for the well-known Adaptive Communications Environment (ACE), a high performance C++ toolkit for implementing concurrent and network applications which relies heavily on architectural patterns.
Fault-tolerant solutions for a MPI compute intensive application
Authors: J. C. Mourino, M. J. Martin, P. Gonzalez, R. Doallo
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

The running times of large-scale computational science and engineering parallel applications, executed on clusters or Grid platforms, are usually longer than the mean-time between-failures (MTBF). Hardware failures must be tolerated by the parallel applications to ensure that no all computation done is lost on machine failures. Checkpointing and rollback recovery is a very useful technique to implement fault-tolerant applications. Although extensive research has been carried out in this field, there are few available tools to help parallel programmers to enhace with fault tolerant capability their applications. This work presents two different approaches to endow with fault tolerance the MPI version of an air quality simulation. A segment--evel solution has been implemented by means of the extension of a checkpointing library for sequential codes. A variable level solution has been implemented manually in the code. The main differences between both approaches are portability, transparency-level and checkpointing overheads. Experimental results comparing both strategies on a cluster of PCs are shown in the paper.
CANS: composable, adaptive network services infrastructure
Authors: Xiaodong Fu, Weisong Shi, Anatoly Akkerman, Vijay Karamcheti
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

Ubiquitous access to sophisticated internet services from diverse end devices across heterogeneous networks requires the injection of additional functionality into the network to handle protocol conversion, data transcoding, and in general bridge disparate network portions. Several researchers have proposed infrastructures for injecting such functionality; however, many challenges remain before these can be widely deployed. CANS is an application-level infrastructure for injecting application-specific components into the network that focuses on three such challenges: (a) efficient and dynamic composition of individual components; (b) distributed adaptation of injected components in response to system conditions; and (c) support for legacy applications and services. The CANS network view comprises applications, stateful services, and data paths built from mobile soft-state objects called drivers. Both services and data paths can be dynamically created and reconfigured: a planning and event propagation model assists in distributed adaptation, and a flexible type-based composition model dictates how new services and drivers are integrated with existing components. Legacy components plug into CANS using an interception layer that virtualizes network bindings and a delegation model. This paper describes the CANS architecture, and a case study involving a shrink-wrapped client application in a dynamically changing network environment where CANS improves overall user experience.
Feature Selection via Coalitional Game Theory
Authors: Shay Cohen, Gideon Dror, Eytan Ruppin
Venue: Neural Computation (2007)

We present and study the contribution-selection algorithm (CSA), a novel algorithm for feature selection. The algorithm is based on the multiperturbation shapley analysis (MSA), a framework that relies on game theory to estimate usefulness. The algorithm iteratively estimates the usefulness of features and selects them accordingly, using either forward selection or backward elimination. It can optimize various performance measures over unseen data such as accuracy, balanced error rate, and area under receiver-operator-characteristic curve. Empirical comparison with several other existing feature selection methods shows that the backward elimination variant of CSA leads to the most accurate classification results on an array of data sets.
Virtual Organizations in Arigatoni
Authors: Michel Cosnard, Luigi Liquori, Raphael Chand
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Arigatoni is a lightweight overlay network that deploys the Global Computing Paradigm over the Internet. Communication for over the behavioral units of the overlay is performed by a simple resource discovery protocol (RDP). Basic Global Computers Units (GC) can communicate by first registering to a brokering service and then by mutually asking and offering services. Colonies and communities are the main entities in the model. A colony is a simple virtual organization composed by exactly one leader and some set (possibly empty) of individuals. A community is a raw set of colonies and global computers (think it as a soup of colonies and global computer without a leader). We present an operational semantics via a labeled transition system, that describes the main operations necessary in the Arigatoni model to perform leader negotiation, joining/leaving a colony, linking two colonies and moving one GC from one colony to another. Our formalization results to be adequate w.r.t. the algorithm performing peer logging/delogging and colony aggregation.
Local constraints on sentence markers and focus in Somali
Authors: Katherine Hargreaves, Allan Ramsay
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We present a computationally tractable account of the interactions between sentence markers and focus marking in Somali. Somali, as a Cushitic language, has a basic pattern wherein a small 'core' clause is preceded, and in some cases followed by, a set of 'topics', which provide scene-seting information against which the core is interpreted. Some topics appear to carry a 'focus marker', indicating that they are particularly salient. We will outline a computationally tractable grammar for Somali in which focus marking emerges naturally from a consideration of the use of a range of sentence markers.
Managing the Outsourcing Marriage to Achieve Success
Authors: Hugo Gong, Mary Tate, Shawn Alborz
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This study examines and tests the veracity of five main dimensions of outsourcing operationalization that have been found to influence the quality of relationship between parties and ultimately the success of an outsourcing arrangement. A single case study of a long strategic outsourcing relationship was utilized. The findings suggest that transition, performance management, contract management, working style and knowledge exchange significantly affect outsourcing relationship quality. We also identify management actions and practices that have proved successful in maintaining the ongoing quality of IT outsourcing relationships.
Detecting format string vulnerabilities with type qualifiers
Authors: Umesh Shankar, Kunal Talwar, Jeffrey S. Foster, David Wagner
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

We present a new system for automatically detecting format string security vulnerabilities in C programs using a constraint-based type-inference engine. We describe new techniques for presenting the results of such an analysis to the user in a form that makes bugs easier to find and to fix. The system has been implemented and tested on several real-world software packages. Our tests show that the system is very effective, detecting several bugs previously unknown to the authors and exhibiting a low rate of false positives in almost all cases. Many of our techniques are applicable to additional classes of security vulnerabilities, as well as other type-and constraint-based systems.
Sound capture from spatial volumes: matched-filter processing of microphone arrays having randomly-distributed sensors
Authors: Ea-Ee Jan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This report describes microphone arrays and parallel signal processing for high-quality sound capture in noisy, reverberant enclosures. The technique incorporates matched-filtering of individual sensors and parallel processing to provide spatial volume selectivity that mitigates effects of noise interference and multipath distortion. Truncated causal approximations to ideal matched-filters and arrays composed of randomly distributed transducers reduce complexity and improve the quality of sound capture. The method outperforms traditional delay-and-sum beamformers which provide only directional selectivity.
A 4 kb/s toll quality harmonic excitation linear predictive speech coder
Authors: S. Yeldener
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The harmonic excitation linear predictive speech coder (HE-LPC) is a technique derived from MBE and MB-LPC type of speech coding algorithms. The HE-LPC coder has the potential of producing high quality speech at 4.8 kb/s and below. This coder employs a new pitch estimation and voicing technique. In addition, new DCT based LPC and residual amplitude quantization techniques have been developed. The 4 kb/s HE-LPC coder with a 14th order LPC filter was found to produce much better speech quality than the various low rate speech coding standards, including 3.6 kb/s INMARSAT Mini-M AMBE vocoder. During formal ITU ACR test, the 4 kb/s HE-LPC vocoder was found to produced equivalent performance to 32 kb/s ADPCM and G.729 for both flat and modified IRS filtered clean input speech conditions. The HE-LPC algorithm can also be extended to cover bit rates between 1.2 and 8 kb/s range depending on the application.
Design and implementation of an efficient point slicing algorithm for the V.34 modem standard
Authors: O. Tanrikulu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The V.34 modem standard uses QAM constellations with 4 to 1664 points depending upon the results of the line probing where the telephone channel is characterized to connect at the maximum possible data rate. In the receiver, the decisions errors due to the channel noise are prevented by using the Viterbi subset decoder which uses a point slicing algorithm that determines the closest valid point on the constellation for a given constellation size. In this paper we present a point slicing algorithm where the complexity is nearly independent of the QAM constellation size. 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
Adaptive power management in energy harvesting systems
Authors: Clemens Moser, Lothar Thiele, Davide Brunelli, Luca Benini
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Recently, there has been a substantial interest in the design of systems that receive their energy from regenerative sources such as solar cells. In contrast to approaches that attempt to minimize the power consumption we are concerned with adapting parameters of the application such that a maximal utility is obtained while respecting the limited and time-varying amount of available energy. Instead of solving the optimization problem on-line which may be prohibitively complex in terms of running time and energy consumption, we propose a parameterized specification and the computation of a corresponding optimal on-line controller. The efficiency of the new approach is demonstrated by experimental results and measurements on a sensor node.
Detection of subspace waveforms in subspace interference and noise
Authors: J. A. Gubner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The natural models of multi-access communication and modern radar and sonar systems involve infinite-dimensional waveform spaces. A common problem in these systems is the detection of subspace signals measured in the presence of subspace interference and broadband noise. By and large, the existing theory for such problems has been developed for finite-dimensional measurement spaces rather than the infinite-dimensional waveform spaces needed here. In this paper the log of the generalized likelihood ratio detector for the waveform problem is derived and is shown to have a certain chi-squared distribution, depending on the hypothesis.
Toward Agent-Based Cooperative Resource Management in a Telecommunication Operator Grid Platform
Authors: A. Lenica, F. Ogel, F. Peschanski, J. P. Briot
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Like most telecommunication companies and service providers, France Telecom deals with highly heterogeneous applications, ranging from batch oriented to rich interactive multimedia services. Deploying those applications on an utility/grid infrastructure is a promising way to cut operational costs while improving performance (load limitations, QoS, etc.). However, most grid middleware technologies do not deal with interactive (i.e. non-batch) applications. Thus, we propose a grid service platform that dynamically provisions resources for both interactive and batch applications to meet their QoS constraints while ensuring good resource mutualization. Moreover, we believe that relying on an agent-based approach for resource management allows a more flexible, robust and scalable solution.
Probabilistic classification of HMM states for large vocabulary continuous speech recognition
Authors: Xiaoqiang Luo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In state-of-art large vocabulary continuous speech recognition (LVCSR) systems, HMM state-tying is often used to achieve good balance between the model resolution and robustness. In this paradigm, tied HMM states share a single set of parameters and are nondistinguishable. To capture the fine differences among tied HMM states, a probabilistic classification of HMM states (PCHMM) is proposed in this paper for LVCSR. In particular, a distribution from a HMM state to classes is introduced. It is shown that the state-to-class distribution can be estimated together with conventional HMM parameters within the EM (Dempster et al., 1977) framework. Compared with HMM state-tying, probabilistic classification of HMM states makes more efficient use of model parameters. It also makes the acoustic model more robust against the possible mismatch or variation between training and test data. The viability of this approach is verified by the significant reduction of word error rate (WER) on the Switchboard (Godfrey et al., 1992) task.
An event-based network-on-chip monitoring service
Authors: C. Ciordas, T. Basten, A. Radulescu, K. Goossens, J. Meerbergen
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

Networks on chip (NoCs) are a scalable interconnect solution for large scale multiprocessor systems on chip (SoCs). However, little attention has been paid so far to the monitoring and debugging support for NoC-based systems. We propose a generic online event-based NoC monitoring service, based on hardware probes attached to NoC components. The proposed monitoring service offers run-time observability of NoC behavior and supports system-level and application debugging. The defined service can be accessed and configured at run-time from any network interface port. We present a probe architecture for the monitoring service, together with its associated programming model and traffic management strategies. We prove the feasibility of our approach via a prototype implementation for the AEthereal NoC. The additional monitoring traffic is low; typical monitoring connection configuration for a NoC-based SoC application needs only 4.8KB/s, which is 6 orders of magnitude lower than the 2GB/s per link raw bandwidth offered by the AEthereal NoC.
Using screen readers to reinforce web accessibility education
Authors: André Pimenta Freire, Renata Pontin de Mattos Fortes, Debora Maria Barroso Paiva, Marcelo Augusto Santos Turine
Venue: ACM SIGCSE Bulletin (2007)

This paper discusses an approach for Web accessibility education tacking advantage of short introductory courses. In this approach, screen readers were used toallimmerse students in the problems experienced by blind users while using the Web. Experimental results from an evaluation exercise carried out by students showedallthat the use ofallscreen readers was helpful to better understand and to reinforce the concepts of Web accessibility.
Lessons Learned from Establishing a Software Engineering Academic Programme in Developing Countries
Authors: Amir Zeid
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Developing a curriculum in Software Engineering is challenging. Many technical, cultural and ethical issues have to be considered. This paper summarizes our experience in developing a B.Sc. degree in Computer Science with specialization in Software Engineering for the British University in Egypt (BUE). We will present the methodology we followed to design the curriculum. In addition, we will present the structure of the degree and we will give examples to show some courses that we had to introduce to handle some of the issues relevant to the local and global market needs. In addition, we will present some factors that had to be considered like the maturity of local software industry and awareness of copyright issues.