Log in

Relevant bibliographies by topics / Guaranteed computations / Journal articles

To see the other types of publications on this topic, follow the link: Guaranteed computations.

Journal articles on the topic 'Guaranteed computations'

Author: Grafiati

Published: 1 February 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Guaranteed computations.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

YANG, ZHONGHUA, CHENGZHENG SUN, YUAN MIAO, ABDUL SATTAR, and YANYAN YANG. "GUARANTEED MUTUALLY CONSISTENT CHECKPOINTING IN DISTRIBUTED COMPUTATIONS." International Journal of Foundations of Computer Science 11, no. 01 (2000): 153–66. http://dx.doi.org/10.1142/s0129054100000089.

Full text

Abstract:

In this paper, we explore the isomorphism between vector time and causality to characterize consistency of a set of checkpoints in a distributed computing. A necessary and sufficient condition, to determine if a set of local checkpoints can form a consistent global checkpoint, is presented and proved using the isomorphic power of vector time and causality. To the best of our knowledge, this is the first attempt to use the isomorphism for this purpose. This condition leads to a simple and straightforward algorithm for a guaranteed mutually consistent global checkpointing. In our approach, a pro

APA, Harvard, Vancouver, ISO, and other styles

2

YONG, XIE, and HSU WEN-JING. "ALIGNED MULTITHREADED COMPUTATIONS AND THEIR SCHEDULING WITH PERFORMANCE GUARANTEES." Parallel Processing Letters 13, no. 03 (2003): 353–64. http://dx.doi.org/10.1142/s0129626403001331.

Full text

Abstract:

This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for a single processor execution. Earlier research in the Cilk project proposed the "strict" computational model, in which every dependency goes from a thread x only to one of x's ancestor threads, and guaranteed both linear speedup and linear expansion of space. However, Cilk threads are stateless, and the task graph that Cilk language expresses is series-parallel graph, which is a proper subset of arbitrary task graph.

APA, Harvard, Vancouver, ISO, and other styles

3

Evstigneev, Nikolay M., and Oleg I. Ryabkov. "Reduction in Degrees of Freedom for Large-Scale Nonlinear Systems in Computer-Assisted Proofs." Mathematics 11, no. 20 (2023): 4336. http://dx.doi.org/10.3390/math11204336.

Full text

Abstract:

In many physical systems, it is important to know the exact trajectory of a solution. Relevant applications include celestial mechanics, fluid mechanics, robotics, etc. For cases where analytical methods cannot be applied, one can use computer-assisted proofs or rigorous computations. One can obtain a guaranteed bound for the solution trajectory in the phase space. The application of rigorous computations poses few problems for low-dimensional systems of ordinary differential equations (ODEs) but is a challenging problem for large-scale systems, for example, systems of ODEs obtained from the d

APA, Harvard, Vancouver, ISO, and other styles

4

Ainsworth, Mark, and Richard Rankin. "Guaranteed computable bounds on quantities of interest in finite element computations." International Journal for Numerical Methods in Engineering 89, no. 13 (2012): 1605–34. http://dx.doi.org/10.1002/nme.3276.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Xie, Dawei, Haining Yang, Jing Qin, and Jixin Ma. "Privacy-Preserving and Publicly Verifiable Protocol for Outsourcing Polynomials Evaluation to a Malicious Cloud." International Journal of Digital Crime and Forensics 11, no. 4 (2019): 14–27. http://dx.doi.org/10.4018/ijdcf.2019100102.

Full text

Abstract:

As cloud computing provides affordable and scalable computational resources, delegating heavy computing tasks to the cloud service providers is appealing to individuals and companies. Among different types of specific computations, the polynomial evaluation is an important one due to its wide usage in engineering and scientific fields. Cloud service providers may not be trusted, thus, the validity and the privacy of such computation should be guaranteed. In this article, the authors present a protocol for publicly verifiable delegations of high degree polynomials. Compared with the existing so

APA, Harvard, Vancouver, ISO, and other styles

6

LÊ, DINH, and D. STOTT PARKER. "Using randomization to make recursive matrix algorithms practical." Journal of Functional Programming 9, no. 6 (1999): 605–24. http://dx.doi.org/10.1017/s0956796899003470.

Full text

Abstract:

Recursive block decomposition algorithms (also known as quadtree algorithms when the blocks are all square) have been proposed to solve well-known problems such as matrix addition, multiplication, inversion, determinant computation, block LDU decomposition and Cholesky and QR factorization. Until now, such algorithms have been seen as impractical, since they require leading submatrices of the input matrix to be invertible (which is rarely guaranteed). We show how to randomize an input matrix to guarantee that submatrices meet these requirements, and to make recursive block decomposition method

APA, Harvard, Vancouver, ISO, and other styles

7

