waashk/dblp huggingface dataset:
a hardware/software kernel for system on chip designs. as part of the soc design process, the application is partitioned between implementation in hardware and implementation in software. while it is customarily the application that is subject to partitioning, it is also possible to partition the software kernel. in this paper, a uniprocessor real-time kernel that implements the earliest deadline first (edf) scheduling policy is partitioned. it is partitioned by moving the edf scheduler into a coprocessor. the coprocessor size and performance are analyzed. a metric is then proposed that measures a coprocessor's impact on application feasibility. this metric permits a unified comparison of kernel coprocessors and application coprocessors during design partitioning.
preliminary performance evaluation of an adaptive dynamic extensible processor for embedded applications. in this research we investigate an approach for adaptive dynamic instruction set extension, tuning processors to specific applications after fabrication.
semantic analysis of web site audience. with the emergence of the world wide web, analyzing and improving web communication has become essential to adapt the web content to the visitors' expectations. web communication analysis is traditionally performed by web analytics software, which produce long lists of page-based audience metrics. these results suffer from page synonymy, page polysemy, page temporality, and page volatility. in addition, the metrics contain little semantics and are too detailed to be exploited by organization managers and chief editors, who need summarized and conceptual information to take high-level decisions. to obtain such metrics, we mine the content of the web pages output by the web server. for a given taxonomy covering the web site knwoledge domain, we compute the term weights in the output pages and we aggregate them using olap tools, in order to obtain concept-based metrics representing the audience of the web site topics. to demonstrate how our approach solves the cited problems, we actually compute concept-based metrics with sql server olap analysis service and our prototype wasa for a number of case studies. finally, we validate our results against a popular web analytics tool.
temporal query operators in xml databases. the contents of an xml database or an xml/web data warehouse is seldom static. new documents are created, documents are deleted, and more important: documents are updated. in many cases, we want to be able to search in historical versions, retrieve documents valid at a certain time, query changes to documents, etc. this can be supported by extending the system with temporal database features. in this paper we describe the new query operators needed in order to support an xml query language which supports temporal operations.
dynamic memory allocation strategies for parallel query execution. in the decision support queries which manipulate large data volumes, it is frequent that a query constituted by several joins can not be computed completely in memory. in this paper, we propose three strategies allowing to assign the memory of a shared-nothing parallel architecture to operation clones of a query. the performance evaluation of the three strategies shows that the strategies which favor the operation clones using a lot of memory obtain a better response time than the strategy which favors the clones using little memory. the main contribution of this paper is to take into account the available memory sizes on every processor and to avoid allotting the same processor to two operation clones that must run in parallel.
exploiting labels in structural operational semantics. structural operational semantics (sos) allows transitions to be labelled. this is fully exploited in sos descriptions of concurrent systems, but usually not at all in conventional descriptions of sequential programming languages.this paper shows how the use of labels can provide significantly simpler and more modular descriptions of programming languages. however, the full power of labels is obtained only when the set of labels is made into a category, as in the recently-proposed msos variant of sos.
automated assembly of software components based on xml-coded instructions. many approaches to reducing the cost, complexity and development time of software applications have been explored. several techniques, most recently the object oriented paradigm, have been developed to facilitate the reuse of code. even when these techniques employ the notion of components, they do so only in a limited way within the language's environment at development time. within the field of software engineering, the study of software architecture has emerged to provide language support for building configurations of components into runable systems. in this paper we present an xml architecture development meta-language. the specification is programming language independent. we discuss a prototype engine that uses this meta-language for the automated assembly of software applications.
concatenate feature extraction for robust 3d elliptic object localization. developing an efficient object localization system for complicated industrial objects is an important, yet difficult robotic task. to tackle this problem, we have developed a system consisting first of a vision model acquisition editor, where the object salient features are acquired through a human-in-the-loop approach. subsequently, two feature extraction algorithms, region-growing and edge-grouping, are applied to the object scene. finally, by kalman filter estimation of a proper ellipse representation, our object localization system successfully generates ellipse hypotheses by grouping edge fragments in the scene. the proposed system is validated by experiments using actual industrial objects.
acquisition of modulation pulses for a multi-robot system using genetic algorithm. ultrasonic sensors (sonars) are widely used in mobile robotics research for local environment perception and mapping. mobile robot platforms equipped with multiple sonars have been build and used by many researchers. a significant problem with the use of multiple sonars is that, when the sonars are operated concurrently, signal interference occurs, making it difficult to determine which received signal is an echo of the signal transmitted by a given sonar. one way of solving the problem of signal interference is to use different pulse patterns to modulate the signals emitted by the sonars. furthermore, in order to reduce the time taken to perform measurements, a concurrently operated sonar system is desirable. in this paper, a technique for acquiring suitable modulation pulses for signals emitted in a multi-sonar system is presented. in order to optimize the length of modulation signal, we propose a technique to reduce the probability of erroneous operation due to interference, using the niched pareto genetic algorithm (npga). the basic technique is illustrated for the case where two or more robots equipped with multiple sonars operate in the same environment.
training needs analysis: the first step in authoring e-learning content. online training and e-learning are becoming increasingly pervasive but some sectors are being left behind, particularly small to medium enterprises (smes). there are many reasons for this -- technical, organisational, resource related and cultural. commercially available e-learning courses that are aimed at a mass market do not match sme needs. one solution to these limitations is for companies to author their own e-learning so as to meet their own needs. most sme's do not have the expertise to do this and are reluctant to employ outside services solely for this purpose. training needs analysis (tna) provides a means to enable companies to identify areas where their employees require training. it can also be extended to produce a set of guidelines so they can author their own e-learning content through a structured design process. conducting a comprehensive training needs analysis is a large undertaking requiring a significant time and expertise. this paper outlines the generation of a generic online tna tool for smes allowing them to identify training requirements and assisting them to specify their own e-learning content in a structured manner.
timid acquisition of constraint satisfaction problems. in this paper we view interactive constraint acquisition as the process of learning constraints from examples and focus on the roles played by both the user and the system during an interactive session. we consider our user as a teacher who provides positive examples to an automated constraint acquisition system. each positive example represents a solution to the target constraint network we are trying to acquire. in this paper we compare a number of ways in which users can choose examples to be presented to a constraint acquisition system and identify the best strategy for the user to adopt. we recognize that not every user will naturally be able to assume the best profile and therefore present an assistant that can help a user construct good examples. we show that the assistant helps, in a significant manner, a human user trying to describe a target constraint network using a very small number of examples.
strategies for personal process improvement a comparison. every so often, a new methodology is launched onto the software engineering landscape with all the force of a religious crusade. from its humble beginnings software process improvement (spi) has spread its wings into virtually every sector of the software engineering community and in the process has transformed itself from a bag of tools and techniques, into a serious set of methodologies for enhancing organisational effectiveness and competitive success. in the latter half of the 1990's, individual spi methodologies such as psp [1] and pipsi [2] were promulgated as approaches to make the individual a better software engineer.surveys of european software organisations [3] have shown support for spi. in europe to date, spi programmes have concentrated at the organisational level, with less adoption at the level of the individual. this paper explores the role of individual-level methodologies in a european context and details the results of a series of experiments conducted by the authors.
eliciting coordination policies from requirements. software coordination models and languages describe how agents, resources and processes work together to implement a software system. one of their limitations is that they are used late in the software development and they are not integrated in a typical software development process.what we claim, with our research, is that if coordination becomes explicit and formalized as soon as possible in the life cycle, then it is possible to create coordinated-aware software systems. moreover, it is possible to verify the adequacy of a software architecture model (or of the code itself) with respect to these dynamic constraints as well as refine or disambiguate coordination requirements themselves.in previous work, we presented a uml-based development process to elicit, describe, analyze and validate system coordination properties that might be then specified with a suitable coordination language. in this general picture, the aim of this paper is to implement the first step, i.e., to elicit and formalize coordination policies. we propose a five steps approach that incrementally identifies the elements to be coordinated (i.e., static coordination) and how these entities may be coordinated (i.e., dynamic coordination).
agent technology and reconfigurable computing for mobile devices. next-generation mobile devices will be multifunctional and be expected to execute a broad range of compute-intensive applications. they are constraint by their device and mobility characteristics in achieving these expectations. reconfigurable logic has vast potential to facilitate mobile devices in meeting these future system performance requirements. this paper proposes incorporating reconfigurable computing and agent technology into mobile device environments. agent technology is an ideal middleware for mobile device management enabling effective utilization of reconfigurable resources. reconfigurable logic is integrated into the environment of a mobile device i.e. both into the physical device and into surrounding adaptive servers. an outline of the overall strategy is described. a detailed examination of enabling a client mobile device to dynamically offload reconfigurable hardware-software based computations to neighboring adaptive servers is presented. in addition, the paper details an initial demonstrator system within a medical environment.
towards scalability in tuple spaces. applications in ecommerce and ubiquitous computing ask for coordination of highly distributed and heterogenous data sources and services. tuple spaces offer a data-driven coordination model, hence they may be used for this purpose. however, research on distributed tuple spaces has not resolved yet how to render tuple spaces scalable. this is partly due to their informal conception. this paper formalizes tuple spaces and introduces a new concept for achieving scalability. it generalizes existing concepts and may lead to scalability in some application areas.
an hybridization of an ant-based clustering algorithm with growing neural gas networks for classification tasks. conventional ant-based clustering algorithms and growing neural gas networks are combined to produce an unsupervised classification algorithm that exploits the strengths of both techiques. the ant-based clustering algorithm detects existing classes on a training data set, and at the same time, trains several growing neural gas networks. on a second stage, these networks are used to classify previously unseen input vectors into the classes detected by the ant-based algorithm. the proposed algorithm eliminates the need of changing the number of agents and the dimensions of the environment when dealing with large databases.
supporting efficient dynamic aspects through reflection and dynamic compilation. as systems grow more and more complex, raising severe evolution and management difficulties, computationnal reflection and aspect-orientation have proven to enforce separation of concerns principles and thus to address those issues. however, most of the existing solutions rely either on a static source code manipulation or on the introduction of extra-code (and overhead) to support dynamic adaptation. whereas those approaches represent the extreme of a spectre, developpers are left with this rigid tradeoff between performance and dynamism. a first step toward a solution was the introduction of specialized virtual machines to support dynamic aspects into the core of the execution engine. however, using such dedicated runtimes limits applications' portability and interoperability.in order to reconcile dynamism and performance without introducing portability and interoperability issues, we propose a dynamic reflexive runtime that uses reflection and dynamic compilation to allow application-specific dynamic weaving strategics, whithout introducing extra-overhead compared to static monolithic weavers.
unstructured agent matchmaking: experiments in timing and fuzzy matching. we investigate distributed matchmaking within an multi-agent system in which agents communicate in a peer-to-peer fashion with a limited set of neighbors. we compare the performance of a system with synchronized time to that of systems using several different models of continuous time. we find little difference between the two, indicating that the ordering of events does not play a part in computation. we also compare a system in which matches are made deterministically between discrete task categories to one in which task matches are made non-deterministically between continuous task categories. we consider several possible matching functions and show that their support is proportional to the spread of categories tolerable. this holds for matching probabilities as low as 0.01. we further show that the matching function's 'height' relates to the speed at which the system finds matches. for instance, we show that for a triangular matching function, doubling the probability of each service matching results in about a 1.6 times speedup.
hierarchical video indexing based on changes of camera and object motions. since an entire video stream is too coarse as a level of abstraction, it is decomposed into a number of shots in general. a shot, which is defined as a collection of frames recorded from a single camera operation, is a basic unit for indexing video data. the existing video indexing models try to index these shots using either low-level (i.e., color, motion), or high-level (i.e., human interpretations) features. recently, hybrid approach to combine these low-level and high-level features for indexing purpose has been proposed to take advantages from both of them. in this paper, we extend our previous works for shot boundary detecting and indexing, and propose a new shot indexing technique to be fit into the hybrid environment. it supports in-depth classification of various kinds of shots according to camera motions and object movements. the results from preliminary experiments can confirm the effectiveness of the proposed techniques.
revisiting 1-copy equivalence in clustered databases. recently renewed interest in scalable database systems for shared nothing clusters has been supported by replication protocols based on group communication that are aimed at seamlessly extending the native consistency criteria of centralized database management systems. by using a read-one/write-all-available approach and avoiding the fine-grained synchronization associated with traditional distributed locking, one needs just a single distributed interaction step for each update transaction. therefore the system can easily be scaled to a large number of replicas, especially, with read intensive loads typical of web server support environments.in this paper we point out that 1-copy equivalence for causal consistency, which is subsumed by both serializability and snapshot isolation criteria, depends on basic session guarantees that are costly to ensure in clusters, especially in a multi-tier environment. we then point out a simple solution that guarantees causal consistency in the database state machine protocol and evaluate its performance, thus highlighting the cost of seamlessly providing common consistency criteria of centralized databases in a clustered environment.
a-brain: the multiple problems solver. intelligence is strongly related to the ability of solving different problems by a single system. general problems solvers such as artificial neural networks, evolutionary algorithms, particle swarm etc, have traditionally been tested against one problem at one time. the purpose of this research is to build a complex and adaptive system able to solve multiple (and different) problems. the proposed system, called a-brain, consists of several connected components (a decision maker, a trainer and several problem solvers) which provide a base for building complex problem solvers. the a-brain system is applied for solving some well-known problems in the field of symbolic regression. numerical experiments show that a-brain system is able to perform very well on the considered test problems.
an efficient single-pass query evaluator for xml data streams. data streams might be preferable to data stored in memory in contexts where the data is too large or volatile, or a standard approach to data processing based on data parsing and/or storing is too time or space consuming. emerging applications such as publish-subscribe systems, data monitoring in sensor networks [6], financial and traffic monitoring, and routing of mpeg-7 [7] call for querying data streams. in many such applications, xml streams are arguably more appropriate than flat data streams, for xml data is record-like, though not precluding multiple occurrences of fields with the same name. evaluating selection queries against xml streams is especially challenging because xml data is structured (like records) and might have unbounded size.this paper proposes an efficient single-pass evaluator of xpath queries against xml data streams unbounded (possibly infinite) in size. the evaluator is based on networks of independent deterministic pushdown transducers and it is especially suitable for implementation on devices with low-memory and simple logic as used, e.g., in mobile computing.
editorial message: special track on coordination models, languages and applications. the notion of coordination is more and more pervading many research fields both inside and outside computer science. many research areas such as software engineering, intelligent systems, agent technologies, internet applications, programming languages, parallel and distributed computing, all raise issues that concern the interaction among different sorts of entities --- processes, objects, components, agents --- as well as its management. despite their apparent diversity, this wide and heterogeneous range of problems actually exhibit large overlaps, and can be effectively faced and solved using a relatively reduced set of conceptual tools --- the notion of coordination model among the main ones. the purpose of a coordination model is represent and shape the space of interaction among entities --- whatever they are, however they interact. >from an engineering viewpoint, coordination languages and systems should enable engineers to integrate a number of possibly heterogeneous components, and to govern their interaction so as to form a (potentially distributed) software system with desired characteristics and functionalities.accordingly, the special track on coordination models, languages and applications takes deliberately a broad view of what is coordination. besides the traditional areas covering data-driven, control-driven, and hybrid models and languages, the track invited contributions from several areas where the concept of coordination is relevant, such as multiagent systems, web applications, software architectures, middleware platforms, knowledge-based systems, groupware and workflow management, etc.in response to the call for papers, 42 high quality submissions from 18 different countries were submitted to this special track, and fed into the reviewing process. altogether, there were more than 100 reviewers, and over 235 reviews were submitted by them --- an average of more than 5 reviews for each paper. based on the reviewers' reports, the general acm sac guidelines for acceptance and rejection of submissions, and the unavoidable time and space constraints associated with any conference, it was possible to select only 16 of these submissions as regular papers for presentation at the track. in the process, a number of good and interesting papers had to be rejected. among the papers presented at the special track, a further selection and revision process will lead to the publication of a special issue on coordination and knowledge engineering that will appear on the knowledge engineering review (http://uk.cambridge.org/journals/ker/).
integrating objective & subjective coordination in multi-agent systems. subjective and objective coordination can be integrated and exploited fruitfully in the same context. in this paper we investigate such integration in multi-agent systems, in particular taking as a reference context fipa agents - typically adopting subjective approaches - aiming at exploiting the coordination services provided by tucson objective coordination infrastructure.
declarative control of the future home environment. in this paper, we show how declarative rules, and declarative programming, are used to control a complex, heterogeneous system where rules from disparate sources must interoperate. we show how imperative codes can be automatically generated from declarative rules to bind with the resources in the execution environment. our approach shows how declarative programming can be used to effectively compose disparate systems together. we apply our approach to the control and co-ordination of home devices.