ppxscal/embedding_network huggingface dataset:
Determining the Polarity and Source of Opinions Expressed in Political Debates
Authors: Alexandra Balahur, Zornitsa Kozareva, Andrés Montoyo
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

In this paper we investigate different approaches we developed in order to classify opinion and discover opinion sources from text, using affect, opinion and attitude lexicon. We apply these approaches on the discussion topics contained in a corpus of American Congressional speech data. We propose three approaches to classifying opinion at the speech segment level, firstly using similarity measures to the affect, opinion and attitude lexicon, secondly dependency analysis and thirdly SVM machine learning. Further, we study the impact of taking into consideration the source of opinion and the consistency in the opinion expressed, and propose three methods to classify opinion at the speaker intervention level, showing improvements over the classification of individual text segments. Finally, we propose a method to identify the party the opinion belongs to, through the identification of specific affective and non-affective lexicon used in the argumentations. We present the results obtained when evaluating the different methods we developed, together with a discussion on the issues encountered and some possible solutions. We conclude that, even at a more general level, our approach performs better than trained classifiers on specific data.
Emergent team coordination: from fire emergency response practice to a non-mimetic simulation game
Authors: Zachary O. Toups, Andruid Kerne, William Hamilton, Alan Blevins
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

We take the work practices of fire emergency responders as the basis for developing simulations to teach team coordination. We introduce non-mimetic simulation: economic operational environments that represent human-centered components of practice, such as team structures and information flows, without mimicking concrete aspects of an environment. Emergent team coordination phenomena validate the non-mimetic simulation of fire emergency response. We develop non-mimetic simulation principles through a game, focusing engagement on information distribution, roles, and the need for decisive real time action, while omitting concrete aspects. We describe the game design in detail, including rationale for design iterations. We take the non-mimetic simulation game design to participants for a series of play sessions, investigating how forms of information distribution affect game play. Participants coordinate as a team and, although they are not firefighters, begin to work together in ways that substantively reflect firefighting team coordination practice.
Phone-Controlled Delivery of NGN Services into Residential Environments
Authors: Andreas Fasbender, Stefan Hoferer, Martin Gerdes, Takeshi Matsumura, Andreas Häber, Frank Reichert
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The horizontally layered architecture of the IMS/NGN standards family enables the delivery of services independent of access network and requesting device. In this article, the authors propose a further separation of service control and delivery, allowing the requesting device – in particular a user's mobile phone – to invite other devices (we will focus on DLNA appliances) into the service delivery, enhancing both user experience and service design flexibility. The proposed solution builds on exploiting proximity technologies (e.g. barcodes, NFC) for pairing the control device with a remote environment. Motivated by scenarios, the architecture concepts are explained and a prototype that was implemented for validation is described. Selected findings and a short overview of related standardization efforts conclude the paper.
Let It Flow: Building Mashups with Data Processing Pipelines
Authors: Biörn Biörnstad, Cesare Pautasso
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Mashups are a new kind of interactive Web application, built out of the composition of two or more existing Web service APIs and data sources. Whereas "pure" mashups are built relying entirely on the Web browser as a platform for integration at the presentation layer, this approach is not always feasible and part of the mashup integration logic must be deployed on the Web server instead. In the case study presented in this paper, we explore a novel approach to build mashups out of heterogeneous sources of streaming data. In particular, we introduce a layered mashup architecture, with a clear separation between the mashup user interface and the mashup integration logic run by a mashup engine. To do so, we show how to build a mashup application that displays in real time the location of visitors connecting to a Website. The integration logic feeding a map widget by processing the Web site logs is developed using a data flow model that connects a set of reusable and heterogeneous components into a data processing pipeline. We conduct a brief performance evaluation of the mashup showing that the pipeline introduces minimal delay and discuss several extensions of the mashup.
The determination of snow specific surface area, albedo and effective grain size using AATSR space-borne measurements
Authors: A. Kokhanovsky, M. Schreier
Venue: International Journal of Remote Sensing (2009)

