ppxscal/embedding_network huggingface dataset:
Software agents and robots in mental therapy: psychological and sociological perspectives
Authors: Tatsuya Nomura
Venue: AI Society (2008)

This paper discusses the meaning that interactive software agents and robots have in the context of mental therapy. This theoretical discussion is undertaken from a psychological and sociological perspective. It investigates what happens when interactive agents are introduced into current social situations. Methods of mental therapy vary from therapeutic conversation between clients and human therapists to interaction between clients and therapeutic animals such as dogs. This paper focuses on applications of interactive software agents and robots that substitute as autonomous artifacts behaving like humans for human therapists. In addition, some implications and policies for applications of interactive software agents and robots in mental therapy are discussed.
Clustering based on matrix approximation: a unifying view
Authors: Tao Li
Venue: Knowledge and Information Systems (2008)

Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. Recently, a number of methods have been proposed and demonstrated good performance based on matrix approximation. Despite significant research on these methods, few attempts have been made to establish the connections between them while highlighting their differences. In this paper, we present a unified view of these methods within a general clustering framework where the problem of clustering is formulated as matrix approximations and the clustering objective is minimizing the approximation error between the original data matrix and the reconstructed matrix based on the cluster structures. The general framework provides an elegant base to compare and understand various clustering methods. We provide characterizations of different clustering methods within the general framework including traditional one-side clustering, subspace clustering and two-side clustering. We also establish the connections between our general clustering framework with existing frameworks.
On the provenance of non-answers to queries over extracted data
Authors: Jiansheng Huang, Ting Chen, AnHai Doan, Jeffrey F. Naughton
Venue: Proceedings of the VLDB Endowment (2008)

In information extraction, uncertainty is ubiquitous. For this reason, it is useful to provide users querying extracted data with explanations for the answers they receive. Providing the provenance for tuples in a query result partially addresses this problem, in that provenance can explain why a tuple is in the result of a query. However, in some cases explaining why a tuple is not in the result may be just as helpful. In this work we focus on providing provenance-style explanations for non-answers and develop a mechanism for providing this new type of provenance. Our experience with an information extraction prototype suggests that our approach can provide effective provenance information that can help a user resolve their doubts over non-answers to a query.
Manifold models for signals and images
Authors: Gabriel Peyré
Venue: Computer Vision and Image Understanding (2009)

This article proposes a new class of models for natural signals and images. These models constrain the set of patches extracted from the data to analyze to be close to a low-dimensional manifold. This manifold structure is detailed for various ensembles suitable for natural signals, images and textures modeling. These manifolds provide a low-dimensional parameterization of the local geometry of these datasets. These manifold models can be used to regularize inverse problems in signal and image processing. The restored signal is represented as a smooth curve or surface traced on the manifold that matches the forward measurements. A manifold pursuit algorithm computes iteratively a solution of the manifold regularization problem. Numerical simulations on inpainting and compressive sensing inversion show that manifolds models bring an improvement for the recovery of data with geometrical features.
Forma analysis of particle swarm optimisation for permutation problems
Authors: Tao Gong, Andrew L. Tuson
Venue: Journal of Artificial Evolution and Applications (2008)

Particle swarm optimisation (PSO) is an innovative and competitive optimisation technique for numerical optimisation with real-parameter representation. In this paper, we examine the working mechanism of PSO in a principled manner with forma analysis and investigate the applicability of PSO on the permutation problem domain. Particularly, our derived PSO schemes are empirically studied based on the quadratic assignment problem (QAP) benchmarks to justify its comparable performance, which in turn implies the benefits of our approach in applying PSO to the discrete problem domain.
Multimodal presentation and browsing of music
Authors: David Damm, Christian Fremerey, Frank Kurth, Meinard Müller, Michael Clausen
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

Recent digitization efforts have led to large music collections, which contain music documents of various modes comprising textual, visual and acoustic data. In this paper, we present a multimodal music player for presenting and browsing digitized music collections consisting of heterogeneous document types. In particular, we concentrate on music documents of two widely used types for representing a musical work, namely visual music representation (scanned images of sheet music) and associated interpretations (audio recordings). We introduce novel user interfaces for multimodal (audio-visual) music presentation as well as intuitive navigation and browsing. Our system offers high quality audio playback with time-synchronous display of the digitized sheet music associated to a musical work. Furthermore, our system enables a user to seamlessly crossfade between various interpretations belonging to the currently selected musical work.
To the optimal identification of multivariate systems under perturbations of unknown covariances
Authors: L. P. Sysoev
Venue: Automation and Remote Control (2008)

