ppxscal/embedding_network huggingface dataset:
Synthesized speech intelligibility and persuasion: Speech rate and non-native listeners
Authors: Caroline Jones, Lynn Berry, Catherine Stevens
Venue: Computer Speech and Language (2007)

This experiment assessed the effect of variation in speech rate on comprehension and persuasiveness of a message presented in text-to-speech (TTS) synthesis to native and non-native listeners. Eighty non-native speakers of English and 80 native speakers of Australian English were randomly assigned to listen to eight banking product descriptions under one of four conditions: normal rate (155 words per minute) with no background noise, normal rate with multi-talker background noise (+6dB SNR), fast-normal (178 words per minute) with no background noise, and fast-normal with multi-talker background noise. Participants completed comprehension tests and rated each product's usefulness. A faster rate lowers comprehension for both native and non-native listeners but does not influence the persuasiveness of the message. The findings have implications for the selection of speech rates for persuasive messages delivered to native and non-native listeners using TTS.
Adaptive Low Power Listening for Wireless Sensor Networks
Authors: Raja Jurdak, Pierre Baldi, Cristina Videira Lopes
Venue: IEEE Transactions on Mobile Computing (2007)

Most sensor networks require application-specific network-wide performance guarantees, suggesting the need for global and flexible network optimization. The dynamic and nonuniform local states of individual nodes in sensor networks complicate global optimization. Here, we present a cross-layer framework for optimizing global power consumption and balancing the load in sensor networks through greedy local decisions. Our framework enables each node to use its local and neighborhood state information to adapt its routing and MAC layer behavior. The framework employs a flexible cost function at the routing layer and adaptive duty cycles at the MAC layer in order to adapt a node's behavior to its local state. We identify three state aspects that impact energy consumption: 1) number of descendants in the routing tree, 2) radio duty cycle, and 3) role. We conduct experiments on a test-bed of 14 mica2 sensor nodes to compare the state representations and to evaluate the framework's energy benefits. The experiments show that the degree of load balancing increases for expanded state representations. The experiments also reveal that all state representations in our framework reduce global power consumption in the range of one-third for a time-driven monitoring network and in the range of one-fifth for an event-driven target tracking network.
Improved approximation results for the stable marriage problem
Authors: Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
Venue: ACM Transactions on Algorithms (TALG) (2007)

The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum size, while any stable matching is a maximal matching and thus trivially we can obtain a 2-approximation algorithm. In this article, we give the first nontrivial result for approximation of factor less than two. Our algorithm achieves an approximation ratio of 2/(1 &plus; L&minus;2) for instances in which only men have ties of length at most L. When both men and women are allowed to have ties but the lengths are limited to two, then we show a ratio of 13/7(<1.858). We also improve the lower bound on the approximation ratio to 21/19(>1.1052).
On the reference mapping for quadrilateral and hexahedral finite elements on multilevel adaptive grids
Authors: G. Matthies, F. Schieweck
Venue: Computing (2007)

We study the properties of the reference mapping for quadrilateral and hexahedral finite elements. We consider multilevel adaptive grids with possibly hanging nodes which are typically generated by adaptive refinement starting from a regular coarse grid. It turns out that for such grids the reference mapping behaves &#x2013; up to a perturbation depending on the mesh size &#x2013; like an affine mapping. As an application, we prove optimal estimates of the interpolation error for discontinuous mapped $$\mathbb{P}_r$$ -elements on quadrilateral and hexahedral grids.
Sensing user intention and context for energy management
Authors: Angela B. Dalton, Carla S. Ellis
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Sensors are emerging as a key area of interest in operating systems research, with a main focus on sensor networks. Turning the relationship around, we propose the use of low-power sensors as tools for improving OS-based energy management. Using sensors to detect user intent and physical context we can more directly match system I/O behavior to user needs. FaceOff is a prototype display power management system designed as a test bed and proof-of-concept.
Multi-level Architectural Evolution Management
Authors: Tien N. Nguyen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Software development is a dynamic process where engineers constantly modify and refine systems. As a consequence, system architecture evolves over time. Software architectural evolution has been managed at different abstraction levels: the meta level, the architectural level, the application level, the implementation level, etc. However, the management supports for architectural evolution are limited to evolution mechanisms in architectural description languages such as subtyping, inheritance, interface, and genericity. This paper presents a model-oriented version and configuration control approach to managing the evolution of architectural entities in configurations at different abstraction levels as well as logical relationships among them. This paper also illustrates our approach in building an architectural configuration management system that is capable of managing configurations and versions of software architecture across multiple levels of abstraction in a uniform and tightly connected manner.
What are the joint time-frequency moments of a signal?
Authors: B. Tacer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We investigate the question of what the joint moments of a signal are by considering the joint moments of the spectrogram for limiting cases of the window. Operator methods are also explored. Expressions for the joint moments are derived, which reveal the distorting effects of the spectrogram window. Knowledge of the joint moments of a signal may be useful in estimating positive time-frequency distributions, or in signal classification of nonstationary signals.
A modular network layer for sensornets
Authors: Cheng Tien Ee, Rodrigo Fonseca, Sukun Kim, Daekyeong Moon, Arsalan Tavakoli, David Culler, Scott Shenker, Ion Stoica
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

