waashk/dblp huggingface dataset:
co-evolving application code and design models by exploiting meta-data. evolvability and adaptability are intrinsic properties of today's software applications. unfortunately, the urgency of evolving/adapting a system often drives the developer to directly modify the application code neglecting to update its design models. even, most of the development environments support the code refactoring without supporting the refactoring of the design information. refactoring, evolution and in general every change to the code should be reflected into the design models, so that these models consistently represent the application and can be used as documentation in the successive maintenance steps. the code evolution should not evolve only the application code but also its design models. unfortunately, to co-evolve the application code and its design is a hard job to be carried out automatically, since there is an evident and notorious gap between these two representations. we propose a new approach to code evolution (in particular to code refactoring) that supports the automatic co-evolution of the design models. the approach relies on a set of predefined metadata that the developer should use to annotate the application code and to highlight the refactoring performed on the code. then, these meta-data are retrieved through reflection and used to automatically and coherently update the application design models.
privacy preserving itemset mining through fake transactions. this work investigates the problem of privacy-preserving mining of association rules. specifically, a fake transaction randomization method is presented to protect the privacy of data. this method ensures the privacy of data by mixing real transactions with fake transactions. an algorithm for reconstructing frequent itemsets from the mixture of both fake transactions and real transactions is then proposed. the proposed algorithm can use any off-the-shelf tool to mine frequent itemsets without rewriting their codes, making this algorithm quite easy to implement. the performance of this algorithm is validated against several real datasets. similar to earlier approaches, this algorithm does not always reconstruct a set of frequent itemsets that is anti-monotonic. this work uses this property to further improve the quality of the mining results.
a model for terrain coverage inspired by ant's alarm pheromones. when looking at science and technology today, we find a recurrent problem to many fields: how to cover a search space consistently and uniformly. this problem is encountered in robotics (searching for targets), optimization (searching for solutions), mathematics and computer science (graph traversals), and even in software engineering (the main motivation for this research). in insect societies, and in particular ant colonies, one can find the concept of alarm pheromones used to indicate an important event to the society (e.g. a threat). alarm pheromones enable the society to have a uniform spread of its individuals, probably as a survival mechanism --- the more uniform the spread the better the changes of survival at the colony level. this paper proposes a model of this ant behavior which can be used to solve the aforementioned problem. the model, called alarm is inspired primarily by aco and from observations of ants alarm behavior. we compare the model with a random walk, to demonstrate a significant improvement over this approach.
deriving components from genericity. there is a growing recognition that programming platforms should support the decomposition of programs into components: independent units of compiled code that are explicitly "linked" to form complete programs. this paper describes how to formulate a general component system for a nominally typed object-oriented language supporting first-class generic types simply by adding appropriate annotations and syntactic sugar. the fundamental semantic building blocks for constructing, type-checking and manipulating components are provided by the underlying first-class generic type system. to demonstrate the simplicity and utility of this approach to supporting components, we have designed and implemented an extension of java called component nextgen (cgen). cgen, which is based on the sun java 5.0 javac compiler, is backward-compatible with existing code and runs on current java virtual machines.
comparison of two activity analyses for automatic differentiation: context-sensitive flow-insensitive vs. context-insensitive flow-sensitive. automatic differentiation (ad) is a family of techniques to generate derivative code from a mathematical model expressed in a programming language. ad computes partial derivatives for each operation in the input code and combines them to produce the desired derivative by applying the chain rule. activity analysis is a compiler analysis used to find active variables in automatic differentiation. by lifting the burden of computing partial derivatives for passive variables, activity analysis can reduce the memory requirement and run time of the generated derivative code. this paper compares a new context-sensitive flow-insensitive (csfi) activity analysis with an existing context-insensitive flow-sensitive (cifs) activity analysis in terms of execution time and the quality of the analysis results. our experiments with eight benchmarks show that the new csfi activity analysis runs up to 583 times faster and overestimates up to 18.5 times fewer active variables than does the existing cifs activity analysis.
snet: skip graph based semantic web services discovery. this paper presents the design of snet system, which is a p2p overlay for semantic web services discovery. snet differs from previous p2p web services discovery systems in that it supports complex search with its locality-preserving feature based on skip graph. to guarantee efficient and semantic service discovery, snet schemes wsdl-s as semantic web services description language and extracts its semantic attributes as indexing keys in skip graph so that similar keys are aggregated to keep the leverage between peer nodes. our evaluation showed that the snet system performs considerable service discovery efficiency.
ic-service: a service-oriented approach to the development of recommendation systems. recommendation systems have proven to be useful in various application domains. however, current solutions are usually ad-hoc systems which are tightly-coupled with the application domain. we present the ic-service, a recommendation service that can be included in any system in a loosely coupled way. the implementation follows the principles of service oriented computing and provides a solution to various problems arising in recommendation systems, e.g. to the problem of meta-recommendation systems development. moreover, when properly configured, the ic-service can be used by different applications (clients), and several independent instances of the ic-service can collaborate to produce better recommendations. service architecture and communication protocols are presented. the paper describes also ongoing work and applications based on the ic-service.
a crime simulation model based on social networks and swarm intelligence. experience in the domain of criminology has shown that spatial data distribution of crime in urban centers follows a zipf law in which few places concentrate most of the crimes while several other places have few crimes. in order to reproduce and better understand the nuances of such a crime distribution profile, we introduce in this paper a novel multi-agent-based crime simulation model that is directly inspired by the swarm intelligence paradigm. in this model, criminals are regarded as distributed entities endowed with the capability to pursue self-organizing behavior by considering their individual (local) activities as well as the influence of other criminals. through controlled experiments with the simulation model, we could indeed observe that self-organization phenomena (i.e. criminal behavior toward crime) emerge as the result of both individual and social learning factors. at the same time, our experiments reveal that the spatial distribution of crime achieved by experimenting with the simulation model closely follows the real crime data distribution as expected.
model transformation for object-relational database development. in this paper we define and formalize the model transformations that complete the methodological approach for the development of object-relational (or) databases (db) proposed in midas, a model driven methodology for the development of web information systems. in this proposal the platform independent model is the conceptual data model while the platform specific model is the object-relational model that represents the or db schema. since both of them will be represented in uml, we also summarize an uml profile for or db modeling. in this work we focus on the formalization of the mappings needed to get the or db schema from the conceptual data model. we have first specified them with natural language to later formalize them with graph transformation rules.
automatic enactment of message exchange pattern for web services. message exchange pattern (mep) is a challenging problem in the interaction of web services. however, by means of the non-formal descriptions, such as in soap and wsdl, it is impossible to conduct precise definition of meps, thus leading to potential ambiguities that can degrade the interoperability of web services. moreover, it is difficult to enact the meps automatically, which means the web services infrastructure has to hard-code the support for various meps and it is also difficult to be extended. in this paper, we propose an automatic enactment of meps for web services. the enactment consists of two parts. the first part is the formal description method for meps, which is used to define mep accurately with no ambiguities. the second part is the automatic enactment framework, which will automatically enact a new mep through a mep process machine that is generated according to the mep definition. new meps would become easy to be engaged in web services.
developing event-condition-action rules in real-time active database. traditional event-condition-action (eca) rules in real-time active database (rtadb) lack the capabilities to express complicated quantitative temporal information in the system. to solve this problem, in this paper, we present graphical eca rules with a set of novel temporal events to specify real-time constraints. smart home applications are used to validate the proposed rules.
mechanized proofs for the parameter abstraction and guard strengthening principle in parameterized verification of cache coherence protocols. chou, mannava, and park proposed a novel method for verification of safety properties of cache protocols, which is underpinned by the principle of parameter abstraction and guard strengthening. however, no one has formally proved the correctness of this method itself. in this work, we want to fill the gap in the literature. we believe that our work provides an alternative to formally justify this method. the key points of our theory are symmetry and the introduction of an intermediate guard strengthening protocol. we mechanize our theory in isabelle/hol.
how sensitive is your personal information? the sensitivity of personal information is one of the most important factors in determining the individual's perception of privacy. a "gradation" of sensitivity of personal information can be used in many applications, such as deciding the security level that controls access to data and developing a measure of trust when self-disclosing personal information. this paper introduces a theoretical analysis of personal information sensitivity and defines its scope and puts forward possible methods of gradation. a methodology is proposed that can be used for developing a classification scheme of personal information.
building automatic mapping between xml documents using approximate tree matching. the extensible markup language (xml) is becoming the standard format for data exchange on the internet, providing interoperability among web applications. it is important to provide efficient algorithms and tools to manipulate xml documents that are ubiquitous on the web. in this paper, we present a novel system for automating the transformation of xml documents based on structural mapping with the restriction that the leaf text information are exactly the same in the source and target documents. firstly, tree edit distance algorithm is used to find the mapping between a pair of source and target documents. with the introduction of tree partition, the efficiency of the tree matching algorithm has been improved significantly. secondly, template rules for transformation are inferred from the mapping using generalization. thirdly, a template matching component is used to process new documents. experimental studies have shown that our methods are very promising and can be widely used for web document cleaning, information filtering, and other applications.
horizontal fragmentation as a technique to improve the performance of drill-down and roll-up queries. in this paper, we focus on the horizontal fragmentation of data warehouses. our main contribution is the proposal of the mhf-dha algorithm, which is aimed at improving the performance of drill-down and roll-up queries by horizontally fragmenting data warehouses organized in different levels of aggregation. besides allowing that multiple dimensions be used as a basis for the fragmentation, the algorithm also explores the hierarchical structure of these dimensions. the performance tests carried out using the tpc-h benchmark showed that the proposed fragmentation provides a huge improvement on the query performance, with a reduction in elapsed time and disk accesses between 71% and 99%.
different conceptions in software project risk assessment. during software project risk management, a number of decisions are taken based on discussions and subjective opinions about the importance of identified risks. in this paper, different people's opinions about the importance of identified risks are investigated in a controlled experiment through the use of utility functions. engineering students participated as subjects in the experiment. differences have been found with respect to the perceived importance, although the experiment could not explain the differences based on undertaken role in a development course.
using cp-nets as a guide for countermeasure selection. in this paper we present a qualitative approach for the selection of security countermeasures able to protect an it system from attacks. for this purpose, we model security scenarios by using defense trees (an extension of attack trees) and preferences over countermeasure using conditional preference networks (cp-nets for short). in particular, we introduce two different methods for the composition of preferences: the and-composition and the or-composition. the first one is used to determine a preference order in the selection of countermeasures able to mitigate the risks produced by conjunct attacks. the second one is used to determine a preference order over sets of countermeasures able to mitigate the risks produced by alternative attacks.
integrating gene ontology into discriminative powers of genes for feature selection in microarray data. one of the main challenges in the classification of microarray gene expression data is the small sample size compared with the large number of genes, so feature selection is an essential step to remove genes not relevant to class labels. most feature selection methods are solely based on expression values to determine discriminative values of genes and remove redundancy. however, due to the characteristics of microarray technology, some values may not be accurately measured. this may reduce the effectiveness of these models. to cope with this problem, in this paper, we integrate gene ontology (go) annotations into gene selection. the novelty of our work is to evaluate genes based on not only their individual discriminative powers but also the powers of go terms that annotate them. this strategy implicitly verifies the accuracies of the measurements and reduces redundancy. experimental results in four public datasets demonstrate the effectiveness of the proposed method.
improved svd-dwt based digital image watermarking against watermark ambiguity. singular value decomposition (svd) has been used as a valuable transform technique for robust digital watermarking. this arises from the fact that, changing singular values (sv) of an image slightly does not affect the image quality much. in some svd based methods, svs of the watermark are embedded into svs of the cover image. then in detection, the watermark is constructed by using original singular vectors. if the singular vectors of another image rather than the original watermark are used, that image is constructed as the embedded watermark, causing the false positive probability to be one. in this paper, we propose a technique against this ambiguity by embedding the singular vectors of the watermark image as a control parameter. we discuss the performance of the proposed method against some attacks.
mapping visual notations to mof compliant models with qvt relations. model-centric methodologies rely on the definition of domain-specific modeling languages for being able to create domain-specific models. with mof the omg adopted a standard which provides the essential constructs for the definition of semantic language constructs (abstract syntax). however, there are no specifications on how to define the notations (concrete syntax) for abstract syntax elements. usually, the concrete syntax of mof compliant languages is described informally. we propose to define mof-based metamodels for abstract syntax and concrete syntax and to connect them by model transformations specified with qvt relations in a flexible, declarative way. using a qvt based transformation engine one can easily implement a model view controller architecture by integrating modeling tools and metadata repositories
deriving cse-specific live forensics investigation procedures from forza. performing live forensics investigation becomes a trend in digital forensics. different vendors and software developer implement their own investigation procedures. by applying forza framework -- a digital forensics investigation framework, investigation requirement could be translated and formulated into criteria in applying appropriate forensics investigation requirement. through this model, only necessary searching would be applied to live investigation process instead of simply passing all investigation process to live investigation unintentionally. in this paper, the forza framework that applied to live forensics investigation will be presented and illustrated using the investigation of the first bt illegal movie upload investigation.
a framework for prioritized reasoning based on the choice evaluation. this work addresses the issue of prioritized reasoning in the context of logic programming. the case of preference conditions involving atoms is considered and a refinement of the comparison method of the answer set optimization semantics [4] is presented. the paper introduces the concept of choice, as a set of preference rules describing common choice options in different contexts. thus, intuitively, in the proposed approach the preference rules are not evaluated separately; but the subset of rules, related to the same choice are individuated and the choice instead of rule satisfaction is considered. the role of constraints in the feasibility of choice options is then investigated and an alternative semantics, evaluating choices on the basis of their really possible (allowed) options, is developed. complexity analysis is also performed showing that the introduction of choices does not increase the complexity of computing preferred stable models.
parallel algorithms on geometric constraint solving. in this paper, we try to speed up geometric constraint solving with parallel techniques. we propose parallel algorithms for building rule-bases, judging the under(over)-constrained problems, and finding construction sequences of geometric constraint problems. experiment results show that the parallel algorithm can improve the efficiency of geometric constraint solving.
investigating adaptive mutation in the generalized generation gap (g3) algorithm for unconstrained global optimization. for function optimization problems in continuous search spaces, one of the main difficulties currently faced is that of locating high quality solutions. this problem is particularly pertinent for continuous multimodal problems where the quality rather than computational efficiency is more important as a test of the solver's ability to escape local optima and finding solutions near the global optimum [3]. moreover, this difficulty is further compounded when the function involves large numbers of variables, which translates into a highly deceptive fitness landscape with very large numbers of local optima [2].
compact sequential aggregate signatures. in this paper, a new notion which we call compact sequential aggregate signatures is introduced and formalized. informally, a compact sequential aggregate signature states the following thing: for a given message vector m=(m1, &middot; &middot; &middot; m&iota;), a public key vector pk=(pk1, &middot; &middot; &middot; , pk&iota;) and a path p=(v1, &middot; &middot; &middot; , v&iota;), where vi=(idi, pki), the size of the third component &sigma; in a sequential aggregate signature (m, p, &sigma;) is independent of the path length &iota; we propose a novel implementation of rsa-based regular signature scheme that works in an extended domain, and then transform it into a compact sequential aggregate signature scheme that works in a common domain such that the size of overflow bits is independent of the path length &iota; finally, we show that our implementation is provably secure in the random oracle model assuming that the rsa problem is hard.
web service orchestration and verification using msc and cp nets. designing web services-based processes (wsp) requires striking the balance between intuitive and easy to understand process representation for the interactive domain user and consolidated formal mathematical specification. an easy to understand process representation facilitates conformance of process correctness where as the formal mathematical specification ensures formal verification of service orchestration for executing the process. orchestration of services involves overall service design, service selection, and composition of services to achieve the overall goal. in this paper we present a novel approach to service orchestration that combines an effective diagrammatic modeling, an appropriate formal framework and an implementation process for dynamic wsp and complex web service composition and verification. specifically we introduce a new approach for wsp design and verification comprising of service orchestration using high level message sequence charts (hmsc) and colored petri nets (cp nets) that provides a methodology for analysis and verification at a process level as well as the service level.