ppxscal/embedding_network huggingface dataset:
Tomographic Dual Modality Breast Scanner
Authors: Mark B. Williams, Patricia G. Judy, Mitali J. More, Jennifer A. Harvey, Stan Majewski, James Proffitt, John Mckisson, Alexander Stolin, Brian Kross, Alexander Stewart, Edward Bullard, Manish Kankaria, Roman Janer
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

We are developing a breast scanner that obtains co-registered dual modality tomographic images of the breast using x-ray imaging (digital breast tomosynthesis) and gamma emission imaging (limited angle breast SPECT). The project is a collaborative effort among the Jefferson Lab (Newport News, VA), Dexela Ltd., (Sudbury MA), and the University of Virginia (UVa) (Charlottesville, VA). The scanner is currently undergoing pilot clinical evaluation at UVa's Breast Care Center. Here we report on the design of the scanner, choice of acquisition parameters, and present some early phantom and human breast images.
Intersection types in Java
Authors: Martin Plümicke
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

In the past we analyzed typeless Java programs. One of our results was, that there may be different correct typings for one method. This means that the principal types of such methods are intersection types. We presented a type-inference algorithm. For typeless Java methods the algorithm infers its principal intersection type. Unfortunately, like Java byte-code, Java does not allow intersection types. In this paper we present an algorithm, which resolves intersection types of Java methods, such that Java programs with standard typings are generated. In the algorithm we have to differentiate two cases of intersection types. On the one hand there are methods with intersection types, where for all types the same code is executed. On the other hand there are methods, which call in dependence to its typings different methods. These two cases have to be treated differently during type resolving. Finally, we will see that this differentiation leads to a refined definition of Java method principal types.
Local Rephrasing Suggestions for Supporing the Work of Writers
Authors: Aurélien Max
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

In this article, we present a framework for obtaining rephrasings for short text spans. Good candidates include paraphrases, but also more generally phrases that could help a writer revise a text with some shifts in meaning. The presented framework uses as its knowledge source bilingual aligned phrases learnt from parallel corpora. We present several models for selecting rephrasings, and we evaluate the selection power of candidate rephrasings on grammaticality, meaning preservation and authoring value. The approach is then discussed and future work is described.
EEG-Related Changes in Cognitive Workload, Engagement and Distraction as Students Acquire Problem Solving Skills
Authors: Ronald H. Stevens, Trysha Galloway, Chris Berka
Venue: Proceedings of the 11th international conference on User Modeling (2007)

We have begun to model changes in electroencephalography (EEG)-derived measures of cognitive workload, engagement and distraction as individuals developed and refined their problem solving skills in science. For the same problem solving scenario(s) there were significant differences in the levels and dynamics of these three metrics. As expected, workload increased when students were presented with problem sets of greater difficulty. Less expected, however, was the finding that as skills increased, the levels of workload did not decrease accordingly. When these indices were measured across the navigation, decision, and display events within the simulations significant differences in workload and engagement were often observed. Similarly, event-related differences in these categories across a series of the tasks were also often observed, but were highly variable across individuals.
Temporal Logics for Representing Agent Communication Protocols
Authors: Ulle Endriss
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to specify the conventions of social interaction, rather than making reference to the mental states of agents. Model checking can be used to check the conformance of a given dialogue between agents to a given protocol expressed in a suitable temporal logic. We begin by showing how simple protocols, such as those typically presented as finite automata, can be specified using a fragment of propositional linear temporal logic. The full logic can also express concepts such as future dialogue obligations (or commitments). Finally, we discuss how an extended temporal logic based on ordered trees can be used to specify nested protocols.
Using On-Line Tutorials in Introductory IT Courses
Authors: Bent Thomsen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

Many universities offer introductory IT courses covering an introduction to programming and the use of applications such as spreadsheets, presentation tools, word processing and databases. Teaching such introductory IT courses is, for many Computer Science lecturers, an extremely difficult task. The pedagogical challenges include institutional setup, reduced teaching resources, the perceived ease of IT, a growing number of students, a reduced student effort and a growing motivational gap. Although applications have become easier to use, they have also become more advanced with a growing list of advanced features. Similarly, programming technology has improved with new programming languages such as Java, but the fundamental concept of programming is still difficult to grasp for many students. This chapter reports on two pedagogical experiments using on-line tutorials in combination with lectures and hands-on exercises. Although it is still the early days, the results seem to suggest that the approach could contribute to establishing a best -practice for courses of this nature. The approach seems especially suited for motivating and activating the growing number of students whose will to learn is low, the so-called "minimalist students".
On the expressiveness of implicit provenance in query and update languages
Authors: Peter Buneman, James Cheney, Stijn Vansummeren
Venue: ACM Transactions on Database Systems (TODS) (2008)