An overall sensornet architecture would help tame the increasingly complex structure of wireless sensornet software and help foster greater interoperability between different codebases. A previous step in this direction is the Sensornet Protocol (SP), a unifying link-abstraction layer. This paper takes the natural next step by proposing a modular network-layer for sensornets that sits atop SP. This modularity eases implementation of new protocols by increasing code reuse, and enables co-existing protocols to share and reduce code and resources consumed at run-time. We demonstrate how current protocols can be decomposed into this modular structure and show that the costs, in performance and code footprint, are minimal relative to their monolithic counterparts.
Tied-structure HMM based on parameter correlation for efficient model training
Authors: S. Takahashi, S. Sagayama
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper proposes a new scheme of the tied-structure for constraining an HMM structure to increase training efficiency and recognition robustness. In conventional tied-structure approaches, tied parameters (or distributions, states, allophones) share the same value for decreasing model complexity. In the new framework, the tied parameters are correlated to each other rather than share the same value. To establish the appropriate correlation between model parameters, a speaker-independent initial model is trained using multiple sets of speaker-dependent data. The transfer vectors from the initial mean vectors of Gaussian distributions to the trained mean vectors are clustered to obtain sets of mean vectors that are mutually correlated across speakers. This kind of speaker-independent parameter-correlated structure can yield a lower degree-of-freedom for the model compared to the baseline speaker-independent model. Using the model with the parameter-correlated structure, speaker adaptation experiments are performed to demonstrate the higher training efficiency of the model compared to conventional speaker adaptation techniques without the correlation structure.
Understanding social interaction in world of warcraft
Authors: Vivian Hsueh-hua Chen, Henry Been-Lirn Duh
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Research has argued that social interaction is a primary driving force for gamers to continue to play Massive Multiple Online Role Playing Games (MMORPGs). However, one recent study argues that gamers don't really socialize with other players but play alone. Part of the confusion over whether players socialize much and/or enjoy socializing while playing MMORPGs may be due to the lack of a conceptual framework that adequately articulates what is meant by 'social interaction in MMORPGs to understand how users experience interactions within the game. This study utilized ethnography to map out social interaction within the game World of Warcraft. It provides a broad framework of the factors affecting social interaction. The framework developed can be further verified and modified for future research.
Distributed algorithms for connected domination in wireless networks
Authors: Rajiv Gandhi, Srinivasan Parthasarathy
Venue: Journal of Parallel and Distributed Computing (2007)

