ppxscal/embedding_network huggingface dataset:
Checking Dependent Types Using Compiled Code
Authors: Dirk Kleeblatt
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has drawbacks. We show, how at this stage compiled code can be used for a language with lazy evaluation.
New Perspective for Structural Learning Method of Neural Networks
Authors: Junzo Watada
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

A neural network is developed to mimic a human brain. The neural network consists of units and links that connect between units. Various types of neural networks are categorized into two classes: (1) back-propagation hierarchical neural network and (2) mutual-connected neural network. Generally speaking, it is hard to fix the number of units to build a neural network for solving problems. So the number of units is decided on the basis of experts' experience.In this paper, we explain a learning method how to decide the structure of a neural network for problems. The learning method is named structural learning. Even if we give a sufficient number of units, the optimal structure will be decided in the process of learning.The objective of the paper is to explain the structural learning of both hierarchical and mutual connecting neural networks. Both networks obtained and showed the sufficiently good results. In the stock forecast by a general neural network, the operation and the system cost are very large because a lot of numbers of hidden layer units in the network are used. This research tried the optimization of the network by the structured learning, and evaluated the practicality. ...
Shared focus of attention for heterogeneous agents
Authors: Jacob Beal
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

A network of cooperating agents must be able to reach rough consensus on a set of topics for cooperation. With highly heterogeneous agents, however, incommensurable measures and imprecise translation render ordinary consensus algorithms inappropriate. I present a distributed mechanism for shared focus of attention that begins to address these problems, using an engineered emergence approach inspired by recent results on the dynamics of evolution in systems with spatial extent. Simulation shows that the algorithm converges in time proportional to the diameter of the network and gives a range of reasonable settings for the parameters.
Islands in the MSN messenger buddy network
Authors: Yu Chen, Tracy Chen, Ming Chen, Zheng Zhang
Venue: Proceedings of the 1st Workshop on Social Network Systems (2008)

The MSN messenger buddy network comprises a giant component and many small islands. Being curious about the existence of the small islands, we study their topologies and find that they favor part of the possible topologies. Specifically, fully connected and star-shape topologies become more and more popular as the size of the islands increases. The tendency towards certain topologies suggests specific ways of interactions between users in the islands. Using egonetworks as a tool, we also compare the local structures in islands and those in the giant component. The comparison shows that the giant component ego-networks are larger but sparser than those in the islands. The difference implies different interaction behaviors between users in the islands and the giant component.
Tinkering or Sketching: Apprentices' Use of Tangibles and Drawings to Solve Design Problems
Authors: Patrick Jermann, Guillaume Zufferey, Pierre Dillenbourg
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

The articulation of practice and theory is a central problematic in a dual apprenticeship system that combines working in a company and attending courses at school. Design problems are proposed by teachers as a way to address theoretical concepts in a practical context. The difficulties encountered by apprentices while creating paper based sketches motivated the development of a tabletop warehouse simulation providing apprentices with a Tangible User Interface in the form of a small-scale model. We compare drawings and tangible representational modalities with regards to three phases of design problem solving. Tinkering with tangibles is described as an easy way to engage into the problem. The physical properties of tangibles facilitate the extraction of features relevant for verification. The limited expressiveness of tangibles allows apprentices to focus on the search for a solution rather than on the representation of the problem space.
TopX @ INEX 2007
Authors: Andreas Broschart, Ralf Schenkel, Martin Theobald, Gerhard Weikum
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper describes the setup and results of the Max- Planck-Institut für Informatik's contributions for the INEX 2007 AdHoc Track task. The runs were produced with TopX, a search engine for ranked retrieval of XML data that supports a probabilistic scoring model for full-text content conditions and tag-term combinations, path conditions as exact or relaxable constraints, and ontology-based relaxation of terms and tag names.
Categorizing Images in Web Documents
Authors: Jianying Hu, Amit Bagga
Venue: IEEE MultiMedia (2004)

The Web provides an increasingly powerful and popular publication mechanism. Web documents often contain a large number of images that serve various purposes. Identifying the functional categories of these images is an important task in Web repurposing. This article describes a study on the functional categorization of Web images using data collected from news Web sites.
A Possibilistic Approach for Mining Uncertain Temporal Relations from Diagnostic Evolution Databases
Authors: Francisco Guil, Jose M. Juarez, Roque Marin
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

