waashk/dblp huggingface dataset:
a study of relative redundancy in test-suite reduction while retaining or improving fault-localization effectiveness. test-suite reduction technique aims to find a subset of the test suite while still satisfying the original test requirements; therefore, it can save the cost of software testing. because many test cases have been removed, the testing information is also lost. fault localization is a technique using testing information to locate the fault and widely used by programmers to debug programs, so it suffers from the side effects of test-suite reduction. how to reduce the test-suite size in software testing with the premise of retaining or improving fault-localization effectiveness has become the hot spot in the area of software debugging recently. in this paper, we propose a new approach that selectively keeps the limited redundant test cases in the reduced set; it makes the new reduced set relatively redundant compared to the original one, and we expect that it retains or even improves fault-localization effectiveness. we also describe a framework that implements our approach and conduct a set of empirical studies for evaluation. the results show that our approach can retain or even improve fault-localization effectiveness as expected.
relational consistency by constraint filtering. in this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite constraint satisfaction problem (csp). this algorithm operates by filtering the constraint while leaving the topology of the graph unchanged. we study the resulting relational consistency property and compare it to existing ones. we evaluate the effectiveness of our algorithm in a search procedure for solving csps and demonstrate the applicability, effectiveness, and usefulness of enforcing high levels of consistency.
polytope-based computation of polynomial ranges. polynomial ranges are commonly used for numerically solving polynomial systems with interval newton solvers. often ranges are computed using the convex hull property of the tensorial bernstein basis, which is exponential size in the number n of variables. in this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. we formulate several polytopes based on the tensorial bernstein basis, and we formulate a polytope for the quadratic patch qn:= (x1, ..., xn, x21, ..., x2n, x1x2, ..., xn-1xn) by projections. this bernstein polytope has &theta;(n2) hyperplanes. we give the number of vertices, the number of hyperplanes, and the volume of each polytope for n = 1, 2, 3, 4, and we compare the computed range widths for random n-variate polynomials for n &le; 10. the bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial bernstein basis of exponential size.
referrer graph: a low-cost web prediction algorithm. this paper presents the referrer graph (rg) web prediction algorithm as a low-cost solution to predict next web user accesses. rg is aimed at being used in a real web system with prefetching capabilities without degrading its performance. the algorithm learns from user accesses and builds a markov model. these kinds kind of algorithms use the sequence of the user accesses to make predictions. unlike previous markov model based proposals, the rg algorithm differentiates dependencies in objects of the same page from objects of different pages by using the object uri and referrer in each request. this permits us to build a simple data structure that is easier to handle and, consequently, with a lower computational cost in comparison with other algorithms. the rg algorithm has been evaluated and compared with the best prediction algorithms proposed in the open literature, and the results show that it achieves similar precision values and page latency savings but requiring much less computational and memory resources.
formal analysis of policy-based self-adaptive systems. pobsam is a flexible actor-based model with formal foundation for model-based development of self-adaptive systems. in pobsam policies are used to control and adapt the system behavior, and allow us to decouple the adaptation concerns from the application code. in this paper, we use the actor-based language rebeca to model check pobsam models. since policies are used to govern the system behavior, it is required to verify if the governing policies are enforced correctly. to this aim, we present a new generic classification of the policy conflicts and provide temporal patterns expressed in ltl to detect each class of conflicts. moreover, we propose ltl patterns for checking the correctness of adaptation. an approach based on static analysis of adaptation policies is presented to check the system stability as well.
social music making on the web with codes. music making is usually considered as mostly a solitary activity done by composers, but with the current web 2.0 technology it is possible to provide new possibilities for social music making. codes is a web-based networked music environment designed to support music creation by novices in a cooperative and prototypical way, since no previous musical knowledge is required. differently from others social media, where people only publish their content created elsewhere, in codes novices can draft and refine cooperatively simple musical pieces, actually creating their own music, instead of only consuming it. this paper presents the main characteristics of codes for social music making, with special focus on novices in music.
integrating real-time hybrid task scheduling into a sensor node platform. in general, two different types of low-end sensor node platforms are currently considered: event driven and multi-tasking operating systems. it is commonly assumed that event driven operating systems are more suited to wsn (wireless sensor networks) as they use less memory and resources. hence one of event driven operating systems, tinyos incorporating a non-preemptive scheduling policy, is quickly deployed for wsn today. while the tinyos can keep the memory overhead down, it has been shown that scheduling periodic and aperiodic non-preemptive tasks on the tinyos is np-hard. in this paper, we present a technique that makes it possible to guarantee the real-time scheduling of periodic tasks and minimize the average response time of aperiodic tasks for low-end sensor node platforms. this paper considers the following two perspectives. first, sensor node platforms available in the literature have not addressed the concept of scheduling for hybrid task sets where both types of periodic and aperiodic tasks exist. second, each system service in sensor node platforms is decomposed to either a periodic or an aperiodic task in order to provide fully optimal real-time scheduling for given real-time requirements of wsn applications. a case study shows that the proposed technique yields efficient performance in terms of guaranteeing the completion of all the periodic tasks within their deadlines and aiming to provide aperiodic tasks with good average response time.
implicit invocation of traits. we propose the introduction of a special kind of traits that implement methods implicitly invoked when an event of a given type occurs. events are announced explicitly in the source code at their place of origin, and classes publishing events, as well as traits subscribing to them, are explicitly marked as such. the result is greater independence of publisher and subscriber (when compared to other implementations), as well as an explicit interface between the two. an implementation in scala is briefly sketched.
ontology-based generation of it-security metrics. legal regulations and industry standards require organizations to measure and maintain a specified it-security level. although several it-security metrics approaches have been developed, a methodology for automatically generating iso 27001-based it-security metrics based on concrete organization-specific control implementation knowledge is missing. based on the security ontology by fenz et al., including information security domain knowledge and the necessary structures to incorporate organization-specific facts into the ontology, this paper proposes a methodology for automatically generating iso 27001-based it-security metrics. the conducted validation has shown that the research results are a first step towards increasing the degree of automation in the field of it-security metrics. using the introduced methodology, organizations are enabled to evaluate their compliance with information security standards, and to evaluate control implementations' effectiveness at the same time.
modeling and analyzing architectural change with alloy. although adaptivity based on reconfiguration has the potential to improve dependability of systems, the cost of a failed attempt at reconfiguration is prohibitive in precisely the applications where high dependability is required. existing work on formal modeling and verification of architectural reconfigurations partly achieve the goal of ensuring correctness, however the formalisms used often lack tool support and the ensuing models have uncertain relation to a concrete implementation. thus a practical way to ensure with formal certainty that specific architectural changes are correct remains a barrier to the uptake of reconfiguration techniques in industry. using the alloy language and associated tool, we propose a practical way to formally model and analyze runtime architectural change expressed as architectural scripts. our evaluation shows the performance to be acceptable; our experience that the modelling language is convenient and expressive, and that our model accurately repesents the implementation it is used to reason about.
using aspects and annotations to separate application code from design patterns. design patterns are an invaluable resource to generate effective design solutions. however, employing some of them can be cumbersome for some application classes when these are forced to mix domain- with pattern-related code. indeed, for a number of design patterns, we view the code implementing the behaviour required by their roles as a snippet, or concern, which is not involved in the domain issues that a class is supposed to address. this paper proposes a methodology to obtain the behaviour described by some well-known design patterns, which allows better separation between domain and non-domain concerns through recourse to aspects and annotations. indeed, application classes retain all the benefits that the design patterns are supposed to give them, while staying thoroughly separated from non-domain concerns. moreover, fewer lines of code are needed to obtain a design pattern than in other approaches, and the propagation of changes to application code, caused by the introduction or removal of a design pattern, are greatly reduced.
visual processing-inspired fern-audio features for noise-robust speaker verification. in this paper, we consider the problem of speaker verification as a two-class object detection problem in computer vision, where the object instances are 1-d short-time spectral vectors obtained from the speech signal. more precisely, we investigate the general problem of speaker verification in the presence of additive white gaussian noise, which we consider as analogous to visual object detection under varying illumination conditions. inspired by their recent success in illumination-robust object detection, we apply a certain class of binary-valued pixel-pair based features called ferns for noise-robust speaker verification. intensive experiments on a benchmark database according to a standard evaluation protocol have shown the advantage of the proposed features in the presence of moderate to extremely high amounts of additive noise.
load-based covert channels between xen virtual machines. multiple virtual machines on a single virtual machine monitor are isolated from each other. a malicious user on one virtual machine usually cannot relay secret data to other virtual machines without using explicit communication media such as shared files or a network. however, this isolation is threatened by communication in which cpu load is used as a covert channel. unfortunately, this threat has not been fully understood or evaluated. in this study, we quantitatively evaluate the threat of cpu-based covert channels between virtual machines on the xen hypervisor. we have developed cccv, a system that creates a covert channel and communicates data secretly using cpu loads. cccv consists of two user processes, a sender and a receiver. the sender runs on one virtual machine, and the receiver runs on another virtual machine on the same hypervisor. we measured the bandwidth and communication accuracy of the covert channel. cccv communicated 64-bit data with a 100% success rate in an ideal environment, and with a success rate of over 90% in an environment where web servers are processing requests on other virtual machines.
application-guided tool development for architecturally diverse computation. architecturally diverse computation exploits non-traditional computing platforms (e.g., field-programmable gate arrays, graphics processors, heterogeneous chip multiprocessors) to execute user applications. we have designed the auto-pipe tool set with the goal of easing the task of developing applications for architecturally diverse systems. prior to and during the course of auto-pipe's design, we have developed a number of real, substantial applications, and the the lessons learned during the development of these applications has had a direct bearing on the capabilities of auto-pipe. in this paper, we describe the relationship between our application development experience and auto-pipe. in short, how have applications guided the tools' evolution and development?
a novel framework to detect source code plagiarism: now, students have to work for real! our work focuses on detecting plagiarism within a source code corpus. the case study is to help a human corrector to find out plagiarism within source code written by computer science students. like other approaches, we use the notion of similarity distance. however, in this work we introduce segmentation to split documents into smaller parts and propose a document-wise distance based on the cost of permuting segments to transform one document to another. our framework is laid out as a pipeline, where each stage can be parameterized to build up a plagirism detector fitting user needs. the approach makes no assumption about the programming language being analyzed. furthermore, it provides a synthetical report of the results to ease the decision making process, as we consider that only a human user has final word on wether it is plagiarism or not. we tested our framework on hundreds of real source files, involving many programming languages, allowing us to discover previously undetected frauds.
prediction of social bookmarking based on a behavior transition model. we propose an algorithm to predict users' future bookmarking using social bookmarking data. it is a problem that primitive collaborative filtering cannot exactly catch users' preferences in social bookmarkings containing enormous items (urls) because in many cases user's adoption data is sparse. there can be various influences on bookmarking such as effects from the environment and changes in user preference. we use temporal sequence among the bookmarking-users to represent word-of-mouth and among the bookmarked-urls to represent user's interest, and model each sequential order as a continuous-time markov chain. this idea comes from diffusion of innovation theory. a transition probability from a state (user/url) to another state is defined by the transition rate calculated from the time taken for the transition. we predicted user's preferences through a combination of estimating the most likely transition between users using urls as input and between urls using users as input. we conducted evaluation experiments with a social bookmarking service in japan called hatena bookmark. the proposed algorithm predicts users' preferences with higher accuracy than collaborative filtering or simple transition models based on either user or url.
towards fine-grained and application-centric access control for wireless sensor networks. the emerging reality of wireless sensor networks deployed as long-lived infrastructure required to serve multiple applications necessitates the development of fine-grained security support. specifically, to allow sensor nodes to participate in multiple concurrent applications, access control is required on a per-application basis. this paper presents a policy-driven security architecture for wireless sensor networks that addresses the concern of fine-grained access control and secure deployment of security policies, while respecting the resource-constrained nature of wireless sensor networks. a prototype of this system has been realized and evaluated using the looci component model and the sun spot sensor network platform.
cnl4dsa: a controlled natural language for data sharing agreements. a data sharing agreement (dsa) is an agreement among contracting parties regulating how they share data. a dsa represents a flexible mean to assure privacy of data exchanged on the web. as an example, a set of intelligent user agents may interact with each other, and by means of dsa, may negotiate privacy requirements on behalf of human users. however, a key factor for the adoption of privacy's technologies is not only their reliability, but also their usability. here, we propose cnl4dsa, a controlled natural language for dsa aiming at lowering the barrier to adoption of dsa, and, at the same time, ensuring mapping to formal languages that enable the automatic verification of agreements.
dynamic linking and personalization on web. web browsing is a complex activity and users need to be supported with additional guidance. in our research, we developed a novel semantic web browser, which is called semweb, in order to assist web browsing using linked data and adaptive hypermedia (ah). semweb is an extension to the mozilla firefox web browser. semweb adds a semantic layer to web documents: it annotates web pages using a linked data domain (i.e. dbpedia) and creates context-based hyperlinks on web pages to guide users to relevant pages. in addition, the information presented to the user is personalized based on a novel behavior based user model. we evaluated our approach on dbpedia, dblp and ecs (university of southampton) linked data domains. our study showed that semweb provides a new way of supporting dynamic linking and personalization on web documents using different linked data domains.
concept for providing guaranteed service level over an array of unguaranteed commodity connections. as residential internet access has become increasingly commoditized, the incentives to lower costs in enterprise and similar networks have grown as well. the business networks' expensive costs stem primarily from a service level agreement, or sla, where the service provider or operator gives assurances on reliability and similar attributes. implementing these assurances is expensive. we have devised an approach to virtualize networks over commodity internet access while being able to provide service level assurances at fraction of a cost and with possibly even better service level compared to traditional methods. in this paper we present our concept in detail, including some initial results on the feasibility of the approach based on simulations.
checking architectural compliance in component-based systems. the software architecture of software systems often imposes constraints upon the design and the implementation of a system, for example upon how components are logically grouped or upon how they may interact. it is of great importance for the sake of maintainability and smooth operation of a software system that its design and implementation are compliant to its intended software architecture. due to the complexity of today's software systems and the diversity of those constraints, guaranteeing the compliance by manual checks is impossible. unfortunately, current tool support is not flexible enough to easily check different aspects of architectural compliance. this paper outlines a rule-based approach to architectural compliance checking for component-based systems. it is based upon a sound formalization of component-based descriptions of software systems and on the definition of architectural rules. it will be demonstrated by an exemplary industrial case study.
leveraging fuzzy query processing to support applications in wireless sensor networks. in this paper, we describe a fuzzy query processing approach to support application development in sensor networks. using a fuzzy query, an application programmer can provide a linguistic and semantic specification of the desired data, eliminating the need to specify explicit and exact thresholds as part of a query. the returned fuzzy query results are each associated with a degree of membership measurement that indicates how closely each returned data value matches the semantic intent of the fuzzy query, providing applications with additional information that can be used to reason about the query result. our approach to in-network fuzzy query processing allows for each sensor node to tailor its evaluation of a fuzzy query; this feature allows for consideration of micro-environments embedded within the sensor network that can impact how individual sensor data values should be interpreted with respect to the semantic intent of the query. to demonstrate that a fuzzy query processing approach is feasible, we use an application scenario to evaluate the implementation of our fuzzy query processing system in a simulated sensor network environment; results show that precision and overhead for our approach are comparable to traditional query processing.
flexible document-query matching based on a probabilistic content and structure score combination. the goal of an xml retrieval system is to select from a set of xml documents all elements (nodes) that fit the user information need, usually expressed by a set of keywords with some structural conditions. structural conditions are simply given by an ordered list of tag names that gives the target element where to search for relevant content. consequently a potential relevant node should not only contain similar text to the query but also its localization path should fit the structural conditions. we describe in this paper a new approach for ranking xml content-and-structure queries based on a probabilistic combination of two independent scores assigned to each xml element: content score and structural score. content score measures the content similarity between an element and a query, the structural score measures the path similarity between an element path and the structural conditions of a query. we showed experimentally that both scores follow well-known distributions. we then proposed a probabilistic combination of these distributions in order to assign a final score to each node. some experiments have been undertaken on a dataset provided by inex to show the effectiveness of our approach. we emphasize our experiments on the vvcas task which is appropriate to our model.