Ghoniem, Nasr M. "Curved Parametric Segments for the Stress Field of 3-D Dislocation Loops." Journal of Engineering Materials and Technology 121, no. 2 (1999): 136–42. http://dx.doi.org/10.1115/1.2812358.

Full text

Abstract:

Under applied mechanical forces, strong mutual interaction or other thermodynamic forces, dislocation shapes become highly curved. We present here a new method for accurate computations of self and mutual interactions between dislocation loops. In this method, dislocation loops of arbitrary shapes are segmented with appropriate parametric equations representing the dislocation line vector. Field equations of infinitesimal linear elasticity are developed on the basis of isotropic elastic Green’s tensor functions. The accuracy and computational speed of the method are illustrated by computing th

APA, Harvard, Vancouver, ISO, and other styles

8

Bertrand, Fleurianne, Marcel Moldenhauer, and Gerhard Starke. "A Posteriori Error Estimation for Planar Linear Elasticity by Stress Reconstruction." Computational Methods in Applied Mathematics 19, no. 3 (2019): 663–79. http://dx.doi.org/10.1515/cmam-2018-0004.

Full text

Abstract:

AbstractThe nonconforming triangular piecewise quadratic finite element space by Fortin and Soulie can be used for the displacement approximation and its combination with discontinuous piecewise linear pressure elements is known to constitute a stable combination for incompressible linear elasticity computations. In this contribution, we extend the stress reconstruction procedure and resulting guaranteed a posteriori error estimator developed by Ainsworth, Allendes, Barrenechea and Rankin [2] and by Kim [18] to linear elasticity. In order to get a guaranteed reliability bound with respect to t

APA, Harvard, Vancouver, ISO, and other styles

9

Lindeberg, Tony. "Provably Scale-Covariant Continuous Hierarchical Networks Based on Scale-Normalized Differential Expressions Coupled in Cascade." Journal of Mathematical Imaging and Vision 62, no. 1 (2019): 120–48. http://dx.doi.org/10.1007/s10851-019-00915-x.

Full text

Abstract:

Abstract This article presents a theory for constructing hierarchical networks in such a way that the networks are guaranteed to be provably scale covariant. We first present a general sufficiency argument for obtaining scale covariance, which holds for a wide class of networks defined from linear and nonlinear differential expressions expressed in terms of scale-normalized scale-space derivatives. Then, we present a more detailed development of one example of such a network constructed from a combination of mathematically derived models of receptive fields and biologically inspired computatio

APA, Harvard, Vancouver, ISO, and other styles

10

Likhoded, N. A., and M. A. Paliashchuk. "Tiled parallel 2D computational processes." Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series 54, no. 4 (2019): 417–26. http://dx.doi.org/10.29235/1561-2430-2018-54-4-417-426.

Full text

Abstract:

The algorithm implemented on a parallel computer with distributed memory has, as a rule, a tiled structure: a set of operations is divided into subsets, called tiles. One of the modern approaches to obtaining tiled versions of algorithms is a tiling transformation based on information sections of the iteration space, resulting in macro-operations (tiles). The operations of one tile are performed atomically, as one unit of calculation, and the data exchange is done by arrays. The method of construction of tiled computational processes logically organized as a two-dimensional structure for algor

APA, Harvard, Vancouver, ISO, and other styles

11

Lei, F., XP Xie, XW Wang, and YG Wang. "Research on the efficiency of reduced-basis approach in computations of structural problems and its improvements." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 227, no. 10 (2012): 2143–56. http://dx.doi.org/10.1177/0954406212470895.

Full text

Abstract:

In this article, procedure and efficiency of the reduced-basis approach in structural design computation are studied. As a model order reduction approach, it provides fast evaluation of a structural system in explicitly parameterized formulation. Theoretically, the original structural system is reduced to obtain a reduced system by being projected onto a lower dimensional subspace. However, in practice, it is a time-consuming process due to the iterations of adaptive procedure in subspace construction. To improve the efficiency of the method, some characteristics are analyzed. First, the accur

APA, Harvard, Vancouver, ISO, and other styles

12

Krämer, Walter. "Constructive Error Analysis." JUCS - Journal of Universal Computer Science 4, no. (2) (1998): 147–63. https://doi.org/10.3217/jucs-004-02-0147.

Full text

Abstract:

Rigorous a priori error bounds for floating-point computations are derived. We will show that using interval tools in combination with function and operator overloading such bounds can be computed on a computer automatically in a very convenient way. The bounds are of worst case type. They hold uniformly for the specified domain of input values. That means, whenever the floating point computation is repeated later on with any set of point input values from that domain the difference of the exact result and the computed result is guaranteed to be smaller than the a priori error bound. Our techn

APA, Harvard, Vancouver, ISO, and other styles

13

Fischer, A., A. Smolin, and G. Elber. "Mid-Surfaces of Profile-based Freeforms for Mold Design." Journal of Manufacturing Science and Engineering 121, no. 2 (1999): 202–7. http://dx.doi.org/10.1115/1.2831206.

