ppxscal/embedding_network huggingface dataset:
A unified approach to resultant matrices for Bernstein basis polynomials
Authors: Joab R. Winkler
Venue: Computer Aided Geometric Design (2008)

Resultant matrices can be used to compute the intersection points of curves that are defined by polynomials. They were originally developed for polynomials expressed in the power (monomial) basis, but the recent development of resultant matrices for Bernstein basis polynomials has increased their use in computer aided geometric design, for which the Bernstein basis is the standard polynomial basis. In this paper, the equations that relate the Sylvester, Bezout and companion resultant matrices for Bernstein basis polynomials are derived, thereby establishing their equivalence. It is shown that these equations are more complicated than their power basis equivalents.
Pinpointing in the Description Logic $\mathcal {EL}^+$
Authors: Franz Baader, Rafael Peñaloza, Boontawee Suntisrivaraporn
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in question. Until now, the pinpointing approach has only been applied to the DL $\mathcal {ALC}$ and some of its extensions. This paper considers axiom pinpointing in the less expressive DL $\mathcal {EL}^+$, for which subsumption can be decided in polynomial time. More precisely, we consider an extension of the pinpointing problem where the knowledge base is divided into a static part, which is always present, and a refutable part, of which subsets are taken. We describe an extension of the subsumption algorithm for $\mathcal {EL}^+$ that can be used to compute all minimal subsets of (the refutable part of) a given TBox that imply a certain subsumption relationship. The worst-case complexity of this algorithm turns out to be exponential. This is not surprising since we can show that a given TBox may have exponentially many such minimal subsets. However, we can also show that the problem is not even output polynomial, i.e., unless P=NP, there cannot be an algorithm computing all such minimal sets that is polynomial in the size of its input and output. In addition, we show that finding out whether there is such a minimal subset within a given cardinality bound is an NP-complete problem. In contrast to these negative results, we also show that one such minimal subset can be computed in polynomial time. Finally, we provide some encouraging experimental results regarding the performance of a practical algorithm that computes one (small, but not necessarily minimal) subset that has a given subsumption relation as consequence.
Adaptive Interfaces for Supportive Ambient Intelligence Environments
Authors: Julio Abascal, Isabel Fernández De Castro, Alberto Lafuente, Jesus Maria Cia
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The Ambient Intelligence paradigm offers an excellent way to define Ambient Assisted Living systems for all kind of users. In addition, people with physical, sensory or cognitive restrictions are expected to particularly benefit from the support of intelligent environments. Nevertheless, the huge diversity of users' characteristics makes very difficult to develop interfaces that are adequate for all of them in order to successfully interact with the environment. Even if a "Design for All" approach is assumed and adaptive interfaces are adopted, it is almost impossible to fulfill the diverse, and frequently contradictory, requirements of the different users. This paper presents an experience of designing adaptive interfaces oriented to the needs of the elderly people living in an intelligent environment. These interfaces are integrated in an architecture destined to build complex Ambient Intelligent environments that share resources ---mainly hardware and heterogeneous networks--- and knowledge.
Toward a theory of validation of hybrid minmax FuzzyNeuro systems
Authors: Mokhtar Beldjehem
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

The Validation and Verification (V&V) of Hybrid FuzzyNeuro (HFN) or Hybrid NeuroFuzzy (HNF) systems Becomes of increasing concern as these systems are fielded and embedded in the every day operations of medical diagnosis, pattern recognition, fuzzy control and other industries-- particularly so when life-critical and environment-critical aspects are involved. We provide in this paper a V&V perspective on the nature of HFN components, an appropriate life-cycle, and applicable systematic formal testing approaches. We consider why HFN V&V may be both easier and harder than traditional means, and we conclude with a series of practical V&V guidelines. Validation of HFN systems brings us to a systematic study of value approximation performed during the inference phase. It is accepted that generalization capability is proportional to value approximation.
A comparative study of model selection criteria for computer vision applications
Authors: Niloofar Gheissari, Alireza Bab-Hadiashar
Venue: Image and Vision Computing (2008)

