This paper describes a portable benchmark suite that assesses the ability of cluster networking hardware and software to overlap MPI communication and computation. The Communication Offload MPI-based Benchmark, or COM...
详细信息
This paper describes a portable benchmark suite that assesses the ability of cluster networking hardware and software to overlap MPI communication and computation. The Communication Offload MPI-based Benchmark, or COMB, uses two methods to characterize the ability of messages to make progress concurrently, with computational processing on the host processor(s). COMB measures the relationship between MPI communication bandwidth and host CPU availability.
A fuzzy logic based similarity measure is introduced as a criterion for the identification of structure in data. An important characteristic of the proposed approach is that cluster prototypes are formed and evaluated...
详细信息
A fuzzy logic based similarity measure is introduced as a criterion for the identification of structure in data. An important characteristic of the proposed approach is that cluster prototypes are formed and evaluated in the course of the optimization without any a-priori assumptions about the number of clusters. The intuitively straightforward compound optimization criterion of maximizing the overall similarity between data and the prototypes while minimizing the similarity between the prototypes is adopted. It is shown that the partitioning of the pattern space obtained in the course of the optimization is more intuitive than the one obtained for the standard FCM. The local properties of clusters (in terms of the ranking order of features in the multidimensional pattern space) are captured by the weight vector associated with each cluster prototype. The weight vector is then used for the construction of interpretable information granules.
In this paper we extend the work presented in our previous papers (2001) where we considered optimal control of a linear, discrete time system subject to input constraints and stochastic disturbances. Here we basicall...
详细信息
In this paper we extend the work presented in our previous papers (2001) where we considered optimal control of a linear, discrete time system subject to input constraints and stochastic disturbances. Here we basically look at the same problem but we additionally consider state constraints. We discuss several approaches for incorporating state constraints in a stochastic optimal control problem. We consider in particular a soft-constraint on the state constraints where constraint violation is punished by a hefty penalty in the cost function. Because of the stochastic nature of the problem, the penalty on the state constraint violation can not be made arbitrary high. We derive a condition on the growth of the state violation cost that has to be satisfied for the optimization problem to be solvable. This condition gives a link between the problem that we consider and the well known H/sub /spl infin// control problem.
In this paper we prove improved lower and upper bounds for the location of mobile facilities (in L∞ and L2 metrics) under the motion of clients when facility moves faster than clients. This paper continues the resear...
ISBN:
(纸本)9781475752755
In this paper we prove improved lower and upper bounds for the location of mobile facilities (in L∞ and L2 metrics) under the motion of clients when facility moves faster than clients. This paper continues the research started in our joint paper where we present lower bounds and efficient algorithms for exact and approximate maintenance of the 1-center for a set of moving points in the plane. Our algorithms are based on the kinetic framework introduced by Basch, Guibas and Hershberger.
As software agents get more sophisticated, it becomes difficult to understand and model such systems. This paper contends that all developers bring to the task of development some implicit or explicit assumptions of t...
详细信息
As software agents get more sophisticated, it becomes difficult to understand and model such systems. This paper contends that all developers bring to the task of development some implicit or explicit assumptions of the agent communication pattern. This issue is not readily addressed in current literature and represents a gap in knowledge. For this purpose, a generic pattern of inter-agent communication is introduced and discussed in this paper. For better understanding and modelling of agent-based e-commerce systems, the semiotic approach and the DEMO transaction concept are briefly introduced. It is shown that the semiotic approach offers a unifying framework for identifying the roles of agents, the responsible human agents and the right/constraints associated with each role. The DEMO transaction concept is applied to model the communicative interaction between agents.
Deals with a study which discussed the mechanical behaviour for subdivided periodic elastic structures of composite materials, from the viewpoint of macro- and meso-scale coupling. Multiscale asymptotic expansion and ...
详细信息
Deals with a study which discussed the mechanical behaviour for subdivided periodic elastic structures of composite materials, from the viewpoint of macro- and meso-scale coupling. Multiscale asymptotic expansion and truncation error estimates; Discussion on multiscale finite element method; Details of higher order difference quotients and total error estimates; Numerical experiments.
In this paper we propose a new approach to address the ramification problem in common-sense reasoning about action and change. We contrast the methods of McCain and Turner [6], Thielscher [10] and Sandewall [8] and, b...
详细信息
Walsham (2000) urged Information systems researchers to truly cover all levels of analysis from the individual to the societal in their research agenda. In this paper, we accept his challenge by proposing a research f...
详细信息
Validated methods for initial value problems for ordinary differential equations produce bounds that are guaranteed to contain the true solution of a problem. When computing such bounds, these methods verify that a un...
详细信息
Validated methods for initial value problems for ordinary differential equations produce bounds that are guaranteed to contain the true solution of a problem. When computing such bounds, these methods verify that a unique solution to the problem exists in the interval of integration and compute a priori bounds for the solution in this interval. A major difficulty in this verification phase is how to take as large a stepsize as possible, subject to some tolerance requirement. We propose a high-order enclosure method for proving existence and uniqueness of the solution and computing a priori bounds.
One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this work, the problem of scheduling using wavefront predictio...
详细信息
ISBN:
(纸本)0769511538
One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this work, the problem of scheduling using wavefront prediction is presented. The geometric concepts of time instance subspaces and execution pattern are introduced. A quite simple and low complexity scheduling algorithm is presented. The index space is split into geometric subspaces and any point can be located in them. Each point is then scheduled according to the subspace where it belongs.
暂无评论