Full text

Abstract:

Mid-surfaces of complex thin objects are commonly used in CAD applications for the analysis of casting and injection molding. However, geometrical representation in CAD typically takes the form of a solid representation rather than a mid-surface; therefore, a process for extracting the mid-surface is essential. Contemporary methods for extracting mid-surfaces are based on numerical computations using offsetting techniques or Voronoi diagram processes where the data is discrete and piecewise linear. These algorithms usually have high computational complexity, and their accuracy is not guarantee

APA, Harvard, Vancouver, ISO, and other styles

14

Kennedy, Jane B. "Activities: An Interest in Radioactivity." Mathematics Teacher 89, no. 3 (1996): 209–30. http://dx.doi.org/10.5951/mt.89.3.0209.

Full text

Abstract:

Introduction: This activity explores exponential growth and decay, emphasizing the paired concepts of doubling and half-life. Exponential growth is derived from actual computations to obtain compound interest, whereas exponential decay is modeled by the use of “radioactive” dice. The activity is based on the concept of the differentiated core curriculum, which asserts that all students should be guaranteed equal access to the same curricular topics but recognizes that all students may not explore the content to the same depth or at the same level of formalism.

APA, Harvard, Vancouver, ISO, and other styles

15

Morgante, Pierpaolo, Coty Deluca, Tegla E. Jones, Gregory J. Aldrich, Norito Takenaka, and Roberto Peverati. "Steps toward Rationalization of the Enantiomeric Excess of the Sakurai–Hosomi–Denmark Allylation Catalyzed by Biisoquinoline N,N’-Dioxides Using Computations." Catalysts 11, no. 12 (2021): 1487. http://dx.doi.org/10.3390/catal11121487.

Full text

Abstract:

Allylation reactions of aldehydes are chemical transformations of fundamental interest, as they give direct access to chiral homoallylic alcohols. In this work, we focus on the full computational characterization of the catalytic activity of substituted biisoquinoline-N,N’-dioxides for the allylation of 2-naphthaldehyde. We characterized the structure of all transition states as well as identified the π stacking interactions that are responsible for their relative energies. Motivated by disagreement with the experimental results, we also performed an assessment of 34 different density function

APA, Harvard, Vancouver, ISO, and other styles

16

Kurz, Stefan, Dirk Pauly, Dirk Praetorius, Sergey Repin, and Daniel Sebastian. "Functional a posteriori error estimates for boundary element methods." Numerische Mathematik 147, no. 4 (2021): 937–66. http://dx.doi.org/10.1007/s00211-021-01188-6.

Full text

Abstract:

AbstractFunctional error estimates are well-established tools for a posteriori error estimation and related adaptive mesh-refinement for the finite element method (FEM). The present work proposes a first functional error estimate for the boundary element method (BEM). One key feature is that the derived error estimates are independent of the BEM discretization and provide guaranteed lower and upper bounds for the unknown error. In particular, our analysis covers Galerkin BEM and the collocation method, what makes the approach of particular interest for scientific computations and engineering a

APA, Harvard, Vancouver, ISO, and other styles

17

DESTERCKE, SEBASTIEN, DIDIER DUBOIS, and ERIC CHOJNACKI. "A CONSONANT APPROXIMATION OF THE PRODUCT OF INDEPENDENT CONSONANT RANDOM SETS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 17, no. 06 (2009): 773–92. http://dx.doi.org/10.1142/s0218488509006261.

Full text

Abstract:

The belief structure resulting from the combination of consonant and independent marginal random sets is not, in general, consonant. Also, the complexity of such a structure grows exponentially with the number of combined random sets, making it quickly intractable for computations. In this paper, we propose a simple guaranteed consonant outer approximation of this structure. The complexity of this outer approximation does not increase with the number of marginal random sets (i.e., of dimensions), making it easier to handle in uncertainty propagation. Features and advantages of this outer appro

APA, Harvard, Vancouver, ISO, and other styles

18

Wan, Min, Jianping Gou, Desong Wang, and Xiaoming Wang. "Dynamical Properties of Discrete-Time Background Neural Networks with Uniform Firing Rate." Mathematical Problems in Engineering 2013 (2013): 1–6. http://dx.doi.org/10.1155/2013/892794.

Full text

Abstract:

The dynamics of a discrete-time background network with uniform firing rate and background input is investigated. The conditions for stability are firstly derived. An invariant set is then obtained so that the nondivergence of the network can be guaranteed. In the invariant set, it is proved that all trajectories of the network starting from any nonnegative value will converge to a fixed point under some conditions. In addition, bifurcation and chaos are discussed. It is shown that the network can engender bifurcation and chaos with the increase of background input. The computations of Lyapuno

APA, Harvard, Vancouver, ISO, and other styles

19