New techniques to retrieve snow specific surface area (SSA), albedo and grain size from satellite data are described. The described methods are applied to the determination of the snow properties at the coast of Greenland. It was found that the effective grain diameters were about 0.5 mm and the specific surface area was about 150 cm2g-1 for the region studied. The snow albedo was close to 0.93. The results were obtained using AATSR data. SSA spatial distribution was for the first time derived using satellite measurements.
Data reference characteristics of database application programs
Authors: Isao Miyamoto
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In-this paper the data reference characteristics of database applications programs are discussed. Factors characterizing some properties of data references are selected, and the data working set as a locality and the interreference interval distribution are measured. The data reference characteristics of application programs can be divided into three types, hard-type, soft-type and special-type, when the logical structures of database and the search strategies are considered. Also the problem of restructuring an application program taking parallelism into consideration is discussed.
Logical problem determination in an SNA network
Authors: Robert A. Weingarten, Edward E. Iacobucci
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Until recently, problem determination on a systems network architecture (SNA) network has dealt mostly with error detection on physical network components. Logical-error detection mechanisms associated with logical-network (software-related) errors were not adequately provided until the recent announcement of a new on-line interactive package called the network logical data manager (NLDM). This paper will discuss the physical and logical network environments, logical network problems, and functions provided by NLDM for logical problem determination.
Querying sensor networks using ad hoc mobile devices: A two-layer networking approach
Authors: Shourui Tian, Sol M. Shatz, Yang Yu, Juzheng Li
Venue: Ad Hoc Networks (2009)

An interplay between mobile devices and static sensor nodes is envisioned in the near future. This will enable a heterogeneous design space that can offset the stringent resource and power constraints encountered in traditional static sensor networks by taking advantage of the more powerful mobile devices. We present a systematic framework for end-to-end query processing, using a two-layer architecture that consists of mobile devices at the upper layer and static sensor nodes at the bottom layer. The framework employs a ''PULL'' query model that contains staged operations including query generation, query routing, query injection, and query result routing. Each of these stages of query processing is discussed with an emphasis on techniques for energy-efficient query injection and query result routing with location-ignorant sensor nodes. The techniques leverage the mobility and transmission flexibility of mobile objects at the upper layer. Numeric and simulation results are provided to support the proposed methods.
Modelling hardware verification concerns specified in the e language: an experience report
Authors: Darren Galpin, Cormac Driver, Siobhán Clarke
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

e is an aspect-oriented hardware verification language that is widely used to verify the design of electronic circuits through the development and execution of testbenches. In recent years, the continued growth of the testbenches developed at Infineon Technologies has resulted in their becoming difficult to understand, maintain and extend. Consequently, a decision was taken to document the testbenches at a higher level of abstraction. Accordingly, we attempted to model our legacy test suites with an existing aspect-oriented modelling approach. In this paper we describe our experience of applying Theme/UML, an aspect-oriented modelling approach, to the representation of aspect-oriented testbenches implemented in e. It emerged that the common aspect-oriented concepts supported by Theme/UML were not sufficient to adequately represent the e language, primarily due to e's dynamic, temporal nature. Based on this experience we propose a number of requirements that must be addressed before aspect-oriented modelling approaches such as Theme/UML are capable of representing aspect-oriented systems implemented in e.
InSb quantum dot LEDs grown by molecular beam epitaxy for mid-infrared applications
Authors: P. J. Carrington, V. A. Solov'ev, Q. Zhuang, S. V. Ivanov, A. Krier
Venue: Microelectronics Journal (2009)

We report the molecular beam epitaxial growth of InSb quantum dots (QD) inserted as sub-monolayers in an InAs matrix which exhibit intense mid-infrared photoluminescence up to room temperature. The InSb QD sheets were formed by briefly exposing the surface to an antimony flux (Sb2) exploiting an As-Sb anion exchange reaction. Light emitting diodes were fabricated using 10 InSb QD sheets and were found to exhibit bright electroluminescence with a single peak at 3.8&mu;m at room temperature.
Teach Scheme, reach Java: introducing object-oriented programming without drowning in syntax
Authors: Stephen Bloch
Venue: Journal of Computing Sciences in Colleges (2009)

Participants will use the DrScheme platform to solve several CS0/CS1 problems in Scheme, including function composition and re-use, conditionals, structures, and (if time allows) recursion on linked lists, and/or event-driven interactive graphic programming. We shall then demonstrate how the same topics can be covered in a more mainstream, but more complex, language such as Java. Participants will be invited to a week-long, NSF-funded workshop in Summer 2009, which goes into much more depth on technical, classroom, and curriculum issues.
Lower Bounds for Local Versions of Dimension Reductions
Authors: Gideon Schechtman, Adi Shraibman
Venue: Discrete Computational Geometry (2009)