We present fast distributed local control connected dominating set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CDSTop which take into account the effect of wireless interference and the consequent loss of messages during the execution of the algorithm. These algorithms produce a CDS of constant size and constant stretch ratio with high probability, and converge in polylogarithmic running time. Specifically, algorithm CDSColor requires the nodes to know (estimates of) the maximum degree @D and the size of the network n and converges in O(@Dlog^2n) time. Algorithm CDSTop requires the nodes to know their three-hop topology and (an estimate of) the network size n and converges in O(log^2n) time. To the best of our knowledge, these are the first distributed interference-aware CDS algorithms for wireless ad hoc networks which break the linear running-time barrier.
What is the Influence of Context and Incentive on Mobile Commerce Adoption? A Case study of a GPS-based Taxi Dispatching System
Authors: Zhengchuan XU, Yufei Yuan
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Users may use a mobile service in various contexts. It is critical to study how users' perceptions and intentions are affected by context. At the same time, incentives such as financial rewards or mandatory usage policies may also affect users' behavior. We propose an acceptance model of mobile commerce with a consideration of context and incentive. We apply this model to the case of a GPSbased taxi-dispatching system. Preliminary data analysis illustrates that context and incentive have significant impacts on uses' behavior.
AntTAG: a new method to compose computer programs using colonies of ants
Authors: H. A. Abbass, Xuan Hoai, R. I. McKay
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Genetic programming (GP) plays the primary role in the discovery of programs through evolving the program's set of parse trees. We present a new technique for constructing programs through ant colony optimization (ACO) using the tree adjunct grammar (TAG) formalism. We call the method AntTAG and we show that the results are very promising.
Blind multiuser detection for CDMA with multipath: a direct method
Authors: Xiaohua Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this paper we consider the blind multiuser detection problem for asynchronous DS-CDMA systems operating in a multipath environment. Using only the spreading code of the desired user, we first estimate the column vector subspace of the channel matrix by multiple linear prediction. Then zero-forcing detectors and MMSE detectors with arbitrary delay can be obtained without explicit channel estimation. This avoids any channel estimation error and the resulting methods are therefore more robust and more accurate. The new algorithms are robust against timing estimation errors, and are extremely near-far resistant. Simulations show the effectiveness of these methods.
Towards a Survey of the Deployment Space for Internet Applications
Authors: Athanasios Pavlopoulos, Richard Cooper
Venue: Proceedings of the 24th British National Conference on Databases (2007)

Internet applications are deployed over increasingly complex collections of devices located in network topologies of increasing variety. We seek to develop a complete development environment in which such applications can be designed, implemented and deployed. A major part of this will be the ability to specify the deployment of an application -- i.e. after designing the application as a set of components supports a number of tasks; the designer should be able to state where each component will reside and which technology it will use. In order to achieve this, the environment must embody all the deployment options so that the designer can choose from them. This paper is a first attempt to categorise and itemise the options which will be available.
Minimum initiation interval of multi-module recurrent signal processing algorithm realization with fixed communication delay
Authors: H.-Y. Tyan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A novel iterative algorithm is proposed to compute the theoretical minimum initiation interval of a given recurrent algorithm when there is a known, fixed inter-module communication delay. Specifically, for a twin-module implementation problem, a novel representation called necessary initiation interval is introduced to facilitate the development of an iterative algorithm which yields both the minimum initiation interval and the corresponding cut set of the cyclic iterative computational dependence graph (ICDG). The convergence of this iterative algorithm in finite iterations is also proved.
Robot networks of internet destroyers
Authors: Win Treese
Venue: netWorker (2007)

Imagine having a thousand robots, all under your control, scattered all around the world. Any time you want, you can command them to act, attacking any target. Your control of them is secret; you can choose the target or auction it off to the highest bidder. Most of the time, no one can trace the attack---after it is over, the robots go back into hiding, waiting for their next command.
The Triumphant Consumer? VoIP, “Little Smart,” and Telecom Service Reform in China
Authors: Irene Wu
Venue: Information Technologies and International Development (2007)

Can innovations in communications technology dilute the power of China's authoritarian government? When Voice over Internet Protocol (VOIP) and Little Smart (xiao lingtong) personal handyphone service first broke into China's market, they were illegal. However, consumers loved the services and demanded more. Using VOIP consumers can make cheap long distance calls. Little Smart introduced an old technology to China that makes mobile phone services more affordable to the masses. Eventually, the Ministry of Information Industry (MII), which initially had banned both, then legalized both under pressure from other parts of the government and from consumers. The planned economy is breaking down and the government is constructing piecemeal the foundation for a rules-based economy.
An open source solution for testing NAT'd and nested iptables firewalls
Authors: Robert Marmorstein, Phil Kearns
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