Romig, Swantje, Luc Jaulin, and Andreas Rauh. "Using Interval Analysis to Compute the Invariant Set of a Nonlinear Closed-Loop Control System." Algorithms 12, no. 12 (2019): 262. http://dx.doi.org/10.3390/a12120262.

Full text

Abstract:

In recent years, many applications, as well as theoretical properties of interval analysis have been investigated. Without any claim for completeness, such applications and methodologies range from enclosing the effect of round-off errors in highly accurate numerical computations over simulating guaranteed enclosures of all reachable states of a dynamic system model with bounded uncertainty in parameters and initial conditions, to the solution of global optimization tasks. By exploiting the fundamental enclosure properties of interval analysis, this paper aims at computing invariant sets of no

APA, Harvard, Vancouver, ISO, and other styles

20

ROSENBERG, ARNOLD L. "GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT." International Journal of Foundations of Computer Science 11, no. 01 (2000): 183–204. http://dx.doi.org/10.1142/s0129054100000107.

Full text

Abstract:

We derive efficient guidelines for scheduling data-parallel computations within a draconian mode of cycle-stealing in networks of workstations. In this computing regimen, (the owner of) workstation A contracts with (the owner of) workstation B to take control of B's processor for a guaranteed total of U time units, punctuated by up to some prespecified number p of interrupts which kill any work A has in progress on B. On the one hand, the high overhead — of c time units — for setting up the communications that supply workstation B with work and receive its results recommends that A communicate

APA, Harvard, Vancouver, ISO, and other styles

21

Journal, Baghdad Science. "ON NAIVE TAYLOR MODEL INTEGRATION METHOD." Baghdad Science Journal 6, no. 1 (2009): 222–30. http://dx.doi.org/10.21123/bsj.6.1.222-230.

Full text

Abstract:

Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Be

APA, Harvard, Vancouver, ISO, and other styles

22

Saw, Vee-Liem, and Freeman Chee Siong Thun. "Peeling property and asymptotic symmetries with a cosmological constant." International Journal of Modern Physics D 29, no. 03 (2020): 2050020. http://dx.doi.org/10.1142/s0218271820500200.

Full text

Abstract:

This paper establishes two things in an asymptotically (anti-)de Sitter spacetime, by direct computations in the physical spacetime (i.e. with no involvement of spacetime compactification): (1) The peeling property of the Weyl spinor is guaranteed. In the case where there are Maxwell fields present, the peeling properties of both Weyl and Maxwell spinors similarly hold, if the leading order term of the spin coefficient [Formula: see text] when expanded as inverse powers of [Formula: see text] (where [Formula: see text] is the usual spherical radial coordinate, and [Formula: see text] is null i

APA, Harvard, Vancouver, ISO, and other styles

23

Xu, Yihao, Zhuo Zhang, Longyong Chen, Zhenhua Li, and Ling Yang. "The Adaptive Streaming SAR Back-Projection Algorithm Based on Half-Precision in GPU." Electronics 11, no. 18 (2022): 2807. http://dx.doi.org/10.3390/electronics11182807.

Full text

Abstract:

The back-projection (BP) algorithm is completely accurate in the imaging principle, but the computational complexity is extremely high. The single-precision arithmetic used in the traditional graphics processing unit (GPU) acceleration scheme has low throughput and its usage of the video memory is large. An adaptive asynchronous streaming scheme for the BP algorithm based on half-precision is proposed in this study, and then it is extended to the fast back-projection (FBP) algorithm. In this scheme, the adaptive loss factors selection strategy ensures the dynamic range of data, the asynchronou

APA, Harvard, Vancouver, ISO, and other styles

24

Abo Khamis, Mahmoud, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, and Yisu Remy Wang. "Convergence of Datalog over (Pre-) Semirings." ACM SIGMOD Record 52, no. 1 (2023): 75–82. http://dx.doi.org/10.1145/3604437.3604454.

Full text

Abstract:

Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big data systems require recursive computations beyond the Boolean space. In this paper we study the convergence of datalog when it is interpreted over an arbitrary semiring. We consider an ordered semiring, define the semantics of a datalog program as a least fixpoint in this semiring, and study the number of steps required to reach that fixpoint, if ever. We ide

APA, Harvard, Vancouver, ISO, and other styles

25

Chiang, David, Colin McDonald, and Chung-chieh Shan. "Exact Recursive Probabilistic Programming." Proceedings of the ACM on Programming Languages 7, OOPSLA1 (2023): 665–95. http://dx.doi.org/10.1145/3586050.

Full text

Abstract:

Recursive calls over recursive data are useful for generating probability distributions, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also useful, but unfortunately, existing probabilistic programming languages do not perform exact inference on recursive calls over recursive data, forcing programmers to code many applications manually. We introduce a probabilistic language in which a wide variety of recursion can be expressed naturally, and inference carried out exactly. For instance, probabilistic

APA, Harvard, Vancouver, ISO, and other styles

26

Tropin, D. V., A. M. Ershov, D. P. Nikolaev, and V. V. Arlazarov. "Advanced Hough-based method for on-device document localization." Computer Optics 5, no. 45 (2021): 702–12. http://dx.doi.org/10.18287/2412-6179-co-895.

Full text

Abstract:

The demand for on-device document recognition systems increases in conjunction with the emergence of more strict privacy and security requirements. In such systems, there is no data transfer from the end device to a third-party information processing servers. The response time is vital to the user experience of on-device document recognition. Combined with the unavailability of discrete GPUs, powerful CPUs, or a large RAM capacity on consumer-grade end devices such as smartphones, the time limitations put significant constraints on the computational complexity of the applied algorithms for on-

APA, Harvard, Vancouver, ISO, and other styles

27

Tropin, D. V., A. M. Ershov, D. P. Nikolaev, and V. V. Arlazarov. "Advanced Hough-based method for on-device document localization." Computer Optics 5, no. 45 (2021): 702–12. http://dx.doi.org/10.18287/2412-6179-co-895.

Full text

Abstract:

The demand for on-device document recognition systems increases in conjunction with the emergence of more strict privacy and security requirements. In such systems, there is no data transfer from the end device to a third-party information processing servers. The response time is vital to the user experience of on-device document recognition. Combined with the unavailability of discrete GPUs, powerful CPUs, or a large RAM capacity on consumer-grade end devices such as smartphones, the time limitations put significant constraints on the computational complexity of the applied algorithms for on-

APA, Harvard, Vancouver, ISO, and other styles

28

Al-Adwan, Ibrahim M. "Intelligent Path Planning Approach for Autonomous Mobile Robot." Journal of Robotics and Mechatronics 33, no. 6 (2021): 1423–28. http://dx.doi.org/10.20965/jrm.2021.p1423.

Full text

Abstract:

This paper presents a new path planning algorithm for an autonomous mobile robot. It is desired that the robot reaches its goal in a known or partially known environment (e.g., a warehouse or an urban environment) and avoids collisions with walls and other obstacles. To this end, a new, efficient, simple, and flexible path finder strategy for the robot is proposed in this paper. With the proposed strategy, the optimal path from the robot’s current position to the goal position is guaranteed. The environment is represented as a grid-based map, which is then divided into a predefined number of s

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Aihua, Yongchao Wang, Zhiqiang Zhang, and Hamid Reza Karimi. "Robust Control Allocation for Spacecraft Attitude Stabilization under Actuator Faults and Uncertainty." Mathematical Problems in Engineering 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/789327.

Full text

Abstract:

A robust control allocation scheme is developed for rigid spacecraft attitude stabilization in the presence of actuator partial loss fault, actuator failure, and actuator misalignment. First, a neural network fault detection scheme is proposed, Second, an adaptive attitude tracking strategy is employed which can realize fault tolerance control under the actuator partial loss and actuator failure withinλmin⁡=0.5. The attitude tracking and faults detection are always here during the procedure. Once the fault occurred which could not guaranteed the attitude stable for 30 s, the robust control all

APA, Harvard, Vancouver, ISO, and other styles

30

WEIN, RON, OLEG ILUSHIN, GERSHON ELBER, and DAN HALPERIN. "CONTINUOUS PATH VERIFICATION IN MULTI-AXIS NC-MACHINING." International Journal of Computational Geometry & Applications 15, no. 04 (2005): 351–77. http://dx.doi.org/10.1142/s0218195905001749.

Full text

Abstract:

We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter continuously moves near the workpiece. Having five degrees of motion freedom, this problem is hard to solve exactly and we approximate the motion of the tool by a sequence of sub-paths of pure translations interleaved with pure rotations. The collision-detection problem along each sub-path is then solved by using radial projection of the obstacles (the workpiece and the static parts of the NC-machine) around the tool axis

APA, Harvard, Vancouver, ISO, and other styles

31

Ida, Yasutoshi, Sekitoshi Kanai, Kazuki Adachi, Atsutoshi Kumagai, and Yasuhiro Fujiwara. "Fast Regularized Discrete Optimal Transport with Group-Sparse Regularizers." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 7 (2023): 7980–87. http://dx.doi.org/10.1609/aaai.v37i7.25965.

Full text

Abstract:

Regularized discrete optimal transport (OT) is a powerful tool to measure the distance between two discrete distributions that have been constructed from data samples on two different domains. While it has a wide range of applications in machine learning, in some cases the sampled data from only one of the domains will have class labels such as unsupervised domain adaptation. In this kind of problem setting, a group-sparse regularizer is frequently leveraged as a regularization term to handle class labels. In particular, it can preserve the label structure on the data samples by corresponding

APA, Harvard, Vancouver, ISO, and other styles

32

Ifrim, Ioana, Vassil Vassilev, and David J. Lange. "GPU Accelerated Automatic Differentiation With Clad." Journal of Physics: Conference Series 2438, no. 1 (2023): 012043. http://dx.doi.org/10.1088/1742-6596/2438/1/012043.

Full text

Abstract:

Abstract Automatic Differentiation (AD) is instrumental for science and industry. It is a tool to evaluate the derivative of a function specified through a computer program. The range of AD application domain spans from Machine Learning to Robotics to High Energy Physics. Computing gradients with the help of AD is guaranteed to be more precise than the numerical alternative and have a low, constant factor more arithmetical operations compared to the original function. Moreover, AD applications to domain problems typically are computationally bound. They are often limited by the computational r

APA, Harvard, Vancouver, ISO, and other styles

33

Miao, Ji, Chunlin Gong, and Chunna Li. "Two-stage aerodynamic optimization method based on early termination of CFD convergence and variable-fidelity model." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 39, no. 1 (2021): 148–58. http://dx.doi.org/10.1051/jnwpu/20213910148.

Full text

Abstract:

Efficient aerodynamic design optimization method is of great value for improving the aerodynamic performance of little UAV's airfoil. Using engineering or semi-engineering estimation method to analyze aerodynamic forces in solving aerodynamic optimization problems costs little computational time, but the accuracy cannot be guaranteed. However, CFD method ensuring high accuracy needs much more computational cost, which is unfordable for optimization. Surrogate-based optimization can reduce the number of high-fidelity analyses to increase the optimization efficiency. However, the cost of CFD ana

APA, Harvard, Vancouver, ISO, and other styles

34

Cook, Sebastien, and Paulo Garcia. "Arbitrarily Parallelizable Code: A Model of Computation Evaluated on a Message-Passing Many-Core System." Computers 11, no. 11 (2022): 164. http://dx.doi.org/10.3390/computers11110164.

Full text

Abstract:

The number of processing elements per solution is growing. From embedded devices now employing (often heterogeneous) multi-core processors, across many-core scientific computing platforms, to distributed systems comprising thousands of interconnected processors, parallel programming of one form or another is now the norm. Understanding how to efficiently parallelize code, however, is still an open problem, and the difficulties are exacerbated across heterogeneous processing, and especially at run time, when it is sometimes desirable to change the parallelization strategy to meet non-functional

APA, Harvard, Vancouver, ISO, and other styles

35

Elkordy, Ahmed Roushdy, Jiang Zhang, Yahya H. Ezzeldin, Konstantinos Psounis, and Salman Avestimehr. "How Much Privacy Does Federated Learning with Secure Aggregation Guarantee?" Proceedings on Privacy Enhancing Technologies 2023, no. 1 (2023): 510–26. http://dx.doi.org/10.56553/popets-2023-0030.

Full text

Abstract:

Federated learning (FL) has attracted growing interest for enabling privacy-preserving machine learning on data stored at multiple users while avoiding moving the data off-device. However, while data never leaves users’ devices, privacy still cannot be guaranteed since significant computations on users’ training data are shared in the form of trained local models. These local models have recently been shown to pose a substantial privacy threat through different privacy attacks such as model inversion attacks. As a remedy, Secure Aggregation (SA) has been developed as a framework to preserve pr

APA, Harvard, Vancouver, ISO, and other styles

36

NAGY, MARIUS, and SELIM G. AKL. "COPING WITH DECOHERENCE: PARALLELIZING THE QUANTUM FOURIER TRANSFORM." Parallel Processing Letters 20, no. 03 (2010): 213–26. http://dx.doi.org/10.1142/s012962641000017x.

Full text

Abstract:

Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of the order of execution of each step [2]. This paper identifies practical instances of this computational paradigm in the procedures for computing the quantum Fourier transform and its inverse. It is shown herein that under the constraints imposed by quantum decoherence, only a parallel approach can guarantee a reliable solution or, alternatively, improve scalability.

APA, Harvard, Vancouver, ISO, and other styles

37

Zelelew, M. B., and K. Alfredsen. "Sensitivity-guided evaluation of the HBV hydrological model parameterization." Journal of Hydroinformatics 15, no. 3 (2012): 967–90. http://dx.doi.org/10.2166/hydro.2012.011.

Full text

Abstract:

Applying hydrological models for river basin management depends on the availability of the relevant data information to constrain the model residuals. The estimation of reliable parameter values for parameterized models is not guaranteed. Identification of influential model parameters controlling the model response variations either by main or interaction effects is therefore critical for minimizing model parametric dimensions and limiting prediction uncertainty. In this study, the Sobol variance-based sensitivity analysis method was applied to quantify the importance of the HBV conceptual hyd

APA, Harvard, Vancouver, ISO, and other styles

38

Yazdani, E., Y. Cang, R. Sadighi-Bonabi, H. Hora, and F. Osman. "Layers from initial Rayleigh density profiles by directed nonlinear force driven plasma blocks for alternative fast ignition." Laser and Particle Beams 27, no. 1 (2009): 149–56. http://dx.doi.org/10.1017/s0263034609000214.

Full text

Abstract:

AbstractMeasurement of extremely new phenomena during the interaction of laser pulses with terawatt and higher power and picoseconds with plasmas arrived at drastically different anomalies in contrast to the usual observations if the laser pulses were very clean with a contrast ratio higher than 108. This was guaranteed by the suppression of prepulses during less than dozens of ps before the arrival of the main pulse resulting in the suppression of relativistic self-focusing. This anomaly was confirmed in many experimental details, and explained and numerically reproduced as a nonlinear force

APA, Harvard, Vancouver, ISO, and other styles

39

Ern, Alexandre, Iain Smears, and Martin Vohralík. "Equilibrated flux a posteriori error estimates in $L^2(H^1)$-norms for high-order discretizations of parabolic problems." IMA Journal of Numerical Analysis 39, no. 3 (2018): 1158–79. http://dx.doi.org/10.1093/imanum/dry035.

Full text

Abstract:

Abstract We consider the a posteriori error analysis of fully discrete approximations of parabolic problems based on conforming $hp$-finite element methods in space and an arbitrary order discontinuous Galerkin method in time. Using an equilibrated flux reconstruction we present a posteriori error estimates yielding guaranteed upper bounds on the $L^2(H^1)$-norm of the error, without unknown constants and without restrictions on the spatial and temporal meshes. It is known from the literature that the analysis of the efficiency of the estimators represents a significant challenge for $L^2(H^1)

APA, Harvard, Vancouver, ISO, and other styles

40

Vinti, Agrawal. "Corporate Guarantee: Computation of Guarantee Fees at Arm’s Length Price." Christ University Law Journal 5, no. 1 (2016): 19–34. http://dx.doi.org/10.12728/culj.8.2.

Full text

Abstract:

The most recent controversy surrounding Indian tax courts, pertains to the issue of international transactions with respect to intra-group financing. It includes short as well as long term borrowing and lending, guarantees etc. The debate centres around transfer pricing (herein after referred to 'TP') provisions and how the computation of arm’s length price is to be done. The article has focussed on one aspect of intra group financing, that is, the provision of corporate guarantee. The paper first describes the meaning of guarantee and then highlights various provisions relating to corporate g

APA, Harvard, Vancouver, ISO, and other styles

41

Arjun, Reddy Lingala. "Stream Processing Internals and Usecases." International Journal of Leading Research Publication 5, no. 4 (2024): 1–7. https://doi.org/10.5281/zenodo.14945841.

Full text

Abstract:

Batch processing is widely used concept in data warehousing where many companies build analytical solutions deriving insights into their systems and building new products based on the analysis based on various aspects of the systems. The exponential growth of real-time data sources like IoT sensors, social media has necessitated systems capable of processing unbounded data streams with low latency, high throughput, and guaranteed correctness. Unlike batch processing, stream process- ing engines must handle continuous data flows with dynamic arrival patterns, out-of-order events, and variable w

APA, Harvard, Vancouver, ISO, and other styles

42

Pandi, Suganya, and Pradeep Reddy Ch. "PMCAR: proactive mobility and congestion aware route prediction mechanism in IoMT for delay sensitive medical applications to ensure reliability in COVID-19 pandemic situation." International Journal of Pervasive Computing and Communications 16, no. 5 (2020): 429–46. http://dx.doi.org/10.1108/ijpcc-06-2020-0061.

Full text

Abstract:

Purpose Inclusion of mobile nodes (MNs) in Internet of Things (IoT) further increases the challenges such as frequent network disconnection and intermittent connectivity because of high mobility rate of nodes. This paper aims to propose a proactive mobility and congestion aware route prediction mechanism (PMCAR) to find the congestion free route from leaf to destination oriented directed acyclic graph root (DODAG-ROOT) which considers number of MNs connected to a static node. This paper compares the proposed technique (PMCAR) with RPL (OF0) which considers the HOP-COUNT to determine the path f

APA, Harvard, Vancouver, ISO, and other styles

43

Fan, Wenfei. "Big graphs." Proceedings of the VLDB Endowment 15, no. 12 (2022): 3782–97. http://dx.doi.org/10.14778/3554821.3554899.

Full text

Abstract:

Big data is typically characterized with 4V's: Volume, Velocity, Variety and Veracity. When it comes to big graphs, these challenges become even more staggering. Each and every of the 4V's raises new questions, from theory to systems and practice. Is it possible to parallelize sequential graph algorithms and guarantee the correctness of the parallelized computations? Given a computational problem, does there exist a parallel algorithm for it that guarantees to reduce parallel runtime when more machines are used? Is there a systematic method for developing incremental algorithms with effectiven

APA, Harvard, Vancouver, ISO, and other styles

44

Rohou, Simon, Luc Jaulin, Lyudmila Mihaylova, Fabrice Le Bars, and Sandor M. Veres. "Guaranteed computation of robot trajectories." Robotics and Autonomous Systems 93 (July 2017): 76–84. http://dx.doi.org/10.1016/j.robot.2017.03.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

ALVIANO, MARIO, and RAFAEL PEÑALOZA. "Fuzzy answer sets approximations." Theory and Practice of Logic Programming 13, no. 4-5 (2013): 753–67. http://dx.doi.org/10.1017/s1471068413000471.

Full text

Abstract:

AbstractFuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given

APA, Harvard, Vancouver, ISO, and other styles

46

Pathak, Manjiri. "OS design challenges & research opportunities in real-time WSNs & approach for real time support in Nano-RK." COMPUSOFT: An International Journal of Advanced Computer Technology 02, no. 07 (2013): 198–203. https://doi.org/10.5281/zenodo.14607271.

Full text

Abstract:

In recent years, wireless sensor network has become an important research domain. WSNs were initially proposed in domains where ordinary networks (not necessarily wired) are not convenient, either because of the missing infrastructures, or when numerous nodes (in the order of hundreds or thousands) are needed to achieve the assigned task. Nowadays WSNs represent a new generation of distributed embedded systems with a broad range of real-time applications. Some of the applications include process control, fire monitoring, border surveillance, medical care, asset tracking, agriculture, highway t

APA, Harvard, Vancouver, ISO, and other styles

47

Yi, Pu (Luke), and Sara Achour. "Hardware-Aware Static Optimization of Hyperdimensional Computations." Proceedings of the ACM on Programming Languages 7, OOPSLA2 (2023): 1–30. http://dx.doi.org/10.1145/3622797.

Full text

Abstract:

Binary spatter code (BSC)-based hyperdimensional computing (HDC) is a highly error-resilient approximate computational paradigm suited for error-prone, emerging hardware platforms. In BSC HDC, the basic datatype is a hypervector , a typically large binary vector, where the size of the hypervector has a significant impact on the fidelity and resource usage of the computation. Typically, the hypervector size is dynamically tuned to deliver the desired accuracy; this process is time-consuming and often produces hypervector sizes that lack accuracy guarantees and produce poor results when reused f

APA, Harvard, Vancouver, ISO, and other styles

48

Yu, Weiren, Julie McCann, Chengyuan Zhang, and Hakan Ferhatosmanoglu. "Scaling High-Quality Pairwise Link-Based Similarity Retrieval on Billion-Edge Graphs." ACM Transactions on Information Systems 40, no. 4 (2022): 1–45. http://dx.doi.org/10.1145/3495209.

Full text

Abstract:

SimRank is an attractive link-based similarity measure used in fertile fields of Web search and sociometry. However, the existing deterministic method by Kusumoto et al. [ 24 ] for retrieving SimRank does not always produce high-quality similarity results, as it fails to accurately obtain diagonal correction matrix D . Moreover, SimRank has a “connectivity trait” problem: increasing the number of paths between a pair of nodes would decrease its similarity score. The best-known remedy, SimRank++ [ 1 ], cannot completely fix this problem, since its score would still be zero if there are no commo

APA, Harvard, Vancouver, ISO, and other styles

49

Foster, M. P. "Disambiguating the SI notation would guarantee its correct parsing." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 465, no. 2104 (2009): 1227–29. http://dx.doi.org/10.1098/rspa.2008.0343.

Full text

Abstract:

The clarity and utility of the International System of Units (SI) would be improved if its notation were made a formally unambiguous symbolic language. This could be achieved with minor changes, and would enable the development of software that could correctly (i) check SI style in text and (ii) manipulate/verify quantities, SI units and prefix algebra in scientific and engineering computations. These tools could lead to better SI usage and fewer computational errors.

APA, Harvard, Vancouver, ISO, and other styles

50

Heshmati-alamdari, Shahab, Alina Eqtami, George C. Karras, Dimos V. Dimarogonas, and Kostas J. Kyriakopoulos. "A Self-triggered Position Based Visual Servoing Model Predictive Control Scheme for Underwater Robotic Vehicles." Machines 8, no. 2 (2020): 33. http://dx.doi.org/10.3390/machines8020033.

Full text

Abstract:

An efficient position based visual sevroing control approach for Autonomous Underwater Vehicles (AUVs) by employing Non-linear Model Predictive Control (N-MPC) is designed and presented in this work. In the proposed scheme, a mechanism is incorporated within the vision-based controller that determines when the Visual Tracking Algorithm (VTA) should be activated and new control inputs should be calculated. More specifically, the control loop does not close periodically, i.e., between two consecutive activations (triggering instants), the control inputs calculated by the N-MPC at the previous tr

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!