We consider the problem of embedding vectors from an arbitrary Euclidean space into a low-dimensional Euclidean space while preserving, up to a small distortion, a subset of the distances. In particular, preserving only the distance of each vector to a small number of its nearest neighbors. We show that even when the subset of distances we wish to preserve is very small, the problem does not become easier than when one is required to preserve all the distances.
An analysis of privacy signals on the World Wide Web: Past, present and future
Authors: I. Reay, S. Dick, J. Miller
Venue: Information Sciences: an International Journal (2009)

Electronic commerce is now an established, vital part of the world economy. However, this economic sector is currently endangered by consumers' well-founded concern for the privacy of their information. Recent surveys indicate that this concern is beginning to alter consumers' spending habits. The World Wide Web Consortium is well aware of these concerns, and has produced the Platform for Privacy Preferences Protocol as a mechanism to help consumers protect their online privacy. This mechanism relies on the use of machine-readable privacy policies, posted on a website, and interpreted by a client-side browser extension. However, recent surveys indicate that adoption of this technology is stagnating on the server side, and work on an updated version of the Platform has been halted. We use signaling theory as a framework to model the likely future evolution of the Platform, in an effort to gauge whether it will flourish or wither as a technology. We find that signaling theory predicts the collapse of the Platform for Privacy Preferences Protocol. However, we also find theoretical and empirical grounds to predict that government intervention can drive adoption of the Platform on the server side, which may in turn bootstrap user adoption of this technology.
Application of the improved generalized demodulation time-frequency analysis method to multi-component signal decomposition
Authors: Junsheng Cheng, Yu Yang, Dejie Yu
Venue: Signal Processing (2009)

The generalized demodulation time-frequency analysis approach is a novel signal processing method, which is suitable for processing non-stationary signals, especially for processing amplitude-modulated and frequency-modulated (AM-FM) signals. The novelty of this method is that the signal whose time-frequency distributions are curved paths can be transformed into that whose time-frequency distributions are linear paths paralleling time axis by using generalized demodulation. Furthermore, the generalized demodulated signal can be decomposed into a number of mono-component signals whose instantaneous frequencies have physical meaning through the use of the maximal overlap discrete wavelet packet transform (MODWPT). Therefore, the complete time-frequency distributions of the original signal can be obtained. However, the generalized demodulation time-frequency analysis method fails to provide the time domain waveform of each mono-component signal. In this paper, aiming at the multi-component AM-FM signal, each mono-component signal of which only has single-sided spectra, the improvement to the generalized demodulation time-frequency analysis approach has been made and the improved method is introduced into certain multi-component AM-FM signal decomposition. The analysis results demonstrate that the validity of the proposed approach. In addition, the estimation of the phase function that is key step in the generalized demodulation time-frequency analysis approach is also discussed.
Gesture Recognition Based on Elastic Deformation Energies
Authors: Radu-Daniel Vatavu, Laurent Grisoni, Stefan-Gheorghe Pentiuc
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

We present a method for recognizing gesture motions based on elastic deformable shapes and curvature templates. Gestures are modeled using a spline curve representation that is enhanced with elastic properties: the entire spline or any of its parts may stretch or bend. The energy required to transform a gesture into a given template gives an estimation of the similarity between the two. We demonstrate the results of our gesture classifier with a video-based acquisition approach.
Linear systems with multiple singular values
Authors: L. A. Mironovskii
Venue: Automation and Remote Control (2009)

Properties of linear dynamical systems are studied in the case of Hankel singular values of high multiplicity for monosingular and bisingular systems. Singular values of the Hankel operator take only one or two values for such systems. Properties of transfer functions are analysed. Algorithms of transfer function analysis and design are developed. Relations between frequency characteristics and Hankel singular values are established.
Evolution and Applications of Wireless Sensor Networks
Authors: Ivan Andonovic
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Advances in low cost wireless and processing hardware have stimulated a range of wireless sensor networks (WSNs) research and their subsequent deployment in a number of applications. Since cost is an essential factor in any development, their designs are driven according to issues such as restricted memory size, limited computation power and low power consumption. However advanced applications such as those demanded by the medical/health care, military and surveillance sectors require higher levels of network performance supporting time sensitive, guaranteed and secure high quality data delivery. These demanding applications drive the need to enhance first generation WSN concepts.
A platform for transcoding heterogeneous markup documents using ontology-based metadata
Authors: I-Ching Hsu, Li-Pin Chi, Sheau-Shong Bor
Venue: Journal of Network and Computer Applications (2009)

