waashk/dblp huggingface dataset:
guarding security sensitive content using confined mobile agents. mobile code and mobile agents are generally associated with security vulnerabilities, rather than with increased security. this paper describes an approach in which mobile agents are confined, in order to allow content providers to retain control over how their data is exported while allowing agents to search the full content of this data locally. this approach offers increased control and security compared to the traditional client-server technologies commonly used for building distributed systems. we describe a new system, called mansion, which implements confinement of mobile agents, and describe a number of applications of the confinement model to illustrate its potential.
transforming system operations' interactions into a design class diagram. this work reports the results of the development of a model transformation realized in kermeta. this transformation accepts a domain model and a set of communication diagrams containing the design of system operations corresponding to the same use-case. the result is a design class diagram expressing the class structure that part of a system should logically exhibit in order to enable the occurrence of the interactions specified in the communication diagrams. to that end, along with specific meta-models for input models and for the output model, an executable model for the transformation was defined. this paper reviews the elements involved in the development of this transformation, and describes the design of its structure and behavior. the transformation was applied to a case study taken from the bibliography and the results are presented and discussed.
propagating dense systems of integer linear equations. in interval propagation approaches to solving non-linear constraints over reals it is common to build stronger propagators from systems of linear equations. this, as far as we are aware, is not pursued for integer finite domain propagation. in this paper we show how we can add preconditioning gauss-seidel based propagators to an integer propagation solver. the gauss-seidel based propagators make use of interval arithmetic which is substantially slower than integer arithmetic. we show how we can build new integer propagators from the result of preconditioning that no longer require interval arithmetic to be performed. although the resulting propagators may be slightly weaker than the original gauss-seidel propagation, they are substantially faster. we show on standard integer benchmarks how these new propagators can substantially improve propagation performance, in terms of strength of propagation and speed.
ontology based annotation of text segments. this work exploits the logical structure of information rich texts to automatically annotate text segments contained within them using a domain ontology. the underlying assumption behind this work is that segments in such documents embody self contained informative units. another assumption is that segment headings coupled with a document's hierarchical structure offer informal representations of segment content; and that matching segment headings to concepts in an ontology/thesaurus can result in the creation of formal labels/meta-data for these segments. when an encountered heading can not be matched with any concepts in the ontology, the hierarchical structure of the document is used to infer where a new concept represented by this heading should be added in the ontology. so, in this work the bootstrap ontology is also enriched by new concepts encountered within input documents. this paper also presents issues/problems related to matching textual entities to concepts in an incomplete ontology. the approach presented in this paper was applied to a set of agricultural extension documents. the results of carrying out this experiment demonstrates that the proposed approach is capable of automatically annotating segments with concepts that describe a segment's content with a high degree of accuracy.
general dominant relationship analysis based on partial order models. due to the importance of skyline query in many applications, it has been attracted much attention recently. given an n-dimensional dataset d, a point p is said to dominate another point q if p is better than q in at least one dimension and equal to or better than q in the remaining dimensions. recently, li et al. [9] proposed to analyze more general dominant relationship in a business model that, users are more interested in the details of the dominant relationship in a dataset, i.e., a point p dominates how many other points. in this paper, we further generalize this problem that, users are more interested in whom these dominated points are. we show that the framework proposed in [9] can not efficiently solve this problem. we find the interrelated connection between the partial order and the dominant relationship. based on this discovery, we propose efficient algorithms to answer the general dominant relationship queries by querying the partial order representation of spatial datasets. extensive experiments illustrate the effectiveness and efficiency of our methods.
dual agreement virtual subnet protocol for mobile ad-hoc networks. the byzantine agreement (ba) plays a key role in fault-tolerant distributed system design. more existing ba protocols are designed for wired networks. in practice, wireless and mobile computing are becoming increasingly popular; the topology of network is trending wireless and provides support for mobile computing. mobile ad-hoc network (manet) is a kind of popular wireless network. the proposed protocol can make each fault-free mobile processor reach an agreement value to cope with the faulty component in the virtual subnet of manet.
a cooperative classification mechanism for search and retrieval software components. this paper presents the use of folksonomy concepts in a software component search engine as an alternative to improve the search result quality, covering from specification to implementation. a case study was performed in order to evaluate its performance and viability. additionally, a set of requirements to perform component search and retrieval with folksonomy are presented, beyond the architectural and implementation aspects that accomplishes the tool. the case study indicates the suit of different search techniques is better than using separately. the engine's current version combines keyword, facet-based and folksonomy search techniques.
a high performance nids using fpga-based regular expression matching. a network intrusion detection system (nids) monitors all incoming packets in the network and detects packets that are malicious to the internal system. the nids should also have ability to update the detection rules because new attack patterns are unpredictable. incorporating fpgas into the nids is one of the best solutions that can provide both high performance and high flexibility comparing to the other approaches such as software solutions. in this paper we propose a novel approach to design the parallel comparator of nids that can not only minimize additional resources but also maximize the processing performance. the performance and resource tradeoff due to the implementation of the parallel comparator in the prefix sharing is also analyzed.
optimizing hypergraph transversal computation with an anti-monotone constraint. finding hypergraph transversals is a major algorithmic issue having many relationships with the data mining area. by defining a new galois connection, we show how it is possible to use data mining results on pattern condensed representations and the levelwise framework to improve the hypergraph transversals computation. we present a new algorithm mtminer and experiments showing its efficiency.
virtual framework for testing the reliability of system software on embedded systems. system software development and testing on embedded systems can be quite difficult and time consuming. in this paper, we propose a cost effective method, namely virtual testing framework that can be used easily to test the reliability of system software. the framework consists of three layers; virtual platform layer, system software layer, and test environment layer. the virtual platform layer emulates a variety of embedded hardware on which any system software can be run and is used to verify its capability in handling faults injected by the test environment layer. we use the framework to verify the reliability of the file system and ftl (flash translation layer) by injecting faults that may be found in flash memory. we discuss experimental results that we gained using this framework to gather post-fault behavior of the system software of interest.
smask: preventing injection attacks in web applications by approximating automatic data/code separation. web applications employ a heterogeneous set of programming languages: the language that was used to write the application's logic and several supporting languages. supporting languages are e.g., server-side languages for data management like sql and client-side interface languages such as html and javascript. these languages are handled as string values by the application's logic. therefore, no syntactic means exists to differentiate between executable code and generic data. this circumstance is the root of most code injection vulnerabilities: attackers succeed in providing malicious data that is executed by the application as code. in this paper we introduce smask, a novel approach towards approximating data/code separation. by using string masking to persistently mark legitimate code in string values, smask is able to identify code that was injected during the processing of an http request. smask works transparently to the application and is implementable either by integration in the application server or by source-to-source translation using code instrumentation.
evaluation of interval-based dynamic voltage scaling algorithms on mobile linux system. during the last several years, dynamic voltage scaling (dvs) algorithms are being used for energy consumption on real, fully functional battery supplied devices, adjusting the clock speed and supply voltage dynamically. most dvs algorithms are investigated in interval-based and task-based strategies. task-based algorithms consider task information, especially task deadline, on deciding what speed to choose at any given time. interval-based algorithms predict the cpu speed of the upcoming interval based on observations of the cpu utilization of previous intervals, and then set the speed for that interval based on this prediction. most dvs algorithms have only been tested in simulation environments. in this paper, those interval-based dvs algorithms are modified with different parameters on different workloads, and evaluated to know which one saves the most energy while not degrading computer performance.
an effective cost model for similarity queries in metric spaces. this short paper presents an effective cost model to estimate the number of disk accesses (i/o cost) and the number of distance calculations (cpu cost) to process similarity range queries over data indexed by metric access methods.
a taxonomy of mobile and pervasive applications. in this paper we present a taxonomy for characterizing pervasive applications. this taxonomy focuses on abstracting <u>application</u> characteristics, independent of the characteristics of the middleware or infrastructure that support the application, and provides a controlled vocabulary for thinking about the application. we provide an informal verification for the taxonomy by using it to categorize a range of pervasive applications, culled from the literature and from projects we are involved in, and showing that the taxonomy is (a) <u>consistent and complete</u> - similar applications are categorized similarly and applications that are different are not similarly categorized and (b) <u>useful</u> - each characteristic provides new information about applications not explained by the other characteristics. finally, we present concrete uses for the taxonomy.
requirements for information systems model-based testing. in order to develop systems with a high level of quality and low costs it is necessary to have adequate testing tools and methods. we believe that the definition of a requirements catalog is one of the steps in such direction. this work presents a requirements catalog for information systems model-based testing that can be used as a basis for improving methods as well as a guide for the development of new methods and tools. the catalog was prepared based on the literature of the area and on the experience of several information systems developers.
mojohon: a channel-driven communication architecture for applications deployed on the internet. we present a layered architecture, named mojohon, designed to allow the communication among two or more instances of a distributed application while maintaining a high level of abstraction with respect to the communication facilities available. mojohon, which encompasses distributed modules for transmission, reception, reflection, adaptation, monitoring and configuration, has been defined so as to be used by applications to exchange control and data messages even when instances of the applications are unable to directly address each other -- for instance, when one or more instances are running behind nat. we also present a proof-of-concept multimedia application, developed using mojohon, which uses an asynchronous communication middleware for control message exchange and rtp/udp datagrams for data exchange.
tracking multiple mobile objects using ieee 802.15.4-based ultrasonic sensor devices. an ultrasound tracking system is an inexpensive and accurate technique for indoor object tracking. in this paper, we describe an ieee 802.15.4-based active tracking system that tracks multiple mobile objects effectively. we analyze the problems of the active tracking system with multiple objects and propose an adaptive beaconing algorithm as the solution. in our algorithm, mobile nodes overhear the beacon messages of other mobile nodes and adaptively adjust their beaconing periods to avoid a simultaneous ultrasound pulse. we implemented the tracking system in a real environment and measured the performance of the system. the experimental results show that our algorithm successfully works with multiple mobile nodes and improves performance on the success rate.
integration of well posedness analysis in software engineering. this paper advocates the use of well posedness analysis as a tool to use in software engineering. well posedness analysis as a problem solving tool has seen too little use, especially in computer science and software engineering. a problem is well posed if and only if: (1) at least one solution exists, (2) at most one solution exists, and (3) the solution is stable. here well posedness analysis is described as an augmentation to software engineering as an approach to improving software quality.
off-line signature verification based on forensic questioned document examination approach. there are different methods for signature verification proposed in the literature. most of them, take into account a personal model, i.e., they need a considerable number of genuine signatures of the same writer to correctly train the model. this is the main drawback of this kind of approach, since in real applications we have small number of samples available for training. in this paper we propose an off-line signature verification method based on forensic questioned document examination approach. this kind of strategy reduces any classification problem to a 2-class problem, hence, makes it possible to build robust signature verification systems even when few signatures per writer are available. comprehensive results on a database composed of 240 writers (40 samples per writer) demonstrate the efficiency of the proposed method.
a java code annotation approach for model checking software systems. many works related to the verification of software systems using model checking integrated to development environments have been proposed. jpf [7] and bandera [1] are examples of such works that abstract the model to be verified from the java code. an alternative way for jpf and bandera approaches is to provide mechanisms for describing the model during the programming task. thus, it is possible to integrate such mechanisms to the development environment and hide the model checking task from the programmer.
a mobile sensor control method for sparse sensor networks. due to the ability to construct a large-scale sensing system by the cooperative behaviors of multiple sensor nodes, sensor networks are expected to be applied to many applications such as environmental monitoring. on the other hand, with the development of robotics technology in recent years, there has been many studies on sensors with a moving function (mobile sensors). in this paper, we propose an effective mobile sensor control method for sparse sensor networks. our method uses two types of sensor nodes, fixed node and mobile node. the data acquired by nodes are accumulated on a fixed node before transferred to the sink node. in addition, our method transfers the accumulated data efficiently by constructing the communication route of multiple mobile nodes between fixed nodes. we also conducted simulation experiments to evaluate the performance of our method.
a framework and a tool for robustness testing of communicating software. robustness testing aims at verifying the acceptable behavior of a system under unexpected conditions. in this paper we propose a framework and a tool for robustness test cases generation. our framework consists of two phases: (1) construction of an increased specication by integrating hazards in the nominal specification model written in sdl. the rule of the increased specification is to specify the acceptable behavior in presence of hazards. (2) a specific method to generate robustness test cases (in ttcn-3) from the increased specification and a robustness test purpose. we also give some experimental results on the tcp protocol.
-anonymization incremental maintenance and optimization techniques. new privacy regulations together with ever increasing data availability and computational power have created a huge interest in data privacy research. one major research direction is built around k-anonymity property, which is required for the released data. although many k-anonymization algorithms exist for static data, a complete framework to cope with data evolution (a real world scenario) has not been proposed before. in this paper, we introduce algorithms for the maintenance of k-anonymized versions of large evolving datasets. these algorithms incrementally manage insert/delete/update dataset modifications. our results showed that incremental maintenance is very efficient compared with existing techniques and preserves data quality. the second main contribution of this paper is an optimization algorithm that is able to improve the quality of the solutions attained by either the non-incremental or incremental algorithms.
va-tcp: a vertical handoff-aware tcp. a vertical handoff occurs when a multi-homed mobile host roams from a network to another heterogeneous network. nevertheless, the network before and after a vertical handoff usually have drastic different characteristics. in this paper, we proposed an end-to-end based vertical-handoff aware tcp, called va-tcp, which promptly adapts tcp behavior during a vertical handoff. when entering a new network, on the basis of packet-pair algorithm, va-tcp dynamically estimates the new network bandwidth and round-trip time by using out-of-band icmp messages. after that, by the estimated bandwidth and round-trip time, va-tcp adjusts the tcp parameters including congestion window size, slow-start threshold, retransmission timer and rtts to respond to the new network environment. from the experimental result, the tcp throughput by the proposed va-tcp scheme is around 2 times that by the original tcp.
gradual transition towards autonomic software systems based on high-level communication specification. while management of today's software systems is usually performed by humans using some user interface (ui), autonomic systems would be self-managed. they would typically consist of a managed element, which provides actual system functionality, and an autonomic manager performing system management. however, truly self-managed systems are hard to achieve and not (yet) in wide-spread use. during the transition towards autonomic software systems it is more realistic to manage a large and complex software system partly by humans and partly by an autonomic manager. for facilitating this approach, the communication between the managed element and human administrators on the one hand and the communication between the managed element and the autonomic manager on the other, should be unified and specified on the same semantic level. however, there is no scientific basis for such a unified communication approach. we present a unified specification of this communication in a high-level discourse model based on insights from theories of human communication. this approach would make this communication "natural" for humans to define and to understand. in addition, we propose to use the same specification for the automated generation of user interfaces for management by human administrators. as a consequence, a smooth and gradual transition towards self-managed software systems will be facilitated, where the portion managed by human administrators becomes smaller and smaller.
a fast algorithm to binarize and filter documents with back-to-front interference. whenever one finds documents written on both sides on translucent paper there is a "back-to-front interference". the direct binarization of such documents yields unreadable documents. this paper presents a fast segmentation-based method for generating high-quality binarized images of documents with back-to-front interference. the proposed segmentation algorithm is based on the entropy of the histogram of the image.
context-aware feature-oriented modeling with an aspect extension of vdm. separation of concerns is important to reduce the complexity of software design. this paper examines a software development method starting with the feature-oriented modeling method to have vdm-based formal design. in order to overcome the problem that a feature may be scattered over the vdm design description, the notion of the aspect is adapted to propose aspect vdm. the identified features are concisely represented in aspect vdm to demonstrate modular descriptions of cross-cutting concerns in vdm.
an adaptive data prefetching scheme for biosequence database search on reconfigurable platforms. searching on dna and protein databases using sequence comparison algorithms has become one of the most powerful techniques to better understand the functionality of particular biological sequences. however, the requirements to process the biological data exceed the ability of general-purpose processor. the core of sequence alignment algorithm was implemented as fine-grained parallel architecture that was running on a commercial-off-the-shelf (cots) fpga board, where supercomputer performance has been achieved. however, reconfigurable computing platforms have utilized a pci bus as the communications channel, limiting the communication speed between the host processor and the fpga. this communication bottleneck often offsets the application speedup enabled by fpga. in this paper we present an adaptive data prefetching scheme to avoid reconfigurable coprocessor stalls due to data unavailability through profiling techniques and quantitative analysis. experimental results satisfied time constraints with various query sequences and show that we can effectively eliminate a major portion of data access penalty.