ppxscal/embedding_network huggingface dataset:
Automatically repairing event sequence-based GUI test suites for regression testing
Authors: Atif M. Memon
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2008)

Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective regression testing techniques for GUIs. The needs of GUI regression testing differ from those of traditional software. When the structure of a GUI is modified, test cases from the original GUI's suite are either reusable or unusable on the modified GUI. Because GUI test case generation is expensive, our goal is to make the unusable test cases usable, thereby helping to retain the suite's event coverage. The idea of reusing these unusable (obsolete) test cases has not been explored before. This article shows that a large number of test cases become unusable for GUIs. It presents a new GUI regression testing technique that first automatically determines the usable and unusable test cases from a test suite after a GUI modification, then determines the unusable test cases that can be repaired so that they can execute on the modified GUI, and finally uses repairing transformations to repair the test cases. This regression testing technique along with four repairing transformations has been implemented. An empirical study for four open-source applications demonstrates that (1) this approach is effective in that many of the test cases can be repaired, and is practical in terms of its time performance, (2) certain types of test cases are more prone to becoming unusable, and (3) certain types of &ldquo;dominator&rdquo; events, when modified, make a large number of test cases unusable.
Fusion of the complementary Discrete Cosine Features in the YIQ color space for face recognition
Authors: Zhiming Liu, Chengjun Liu
Venue: Computer Vision and Image Understanding (2008)

This paper presents a novel Discrete Cosine Features (DCF) method for face recognition. The DCF method works by fusing the complementary features derived from the Discrete Cosine Transform (DCT) of the color component images in the YIQ color space. The novelty of the DCF method thus comes from both the multiple imaging (three component images) in the YIQ color space, and the multiple face encoding (different masking) in the DCT frequency domain. First, each color component image in the YIQ color space is transformed to the frequency domain via DCT, where three DCT frequency sets are derived by means of masking to encode the image at different representation levels (the reconstructed images display different details). Second, the three DCT frequency sets at the same representation level across the Y, I, and Q color component images are concatenated-the feature level fusion-to form an augmented pattern vector. Third, the complementary features from each of the three augmented pattern vectors (corresponding to the three different representation levels) are extracted using an Enhanced Fisher Model (EFM). Finally, the three similarity matrices generated using the complementary features are fused by means of the sum rule-the decision level fusion-to derive the final similarity matrix for face recognition. The effectiveness of the proposed DCF method is demonstrated using a complex grand challenge face recognition problem and a large scale database. In particular, the Face Recognition Grand Challenge (FRGC) and the Biometric Experimentation Environment (BEE) show that for the most challenging FRGC version 2 Experiment 4, which contains 12,776 training images, 16,028 controlled target images, and 8014 uncontrolled query images, the DCF method achieves the face verification rate (ROC III) of 81.34% at the false accept rate of 0.1%, compared to the FRGC baseline algorithm face verification rate of 11.86% at the same false accept rate.
Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs
Authors: Boris A. Galitsky, Boris Kovalerchuk, Sergei O. Kuznetsov
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in terms of communicative actions of agents; models of machine learning are used when it is rather hard to identify attitudes in a rule-based form directly. We employ scenario knowledge representation and learning techniques in such problems as predicting an outcome of international conflicts, assessment of an attitude of a security clearance candidate, mining emails for suspicious emotional profiles, mining wireless location data for suspicious behavior, and classification of textual customer complaints. A preliminary performance estimate evaluation is conducted in the above domains. Successful use of the proposed methodology in rather distinct domains shows its adequacy for mining human attitude-related data in a wide range of applications.
Interactivity and electronic communication: an experimental study of mediated feedback
Authors: Gary M. Olson
Venue:  (2008)