As new standards, markup languages, protocols, and client devices continue to emerge, the main problem of existing transcoding systems is the lack of intelligence to cope with the heterogeneous effects, including various transcoding policies, markup documents, device constraints, and server platforms. This study proposes a new approach, called hybrid transcoding, to combine the traditional transcoding technologies based on ontology-based metadata to improve these heterogeneous problems. Additionally, the heterogeneous markup document transcoding (HMDT) platform, based on the proposed hybrid transcoding and web services technologies, is also presented to serve as a transcoding service broker to facilitate interoperability between distributed heterogeneous transcoders. To demonstrate the feasibility of HMDT platform, an application scenario of hybrid transcoding is implemented to convert HTML forms into various client devices.
A blind digital watermarking algorithm based on HVS and RBF neural network
Authors: Yan Hong Zhang
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

This paper proposes a new blind watermarking scheme based on discrete wavelet transform(DWT) domain. The method uses the HVS model, and radial basis function neural networks(RBF). RBF will be implemented while embedding and extracting watermark.The human visual system (HVS) model is used to determine the watermark insertion strength. The neural networks almost exactly recover the watermarking signals from the watermarked images after training and learning. The experimental results show that the algorithm is robustness and imperceptibility against the original image process attacks such as JPEG compression, cropping, noise and filtering etc.
Computers and the future of literacy
Authors: Frederick L. Goodman
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

My goal is to get people who make, buy, and use computers to consider more carefully the impact the computer is likely to have on our culture by recognizing the way it is both changing what it means to be "literate," and perhaps more importantly, changing how people become "literate."
Interactive water streams with sphere scan conversion
Authors: Rama Hoetzlein, Tobias Höllerer
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Fluid simulations require efficient dynamics, surface extraction and rendering in order to achieve real time interaction. We present a novel technique for the surface extraction of stream-shaped fluid simulations represented as particles. Typical surface extraction methods for particles combine implicit function evaluation with the marching cubes algorithm. In our approach, we dynamically update vertex positions in pre-generated geometry to efficiently construct and render fluid surfaces. Cylinders are wrapped to water streams composed of particles, with simulation and polygonization on the CPU, and shadows and lighting on the GPU. While limited to stream-shaped fluids, our technique is significantly faster than marching cubes, scales well with resolution and number of particles and, unlike point-based rendering, produces true 3D polygonal surfaces.
Partial Order Semantics of Types of Nets
Authors: Robert Lorenz, Gabriel Juhás, Sebastian Mauser
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the synthesis of Petri nets from (step) transition systems. Partial order semantics of a concrete net (of a certain type) usually are given by the set of labelled partial orders (LPOs) enabled w.r.t. the net. For classical place/transition nets there are several equivalent characterizations of enabled LPOs. We discuss in which way the general notion of types of nets has to be restricted such that these characterizations can also be formulated for nets of such type. In particular we consider under which requirements enabled LPOs can be defined through token flows, which have been proven to be useful for efficient synthesis and verification of Petri nets. The presented concepts form the basis for a general presentation of the synthesis of Petri nets from sets of LPOs.
An Evolutionary Method for Natural Language to SQL Translation
Authors: Alexandre Afonso, Leonardo Brito, Oto Vale
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

In this paper, we propose a new methodology where complex natural language requests from a user to a relational database are broken into simple sentences through an Evolutionary Computing method. Such basic sentences are then translated by another module, which tries to perform a pattern matching between a model filled by local grammars and the basic sentences generated by the Evolutionary Programming algorithm. The output of this system is a set of SQL queries to a specific database. The main feature is its combinatorial approach, as an alternative for the use of methods that employs many linguistic levels (lexicon, syntax rules and semantics) and intermediate languages. The proposed methodology is applied to Brazilian Portuguese. In our test bed, a 92% translation correctness was achieved.
An Adaptive Agent Negotiation Framework
Authors: Zhan Zhang, Weiming Shen, Hamada Ghenniwa
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Negotiation is widely used in agent-based e-business applications. Traditional predefined negotiation approaches cannot fully solve the negotiation automation problem due to their inadequate compatibility and limited adaptability, especially in open dynamic environments. This paper proposes an adaptive negotiation framework by enhancing the adaptability of the negotiation framework and participating agents. It includes a set of meta-components that can be used by negotiation participants to dynamically compose a suitable negotiation mechanism according to its negotiation context so as to increase the negotiation efficiency and system performance. The proposed framework has been designed, implemented and validated through a prototype system.