ppxscal/embedding_network huggingface dataset:
Least-squares linear filtering using observations coming from multiple sensors with one- or two-step random delay
Authors: J. Linares-Pérez, A. Hermoso-Carazo, R. Caballero-Águila, J. D. Jiménez-López
Venue: Signal Processing (2009)

This paper discusses the least-squares linear filtering problem of discrete-time signals using observations from multiple sensors which can be randomly delayed by one or two sampling times. It is assumed that, at each sensor, the signal is measured in the presence of additive white noise, that the Bernoulli random variables modelling the delays are independent and that the delay probabilities are not necessarily the same for all the sensors. A recursive filtering algorithm is proposed, and derivation of this does not require knowledge of the signal state-space model, but only the covariance functions of the processes involved in the observation equation of each sensor, as well as the delay probabilities. Recursive expressions for the filtering error covariance matrices are also provided, and the performance of the proposed estimator is illustrated by a numerical simulation example in which a scalar signal is estimated from one- or two-step randomly delayed observations from two sensors with different delay characteristics.
Deleting files in the Celeste peer-to-peer storage system
Authors: Gal Badishi, Germano Caronni, Idit Keidar, Raphael Rom, Glenn Scott
Venue: Journal of Parallel and Distributed Computing (2009)

Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the development of Celeste, we faced the challenge of complete object deletion, and moreover, of deleting ''files'' composed of several different objects. This important problem is not solved by merely deleting meta-data, as there are scenarios in which all file contents must be deleted, e.g., due to a court order. Complete file deletion in a realistic peer-to-peer storage system has not been previously dealt with due to the intricacy of the problem - the system may experience high churn rates, nodes may crash or have intermittent connectivity, and the overlay network may become partitioned at times. We present an algorithm that eventually deletes all file contents, data and meta-data, in the aforementioned complex scenarios. The algorithm is fully functional and has been successfully integrated into Celeste.
Rubyric: an online assessment tool for effortless authoring of personalized feedback
Authors: Tapio Auvinen, Ville Karavirta, Tuukka Ahoniemi
Venue: ACM SIGCSE Bulletin (2009)

Writing feedback can be very time-consuming on large Computer Science courses. Evolving from years of research on computer-assisted grading tools, we present the Rubyric assessment tool which allows graders to effortlessly construct feedback with reusable phrases. The tool can be used to facilitate the manual assessment of assignments varying from essays to programming projects.
Plenary lecture 1: software risk management through a shared approach
Authors: Khairuddin Hashim
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

Data on past and current problems in software development and their solutions are scarce. Software development problems cover a wide spectrum including aspects of processes and resources. Organizations do not want to reveal the software development problems they face and their outcomes due to obvious ramifications. Problems recur and solutions are many and varied. Mistakes are repeated due to unavailability of documentation on effective practices and measures. Not much is shared although the benefit of sharing is known. This presentation will discuss a risk management model with a unique shared approach towards effective sharing of problems and solutions by organizations without compromising on anonymity. Analysis of historical data provides useful information on potential problems and facilitates effective risk management of the software development process.
Structure preserving embedding
Authors: Blake Shaw, Tony Jebara
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Structure Preserving Embedding (SPE) is an algorithm for embedding graphs in Euclidean space such that the embedding is low-dimensional and preserves the global topological properties of the input graph. Topology is preserved if a connectivity algorithm, such as k-nearest neighbors, can easily recover the edges of the input graph from only the coordinates of the nodes after embedding. SPE is formulated as a semidefinite program that learns a low-rank kernel matrix constrained by a set of linear inequalities which captures the connectivity structure of the input graph. Traditional graph embedding algorithms do not preserve structure according to our definition, and thus the resulting visualizations can be misleading or less informative. SPE provides significant improvements in terms of visualization and lossless compression of graphs, outperforming popular methods such as spectral embedding and Laplacian eigen-maps. We find that many classical graphs and networks can be properly embedded using only a few dimensions. Furthermore, introducing structure preserving constraints into dimensionality reduction algorithms produces more accurate representations of high-dimensional data.
Performance Analysis of IEEE 802.11b Wireless Networks with Object Oriented Petri Nets
Authors: Aladdin Masri, Thomas Bourdeaud'huy, Armand Toguyeni
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Communication protocols are often investigated using simulation. This paper presents a performance study of the distributed coordination function of 802.11 networks. Firstly, our study illustrates the different classes of Petri Nets used for modeling network protocols and their robustness in modeling based on formal methods. Next we propose a detailed 802.11b model based on Object-oriented Petri Nets that precises backoff procedure and time synchronization. Then, performance analyses are evaluated by simulation for a dense wireless network and compared with other measurements approaches. Our main goal is to propose a modular model that will enable to evaluate the impact of network performances on the performances of distributed discrete event systems.
Text retrieval from early printed books
Authors: Simone Marinai
Venue: Proceedings of The Third Workshop on Analytics for Noisy Unstructured Text Data (2009)

