ppxscal/embedding_network huggingface dataset:
Bytecode fault injection for Java software
Authors: Sudipto Ghosh, John L. Kelly
Venue: Journal of Systems and Software (2008)

Developers using third party software components need to test them to satisfy quality requirements. In the past, researchers have proposed fault injection testing approaches in which the component state is perturbed and the resulting effects on the rest of the system are observed. Non-availability of source code in third-party components makes it harder to perform source code level fault injection. Even if Java decompilers are used, they do not work well with obfuscated bytecode. We propose a technique that injects faults in Java software by manipulating the bytecode. Existing test suites are assessed according to their ability to detect the injected faults and improved accordingly. We present a case study using an open source Java component that demonstrates the feasibility and effectiveness of our approach. We also evaluate the usability of our approach on obfuscated bytecode.
Applications of Semantic Web Methodologies and Techniques to Social Networks and Social Websites
Authors: Sheila Kinsella, John G. Breslin, Alexandre Passant, Stefan Decker
Venue: Reasoning Web: 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures (2008)

One of the most visible trends on the Web is the emergence of "Social Web" sites which facilitate the creation and gathering of knowledge through the simplification of user contributions via blogs, tagging and folksonomies, wikis, podcasts, and the deployment of online social networks. The Social Web has enabled community-based knowledge acquisition with efforts like the Wikipedia demonstrating the "wisdom of the crowds" in creating the world's largest online encyclopaedia. Although it is difficult to define the exact boundaries of what structures or abstractions belong to the Social Web, a common property of such sites is that they facilitate collaboration and sharing between users with low technical barriers, although usually on single sites. As more social websites form around the connections between people and their objects of interest, and as these "object-centred networks" grow bigger and more diverse, more intuitive methods are needed for representing and navigating the content items in these sites: both within and across social websites. Also, to better enable user access to multiple sites, interoperability among social websites is required in terms of both the content objects and the person-to-person networks expressed on each site. This requires representation mechanisms to interconnect people and objects on the Social Web in an interoperable and extensible way. The Semantic Web provides such representation mechanisms: it can be used to link people and objects by representing the heterogeneous ties that bind us all to each other (either directly or indirectly). In this paper, we will describe methods that build on agreed-upon Semantic Web formats to describe people, content objects, and the connections that bind them together explicitly or implicitly, enabling social websites to interoperate by appealing to some common semantics. We will also focus on how developers can use the Semantic Web to augment the ways in which they create,reuse, and link content on social networking sites and social websites.
Comment: Advancing public sector performance analysis by Professor C. J. Heinrich
Authors: V. T. Farewell
Venue: Applied Stochastic Models in Business and Industry (2008)

Random assignment experiments are discussed by drawing parallels between issues in performance management studies and in clinical trials. In addition, the need for statistical rigour and for measures of uncertainty in performance management tools is highlighted. Copyright &copy; 2008 John Wiley & Sons, Ltd.
MDD4SOA: Model-Driven Service Orchestration
Authors: Philip Mayer, Andreas Schroeder, Nora Koch
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Service-Oriented Architectures (SOAs) have become an important cornerstone of the development of enterprise-scale software applications. Although a range of domain-specific languages and standards are available for dealing with such architectures, model-driven approaches starting from models written in an established modelling language like UML and including the ability for model transformation (in particular, for code generation) are still in their infancy. In this paper, we show (1) how our UML-based domain-specific language for working with SOA artefacts, UML4SOA, can be used for modelling service orchestrations, and (2) how to exploit so-designed models in the MDD4SOA approach to generate code in multiple languages, among them BPEL and WSDL, Java, and the formal language Jolie. We use a case study for illustrating this approach. Our main contributions are an easy-to-use, conservative extension to the UML2 for modelling service orchestrations on a high level of abstraction, and a fully automated, model-driven approach for transforming these orchestrations down to code.
Real-Time Model Checking on Secondary Storage
Authors: Stefan Edelkamp, Shahid Jabbar
Venue: Model Checking and Artificial Intelligence: 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers (2007)

