waashk/dblp huggingface dataset:
structured information retrieval in xml documents. query languages that take advantage of the xml document structure already exist. however, the systems that have been developed to query xml data explore the xml sources from a database perspective. this paper examines an xml collection from the viewpoint of information retrieval (ir). as such, we view the xml documents as a collection of text documents with additional tags and we attempt to adapt existing ir techniques to achieve more sophisticated search on xml documents. we employ a class of queries that support path expressions and suggest an efficient index, which extends the inverted file structure to search xml documents. this is accomplished by integrating the xml structure in the inverted file by combining the inverted file with a path index. the proposed structure is a lexicographical index, which may be used for the evaluation of queries that involve path expressions. moreover, this paper discusses a ranking scheme based on both the term distribution and document structure. some performance remarks are also presented.
bambootrust: practical scalable trust management for global public computing. global public computing platforms, such as planetlab, grid computing systems, and xenoservers, require facilities for managing trust to allow their participants to interact effectively in an open and untrusted environment. in this paper, we describe bambootrust, a practical, high-performance distributed trust management system for global public computing platforms. we present our peer-to-peer architecture, based on the xenotrust model and the bamboo distributed hash table. we describe the initial bambootrust implementation and deployment, and demonstrate that the system performs and scales more than adequately well by means of experimental evaluation.
field study on methods for elicitation of preferences using a mobile digital assistant for a dynamic tour guide. knowing tourists' individual preferences provides the possibility to offer personalized tours. the challenge is to capture these preferences using a mobile device. during a field study in g&ouml;rlitz three methods for elicitation were evaluated by computing the correlation between the tourists' and the algorithms' rankings. the results served to clarify fundamental questions en route to develop a personal tour guide. 1) is it possible to seed a general interest profile in the mobile context with all its distractions that allows the accurate prediction of actual rankings of sights? 2) are the interest profiles sufficiently diverse to base personalized tours on individual interest profiles instead of interest prototypes? 3) how do personalized tours affect the spatial behavior of tourists, do they really visit a broader set of attractions than before? analyzing the interest profiles gives an insight into their actual diversity, discusses their necessity and helps simulating an improved distribution of tourists at a destination.
ubiquitous presence systems. instant messaging has become a part of our daily live. instant communication, either with a mobile device or with a computer based application, is an increasingly used form of communication. in this paper we analyze how current instant messaging can be extended to a new and more general form of what we call 'ubiquitous presence systems'. we discuss how ubiquitous presence systems become a part of our daily live, extending the current systems, which only use states like 'online' and 'away', to location- and context-aware systems. we present the design space for ubiquitous presence systems together with a classification of those systems. we discuss information acquisition and also shortly address related privacy issues. we present an architecture for connecting arbitrary devices into the presence system, according to the vision of ubiquitous computing. we conclude the paper by presenting a fully working and deployed prototypical implementation following the developed architecture.
cathedrals, libraries and bazaars. the open source and open standards movements are sometimes confused and sometimes clash. this seems unfortunate as they are both vital to the growing acceptance of technology and have much to offer each other. expanding on the metaphors offered by eric raymond in his paper "the cathedral and the bazaar," this essay describes the similarities and differences between the concepts of open source and open standards. openness has a very different meaning as applied to software programs or technical standards. as this essay attempts to explain, the open source and open standards movements are most closely related by their desire to allow competition to thrive based on merit, not market dominance.
application run time estimation: a quality of service metric for web-based data mining services. the emergence of application service providers (asp) hosting internet-based data mining services is being seen as a viable alternative for organisations that value their knowledge resources but are constrained by the high cost of data mining software. response time is an important quality of service (qos) metric for web-based data mining service providers. the ability to estimate the response time of data mining algorithms apriori benefits both clients and service providers. the advantage for the clients is that it helps to impose qos constraints on the service level agreements and the benefit for the service-providers is that it facilitates optimising resource utilisation and scheduling. in this paper we present a novel rough sets based technique for identifying similarity templates to estimate application run times. we also present experimental results and analysis of this technique.
service specific anomaly detection for network intrusion detection. the constant increase of attacks against networks and their resources (as recently shown by the codered worm) causes a necessity to protect these valuable assets. firewalls are now a common installation to repel intrusion attempts in the first place. intrusion detection systems (ids), which try to detect malicious activities instead of preventing them, offer additional protection when the first defense perimeter has been penetrated. id systems attempt to pin down attacks by comparing collected data to predefined signatures known to be malicious (signature based) or to a model of legal behavior (anomaly based).anomaly based systems have the advantage of being able to detect previously unknown attacks but they suffer from the difficulty to build a solid model of acceptable behavior and the high number of alarms caused by unusual but authorized activities. we present an approach that utilizes application specific knowledge of the network services that should be protected. this information helps to extend current, simple network traffic models to form an application model that allows to detect malicious content hidden in single network packets. we describe the features of our proposed model and present experimental data that underlines the efficiency of our systems.
reducing borders of k-disjunction free representations of frequent patterns. a number of concise lossless representations of frequent patterns were proposed. except for closed patterns, all other representations of patterns consist of a main component and a border. recently, a unifying framework was introduced that treats border representations as particular cases of so called k-disjunction free representations. it was shown that careful splitting of borders into subgroups allows deletion of some of such subgroups without making the representations lossy. in this paper, we propose a new method of border reduction. our method consists in identifying patterns in the main representation's component that uniquely determine a possibly maximal subset of patterns from the group under reduction. such itemsets are redundant and can be deleted from border's groups. the performed experiments show that the new method reduces border representations by up to two orders of magnitude.
biomap: toward the development of a knowledge base of biomedical literature. biological literature databases continue to grow rapidly with vital information that is important for conducting sound biomedical research. as data and information space continue to grow exponentially, the need for rapidly surveying the published literature, synthesizing, and discovering the embedded "knowledge" is becoming critical to allow the researchers to conduct "informed" work, avoid repetition, and generate new hypotheses. knowledge, in this case, is defined as one-to-many and many-to-many relationships among biological entities such as gene, protein, drug, disease, etc. the knowledge discovery process basically involves identification of biological object names, reference resolution, ontology and synonym discovery, and finally extracting object-object relationships. the overall goal of this work is to investigate and develop a complete knowledge base, called biomap, using the entire medline collection of (over 12 million) bibliographic citations and author abstracts from over 4600 biomedical journals worldwide and to develop an interactive knowledge network for users to access this secondary knowledge (biomap) along with its primary databases such as the medline. in this paper we present the organization of a distributed database system to maintain the knowledge base of biomap and some preliminary results on biological object name identification problem based on an initial set of 30,000 medline abstracts.
evaluation of rule-based modularization in model transformation languages illustrated with atl. this paper studies ways for modularizing transformation definitions in current rule-based model transformation languages. two scenarios are shown in which the modular units are identified on the base of the relations between source and target metamodels and on the base of generic transformation functionality. both scenarios justify modularization by requiring adaptability and reusability in transformation definitions. to enable representation and composition of the identified units, a transformation language must provide proper modular constructs and mechanisms for their integration. we evaluate several implementations of the scenarios by applying different transformation techniques: usage of explicit and implicit rule calls, and usage of rule inheritance. atlas transformation language (atl) is used to illustrate these implementations. the experience with these scenarios shows that current languages provide a reasonably full set of modular constructs but may have problems in handling some composition tasks.
text mining agent for net auction. net auctions have been widely utilized with the recent development of the internet. however, it is a problem that there are too many items for bidders to select the most suitable one. we aim at supporting the bidders on net auctions by automatically generating a table which contains the features of several items for comparison. we construct a system called ntm-agent(net auction text mining agent). the system collects web pages of items and extracts the items' features from the pages. after that, it generates a table which contains the extracted features. this research focuses on two problems in the process. the first problem is that if the system collects items automatically, the results contain the items which is different from the items of the user's target. the second problem is that the descriptions in net auctions are not uniform (there are different formats such as sentences, items and tables. the subjects of some sentences are omitted.). therefore, it is difficult to extract the information from the descriptions by conventional methods of information extraction. this research proposes methods to solve the problems. for the first problem, ntm-agent filters the items by correlation rules about the keywords in the titles and the item descriptions. these rules are created semi-automatically by a support tool. for the second problem, ntm-agent extracts the information by distinguishing the formats. it also learns the feature values from plain examples for the future extraction.
a case study on building cots-based system using aspect-oriented programming. more and more software projects are using cots (commercial-off-the-shelf) components. using cots components brings both advantages and risks. to manage some risks in using cots components, it is necessary to increase the reusability of the glue-code so that the problematic cots components can easily be replaced by other components. aspect-oriented programming (aop) claims to make it easier to reason about, develop, and maintain certain kinds of application code. to investigate whether aop can help to build an easy-to-change cots-based system, a case study was performed by comparing changeability between an object-oriented application and its aspect-oriented version. results from this study show that integrating cots component using aop may help to increase the changeability of the cots component-based system, if the cross-cutting concerns in the glue-code are homogenous (i.e., consistent application of the same or very similar policy in multiple places). extracting heterogeneous or partial homogenous crosscutting concerns in glue-code as aspects does not provide benefits. results also show that some limitations in aop tools may make it impossible to use aop in cots-based development.
light-weight service-oriented grid application toolkit. grid has been focused in a distributed computing community. there has been a lot of research in these areas, especially for design and development of grid middleware. more recently, the service-oriented architecture based on web services rapidly became a major issue. the service-oriented architecture provides a modularized functionality to grid applications. however, this new technology has some limitations. web services basically works with the soap protocol, but it is not suitable for massive scientific data. in this paper, we propose mage, modular and adaptive grid environment, which is uses dynamically reconfigurable component architecture with interfaces. mage provides several level of transparency to the grid application development, and it can dynamically reconfigure its architecture to adapt to heterogeneous grid environments.
inference of transcriptional regulation relationships from gene expression data. we propose a new method for finding potential regulatory relationships between pairs of genes from microarray time series data and apply it to expression data for cell-cycle related genes in yeast. we compare our algorithm, dubbed the event method, with the earlier correlation method and the edge detection method by filkov et al. when tested on known transcriptional regulation genes, all three methods are able to find similar numbers of true positives. the results indicate that our algorithm is able to identify true positive pairs that are different from those found by the two other methods. we also compare the correlation and the event methods using synthetic data and find that typically, the event method obtains better results.
another step towards a smart compilation manager for java. in a recent work we have proposed a compilation strategy (that is, a way to decide which unchanged sources have to be recompiled) for a substantial subset of java which has been shown to be sound and minimal. that is, an unchanged source is recompiled if and only if its recompilation produces a different binary or an error. however, that model does not handle two features of java, namely, compile-time constant fields (static final fields initialized by a compile-time constant of a primitive type or string) and unreachable code, which turn out to be troublesome for having a sound and minimal compilation strategy. to our best knowledge these two features, probably because of their low-level nature, have been omitted in all models of java separate compilation written so far. yet, a compilation strategy for full java has to deal with them. thus, in this paper we analyze the implications of handling compile-time constant fields and unreachable code, and extend our previous model in order to handle these two features as well.
introducing safe unknown types in java-like languages. most mainstream object-oriented languages, like c++, java and c#, are statically typed. in recent years, untyped languages, in particular scripting languages for the web, have gained a lot of popularity notwithstanding the fact that the advantages of static typing, such as earlier detection of errors, are widely accepted. we think that one of the main reasons for their widespread adoption is that, in many situations, the ability of ignoring types can be handy to write simpler and more readable code.we propose an extension of java-like languages which allows developers to forget about typing in strategic places of their programs without losing type-safety. that is, we allow programmers to write simpler code without sacrificing the advantages of static typing. this is achieved by means of inferred type constraints. these constraints describe the implicit requirements on untyped code to be correctly invoked.this flexibility comes at a cost: field accesses and method invocations on objects of unknown types are less efficient than regular field accesses and method invocations. also, our type system is currently more restrictive than it should be; its extension is the subject of ongoing work. however, the novel approach presented here is quite interesting on its own, as it supports separate compilation and there is zero runtime overhead on code which does not take advantage of the new features.
cost efficient broadcast based cache invalidation for mobile environments. to improve the performance of mobile computers, a number of broadcast based cache invalidation schemes have been proposed in the past to support object locality. however most of these schemes have focused on providing support for client disconnection and reducing query delay. the size of invalidation reports and the effect of invalidating items cached by many clients are also important issues that must be addressed in order to provide cost-efficient cache invalidation in a mobile environment. in this paper, we propose two techniques, validation-invalidation reports (vir) and the delayed requests scheme (drs) to address these issues. vir uses a combination of validation and invalidation reports, allowing the server to construct and broadcast smaller reports at each interval, thus improving downlink channel utilization. drs addresses the problem where multiple clients request for the same data items. it introduces a "cool down" period after an invalidation, to reduce the number of uplink requests sent by clients. simulation results show that compared to the original ts approach [1], the proposed schemes lower transmission cost associated with cache invalidation by between 5%-25% in the downlink channel and between 10%-40% in the uplink channel.
from satisfiability to consistency through certificates: application to partially defined constraints. in this paper, we propose a method to automatically derive a filtering algorithm from a constraint expressed by its satisfiability function. we give an application of the technique in the field of machine learning in which partially defined constraints are learned by decision trees.
bbq: group-based querying in a ubiquitous environment. the cost of sending queries to a server is high for mobile ubiquitous hosts. to address this, we adopt query consolidation mechanism, by exploiting the knowledge of similar queries generated by neighboring hosts to the server, especially in location-dependent applications. we propose a group-based query processing scheme, where group members are close in location and moving direction, to collectively deliver the aggregate querying need from members to the server. a leader or boss elected within each group is responsible for gathering and consolidating data requests from members, within an adaptive query listening period. we conducted simulated experiments to study the performance improvement with our scheme.
solving strategies using a hybridization model for local search and constraint propagation. hybridization of local search and constraint programming techniques for solving constraint satisfaction problems is generally restricted to some kind of master-slave combinations for specific classes of problems. in this paper we study combination strategies at a finer hybridization grain, based on a theoretical model for hybridization of local search and constraint propagation. in this framework, hybrid resolution can be achieved as the computation of a fixpoint of some specific reduction functions. some experimental results show the interest of the model to design such hybridizations.
trading services in ontology-driven markets. in order to realize the vision of a full-fletched service oriented architecture efficient service discovery and allocation is required to coordinate the interplay between service providers and requesters. this paper presents the architecture of an ontology-driven market for trading semantic web services. an auction schema is enriched by a set of components enabling semantics based matching as well as price-based allocations. moreover, an approach for reducing the complexity of the auction system by means of background knowledge is proposed.
a ubiquitous computing environment for aircraft maintenance. ubiquitous computing bears a high potential in the area of aircraft maintenance. extensive requirements regarding quality, safety, and documentation as well as high costs for having aircrafts idle during maintenance demand for an efficient execution of the process. major weaknesses that impact the efficiency of the process are an inadequate tool management, human erros, and labour intensive manual documentation and check procedures. in this paper we propose a solution using ubiquitous computing technologies that improves aircraft maintence and provides a high level of usability. a scenario, a systems architecture, and maintenance applications are presented. the smart toolbox and the smart tool inventory were implemented as proof of concept.
innovative computational methods for transcriptomic data analysis. the tools of molecular biology and the evolving tools of genomics can now be exploited to study the genetic regulatory mechanisms that control cellular responses to a wide variety of stimuli. these responses are highly complex, and involve many genes and gene products. the main objectives of this paper are to describe a novel research program centered on understanding these responses by developing powerful graph algorithms that generate distilled gene sets, producing high performance implementations utilizing cutting-edge platforms, employing these implementations to identify gene sets suggestive of coregulation, and performing sequence analysis and genomic data mining to examine, winnow and highlight the most promising gene sets for more detailed investigation. as a case study, we describe our work aimed at elucidating genetic regulatory mechanisms that control cellular responses to low dose ionizing radiation (ir). we use genome-scale gene expression data after ir exposure in vivo to identify the pathways that are activated or repressed as a tissue responds to the radiation insult. knowledge of these pathways should help clarify and interpret physiological responses to ir, which will advance our understanding of how ir exposures pose an increased risk to human health.