Interpersonal critical feedback is a particularly important form of organizational communication. With the rise of distributed work practices, virtual teams, and other non-collocated forms of work, feedback must increasingly be communicated through electronic means. Electronic communication media can reduce and distort contextual information, affect the interpretation of social cues, and shape relationships among communicators. This dissertation develops a theory of communication interactivity and presents two experimental studies designed to understand how the interactivity of a communication environment affects the delivery and interpretation of critical feedback. In both experiments a participant received critical feedback about a document (s)he had written. The feedback was delivered in one of four mediated communication conditions. In two conditions, both the feedback provider and feedback recipient used the same communication medium, either videoconferencing or instant messaging. The other two conditions used mixed-media environments in which one participant sent messages through videoconferencing while the other replied using instant messaging. The first experiment examined how the communication environment affected both the critic and the feedback recipient, with experimental subjects in both roles. The second experiment focused only on the recipient's reaction to criticism, so that uniform feedback was delivered to all participants by a confederate. The results of these experiments suggest that feedback delivery, interpretation, and use are affected by the communication environment. When feedback was delivered in videoconferencing instead of instant messaging, recipients found it less negative, formed better impressions of the critic, and believed the feedback more. Recipients were more likely to incorporate the critic's suggestions into their document when the critic was sending feedback through videoconferencing, and when the recipient was able to reply in videoconferencing. There is some evidence that men and women react to communication media differently in the feedback process. The experiments provide limited support for the theory of interactivity in electronically mediated communication developed here.
Face Tracking for Spatially Aware Mobile User Interfaces
Authors: Jari Hannuksela, Pekka Sangi, Markus Turtinen, Janne Heikkilä
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

This paper introduces a new face tracking approach for controlling user interfaces in hand-held mobile devices. The proposed method detects the face and the eyes of the user by employing a method based on local texture features and boosting. An extended Kalman filter combines local motion features extracted from the face region and the detected eye positions to estimate the 3-D position and orientation of the camera with respect to the face. The camera position is used as an input for the spatially aware user interface. Experimental results on real image sequences captured with a camera-equipped mobile phone validate the feasibility of the method.
Programming the EDSAC: Early Programming Activity at the University of Cambridge
Authors: Martin Campbell-Kelly
Venue: IEEE Annals of the History of Computing (1980)

The EDSAC computer was completed at Cambridge University, England, in May 1949. By early 1950 a programming system had been set up and the EDSAC began to attract a number of regular users. This article describes the development of the programming system between the first operation of the machine in May 1949 and the end of that year. Subsequent programming developments in 1950-1952 are also described. The paper concludes with an assessment of this programming activity.
Proceedings of the 2nd workshop on Recent advances on intrusiton-tolerant systems
Authors: Miguel Correia, Jean-Philippe Martin
Venue: European Conference on Computer Systems; Vol. 279 (2008)

The 2nd Workshop on Recent Advances on Intrusion-Tolerant Systems aims to bring together researchers in the related areas of Intrusion Tolerance, Distributed Trust, Survivability, Byzantine Fault Tolerance, and Resilience. These areas have the purpose of enhancing the Dependability and Security of computer systems by tolerating both malicious faults (attacks, intrusions) and accidental faults. The workshop will be specially interested in intrusion-tolerant systems: how to build them? How to evaluate and test their dependability and security? What systems need to be intrusion-tolerant? It will provide a forum for researchers in these areas to present recent results, discuss open problems that still need research, the steps that need to be taken for intrusion-tolerant systems to be deployed in practice, and the target application domains for intrusion tolerance. The program consists of 3 position papers, one keynote speech by Manuel Costa from Microsoft Research, and one invited talk by Jonathan M. McCune from the Carnegie Mellon University, who we warmly thank for being present at the workshop.
A Steady-State Genetic Algorithm with Resampling for Noisy Inventory Control
Authors: Steven Prestwich, S. Armagan Tarim, Roberto Rossi, Brahim Hnich
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Noisy fitness functions occur in many practical applications of evolutionary computation. A standard technique for solving these problems is fitness resampling but this may be inefficient or need a large population, and combined with elitism it may overvalue chromosomes or reduce genetic diversity. We describe a simple new resampling technique called Greedy Average Sampling for steady-state genetic algorithms such as GENITOR. It requires an extra runtime parameter to be tuned, but does not need a large population or assumptions on noise distributions. In experiments on a well-known Inventory Control problem it performed a large number of samples on the best chromosomes yet only a small number on average, and was more effective than four other tested techniques.
Screening of knee-joint vibroarthrographic signals using the strict 2-surface proximal classifier and genetic algorithm
Authors: Tingting Mu, Asoke K. Nandi, Rangaraj M. Rangayyan
Venue: Computers in Biology and Medicine (2008)

