Search results for "Computation"
showing 10 items of 7362 documents
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
Functional design of power-split CVTs: An uncoupled hierarchical optimized model
2017
Abstract This paper provides a new model for the preliminary design of compound power-split CVTs. Unlike the existing models, the presented method allows the engineers to prioritize functionality and efficiency of the transmission, while delaying the choice of the involved gear sets’ layout as long as possible. The design approach follows a specific priority order, and each step deals with one particular issue, without mutual interference. A smart design-chart eases the assessment and the comparison of the only eligible alternatives, and eventually leads to a final feasible constructive scheme, which can be an excellent concept for further optimization and implementation. Moreover, the mode…
Fast narrowing-driven partial evaluation for inductively sequential programs
2005
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good results on small programs, it does not scale up well to realistic problems (e.g., interpreter specialization). In this work, we introduce a faster partial evaluation scheme by ensuring the termination of the process offline . For this purpose, we first characterize a class of programs which are quasi-terminating , i.e., the computations performed with needed narrowing—the symbolic computation mechanism of narrowing-driven partial evaluation—only contain finitely many different terms (and, thus, partial evaluation termi…
A Learning Automata Based Solution to Service Selection in Stochastic Environments
2010
Published version of a paper published in the book: Trends in Applied Intelligent Systems. Also available on SpringerLink: http://dx.doi.org/10.1007/978-3-642-13033-5_22 With the abundance of services available in today’s world, identifying those of high quality is becoming increasingly difficult. Reputation systems can offer generic recommendations by aggregating user provided opinions about service quality, however, are prone to ballot stuffing and badmouthing . In general, unfair ratings may degrade the trustworthiness of reputation systems, and changes in service quality over time render previous ratings unreliable. In this paper, we provide a novel solution to the above problems based …
An Anonymous Delegatable Attribute-based Credential Scheme for a Collaborative E-health Environment
2019
We propose an efficient anonymous, attribute-based credential scheme capable of provisioning multi-level credential delegations. It is integrated with a mechanism to revoke the anonymity of credentials for resolving access disputes and making users accountable for their actions. The proposed scheme has a lower end-user computational complexity in comparison to existing credential schemes with delegatability and has a comparable level of performance with the credential standards of U-Prove and Idemix. Furthermore, we demonstrate how the proposed scheme can be applied to a collaborative e-health environment to provide its users with the necessary anonymous access with delegation capabilities.
The PCHIP subdivision scheme
2016
In this paper we propose and analyze a nonlinear subdivision scheme based on the monotononicity-preserving third order Hermite-type interpolatory technique implemented in the PCHIP package in Matlab. We prove the convergence and the stability of the PCHIP nonlinear subdivision process by employing a novel technique based on the study of the generalized Jacobian of the first difference scheme. MTM2011-22741
“Anti-Bayesian” flat and hierarchical clustering using symmetric quantiloids
2017
A myriad of works has been published for achieving data clustering based on the Bayesian paradigm, where the clustering sometimes resorts to Naive-Bayes decisions. Within the domain of clustering, the Bayesian principle corresponds to assigning the unlabelled samples to the cluster whose mean (or centroid) is the closest. Recently, Oommen and his co-authors have proposed a novel, counter-intuitive and pioneering PR scheme that is radically opposed to the Bayesian principle. The rational for this paradigm, referred to as the “Anti-Bayesian” (AB) paradigm, involves classification based on the non-central quantiles of the distributions. The first-reported work to achieve clustering using the A…
Algorithmic differentiation for cloud schemes (IFS Cy43r3) using CoDiPack (v1.8.1)
2019
Abstract. Numerical models in atmospheric sciences not only need to approximate the flow equations on a suitable computational grid, they also need to include subgrid effects of many non-resolved physical processes. Among others, the formation and evolution of cloud particles is an example of such subgrid processes. Moreover, to date there is no universal mathematical description of a cloud, hence many cloud schemes have been proposed and these schemes typically contain several uncertain parameters. In this study, we propose the use of algorithmic differentiation (AD) as a method to identify parameters within the cloud scheme, to which the output of the cloud scheme is most sensitive. We il…
A Forecasting Support System Based on Exponential Smoothing
2010
This chapter presents a forecasting support system based on the exponential smoothing scheme to forecast time-series data. Exponential smoothing methods are simple to apply, which facilitates computation and considerably reduces data storage requirements. Consequently, they are widely used as forecasting techniques in inventory systems and business planning. After selecting the most adequate model to replicate patterns of the time series under study, the system provides accurate forecasts which can play decisive roles in organizational planning, budgeting and performance monitoring.
Iterative moment method for electromagnetic transients in grounding systems on CRAY T3D
1996
In this paper the parallel aspects of an electromagnetic model for transients in grounding systems based on an iterative scheme are investigated in a multiprocessor environment. A coarse and fine grain parallel solutions have been developed on the CRAY T3D, housed at CINECA, equipped with 64 processors working in space sharing modality. The performances of the two parallel approaches implemented according to the work sharing parallel paradigm have been evaluated for different problem sizes employing variable number of processors.