In this paper we propose a method for building possibilistic temporal constraint networks that better summarizes the huge set of mined timed-stamped sequences from a temporal data mining process. It belongs to the well-known second-order data mining problem, where the vast amount of simple sequences or patterns needs to be summarized further. It is a very important topic because the huge number of temporal associations extracted in the temporal data mining step makes the knowledge discovery process practically unmanageable for human experts. The method is based on the Theory of Evidence of Shafer as a mathematical tool for obtaining the fuzzy measures involved in the temporal network. This work also presents briefly a practical example describing an application of this proposal in the Intensive Care domain.
Integrated Graphic and Computer Modelling, 1 edition
Authors: Adrian Thomas
Venue:  (2008)

Computer languages and computer graphics have become the primary modes of human-computer interaction. This book provides a basic introduction to "Real and Virtual Environment" computer modelling. Graphics models are used to illustrate both the way computer languages are processed and also used to create computer models of graphic displays. Computer languages have been bootstrapped from machine code, to high-level languages such as Java, to animation scripting languages. Integrating graphic and computer models takes this support for programming, design and simulation work, one step further, allowing interactive computer graphic displays to be used to construct computer models of both real and virtual environment systems. The Java language is used to implement basic algorithms for language translation, and to generate graphic displays. It is also used to simulate the behaviour of a computer system, to explore the way programming and design-simulation environments can be put together.
Which Technology Do We Want? Ethical Considerations about Technical Aids and Assisting Technology
Authors: Anne Venter, Gerlinde Renzelberg, Jürgen Homann, Lars Bruhn
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