We describe a text indexing and retrieval technique that does not rely on word segmentation and is tolerant to errors in character segmentation. The method is designed to process early printed documents and we evaluate it on the well known Latin Gutenberg Bible. The approach relies on two main components. First, character objects (in most cases corresponding to individual characters) are extracted from the document and clustered together, so as to assign a symbolic class to each indexed object. Second, a query word is compared against the indexed character objects with a Dynamic Time Warping (DTW) based approach. The peculiarity of the matching technique described in this paper is the incorporation of sub-symbolic information in the string matching process. In particular, we take into account the estimated widths of potential subwords that are computed by accumulating lengths of partial matches in the DTW array.
Blood Detection In IVUS Longitudinal Cuts Using AdaBoost With a Novel Feature Stability Criterion
Authors: David Rotger, Petia Radeva, Eduard Fernández-Nofrerías, Josepa Mauri
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Lumen volume variations is of great interest by the physicians given the more it increases with a treatment the less probability of infarction. In this paper we present a fast and efficient method to detect the lumen borders in longitudinal cuts of IVUS sequences using an AdaBoost classifier trained with several local features assuring their stability. We propose a criterion for feature selection based on stability leave-one-out cross validation. Results on the segmentation of 18 IVUS pullbacks show that the proposed procedure is fast and robust leading to 90% of time reduction with the same characterization performance.
Political Engagement Through Tools for Argumentation
Authors: Dan Cartwright, Katie Atkinson
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

In this paper we discuss the development of tools to support a system for e-democracy that is based upon and makes use of existing theories of argument representation and evaluation. The system is designed to gather public opinions on political issues from which conclusions can be drawn concerning how government policies are presented, justified and viewed by the users of the system. We describe how the original prototype has been augmented by the addition of well motivated tools to enable it to handle multiple debates and to provide analyses of the opinions submitted, from which it is possible to pinpoint specific grounds for disagreement on an issue. The tool set now supports both argumentation schemes and argumentation frameworks to provide representation and evaluation facilities. We contrast our system with existing fielded approaches designed to facilitate public consultation on political issues and show the particular benefits that our approach can bring in attempting to improve the quality of such engagement online.
Fabrication and characterization of a polymethyl methacrylate continuous-flow PCR microfluidic chip using CO2 laser ablation
Authors: Heng Qi, Xiansong Wang, Tao Chen, Xuemei Ma, Tiechuan Zuo
Venue: Microsystem Technologies (2009)

An improved microfabrication method was used to fabricate a continuous-flow PCR (polymerase chain reaction) microfluidic chip on the PMMA substrate using the low-power CO2 laser ablation technique. The use of the low-power CO2 laser and the PMMA material could reduce the cost and the time of the fabrication process, especially at the step of laboratory research because of the high flexibility of the laser fabrication technique and the low cost of PMMA. A CO2 laser output power of 4.5&#x00a0;W and a laser scanning velocity of 76.2&#x00a0;mm/s were chosen to fabricate the chip in this work. The micromachining quality could satisfy the microfluidic requirement of the PCR mixture within the microchannel. Good temperature distribution and gradient were obtained on the PMMA chip with a home-built integrated heating system. An amplification of DNA template with a 990 base pair fragment of Pseudomonas was successfully performed with this chip to characterize its availability and performance with various flow rates.
Finite-Time Boundedness Analysis of a Class of Neutral Type Neural Networks with Time Delays
Authors: Jianfeng Wang, Jigui Jian, Peng Yan
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this paper, the finite time boundedness (FTB) for certain and uncertain neutral type neural networks are investigated. The concept of FTB for time delay system is extended first. Then, based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, some sufficient conditions are derived to guarantee FTB, and our results are less conservative than exiting results. Finally, some examples are given to demonstrate the effectiveness and improvement of the proposed results.
Tool selection-embedded optimal assembly planning in a dynamic manufacturing environment
Authors: Chulho Chung, Qingjin Peng
Venue: Computer-Aided Design (2009)