During last three decades many model selection techniques have been developed, many of those have also been employed in computer vision applications. Interestingly, most of those criteria are based upon assumptions that are rarely realised in practical applications. As a result, the question of which model selection criterion works best for a particular application is of interest to many computer vision researcher and practitioners alike. This paper is an attempt to provide a satisfactory answer to this question for some well-known computer vision applications. Here, we present a comparative study of a large number of the existing model selection criteria for three computer vision tasks including: range modelling, motion modelling and merging of 3D surfaces in range data. Compared with other criteria, the results show that the surface selection criterion (SSC) appears to perform generally better for the above applications.
Interfacing intimacy: spatializing ubiquitous technologies for dwelling places
Authors: Konstantinos Grivas
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

In this paper an approach is presented for the design of ubiquitous technologies designed for domestic use. There has been, in general, extended research and innovation on the applications, interface and software possibilities and a lot of design exploration on the material shape and form of domestic awareness technologies. Nevertheless, there is a considerable lack of research and reflection on the spatial qualities of such technologies. My primary concern is that emerging domestic technologies should shape themselves in ways that relate to the inherently human ability to read, remember and spiritually connect with space, creating a delicate web of intimacies.
On the Need of Hybrid Intelligent Systems in Modular and Multi Robotics
Authors: R. J. Duro, M. Graña, J. Lope
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

The area of cognitive or intelligent robotics is moving from the single robot control and behavior problem to that of controlling multiple robots operating together and even collaborating in dynamic and unstructured environments. This paper introduces the topic and provides a general overview of the current state of the field of modular and multi robotics taking both of these subareas as different representations of the same problem: how to coordinate multiple elements in order to perform useful tasks. The review shows where Hybrid Intelligent Systems could provide key contributions to the advancement of the field.
Combining complementary formal verification strategies to improve performance and accuracy
Authors: Bojan Cukic, Tim Menzies
Venue:  (2007)

Software is increasingly complex and is used in increasingly critical applications. Sophisticated techniques are available for verifying that software systems work correctly, but these techniques can be very difficult and expensive to use. Researchers have developed tools to automatically verify software models, but using these tools can still be very costly, in terms of manual effort and expertise required to build accurate models and to formally specify required properties, and also in terms of the time and memory required to run these tools. Much work has been done to simplify the process of building software models and to improve the performance of verification tools, resulting in a variety of different modeling languages, each with features designed to reduce effort or improve performance for certain types of input models, and a range of verification tools, each with a different set of strategies available for reducing time and memory requirements.It can be difficult to determine which verification strategy is best for a particular software system. Others have observed complementary relationships between tools and have argued that there is no single best tool&mdash;that as users&rsquo; needs change the choice of tool should change as well. This dissertation provides further evidence for complementary relationships between verification tools, specifically considering tools available for specifications of synchronous software systems written in the Software Cost Reduction (SCR) modeling language. We show how verification tools and their associated modeling languages may be complementary in terms of both accuracy and performance. Rather than providing guidance for users deciding between tools, we argue that a verification strategy combining results from multiple tools will yield the most accurate results, i.e., the results worthy of the greatest confidence, and will in most cases perform better, requiring less time and memory, than a strategy based on a single tool.This dissertation presents several studies in which the use of multiple verification tools resulted in improved accuracy and performance. In some cases the use of a single tool would have produced incorrect results, giving no indication to the user that the tool had been used incorrectly. The use of a second tool, producing results inconsistent with the first, led to a better understanding of both tools and greater confidence in the overall verification result. Further studies show how an efficient debugging tool, based on random search, and a verification tool can be used together so that average time and memory requirements are greatly reduced, and so that performance is much less sensitive to minor changes in the input model. We then discuss in detail a larger case study that produced experimental results consistent with these smaller studies, showing how four verification tools can be used together effectively to verify software specifications written in the SCR modeling language.
An Experimental Evaluation of Probabilistic Simulation
Authors: Jonathan Bogdoll, Holger Hermanns, Lijun Zhang
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

