waashk/dblp huggingface dataset:
implementing an autonomic architecture for fault-tolerance in a wireless sensor network testbed for at-scale experimentation. the wireless sensor networking (wsn) community has increasingly grown to rely on experimentation with large-scale test-beds as a means of verifying protocols, middleware and applications. these testbeds need to be highly available in order to support this community, but are themselves complex, and complex to manage, being prone to faults in hardware, software specification and software implementation. in this paper we report on our experience in designing kansei, a wsn testbed for experimentation at scale, to be autonomic - i.e. self-healing and self-managing. we implement autonomic management in kansei through an architecture that consists of a hierarchy of self-contained components, extended with detectors for discovering faults and correctors for subsequent stabilization. we find that our invariant based architecture is well suited for large complex systems with unpredictable fault model and its fault monitoring framework can be extended to include user programs.
filtering drowsy instruction cache to achieve better efficiency. leakage power in cache memories represents a sizable fraction of total power consumption, and many techniques have been proposed to reduce it. as a matter of fact, during a fixed period of time, only a small subset of cache lines is used. previous techniques put unused lines, for example, to drowsy in order to save power. our idea is to adaptively select the most used cache lines. in the case of instruction cache, we found that this can automatically achieved by coupling a tiny cache acting as a filter cache (ilo cache) with a drowsy-cache. our experiments, with complete mibench suite for arm based processor, show a 25% improvement in leakage saving versus drowsy.
optimizing code through iterative specialization. code specialization is a way to obtain significant improvement in the performance of an application. it works by exposing values of different parameters in source code. the availability of these specialized values enables the compilers to generate better optimized code. although most of the efficient source code implementations contain specialized code to benefit from these optimizations, the real impact of specialization may however vary depending upon the value of the specializing parameter. in this paper, we suggest the specialization of code to acquire an iterative approach. for some specialized code, we search for a better version of code by re-specializing the code, followed by a low-level code analysis. the specialized versions fulfilling the required criteria are then transformed to generate another equivalent version of the original specialized code. the approach has been tested on itanium-ii architecture using icc compiler. the results show significant improvement in the performance of different behchmarks.
generation of continuous random networks by simulated annealing. this work presents a new approach for the computational treatment of amorphous materials. simulated annealing has been used for generating carbon continuous random networks. unlike other methods, it is possible to define a priori the percentage of sp3, sp2 and sp hibridized carbon atoms in the final structure. using grid computing resources, several structures were generated simultaneously. in this way, we can easily scan all the range of amorphous materials with different proportions between the possible hibridizations of carbon.
how robust are multilingual information retrieval systems? the results of information retrieval evaluations are often difficult to apply to practical challenges. recent research interest in the robustness of information systems tries to facilitate the application of research results for practical environments. this paper analyzes a large amount of evaluation experiments from the cross language evaluation forum (clef). robustness can be interpreted as stressing the importance of difficult topics and is usually measured with the geometric mean of the topic results. our analysis shows that a small decrease of performance of bi-and multi-lingual retrieval goes along with a tremendous difference between the geometric mean and the average of topics. consequently, robustness is an important issue especially for cross-language retrieval system evaluation.
conversion of generalization hierarchies and union types from extended entity-relationship model to an xml logical model. this short paper proposes alternative rules for converting generalization/specialization hierarchies and union types, defined in the extended entity-relationship model, to an xml logical model. our approach considers all the possible constraints and constructs for generalization and union types, generating abstract schemas for the logical design of xml documents.
an approach to mobile collaborative mapping. with the advent of web 2.0, users now expect to be able to customise, edit and share information from any online device. these capabilities are unavailable in many geographic information applications and where it is, it is far too difficult to use. satellite navigation devices and software are also not flexible enough in this regard. current satellite navigation technology enables users to view maps and navigate easily. however, it does not support information sharing and marking-up maps with symbols other than routes and locations. currently, a popular desktop solution to this problem is web 2.0 mashups, which enable implementers to correlate information from several web data sources into one coherent application. mashups also have their caveats, as they are beyond the capabilities of lay users and, being web-based, they are not location aware and do not support mobility. this paper presents mobile collaborative mapping (mcm), a browser-based location-aware collaborative map editor to address these shortcomings through a simplified editing system and revision based storage server and discusses its application in an e-science scenario of use and the capabilities of the current mcm prototype.
agent-based simulation of electronic marketplaces with decision support. this paper presents a multi-agent market simulator designed for analyzing agent market strategies based on a complete understanding of buyer and seller behaviors, preference models and pricing algorithms, considering user risk preferences and game theory for scenario analysis. the system includes agents that are capable of improving their performance with their own experience, by adapting to the market conditions, and capable of considering other agents reactions.
trajectory retrieval with latent semantic analysis. the problem of trajectory similarity has been recently attracted research interest considerably, due to its importance in diverse fields. in this work, we study trajectory similarity by attacking the problem taking an information retrieval perspective. trajectories are first decomposed by using a grid and each trajectory is mapped to a multidimensional space where latent semantic analysis is applied. distance measures like euclidean distance or cosine distance are applied to process similarity queries (range queries, k-nn queries). performance evaluation results, based on real-life data sets, show the simplicity and effectiveness of the proposed scheme.
flagellink: a decision support system for distributed flagellar data using data warehouse. combining different types of data from multiple databases (dbs) is a key feature in bioinformatics, particularly due to the problem that each of these db resources usually contains different subsets of biological knowledge and only answers questions in its domain, nether helping with questions that span domain boundaries nor considering them. as bioinformatics dbs grow in size and as biological questions grow in scope, better solutions will inevitably consist in preserving the autonomy and diversity of dbs and developing new systems to offer an integrated and transparent access to existing distributed data sources (ds). in this paper, we present a decision support system (dss), called flagellink, to provide access to a set of distributed information about a particular domain (the flagellum, a cellular organelle responsible for motility). it employs useful bioinformatics tools (such as blast, muscle, hmmer, etc) in an exclusive data warehouse (dw) through terminology and ontology resources (semantic-driven) to maintain an actual dss for a specific knowledge domain. flagellink (available at http://flagellink.nugen.uece.br/flagellink) has a unified, ondemand integration approach that merges the identified ontological knowledge (which means a defined number of test cases and scenarios of genes and proteins all involved in flagellar activities) with traditional and ontology-based information integration techniques.
an improved approach for set-associative instruction cache partial analysis. the current worst case execution time (wcet) computation methods are usually applied to whole programs, this may drive to scalability limitations as the program size becomes bigger. a solution could be to split programs into components that could support separated partial analyses to decrease the computation time. the componentization is also consistent with the more and more frequent use of component off the shelf (cots). consequently, we need algorithms to perform analyses on component-wise applications. in this paper, we focus on the partial analysis of set-associative instruction caches, based on the categorization method described by m. alt et al. we have first evaluated a. rakib et al.'s approach to this problem and we have shown that, while correct, this approach can be greatly improved by a better estimation of the component effect on the cache. the version we have developed addresses the identified shortcomings and the experimentation results have been evaluated according to two criteria: (1) overestimation of the wcet and (2) computation time gain against the whole program analysis approach.
a remote display system for java-based mobile applications. remote presentation is an interesting model for executing applications in mobile devices, since applications can be executed on a server and their interfaces displayed on mobile clients. this paper describes a non-invasive and transparent remote presentation system for legacy j2me applications called rda (remote display using aspects). rda relies on aspect-oriented programming to instrument j2me applications with remote presentation code. our first performance results demonstrate that remote presentation is a promising solution for executing cpu-intensive applications in mobile devices or for running applications demanding resources not available in such devices.
ielr(1): practical lr(1) parser tables for non-lr(1) grammars with conflict resolution. there has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. as part of that effort, we examine a deficiency in the state of the art of practical lr parser table generation. specifically, lalr sometimes generates parser tables that do not accept the full language that the grammar developer expects, but canonical lr is too inefficient to be practical. in response, many researchers have attempted to develop minimal lr parser table generation algorithms. in this paper, we demonstrate that a well known algorithm described by david pager and implemented in menhir, the most robust minimal lr(1) implementation we have discovered, does not always achieve the full power of canonical lr(1) when the given grammar is non-lr(1) coupled with a specification for resolving conflicts. we also outline an original minimal lr(1) algorithm, ielr(1), which we have implemented as an extension of gnu bison and which does not exhibit this deficiency. finally, using our implementation, we demonstrate the relevance of this deficiency for several real-world grammars, and we show that our implementation is feasible for generating minimal lr(1) parsers for those grammars.
special track on applications of evolutionary computation: editorial message. evolutionary algorithms (eas) are inspired by the mechanisms that underlie biological evolution: reproduction with variation, selection according to fitness, and repetition. an ea maintains a population of data structures that encode candidate solutions to the target problem instance. these data structures are usually strings of symbols and are called chromosomes. associated with each chromosome is a numerical fitness that indicates the quality of the solution it represents, and chromosomes of better fitness are selected to be parents. operators abstracted from genetic crossover and mutation, and bearing those names, generate novel chromosomes from the selected parents. as generations of chromosomes follow each other, representations of better solutions evolve. the algorithm halts and returns the best solution represented in its population after a specified number of generations or when the algorithm identifies a solution of adequate fitness.
ifox: interface for ordered xquery an algebraic oriented tool for ordered xquery visualization. even though xquery has become a standard for querying semi-structured data, its syntax is too complex for occasional users. this paper describes a user friendly interface called ifox (interface for ordered xquery) that enables non experienced users to build easily complex xqueries. to that end, we use an algebraic-like representation to build xqueries. this representation is based on the xalgebra described in [17]. moreover, many applications require answers to queries to be order sensitive. for example, in a biomedical application where a set of genes is stored in a xml file, the order in the output when querying these data is crucial. with issue in mind, we propose a normalization process which not only preserves order in answers to queries but also enables optimization techniques.
special track on e-business applications: editorial message. the increasing popularity and advances in e-business environment are enabling the development of new classes of applications and the emergence of new trends in the design of online business systems.
cosmos: a middleware platform for sensor networks and a u-healthcare service. we studied the middleware platform, i.e. cosmos (common system for middleware of sensor network) as a national project in korea, for various types of sensor networks such as the zigbee wireless sensor network (wsn), the cdma cellular network, rfid and ip-usn based on the 6lowpan. our project is focused on sensor network abstraction for various ubiquitous sensor networks (usn). we defined standard interfaces between usn middleware and usn networks as well as application services. we implemented several usn services such as u-healthcare services to consider important issues such as data quality, realtime data aggregation and performance analysis for accessibility.
mining fault-tolerant frequent patterns efficiently with powerful pruning. the mining of frequent patterns in databases has been studied for several years. however, the real-world data tends to be dirty and frequent pattern mining which extracts patterns that are absolutely matched is not enough. an approach, called fault-tolerant frequent pattern (ft-pattern) mining, is more suitable for extracting interesting information from real-world data that may be polluted by noise. in our approach, the problems of mining proportional and fixed ft-patterns are considered. in proportional ft-pattern mining, the number of faults tolerable in a pattern is proportional to the length of the pattern. and the number of faults tolerable in different length of patterns is fixed in fixed ft-pattern mining. a new graph structure, ft-association graph, is proposed to help us filtering out impossible candidates with high efficiency. the experimental results show that the proposed algorithms of our approach are highly efficient for mining both proportional and fixed ft-patterns.
runtime concepts for the c standard template library. a key benefit of generic programming is its support for producing modules with clean separation. in particular, generic algorithms are written to work with a wide variety of unmodified types. the runtime concept idiom extends this support by allowing unmodified concrete types to behave in a runtime polymorphic manner. in this paper, we describe one implementation of the runtime concept idiom, in the domain of the c++ standard template library (stl). we describe and measure the performance of runtime-polymorphic analogs of several stl algorithms. we augment the runtime concept idiom by employing a dispatch mechanism that considers both type and concept information to maximize performance when selecting algorithm implementations. we use our implementation to demonstrate the effects of different compile-time vs. run-time algorithm selection choices, and we indicate where improved language and compiler support would be useful.
fast self-healing gradients. we present crf-gradient, a self-healing gradient algorithm that provably reconfigures in o(diameter) time. self-healing gradients are a frequently used building block for distributed self-healing systems, but previous algorithms either have a healing rate limited by the shortest link in the network or must rebuild invalid regions from scratch. we have verified crf-gradient in simulation and on a network of mica2 motes. our approach can also be generalized and applied to create other self-healing calculations, such as cumulative probability fields.
a method for defining the implementation order of software projects under uncertainty. this article proposes a method for obtaining the optimal implementation order of software units in an information technology development project.
special track on object-oriented languages and systems: editorial message. today's large scale software systems are typically designed and implemented using the object-oriented (oo) methodology and paradigm. however, there is still a need for existing oo languages and architectures to continuously adapt in response to demands for new features and innovative approaches.
eyelid measurements using digital video processing. the aim of this paper is to present an automatic eyelid measurement system based on digital video processing techniques. currently, the protocol to measure the palpebral fissure (pf) and the marginal reflex distance (mrd) requires the use of a millimetric ruler. this procedure is subject to error and the accuracy and reproducibility of the results depend on the experience of the examiner. the computer vision system introduced in this paper uses two near infrared light sources synchronized with the camera to robustly detect and track the pupil, and then segment the limbus and the eyelids. the corneal reflection generated by the light sources are used to create a reference point that is used to define the vertical line along which the measurements are taken, and to determine when the patient is actually looking at the camera. our experimental results show that the system is robust to the presence of eyelashes, glasses, and contact lenses, and the measurements can be accurate to tenths of millimeters.
expected energy consumption minimization in dvs systems with discrete frequencies. energy-efficiency has been an important system issue in hardware and software designs to extend operation duration or out power bils. this research explores systems with probabilistic distribution on the execution time of real-time tasks for systems with discrete frequencies. most previous studies consider dvs systems with continuous frequencies for the minimization of expected energy consumption under timing constraints. however, these approaches cannot guarantee the minimization of expected energy consumption when only discrete frequencies are available. this paper presents new approaches to minimize the expected energy consumption. by applying intra-task frequency scheduling, we develop an efficient algorithm to derive optimal frequency scheduling for a single task. the algorithm is then extended to cope with periodic real-time tasks with different power characteristics. with inter-task and intra-task frequency scheduling, we present a linear-programming approach to derive optimal solutions for frame-based real-time tasks and an on-line algorithm for periodic real-time tasks. experimental results show that the proposed algorithms can effectively reduce the expected energy consumption.
capturing business transaction requirements in use case models. a significant portion of our modern economy is dependent on the reliability and usability of enterprise applications (eas) of which business transactions and concurrency management are central concepts. the correct orchestration of subordinate system transactions forming a business transaction, as well as proper concurrency conflict resolution strategies are crucial factors. in this paper we argue that modeling business transactions and concurrency management are a domain activity and as such, are to be analyzed and documented during the requirements phase. failing to do so can have a significant negative effect on the usability of an application. driven by our own experiences in writing use cases for eas, we demonstrate how business transactions can be modeled within use case specifications. concrete examples and usage guidelines are offered as well as a demonstration of how our approach helps contribute to the difficult task of requirements elicitation.
toward quality requirements analysis based on domain specific quality spectrum. it is difficult to identify whether quality requirements are defined adequately or not, but there are few methods to support this kind of requirements analysis. in this paper, we propose a method based on software quality spectrum, that shows a ratio of quality characteristics embedded in a software engineering artifact, such as a requirements specification, a manual and so on. we assume similar kinds of software systems have similar spectrum, thus we can identify the adequacy of quality requirements for a new system by using spectrum of already existing similar systems. we confirmed the assumption above by analyzing actual software systems, i.e., web browsers and drawing tools.
a multi-agent system for the support of producer coalition formation in electricity markets. all over the world distributed generation is seen as a valuable help to get cleaner and more efficient electricity. to get negotiation power and advantages of scale economy, distributed producers can be aggregated giving place to a new concept: the virtual power producer. virtual power producers are multi-technology and multi-site heterogeneous entities. virtual power producers should adopt organization and management methodologies so that they can make distributed generation a really profitable activity, able to participate in the market. in this paper we address the development of a multi-agent market simulator -- mascem -- able to study alternative coalitions of distributed producers in order to identify promising virtual power producers in an electricity market.
including the user in the knowledge discovery loop: interactive itemset-driven rule extraction. we introduce a user-driven approach to mining association rules, integrated into a visualization system, called i2e, that allows miners to depart from a reduced and representative subset of rules to interactively explore the whole rule space. a visualization of the space of k-itemsets displayed after each iteration of apriori allows the miner to guide rule extraction by exploring the space of itemsets. miners can discard itemsets considered not relevant and define clusters of related itemsets to perform rule filtering, so that uninteresting rules are removed while preserving itemset coverage in the resulting rule set. this reduced set provides a starting point to explore the rule space with an interface that supports pairwise comparisons between rules, according to some defined criteria. we describe the results obtained from applying the proposed approach and its supporting system on a case study with a real dataset containing information on cattle commercialized in brazil.