waashk/dblp huggingface dataset:
xml retrieval: what about using contextual relevance? the aim of this study is to evaluate the impact of context to better identify relevant elements in xml retrieval. context is represented here by clues on whole document relevance. we represent context according to different points of view: by introducing document dimension while computing terms weights, by using document relevance when evaluating elements relevance or by ranking elements on document relevance. experiments were undertaken on inex collection, and results showed the interest of contextual relevance and a relative high precision of our proposal comparing to inex official results.
mining dependence rules by finding largest itemset support quota. in the paper a new data mining algorithm for finding the most interesting dependence rules is described. dependence rules are derived from the itemsets with support significantly different from its expected value and therefore considered interesting. since such itemsets are distributed non-monotonically in the lattice of all itemsets the support monotonicity property cannot be used for their search. instead we estimate upper/lower bounds for the support to find itemsets with large interval of possible support values called support quota. since the support quota is known to be monotonically decreasing the search space can be effectively restricted. strongly dependent itemsets are selected by computing their expected support using iterative proportional fitting algorithm and comparing it with the real itemset support.
grouping and aggregation in the concept-oriented data model. in the paper we describe the problem of grouping and aggregation in the concept-oriented data model. the model is based on ordering its elements within a hierarchical multidimensional space. this order is then used to define all its main properties and mechanisms. in particular, it is assumed that elements positioned higher are interpreted as groups for their lower level elements. two operations of projection and de-projection are defined for one-dimensional and multidimensional cases. it is demonstrated how these operations can be used for multidimensional analysis.
light stemming approaches for the french, portuguese, german and hungarian languages. this paper describes and evaluates various general stemming approaches for the french, portuguese (brazilian), german and hungarian languages. based on the clef test-collections, we demonstrate that light stemmers for the french, portuguese and hungarian languages perform well, and reasonably well for the german language. variations in mean average precision among the different stemming approaches are also evaluated and sometimes they are found statistically significant.
are multiagent algorithms relevant for real hardware? a case study of distributed constraint algorithms. researchers building multi-agent algorithms typically work with problems abstracted away from real applications. the abstracted problem instances allow systematic and detailed investigations of new algorithms. however, a key question is how to apply algorithm, developed on an abstract problem, in a real application. in this paper, we report on what was required to apply a particular distributed resource allocation algorithm developed for an abstract coordination problem in a real hardware application. a probabilistic representation of resources and tasks was used to deal with uncertainty and dynamics and local reasoning was used to deal with delays in the distributed resource allocation algorithm. the probabilistic representation and local reasoning enabled the use of the multi-agent algorithm which, in turn, improved the overall performance of the system.
separation, review and supervision controls in the context of a credit application process: a case study of organisational control principles. this paper presents a case study of the organisational control principles present in a credit application process at the branch level of a bank. the case study has been performed in the context of an earlier suggested formal framework [6] for organisational control principles based on the alloy predicate logic and its facilities for automated formal analysis and exploration [2].in particular, we establish and validate the novel concepts of specific and general obligations. the delegation of these two kinds of obligations must be controlled by means of review and supervision controls. the example of a credit application process is used to discuss these organisational controls.
a case study of separation of duty properties in the context of the austrian "elaw" process. over the last few years rapid progress has been made in moving from conceptual studies, "whitepapers" and initiatives to the actual deployment of e-government systems [13]. in this paper we present the case study of an existing e-government system (elaw) which already supports key legislative processes in the country of austria1. the study has been performed in the context of the eu fp6 project "ejustice".we present a detailed system and workflow representation referring to the example process of changing a federal law in austria. since such processes and their results, i.e. the laws of a country, have an enormous impact on society, they need to be secured against external and internal alteration, be it inadvertent or malicious. this is even more important in the electronic world.instead of discussing the obvious security requirements like virus protection or network-level access control, our focus is on an often neglected form of organisational security and control properties called separation of duties. we will analyse and discuss a set of these in terms of the described elaw process.
extending the business engineering framework for application integration purposes. current concepts of enterprise application integration often focus on technical issues only. previous, more holistic approaches of deriving information system concepts from business requirements often addressed the development of a new information system replacing the existing, not integrated systems. in this paper, we describe an extension of the business engineering framework for application integration purposes.
a posteriori defensive programming: an annotation toolkit for dos-resistant component-based architectures. denial-of-service (dos) attacks are a major concern for modern distributed applications. they exploit weakness in the software in order to make it unavailable to well-behaved users. building dos resistant software is still an issue. solutions relying on the use of annotations have been proposed. nevertheless, they require modifying the source code of the application, and must thus be applied at design time. in this paper, we propose an annotation toolkit that allows building dos resistant component-based systems. the solution we propose does not require any modification of the source code of the application. moreover it can be applied at deployment time. its implementation relies on the use of aspect-oriented programming techniques together with java 1.5 annotations.
bulkloading and maintaining xml documents. the popularity of xml as a exchange and storage format brings about massive amounts of documents to be stored, maintained and analyzed --- a challenge that traditionally has been tackled with database management systems (dbms). to open up the content of xml documents to analysis with declarative query languages, efficient bulk loading techniques are necessary.database technology has traditionally been offering support for these tasks but yet falls short of providing efficient automation techniques for the challenges that large collections of xml data raise. as storage back-end, many applications rely on relational databases, which are designed towards large data volumes. this paper studies the bulk load and update algorithms for xml data stored in relational format and outlines opportunities and problems. we investigate both (1) bulk insertion and deletion as well as (2) updates in the form of edit scripts which heavily use pointer-chasing techniques which often are considered orthogonal to the algebraic operations relational databases are optimized for. to get the most out of relational database systems, we show that one should make careful use of edit scripts and replace them with bulk operations if more than very small portion of the database is updated.we implemented our ideas on top of the monet database system and benchmarked their performance.
integrated querying of xml data in rdbmss. this paper proposes a way to integrate cleanly relational databases and xml documents. the main idea is to draw a clear line of demarcation between the two concepts by modelling xml documents as a new atomic sql type. the standardised xml tools like xpath, xquery, xslt are then user-defined functions that operate on this type. well-defined interoperability is guaranteed by, on the one hand, defining a standard way to markup sql relations as xml documents and, thus, to make them accessible to the xml tools; on the other hand, xpath and xquery queries run against the xml portion of the database can use the same predefined schema to make their results accessible to the sql language for further processing. additionally, a method for set-oriented evaluation of regular path expressions is presented that integrates into our implementation framework.
methods and guidelines for the design and development of domestic ubiquitous computing applications. in our research we investigate how applications can be conceived, designed, and implemented that fit into people's home environments. in particular we describe our method of how user centred design and participatory design can be appropriated to find users' requirements and design ideas for ubiquitous computing applications for the home. in our example we focus on information presentation and display appliances. in the process we go from individual solutions, fitting a single persona each, to more generic prototypes. based on this we provide a set of guidelines for the design of display appliances in the home environment.
expanding the taxonomies of bibliographic archives with persistent long-term themes. as document collections accummulate over time, some of the discussion subjects in them become outfashioned, while new ones emerge. in this paper, we address the challenge of finding such emerging and persistent "themes", i.e. subjects that live long enough to be incorporated into a taxonomy or ontology describing the document collection. our method is based on similarity-based clustering and cluster label construction and focusses on the identification of cluster labels that "survive" changes in the constitution of the underlying population of documents, including changes in the feature space of dominant words. we conducted a set of promising experiments on the identification of themes that manifested themselves in the acm library within the last decade.
a knowledge based system for content-based retrieval of scalable vector graphics documents. scalable vector graphics (svg), the novel xml based language for describing two-dimensional graphics, is now a w3c standard and it is likely to become popular on the internet, due to its inherent advantages over raster image formats in several domains. we present a system for semantic based retrieval by content of svg. the system is endowed of a web crawler for documents search and a graphical interface for query by sketch. the approach adopted in the system implements a simple description logic devised for the semantic indexing and retrieval of complex objects. its syntax allows to describe basic shapes and complex objects as compositions of basic ones, and transformations. its extensional semantics, which is compositional, allows to define retrieval, classification, and subsumption services. an experimental evaluation is also presented, which shows results obtained in terms of precision and recall, but also points out that there are still few svg documents available on the web.
a relational approach to software metrics. there is still no standardization of software measures and metrics extraction tools have to be updated frequently to handle the changes. a possible solution is represented by using an intermediate abstraction layer to decouple the information extraction process from the use of the information. in this way a metrics researcher do not have to deal with language parsing production concepts such as declarations, class specifiers, and base clauses. this paper presents webmetrics, an automated tool for software metrics collection. the tool uses, as intermediate layer, a set of intuitive relations to describe the source code structure. these relations are stored in a database in order to calculate metrics directly by performing sql queries. to test the architecture, we applied the tool to the source code of an opensource project in order to compute ck metrics suite.
trust enhanced ubiquitous payment without too much privacy loss. computational models of trust have been proposed for use in ubicomp environments for deciding whether to allow customers to pay with an e-purse or not. in order to build trust in a customer, a means to link transactions using the same e-purse is required. roughly, trust is a result of knowledge. as the number of transactions increases, the resulting increase in knowledge about the user of the e-purse threatens privacy due to global profiling. we present a scheme (and its prototype) that mitigates this loss of privacy without forbidding the use of trust for smoothing payment by giving the opportunity to the user to divide trust (i.e. transactions) according to context (e.g. location, user's current activity or subset of shops).
editorial message special track on trust, recommendations, evidence and other collaboration know-how (treck). computational models of trust and mechanisms based on the human notion of trust have been gaining momentum over the last couple of years. one reason for this is that traditional security mechanisms are challenged by open, large scale and decentralised environments. the use of an explicit trust management component goes beyond security though. trust has been used in reputation systems, collaborative filtering, social/business networking services, dynamic coalitions and virtual organizations. two very successful real-world applications based on computational trust are googletm's pageranktm trust metric, where the entities are the web pages and their trust relationships are the hyperlinks between the pages, and ebay@'s user profile score, which represents the trustworthiness of a user according to recommendations about past transactions.
editorial message: second special track on trust, recommendations, evidence and other collaboration know-how (treck'06). with the emerging wave of web 2.0 applications and their core decentralised user-centric pillar, there is an increased need for mechanisms to deal with uncertainty to still reap the benefits of collaboration and filter; facilitate and support decision-making; filter and secure the large scale number of the interconnected elements of these new popular applications. for example, peer-to-peer file sharing needs mechanisms to avoid downloading risky files and to optimise performance in a decentralised way.
learning temporal patterns for anomaly intrusion detection. for the last decade an explosive spread of computer systems and computer networks has resulted in a society that is increasingly dependent on information stored on these systems. a computer system connected to the network is accessible from another computer in this network regardless of its geographical position. along with providing many benefits for legitimate users this technology creates almost unlimited opportunities for malicious persons, which using software vulnerabilities may successfully penetrate the networked computer systems. in order to eliminate potential devastating consequences caused by breaches in computer systems, more and more attention is drawn to the information security problems. however, despite these efforts, the occurrences of the security violations in the computer networks became increasingly frequent. in this paper we discuss an approach to detect the intrusions. being able to accurately recognize its legitimate users a system may effectively detect masqueraders. the paper particularly focuses on the question of temporal pattern extraction from user behavior and shows that sequential patterns are not the only ones that may be found in user events sequences. there are also temporal patterns present in user behavior, which together with sequential may be used for efficient user recognition.
designing and specifying mobility within the multiagent systems engineering methodology. recently, researchers have created many platforms and applications for mobile agents; however, current agent-oriented software engineering (aose) methodologies have yet not fully integrated the unique properties of these mobile agents. this paper attempts to bridge the gap between current aose methodologies and mobile agent systems by incorporating mobility into the established multiagent systems engineering (mase) methodology. we accomplished this by adding a move command to the mase analysis models and then defined the required transformations to incorporate the required functionality into the design. finally, we translated the design models into java-based agents that operate within a mobile agent environment.
stochastic study of real-time transactions success ratio. the well-known and accepted criterion for measuring real-time database systems (rtdbss) performances is to maximize the transactions success ratio. in this paper, we focus on a stochastic study of firm real-time transactions, i.e, transactions which are aborted and discarded as soon as they have missed their deadlines. the results we obtained is the reasonable approximation of this ratio behavior by a probabilistic distribution with defined parameters. to achieve this objective and due to the lack of real data, we have designed a simulator based on components including probabilistic characteristics: a transactions generator and a conflicts generator. the latter is based on data conflicts level. after testing two kinds of concurrency control protocols, a pessimistic and an optimistic one, simulation results have helped us to determine load conditions where a kind of protocol is better than the other.
infotainment across access devices: the perceptual impact of multimedia qos. the introduction of multimedia on pervasive and mobile communication devices raises a number of perceptual quality issues. however, limited work has been done examining the 3-way interaction between use of equipment, user perceptual quality and quality of service. our work measures user perceptual quality with the quality of preception (qop) metrics which comprises levels of informational transfer (objective) and user satisfaction (subjective) when users are presented with multimedia video clips at three different frame rates, using four different display devices. finally, our results will show that variation in frame-rate does not impact a user's level of information assimilation (ia), however, does impact a users' perception of multimedia video 'quality'.
a semantic framework for the recursive specification of interaction protocols. this paper addresses two major problems concerning the specification of interaction protocols: the lack of an established semantic framework which precisely identifies the modelling elements that different kind of specification techniques may exploit in their specifications; and the lack of techniques which allow designers to reuse pre-specified protocols by specialising them in more specific domains. we deal with these issues in the context of the organisational framework provided by the rica theory, and propose a new formalism based on so-called interaction state machines, which will be applied to the re-design of some protocols of the fipa ipl.
communication delay in wormhole-routed torus networks. a new analytical model for predicting message delay in wormhole-routed torus is presented. unlike previous wormhole routing models, which mainly have been developed for uniform traffic, the model introduced in this paper computes message latency in the wormhole-routed torus in the presence of broadcast traffic. results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.
depth-first frequent itemset mining in relational databases. data mining on large relational databases has gained popularity and its significance is well recognized. however, the performance of sql based data mining is known to fall behind specialized implementation since the prohibitive nature of the cost associated with extracting knowledge, as well as the lack of suitable declarative query language support. we investigate approaches based on sql for the problem of finding frequent patterns from a transaction table, including an algorithm that we recently proposed, called propad (pro-jection pattern discovery). propad fundamentally differs from an apriori-like candidate set generation-and-test approach. this approach successively projects the transaction table into frequent itemsets to avoid making multiple passes over the large original transaction table and generating a huge sets of candidates. we have made performance evaluation on dbms (ibm db2 udb eee v8) and compared the performance results with k-way join approach proposed in [11] and sql based fp-tree approach proposed in [13]. the experimental results show that our algorithm can get efficient performance.
sql based frequent pattern mining without candidate generation. scalable data mining in large databases is one of today's real challenges to database research area. the integration of data mining with database systems is an essential component for any successful large-scale data mining application. a fundamental component in data mining tasks is finding frequent patterns in a given dataset. most of the previous studies adopt an apriori-like candidate set generation-and-test approach. however, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. in this study we present an evaluation of sql based frequent pattern mining with a novel frequent pattern growth (fp-growth) method, which is efficient and scalable for mining both long and short patterns without candidate generation. we examine some techniques to improve performance. in addition, we have made performance evaluation on commercial dbms (ibm db2 udb eee v8).
a framework for (re)deploying components in distributed real-time and embedded systems. this paper describes the resource allocation and control engine (race) that integrates multiple resource management algorithms for (re) deploying and managing performance of application components in distributed real-time and embedded (dre) systems. race enables dre systems to (re) configure allocation and control algorithms depending on application characteristics and environmental conditions. it also enables developers to focus on algorithm logic, while reusing many mechanisms used to (re)configure and (re)deploy the algorithms on distributed computing nodes.