waashk/dblp huggingface dataset:
identifying and modeling aspectual scenarios with theme and mata. aspect-oriented requirements engineering emerged to deal with crosscutting requirements. there are several aspect-oriented requirements approaches, such as theme and mata. through the theme approach, one can identify a set of actions associated to verbs present in requirements documentation, which are then analyzed in order to identify crosscutting behaviors, i.e., potential aspectual scenarios. however, the theme's composition mechanism is not expressive enough even when dealing with analysis models. the mata approach can overlap this point with its powerful composition mechanisms, based on graph transformations that use uml models, in particular behavioral models. these models express scenarios that constitute a very popular and used technique to specify a system's behavior. although, mata is well-succeeded approach to specify aspectual behavior, it does not provide enough mechanisms to identify (aspectual) scenarios. also, it does not identify negative scenarios, i.e., unexpected situations, making their treatment more manageable using aspect-orientation. all these scenarios could be identified with theme and refined with mata. this paper describes an approach that can be seen as a synergy between these two complementary techniques, where identification, modularization, specification and composition of aspectual behavior is realized in a seamless and systematic way.
scheduling intense applications most 'surprising' first. certain streaming applications are required to perform sophisticated analytics within bounded time on arriving streams of data. such applications have the interesting characteristic that the total amount of work that could be performed is unbounded. we show how recent result from algorithmic theory are useful in scheduling such applications as they allow the efficient creation of synopses of unprocessed data. these synopses can then be used to schedule the processing of the stream. in particular, we describe a scheduler that optimizes the information rate available to applications by estimating the entropy of arriving streams. we describe the theory underlying such a scheduler and show how existing programming models can be extended to accommodate it.
task-aware based co-scheduling for virtual machine system. today, virtualization technique is increasingly mature and prevalent in server consolidation and hpc. virtual machine monitor plays a significant role in the resource management by dynamically mapping the virtual cpus of virtual machines to physical cpus according to chosen scheduling policy. however, since a virtual machine monitor lacks the insight into each virtual machine, the unpredictability of each workload makes effective resource allocation difficult. particularly, current virtual machine scheduling policy has a critical impact on the performance of concurrent workload due to the non-synchronization of virtual cpus. this paper presents a task-aware co-scheduling scheduler for virtual machine system. the task-aware mechanism is based on inference techniques using gray-box knowledge which can infer the concurrency and synchronization of guest os level tasks. with this inference, proposed scheduler schedules the designated virtual machine to make it possible that corresponding virtual cpus in this virtual machine can run on the physical cpus synchronously in order to reduce the cost of synchronization between processes or threads. all implementation is confined to the virtualization layer based on xen virtual machine monitor and the credit scheduler. we evaluated our prototype in terms of synchronization performance and cpu fairness over synthetic mixed workloads and realistic applications. the experiment results indicate that task-aware based co-scheduling policy is feasible to improve the performance of virtual machine system for concurrent tasks.
using surface effect measures to model parallel performance. many factors affect the performance of parallel programs including idle time, wait time, and communication costs. the latter often constitute a significant source of overhead. we consider in this paper the impact of such costs on the performance of parallel implementations of three domain decompositions of a three-dimensional model for tissue growth on a cluster. these are regular domain decompositions that comprise a slab decomposition, a rod decomposition, and a block decomposition. using a set of measures that qualify each decomposition, we explore their capability to predict the parallel performance of each implementation. the results of our experiments confirm the applicability of using these measures as predictors of performance for our application, and potentially for other similar ones.
a new technique for data privatization in user-level threads and its use in parallel applications. user-level threads have been used to implement migratable mpi processes. this is a better strategy to implement load balancing mechanisms. that is because, in general, these threads are faster to create, manage and migrate than heavy processes and kernel threads. however, they present some issues concerning private data because they break the private address space that mpi programs typically assume. in this paper, we propose a new approach to privatize data in user-level threads. this approach is based on thread local storage, which is used by kernel threads. we apply this technique to enable mpi processes based on user thread to execute a wider range of parallel programs. we show that this alternative has a more efficient context switch and lower migration cost than other approaches.
esb federation for large-scale soa. embracing service-oriented architectures in the context of large systems, such as the web, rises a set of new and challenging issues: increased size and load in terms of users and services, distribution, and dynamicity. a top-down federation of service infrastructure support that we name "service cloud" and that is capable of growing to the scale of the internet, is seen as a promising response to such new challenges. in this paper, we define the service cloud concept, its promises and the requirements in terms of architecture and the corresponding middleware. we present some preliminary proofs of concept through the integration of a jbi-compliant enterprise service bus, extended to our needs, and a scalable semantic space infrastructure, both relying on an established grid middleware environment. the new approach offers service consumers and providers a fully transparent, distributed and federated means to access, compose and deploy services on the internet. technically, our contribution advances core service bus technology towards the service cloud by scaling the registries and message routers to the level of federations via a hierarchical approach, and by incorporating the communication and coordination facilities offered by a global semantic space.
an apqc-pcf based framework to compare service offerings in business transformation projects. in the services market for business transformation, a pressing problem for customers is that they cannot easily compare software and service vendors. the root of the problem is that tools, methods and content offerings are not only represented without a common terminology but also there is lack of a common delivery-oriented framework to compare such offerings. in this paper, we propose to fill this gap by enhancing apqc's process classification framework (apqc for short), a well-known standard for terminology on process definitions, to become such a common framework. specifically, our extensions comprise of: (a) an enrichment of apqc terminology created by analyzing hundreds of process documentation from live client projects, (b) an addition to the enriched apqc to map data sources from different vendors, and (c) an addition to the enriched apqc to map heterogeneous business transformation methodologies. a prototype tool, discussed in the paper, then uses these extensions to provide the capability to a customer to scope the business landscape of interest, tailor the methods, compare tools, and integrate content across hither-to insurmountable vendor boundaries. the presented approach lays the basis for a new generation of tools being developed in ibm to accelerate sap and oracle business transformation projects.
measuring the alignment between business processes and software systems: a case study. the alignment degree existing between a business process and the supporting software systems strongly affects the performance of the business process execution. methods are needed for detecting this kind of alignment and keeping a business process aligned with a supporting software system even when one of the two evolves. actually, any modification performed in the business process activities and/or supporting software systems may impact the process activities and/or software components, in terms of input/output and/or purpose and, therefore, cause misalignment. this paper proposes a framework including a set of metrics codifying the alignment concept with the aim of measuring it and detecting misalignment if it occurs. the application of the framework is explored through a case study.
extracting ontology concept hierarchies from text using markov logic. ontologies have proven to be a powerful tool for many tasks such as natural language processing and information filtering and retrieval. however their development is an error prone and expensive task. one approach for this problem is to provide automatic or semi-automatic support for ontology construction. this work presents the probabilistic relational hierarchy extraction (prehe) technique, an approach for extracting concept hierarchies from text that uses statistical relational learning and natural language processing for combining cues from many state-of-the-art techniques. a markov logic network has been developed for this task and is described here. a preliminary evaluation of the proposed approach is also outlined.
reachability analysis of gspdis: theory, optimization, and implementation. analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. most problems have been shown to be undecidable in general, and decidability holds only for few classes where the dynamics are restricted and/or the dimension is low. in this paper we present some theoretical results concerning the decidability of the reachability problem for a class of planar hybrid systems called generalized polygonal hybrid systems (gspdi). these new results provide means to optimize a previous reachability algorithm, making the implementation feasible. we also discuss the implementation of the algorithm into the tool gspeedi.
sub-clone refactoring in open source software artifacts. we present a study of revisions made to open source projects that documents the actual refactoring of code associated with code clones (i.e., sections of duplicated code). the study identifies a characteristic in which some clone refactorings were performed on only part of the clone (i.e., a sub-clone). we conclude that sub-clones should be considered during the clone maintenance activity.
applying taxonomic knowledge to bayesian belief network for personalized search. keyword-based search returns its results without concern for the information needs of users at a particular time. in general, search queries are too short to represent what users want, and thus it is necessary to more exactly represent the users' intended semantics. hence, our goal is to enrich the semantics of user-specific information (e.g., users' queries and preferences) with a set of concepts for personalized search. to achieve this goal, we adopt a bayesian belief network (bbn) as a strategy for personalized search since the bayesian belief network provides a clear formalism for mapping user-specific information to its corresponding concepts. nevertheless, as the concept layer of the bayesian belief network consists of only index terms extracted from documents, it does not use domain knowledge which is required for computers to understand the intended semantics of queries. thus, we extend the bayesian belief network to represent the semantics of user-specific information as concepts (not index terms). the concepts are extracted from a taxonomic knowledge base such as the open directory project web directory. in our experiments, we have shown that the extended bayesian belief network using taxonomic knowledge significantly outperforms the conventional methods for personalized search.
lfrp-search: multi-layer ranked visual faceted search: an approach to cope with complex search situations. in enterprise search scenarios information needs are quite diverse. if users know exactly which items they are looking for, they need support in known-item searches. but often information needs are vague and unclear, which means that users cannot explicitly define the search criteria that specify their search request. in these cases, exploratory search approaches are necessary to support users in interactively refining their search queries. our approach for a retrieval system for complex search situations can be characterized by its four constituent parts: the approach deals with the heterogeneity of potential target objects when performing a search considering multiple artifact layers (e. g. projects, products, persons, and documents). the basic search paradigm applied is faceted search which is well-suited for exploratory interactive retrieval. to cope with result sets of different granularity, we include ranking facilities based on facet values as well as query-by-example (qbe) functionalities. users can easily state their priorities visually by using preference functions. finally, parallel coordinates (pc) are used to visualize the characteristics and dependencies of (intermediate) results in order to provide users with a deeper understanding of the data under investigation. these four cornerstones of our approach are reflected in the acronym lfrp-search (multi-<u>l</u>ayer <u>f</u>aceted search with <u>r</u>anking using <u>p</u>arallel <u>c</u>oordinates). the main contribution of this paper is the semi-formal description of the query options.
a real-time architecture design language for multi-rate embedded control systems. this paper presents a language dedicated to the description of the software architecture of complex embedded control systems. the language relies on the synchronous approach but extends it to support efficiently systems with multiple real-time constraints, such as deadline constraints or periodicity constraints. it provides a high-level of abstraction and benefits from the formal properties of synchronous languages. the language defines a small set of rate transition operators, which enable the description of user-defined deterministic multi-rate communication patterns between components of different rates. the compiler of the language automatically translates a program into a set of communicating real-time tasks implemented as concurrent c threads that can be executed on a standard real-time operating system.
msp algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning. this article addresses the problem of efficient multi-robot patrolling in a known environment. the proposed approach assigns regions to each mobile agent. every region is represented by a subgraph extracted from the topological representation of the global environment. a new algorithm is proposed in order to deal with the local patrolling task assigned for each robot, named multilevel subgraph patrolling (msp) algorithm. it handles some major graph theory classic problems like graph partitioning, hamilton cycles, non-hamilton cycles and longest path searches. the flexible, scalable, robust and high performance nature of this approach is testified by simulation results.
design and development of a real-time embedded inertial measurement unit. micro-electro-mechanical systems (mems) sensors are used nowadays in a wide range of applications, from robotics to entertainment. recently, this technology has also been adopted to equip inertial measurement units (imus) replacing traditional electro-mechanical sensors. in this work we present a low-cost embedded imu which is based on a low-cost embedded microcontroller with limited resources in terms of computing power and memory. the developed software runs on the top of the erika enterprise real-time kernel to manage the computing tasks that perform sensor data sampling and processing. low-cost mems accelerometers, gyroscopes and magnetometers provide the required data and a kalman filter analyses raw values in real-time. experimental results are obtained using a six degrees of freedom anthropomorphic manipulator to drive the imu with accurate known trajectory, acceleration and rotation. performances are evaluated both in terms of sensor fusion effectiveness and real-time execution.
towards mobile process as a service. process as a service (paas) addresses modeling, execution and management of business processes without running extensive and costly process management software. such a flexible outsourcing strategy is especially advantageous in the context of mobile devices and services which are increasingly relevant for contemporary business activities. based on the concept of context-based cooperation, this paper proposes a paas solution for mobile participants which enables them to share existing local and remote resources and to utilize paas functionality of cooperating providers in a user-defined way. the approach is realized and evaluated by an extended prototype implementation of the demac (distributed environment for mobility aware computing) platform.
on processing location based top-k queries in the wireless broadcasting system. in this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial specifications for data objects in the wireless broadcasting system. we introduce two methods for processing location based top-k queries on the broadcast stream. in the first method, the search algorithm runs on the broadcast aggregate r-tree (ar-tree). however, the ar-tree may deteriorate the search performance, especially in terms of the tuning time. with this problem in mind, we propose a novel index structure, called the bit-vector r-tree (br-tree), which stores additional bit-vector information to facilitate processing of location based top-k queries. the search algorithm on the broadcast br-tree is also described. our simulation experiments demonstrate that the br-tree method clearly outperforms the ar-tree method in terms of the tuning time, while maintaining similar or better performance in terms of the access time.
reality cues-based interaction using whole-body awareness. the exploration of 3d environments using 6 degrees-of-freedom interaction is still a challenge since users easily become disoriented. in this paper we discuss the benefits of the whole-body awareness in 3d interactive applications. we propose a technique for navigation and selection in 3d environments which explores the peephole metaphor with a tablet pc. in practice, the tablet is held by the participant who moves it around and points it in any direction for visualization and interaction. the method was tested with a set of users who were asked to perform selection tasks. the technique presented competitive results when compared with conventional interaction methods and also showed that real world body orientation memory helps users to perform better in the virtual world.
modeling the variability of architectural patterns. architectural patterns provide proven solutions to recurring design problems that arise in a system context. a major challenge for modeling patterns in a system design is effectively expressing pattern variability. however, modeling pattern variability in a system design remains a challenging task mainly because of the infinite pattern variants addressed by each architectural pattern. this paper is an attempt to solve this problem by categorizing the solution participants of patterns. more precisely, we identify variable participants that lead to specializations within individual pattern variants and participants that appear over and over again in the solution specified by several patterns. with examples and a case study, we demonstrate the successful applicability of this approach for designing systems. using the uml extension mechanism, we offer extensible architectural modeling constructs that can be used for modeling several pattern variants.
adaptive internet services through performance and availability control. cluster-based multi-tier systems provide a means for building scalable internet services. building adaptive internet services that are able to apply appropriate system sizing and configuration is a challenging objective for nowadays system administrators. this paper addresses two issues for building adaptive internet services: (i) the control of service cost, performance and availability, three antagonist and primary aspects of internet services, and (ii) an adaptive control of internet services that does not shift the complexity of system administration from the internet service to its controller. this paper presents the design and implementation of moka - a middleware for controling performance and availability of cluster-based multi-tier systems. the contribution of the paper is multifold. first, we improve an analytic model to predict the performance, availability and cost of cluster-based multi-tier applications. second, we define a utility function and use it to build a capacity planning algorithm that calculates the optimal application configuration which guarantees performance and availability objectives while minimizing functioning cost. finally, we propose a novel approach for dynamic provisioning of multi-tier applications that removes the burden of manual (re-)configuration of the controller itself. our experiments on the tpc-w multi-tier online bookstore show that moka provides significant benefits on application performance and availability.
how to manage interactive dialogues of avatar agents by using 3d spatial information of virtual world. chat and instant messaging are crucial functions in the internet environment. internet chat and instant messaging services are becoming increasingly popular among internet users. one of the crucial issues in internet chat is how to manage the corresponding pairs of questions and answers in a sequence of conversations. there are numerous novel methodologies for coping with this problem, but most are poor at managing interruptions, organizing turn-taking and conveying comprehension. nowadays, since the internet environment is evolving into the 3d internet environment, it is highly desirable to exploit this 3d information in virtual chat environments. there are a few chat systems based on 3d virtual environments that made improvements to these 3d chat systems, such as rendering avatars and 3d spaces, but the problems(managing chat dialogues) in the standard 2d text-based chat remained. so, we proposed more realistic 3d virtual chat system using 3d spatial information[8]. in this paper, we improve our previous work. finally, our experiment shows that our system is highly effective in a virtual chat environment.