This paper presents an approach for tool selection-embedded optimal assembly planning in dynamic manufacturing environments. It aims to embed assembly tools into the planning process of assembly sequences in a dynamic shop-floor. The experimental results demonstrate that the developed approach is efficient and practical for a high fidelity assembly sequence with alternatives of assembly-tool sets. The dynamic assembly planning can efficiently support product assembly by generating feasible assembly sequences. It provides an effective design-aiding tool to virtually deal with various what-if scenarios regarding product assembly. In particular, the Web-based application developed in this research can be incorporated into a high-performance design and manufacturing environment on the Web, forming a distributed, collaborative and globally networked tool for product assembly planning.
Design and implementation of an agent-based collaborative product design system
Authors: Jian Xun Wang, Ming Xi Tang, Lin Nan Song, Shou Qiang Jiang
Venue: Computers in Industry (2009)

The evolution of computer science and technology has brought new opportunities for multidisciplinary designers and engineers to collaborate with each other in a concurrent and coordinated manner. The development of computational agents with unified data structures and software protocols contributes to the establishment of a new way of working in collaborative design, which is increasingly becoming an international practice. In this paper, based on the analysis of the dynamic nature of collaborative design process, a new framework for collaborative design is described. This framework adopts an agent-based approach and relocates designers, managers, systems, and the supporting agents in a unified knowledge representation scheme for product design. In order to model the constantly evolving design process and the rationales resulted from design collaboration, a Collaborative Product Data Model (CPDM) and a constraint-based Collaborative Design Process Model (CDPM) are proposed to facilitate the management and coordination of the collaborative design process as well as design knowledge management. A prototype system of the proposed framework is implemented and its feasibility is evaluated using a real design scenario whose objective is designing a set of dining table and chairs.
Computation, Interaction and Imagination: Into Virtual Space and Back to Reality
Authors: Ernest Edmonds, Linda Candy
Venue: Proceeding of the 2005 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fourth SoMeT_W05 (2005)

The main aim of the research from which this paper arises is to identify requirements of computer support for creative work by investigating the work of artists and exploring the potential of new creative technology in this field. The paper reports upon an experimental artists-in-residence on the campus of Loughborough University during which events were recorded and analysed. The nature of the interchanges between artist and technologist as well as the artists' perspectives upon the use of the technologies and what they gained from it are described. One significant conclusion is that the influence of using computers on the artists' thinking is quite as significant as any direct outcome in terms of product. The enabling of creative transformations is a key aspect. The paper poses three questions and tries to find an answer to each by exploring the modelling of the results of the study in the context of what we know so far about computational approaches to understanding creativity. The results demonstrate that one aspect of VR may be understood in relation to previous studies of emergence.
Projective expected utility: a subjective formulation
Authors: Pierfrancesco La Mura
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

Motivated by classical decision-theoretic paradoxes (Allais 1953, Ellsberg 1961), we introduce a projective generalization of expected utility along the lines of the quantum-mechanical generalization of probability theory. The resulting decision theory accommodates the paradoxes, while retaining significant simplicity and tractability. In particular, every finite game within this larger class of preferences still has an equilibrium.
Design and Analysis of Simulation Experiments, 1st edition
Authors: Jack P. C. Kleijnen
Venue:  (2007)

Design and Analysis of Simulation Experiments (DASE)focuses on statistical methods for discrete-event simulation (such as queuing and inventory simulations). In addition, the book discusses DASE for deterministic simulation (such as engineering and physics simulations). The text presents both classic and modern statistical designs. Classic designs (e.g., fractional factorials) assume only a few factors with a few values per factor. The resulting input/output data of the simulation experiment are analyzed through low-order polynomials, which are linear regression (meta) models. Modern designs allow many more factors, possible with many values per factor. These designs include group screening (e.g., Sequential Bifurcation, SB) and space filling designs (e.g., Latin Hypercube Sampling, LHS). The data resulting from these modern designs may be analyzed through low-order polynomials for group screening and various metamodel types (e.g., Kriging) for LHS. Design and Analysis of Simulation Experimentsis an authoritative textbook and reference work for researchers, graduate students, and technical practitioners in simulation. Basic knowledge of simulation and mathematical statistics are expected; however, the book does summarize these basics, for the readers' convenience. In addition, the book provides relatively simple solutions for (a) selecting problems to simulate, (b) how to analyze the resulting data from simulation, and (c) computationally challenging simulation problems. 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
Privacy in location-based services: a system architecture perspective
Authors: Chi-Yin Chow, Mohamed F. Mokbel
Venue: SIGSPATIAL Special (2009)