Information describing the origin of data, generally referred to as provenance, is important in scientific and curated databases where it is the basis for the trust one puts in their contents. Since such databases are constructed using operations of both query and update languages, it is of paramount importance to describe the effect of these languages on provenance. In this article we study provenance for query and update languages that are closely related to SQL, and compare two ways in which they can manipulate provenance so that elements of the input are rearranged to elements of the output: implicit provenance, where a query or update only provides the rearranged output, and provenance is provided implicitly by a default provenance semantics; and explicit provenance, where a query or update provides both the output and the description of the provenance of each component of the output. Although explicit provenance is in general more expressive, we show that the classes of implicit provenance operations expressible by query and update languages correspond to natural semantic subclasses of the explicit provenance queries. One of the consequences of this study is that provenance separates the expressive power of query and update languages. The model is also relevant to annotation propagation schemes in which annotations on the input to a query or update have to be transferred to the output or vice versa.
Ushering in a New Era of Algorithm Design
Authors: Bernard Chazelle
Venue: Proceedings of the 34th international colloquium on Automata, Languages and Programming (2007)

Advances in data acquisition technology, together with the imminent demise of Moore's Law, are prompting a rethink of basic algorithm design principles. Computing with massive data sets, data streaming, coping with uncertainty, priced computation, property testing, and sublinear algorithms are all parts of the story. So is the growing trend toward using algorithms as modeling tools for natural phenomena. I will discuss some of these developments; in particular, dimension reduction, sublinear algorithms, online reconstruction, and self-improving algorithms.
On the effectiveness of early life cycle defect prediction with Bayesian Nets
Authors: Norman Fenton, Martin Neil, William Marsh, Peter Hearty, Łukasz Radliński, Paul Krause
Venue: Empirical Software Engineering (2008)

Standard practice in building models in software engineering normally involves three steps: collecting domain knowledge (previous results, expert knowledge); building a skeleton of the model based on step 1 including as yet unknown parameters; estimating the model parameters using historical data. Our experience shows that it is extremely difficult to obtain reliable data of the required granularity, or of the required volume with which we could later generalize our conclusions. Therefore, in searching for a method for building a model we cannot consider methods requiring large volumes of data. This paper discusses an experiment to develop a causal model (Bayesian net) for predicting the number of residual defects that are likely to be found during independent testing or operational usage. The approach supports (1) and (2), does not require (3), yet still makes accurate defect predictions (an R 2 of 0.93 between predicted and actual defects). Since our method does not require detailed domain knowledge it can be applied very early in the process life cycle. The model incorporates a set of quantitative and qualitative factors describing a project and its development process, which are inputs to the model. The model variables, as well as the relationships between them, were identified as part of a major collaborative project. A dataset, elicited from 31 completed software projects in the consumer electronics industry, was gathered using a questionnaire distributed to managers of recent projects. We used this dataset to validate the model by analyzing several popular evaluation measures (R 2, measures based on the relative error and Pred). The validation results also confirm the need for using the qualitative factors in the model. The dataset may be of interest to other researchers evaluating models with similar aims. Based on some typical scenarios we demonstrate how the model can be used for better decision support in operational environments. We also performed sensitivity analysis in which we identified the most influential variables on the number of residual defects. This showed that the project size, scale of distributed communication and the project complexity cause the most of variation in number of defects in our model. We make both the dataset and causal model available for research use.
The Informational Content of Canonical Disjoint NP-Pairs
Authors: Christian Glaßer, Alan L. Selman, Liyu Zhang
Venue: Proceedings of the 13th Annual international conference on Computing and Combinatorics (2007)

