waashk/dblp huggingface dataset:
global intrusion detection and tolerance in networked systems. this paper presents an architecture for a global intrusion detection and tolerance such as global detection, global correlation, and intrusion tolerance. global intrusion detection and tolerance system (gidts). the cooperation proposed by the gidts solution allows the detection of complex attacks at their early stages. this cooperation is performed based on the output of several detection components located at different levels (wire network, wireless network, host, and disk). in addition, major detection and tolerance capabilities are protected against intruders attempts since they are performed by compromise independent components, located at the disk level. the gidts components implement different functions based on formal models proposed in this paper including, especially, alert correlation, storage requests, and tolerance strategy models. to enhance detection and tolerance capabilities, each gidts is assumed to cooperate with any other gidtss via a neighbor identification protocol. to illustrate gidts behavior, we propose an environment that integrates the flight management system, which represents a distributed application.
variadic templates for c++. generic functions and classes accepting a variable number of type arguments have proven to be a very useful, but missing, feature of c++. numerous foundational libraries rely on clever template and preprocessor tricks to emulate such variadic templates. by several measures these emulations are inadequate. this paper describes how c++ can be extended with variadic templates, significantly improving existing implementations of widely used c++ libraries in terms of code size, quality of error diagnostics, compilation speed, and generality. furthermore, variadic templates enable new applications, such as type-safe implementations of functions like printf, and improved support for generic mixin classes. we have implemented variadic templates as an extension of a production quality c++ compiler.
a hypermap framework for computer-aided proofs in surface subdivisions: genus theorem and euler's formula. this paper presents a new framework to conduct formal proofs concerning the topology of surface subdivisions. the subdivisions are modeled by hypermaps specified through the calculus of inductive constructions. proofs are computer-aided using the coq system. a significant example is emphasized: the proof of the genus theorem and of the euler formula for hypermaps.
verification of web service descriptions using graph-based traversal algorithms. service discovery and composition techniques require a careful and accurate specification of the functional and behavioural descriptions of services. otherwise, the located services may not provide the requested functionality and composite services may incorporate services that are incompatible and uncomposable. this paper proposes two formalisms for accurately specifying functional and behavioural descriptions and a technique for detecting errors in the specifications. unlike existing frameworks, functional descriptions created with the proposed formalism enable the purpose of a service, and the data transformations and state transitions performed by it to be modelled together. the behavioural description formalism is capable of accurately representing the effects of interactions and the temporal relationships between them. the technique is developed by extending a pre-order depth-first search algorithm, which traverses through the interaction protocol of a service and determines whether the valid terminal state of the service can be derived from its initial state. a sample case study in which we detect errors in the functional and behavioural descriptions of a service by verifying them using the proposed technique is provided.
use of hardware z-buffered rasterization to accelerate ray tracing. ray tracing is a rendering technique for producing realistic 3d computer graphics. compared to traditional scan-line rendering which is generally adopted by graphics pipeline, ray tracing can simulate more realistic global illumination, however, with the cost of expensive computation. in this paper, we implement a ray tracer that combines advantages of both rendering schemes: efficiency of scan-line rendering and reality of ray tracing. we first use hardware-accelerated rasterization with z-buffer to quickly determine the first ray-triangle hit of eye rays on the gpu. secondary rays such as reflective and shadow rays are then traced to generate global illumination on the cpu with a bounding volume hierarchy (bvh) which plays the role of our acceleration structure. the experiments show that rasterization is much more efficient in finding the first hit and can completely replace the traditional ray casting procedure.
reconfigurable split data caches: a novel scheme for embedded systems. this paper shows that even very small reconfigurable data caches, when split to serve data streams exhibiting temporal and spatial localities, can improve performance of embedded applications without consuming excessive silicon real estate or power. it also shows that neither higher set-associativities nor large block sizes are necessary with reconfigurable split cache organizations. we use benchmark programs from the mibench suite to show that our cache organization outperforms an 8k unified data cache in terms of miss rates, access times, energy consumption and silicon area. finally we show how the saved area can be utilized for supporting techniques for improving performance of embedded systems. our design enables the cache to be divided into multiple partitions that can be used for different processor activities other than conventional caching. in this paper we have evaluated one of those options to support "prefetching".
using software product lines to manage model families in model-driven engineering. the relationship between software product lines (spl) and model-driven engineering (mde) is not new in the literature. it mainly focuses on the use of domain-specific languages to specify application families, rather than using the more classic feature models. however, more recent works propose another important synergy: the use of feature models to specify model families. in this paper we propose a domain-specific transformation language (dstl) that helps in the creation of spls to manage model families. moreover, we show the benefits coming from taking a new approach to dstl development. in this approach, dstl instances are not compiled into source code but transformed onto general-purpose transformation languages in order to be executed using already existent transformation engines.
three-dimensional segmentation of brain tissues using markov random fields and genetic algorithms. this work addresses the segmentation of brain tissue in mr images by means of markov random fields and genetic algorithms. a genetic algorithm is employed to estimate initial parameters, aiming at improving the segmentation process. the results of the segmentation process also make it possible to classify structures and determine new parameters, which are useful in the creation of three dimension images of the brain.
memory-efficient content filtering hardware for high-speed intrusion detection systems. content filtering-based intrusion detection systems have been widely deployed in enterprise networks, and have become a standard measure to protect networks and network users from cyber attacks. although several solutions have been proposed recently, finding an efficient solution is considered as a difficult problem due to the limitations in resources such as a small memory size, as well as the growing link speed. in this paper, we present a novel content filtering technique called table-driven bottom-up tree (tbt), which was designed i) to fully exploit hardware parallelism to achieve real-time packet inspection, ii) to require a small memory for storing signatures, iii) to be flexible in modifying the signature database, and iv) to support complex signature representation such as regular expressions. we configured tbt considering the hardware specifications and limitations, and implemented it using a fpga. simulation based performance evaluations showed that the proposed technique used only 350 kilobytes of memory for storing the latest version of snort rule consisting of 2770 signatures. in addition, unlike many other hardware-based solutions, modification to signature database does not require hardware re-compilation in tbt.
implementing a practical declarative logic-based model transformation engine. declarative approaches to specifying model-model transformation are an attractive approach because they can offer implicit source model traversal, automatic traceability management, implicit target object creation, and implicit rule ordering. however, when proposing such a declarative logic-based transformation language, there are two common objections. one is programmer unfamiliarity with declarative style, and the other is that of perceived performance problems. in this paper we address these issues, discussing the design of specific features of the tefkat transformation engine intended to facilitate writing and debugging declarative transformation specifications, and describing important implementation techniques used to avoid performance problems.
continuation-passing enactment of distributed recoverable workflows. scalability, reliability and adaptability are among the key requirements for the enactment of distributed workflows. in addition, system resources should be efficiently utilized. central workflow engines and static workflow instantiation are some of the important obstacles to meeting these requirements. we propose a fully decentralized approach to workflow enactment that is not subject to these obstacles. in addition, it supports automatic recovery. the approach is of continuation-passing style, where continuations, or the reminder of the executions, are passed along with asynchronous messages for workflow enactment. two continuations are associated to an execution: a success continuation and a failure continuation. recovery plans for workflows are automatically generated and included in failure continuations at runtime. a prototype is implemented.
modeling deceptive information dissemination using a holistic approach. this research studies deceptive information dissemination based on the information flow network and the web of trust. we present an information dissemination model that illustrates the prerequisite for information propagation based on the subject and object trusts. to evaluate the spread of deceptive data accurately, we offer two quantitative models that are utilized to calculate the degree to which the subjects in the information flow network are affected. the algorithms for evaluating information dissemination for these two models are provided and the time complexities of the algorithms are also analyzed. our experiments illustrate the characteristics of the web of trust that affect the dissemination of the deceptive information.
semantically enhanced user modeling. content-based implicit user modeling techniques usually employ a traditional term vector as a representation of the user's interest. however, due to the problem of dimensionality in the vector space model, a simple term vector is not a sufficient representation of the user model as it ignores the semantic relations between terms. in this paper, we present a novel method to enhance a traditional term-based user model with wordnet-based semantic similarity techniques. to achieve this, we use word definitions and relationship hierarchies in wordnet to perform word sense disambiguation and employ domain-specific concepts as category labels for the derived user models. we tested our method on windows to the universe, a public educational website covering subjects in the earth and space sciences, and performed an evaluation of our semantically enhanced user models against human judgment. our approach is distinguishable from existing work because we automatically narrow down the set of domain specific concepts from initial domain concepts obtained from wikipedia and because we automatically create semantically enhanced user models.
an implementation and performance analysis of slave-side arbitration schemes for the ml-ahb busmatrix. the slave-side arbitration is different from the master-side arbitration based on the request and grant signals. the slave-side arbitration uses the response signals of slave for arbitration. also, the arbitration overhead of the slave-side arbitration is 10% smaller than that of the master-side arbitration. in this paper, we implement and analyze the slave-side arbitration schemes for the ml-ahb busmatrix. we implemented the ml-ahb busmatrixes with fixed priority, round robin and dynamic priority arbitration schemes. our busmatrix implementation particularly reduces area and clock period by 17% and 19% respectively, compared with those of busmatrix of arm by virtue of the masking mechanism. with the performance simulations, we observed that when there are few masters with long job length in a bus system, the dynamic priority based arbitration shows the maximum performance and in other cases the arbitration based on round robin shows the highest performance. in addition, the arbitration scheme with transaction based multiplexing shows higher performance than the same arbitration scheme with single transfer based switching in an application with frequent accesses to the long latency devices or memories such as sdram. the improvements of the arbitration scheme with transaction based multiplexing are 26%, 42% and 51%, respectively when the latency times of sdram are 1, 2 and 3 clock cycles.
querying and browsing xml and relational data sources. a lightweight method for querying and browsing multiple relational and xml data sources is presented. the approach is based on a simple abstraction of relational and xml data models. a query language for the abstraction to which xpath and sql map to naturally is introduced. a unique feature of the query language is that it unifies structured queries and keyword-based searches.
an adaptive randomized search protocol in peer-to-peer systems. search problem, which is to identify the peer that has a target resource object, is an important problem in peer-to-peer (p2p) file sharing systems. since p2p systems maintain large and dynamic sets of peers, the search protocol is desired to be scalable and adaptive. in this paper we propose a new p2p search protocol, called adaptive randomized search protocol (arsp), which is an efficient extension of the quorum-based protocol for searching objects in peer-to-peer networks. arsp minimizes the communication cost of the protocol by popularity-based index dissemination of objects. the protocol works in a self-adaptive manner: it automatically adapts to the dynamics of network environments.
eigen-distribution on assignments for game trees with random properties. in this paper, we investigate a special distribution, called eigen-distribution, on assignments for game tree tk2 with random properties. there are two cases, where the assignments to leaves are independently distributed (id) and correlated distributed (cd). in id setting, we prove that the distributional probability ϱ belongs to [equation] and ϱ is a strictly increasing function on rounds [equation]. in cd setting, we propose a reverse assigning technique (rat) to form 1-set and 0-set, then show that e1-distribution (namely, a particular distribution on assignments of 1-set such that the complexity of any deterministic algorithm is equal) is the unique eigen-distribution.
modeling web service composition and execution via a requirements-driven approach. the increasing popularity of web services for application integration has strengthened the need for automated web service composition and joint execution. a lot of attention has been paid recently towards techniques for creating a composite web service from individual web services based on user requirements, and driven by a variety of criteria. however, the major lacuna so far in web service composition is the lack of a holistic requirements-driven approach for modeling the web service execution lifecycle. in this paper we present such an approach based on our earlier work on context-driven web service modeling. in particular, we separate requirements into two parts - functional and extrafunctional requirements (frs and efrs, respectively). we express frs as commitments made by individual web ser-vices towards the composite web service, and efrs as rules that constrain the behavior of the individual web services while they execute against their frs. we also present a conceptual model that can be used for tracking requirements during web service execution.
stigmergic optimization in dynamic binary landscapes. hereafter we introduce a novel algorithm for optimization in dynamic binary landscapes. the binary ant algorithm (baa) mimics some aspects of real social insects' behavior. like ant colony optimization (aco), baa acts by building pheromone maps over a grid of possible trails that represent solutions to an optimization problem. main differences rely on the way this search space is represented and provided to the colony in order to explore/exploit it. then, by a process of pheromone reinforcement and evaporation the artificial insect trails converge to regions near the problem solution or extrema. the negative feedback granted by the evaporation mechanism provides the self-organized system with population diversity and self-adaptive characteristics, allowing baa to be particularly suitable for hard dynamic optimization problems (dop), where extrema continuously changes at severe speeds.
decentralized enforcement of security policies for distributed computational systems. the shift from single server environments to globally distributed systems presents a great challenge in terms of defining and enforcing appropriate security policies. this is, among other things, due to the fact that the actual order between events in an asynchronous distributed environments is not always defined. in addition, security policies often depend on the actual information exchange among the distributed entities. in this paper we study the problem of adapting security policies to distributed environments such as grids and mobile code systems. we define global security policy and indicate some of the difficulties in translating local policies to the distributed environment. then, we propose an efficient and scalable decentralized security mechanism for the enforcement of global stateful security policies in distributed computational systems. the mechanism is based on multiple instances of execution monitors (smart sandboxes) running on the distributed entities and on efficient security information sharing among them. we show that the subclasses of em policies enforceable by this mechanism contain useful and real live security policies such as global information flow policies.
logical and algebraic view of huzita's origami axioms with applications to computational origami. we describe huzita's origami axioms from the logical and algebraic points of view. observing that huzita's axioms are statements about the existence of certain origami constructions, we can generate basic origami constructions from those axioms. origami construction is performed by repeated application of huzita's axioms. we give the logical specification of huzita's axioms as constraints among geometric objects of origami in the language of the first-order predicate logic. the logical specification is then translated into logical combinations of algebraic forms, i.e. polynomial equalities, disequalities and inequalities, and further into polynomial ideals (if inequalities are not involved). by constraint solving, we obtain solutions that satisfy the logical specification of the origami construction problem. the solutions include fold lines along which origami paper has to be folded. the obtained solutions both in numeric and symbolic forms make origami computationally tractable for further treatments, such as visualization and automated theorem proving of the correctness of the origami construction.
cristore: dynamic storage system for heterogeneous devices in off-site ubiquitous communities. most researches for ubiquitous services have been interested in constructing intelligent environments in physical spaces such as conference hall, meeting room, home, and campus. in these spaces people are able to share data easily. however, as cooperative works from a distance make a social issue, we need a data sharing system for an "off-site" community that is a group of people with a common interest and purpose in different ubiquitous places like a remote conference/meeting. in this paper, we propose a dynamic storage system, cristore for heterogenous devices of the off-site communities, which autonomously builds a distributed shared data space and keeps a flexible overlay topology of the participant devices according to the devices' capabilities. cristore also performs file operations fitted to the capabilities.
a petri net semantics for web service choreography. many web service standards of orchestration and choreography are designed to reduce their inherent complexity of composing web services. existing standards all remain at the descriptive level, without providing any formal semantics and method for verifying important properties. web service choreography interface (wsci) describes the flow of messages exchanged by a web service which participates in choreographed interactions with other services. due to many advantages of petri nets, an extended one is used to formalize wsci in this paper. we show several nets to represent the activity, process and interface respectively. our formal model remarkably focuses on the wsci concept of message exchange and the context which describes the environment. this paper proposes some properties and introduces technique for checking them to ensure its correct deployment.
a set of schedulers for grid networks. central to grid processing is the scheduling of application tasks to resources. schedulers need to consider heterogeneous computational and communication resources, producing the shortest possible schedule under time constraints dictated by both the application needs and the frequency of fluctuation of resource availability. this paper introduces a set of schedulers with such characteristics.
sensitivity of software system reliability to usage profile changes. usage profiles are an important factor in software system reliability estimation. to assess the sensitivity of a system's reliability to changes in the usage profile, a markov based system model is used. with the help of this model, the statistical sensitivity to many independent changes can be estimated. the theory supports both absolute and relative changes and can be used for systems with or without a terminal state. with this approach it is possible to very quickly estimate the uncertainty on the predicted reliability calculated from a markov model based upon the uncertainty on the usage profile. finally the theory is applied to an example to illustrate its use and to show its validity.
projection function for driver fatigue monitoring with monocular camera. the image projection has been proven to be an effective method for extracting image features. this paper utilizes multiple facial cues extracted by the projection function for driver vigilance monitoring. to measure vigilance, we calculate two metrics: perclos and perrotat from facial state estimation. the main advantage of the presented system in contrast to existing ones is the usage of cheap equipment (only one monocular camera) to achieve a good cost-performance ratio and fast computation time.