Location-based services (LBS, for short) are information and entertainment services that are conveniently accessible by mobile users through GPS-enabled portable devices and mobile networks (e.g., 2G/3G cellular telephone and Wi-Fi networks). Examples of LBS include resource finding (e.g., where is my nearest gas station), route finding (e.g., what is the shortest route from my current location to a shopping mall, social networking (e.g., where are my friends), and location-based gaming (e.g., GPS online game). LBS rely mainly on an implicit assumption that mobile users are willing to reveal their private locations. With untrustworthy LBS providers, the revealed private location information could be abused by adversaries. For example, an adversary may infer a user's medical record by knowing that she regularly visits a specialized clinic. There are already several life scenarios that took place where personal GPS locations are abused, e.g., see [8, 27, 28].
ADML: a framework for representing inhabitants in 3D virtual worlds
Authors: David Oyarzun, Amalia Ortiz, Maria del Puy Carretero, Jean Gelissen, Alex Garcia-Alonso, Yesha Sivan
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

Last years, a new fashion over Internet and computer networks has been established: the 3D virtual worlds. Reports about Future Internet predict virtual worlds will play a major role in the configuration of the future network. They bet on those virtual environments will encompass the ability to become highly adaptive to user preferences (having into account eInclusion aspects), and they will provide a high level of interoperability. However, current 3D virtual worlds are far from cover these issues. This work is focused in providing a preliminary solution about customization and interoperability in the field of avatars representation. They are a key element in the 3D virtual worlds because using 3D avatars is a common way for representing virtual world inhabitants. First of all, nowadays there is not a way for defining all the avatar features that are important for simulating a real person, and for defining their identity. Besides, features that can be specified are usually defined in a closed and proprietary format that does not allow migration among virtual worlds. Thirdly, eInclusion aspects are not taken into account. This work proposes a preliminary framework for specifying a complete avatar identity by means of features that are not dependent on the virtual world context or interaction events. Those are appearance, personality and communication skills. Moreover, for providing a tool that describes the framework, the base for a new XML-based language --ADML-- has been created. The language will allow specify avatar identity features taking into account eInclusion aspects and it will allow migration among worlds. Part of this language has been accepted into the new MPEG-V standard proposal.
Electrodes selection for microsleeps detection by classification of EEG spectrograms
Authors: David Coufal
Venue: Proceedings of the 2nd conference on European computing conference (2008)

In the paper we focus on discrimination between electrodes which are used for EEG signals recording and subsequent detection of car drivers' vigilance levels. The detection is based on the classification of EEG spectrograms which are recorded from 19 electrodes spread over driver's head. We are interested in the selection of a small subset of the most discriminating electrodes for each level. Especially, we are aimed on detection of hazardous states of microsleeps. The selection of electrodes was performed by means of GUHA data mining method and for classification we employed C4.5 classification algorithm.
Tolerating latency in replicated state machines through client speculation
Authors: Benjamin Wester, James Cowling, Edmund B. Nightingale, Peter M. Chen, Jason Flinn, Barbara Liskov
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

Replicated state machines are an important and widely-studied methodology for tolerating a wide range of faults. Unfortunately, while replicas should be distributed geographically for maximum fault tolerance, current replicated state machine protocols tend to magnify the effects of high network latencies caused by geographic distribution. In this paper, we examine how to use speculative execution at the clients of a replicated service to reduce the impact of network and protocol latency. We first give design principles for using client speculation with replicated services, such as generating early replies and prioritizing throughput over latency. We then describe a mechanism that allows speculative clients to make new requests through replica-resolved speculation and predicated writes. We implement a detailed case study that applies this approach to a standard Byzantine fault tolerant protocol (PBFT) for replicated NFS and counter services. Client speculation trades in 18% maximum throughput to decrease the effective latency under light workloads, letting us speed up run time on single-client micro-benchmarks 1.08-19× when the client is co-located with the primary. On a macro-benchmark, reduced latency gives the client a speedup of up to 5×.
Estimation for Speed and Leakage Power of Dual Threshold Domino OR Based on Wavelet Neural Networks
Authors: Jinhui Wang, Lei Zuo, Na Gong, Daming Gao, Shuqin Geng, Wang Zhang, Ligang Hou, Xiaohong Peng, Wuchen Wu
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

An approach for estimating the leakage power and the speed of the dual threshold domino OR gates based on Wavelet Neural Networks (WNN) in 45 nm technology is proposed. The estimating system has fast convergence and high precision. By studying the impact of the dual threshold voltage technique (DTV) on leakage reduction and delay increase, it successfully estimates the nonlinear changing of the leakage power and delay of the different inputs domino OR gates. At last, the reason for the estimating error and the trend of the estimating curve are explained, respectively.