In this paper, we consider disk based exploration in priced timed automata for resource-optimal scheduling. State spaces for large problems can easily go beyond the main memory capacity. We propose the use of hard disk to store the generated state space induced by priced timed automata. We contribute three algorithms: External Breadth First Search for reachability analysis in ordinary timed automata, External Breadth First Branch-and-Bound for cost-optimal reachability analysis in priced timed automata, and Iterative Broadening External Breadth First Branch-and-Bound for a partial exploration in priced timed automata. The third algorithm achieves its completeness by trying to find an upper bound on the optimal solution in an incomplete search tree. Iteratively, the upper bound is made tighter and the coverage of the search space is widened. We present correctness and completeness proofs for the suggested algorithms along with experimental results on different instances of aircraft landing scheduling to validate the practicality of our approach.
Neuroticism --- A Competitive Advantage (Also) for IVAs?
Authors: Christoph Hermann, Helmuth Melcher, Stefan Rank, Robert Trappl
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Real-Time Strategy (RTS) games are a challenging genre for the design of Intelligent Virtual Agents. We were interested whether incorporating a simple emotional model to an existing bot-script improves playing strength. We implemented a bot for Microsoft's RTS game "Age of Mythology". The emotional model is based on the "Big-Five" and the Emotion-Connectionist Model. Four variants of the bot were evaluated, each using different personality parameters; one of the variants was designed to show "neurotic" behaviour. The emotion-driven bots were evaluated in a bot-versus-bot setup, playing matches against the game's default script. Evaluation results indicate a significant increase in playing strength, the "neurotic" bot being the strongest one.
Growths, Urban Transformations, Real Estate Positional Value: Econometric Cellular Automata for the Simulation of the Positional Value: An Application for Turin
Authors: Luca D'Acci
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The aim of this study is to produce a model that can simulate the positional real estate value, taking into account the transformation and expansion of urban areas. The model, called SiVa, is built on a geometric interpolation of points, raised from a matrix derived from Cellular Automata and using a fuzzy approach. The rules implemented by the Cellular Automata are a combination of logical and mathematical relationships that the model extracts on its own by deducing them from econometric analysis on values and features of the city of interest. For the city of Turin, a comparison has been completed --- as verification and for a theoretical reflection --- among the coefficient of the econometrical analysis with other two studies of this research: a survey of customer preferences (based on about 1300 interviews); and an analysis of historical series data (1990-2005).
Story-Based Learning: The Impact of Narrative on Learning Experiences and Outcomes
Authors: Scott W. Mcquiggan, Jonathan P. Rowe, Sunyoung Lee, James C. Lester
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Within the intelligent tutoring systems community, narrative is emerging as an effective medium for contextualizing learning. To date, relatively few empirical studies have been conducted to assess learning in narrative-centered learning environments. In this paper, we investigate the effect of narrative on learning experiences and outcomes. We present results from an experiment conducted with eighth-grade middle school students interacting with a narrative-centered learning environment in the domain of microbiology. The study found that students do exhibit learning gains, that those gains are less than those produced by traditional instructional approaches, but that the motivational benefits of narrative-centered learning with regard to self-efficacy, presence, interest, and perception of control are substantial.
A Mechanized Program Verifier
Authors: J. Strother Moore
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

In my view, the "verification problem" is the theorem proving problem, restricted to a computational logic. My approach is: adopt a functional programming language, build a general purpose formal reasoning engine around it, integrate it into a program and proof development environment, and apply it to model and verify a wide variety of computing artifacts, usually modeled operationally within the functional programming language. Everything done in this approach is software verification since the models are runnable programs in a subset of an ANSI standard programming language (Common Lisp). But this approach is of interest to proponents of other approaches (e.g., verification of procedural programs or synthesis) because of the nature of the mathematics of computing. I summarize the progress so far using this approach, sketch the key research challenges ahead and describe my vision of the role and shape of a useful verification system.
Top_Keyword: An Aggregation Function for Textual Document OLAP
Authors: Franck Ravat, Olivier Teste, Ronan Tournier, Gilles Zurfluh
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

