waashk/dblp huggingface dataset:
a framework to process complex biodiversity queries. tackling biodiversity information is essentially a distributed effort. data handled are inherently heterogeneous, being provided by distinct research groups and using different vocabularies. queries in biodiversity systems require to correlate these data, using many kinds of knowledge on geographic, biologic and ecological issues. available biodiversity systems can only cope with part of these queries, and end users must perform several manual tasks to derive the desired correlations, because of semantic mismatches among data sources and lack of appropriate operators. this paper presents a solution based on web services to meet these challenges. it relies on ontologies to retrieve the query contexts and uses the terms of this context to discover suitable sources in data repositories. this approach is being tested using real data, with new services.
fourth special track on trust, recommendations, evidence and other collaboration know-how (treck'08): editorial message. computational trust and online reputation services are reaching the mass market with pioneering startup reputation companies such as venyo (http://www.venyo.org). the trust models and metrics used in those reputation services can again benefit from the treck track contributions, especially regarding their combination with recommender systems and their context-awareness aspects.
error estimation in wireless sensor networks. we present an analogy between the operation of a wireless sensor network and the sampling and reconstruction of a signal. we measure the impact of three factors on the quality of the reconstructed data, namely, the granularity of the process under study, the spatial distribution of sensors, and the protocol for clustering and data aggregation. in order to quantify this influence, a monte carlo study is performed for estimating the error introduced by the observation process. the phenomenon being observed is described by a gaussian random field with varying scale, the distribution of sensors is modeled by a new point process and two protocols are assessed: leach and skater. we show that skater performs better than leach, at the expense of using the sampled data on the clustering stage.
certifying an embedded remote method invocation protocol. this paper describes an approach to formally prove that an implementation of the java card remote method invocation protocol on smart cards fulfills its functional and security specification. for that, we refine the specification in two intermediate formal models: the functional specification and the high level design. these two models are both defined upon an existing complete formal model of the java card virtual machine, allowing to formalize all the security requirements. we focus on certifying the java code portion since the native portion has been handled in a previous work. the correctness is showed to be preserved while composing the native and java codes. our refinement scheme has been designed to fulfill the requirements of a high-level common criteria security evaluation.
lts-bt: a tool to generate and select functional test cases for embedded systems. automation of model-based testing for embedded systems is discussed. the focus is on feature and feature interruption test case generation and selection from behavioral specifications. for this, the lts-bt tool is presented. the tool has been designed to suit embedded systems by focusing on selected notations for behavior specification and tailored techniques for test case generation and selection. this is motivated by the particularities of these systems that challenge cost-effective testing.
ecg data provisioning for telehomecare monitoring. the latest computer and communication technologies in combination with an enhanced ecg analysis system can be used to improve cardiac patient's follow-up out-of-hospital. in this way, real-time transmission of the so-called ambulatory electrocardiogram (aecg) to a remote health application with awareness of the patient's context can support decision making as well as to allow efficient emergency attendance. however, the effectiveness of such a service requires tackling challenges of hardware and software beyond the common issues normally addressed in the literature. this paper proposes an ecg provisioning system that handles advanced issues such as flexibility and interoperability in pervasive scenarios as much as the well-known need for efficient transmission. this system architecture embraces an ecg analysis system based on hidden markov models and makes use of an original ecg markup language.
k-rnn: k-relational nearest neighbour algorithm. the amount of data collected and stored in databases is growing considerably in almost all areas of human activity. in complex applications the data involves several relations and proposionalization is not a suitable approach. multi-relational data mining algorithms can analyze data from multiple relations, with no need to transform the data into a single table, but are computationally more expensive. in this paper a novel relational classification algorithm based on the k-nearest neighbour algorithm is presented and evaluated.
implementing java modeling language contracts with aspectj. the java modeling language (jml) is a behavioral interface specification language (bisl) designed for java. it was developed to improve functional software correctness of java applications. however, instrumented object program generated by the jml compiler use the java reflection mechanism and data structures not supported by java me applications. to deal with this limitation, we propose the use of aspectj to implement a new jml compiler, which generates an instrumented bytecode compliant with both java se and java me applications. the paper includes a comparative study to demonstrate the quality of the final code generated by our compiler. the size of the code is compared against the code generated by an existent jml compiler. moreover, we evaluate the amount of additional code required to implement the jml assertions in java applications. results indicate that the overhead in code size produced by our compiler is very small, which is essential for java me applications.
requirements engineering for cots-based software systems. large software systems are often deployed putting together many commercial-off-the-shelf software components (cots). the selection of the cots to be integrated is driven by the software system requirements. in this paper, we propose the recss method aimed at supporting requirements elicitation and analysis in the context of cots-based software systems. recss builds a goal model of the system environment which identifies the external elements that interact with it. next, the system is decomposed into actors for which iso/iec-based quality models are built. as part of the process, environmental and platform characteristics that influence the behaviour of the system are identified. last, the resulting artefacts are used to analyse and refine the system requirements.
evaluation of priority based real time scheduling algorithms: choices and tradeoffs. real time scheduling algorithms like rm and edf have been analyzed extensively in the literature. many recent works on scheduling address energy consumption as a performance metric. in this work we analyze priority scheduling algorithms rm, edf, and llf along with a few power-aware scheduling algorithms: mllf, rm_rcs and edf_rcs. our analysis addresses the following metrics: response time, response time jitter, latency, time complexity, preemptions, and energy consumption. we extend past work in this direction by characterizing the performance of the scheduling algorithms -- theoretically as well as experimentally. results of our analysis can be used to control design choices for real time systems.
applying a semantic layer in a source code search tool. a fundamental principle for reusing software assets is providing means to access them. information retrieval mechanisms assisted by semantic initiatives, play a very important role in finding relevant reusable assets. in this context, this paper presents a semantic search tool in order to improve the precision of search returns. furthermore, the requirements, the decomposition of architectural module and aspects of implementation are presented.
an algorithm for effective deletion and a new optimization technique for metric access methods. in our work we developed an algorithm to effectively remove elements from a metric tree, using the mam slim-tree as a case study. we also propose a new optimization technique for the structure, based on the deletion algorithm.
pffs: a scalable flash memory file system for the hybrid architecture of phase-change ram and nand flash. in this paper, we present the scalable and efficient flash file system using the combination of nand and phase-change ram (pram). until now, several flash file systems have been developed considering the physical characteristics of nand flash. however, previous flash file systems still have a high performance overhead and a scalability problem of the mounting time and the memory usage because, in most case, the metadata is written with several words at a single update even though the writes in nand flash must be performed in terms of page, which is typically 2 kib. the proposed flash file system called pffs uses pram to mitigate the limitation of nand flash. the pram is a next generation non-volatile memory and good for dealing with word level read/write of a small size of data. pffs hence separates the metadata from the regular data in a file system and saves them into pram. consequently, the pffs manages all the files and directories in the pram and outperforms other flash file systems. the experimental results show that the performance of pffs is 25% better than yaffs2 for small-file writes while matching yaffs2 performance for large writes and the mouting time and the memory usage of pffs are o(1).
towards an assl specification model for nasa swarm-based exploration missions. nasa swarm-based exploration missions represent a new class of concept missions based on the cooperative nature of a hive culture. a mission of this class requires an autonomic system, comprising a set of autonomous mobile units. the design and implementation of such systems requires specific engineering approaches, including new formal specification methods and techniques. this article presents an introduction to our research towards a formal specification of nasa concept swarm-based missions. the autonomic system specification language (assl) is a framework for formally specifying and generating autonomic systems. with assl, we can specify high-level behavior policies, as part of overall system behavior, which shows that assl is a very appropriate language for specifying the autonomic behavior of swarm-based missions. we show how assl can be used to specify self-configuring, self-healing, and safety properties of nasa swarm-based missions.
special track on organizational engineering: editorial message. dominated by the behavioral science approach for a long time, information systems research increasingly acknowledges design science as a complementary approach. the systematic design of artifacts is not restricted to information systems components. being the conceptual foundations for information systems requirements, artifacts on the strategic and organizational levels have to be engineered as well.
a study of terrain coverage models. the ability to cover a terrain has numerous applications to our everyday lives: from spell checking to web crawling, from surveillance to automated vacuuming. indeed, these applications require different approaches to solving the coverage problem because they are based on different ways of evaluating the goodness of the coverage; a good terrain coverage to vacuuming may not be desirable in web crawling. to better understand the issues, this paper divides the terrain coverage problem into two classes (temporal and spatial) and discusses the performance of standard and self-organized algorithms as means of solving both classes of coverage problem. in order to perform the comparison the paper introduces suitable metrics to evaluate the goodness of a coverage (temporal or spatial).
self and non-self discrimination agents. the goal of this work is to study emergent mechanisms that could possibly be embedded in multiagents systems in order to solve complex problems of distributed diagnosis. we assume the hypothesis that emergent functionalities share important structural and constitutive aspects, independently of the domain from which they emerge. the challenge of understanding self-organizing mechanisms (which allow that emergence occurs in nature) is important to develop systems able to better learn and adapt. following such perspective we have been studying the human immune system (his) as a metaphor to solve problems where complexity and distribution are crucial constraints. work in this paper reflects how characteristics from the his can be applied to conceive diagnosis systems. an application was implemented to student diagnosis in the context of an educational environment for learning basic programming skills.
scara3d: 3-dimensional hri integrated to a distributed control architecture for remote and cooperative actuation. during the last years, service robots have been widely applied in home and office automation tasks. the major challenge faced at present by researchers in this area lies on the capability of humans and robots to share the same environment safely. despite the feet that several solutions for this problem involving service robots have already been presented, this subject is rarely discussed involving industrial manipulators. in this paper we present a new approach of multilayer architecture for distributed control of manipulator robots. the proposed model describes layers to implement cooperative and collaborative behaviors among robots and human beings based on an appropriate model of rules. the scara3d, a human-robot interface, is presented as an application for the architecture's virtual environment creator layer.
a hybrid software-based self-testing methodology for embedded processor. software-based self-test (sbst) is emerging as a promising technology for enabling at-speed testing of high-speed embedded processors testing in an soc system. for sbst, test routine development or generation can base on deterministic and random methodology. the deterministic test methodology develops the test program for a pipeline processor using the information abstracted from its architecture model, rtl descriptions, and gate-level net-list for different types of processor circuits. the random test methodology tries to make the pseudo-exhaustive testing possible using random instructions or patterns. the proposed methodology improves coverage for structural faults using both deterministic and random development of the test code. not only can the deterministic test program test lots of faults using very small code size, but also the random test program can help detect some of the faults that the deterministic test program is difficult to test. we demonstrated the feasibility of the proposed methodology by the achieved fault coverage, test program size, and testing cycle count on a complex pipeline processor core. comparisons with previous work are also made. experimental results show its potential as an effective method for practical use.
discovering relationships among categories using misclassification information. knowledge of relationships among categories is of the interest in different domains such as text classification, content analysis, and text mining. we propose and evaluate approaches to effectively identify relationships among document categories. our proposed novel method capitalizes on the misclassification results of a text classifier to identify potential relationships among categories. we demonstrate that our system detects such relationships, even those relationships that assessors failed to identify in manual evaluation. furthermore, we favorably compare the effectiveness of our methods with the state of art method and demonstrate a significant improvement in precision (34%) and recall (5%).
designing and architecting process-aware web applications with epml. an emerging class of web applications is driving the evolution of the web toward a business system. these applications allow the participation of several actors to complex enterprise-wide (or even multi-enterprise) business processes and pose new challenges to the software designer and to the software architect. in this paper we show how, promoting an effective separation of concerns, a process modeling language and its enactment engine can be used in the modeling and in the implementation of process-aware web applications.
usage-based ranking of distributed xml data. in this article we consider the issue of ranking xml data and data sources in a distributed xml data warehouse. our ranking model applies to service-oriented data management applications where web services store and exchange xml fragments. each service publishes a set of operations implemented as parameterized queries on a local xml data warehouse integrating locally generated data and query results received from other services. we propose a new way for ranking distributed data and data sources taking into consideration their usage for the evaluation of queries. the main results are a formal ranking model of data, queries and services and an implementation on a data warehouse.
cref: a central-residue-fragment-based method for predicting approximate 3-d polypeptides structures. in silico prediction of protein tertiary structure is one of the most important and unsolved problems in current structural bioinformatics. in this article, we describe cref, a central-residue-fragment-based method to predict approximate 3-d polypeptides structures. with cref we expect to obtain approximate 3-d structures which can then be used as starting conformations in refinement procedures employing state-of-the-art molecular mechanics methods such as molecular dynamics simulations. cref does not make use of entire fragments, but only the phi, psi torsion angle information of the central residue in the template fragments obtained from pdb. after applying clustering techniques to these data, and guided by a consensus secondary structure prediction of the target sequence, we build approximate conformations for the target sequence. the method is very fast. we illustrate its efficacy in three case studies of polypeptides whose sizes vary from 34 to 70 amino acids. as indicated by the rmsd values, our initial results show that the predicted conformations adopt a fold similar to the experimental structures. starting from these approximate conformations, the search space is expected to be greatly reduced and the refinement steps can consequently demand a much reduced computational effort to achieve a more accurate polypeptide 3-d structure.
general type-2 fuzzy classifiers to land cover classification. this paper proposes a fuzzy classifier based on type-2 fuzzy sets to be applied in land cover classification. the classifier is built from the available data and considers the merging of information acquired from different experts. the data regards a thematic mapper representing the land cover of a real plain cultivated area. the experts are represented by different bands which discretize the spectral sensor information. the new method proposed to design the classifier as well as the use of general type-2 fuzzy sets allows the modeling of input-output relations and minimize the effects of uncertainties in the usual fuzzy rule-based classifiers. the experiments carried out attest the efficiency of the proposed general type-2 fuzzy classifier.
accurate histogram-based xml summarization. in this paper, we propose the use of histograms to characterize node set distributions in an xml document, which then can be recursively evaluated for query optimization tasks. we identify and deal with special cases for effectively using histograms to summarize structural aspects of xml documents. to reveal the potential of our approach, we perform comparative experiments on our native xml database management system called xtc.
enabling ontology-based document classification and management in ebxml registries. document management systems (dmss) are a key component in modern enterprises. for successful document search and retrieval, an adequate metadata set should be defined in order to describe documents with sufficient detail. however, often a single metadata set is not sufficient throughout the whole dms, as different document types require different attributes to be properly characterized. in this paper, we introduce ontologies as a modeling technology for structured metadata definition within dmss. focusing on the ebxml registry standard, we show an approach to enhance dmss for semantic content management and then we propose a method to exploit this new capability for automated document characterization.
an evaluation of a collision handling system using sphere-trees for plausible rigid body animation. collision handling plays a fundamental role for achieving realism and interactivity in 3d graphical systems. nevertheless, it is still one of the bottlenecks of such systems. in this work, we use the sweep & prune algorithm and sphere-tree approximations of the objects to perform the collision detection. besides, we show how to compute the contact data for the narrow phase out of the overlapping leaf spheres from the sphere-trees. for collision response, we have implemented a simple, yet efficient and accurate, impulse-based method. a number of experiments in virtual scenarios with objects falling in a static plane were conducted. the results show that when sphere-trees with 2 levels are used for scenarios with a great number of objects (up to 200 falling objects) and simultaneous contacts among them (up to 16381.50 contacts at each frame on average), our system is capable of generating real time plausible rigid body animation, with always more than 30 frames per second (fps) on average.
adaptive caching with heterogeneous devices in mobile peer to peer network. in the (upcoming) 3g age, many applications such as multimedia streaming, file sharing and so on will be widely used in the wireless environments. in such a mobile environment, users may carry heterogeneous mobile devices with different transmission ranges, latency, and even cache sizes. these devices not only can get services from a mobile support station (mss), but also they can form/generate a mobile peer-to-peer (p2p) network to provide services to each other. for such a mobile p2p network, an effective cache framework that can handle heterogeneous devices is required. in this paper, we propose a flexible cache scheme which is adaptive to the actual device condition and that of its neighbors. our scheme encourages the "strong" peers to keep hot data and do service, and meanwhile to protect and best utilize the "weak" nodes with their limited cache space. simulation and mathematic analysis results show the effectiveness of our scheme.
query by example for web services. web services have acquired enormous popularity among software developers and researchers due to the increasing levels of flexibility required by current distributed applications. however, service search facilities are still rather difficult to use. this paper presents wsqbe, a search method that aims at assisting service discoverers by generating a short list of candidate services and easing query specification. in contrast with previous approaches, wsqbe discovery process is based on a novel search space reduction mechanism. experimental evaluations of our approach are also reported.