Probabilistic model checking has emerged as a versatile system verification approach, but is frequently facing state-space explosion problems. One promising attack to this is to construct an abstract model which simulates the original model, and to perform model checking on that abstract model. Recently, efficient algorithms for deciding simulation of probabilistic models have been proposed. They reduce the theoretical complexity bounds drastically by exploiting parametric maximum flow algorithms. In this paper, we report on experimental comparisons of these algorithms, together with various interesting optimizations. The evaluation is carried out on both standard PRISM example cases as well as randomly generated models. The results show interesting time-space tradeoffs, with the parametric maximum flow algorithms being superior for large, dense models.
An Architecture for End-User Driven Business Process Management
Authors: Todor Stoitsev, Stefan Scheidl
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Business Process Management (BPM) systems face the challenge of involving business users, who have a detailed domain expertise but lack advanced technical skills, in modeling and optimization of enterprise processes. The paper presents an architecture which enables people integration in BPM by interconnecting personal task lists and email of different users to a process-enabled middleware and generating weakly-structured process models from ad-hoc task hierarchies. These models can be transformed to formal workflows by implicitly involving business users in formal process modeling. The resulting workflows can be executed on a workflow engine. Through shared repositories between the ad hoc task management system and the workflow engine, the architecture facilitates their interoperability and ensures a seamless integration of user-defined to formal process definitions. The architecture is implemented in the Collaborative Task Manager (CTM) prototype. Through a CTM case study at an industrial company we show how the architecture facilitates people-focused BPM.
Segmented Overdetermined Nonlinear Independent Component Analysis for Online Neural Filtering
Authors: Eduardo F. Simas Filho, José Manoel de Seixas, Luiz Pereira Calôba
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

In particle collider experiments a huge amount of information is produced, but only a small part is relevant for physics characterization. An efficient filtering (trigger) system is required to guarantee that valuable signatures will be recorded and most of the background noise rejected. In previous works the standard linear independent component analysis (ICA) model was used for feature extraction and good results were obtained, but it is known that the measured signals are modified by some sort of nonlinear phenomena. Another characteristic of our particular application is that there exists more sensors than original sources (the problem is over determined). In this work is proposed a novel structural model for the over determined Non-linear ICA problem. Multi-layer perceptron networks were applied for nonlinear mixing function estimation. The extracted nonlinear independent components were used to feed a neural filter that performs online particle classification with high discrimination performance.
Evaluation of Interoperability between MOT and Regular Learning Management Systems
Authors: Fawaz Ghali, Alexandra I. Cristea
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Adaptive Hypermedia content offers personalization; however, (re-) using such material with regular Learning Management Systems (LMS) is not yet straightforward. Ideally, materials created once should be usable anywhere. One such vehicle for reusability is represented by e-learning standards. Thus, here we describe the extension and evaluation of My Online Teacher (MOT), an adaptive hypermedia authoring system, to which compatibility with IMS Question and Test Interoperability (IMS QTI) and IMS Content Packaging (IMS CP) was added. This way, MOT authors can use materials dedicated to learning process adaptation on any standards-compatible LMS. In this paper we evaluate the converters from MOT to IMS CP and IMS QTI via both qualitative and quantitative analyses. This paper reports our hypothetical findings, their implementations, and the joint results of the evaluations of the converters. Finally, this work describes a significant step towards the little explored avenue of adaptive collaborative systems, based on extant learning standards and popular LMS.
Clase: cursor library for a structured editor
Authors: Tristan O.R. Allwood, Susan Eisenbach
Venue: Proceedings of the first ACM SIGPLAN symposium on Haskell (2008)

The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet (1) only scratches the surface of some of the potential applications of the zipper. In this work we have taken inspiration from Huet, and built a library suitable as an underpinning for a structured editor for programming languages. We consider a zipper structure that is suitable for traversing heterogeneous data types, encoding routes to other places in the tree (for bookmark or quick-jump functionality), expressing lexically bound information using contexts, and traversals for rendering a program indicating where the cursor is currently focused in the whole.
The effects of technology resources, school administration, and teacher expertise on the relationship between teachers' pedagogical beliefs and classroom computer use
Authors: Aimee Dorr
Venue:  (2007)