We propose the strict 2-surface proximal (S2SP) classifier, by seeking two cross proximal planes to fit the distribution of the given samples in a corresponding feature space. The method is applied to screen knee-joint vibration or vibroarthrographic (VAG) signals based on statistical parameters derived from signals and selected by the genetic algorithm. A database of 89 VAG signals was studied. With the leave-one-out procedure, the linear S2SP classifier provided an efficiency of 0.82 in terms of the area under the receiver operating characteristics curve (A"z); the nonlinear S2SP classifier provided 0.95 in A"z value using the Gaussian kernel, and possessed good robustness around the selected kernel parameter.
NixOS: a purely functional Linux distribution
Authors: Eelco Dolstra, Andres Löh
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

Existing package and system configuration management tools suffer from an imperative model, where system administration actions such as upgrading packages or changes to system configuration files are stateful: they destructively update the state of the system. This leads to many problems, such as the inability to roll back changes easily, to run multiple versions of a package side-by-side, to reproduce a configuration deterministically on another machine, or to reliably upgrade a system. In this paper we show that we can overcome these problems by moving to a purely functional system configuration model. This means that all static parts of a system (such as software packages, configuration files and system startup scripts) are built by pure functions and are immutable, stored in a way analogously to a heap in a purely function language. We have implemented this model in NixOS, a non-trivial Linux distribution that uses the Nix package manager to build the entire system configuration from a purely functional specification.
On isoperimetrically optimal polyforms
Authors: Daniel Vainsencher, Alfred M. Bruckstein
Venue: Theoretical Computer Science (2008)

In the plane, the way to enclose the most area with a given perimeter and to use the shortest perimeter to enclose a given area, is always to use a circle. If we replace the plane by a regular tiling of it, and construct polyforms i.e. shapes as sets of tiles, things become more complicated. We need to redefine the area and perimeter measures, and study the consequences carefully. A spiral construction often provides, for every integer number of tiles (area), a shape that is most compact in terms of the perimeter or boundary measure; however it may not exhibit all optimal shapes. We characterize in this paper all shapes that have both shortest boundaries and maximal areas for three common planar discrete spaces.
Research on Learning Resources Organization Model
Authors: Qingtang Liu, Zhimei Sun
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

The paper studies the adaptive learning content organization model and algorithm, which takes knowledge point as a unit. At first, it defines granularity of learning object, designs learning content level framework, which takes knowledge point as the meaning unit, builds up the reusable and sharable foundation of learning resources. The second is to provide the basic scheduling model for learning content organization. The model involves in pre-test, survey, knowledge point scheduling modules, summary, and post-test. Learning content scheduling algorithm is designed to choose learning content according to the learning content sequence, learner's styles, learning evaluating outcomes and application context. Lastly, the scheduling algorithm is proved effectiveness and stable in E-learning Service Platform.
Mining Both Positive and Negative Association Rules from Frequent and Infrequent Itemsets
Authors: Xiangjun Dong, Zhendong Niu, Xuelin Shi, Xiaodan Zhang, Donghua Zhu
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

A lot of new problems may occur when we simultaneously study positive and negative association rules (PNARs), i.e., the forms A $\Rightarrow$ B, A $\Rightarrow\neg$ B, ¬A $\Rightarrow$ B and ¬A $\Rightarrow\neg$ B. These problems include how to discover infrequent itemsets, how to generate PNARs correctly, how to solve the problem caused by a single minimum support and so on. Infrequent itemsets become very important because there are many valued negative association rules (NARs) in them. In our previous work, a MLMS model was proposed to discover simultaneously both frequent and infrequent itemsets by using multiple level minimum supports (MLMS) model. In this paper, a new measure VARCC which combines correlation coefficient and minimum confidence is proposed and a corresponding algorithm PNAR_MLMS is also proposed to generate PNARs correctly from the frequent and infrequent itemsets discovered by the MLMS model. The experimental results show that the measure and the algorithm are effective.
Towards Characterizing Visualizations
Authors: Christophe Hurter, Stéphane Conversy
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

The ability to characterize visualizations would bring several benefits to the design process. It would help designers to assess their designs, reuse existing designs in new contexts, communicate with other designers and write compact and unambiguous specifications. The research described in this paper is an initial effort to develop a theory-driven approach to the characterization of visualizations. We examine the Card and Mackinlay characterization tool and we show its limitations when it comes to performing a complete characterization.
An Adaptive Genetic Algorithm for Solving Traveling Salesman Problem
Authors: Jina Wang, Jian Huang, Shuqin Rao, Shaoe Xue, Jian Yin
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Traveling salesman problem (TSP) is a classical NP-hard problem in combinational optimization. This paper adopted a novel genetic algorithm which adjust the crossover probability and mutation probability adaptively based on clustering and fuzzy system, and designed a new crossover operator to improve the performance of genetic algorithm (GA) for TSP. Experiments show that the proposed method is much better than the standard genetic algorithm with a higher convergent rate and success rate.
Semi-definite Manifold Alignment
Authors: Liang Xiong, Fei Wang, Changshui Zhang
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We study the problem of manifold alignment, which aims at "aligning" different data sets that share a similar intrinsic manifold provided some supervision. Unlike traditional methods that rely on pairwise correspondences between the two data sets, our method only needs some relative comparison information like "A is more similar to B than A is to C". This method provides a more flexible way to acquire the prior knowledge for alignment, thus is able to handle situations where corresponding pairs are hard or impossible to identify. We optimize our objective based on the graphs that give discrete approximations of the manifold. Further, the problem is formulated as a semi-definite programming (SDP) problem which can readily be solved. Finally, experimental results are presented to show the effectiveness of our method.
Continuous Spatiotemporal Trajectory Joins
Authors: Petko Bakalov, Vassilis J. Tsotras
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

Given the plethora of GPS and location-based services, que- ries over trajectories have recently received much attention. In this paper we examine trajectory joins over streaming spatiotemporal data. Given a stream of spatiotemporal trajectories created by monitored moving objects, the outcome of a Continuous Spatiotemporal Trajectory Join (CSTJ) query is the set of objects in the stream, which have shown similar behavior over a query-specified time interval, relative to the current timestamp. We propose a novel indexing scheme for streaming spatiotemporal data and develop algorithms for CSTJ evaluation, which utilize the proposed indexing scheme and effectively reduce the computation cost and I/O operations. Finally, we present a thorough experimental evaluation of the proposed indexing structure and algorithms.
Absorbing Random Walks and the NAE2SAT Problem
Authors: K. Subramani
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

In this paper, we propose a simple, randomized algorithm for the NAE2SAT problem; the analysis of the algorithm uses the theory of symmetric, absorbing random walks. NAESAT (Not-All-Equal SAT) is the variant of the Satisfiability problem (SAT), in which we are interested in an assignment that satisfies all the clauses, but falsifies at least one literal in each clause. We show that the NAE2SAT problem admits an extremely simple literal-flipping algorithm, in precisely the same way that 2SAT does. On a satisfiable instance involving n variables, our algorithm finds a satisfying assignment using at most $\frac{9}{4}n^{2}$ verification calls with probability at least $\frac{5}{6}$. The randomized algorithm takes O(1) extra space, in the presence of a verifier and provides an interesting insight into checking whether a graph is bipartite. It must be noted that the bounds we derive are much sharper than the ones in [1]. 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
Routing framework for FTIMA: a fault tolerance infrastructure for mobile agents
Authors: Kiran Ijaz, Umar Manzoor, Arshad Ali Shahid
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Route planning is defined as finding an optimal path for an object from start node to goal node while considering the constraints of the system. Due to inherent nature of urgency and criticality of ATM networks, optimized path routing technique is considered as the backbone for their success or failure. In this paper we have proposed a fault tolerant routing framework for a transactional system to make better decisions in choice of routes before using them. We have provided standby options so that in case of route failures we can route our transactions to next working path. Our framework has been designed for ATM networks, as in these systems we need a path which is highly reliable and provides timely service through proper routing of transactions. In case of any criticalities in a path the transaction is routed intelligently to another optimal path without any delays or human intervention. We have observed through the simulated experiments that the proposed approach yields optimal performance using k paths instead of one.
Proceedings of the second international symposium on Information interaction in context
Authors: Pia Borlund, Jesper W. Schneider, Mounia Lalmas, Anastasios Tombros, John Feather, Diane Kelly, Arjen P. de Vries
Venue: ACM International Conference Proceeding Series; Vol. 348 (2008)

IIiX 2008 is the second international symposium on Information Interaction in Context succeeding the symposium held in Copenhagen in 2006. The primary objective of IIiX is to investigate how the concept of context can be understood and exploited to make information systems truly interactive. Knowledge about context can be used effectively to constrain retrieval and seeking of information and to understand ensuing information behaviours including relevance and use, thereby reducing the complexity of the interaction processes. As in the case of the first IIiX symposium, the aim of IIiX 2008 is to bring together researchers from the related areas of information seeking behaviour, laboratory IR, and interactive IR to provide a forum for discussion and collaboration on context issues with respect to information seeking and retrieval. This is successfully achieved in IIiX 2008, as a variety of angles to the concept of context, as well as suggestions as to how to consider and treat context in information seeking and retrieval, is presented. IIiX 2008 received paper submissions from 19 countries (four continents) and accepted 23 full and research in progress papers.