For more than a decade, researches on OLAP and multidimensional databases have generated methodologies, tools and resource management systems for the analysis of numeric data. With the growing availability of digital documents, there is a need for incorporating text-rich documents within multidimensional databases as well as an adapted framework for their analysis. This paper presents a new aggregation function that aggregates textual data in an OLAP environment. The Top_Keyword function (Top_Kw for short) represents a set of documents by their most significant terms using a weighing function from information retrieval: tf.idf.
Toward loosely coupled programming on petascale systems
Authors: Ioan Raicu, Zhao Zhang, Mike Wilde, Ian Foster, Pete Beckman, Kamil Iskra, Ben Clifford
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

We have extended the Falkon lightweight task execution framework to make loosely coupled programming on petascale systems a practical and useful programming model. This work studies and measures the performance factors involved in applying this approach to enable the use of petascale systems by a broader user community, and with greater ease. Our work enables the execution of highly parallel computations composed of loosely coupled serial jobs with no modifications to the respective applications. This approach allows a new---and potentially far larger---class of applications to leverage petascale systems, such as the IBM Blue Gene/P supercomputer. We present the challenges of I/O performance encountered in making this model practical, and show results using both microbenchmarks and real applications from two domains: economic energy modeling and molecular dynamics. Our benchmarks show that we can scale up to 160K processor-cores with high efficiency, and can achieve sustained execution rates of thousands of tasks per second.
Reconciling Inconsistent Data in Probabilistic XML Data Integration
Authors: Tadeusz Pankowski
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

The problem of dealing with inconsistent data while integrating XML data from different sources is an important task, necessary to improve data integration quality. Typically, in order to remove inconsistencies, i.e. conflicts between data, data cleaning (or repairing) procedures are applied. In this paper, we present a probabilistic XML data integration setting. A probability is assigned to each data source and its probability models the reliability level of the data source. In this way, an answer (a tuple of values of XML trees) has a probability assigned to it. The problem is how to compute such probability, especially when the same answer is produced by many sources. We consider three semantics for computing such probabilistic answers: by-peer, by-sequence, and by-subtree semantics. The probabilistic answers can be used for resolving a class of inconsistencies violating XML functional dependencies defined over the target schema. Having a probability distribution over a set of conflicting answers, we can choose the one for which the probability of being correct is the highest.
On space constrained set selection problems
Authors: Themis Palpanas, Nick Koudas, Alberto Mendelzon
Venue: Data Knowledge Engineering (2008)

Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of items of interest, subject to a space constraint. We show that in many important applications, one faces variants of this basic problem, in which the individual items are sets themselves, and each set is associated with a benefit value. Since there are no known approximation algorithms for these problems, we explore the use of greedy and randomized techniques. We present a detailed performance and theoretical evaluation of the algorithms, highlighting the efficiency of the proposed solutions.
Identification of Atrophy Patterns in Alzheimer's Disease Based on SVM Feature Selection and Anatomical Parcellation
Authors: Lilia Mesrob, Benoit Magnin, Olivier Colliot, Marie Sarazin, Valérie Hahn-Barma, Bruno Dubois, Patrick Gallinari, Stéphane Lehéricy, Serge Kinkingnéhun, Habib Benali
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

In this paper, we propose a fully automated method to individually classify patients with Alzheimer's disease (AD) and elderly control subjects based on anatomical magnetic resonance imaging (MRI). Our approach relies on the identification of gray matter (GM) atrophy patterns using whole-brain parcellation into anatomical regions and the extraction of GM characteristics in these regions. Discriminative features are identified using a feature selection algorithm and used in a Support Vector Machine (SVM) for individual classification. We compare two different types of parcellations corresponding to two different levels of anatomical details. We validate our approach with two distinct groups of subjects: an initial cohort of 16 AD patients and 15 elderly controls and a second cohort of 17 AD patients and 13 controls. We used the first cohort for training and region selection and the second cohort for testing and obtained high classification accuracy (90%).
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Authors: Christian Meilicke, Johanna Völker, Heiner Stuckenschmidt
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between ontologies have been developed. Most of these systems rely on general heuristics for finding mappings, hence are bound to fail in many situations. Consequently, automatically generated mappings often contain logical inconsistencies that hinder a sensible use of these mappings. In previous work, we presented an approach for debugging mappings between expressive ontologies that eliminates inconsistencies by means of diagnostic reasoning. A shortcoming of this method was its need for expressive class definitions. More specifically, the applicability of this method critically relies on the existence of a high-quality disjointness axiomatization. This paper deals with the application of the debugging approach to mappings between lightweight ontologies that do not contain any or very few disjointness axioms, as it is the case for most of today's practical ontologies. After discussing different approaches to deal with the absence of disjointness axioms we propose the application of supervised machine learning for detecting disjointness in a fully automatic manner. We present a detailed evaluation of our approach to learning disjointness and its impact on mapping debugging. The results show that debugging automatically created mappings with the help of learned disjointness axioms significantly improves the overall quality of these mappings.
Prequential Randomness
Authors: Vladimir Vovk, Alexander Shen
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

