waashk/dblp huggingface dataset:
surework: a super-peer reputation framework for p2p networks. reputation systems are proved mechanisms used to help nodes to decide whom to trust, to maintain the overall credibility of the system and to promote collaboration. this paper presents surework, a reputation framework based on super-peers. in surework, peers form clusters around super-reputation-peers (sure-peers) who help to increase the reputation knowledge. surework introduces incentives in order to promote that nodes with higher capabilities become super-peers and assume more tasks than normal peers. reciprocity is also promoted by encouraging peers to provide better services to most reputable client peers.
an intelligent editor for multi-presentation user interfaces. in ubiquitous computing, interactive applications are shipped with different variations of its user interface depending on the constraints imposed by the context in which they are running, such as the user, the computing platform and environment. a multi-presentation user interface is composed of a series of interconnected user interfaces for the same task to be carried out in different contexts of use. when access to software applications must be guaranteed in more than one context of use, it is necessary to automatically adapt the interface in order to preserve their usability when context switching occurs, for instance, a switch from a desktop to a pocket computer. to achieve this goal, this paper proposes a model and a visualization technique to express and manipulate the plasticity domains of a multi-presentation user interface. the plasticity domain denotes the set of contexts of use it is able to cover while preserving its usability. this paper focuses primarily on one aspect of the context of use: the computing platform and its screen size: when the dimensions of a graphical user interface change, the multi-presentation interface automatically switches to the presentation which is the most adapted to this screen. the model supports the definition of this plasticity domain in terms of window size and location. the visualization technique helps in both making observable the set of presentations that fit the available space, and perceiving which operations could help in switching from one presentation to another one. the model has been integrated into a user interface description language and is supported by an intelligent editor, because it infers from plasticity domains all the constraints and conditions required for context switching.
towards the generation of explanations for semantic web services in owl-s. in this article we define a system, called xplains that automatically generates an infrastructure for providing explanations of semantic web services described in owl-s. xplains has a strategy for generating production rules from a flow where several levels of distribution of the services exist.
continuous k-dominant skyline computation on multidimensional data streams. skyline queries are important due to their usefulness in many application domains. however, by increasing the number of attributes, the probability that a tuple dominates another one is reduced significantly. to attack this problem, k-dominant skylines have been proposed, relaxing the definition of domination. in this paper, we study the problem of continuous monitoring of k-dominant skylines, where multiple queries are running concurrently. the proposed method divides the space in pairs of attributes. for each pair, we compute skyline tuples and we exploit them to eliminate candidates tuples of the queries and we combine the partial results. the proposed scheme uses only simple domination checks and it is applicable to the streaming case as well as to ad-hoc insertions and deletions. experiments, based on different data distributions, show the efficiency of the proposed scheme in comparison to existing methods.
computing h/d-exchange speeds of single residues from data of peptic fragments. determining the hydrogen-deuterium exchange speeds of single residues from data for peptic fragments obtained by ft-ics ms is currently mainly done by manual interpretation. we provide an automated method based on combinatorial optimization. more precisely, we present an algorithm that enumerates all possible exchange speeds for single residues that explain the observed data of the peptic fragments.
multi-level biomedical ontology-enabled service broker for web-based interoperation. web services have recently become a new trend for gathering biomedical information. however, it is not easy to integrate and obtain a concise/complete query result among hundreds of services. in this paper, we propose a multi-level ontology-enabled service broker architecture for dynamically integrating web services in the biomedical domain. by incorporating temporal concept, new enhanced qos parameters allow service requesters to control more querying factors in order to precisely invoke corresponding service operations. we also define a unified biomedical service interface (ubsi) as a service deployment standard. our ultimate goal is to construct a public, scalable, and interoperable biomedical service platform based on ubsi to benefit scientists in data searching and publishing.
on the performance of tcp, udp and dccp over 802.11 g networks. this paper presents an experimental study of streaming multimedia packets using dccp transport protocol over 802.11 g networks. our main focus is to study the behavior of dccp flows over real-time multimedia applications. the approach taken was to use dccp flows in the presence of tcp and udp flows, then analyze the behavior of each protocol, mainly in regards to the congestion control algorithms of both protocols. furthermore, we also considered end-points mobility requirements, such as hand-off between multiples access points. needless to say, the dccp protocol was recently standardized by ietf as an alternative for streaming multimedia flows on computer networks. the results presented in this paper show that tcp and dccp protocols can share the network bandwidth without affecting each other. on the other hand, udp flows can aggressively degrade tcp and dccp flows due to the absence of any kind of flow control. although udp flows reach high bandwidth throughput, it loses a considerable amount of data taking into account limited bandwidth channels, such as 802.11g networks. finally, this work also shows that tcp and dccp can think of loss of packets as network congestion while experimenting hand-offs, thus decreasing their throughput.
adaptive data anonymization against information fusion based privacy attacks on enterprise data. privacy preservation is currently one of the key challenges in enterprise data management. data anonymization techniques address this by sanitizing and releasing anonymized data such that enterprises can share and disseminate sensitive information without compromising consumer privacy. however, current anonymization techniques are prone to attacks where-in an intruder can fuse external information with the anonymized data to infer sensitive information. in this paper, we pose and formulate the problem of information fusion based privacy attack. we experimentally demonstrate such an attack on a publicly available data set. we propose adaptive anonymization schemes to address this problem and experimentally demonstrate a prototype solution.
elements for a modular dynamic geometry system. dynamic geometry systems are tools for geomotric visualization. they allow the user to define geometric elements, establish relationships between them and explore the dynamic behavior of the remaining geometric elements when one of them is moved. in this work we propose a modular architecture for dynamic geometry systems built upon a set of functional units which will allow to apply some well known results from the geometric constraint solving field.
kernel-mode scheduling server for cpu partitioning: a case study using the windows research kernel. the ability to partition available computing power lays the foundation for predictable computing in different domains (e.g. multimedia applications or virtual machine execution). fine-grained computing power control can be used to implement applications which adapt themselves to changing performance requirements. the scheduling server concept can be used for implementing fine-grained cpu partitioning. in the past, several user-mode implementations of this idea were realized without any kernel modification. this paper describes a kernel-mode implementation and compares two different design alternatives. experiences of using the windows research kernel (wrk) for experiments with the scheduler are given. furthermore, benchmark results and possible applications are described.
using annotations in the naked objects framework to explore data requirements. the creation of conceptual data design that appropriately represents specific application domain is one of the main challenges in requirements engineering. an initiative to help designers is the naked objects framework, where it is possible to interact with conceptual model in a limited way. the interactions are restricted to entity creations and single object-relations. we created an extension of the naked objects framework using annotations to allow manipulation of higher level abstractions as specialization and object-relationship. these abstractions allow better interactions between the domain specialist and designers. the use of our approach to explore and validate data requirements has several benefits: 1) it reduces conceptual specification problems (like poorly data requirements identification); 2) it narrows the distance among domain and design specialists; 3) it allows the simultaneous exploration of the conceptual data design and the system requirements.
formal specification of dsp gateway for data transmission between processor cores of omap platform. in this article, formal models for the data transmission mechanism between arm and dsp cores of omap platform 161x via dsp gateway are presented. these models are represented as timed automata. the automata for the behavior of tasks running in the dsp when receiving requests of read or write operations from arm are described. data transmission between arm and dsp is modelled according to the mechanism offered by toklibios, the system kernel at dsp side. the formal model presented in this work helps developers to understand the communication mechanisms of dsp gateway and facilitates its usage and future development.
assessing the best integration between distance-function and image-feature to answer similarity queries. the retrieval of multimedia data relies on a feature extractor to provide the intrinsic characteristics (features) from the data, and a measure to quantify the similarity between them. a challenge in multimedia database systems is how to best integrate these two key aspects in order to improve the quality of the retrieved selection when answering similarity queries. in this paper, we analyze and compare a set of distance functions and feature extractors with regard to the association and dependencies among them. the results show that the most widely used and well-known distance functions, such as the euclidean distance, do not reach a desirable similarity assessment, and reveal that a careful choice of a distance function considerably improves the retrieval of multimedia data, which in our experiments reached up to 92%.
whom should i trust?: the impact of key figures on cold start recommendations. generating adequate recommendations for newcomers is a hard problem for a recommender system (rs) due to lack of detailed user profiles and social preference data. empirical evidence suggests that the incorporation of a trust network among the users of the rs can leverage such 'cold start' (cs) recommendations. hence, new users should be encouraged to connect to the network as soon as possible. but whom should new users connect to? given the impact this choice has on the delivered recommendations, it is critical to guide newcomers through this early stage connection process. in this paper, we identify key figures in the trust network (in particular mavens, connectors and frequent raters) and investigate their influence on the coverage and accuracy of a collaborative filtering rs. using a dataset from epinions.com, we demonstrate that the generated recommendations for new user are more beneficial if they connect to an identified key figure compared to a random user.
a nervous system model for direct dynamics animation control based on evolutionary computation. in this paper, we approach the relevant problem of controlling locomotion of articulated figures taking physics into account. the model proposed in this work determines the forces that actuate the articulated figure in order to obtain a desired locomotion goal. the controller developed for that purpose is based on some of the works on control of neuro-musculoskeletal representations of articulated figures and on neural oscillators encountered in the literature. our model, however, takes a more generic approach using evolutionary computation and is capable of automatically generating motion gaits while maintaining stability independently of the environment and of the controlled articulated figure. the limitations of the proposed controller are also discussed.
computational approach to biological validation of protein-protein interactions discovered using literature mining. in this paper we describe a computational technique to validate protein-protein interactions discovered using biomap, a literature mining system. two experiments were carried out to validate the interactions pairs. in this study, we used a total of 32,693 documents with 193,738 sentences related to multiple sclerosis from the medline literature database. from these sentences, biomap found 1004 explicit and 15,000 implicit protein interaction pairs of which 271 explicit and 16 implicit interactions were validated using the proposed techniques. these results indicate that the proposed methods can be effectively used for biological verification of protein-protein interactions that are obtained through literature mining.
elaboration of use case specifications: an approach based on use case fragments. use case description has gained a wide acceptance among the many techniques available for information systems requirements specification. however, piecing up all the details required for the production of a high quality use case can be a daunting task, especially for students and novice requirements professionals. this paper presents an approach aiming at reducing the time required for the elaboration of high quality use case specifications. the basis of the approach is to write a use case text using the composition of set of pre-defined fragments, where each fragment represents a recurring set of interactions required to achieve a sub-goal. each fragment can then be customized to meet use case goals. since each fragment is coded using the best practices for writing use case steps, both the fragment text and the final use case text will be well composed. we believe that this approach will allow novice requirements professional to write high quality use cases in less time than it would be necessary using the other approaches. our experience on writing use cases for business information systems using a catalogue of use case fragments suggested that they can be a facilitator in several aspects, not only improving the writing speed, but also leading to standardization and concision of use case specifications.
making colors worth more than a thousand words. content-based image retrieval (cbir) is a challenging task. common techniques use only low-level features. however, these solutions can lead to the so-called 'semantic gap' problem: images with high feature similarities may be different in terms of user perception. in this paper, our objective is to retrieve images based on color cues which may present some affine transformations. for that, we present csir: a new method for comparing images based on discrete distributions of distinctive color and scale image regions. we validate the technique using images with a large range of viewpoints, partial occlusion, changes in illumination, and various domains.
cat: a context-aware trust model for open and dynamic systems. the requirements for spontaneous interactions in open and dynamic systems create security issues and necessitate the incorporation of trust management into each software entity to make decisions. trust encompasses various quality attributes (e.g., security, competence, honesty) and helps in making appropriate decisions. in this paper, we present cat, an interaction-based context-aware trust model for open and dynamic systems by considering services as contexts. we identify a number of trust properties including context and risk awareness and address those in the proposed model. a context-similarity parameter is proposed to make decisions in similar situations. a time-based ageing parameter is introduced to change trust values over time without any further interaction. we present direct and indirect recommendations and apply path-based ageing on indirect recommendations. a mechanism to calculate the accuracy of recommendations is described. this accuracy is used to differentiate between reliable and unreliable recommendations in the total trust calculation.
exploring social annotations for web document classification. social annotation via so-called collaborative tagging describes the process by which many users add metadata in the form of unstructured keywords to shared content. in this paper, we explore and study social annotations and tagging with regard to their usefulness for web document classification by an analysis of large sets of real-world data. we are interested in finding out which kinds of documents are annotated more by end users than others, how users tend to annotate these documents, and in particular how this user-generated folk-sonomy compares with a top-down taxonomy maintained by classification experts for the same set of documents. we describe what can be deduced from the results for further research and development in the areas of document classification and information retrieval.
interoperability testing of a manet routing protocol using a node self-similarity approach. interoperability testing for ad hoc routing protocols is crucial to the reliability of wireless mobile ad hoc networks. nevertheless, most of the works in this area are devoted to simulations analyzing the performance of such protocols without taking into account their formal requirements and specifications. our works deal with formal methods to test the interoperability of a manet routing protocol, dsr. from previous works, many inconclusive verdicts were obtained on some test cases. we present therefore in this paper, a node self-similarity approach in order to improve the interoperability testing by reducing the number of these in conclusive verdicts.
a reliable b-tree implementation over flash memory. flash memory has been widely used in various embedded computing systems and portable devices in recent years because of its small size, shock-resistance, low-power consumption and non-volatile properties. to hide the disadvantages of flash memory such as out-of-place update, a flash translation layer (ftl) is usually used for providing transparent block-device emulation. but when index structures are implemented over ftl, intensive overwrite operations caused by record inserting, deleting, modifying and index reorganizing could not only degrade the performance significantly but also reduce the life of flash memory. to address the problem, bftl and ibsf are proposed. however, neither of them could avoid the loss of records and incompatibilities when system crash occurs. in this paper, a reliable b-tree implementation called rbftl is presented for flash-memory storage systems. it is placed between the application layer and ftl. rbftl could minimize the loss of data and eliminate incompatibilities effectively and efficiently when system crashes. the experimental results also show that rbftl yields a better performance than ftl.
partnering structure definition for networked businesses. rapidly changing market demands and increasing competitive pressure cause many businesses decide to collaborate with other businesses, forming what we call a 'networked business'. for the participants in a networked business to be able to promptly react to their customers' needs, they must set up as cornerstone a well-defined collaborative partnering structure. in this paper we discuss the partnering structure of networked businesses and present a framework for its formalization. using an example, we illustrate that existing approaches for value modeling, roles specification, and responsibilities definition can be used successfully if employed in a unifying way to address this structure concept.
flash memory management based on predicted data expiry-time in embedded real-time systems. flash memory based embedded systems are becoming increasingly prevalent. garbage collection mechanism is a critical issue in these systems, especially in embedded real-time systems. therefore, in this article, we discuss the influence of the capacity utilization (percentage of fullness) of the flash memory on allocating and recycling, and propose a new flash memory management technique, namely petfm. the proposed technique improves the performance of garbage collection mechanism by allocating free pages from different allocated-blocks for data to be updated, based on their predicted expiry-time. the analytical and experimental results show that garbage collection of petfm is more efficient and effective under high capacity utilization in embedded real-time systems.
knowledge-free discovery of domain-specific multiword units. the discovery of multiword units is one of the key steps in the preprocessing of raw text. in this paper, we propose a know ledge-free approach for the discovery on such entities- it does not only outperform state-of-the-art approaches, but is also fully unsupervised. furthermore, it does not demand the setting of any threshold, making it appropriate for usage by non-experts. the approach proposed is evaluated against five other metrics on a medical corpus.
visualization of rule-based programming. in this paper, we present the rule-maker system, which is a visualization approach of rule-based programming. compared to traditional rule-based programming, rule-maker provides an intuitive graphical interface to reduce programming effort and help developers focus on rule structure rather than rule syntax. programmers can implement graphical modules of algorithms. by connecting with lrr (laboratory for rapid rewriting), the visualization approach hides the computation detail information from the developer.
using traditional loop unrolling to fit application on a new hybrid reconfigurable architecture. this paper presents a strategy to modify a sequential implementation of an h.264/avc motion estimation to run on a new reconfigurable architecture called rosa. the modifications aim to provide more parallelism that will be exploited by the architecture. in the strategy presented in this paper we used traditional loop unrolling and profile information as techniques to modify the application and to generate a best fit solution to rosa architecture.