waashk/dblp huggingface dataset:
a decentralized infrastructure for query answering over distributed ontologies. in this paper we describe an infrastructure for query answering over distributed ontologies on the semantic web. this infrastructure addresses (i) the coordination of multiple nodes using metadata about the provided resources managed in a decentralized registry and (ii) the mediation between heterogeneous ontologies via an expressive mapping formalism along with corresponding reasoning algorithms for query answering. our approach is based on a virtual integration that exhibits a semantics as if all ontologies were integrated locally. practically, the distributed ontologies still reside on the remote peers, and only the parts relevant for answering the query need to be retrieved to the local node. experimental evaluations with the implementation in kaonp2p show that the approach is very promising, as the performance of query answering is essentially dominated by the size of the data, and only slightly affected by the degree of distribution and heterogeneity.
classstruggle: a clustering based text segmentation. this paper describes classstruggle, an algorithm for linear text segmentation on general corpuses. it relies on an initial clustering of the sentences of the text. this preliminary partitioning provides a global view on the sentences relations existing in the text, considering the similarities in a group rather than individually. classstruggle is based on the distribution of the occurrences of the members of each class. during the process, the clusters then evolve, by considering a notion of proximity and of layout in the text, in the aim to create groups that contain only sentences related to a same topic development. finally, boundaries are created between sentences belonging to two different classes. first experimental results are promising, classstruggle appears to be very competitive compared with existing methods.
new specialist tools for medieval document xml markup. the digitalization of historical text documents as a basis of data mining and information retrieval for the purpose of progress in the history sciences is urgently needed. we present a novel, specialist xml tool-suite supporting the working historian in the transcription of original medieval charters into a machine-readable form.
towards evolution of strategic it requirements. the scope of requirements engineering must include high-level business objectives and strategies to achieve traceability between it and business needs in order to ensure alignment. however, we must also deal with the evolution of business strategy. enterprise it evolution is a complex task. this paper presents the first steps in a research project that integrates two requirements engineering methodologies, b-scp and map, in order to manage evolution of strategic it. the approach is tested on a case study of seven eleven japan. we found that there are semantic similarities between b-scp and map, which facilitated their combination. map also has a gap analysis process inbuilt so this saves on the overhead of inventing a new approach. in addition, map extends b-scp's capability by the addition of non-deterministic process modelling.
web services choreography and orchestration in reo and constraint automata. currently web services constitute one of the most important topics in the realm of the world wide web. composition of web services lets developers create applications on top of service-oriented computing platforms. current web services choreography and orchestration proposals, such as bpelaws, wscdl, and wsci, provide notations for describing the message flows in web service interactions. however, such proposals remain at the description level, without providing any kind of formal reasoning mechanisms or tool support for checking the compatibility of web services based on the proposed notations. in this paper, we present our work on compositional construction of web services using the reo coordination language and constraint automata. reo is an exogenous coordinational language based on channels. we investigate the possibility of representing the behaviour of web services using constraint automata as black-box components within reo circuits. we describe the orchestration of web services by the product of corresponding constraint automata, and use reo circuits for choreography of web services. we investigate the issues of description, orchestration, and choreography of web services at a unifying abstract level, based on constraint automata, which have been used as the semantics of the coordination language reo, allowing us to derive a natural correspondence relationship between orchestration and choreography.
hierarchical alignment graph for gene teams finding on whole genomes. a new computational issue is to detect gene knowledge from comparison of two or more genomes. many researchers have studied these methods to try identify clusters of orthologous genes that have the same function in several genomes. these researches often seem simple, but the genes closely placed in the genomes of different species are produced proteins that interact each other. the problem of previous approaches is the order of genes in a gene cluster and the gaps between adjacent genes in the cluster are less than a given threshold. previous approaches between two or more genomes consider the noisy genes between two adjacent genes. we propose a new method for detecting gene clusters in two genomes using hierarchical alignment graph.
fast, accurate design space exploration of embedded systems memory configurations. the memory hierarchy is often a critical component of an embedded system. an embedded system's memory hierarchy can have dramatic impact on the overall cost, performance, and power consumption of the system. consequently, designers spend considerable time evaluating potential memory system designs. unfortunately, the range of options in the memory hierarchy (e.g., number, size, and type of caches, on-chip sram, dram, eprom, etc.) makes thorough exploration of the design space using typical simulation techniques infeasible. this paper describes a fast, accurate technique to estimate an application's average memory latency on a set of memory hierarchies. the technique is fast---two orders of magnitude faster than a full simulation. it is also accurate---extensive measurements show that 70% of the estimates were within 1 percentage point of the actual cycle count while over 99% of all estimates were within 10 percentage points of the actual cycle count. this fast, accurate technique provides the embedded system designer the ability to more fully explore the design space of potential memory hierarchies and select the one that best meets the system's design requirements.
evaluating peer-to-peer recommender systems that exploit spontaneous affinities. the validation of a recommender system is always a quite hazardous task, because of the difficulty of modeling the tastes of a given user. novel (decentralized) recommender systems are proposed and evaluated by way of well known logs of user profiles and buddy tables, that contain lists of items with feedback ratings assigned by a given set of users. these information are cross linked, and the precision of the recommendation is compared with other well known (centralized) systems. this evaluation approach cannot be applied in the actual peer-to-peer domain: it is difficult, if not impossible, to build and maintain user profiles, and users are not required to give feedbacks to a data collector entity. moreover, objects are poorly or not structured, and meta-information, when present, cannot be trusted because of fake files and incomplete item descriptions. in this paper, we present an evaluation process based on a 10-fold cross validation task, that we applied to estimate accuracy of the suggestions of a p2p recommender system recently proposed in [2]. the complexity of the evaluation of this peculiar recommender is increased because of "spontaneous affinities" between users that are used instead of classical knowledge representation based strategies.
engineering active behavior of embedded software to improve performance and evolution: an aspect-oriented approach. in this paper we propose a novel aspect-oriented scheme for implementing active behavior in embedded software with requirements on data freshness. the scheme improves system performance by combining active behavior in terms of event-condition-action (eca) rules and on-demand updating. we design and implement the scheme in terms of aspects, thereby exploiting aspect-oriented programming technology to efficiently handle crosscutting nature of active behavior. the benefits of our approach are demonstrated using a case study of an embedded database system called comet. namely, simulations on the comet database indicate that its performance increases by incorporating our scheme. furthermore, using the comet example we show that aspect-oriented implementation of active behavior has benefits when it comes to easier evolution of the system.
wellness assistant: a virtual wellness assistant using pervasive computing. the number of people over age 65 will almost double by 2030 and as they age, they generally prefer to remain in their home or go to a nursing home. there are a variety of reasons for their decision, such as convenience or a need for security or privacy. so, it is time to break through the physical boundaries of hospitals, and bring the hospital information to the homes of the elderly rather than bringing elderly folks to the hospital. despite growing requests by people to be able to take a more active part in managing their own health, wireless or internet-based healthcare devices have not been accepted for use in this area. this is probably due to the reluctance of this age group to make use of new technology, as well as the lack of reliable, individualized, or user friendly interfaces. in this paper, we discuss the challenges of developing wellness assistant (wa), software which is looking to solve some of these problems. the assistant will use pervasive computing technologies because of the availability of inexpensive handheld devices such as pdas, cell phones, and wrist watches with short range wireless capabilities. the wa can also be used by people with obesity, diabetes, or high blood pressure, conditions which need constant monitoring.
finding hierarchical heavy hitters in network measurement system. focused on identifying hierarchical heavy hitters (hhh) in multiple dimensions from network management perspective, this paper presents a framework of finding hhhs in network measurement systems and proposes a heuristic algorithm on finding static and dynamic hhh in two dimensions. our algorithm dramatically reduces the space and time complexity comparing with other previous algorithms. we implement and test it in a typical local network and the experimental results verify the effectiveness and efficiency of the algorithm.
rfid data management for effective objects tracking. radio frequency identification (rfid) applications are emerging as key components in object tracking and supply chain management systems. in next future almost every major retailer will use rfid systems to track the shipment of products from suppliers to warehouses. due to rfid readings features this will result in a huge amount of information generated by such systems when costs will be at a level such that each individual item could be tagged thus leaving a trail of data as it moves through different locations. we define a technique for efficiently detecting anomalous data in order to prevent problems related to inefficient shipment or fraudulent actions. since items usually move together in large groups through distribution centers and only in stores do they move in smaller groups we exploit such a feature in order to design our technique. the preliminary experiments show the effectiveness of our approach.
log-based indexing to improve web site search. despite the success of global search engines, web site search is still problematic in its retrieval accuracy. in this paper, we try to improve the performance of the site search by combining a new source of evidence from web server logs. we propose a novel approach of using server log analysis to extract terms to build the web page index. then, this log-based index is combined with the text-based and anchor-based index to provide a more complete view on the page content. experiments have shown that it could improve the effectiveness of the web site search significantly.
towards decentralized service orchestrations. there are several independent motivations for the implementation of decentralized execution settings for business processes that subject service compositions. this paper reports a new approach to truly decentralized orchestration of service compositions. precisely, we provide an efficient process transformation technique that converts a process conceived for centralized execution to a set of nested processes to be deployed on dynamically bound services. following the motivation that services are invokable with relevant processes, our proposition enables services to establish direct interconnections as analogous to p2p computing.
precise dynamic slicing using execution-summary. dynamic slicing helps to identify the program statements that affect a given criterion-point. existing precise slicing algorithms, like the limited-preprocessing (lp) algorithm by zhang et al. (icse 2003), operate on stored execution trace, requires much time and space if the trace is large even if the source program is small. in this paper we present a forward dynamic slicing algorithm for structured programs that reduces the overhead of slicing in the long run. for long running programs that iterates heavily on some loop, our algorithm is expected to perform faster by re-using the already computed dependences in the loop.
bionic autonomic nervous system and self-healing for nasa ants-like missions. the pam (prospecting asteroid mission) submission of the nasa concept mission ants (autonomous nano-technology swarm) involves the launch of a swarm of 1,000 autonomous pico-class spacecraft that will explore the asteroid belt. i this paper, we describe the development of a novel bans (bionic autonomic nervous system) technology with the potential to be deployed as part of the ants mission. the bans is analogous to the biological nervous system, which consists of basic modules such as cyber axons, cyber neurons, the cyber peripheral nervous system and the cyber central nervous system. equipped with the bans, the ants system would be able to self-diagnose and self-heal faults/failures and avoid possible damage or collisions. an implementation and experimental results of the bans exhibits the effectiveness and efficiency of the self-healing functions.
unichos: a full system simulator for thin client platform. thin client is a kind of interactive and graphics device in client/server and browser/server environment, which combines local and remote computing resources. the applications on the thin client (e.g., browsers) often heavily rely on the support of operating system and the functionalities of network and graphics. hence, traditional performance evaluation methods, such as instrumentation and application-level simulation, cannot help due to their inherent limitation. this paper presents the design and implementation of unichos, a full system simulator for thin client platform. unichos models the complete target hardware system in object-oriented structure, and supports the unmodified linux 2.4 kernel and graphics and network applications. unichos is the first full system simulator, which focuses on portability for more architectures of thin client platforms by combining the retargetable instruction template and the extensible device model. finally, we present the unichos performance under detailed simulation status and introduce two case studies which demonstrate the advantages of unichos for performance evaluation.
exploiting inter-gene information for microarray data integration. microarray data integration is an important yet challenging problem. usually, direct integration of microarrays after normalization is ineffective because of the diverse types of experiment specific variations. to address this issue, two novel integration approaches were proposed in recent microarray studies. the first study[16] presented a cancer classification technique which identifies gene pairs whose expression orders are consistent within class and different across classes. the other study[18] presented a promising gene expression analysis technique which utilizes pairwise correlations of gene expressions across different microarray datasets. interestingly, we observe that both of the independently developed techniques rely on inter-gene information and noise filtering strategy to achieve satisfactory performance in microarray integration. motivated by this observation, we propose in this paper a formal data model for microarray integration using inter-gene information and effective filtering, which generalizes the previous two frameworks. we also show how the proposed model can handle a broader range of problems than the previous frameworks.
a self-organising solution to the collective sort problem in distributed tuple spaces. coordination languages and models are recently moving towards the application of techniques coming from the research context of complex systems: adaptivity and self-organisation are exploited in order to tackle typical features of systems to coordinate, such as openness, dynamism and unpredictability. in this paper we focus on a paradigmatic problem we call collective sort, where autonomous agents are assigned the task of moving tuples across different tuple spaces with the goal of reaching perfect clustering: tuples of the same kind are to be collected in the same, unique tuple space. we describe a self-organising solution to this problem, where each agent moves tuples according to partial observations, still making complete sorting emerge from any initial tuple configuration.
primitives for the dynamic evolution of component-based applications. due to the coarse granularity of components-based applications, components platforms are good candidates for enabling dynamic software evolution. the luckyj platform was designed to allow the dynamic evolution of applications. it implements the three primitives load, remove and replace to modify the components set. the design and implementation of a web server outlined several evolution patterns that should be integrated in luckyj to ease the task of maintainers and developers of applications that evolve dynamically. this leads to the definition of additional primitives as well as a language that could be used to automate the updating process in such a dynamic setting.
exploiting bibliographic web services with citex. most digital libraries make extended document metadata available for the purpose of citation. this metadata has commonly been provided in human readable format, but more and more digital libraries are beginning to offer this information in convenient machine readable formats. at the same time, many advances have been made in cataloging and accessing documents and their associated metadata. we are witnessing the early evolution of bibliographic web services. in this paper we introduce an application (citex) for compiling bibliographies dynamically from bibliographic web services as they currently exist and we explore some of the challenges associated with providing bibliographic information, suggesting future paths for bibliographic web services.
using rt-uml for modelling web services. rt-uml is a uml profile for modeling real time systems, which can be used in particular to describe web services orchestration with time constraints. for that purpose, we can use a classical uml diagram, namely, the sequence diagram. our goal in this paper is the design of web services with time restriction by using rt-uml. we introduce a translation of the main elements of rt-uml into web services business process execution language.
greic data gather service: a step towards p2p production grids. current production grids involve hundreds of sites and thousands of machines. in this context, p2p solutions are well suited - with regard to existing centralized and hierarchical approaches - to implement highly scalable, decentralized, reliable and manageable grid services. in this paper we describe the greic data gather service from an architectural and technological point of view. this service has been developed within the grid relational catalog (greic) project, at the center for advanced computational technologies (cact) of the university of lecce. the greic data gather architecture aims at integrating transparently and securely distributed and geographically spread heterogeneous grid data sources through data gather service nodes connected in a p2p fashion.
on construction of a biogrid platform for parallel bioinformatics applications. in this paper, we report on implementing an experimental distributed computing application for bioinformatics consisting of basic high-performance computing environments (grid and pc cluster systems), multiple interfaces at user portals that provide useful graphical interfaces to enable biologists who are not it specialists to benefit directly from the use of high-performance technology.
a lightweight indoor location model for sentient artefacts using sentient artefacts. our approach towards context awareness is to use sensor augmented daily life objects surrounding us for extracting context information and for providing ambient services. some of these artefacts are static in nature and have designated location, like a bed in the bedroom, a refrigerator in the kitchen, etc. utilizing this characteristics, we present "spreha", a light weight hierarchical location model where static artefacts are used as reference points for identifying mobile artefacts like a chair, a watch, a lamp, etc. the model is organized in a tree structure representing the containment relationship and is independent of underlying sensing infrastructure. a prototype implementation of the model has been constructed as a pluggable module of a generic middleware using bluetooth technology. this paper discusses about the design, architecture and findings of the prototype implementation.
analysis and verification of an automatic document feeder. modern copying machines are versatile and complex systems in which embedded software plays an essential role. the progress towards faster and more stable machines that can satisfy ever growing customers' needs, places strict requirements on the efficiency and quality of such software. in order to meet these requirements, the software should be well-designed and free of errors. using modern formal verification techniques, software designs can be checked for errors and deadlocks so that their quality can be assessed and improved at an early stage of the development process. in this paper, we analyze the embedded software of an automatic document feeder (adf). adfs are important components of copier machines. the adf studied here is a prototype developed by oc&eacute;-technologies b.v., a company that develops professional printing systems. we construct a model of the adf in &mu;crl, a process algebra-based specification language, and express the system's requirements in the modal &mu;-calculus. next, we use the &mu;crl and cadp tool sets to check whether the system meets its requirements. this analysis reveals important errors in the adf and we propose solutions to these problems. also, we show that some requirements that engineers assumed to be valid, are too strict. we present slightly weaker versions of these requirements and show that these do hold. in this sense, in addition to finding errors in the adf, our analysis also led to a better understanding of the behaviour the system.