We consider the problem of parameter and covariance estimation for multivariate stochastic systems described by regression models with special structure perturbations of unknown covariance. Sufficient conditions of uniformly optimal estimations are obtained for system parameters and covariances. The observation vector distribution family is factorized, and the full sufficient statistics is found under those conditions. Equations for uniformely optimal unbiased estimates of covariance parameters are obtained.
Characterizing and bounding the imperfection ratio for some classes of graphs
Authors: Sylvain Coulonges, Arnaud P&#x00ea;cher, Annegret K. Wagler
Venue: Mathematical Programming: Series A and B (2009)

Perfect graphs constitute a well-studied graph class with a rich structure, which is reflected by many characterizations with respect to different concepts. Perfect graphs are, for instance, precisely those graphs G where the stable set polytope STAB(G) equals the fractional stable set polytope QSTAB(G). The dilation ratio $${\rm min}\{t : {\rm QSTAB}(G) \subseteq t\,{\rm STAB}(G)\}$$of the two polytopes yields the imperfection ratio of G. It is NP-hard to compute and, for most graph classes, it is even unknown whether it is bounded. For graphs G such that all facets of STAB(G) are rank constraints associated with antiwebs, we characterize the imperfection ratio and bound it by 3/2. Outgoing from this result, we characterize and bound the imperfection ratio for several graph classes, including near-bipartite graphs and their complements, namely quasi-line graphs, by means of induced antiwebs and webs, respectively.
Networks with attitudes
Authors: Paul Skokowski
Venue: AI Society (2008)

Does connectionism spell doom for folk psychology? I examine the proposal that cognitive representational states such as beliefs can play no role if connectionist models&#x2014;interpreted as radical new cognitive theories&#x2014;take hold and replace other cognitive theories. Though I accept that connectionist theories are radical theories that shed light on cognition, I reject the conclusion that neural networks do not represent. Indeed, I argue that neural networks may actually give us a better working notion of cognitive representational states such as beliefs, and in so doing give us a better understanding of how these states might be instantiated in neural wetware.
Model-independent schema translation
Authors: Paolo Atzeni, Paolo Cappellari, Riccardo Torlone, Philip A. Bernstein, Giorgio Gianforme
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2008)

We discuss a proposal for the implementation of the model management operator ModelGen, which translates schemas from one model to another, for example from object-oriented to SQL or from SQL to XML schema descriptions. The operator can be used to generate database wrappers (e.g., object-oriented or XML to relational), default user interfaces (e.g., relational to forms), or default database schemas from other representations. The approach translates schemas from a model to another, within a predefined, but large and extensible, set of models: given a source schema S expressed in a source model, and a target model TM, it generates a schema S¿ expressed in TM that is "equivalent" to S. A wide family of models is handled by using a metamodel in which models can be succinctly and precisely described. The approach expresses the translation as Datalog rules and exposes the source and target of the translation in a generic relational dictionary. This makes the translation transparent, easy to customize and model-independent. The proposal includes automatic generation of translations as composition of basic steps.
Active control and digital rights management of integrated circuit IP cores
Authors: Yousra Alkabani, Farinaz Koushanfar
Venue: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems (2008)

We introduce the first approach that can actively control multiple hardware intellectual property (IP) cores used in an integrated circuit (IC). The IP rights owner(s) can remotely monitor, control, enable, or disable each individual IP on each chip. The approach introduces a paradigm shift in the microelectronic business model, nurturing smaller businesses, and supporting the design-reuse paradigm. The IPs can be controlled by the original designer or by the designers who reuse them. Each IP has a built-in functional lock that pertains to the unique unclonable ID of the chip. A control structure that coordinates the locking and unlocking of the IPs is embedded within the IC. We introduce a trusted third party approach for issuing certificates of authenticity, in case it is required for the applications. We present methods for safeguarding the approach against two attack sources: the foundry (fab), and the reuser. Experimental results show that our approach can be implemented with low area, power, and delay overheads making it suitable for embedded systems. The introduced control method is also low overhead in terms of the added steps to the current design and manufacturing flow.
iTV project: an authoring tool for mhp and ginga-j based on a web environment
Authors: Marcos R.M. Oliveira, Carlos B.P. Filho, Anderson F.R. Fer
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

