This paper presents an overview of the Scale Saliency algorithm introduced in (Kadir and Brady, 2001). Scale Saliency is a novel method for measuring the saliency of image regions and selecting optimal scales for thei...
This paper presents an overview of the Scale Saliency algorithm introduced in (Kadir and Brady, 2001). Scale Saliency is a novel method for measuring the saliency of image regions and selecting optimal scales for their analysis. The model underlying the algorithm deems image regions salient if they are simultaneously unpredictable in some feature-space and over scale. The algorithm possesses a number of attractive properties: invariance to planar rotation, scaling, intensity shifts and translation; robustness to noise, changes in viewpoint, and intensity scalings. Moreover, the approach offers a more general model of feature saliency compared with conventional ones, such as those based on kernel convolution, for example wavelet analysis, since such techniques define saliency and scale only with respect to a particular set of basis morphologies. Finally, we present a generalised version of the original algorithm which is invariant to affine transformations.
A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. A number of type flaw attacks have appeared in the...
A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. A number of type flaw attacks have appeared in the academic literature. In this paper we prove that type flaw attacks can be prevented using a simple technique of tagging each field with some information indicating its intended type.
An extension to the existing bulk synchronous parallel time warp (BSP-TW) dynamic load-balancing algorithms was presented. The algorithm allowed the management to work without interruption from external workload. Expe...
详细信息
An extension to the existing bulk synchronous parallel time warp (BSP-TW) dynamic load-balancing algorithms was presented. The algorithm allowed the management to work without interruption from external workload. Experiments results on a manufacturing simulation model showed that significance performance improvement could be achieved with external workload management.
In this paper we show how quantitative program logic (Morgan et al., ACM Trans. programming Languages Systems 18 (1996) 325) provides a formal framework in which to promote standard techniques of program analysis to a...
详细信息
This paper describes an extension to the existing BSP Time Warp (Bulk Synchronous Parallel Time Warp) dynamic load-balancing algorithm to allow the management of interruption from external workload. Experiments carrie...
详细信息
This paper describes an extension to the existing BSP Time Warp (Bulk Synchronous Parallel Time Warp) dynamic load-balancing algorithm to allow the management of interruption from external workload. Experiments carried out on a manufacturing simulation model using different partition strategies with and without interruption from external workload show that significant performance improvement can be achieved with external workload management.
The performance of a parallel simulation system depends very much on partitioning simulation workload evenly among the set of processors in the computing environment to ensure load-balance between processors. Most par...
详细信息
The performance of a parallel simulation system depends very much on partitioning simulation workload evenly among the set of processors in the computing environment to ensure load-balance between processors. Most parallel simulation systems employ user-defined static partitioning. However static partitioning requires in-depth domain knowledge of the specific simulation model in the study. It is not effective if the workload of a simulation model could not be quantified accurately or changes over time during a simulation run. Dynamic load-balancing allows the simulation system to automatically balance the workload of different simulation models without user's input. In this paper the use of dynamic load-balancing in the context of the BSP Time Warp optimistic protocol is examined. Based on the BSP cost model, a dynamic load-balancing algorithm for the BSP Time Warp protocol is developed. Using different simulation models, the paper shows that to achieve consistent performance, the dynamic load-balancing algorithm for BSP Time Warp needs to consider both computation and communication workload, as well as lookaheads between processors.
This paper introduces a calculus of weakest specification for supporting reuse of established components in deriving a design (in the sense of formal methods). The weakest specifunction generalizes the notions of weak...
详细信息
This paper introduces a calculus of weakest specification for supporting reuse of established components in deriving a design (in the sense of formal methods). The weakest specifunction generalizes the notions of weakest pre-specification and weakest parallel environment;but instead of calculating the weakest required component of a target specification, it calculates the weakest specification function whose value refines the target when applied to an established component. In particular it overcomes the restriction of those other calculi to taking merely one required component at a time. The theory of specifunctions is applied to a new weakest-design calculus in the context of BSP. The calculus is based on the par-seq specifunction which involves two required components: it places one established component in parallel with one required component and the result in sequence with another required component to meet a given specification. A calculus is provided for the par-seq specifunction and it is applied to the derivation of a distributed BSP algorithm for greatest common divisor.
This paper discusses the problem of risk in optimistic simulation protocols, using as example simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augmented...
ISBN:
(纸本)9780769511047
This paper discusses the problem of risk in optimistic simulation protocols, using as example simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augmented to detect model inconsistency errors resulting from risky optimistic simulation. While the model runs sequentially without consistency errors, errors occur when the model is executed in parallel optimistically. Some of the errors entirely violate the fundamental mutual exclusion properties of the model itself. To address this problem we extend the optimistic simulation library to eliminate these inconsistencies. We discuss the details of these extensions and the performance trade-off for adding them.
This paper discusses the problem of risk in optimistic simulation protocols, using as an example, simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augme...
详细信息
ISBN:
(纸本)076951104X
This paper discusses the problem of risk in optimistic simulation protocols, using as an example, simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augmented to detect model inconsistency errors resulting from risky optimistic simulation. While the model runs sequentially without consistency errors, errors occur when the model is executed in parallel optimistically. Some of the errors entirely violate the fundamental mutual exclusion properties of the model itself. To address this problem, we extend the optimistic simulation library to eliminate these inconsistencies. We discuss the details of these extensions and the performance tradeoff for adding them.
'Almost-certain eventualities' are liveness properties that hold with probability 1. 'Abstract probabilities' are probabilities in transition systems about which we know only that they are neither 0 no...
详细信息
暂无评论