We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between their canonical pairs. We focus on the opposite direction and study the following questions. Q1: Where does the implication hold, and where does it fail? Q2: Where can we find proof systems of different strengths, but equivalent canonical pairs? Q3: What do (non-)equivalent canonical pairs tell about the corresponding proof systems? Q4: Is every NP-pair (A,B), where A is NP-complete, strongly many-one equivalent to the canonical pair of some proof system? In short, we show that both parts of Q1 and Q2 can be answered with `everywhere', which generalize previous results by Pudlák and Beyersdorff. Regarding Q3, inequivalent canonical pairs tell that the proof systems are not "very similar", while equivalent, P-inseparable canonical pairs tell that they are not "very different". We can relate Q4 to the open problem in structural complexity that asks whether unions of disjoint NP-complete sets are NP-complete. This demonstrates a new connection between proof systems, disjoint NP-pairs, and unions of disjoint NP-complete sets.
Implementation of the Conformance Relation for Incremental Development of Behavioural Models
Authors: Hong-Viet Luong, Thomas Lambolais, Anne-Lise Courbis
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

In this paper, we show how to implement the conformance relation on transition systems. The computability of this relation relies on the composition of two operators: the reduction relation whose computability has been proven in our previous work, and the merge function of acceptance graphs associated with transition systems under comparison. It is formally demonstrated, and illustrated through a case study whose analysis is performed by a Java prototype we have developed. This research work is developed in order to be applied in a larger context: our goal is to support modelers to develop UML state machines through an incremental modelling method which is able to guarantee that model upgrading does not introduce inconsistencies. Hence, these works lead to a semantics for the specialisation relation between UML State Machines.
Human-computer interaction design with multi-goal facilities layout model
Authors: S. K. Peer, Dinesh K. Sharma
Venue: Computers Mathematics with Applications (2008)

Both qualitative and quantitative multiple goals (or factors) are handled in the objective function of a quadratic assignment model to formulate a multi-goal layout problem. A quadratic assignment model deals with facilities layout problems, assigning 'n' facilities to 'n' mutually exclusive locations by either construction or improvement procedures so that the objective of minimization of cost (or flow) is attained. In this paper, we propose an alternate approach to an existing approach that handles the sum of distance-weighted closeness relationships and distance-weighted interactions assigned relative weights in the objective function. In our approach, the sum of distance-weighted congruent objectives of normalized weighted closeness relationships and distance-weighted normalized weighted interactions are handled in the objective function. Then a two-step procedure containing construction and improvement procedures of pair-wise exchange process is used to obtain the layouts. The layouts obtained in an existing approach are evaluated with respect to the attributes of the objective function criteria values in the proposed approach. The proposed multi-goal facilities layout model is used here for the user interface components layout problem. The results of both the approaches are compared for the example task under consideration.
Improved Parameterized Algorithms for Weighted 3-Set Packing
Authors: Jianxin Wang, Qilong Feng
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Packing problems form an important class of NP-hard problems. For the weighted 3-Set Packing problem, we provide further theoretical study on the problem and present a deterministic algorithm of time O *(10.63k ). Based on the randomized divide-and-conquer method, the above result can be further reduced to O *(7.563k ), which significantly improves the previous best result O *(12.83k ).
Support Technique for Real-Time Captionist to Use Speech Recognition Software
Authors: Shigeki Miyoshi, Hayato Kuroki, Sumihiro Kawano, Mayumi Shirasawa, Yasushi Ishihara, Masayuki Kobayashi
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Deaf or hard-of-hearing students who attend lessons at university acquire much less information than students with normal hearing. The captionist (transcriptionist) listens to the teacher and "re-speaks" (repeats exactly what is heard) what the teacher says. The clear and distinct speech that is repeated by the captionist is sent to the automatic speech recognition (ASR) software installed on a personal computer, which performs "speech-to-text conversion". However, it is not easy to "re-speak". The results of the research suggest that listening through headphones with superior sound-proofing features enables captionists to sustain re-speak ability compared with listening directly. These facts indicate that the recognition accuracy of existing ASR technologies could be maintained.
User Oriented Hierarchical Information Organization and Retrieval
Authors: Korinna Bade, Marcel Hermkes, Andreas Nürnberger
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

In order to organize huge document collections, labeled hierarchical structures are used frequently. Users are most efficient in navigating such hierarchies, if they reflect their personal interests. Thus, we propose in this article an approach that is able to derive a personalized hierarchical structure from a document collection. The approach is based on a semi-supervised hierarchical clustering approach, which is combined with a biased cluster extraction process. Furthermore, we label the clusters for efficient navigation. Besides the algorithms itself, we describe an evaluation of our approach using benchmark datasets.
Bringing haptics to Second Life
Authors: Maurizio de Pascale, Sara Mulatto, Domenico Prattichizzo
Venue: Proceedings of the 2008 Ambi-Sys workshop on Haptic user interfaces in ambient media systems (2008)

Current and potential applications of online virtual worlds are attracting the interest of many researchers around the world. One and perhaps the most famous example of such systems is Linden Lab's Second Life. Recently, sources for its client application have been released under the GPL license, allowing anyone to extend it and build a modified client. This work presents an effort to explore the possibilities that haptic technologies can offer to multiuser online virtual worlds, to provide users with an easier, more interactive and immersive experience. A haptic-enabled version of the Second Life Client, supporting major haptic devices, is proposed. Two haptic-based input modes have been added which help visually impaired people to navigate and explore the simulated 3D environment by exploiting force feedback capabilities of these devices.
The HUMAINE Database: Addressing the Collection and Annotation of Naturalistic and Induced Emotional Data
Authors: Ellen Douglas-Cowie, Roddy Cowie, Ian Sneddon, Cate Cox, Orla Lowry, Margaret Mcrorie, Jean-Claude Martin, Laurence Devillers, Sarkis Abrilian, Anton Batliner, Noam Amir, Kostas Karpouzis
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

The HUMAINE project is concerned with developing interfaces that will register and respond to emotion, particularly pervasive emotion (forms of feeling, expression and action that colour most of human life). The HUMAINE Database provides naturalistic clips which record that kind of material, in multiple modalities, and labelling techniques that are suited to describing it.
Hierarchy Encoding with Multiple Genes
Authors: Martin Bommel, Ping Wang
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Efficient implementation of type inclusion testing is important for data and knowledge base systems employing large hierarchies. The bit vector encoding of a partially ordered set representing a type hierarchy permits constant-time type inclusion testing. Current such methods employ a simple encoding, associating a single gene for each join-irreducible element. We present an algorithm using multiple genes for those elements with many siblings. The new algorithm provides a significant improvement on the encoding size for hierarchies with low multiple inheritance factors.
An Adaptive Internal Model Control Based on LS-SVM
Authors: Changyin Sun, Jinya Song
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Based on least squares support vector machines regression algorithm, reverse model of system model is constructed, and adaptive internal model controller is developed in this paper. First, least squares support vector machine (LS-SVM) regression model and its training algorithm are introduced, provides SMO-based on pruning algorithms for LS-SVM. Then it is used in adaptive internal model control (IMC) for constructing internal model and designing the internal model controller. At last, LS-SVM regression based adaptive internal model control is used to control a benchmark nonlinear system. Simulation results show that the controller has simple structure, good control performance and robustness.
Theoretical investigation of organic-inorganic hybrid crystal: Optical transparency and quadratic harmonic coefficients of 2-Amino-5-Nitropyridinium chloride
Authors: Caiping Liu, Chaoyong Mang, Kechen Wu
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

The IR and UV absorption cut-offs (&lambda;$_{IR}$ and &lambda;$_{UV})$ of an organic-inorganic hybrid nonlinear optical (NLO) crystal, 2-amino-5-nitropyridinium chloride (2A5NPCl), were investigated in the framework of density functional theory. The macroscopic quadratic NLO coefficients of the crystal were evaluated at the MP2/6-31+G** level coupled with the oriented-gas model. The calculated results reveal that the &lambda;$_{IR}$ and &lambda;$_{UV}$ are governed by the asymmetric N-H stretch of NH$_{2}$ group and the charge transfer (CT) transition from Cl$^{-}$ to 2A5NP$^{+}$, respectively. The optical transparency has been determined in the region 407-1415 nm. The analyses of the electronic absorption spectrum show that the CTs of both Cl$^{-}&rarr;$ 2A5NP$^{+}$ and &pi; &rarr; p* within 2A5NP$^{+}$ moiety make dominant contributions to the &beta; values. The studies of the oriented-gas model show that the crystal has large NLO coefficients.
Robust Lane Lines Detection and Quantitative Assessment
Authors: Antonio López, Joan Serrat, Cristina Cañero, Felipe Lumbreras
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Detection of lane markings based on a camera sensor can be a low cost solution to lane departure and curve over speed warning. A number of methods and implementations have been reported in the literature. However, reliable detection is still an issue due to cast shadows, wearied and occluded markings, variable ambient lighting conditions etc. We focus on increasing the reliability of detection in two ways. Firstly, we employ a different image feature other than the commonly used edges: ridges, which we claim is better suited to this problem. Secondly, we have adapted RANSAC, a generic robust estimation method, to fit a parametric model of a pair or lane lines to the image features, based on both ridgeness and ridge orientation. In addition this fitting is performed for the left and right lane lines simultaneously, thus enforcing a consistent result. We have quantitatively assessed it on synthetic but realistic video sequences for which road geometry and vehicle trajectory ground truth are known.