As firewalls have increased in power and flexibility, the complexity of configuring them correctly has grown significantly. An error in the firewall configuration can compromise the security of the system or interfere with normal network activity. The chance of an error increases when coordinating multiple firewalls, because the interaction between filters may hide errors more easily noticed on a single firewall. Firewalls on many networks use network address translation, which further increases the complexity of the firewall policy and creates additional opportunities for errors. Because errors in the firewall configuration are often extremely costly in time and security, system administrators need tools for verifying and debugging their firewall policy. ITVal is a tool for analyzing iptables-based firewalls that provides a plain English query language for simple firewall analysis. In this work, we describe extensions to ITVal that allow it to process network address translation rules and analyze multiple firewalls connected sequentially.
Antigone: a flexible framework for secure group communication
Authors: Patrick McDaniel, Atul Prakash, Peter Honeyman
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

Many emerging applications on the Internet requiring group communication have varying security requirements. Significant strides have been made in achieving strong semantics and security guarantees within group environments. However, in existing solutions, the scope of available security policies is often limited. This paper presents Antigone, a framework that provides a suite of mechanisms from which flexible application security policies may be implemented. With Antigone, developers may choose a policy that best addresses their security and performance requirements. We describe the Antigone's mechanisms, consisting of a set of micro-protocols, and show how different security policies can be implemented using those mechanisms. We also present a performance study illustrating the security/performance tradeoffs that can be made using Antigone.
Cluster computing and the power of edge recognition
Authors: Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
Venue: Information and Computation (2007)

Though complexity theory already extensively studies path-cardinality-based restrictions on the power of nondeterminism, this paper is motivated by a more recent goal: To gain insight into how much of a restriction, it is of nondeterminism to limit machines to have just one contiguous (with respect to some simple order) interval of accepting paths. In particular, we study the robustness-the invariance under definition changes-of the cluster class CL#P. This class contains each #P function that is computed by a balanced Turing machine whose accepting paths always form a cluster with respect to some length-respecting total order with efficient adjacency checks. The definition of CL#P is heavily influenced by the defining paper's focus on (global) orders. In contrast, we define a cluster class, CLU#P, to capture what seems to us a more natural model of cluster computing. We prove that the naturalness is costless: CL#P=CLU#P. Then we exploit the more natural, flexible features of CLU#P to prove new robustness results for CL#P and to expand what is known about the closure properties of CL#P. The complexity of recognizing edges-of an ordered collection of computation paths or of a cluster of accepting computation paths-is central to this study. Most particularly, our proofs exploit the power of unique discovery of edges-the ability of nondeterministic functions to, in certain settings, discover on exactly one (in some cases, on at most one) computation path a critical piece of information regarding edges of orderings or clusters.
Alert Fusion for a Computer Host Based Intrusion Detection System
Authors: Chuan Feng, Jianfeng Peng, Haiyan Qiao, Jerzy W. Rozenblit
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Intrusions impose tremendous threats to today's computer hosts. Intrusions using security breaches to achieve unauthorized access or misuse of critical information can have catastrophic consequences. To protect computer hosts from the increasing threat of intrusion, various kinds of Intrusion Detection Systems (IDSs) have been developed. The main disadvantages of current IDSs are a high false detection rate and the lack of post-intrusion decision support capability. To minimize these drawbacks, we propose an event-driven intrusion detection architecture which integrates Subject-Verb-Object (SVO) multi-point monitors and an impact analysis engine. Alert fusion and verification models are implemented to provide more reasonable intrusion information from incomplete, inconsistent or imprecise alerts acquired by SVO monitors. DEVS formalism is used to describe the model based design approach. Finally we use the DEVS-JAVA simulation tool to show the feasibility of the proposed system.
Backtracking and constraints in Tcl-BC
Authors: Dayton Clark, David M. Arnow
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

Tcl is extended to include backtracking controls and a facility for asserting constraints. This increases its flexibility in several domains and opens the possibility for its use in constraint-based logic programming applications and, conversely, applying constraint-based logic programming techniques to more traditional script language domains. The backtracking extensions are written entirely in Tcl itself, a fact which speaks well for Tcl's own extensibility.
Value Capture and Value Networks in Open Source Vendor Strategies
Authors: Joel West
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Firms involved in open source software face inherent limits on their ability to appropriate returns from technological innovation. Here I examine the business models used by IT vendors given the limited appropriability available for open source software. I show how firms capture value through complementary assets, while creating value and positive network effect through an inherent openness that attracts complementors, users and rivals to their corresponding value network. From this, I offer suggestions for future research on complementary assets and value capture in business models.