1976 the Union of the Physically Impaired against Segragation (UPIAS) has published the "Fundamental Principles of Disability" (http://www.leeds. ac.uk/disability-studies/archiveuk/UPIAS/fundamental%20pri-nciples.pdf updated: 5.3.2008) In Great Britain these principles were pivotal for the emergence of the social model of disability, that clearly distinguishes between the terms of impairment and disability. The document describes the technical progress as a requirement for the establishment of Disability Studies (DS) (cf. Oliver 1996, 24). Looked at it that way DS supports and demands technological progress, because it breaks up barriers for disabled people to be able to participate in society and work towards self-determination. Probably the most up to date significance is the so called "Design for All" (as well known as Universal Design, Inclusive Design, Kyoyo-Hin and the like). Technological designs are developed in a way that all people will be able to use the aids, whether they are physically, sensorial or mentally impaired. This is a concept that reinforces the thought of the social model of disability. In so far the technology is orientated towards inclusion. Nevertheless technological development plays an ambivalent role for disabled people. This ambivalence is discussed thoroughly in the article below to deduce ethical claims for research and development (R+D) of technical aids.
Comparing Emotional vs. Envelope Feedback for ECAs
Authors: Astrid Pütten, Christian Reipen, Antje Wiedmann, Stefan Kopp, Nicole C. Krämer
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Opinions in the scientific community differ about what makes an ECA effective. This study investigated whether emotional expressions influence the effectiveness of human-agent-interaction the participants´ emotional status after the experiment. 70 participants took part in a small talk (10 min.) situation with the ECA MAX. We implemented two different types of feedback: emotional feedback (EMO), which provided a feedback about the emotional state of MAX (including smiles and compliments) and envelope feedback (ENV), which provided a feedback about the comprehension of the participants´ contributions and presents MAX as an attentive listener. We found that smiling was the only nonverbal behaviour which was significantly recognized and that the emotional feedback led to increased feelings of interest in the participants. There were no effects with regard to the evaluation of the effectiveness of the conversation.
Recognition of Static Human Gesture Based on Radiant-Projection-Transform and Fourier-Transform
Authors: Zhen Liang, Nongliang Sun, Maoyong Cao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

An algorithm called Radiant-projection-transform (RPT) is introduced to recognize static gesture images in this paper, which devotes a new method for gesture recognition. Through a series of mathematic transform such as normalization and Fourier-transform, the improved RPT features have many excellent characteristics such as translation invariance, scaling invariance and rotation invariance. These features can be used to do study in pattern recognition. We recognize static human gestures with this method in the paper. In the end, some experimentation show that it does good job in the gesture bank.
FlexMAC: a wireless protocol development and evaluation platform based on commodity hardware
Authors: Mei-Hsuan Lu, Peter Steenkiste, Tsuhan Chen
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

Developing and evaluating wireless protocols is challenging because it requires flexible network interface hardware, which is not readily available. To reduce the efforts of conducting realistic wireless experiment, we have developed FlexMAC, a wireless protocol development and evaluation platform based on commodity hardware. FlexMAC targets CSMA wireless protocols and allows customization of functions such as backoff, retransmission, and packet timing. In this demo, we will show that FlexMAC is a useful tool for wireless protocol development. We will demonstrate two projects that are developed using FlexMAC, including a software-based 802.11 implementation and an opportunistic relaying protocol in 802.11.
Routing and scheduling connections in networks that support advance reservations
Authors: Emmanouel (Manos) Varvarigos, Vasileios Sourlas, Konstantinos Christodoulopoulos
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

A key problem in networks that support advance reservations is the routing and time scheduling of connections with flexible starting time and known data transfer size. In this paper we present a multicost routing and scheduling algorithm for selecting the path to be followed by such a connection and the time the data should start and end transmission at each link so as to minimize the reception time at the destination, or optimize some other performance criterion. The utilization profiles of the network links, the link propagation delays, and the parameters of the connection to be scheduled form the inputs to the algorithm. We initially present a scheme of non-polynomial complexity to compute a set of so-called non-dominated candidate paths, from which the optimal path can be found. We then propose two mechanisms to appropriately prune the set of candidate paths in order to find multicost routing and scheduling algorithms of polynomial complexity. We examine the performance of the algorithms in the special case of an Optical Burst Switched network. Our results indicate that the proposed polynomial-time algorithms have performance that is very close to that of the optimal algorithm. We also study the effects network propagation delays and link-state update policies have on performance.
MPI Reduction Operations for Sparse Floating-point Data
Authors: Michael Hofmann, Gudula Rünger
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

This paper presents a pipeline algorithm for MPI_Reduce that uses a Run Length Encoding (RLE) scheme to improve the global reduction of sparse floating-point data. The RLE scheme is directly incorporated into the reduction process and causes only low overheads in the worst case. The high throughput of the RLE scheme allows performance improvements when using high performance interconnects, too. Random sample data and sparse vector data from a parallel FEM application is used to demonstrate the performance of the new reduction algorithm for an HPC Cluster with InfiniBand interconnects.
Impact of Limited Memory Resources
Authors: Dave Binkley, Dawn Lawrie, Steve Maex, Christopher Morrell
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Since early variable mnemonics were limited to as few as six to eight characters, many early programmers abbreviated concepts in their variable names. The past thirty years has seen a steady increase in permitted name length and, slowly, an increase in the actual length of identifiers. However, in theory names can be too long. Most obviously, in object-oriented programs, names often involve chaining of method calls and field selectors (e.g., class.first Assignment().name.trim()). While longer names bring the potential for easier comprehension through more embedded sub-words, there are practical limits to length given limited human memory resources. The central hypothesis studied herein is that names used in modern programs have reached this limit. Statistical models derived from an experiment involving 158 programmers of varying degrees of experience show that longer names extracted from production code take more time to process and reduce correctness in a simple recall activity. This has clear negative implications for any attempt to read, and hence comprehend or manipulate, the source code of modern software. The experiment also evaluates the advantage of identifiers having ties to a programmer's persistent memory. Combined these results reinforce past proposals advocating the use of limited, consistent, and regular vocabulary in identifier names. In particular, good naming limits length and reduces the need for specialized vocabulary.
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
Authors: Wen-Chi Hou, Cheng Luo, Zhewei Jiang, Feng Yan, Qiang Zhu
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have a good energy compaction property and thus can approximate data distribution functions easily with small number of coefficients. The derived estimator is accurate and easy to update. We perform experiments to compare its performance with a well-known technique - the (Haar) wavelet. The experimental results show that the cosine transform performs much better than the wavelet in estimation accuracy, speed, space efficiency, and update easiness.
What's in a Step? Toward General, Abstract Representations of Tutoring System Log Data
Authors: Kurt Vanlehn, Kenneth R. Koedinger, Alida Skogsholm, Adaeze Nwaigwe, Robert G. Hausmann, Anders Weinstein, Benjamin Billings
Venue: Proceedings of the 11th international conference on User Modeling (2007)

The Pittsburgh Science of Learning Center (PSLC) is developing a data storage and analysis facility, called DataShop. It currently handles log data from 6 full-year tutoring systems and dozens of smaller, experimental tutoring systems. DataShop requires a representation of log data that supports a variety of tutoring systems, atheoretical analyses and theoretical analyses. The theory-based analyses are strongly related to student modeling, so the lessons learned in developing the DataShop's representation may apply to student modeling in general. This report discusses the representation originally used by the DataShop, the problems encountered, and how the key concept of "step" evolved to meet these challenges.
Suitable representations of hyperlinks for deaf persons: an eye-tracking study
Authors: Miki Namatame, Muneo Kitajima
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

This paper reports an eye-tracking experiment conducted to compare alternative representations of directories typically shown on web pages in search of a best representation for deaf persons. The experiment simulated a directory-based information search task to understand how it is performed when directories are represented in text, labeled-pictograms, or unlabeled-pictograms. Twenty-one deaf and 21 hearing participants were asked to select one of 27 directories represented in one of the three alternative formats for each of 38 queries. The result demonstrated that only in the labeled-pictogram representation, the hearing group and the deaf group performed equally well in terms of the eye movement measures.
Software Engineering: Ugo Montanari's Main Contributions and Introduction to the Section
Authors: Stefania Gnesi
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Ugo Montanari began to work in software engineering related topics in the early eighties when he started to promote the use of formal techniques in industries. In that period Ugo established a strong cooperation mainly with Olivetti, that was for more than a decade a very active italian ICT company.Those were also the years when the first Progetto Finalizzato Informatica started and in this contextUgo chaired the P1 subproject, "IndustriaNazionale del settore: Architettura e Struttura dei Sistemi di Elaborazione" whose aims were: i) the development of a prototypical local network meant also to be used to develop software products for the public administration; ii) the realization of a prototypical micro processor with dependability, availability and reconfigurability characteristics to be employed for industrial automation; iii) the development of methods and software programs to be used as basis for the software production.
An Involuntary Muscular Response Induced by Perceived Visual Errors in Hand Position
Authors: David W. Franklin, Udell So, Rieko Osu, Mitsuo Kawato
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

