waashk/dblp huggingface dataset:
dostrack: a system for defending against dos attacks. denial of service (dos) attacks are one of the complex problems in the current internet. in this paper, we propose a system, dostrack, that can efficiently deal with the tcp syn and reflection distributed denial of service (ddos) attacks. we also describe a prototype implementation of our model with hp openview network node manager (nnm) and discuss how our model can be beneficial to the ddos victim and the isp.
exhaustion dominated performance: a first attempt. in this paper we present a first attempt to an analytical method to discover and understand how the available resources influence the execution time. our method is based on a piecewise linear model for dominating execution limitations and black-box observations. we verify this analysis method by a set of real-world experiments. finally, we conclude that the different effects follow a linear superposition within a certain range.
a new protein motif extraction framework based on constrained co-clustering. signal finding (pattern discovery) in biological sequences is a fundamental problem in both computer science and molecular biology. many approaches have been proposed for extracting interesting patterns (or motifs) from dna/rna and protein sequences. some approaches are based on simple and multiple alignment techniques, some use biological knowledge and others do not. in this paper, we propose a de novo framework that performs motifs identification and exploits a constrained co-clustering technique allowing one to simultaneously find associations between groups of protein sequences and groups of motifs. we show that the presented approach is able to group together protein sequences belonging to the same families and, at the same time to provide a set of characterizing motifs.
efficient processing of sparql joins in memory by dynamically restricting triple patterns. since there are a lot of similar or common properties between rdf and relational databases and between sparql and sql, many efforts focus on leveraging the research results of optimizing relational query languages for optimizing sparql queries. however, sparql has its own characteristics different from sql, which are not fully exploited by existing work. therefore, there is still much space for research on optimizing sparql queries. based on the triple nature of rdf data, we create 7 indices to retrieve rdf data quickly; based on the sparql-specific properties and the 7 indices, we develop a new, efficient approach to computing join by dynamically restricting triple patterns. our experimental results show the efficiency of our approach.
server push with instant messaging. server push is an essential part of modern web applications. with the ability of sending relevant information to users in reaction to new events, enables highly interactive applications on the www. user interfaces of desktop applications have had a two-way communication with an underlying software since their advent, but web applications are reaching the same state only now. in addition, currently, the push is usually emulated using the pull technology, since, with the http protocol alone, it is not possible to realize a real push. this paper evaluates how an instant messaging protocol, namely xmpp, can complement http-based web applications. we present a communication paradigm of a push system and an implementation of it. to evaluate the implementation, a use case is designed and realized with the system.
a method for clustering transient data streams. this paper describes a novel method for clustering single and multi-dimensional data streams. with incremental computation of the incoming data, our method determines if the cluster formation should change from an initial cluster formation. four main types of cluster evolutions are studied: cluster appearance, cluster disappearance, cluster splitting, and cluster merging. we present experimental results of our algorithms both in terms of scalability and cluster quality, compared with recent work in this area.
combining statistics and semantics via ensemble model for document clustering. incorporating background knowledge into data mining algorithms is an important but challenging problem. current approaches in semi-supervised learning require explicit knowledge provided by domain experts, knowledge specific to the particular data set. in this study, we propose an ensemble model that couples two sources of information: statistics information that is derived from the data set, and sense information retrieved from wordnet that is used to build a semantic binary model. we evaluated the efficacy of using our combined ensemble model on the reuters-21578 and 20newsgroups data sets.
adaptive burst detection in a stream engine. detecting bursts in data streams is an important and challenging task. due to the complexity of this task, usually burst detection cannot be formulated using standard query operators. therefore, we show how to integrate burst detection for stationary as well as non-stationary data into query formulation and processing, from the language level to the operator level. afterwards, we present fundamentals of threshold-based burst detection. we focus on the applicability of time series forecasting techniques in order to dynamically identify suitable thresholds for stream data containing arbitrary trends and periods. the proposed approach is evaluated with respect to quality and performance on synthetic and real-world sensor data using a full-fledged dsms.
a collaborative tool for designing and enacting design processes. today several approaches using situational method engineering paradigm exist, each of them proposes methods and techniques for developing ad-hoc design processes. in this context heavy efforts were spent in the construction of appropriate tools that could help method engineers in producing a specific design process and in using it. we developed a tool called metameth for supporting the design process definition and its enactment. metameth is implemented as a multi-agent system, where each agent is capable of reasoning and adapting itself in order to support the designer in performing different kinds of design activities.
swobe - embedding the semantic web languages rdf, sparql and sparul into java for guaranteeing type safety, for checking the satisfiability of queries and for the determination of query result types. the semantic web and its technologies become increasingly important. as more and more semantic web applications are being used, developing more stable semantic web applications becomes a key issue. the state-of-the-art in programming semantic web applications is using complex application programming interfaces of semantic web frameworks, where extensive tests are necessary for the detection of errors, although many types of errors could be detected already at compile time. in this paper, we propose an embedding of semantic web languages into the java programming language, such that semantic web data and queries can be transparently used, type safety is guaranteed, and already at compile time, syntax errors of semantic web data and queries are reported, unsatisfiable queries are detected and the types of query results are determined. a demonstration of our system is available online.
implementing rigorous web services with process algebra: navigation plan for web services. despite the popularity of standards such as bpel in business-critical applications, rigorous approaches to web service composition remain an open research problem. frameworks based on formal foundations (e.g., process algebra or petri nets) have emerged as promising approach to address these challenges. this work introduces the navigation plan for web services (npws), a system module, which extends a process algebra based workflow engine with a web service interface. we systematically combine the web service paradigm and comprehensive real-world workflow functionality while guaranteeing sound properties through formal process specification. process instantiation and execution monitoring are implemented with enterprise javabeans, sql extension, and java persistence api to ensure flexibility and scalable integration. our primary contribution is an applied approach to implementing complex web services with formal properties through a well-defined process algebraic core. we further illustrate our system with sample client applications and a case study based on an actual deployment in a library environment.
socially filtered web search: an approach using social bookmarking tags to personalize web search. today's knowledge workers are confronted with an ever increasing information overload while searching for needed information in the web. common search engines do not take into account the current work context of the user. but we consider context information as an effective means to implicitly narrow the information space of the web. in this paper we present a novel approach that increases the relevance of search results by considering the current work context. we track the user's web browsing behavior, store visited pages and build up a user model based on this information. as the user browses, the stored urls of the visited pages are enhanced with tags from social bookmarking sites. based on the user model and the retrieved bookmarks we developed an easy-to-use and easy-to-configure clientside web search engine that refines the original search query with these tags. our approach follows the design principle of non-intrusiveness. that means we present the context-sensitive personalized adapted search results together with the original non-adaptive search results. we developed an open architecture that allows the user to reconfigure the system to use different metadata providers and search engines. in order to prove our architecture we implemented a firefox add-on.
agenttool process editor: supporting the design of tailored agent-based processes. this paper describes the agenttool process editor (ape), an eclipse plug-in based on the eclipse process framework. the aim of ape is to facilitate the design, verification, and management of custom agent-oriented software development processes. ape provides five basic structures. the library is a repository of agent-oriented method fragments. a process editor allows the management of tailored processes. task constraints help process engineers specify guidelines to constrain how tasks can be assembled, while a process consistency mechanism verifies the consistency of tailored processes against those constraints. finally, the process management integrates ape with the agenttool iii development environment and provides a way to measure project progress using earned value analysis.
semantic web services: from owl-s via uml to mvc applications. owl-s is used to describe the semantics of web services so that the discovery, selection, invocation and composition of these services can be automated. prior research has shown that uml diagrams can be used to automatically generate semantic web service descriptions in owl-s. if complete web applications could be generated from owl-s descriptions, then a higher level of automation would be achieved. in this paper, we propose an approach for processing owls descriptions in order to produce mvc-based skeletons for web applications. the owl-s ontology goes through a series of transformations in order to generate an application whose model-view-controller structure is implemented by a combination of javabeans/jsp/servlets code, respectively.
bpr: a bit-level packet recovery in wireless sensor networks. in wireless sensor networks (wsns), the bit-error-rate (ber) is so high that the receiver requests retransmission frequently. packet recovery is an important technology to improve transmission performance. in this paper, we propose bpr, a bit-level packet recovery scheme in wsns. in bpr, if a packet is corrupted for two times, instead of request the whole packet, the receiver compares these two corrupted copies of the packets and determines which bit(s) should be retransmitted. bpr sits between mac sub-layer and logical link control (llc) sub-layer and can be compatible with most of current packet recovery schemes and is very easy to implement. the analysis shows that bpr can yield a gain of 364% compared with seda[1] and even more with 802.11 in high ber environments.
situated process engineering for integrating processes from methodologies to infrastructures. in the field of multi-agent systems (mass), methodologies and infrastructures have developed in the last years along two opposite paths: while agent-oriented methodologies have essentially undergone a top-down evolution, mas infrastructures have mostly followed a bottom-up path, producing a conceptual gap between methodologies and the available agent infrastructures. this paper aims at defining a method for filling such a gap, based on situational method engineering (sme) and spem (software process engineering meta-model). after highlighting the lack of sufficient research and understanding about the role of the infrastructures in the software engineering process, we show that infrastructures, like methodologies, have processes behind them, and propose a method based on the integration of the processes underpinning both methodologies and infrastructures. then, we validate such an approach by showing how the process of the soda methodology can be integrated with the process of the tucson infrastructure using sme and spem.
wireless communication glove apparatus for motion tracking, gesture recognition, data transmission, and reception in extreme environments. military personnel need better ways to communicate in hostile, noisy, silence-mandated, and/or extreme environments. typing on a keyboard is difficult and impractical while wearing comprehensive protective clothing. wireless data gloves were researched and developed to transmit and receive ascii code and other signals as hand gestures. two categories of glove prototypes were constructed: gloves with and without a haptic-io capability. all data gloves detect motion, such as gestures, using magnetic sensors. non-haptic gloves only transmit static and dynamic gestures. haptic gloves have vibro-mechanical devices on the fingertips for feedback about transmitted signals and for covert-signal reception. many potential communications applications include hazardous and covert military operations, space operations, fire fighting, mining, training, underwater use, and aids for the visually and hearing impaired.
isomorphisms, hylomorphisms and hereditarily finite data types in haskell. this paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, bitstrings, finite functions) and their extension to hereditarily finite universes through hylomorphisms derived from ranking and unranking operations. the paper is part of a larger effort to cover in a declarative programming paradigm some fundamental combinatorial generation algorithms along the lines of knuth's recent work [10]. the self-contained source code of the paper, as generated from a literate haskell program, is available at http://logic.csci.unt.edu/tarau/research/2008/sfiso.zip.
efficient concept detection by fusing simple visual features. concept detection is one of the important tasks in video indexing due to its importance to bridging the semantic gap in multimedia retrieval. many methods have been proposed for this task, however finding a method which can generalize well for a large number of concepts and is scalable for processing huge video databases is still challenging. in this paper, we introduce a general framework for efficient and scalable concept detection by fusing svm classifiers trained by only simple visual features such as color moments, edge orientation histogram and local binary patterns. we evaluate the proposed framework for detecting a large number of concepts on various trecvid datasets with hundreds of hours of video. experimental results show that the proposed framework achieves good performance with a small computational cost.
management of requirements in erp development: a comparison between proprietary and open source erp. identification and specification of business requirements are extremely important when development of enterprise resource planning systems (erps) take place. it can be stated that this is still a problematic area not well researched and, as a result from that, it does not exist much guidance on how to deal with requirements. in this paper we discuss if existing problems of requirements management are the same or if they differ according to the type of development: closed source (proprietary) or open source erp. the reason is that it is possible that these two approaches can promote each other in how to improve the first phase in erp development. from the discussion about similarities and differences between the two approaches it is suggested further research in this area that could end up in some more practical guidelines on how to do the requirements definition so that the finally developed erps better support adopters' needs.
flashbox: a system for logging non-deterministic events in deployed embedded systems. the ability to postmortem failures in deployed systems due to non-deterministic events is useful in crash investigations. with this goal in mind, we propose flashbox - a system that acts as a black box for embedded systems, recording non-deterministic events (interrupts). the flashbox hardware consists of a microcontroller and flash memory. the flashbox software is an extension to a compiler, enabling recording capabilities at various granularities. there are no source code modifications required to use flashbox and no assumptions made on processor capabilities such as hardware counters. the flashbox log can be used for faithful replay with a goal to isolate faults and reason about failure. we present a prototype implementation of flashbox that logs non-deterministic events on an avr atmega169 microcontroller. the flashbox prototype consists of a 8051 microcontroller with flash memory. the avr-gcc compiler has been extended to log non-deterministic events. based on our experimental results, flashbox results in 10-23% overhead while providing capability to log non-deterministic events at instruction level granularity. with decreasing cost of flash memories, flashbox provides a low cost logging mechanism. the use of standard i/o communication protocols enhances portability, enabling ease of integration for different classes of embedded systems.
evaluation of visual attention models under 2d similarity transformations. the computational models of visual attention, originally proposed as cognitive models of human attention, nowadays are being used as front-ends to some robotic vision systems, like automatic object recognition and landmark detection. however, these kinds of applications have different requirements from those originally proposed. more specifically, a robotic vision system must be relatively insensitive to 2d similarity transformations of the image, as in-plane translations, rotations, reflections, and scales. in this paper several experiments with two visual attention models publicly available are described. the results show that the best known model, called nvt, is extremely sensitive to these 2d similarity transformations. therefore, a new visual attention model, called nlook, is proposed and validated with the same invariance criteria, and the results show that nlook is less sensitive to these kind of transformations than the other two models. besides, nlook can select better fixations according to a redundancy criterion. thus, the proposed model is an excellent tool to be used in robot vision systems.
towards the universal semantic assessment of accessibility. the ever increasing adoption of software technologies has bring closer technology to users with disabilities and users that interact with devices other than a pc. this diversification poses a real challenge to developers when creating software that has to cope with a myriad of interaction situations, as well as specific directives for ensuring an accessible interaction. in this paper we present saaf, the semantic accessibility assessment framework. saaf provides a set of constructs to describe the semantics of accessibility assessment procedures that can cope with different users, devices, and software technologies in a coherent and formalised way. saaf affords the description of users and devices, their constraints and requirements, in the light of different accessibility assessment procedures. we exemplify the usage of saaf by applying it in the context of the web and related accessibility best practices such as wcag.
on a discretizable subclass of instances of the molecular distance geometry problem. the molecular distance geometry problem can be formulated as the problem of finding an immersion in r3 of a given undirected, nonnegatively weighted graph g. in this paper, we discuss a set of graphs g for which the problem may also be formulated as a combinatorial search in discrete space. this is theoretically interesting as an example of "combinatorialization" of a continuous nonlinear problem. it is also algorithmically interesting because the natural combinatorial solution algorithm performs much better than a global optimization approach on the continuous formulation. we present a branch and prune algorithm which can be used for obtaining a set of positions of the atoms of protein conformations when only some of the distances between the atoms are known.
designing a multi-core hard real-time test bed for energy measurement experiments. this paper presents a systematic methodology to implement and validate schemes for energy-efficient task allocation and scheduling in multi-core hard real-time embedded systems. a real-life test bed comprising dual-core intel t2500 processor with dynamic voltage scaling (dvs) capability and running linux fedora 8 based hard real-time scheduling has been developed to accurately benchmark the energy-savings of various proposed scheduling schemes and the experience from implementation is summarized to serve as potential guidelines for other researchers and practitioners.
constraint-based modelling and analysis of organisations. modern organisations are characterised by a great variety of forms and often involve many actors with diverse goals, performing a wide range of tasks in changing environmental conditions. due to high complexity, mistakes and inconsistencies are not rare in organisations. to provide better insights into the organisational operation and to identify different types of organisational problems explicit specification of relations and rules, on which the structure and behaviour of an organisation are based, is required. before it is used, the specification of an organisation should be checked for internal consistency and validity w.r.t. the domain. to this end, the paper introduces a framework for formal specification of constraints that ensure the consistency and validity of organisational specifications. to verify the satisfaction of constraints, efficient and scalable algorithms have been developed and implemented. the framework presented here is based on the organisation modelling framework from [2] which defines four interrelated organisational views (or perspective) with their dedicated predicate logic-based languages: performance-oriented, process-oriented, organisation-oriented and agent-oriented. to express temporal relations, the dedicated languages of the views are embedded into the temporal trace language (ttl) [2], which is a variant of the order-sorted predicate logic. some of the examples given in the paper are from a case study in the air traffic domain.
a biochemical metaphor for developing eternally adaptive service ecosystems. in the near future, pervasive sensing and actuating devices will densely populate our everyday environments, and will be tightly integrated with telecom and internet networks---also eventually contributing to blur their distinction.