Interactivity is one of the most interesting characteristics of the Digital Television. The production of interactive content, although, is not a simple process. It requires a specific knowledge about programming languages, specially in environments with scarce resources. On the other hand, there is a lack of professionals with theses skills. The authoring tools appear in this scenario in order to reduce the efforts needed to develop interactive applications. Moreover, it should follow the new tendencies of the Web 2.0, where desktop applications are brought to the Web. iTV Project is a authoring tool based on a web environment, whose focus is the rapid development of interactive applications for Digital TV environment.
Sensor selection cost function to increase network lifetime with QoS support
Authors: Ou Yang, Wendi B. Heinzelman
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Single-hop centralized wireless sensor networks are widely used for applications ranging from security and surveillance to medical monitoring. Often the goal of these networks is to provide satisfactory quality of service (QoS) to the application under different system states, but it is difficult to determine how the appropriate sensor sets should be selected over time, given the knowledge of all possible sensor sets to support the application QoS requirements. To address this problem, in this paper we propose a novel cost function called SUI (Sensor Usage Index) that is based on a sensor's relative ideal lifetime (SRIL) and can be used to select sensor sets so as to meet application QoS requirements for extended periods of time. Simulation results show that utilizing the proposed cost function for sensor set selection enables the network to meet application QoS requirements for longer than using other standard sensor selection schemes. In fact, our scheme approaches the optimal network lifetime, which can be found using global knowledge of the sensors and the system dynamics.
Comparing simulation results of SBML capable simulators
Authors: Frank T. Bergmann, Herbert M. Sauro
Venue: Bioinformatics (2008)

Motivation: Simulations are an essential tool when analyzing biochemical networks. Researchers and developers seeking to refine simulation tools or develop new ones would benefit greatly from being able to compare their simulation results. Summary: We present an approach to compare simulation results between several SBML capable simulators and provide a website for the community to share simulation results. Availability: The website with simulation results and additional material can be found under: http://sys-bio.org/sbwWiki/compare. The software used to generate the simulation results is available on the website for download. Contact: fbergman@u.washington.edu
Learning and generalising semantic knowledge from object scenes
Authors: Claire D'Este, Claude Sammut
Venue: Robotics and Autonomous Systems (2008)

The robot described in this paper learns words that relate to objects and their attributes, and also learns concepts, which may be recursive, that involve relationships between several objects. Once the system is explicitly taught some words by a human teacher it finds new objects that might help to refine its concepts. Once it has found a new object, it tries to generalise its concepts to include the new object and asks the teacher for feedback. The robot learns further properties of objects by interacting with them, by touching them or walking around them to gain a new perspective. The system learns semantic knowledge from spoken interactions, using speech recognition and generation, motion segmentation, feature extraction from images using Ripple Down Rules and generalisation using Inductive Logic Programming.
Future tensePester power
Authors: Cory Doctorow
Venue: Communications of the ACM (2008)

Future Tense, one of the revolving features on this page, presents stories from the intersection of computational science and technological speculation, their boundaries limited only by our ability to imagine what will and could be.
Stabilization of Max-Min Fair Networks without Per-flow State
Authors: Jorge A. Cobb, Mohamed G. Gouda
Venue: Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2008)

Let a flow be a sequence of packets sent from a source computer to a destination computer. Routers at the core of the Internet do not maintain any information about the flows that traverse them. This has allowed for great speeds at the routers, at the expense of providing only best-effort service. In this paper, we consider the problem of fairly allocating bandwidth to each flow. We assume some flows request a constant amount of bandwidth from the network. The bandwidth that remains is distributed fairly among the rest of the flows. The fairness sought after is max-min fairness, which assigns to each flow the largest possible bandwidth that avoids affecting other flows. The distinguishing factor to other approaches is that routers only maintain a constant amount of state, which is consistent with trends in the Internet (such as the proposed Differentiated Services Internet architecture). In addition, due to the need for high fault-tolerance in the Internet, we ensure our protocol is self-stabilizing, that is, it tolerates a wide variety of transient faults.
Modeling emotional context from latent semantics
Authors: Michael Kai Petersen, Andrius Butkus
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

In order to extract the atmosphere in media, we model the latent semantics of TV synopses and affective terms as patterns of emotional components. Using a selection of affective last.fm tags and TV-Anytime atmosphere terms as emotional buoys, we apply LSA latent semantic analysis to represent the correlation of terms and descriptions in a vector space that reflects the emotional context. Analyzing the resulting patterns of affective components, we propose that this approach could be applied to automatically generate affective user preferences based on synopsis, subtitles or other textual representations associated with media.
Three-dimensional and two-dimensional deployment analysis for underwater acoustic sensor networks
Authors: Dario Pompili, Tommaso Melodia, Ian F. Akyildiz
Venue: Ad Hoc Networks (2009)