The visually induced corrective motor responses of hand position during reaching movements were investigated. Subjects performed reaching movements on a robotic manipulandum where the hand position was presented to the subjects by means of a projected display. On random reaching trials the projected hand position was perturbed relative to the actual hand position while the hand was constrained to the straight line to the target. Electromyographic activity of eight arm muscles were collected. A corrective muscular response starting at 150 ms from the onset of the visual perturbation was found. This response was found to be reflexive in nature and not suppressed by prior instruction. A second study found that the reflexive response was not modified by changes in the background muscle activity level or by the size of the perturbation. The results suggest that the visual system elicits simple motor reflexes in response to visual errors from the expected hand position.
New Anonymity Notions for Identity-Based Encryption
Authors: Malika Izabachène, David Pointcheval
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

Identity-based encryption is a very convenient tool to avoid key management. Recipient-privacy is also a major concern nowadays. To combine both, anonymous identity-based encryption has been proposed. This paper extends this notion to stronger adversaries (the authority itself). We discuss this new notion, together with a new kind of non-malleability with respect to the identity, for several existing schemes. Interestingly enough, such a new anonymity property has an independent application to password-authenticated key exchange. We thus come up with a new generic framework for password-authenticated key exchange, and a concrete construction based on pairings.
Error Prediction-Based Semi-automatic Segmentation of Speech Databases
Authors: Marcin Szymański, Stefan Grocholewski
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The manual segmentation of speech databases still outperforms the automatic segmentation algorithms and, at the same time, the quality of resulting synthetic voice depends on the accuracy of the phonetic segmentation. In this paper we describe a semi-automatic speech segmentation procedure, in which a human expert manually allocates the selected boundaries prior to the automatic segmentation of the rest of the corpus. Segmentation error predictor is designed, estimated and then used to generate a sequence of manual annotations done by an expert. The obtained error response curves are significantly better than random segmentation strategies. The results are presented for two different Polish corpora.