waashk/dblp huggingface dataset:
a practical evaluation of large-memory data processing on a reliable remote memory system. this paper provides a preliminary performance evaluation to address the efficacy of a remote memory system (rms) by using a prototyped rms that has reliability functionality. the protyped rms is a practical kernel-level rms that supports large memory data processing, and it is built on inexpensive pcs and a high-speed network capable of remote direct memory access (rdma) operations. our experimental results suggest that an rms could be practical enough to support the rigorous demands of commercial inmemory database systems that have high data access locality, but it is not quite efficient in cpu-intensive applications due to the high page fault rate. our evaluation convinces us of the possibility that a reliable rms can satisfy both the high degree of reliability and efficiency for large memory data processing applications whose data access pattern has high locality.
a particle swarm optimization based algorithm for fuzzy bilevel decision making with constraints-shared followers. in a bilevel decision problem, decision making may involve multiple followers and fuzzy demands. this research focuses on the problem of fuzzy linear bilevel decision making with multiple followers who share common constraints (fbcsf). based on the ranking relationship among fuzzy sets defined by cut set and satisfactory degree &alpha;, a fbcsf model is presented and a particle swarm optimization based algorithm is developed. the experiments reveal that solutions obtained by this algorithm are reasonable and stable.
towards a landmark influence framework to protect location privacy. in this paper, we present a cloaking algorithm called directedcloaking to protect user's location privacy. there is a location anonymizer (la) to perform this cloaking. once this cloaked location data is provider by la, location based service provider (lbsp) can minimize and give relevant result-candidates for a given query. lbsp can also constrain the maximum possible candidates for a given query because of our definition of a possiblespace. we define, for the first time, landmark influence space (lis) and show that cloaking in lis can give the above-mentioned performance benefit to the user.
multivariate root finding with search space decomposition and randomisation. the paper presents a method for multivariate root finding that uses adaptive search space decomposition by generalised quad-trees and non-linear lagrange polynomials to interpolate the function inside the tree nodes. the method applies randomisation to achieve robustness. selection of start points for the newton-raphson like search is based on a heuristic rating of the decomposition cells. the algorithm tunes out found roots to find all solutions. although aimed at geometric constraint solving, where functions are only partially defined and no derivatives are available, the root finding method is applicable to a wider range of problems.
towards organizational agent-oriented operating systems. this work presents a new approach about modern operating systems construction based on technologies developed over the last years on software engineering. those technologies emphasize component-based architectures, distributed and network systems and, mainly, multiagent systems and organizational oriented multiagent systems. the advantages of using the agent technology on operating systems construction are exposed along this work. this technology generates an essential quality advance on the services those systems provide according to this design philosophy. the work is focused on the development of a design framework for a new generation of operating systems, based on the underlying principles of multi-agent systems and agreement technologies, in particular those, which utilise organisational principles, web services and interaction-based communication. the proposed approach integrates those middleware technologies as services for an operating system and explores the mechanisms of how such services can be globally offered to every operating system user.
a nonlinear mobile robot modeling applied to a model predictive controller. this paper presents a nonlinear modeling approach of an omnidirectional mobile robot to predict the robot behavior in a model-based predictive controller (mpc). parameters related to dynamic equations of the robot and restriction of the robot's motors are considered in the modeling. simulation results and real results of navigation are provided to demonstrate the performance of the proposed modeling approach.
a property-based verification approach in aspect-oriented modeling. aspect-oriented modeling (aom) techniques have been advocated as solutions to support separation of crosscutting features from other application design concerns. in an aom approach, crosscutting features are described by aspect models and other application features are described by a primary model [1]. however, composing an aspect model with a primary model can result in conflicts or compromised behaviors. therefore, a key issue in applying the aom approach is determining whether composition of an aspect model and a primary model produces a composed model that has desired properties. we extend the previous aspect composition approaches by france et al. [1] and song et al. [2] by supporting a way to generate proof obligations that must be discharged in order to establish that a desired property holds in the composed class model. fig. 1 shows an overview of our verifiable composition approach. the composition of a primary model class diagram and an aspect model class diagram (refer to the action (1) in fig. 1) is accomplished according to a named-based composition proposed by [1]. specifying the given property statement using the object constraint language (ocl) provides the property to be verified denoted as pprop (refer to (2)). the operation behavior in a composed model needs to be verified against this property. a proof obligation is generated and evaluated when a sequence diagram is derived from the operation specification in the composed class diagram (refer to (3)). if any faulty composition is notified during the evaluation, the current sequence diagram, which is partially derived at that point, and the current proof obligation may be used to determine at which part of the composition the property fails to hold. the information that is available when the composition stops, can be used by a developer to determine what needs to be done to correct the situation. otherwise, a sequence diagram is obtained. for details of the action (3) in fig. 1, refer to our earlier work in [3].
using web accessibility patterns for web application development. design of accessible web applications is a complex challenge. the presented concept demonstrates the potential of model-based and user-centered development. based on web accessibility patterns, a suitable solution is discussed which can be used to simplify the development process. using an established approach from web engineering, the use of patterns is demonstrated.
dynamic planning and weaving of dependability concerns for self-adaptive ubiquitous services. ubiquitous computing and service-oriented computing enable the development of a new trend of applications that can opportunely interact with services discovered in the surrounding landscape. although sporadic, this type of interaction requires the deployment of dependable mechanisms to ensure the correct completion of the interactions. however, the integration and the configuration of these mechanisms depends not only on the type of service accessed, but also on the surrounding environment. such a variability requires an extensive effort of the developers to support the alternative mechanisms. thus, to reduce this effort, we propose to integrate the aspect-oriented programming (aop) principles into the music planning-based adaptation middleware in order to dynamically plan and weave dependability concerns into the application depending on the execution context. in particular, this paper introduces our continuous support for aop, which includes i) a uniform model for describing the dependable application configurations and ii) a modular middleware platform for weaving and configuring the dependability concerns when necessary.
points-to analysis for javascript. javascript is widely used by web developers and the complexity of javascript programs has increased over the last year. therefore, the need for program analysis for javascript is evident. points-to analysis for javascript is to determine the set of objects to which a reference variable or an object property may point. points-to analysis for javascript is a basis for further program analyses for javascript. it has a wide range of applications in code optimization and software engineering tools. however, points-to analysis for javascript has not yet been developed. javascript has dynamic features such as the runtime modification of objects through addition of properties or updating of methods. we propose a points-to analysis for javascript which precisely handles the dynamic features of javascript. our work is the first attempt to analyze the points-to behavior of javascript. we evaluate the analysis on a set of javascript programs. we also apply the analysis to a code optimization technique to show that the analysis can be practically useful.
using dynamic bayesian networks to infer gene regulatory networks from expression profiles. two major challenges in inferring the sparse topological architecture of gene regulatory networks using computational methods are 1) the low accuracy of predicting connections between genes and 2) the excessive computational cost. in order to address these challenges, we have exploited some biological features of yeast cell cycle. one such feature is that, a high proportion of cell cycle regulated genes are periodically expressed; that is genes are maximally expressed to affect and control the regulation of other genes and on completing certain tasks; they are repressed by some other regulator genes. thus the whole cell cycle progresses systematically through the successive activation and inactivation of ccr genes. to use this feature, we have calculated the peak time of individual genes which falls into one/more phases of the cell cycle. therefore, genes that peak in the interval of the same phase of the cell cycle have been grouped together. finally, we have applied the dynamic bayesian network (dbn) algorithm within distinct phases of genes. as a consequence, both the accuracy and the computational cost of our learning algorithm have been improved in comparison with the existing dbn algorithms.
web-services in the dutch healthcare insurance sector: expected versus achieved benefits. the upcoming buzz words nowadays appear to be web service or open network environment [4]. this is the latest it-technology to support business processes which is embraced by an increasing number of companies, many of which are in the financial sector. this paper investigates if the promises made by technology providers and it strategists have been made true by looking at the actual business benefits of web services.
developing and evaluating web multimodal interfaces - a case study with usability principles. in this paper we describe an approach to facilitate the design of web multimodal interfaces aiming at improving the user experience and the user interface usability using speech recognition together with the usual graphical user interfaces. we present a proposal for usability evaluation based on the heuristic evaluation, which considers the multimodal principles identified during a case study. as a result of using the proposed approach in the case study and from literature review, we report our considerations for the design, development and improvement of the web multimodal interfaces.
adaptive finite element methods for nonlinear inverse problems. nonlinear inverse problems are usually formulated as optimization problems on function spaces constrained by partial differential equations. as a consequence, in realistic, three-dimensional cases, they become extraordinarily expensive to solve numerically, and advanced methods like adaptive mesh refinement become indispensible. in this contribution, we outline such an adaptive algorithm and demonstrate results using a realistic example from optical tomography.
expert system for supporting conformity inspections of software application interfaces to the iso 9241. usability assessment of products based on the iso 9241 standard has been usually carried out by using printed parts of this standard and its checklists. in this paper it is proposed a tool for supporting conformity inspections of software application user interfaces based upon iso 9241. the proposed expert system -- x-sci (expert software conformity inspection) -- aims to give support to user interface designers and evaluators in iso 9241 standard inspection processes. it will treat differently these categories of professionals by assigning different degrees of certainty to their choices in each stage of the inspection.
mapping semantically enriched formal tropos to business process models. in the context of semantic business process management (as defined by the super project), there is a current lack of requirements engineering methodologies to acquire correctly semantically annotated business process models. this paper meets this need by extending the existing formal tropos specification, originating from early phase requirements engineering, to embed semantic annotations. furthermore, detailed mappings are proposed to translate semantically enriched formal tropos scripts into business process modelling ontology (bpmo), which is a superset of business process modelling notation (bpmn) and event-deriven process chain (epc).
the device service bus: a solution for embedded device integration through web services. this paper presents a middleware infrastructure for integration of heterogeneous embedded devices in ubiquitous computing environments. the proposed infrastructure employs the devices profile for web services (dpws) as the underlying integration technology, allowing devices that adopt different networking standards to interact with each other, through the use of interconnection devices and software components responsible for building a communication path among them. a prototype implementation of this middleware infrastructure is also described, and results of performance measurements obtained with this prototype are presented.
latency-aware leader election. experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. we use this approach to study the problem of electing a leader that is eventually not only correct (as captured by the &omega; failure detector abstraction), but also optimal with respect to the transmission delays to its peers. we give the definitions of this problem and a suitable model, thus allowing us to make an analytical analysis of the problem, which is in contrast to previous work on that topic.
architectural requirements prioritization and analysis applied to software technology evaluation. in this short paper, we summarize an industrial project in which we developed and applied the attribute hierarchy-based evaluation of architectural designs (ahead) method for selecting a software technology to form the basis for the next-generation architecture of a complex commercial software application. ahead leverages the software engineering institute's attribute-driven design (add) method and the analytic hierarchy process (ahp) for evaluating software technologies that have important architectural impact. the core activities of ahead include elicitation, prioritization, and analysis of architectural requirements. the goal of these requirements activities was to establish and apply objective criteria for selecting, prototyping, and evaluating software technology alternatives. we found that using ahead brought greater objectivity to prioritization of architectural requirements and to the technical judgments of the software technology options.
a generic library for gui reasoning and testing. graphical user interfaces (guis) make software easy to use by providing the user with visual controls. therefore, correctness of gui's code is essential to the correct execution of the overall software. models can help in the evaluation of interactive applications by allowing designers to concentrate on its more important aspects. this paper presents a generic model for language-independent reverse engineering of graphical user interface based applications, and we explore the integration of model-based testing techniques in our approach, thus allowing us to perform fault detection. a prototype tool has been constructed, which is already capable of deriving and testing a user interface behavioral model of applications written in java/swing.
on the practical importance of communication complexity for secure multi-party computation protocols. many advancements in the area of secure multi-party computation (smc) protocols use improvements in communication complexity as a justification. we conducted an experimental study of a specific protocol for a real-world sized problem under realistic conditions and it suggests that the practical performance of the protocol is almost independent of the network performance. we argue that our result can be generalized to a whole class of smc protocols.
a framework for modelling and implementing self-organising coordination. research fields like pervasive computing are showing that the interactions between components in large-scale, mobile, and open systems are highly affected by unpredictability: self-organising techniques are increasingly adopted within infrastructures aimed at managing such interactions in a robust and adaptive way. accordingly, in this paper we discuss the framework of self-organising coordination: coordination media spread over the network are in charge of managing interactions with each other and with agents solely according to local criteria, making interesting and fruitful global properties of the resulting system appearing by emergence---probability and timing typically playing a crucial role. we show that the tucson coordination infrastructure can be used as a general platform for enacting self-organising coordination; we put it to test on two cases: an inter-space application of adaptive tuple clustering, and a intra-space application of chemical-like coordination reactions.
decentralized coordination of homogeneous and heterogeneous agents by digital infochemicals. effective decentralized coordination mechanisms enabling self-organizing emergent solutions have to take into account the inherent heterogeneity of components involved in most of the problems such solutions are intended for. thus, versatile mechanisms take inspirations from coordination paradigms between homogeneous or heterogeneous organisms in biology using chemical stimuli. an economic engineering of such self-organizing emergent solutions however requires an expressive, abstract coordination model that allows for the combination of different digital chemical stimuli into coherent and efficient coordination mechanisms. this work discusses certain shortcomings of the existing abstract model as well as proposes and evaluates improvements to it.
improving classification based off-topic search detection via category relationships. the illegitimate access of documents by insiders (also known as off-topic search) is an increasingly prevalent and largely ignored problem. we propose an approach that uses text classification for off-topic search detection. our empirical results indicate that off-topic search detection effectiveness improves by considering only a subset of documents that are retrieved for a given user query. furthermore, we also show that the effectiveness of off-topic search detection improves by using the ontological information of document categories. our empirical results demonstrate that utilizing sibling relationship information and relationships derived from misclassification information statistically significantly improves the results over the baseline in most cases.
the current feasibility of gesture recognition for a smartphone using j2me. the need to improve communication between humans and computers has been instrumental in defining new communication models, and accordingly, new ways of interacting with machines. the use of gestures as a means of communication has been a challenging task. the latest generation of smartphones boasts powerful processors and built-in video cameras, making them capable of executing complex and computationally demanding applications. thus, the integration of gesture recognition systems in smartphone applications might be a close reality. in this paper, we present studies of a gesture recognition prototype system for smartphones. we use a number of tasks typically employed in gesture recognition systems which permit to assess the current feasibility of smartphones to implement this kind of systems. based on both the execution time and classification performance, we conclude that the latest smartphone generation is capable of executing complex image processing applications, with the most penalizing factor being camera performance regarding capture rates with the current j2me support.
link-based event detection in email communication networks. people's email communications can be modeled as graphs with vertices representing email accounts and edges representing email communications. email communication data usually comes in as continuous data stream. event detection aims to identify abnormal email communications that serve as analogs of real-world events imposed upon the data stream. the goal is to understand the communications behaviors of the subjects. the contents of emails are often not available or protected by privacy, which makes linkage information the only resource we can rely on. we propose a link-based event detection method that clusters vertices with similar communication patterns together and then, considers deviations from each vertex's individual profile, as well as its cluster profile. experiments show that this method performs well on both enron and our own email datasets.
fast mode decision for scalable video coding based on neighboring macroblock analysis. in this paper, we propose a fast mode decision for b frame in svc. it makes use of the mode distribution correlation between current mb and neighbor mbs. experimental results show that the proposed schemes save up to 57.8% of encoding time with a negligible coding loss and bit-rate increase.
interlaced euler scheme for stiff systems of stochastic differential equations. in deterministic as well as stochastic models, stiff systems, i.e., systems with vastly different time scales where the fast scales are stable, are very common. it is well known that the implicit euler method is well suited for stiff deterministic equations (modeled by odes) while the explicit euler is not. in particular, once the fast transients are over, the implicit euler allows for the choice of time steps comparable to the slowest time scales of the system. in stochastic systems (modeled by sdes) the picture is more complex. while the implicit euler has better stability properties over the explicit euler, it underestimates the stationary variance. in general, one may not expect any method to work successfully by taking time steps of the order of the slowest time scale. we explore the idea of interlacing large implicit euler steps with a sequence of small explicit euler steps. in particular, we present our study of a linear test system of sdes and demonstrate that such interlacing could effectively deal with stiffness. we also discuss the uniform convergence of mean and variance.