Underwater sensor networks find applications in oceanographic data collection, pollution monitoring, offshore exploration, disaster prevention, assisted navigation, and tactical surveillance. In this paper, deployment strategies for two-dimensional and three-dimensional communication architectures for underwater acoustic sensor networks are proposed, and a mathematical deployment analysis for both architectures is provided. The objective is to determine the minimum number of sensors to be deployed to achieve optimal sensing and communication coverage, which are dictated by application requirements; provide guidelines on how to choose the optimal deployment surface area, given a target body of water; study the robustness of the sensor network to node failures, and provide an estimate of the number of redundant sensor nodes to be deployed to compensate for potential failures.
PRODECOMPv3
Authors: Doroteya K. Staykova, Jonas Fredriksson, Martin Billeter
Venue: Bioinformatics (2008)

Summary: PRODECOMP (projection decomposition) is an implementation of a multi-way decomposition algorithm for the analysis of two-dimensional projections of high-dimensional nuclear magnetic resonance spectra. The newest version, PRODECOMPv3, features a dramatic speedup, more reliable decompositions, a substantial reduction in memory demands, a new graphical user interface and integration into third-party software. These improvements extend the applicability of decompositions to novel types of NMR data on proteins, yielding backbone and side-chain assignments as well as structural information, and therewith enabling complete characterizations of proteins. Availability: Program, short manual and an example calculation are freely available at www2.chem.gu.se/bcbp/nmr/prodecomp.html Contact:doroteya@chem.gu.se;
The existence of solutions of infinite boundary value problems for first-order impulsive differential systems in Banach spaces
Authors: Jing Zhao, Zhenbin Liu, Lishan Liu
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, the existence of solutions of infinite boundary value problems for first-order impulsive differential systems is obtained by means of the Schauder fixed point theorem in a Banach space.
GenoSNP
Authors: Eleni Giannoulatou, Christopher Yau, Stefano Colella, Jiannis Ragoussis, Christopher C. Holmes
Venue: Bioinformatics (2008)

Summary: Current genotyping algorithms typically call genotypes by clustering allele-specific intensity data on a single nucleotide polymorphism (SNP) by SNP basis. This approach assumes the availability of a large number of control samples that have been sampled on the same array and platform. We have developed a SNP genotyping algorithm for the Illumina Infinium SNP genotyping assay that is entirely within-sample and does not require the need for a population of control samples nor parameters derived from such a population. Our algorithm exhibits high concordance with current methods and >99% call accuracy on HapMap samples. The ability to call genotypes using only within-sample information makes the method computationally light and practical for studies involving small sample sizes and provides a valuable independent quality control metric for other population-based approaches. Availability: http://www.stats.ox.ac.uk/~giannoul/GenoSNP/ Contact: cholmes@stats.ox.ac.uk
Hexastore: sextuple indexing for semantic web data management
Authors: Cathrin Weiss, Panagiotis Karras, Abraham Bernstein
Venue: Proceedings of the VLDB Endowment (2008)

Despite the intense interest towards realizing the Semantic Web vision, most existing RDF data management schemes are constrained in terms of efficiency and scalability. Still, the growing popularity of the RDF format arguably calls for an effort to offset these drawbacks. Viewed from a relational-database perspective, these constraints are derived from the very nature of the RDF data model, which is based on a triple format. Recent research has attempted to address these constraints using a vertical-partitioning approach, in which separate two-column tables are constructed for each property. However, as we show, this approach suffers from similar scalability drawbacks on queries that are not bound by RDF property value. In this paper, we propose an RDF storage scheme that uses the triple nature of RDF as an asset. This scheme enhances the vertical partitioning idea and takes it to its logical conclusion. RDF data is indexed in six possible ways, one for each possible ordering of the three RDF elements. Each instance of an RDF element is associated with two vectors; each such vector gathers elements of one of the other types, along with lists of the third-type resources attached to each vector element. Hence, a sextuple-indexing scheme emerges. This format allows for quick and scalable general-purpose query processing; it confers significant advantages (up to five orders of magnitude) compared to previous approaches for RDF data management, at the price of a worst-case five-fold increase in index space. We experimentally document the advantages of our approach on real-world and synthetic data sets with practical queries.