This study examined the impact of several different factors on the relationship between teachers' pedagogical beliefs and different types of classroom computer use. A subset of data from a national survey, which measured teachers' pedagogical beliefs, classroom computer use, and many aspects of school administration and technology resources, was used to test the research questions. Several regression analyses, which included control variables, beliefs variables, and potential moderator variables, were conducted with a sample of 400 middle and high school teachers of English, Social Studies, Math, and Science. The analyses tested for main effects of the variables on four measures of computer use, and also tested for interaction effects of the variables and beliefs on the computer use of two groups of teachers (teachers with more traditional beliefs and teachers with more constructivist beliefs). Results showed that teachers with more constructivist beliefs were more likely to use computers more frequently, to use a greater variety of software, and to use computers in constructivist-oriented ways. Some variables, such as staff development and software availability, had a positive impact on the computer use of all teachers. Some variables, such as years of teaching and computer expertise, were moderators of the relationship between teacher beliefs and computer use; more years of teaching resulted in greater frequency of use for constructivist teachers, but not for traditional teachers, and computer expertise had a great impact on the variety of software used by constructivist teachers, but a slight impact for traditional teachers. Overall, different variables were significant for different outcomes, and for different types of teachers. Graphs were generated to show the predicted impact of all the significant variables on each type of computer use, as well as the predicted effects of the significant moderators for the two groups of teachers. Results suggest that school administrators should have a clear goal for a specific type of computer use, a clear understanding of which resources best support that type of use, and a continuing awareness that different teachers have different needs, depending on their expertise, their current level of computer use, and their beliefs about learning and instruction.
One-sided offset approximation of freeform curves for interference-free NURBS machining
Authors: J. -L. Shih, S. -H. Frank Chuang
Venue: Computer-Aided Design (2008)

Generating valid tool path curves in NURBS form is important in realizing an efficient NURBS machining. In this paper, a method for computing one-sided offset approximations of freeform curves with NURBS format as tool paths is presented. The approach first uses line segments to approximate the progenitor curve with one-sided deviations. Based on the obtained line approximating curve and its offsets, a unilateral tolerance zone (UTZ) is constructed subsequently. Finally, a C^1-continuous and completely interference-free NURBS offset curve is generated within the UTZ to satisfy the required tolerance globally. Since all of the geometric computations involved are linear, the proposed method is efficient and robust. Interference-free tool path generation thus can be achieved in NURBS based NC machining.
Tree-Walking Automata
Authors: Mikołaj Bojańczyk
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

A survey of tree-walking automata. The main focus is on how the expressive power is changed by adding features such as pebbles or nondeterminism.
A New Strategy for Pridicting Eukaryotic Promoter Based on Feature Boosting
Authors: Shuanhu Wu, Qingshang Zeng, Yinbin Song, Lihong Wang, Yanjie Zhang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Computational prediction of eukaryotic promoter is one of most elusive problems in DNA sequence analysis. Although considerable efforts have been devoted to this study and a number of algorithms have been developed in the last few years, their performances still need to further improve. In this work, we developed a new algorithm called PPFB for promoter prediction base on following hypothesis: promoter is determined by some motifs or word patterns and different promoters are determined by different motifs. We select most potential motifs (i.e. features) by divergence distance between two classes and constructed a classifier by feature boosting. Different from other classifier, we adopted a different training and classifying strategy. Computational results on large genomic sequences and comparisons with the several excellent algorithms showed that our method is efficient with better sensitivity and specificity.
Model-Checking for Software Vulnerabilities Detection with Multi-Language Support
Authors: Rachid Hadjidj, Xiaochun Yang, Syrine Tlili, Mourad Debbabi
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

In this paper we develop a security verification framework for open source software with a multi-language support. We base our approach on the GCC compiler which is considered as the defacto open source compiler for several languages including C, C++, JAVA, ADA, FORTRAN,etc. To achieve our goal we use a conventional push down system model-checker for reachability properties, and turn it into a fully-fledged verification tool for both low and high level software security properties. We also allow programmers to define a wide range of temporal security properties using an automata-based specification approach. As a result, our approach can model-check large scale software against system-specific security properties.
Quantum Walks and Quantum Cellular Automata
Authors: Norio Konno
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The quantum walk is a generalization of classical random walks. Considerable work has been recently investigated on quantum walks in connection with quantum computing. The walk can be considered as a class of quantum cellular automata. There exists a one-to-one correspondence between them in a more general setting. Moreover we consider another class of quantum cellular automata which can be considered as a quantum version of stochastic cellular automata.