Data poisoning attacks, where adversaries manipulate training data to degrade model performance, are an emerging threat as machine learning becomes widely deployed in sensitive applications. This paper provides a comp...
详细信息
This paper presents a new approach to predict the quality of polypropylene in petrochemical plants. The proposed approach constructs four different models, based on a large number of data collected from a renowned pet...
详细信息
The author presents a paradigm and system that will support a programmer who is designing, programming, and testing a distributed application. The main point is that the structure introduced by the paradigm must be ke...
详细信息
ISBN:
(纸本)0897912586
The author presents a paradigm and system that will support a programmer who is designing, programming, and testing a distributed application. The main point is that the structure introduced by the paradigm must be kept and used during design, programming, and testing. One is not helped by a programming method which introduces a structure just to break it down again. A structural model has been developed which is based on common structures in distributed systems. This model is used to describe the logical relationships between components in a system. It is also integrated into the programming environment.< >
The use of low- and no-code modeling tools is today an established way in practice to give non- programmers an opportunity to master their digital challenges independently, using the means of model- driven software de...
详细信息
Various existing optimization and memory consistency management techniques for GPU applications rely on memory access patterns of kernels. However, they suffer from poor practicality because they require explicit user...
详细信息
The programming language Prolog allows succinct representation of a wide variety of scheduling problems. To speed up execution, a new version called CHIP (Constraint Handling In Prolog) was introduced that maintains t...
详细信息
The programming language Prolog allows succinct representation of a wide variety of scheduling problems. To speed up execution, a new version called CHIP (Constraint Handling In Prolog) was introduced that maintains the programming advantages of Prolog. CHIP achieves its speed by keeping track of the sets of possible values for each variable. In this way, a search can be abandoned as soon as any such set becomes empty. This mechanism is made part of the unification algorithm. CHIP maintains the conventional orientation of logic towards single values. Thus, an awkward theoretical structure results from interfacing with set orientation in unification. This problem is solved by using a set-orientation for the entire logic.< >
In large projects parallelization of existing programs or refactoring of source code is time consuming as well as error-prone and would benefit from tool support. However, existing automatic transformation systems are...
详细信息
In large projects parallelization of existing programs or refactoring of source code is time consuming as well as error-prone and would benefit from tool support. However, existing automatic transformation systems are not extensively used because they either require tedious definitions of source code transformations or they lack general adaptability. In our approach, a programmer changes code inside a project, resulting in before and after source code versions. The difference (the generated transformation) is stored in a database. When presented with some arbitrary code, our tool mines the database to determine which of the generalized transformations possibly apply. Our system is different from a pure compiler based (semantics preserving) approach as we only suggest code modifications. Our contribution is a set of generalizing annotations that we have found by analyzing recurring patterns in open source projects. We show the usability of our system and the annotations by finding matches and applying generated transformations in real-world applications.
The problem that a robot navigates autonomously through its environment, builds its own map and localizes itself in the map (known a the SLAM problem), is still an open problem. Most of the approaches to solve the SLA...
详细信息
For scientists, it is advantageous to use a high level of abstraction for programming their simulations, so that they can focus on the problem at hand instead of struggling with low-level details. However, current HPC...
详细信息
ISBN:
(纸本)9781467362399
For scientists, it is advantageous to use a high level of abstraction for programming their simulations, so that they can focus on the problem at hand instead of struggling with low-level details. However, current HPC clusters with multiple GPUs per node only offer explicit communication to and from the GPUs, require manual work to keep the data consistent, and often need explicit kernel programming. Moreover, known GPU programming frameworks are limited to a single GPU or a single machine and also rarely support objects. Our system removes the above restrictions. With a slight but necessary change in Java's semantics, we achieve automatic distribution and efficient use of objects and arrays of objects on multiple GPUs in a cluster. On benchmarks that distribute arrays of objects over five machines with 10 GPUs, we achieve speedups of up to 4.9 compared to one node.
In this paper, we consider the synchronous composition of Finite State Machines (FSMs) that corresponds to instantaneous communication of hardware components. Such FSMs can be deterministic or nondeterministic, partia...
详细信息
ISBN:
(纸本)9781728160627
In this paper, we consider the synchronous composition of Finite State Machines (FSMs) that corresponds to instantaneous communication of hardware components. Such FSMs can be deterministic or nondeterministic, partial or complete. We first extend the existing synchronous composition operator from a pair of components to a collection of components with multiple input and output ports, and provide a procedure to compute the composition working directly on the collection of transition tables of the component FSMs. Then, based on the notion of input-output Moore pair (the output is not sensitive to the input), we prove the following sufficient condition: if the composition has the property that every cycle of ports has a component with a Moore pair, then the class of quasi-complete and quasi-deterministic FSMs is closed under the proposed synchronous composition.
暂无评论