This paper studies Dawid's prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincide. One notion is the prequential version of the measure-theoretic definition due to Martin-Löf, and the other is the prequential version of the game-theoretic definition due to Schnorr and Levin. This is another manifestation of the close relation between the two main paradigms of randomness.
Accounting for Intruder Uncertainty Due to Sampling When Estimating Identification Disclosure Risks in Partially Synthetic Data
Authors: Jörg Drechsler, Jerome P. Reiter
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

Partially synthetic data comprise the units originally surveyed with some collected values, such as sensitive values at high risk of disclosure or values of key identifiers, replaced with multiple draws from statistical models. Because the original records remain on the file, intruders may be able to link those records to external databases, even though values are synthesized. We illustrate how statistical agencies can evaluate the risks of identification disclosures before releasing such data. We compute risk measures when intruders know who is in the sample and when the intruders do not know who is in the sample. We use classification and regression trees to synthesize data from the U.S. Current Population Survey.
A Survey on Reviewer Assignment Problem
Authors: Fan Wang, Ben Chen, Zhaowei Miao
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Research into Reviewer Assignment Problem (RAP) is still in its early stage but there is great world-wide interest, as the foregoing process of peer-review which is the brickwork of science authentication. The RAP approach can be divided into three phases: identifying assignment procedure, computing the matching degree between manuscripts and reviewers, and optimizing the assignment so as to achieve the given objectives. Methodologies for addressing the above three phases have been developed from a variety of research disciplines, including information retrieval, artificial intelligent, operations research, etc. This survey is not only to cover variations of RAP that have appeared in the literature, but also to identify the practical challenge and current progress for developing intelligent RAP systems.
Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions
Authors: Bora Aslan, M. Tolga Sakalli, Ercan Bulus
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

S-boxes are vital elements in the design of symmetric ciphers. To date, the techniques for the construction of S-boxes have included pseudo-random generation, finite field inversion, power mappings and heuristic techniques. From these techniques, the use of finite field inversion in the construction of an S-box is so popular because it presents good cryptographic properties. On the other hand, while S-boxes such as AES, Shark, Square and Hierocrypt that are based on inversion mapping over GF(2 n ) use an affine transformation after the output of the S-box, in some ciphers like Camellia, an additional affine transformation is used before the input. In this paper, we classify 8-bit to 8-bit S-boxes based on power mappings into classes according to DDT and LAT distributions. Moreover, a formula is given for the calculation of the number of terms in the algebraic expression for a power mapping based S-box according to the given three probable cases.
Tight Bounds for Hashing Block Sources
Authors: Kai-Min Chung, Salil Vadhan
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

It is known that if a 2-universal hash function H is applied to elements of a block source (X 1,...,X T ), where each item X i has enough min-entropy conditioned on the previous items, then the output distribution (H,H(X 1),...,H(X T )) will be "close" to the uniform distribution. We provide improved bounds on how much min-entropy per item is required for this to hold, both when we ask that the output be close to uniform in statistical distance and when we only ask that it be statistically close to a distribution with small collision probability. In both cases, we reduce the dependence of the min-entropy on the number T of items from 2logT in previous work to logT, which we show to be optimal. This leads to corresponding improvements to the recent results of Mitzenmacher and Vadhan (SODA `08) on the analysis of hashing-based algorithms and data structures when the data items come from a block source.