Search results for " computational"

showing 10 items of 661 documents

Left-star order structure of Rickart *-rings

2015

Janowitz proved in 1983 that the initial segments of a Rickart *-ring with the star order are orthomodular posets. In this paper, the same result is proved for the left-star order , which was introduced by Marovtet al., by finding an orthogonality which corresponds to in a certain way and then applying a result proved by Cīrulis which states that the initial segments of any quasi-orthomodular set are orthomodular.

Ring (mathematics)Algebra and Number TheoryOrder (ring theory)010103 numerical & computational mathematics0102 computer and information sciencesStar (graph theory)01 natural sciencesCombinatoricsSet (abstract data type)Mathematics::LogicOrthogonality010201 computation theory & mathematicsComputer Science::Logic in Computer ScienceMathematics::Category TheoryOrder structure0101 mathematicsMathematicsLinear and Multilinear Algebra
researchProduct

Model-Based Evaluation of Methods for Respiratory Sinus Arrhythmia Estimation

2021

OBJECTIVE: Respiratory sinus arrhythmia (RSA) refers to heart rate oscillations synchronous with respiration, and it is one of the major representations of cardiorespiratory coupling. Its strength has been suggested as a biomarker to monitor different conditions, and diseases. Some approaches have been proposed to quantify the RSA, but it is unclear which one performs best in specific scenarios. The main objective of this study is to compare seven state-of-the-art methods for RSA quantification using data generated with a model proposed to simulate, and control the RSA. These methods are also compared, and evaluated on a real-life application, for their ability to capture changes in cardior…

Scale (ratio)Computer scienceBiomedical EngineeringElectrocardiographyHeart RateHeart rateCoherence (signal processing)Heart rate variabilityHumansArrhythmia Sinusrespiratory sinus arrhythmiaVagal toneRespiratory systemEstimationCardiorespiratory couplingModulationbusiness.industryRespirationheart rate variabilityPattern recognitionComputational modelingCardiorespiratory coupling Computational modeling Couplings Electrocardiography Heart rate variability Modulation Respiratory Sinus ArrhythmiaSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaCouplingsArtificial intelligencebusinessIEEE Transactions on Biomedical Engineering
researchProduct

Heavy-Flavor Contribution to Bhabha Scattering

2008

We evaluate the last missing piece of the two-loop QED corrections to the high-energy electron-positron scattering cross section originating from the vacuum polarization by heavy fermions. The calculation is performed within a new approach applicable to a wide class of perturbative problems with mass hierarchy. The result is crucial for the high-precision physics program at existing and future e(+) e(-) colliders.

Scattering cross-sectionPhysicsParticle physicsMuon530 PhysicsGeneral Physics and AstronomyFermion3100 General Physics and AstronomyNuclear physics10231 Institute for Computational ScienceCharm (quantum number)Vacuum polarizationMass hierarchyBhabha scatteringPhysical Review Letters
researchProduct

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,…

ScheduleComputer scienceworkflowDistributed computing[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]010103 numerical & computational mathematics02 engineering and technologyParallel computing[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]01 natural sciencesTheoretical Computer Science[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]checkpointfail-stop error0202 electrical engineering electronic engineering information engineeringOverhead (computing)[INFO]Computer Science [cs]0101 mathematicsresilienceClass (computer programming)020203 distributed computingJob shop schedulingProbabilistic logic020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationDynamic programmingTask (computing)[INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]WorkflowComputational Theory and MathematicsHardware and Architecture[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Task analysis[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Software
researchProduct

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

Scheme (programming language)Generalized JacobianStability (learning theory)MathematicsofComputing_NUMERICALANALYSIS010103 numerical & computational mathematics01 natural sciencesConvergence (routing)ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION0101 mathematicsMATLABMathematicscomputer.programming_languageSubdivisionNonlinear subdivision schemesbusiness.industryApplied MathematicsProcess (computing)Approximation order010101 applied mathematicsComputational MathematicsThird orderbusinessConvergencecomputerAlgorithmStability
researchProduct

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…

Scheme (programming language)Mathematical optimization010504 meteorology & atmospheric sciencesComputer scienceAutomatic differentiationbusiness.industrylcsh:QE1-996.5Cloud computing010103 numerical & computational mathematicsGeneral MedicineLimitingNumerical modelsGrid01 natural scienceslcsh:GeologyFlow (mathematics)0101 mathematicsUncertainty quantificationbusinesscomputer0105 earth and related environmental sciencescomputer.programming_languageGeoscientific Model Development
researchProduct

Selective G-quadruplex stabilizers: Schiff-base metal complexes with anticancer activity

2014

The affinity of three square-planar nickel(II) (1), copper(II) (2) and zinc(II) (3) Schiff-base complexes for wild-type human telomeric (h-Telo) and protooncogene c-myc G-quadruplex (G4) DNA was investigated by UV-visible absorption spectroscopy and circular dichroism. DNA-binding constants (Kb) were determined by spectrophotometric titrations for both G4-DNA and B-DNA. The results obtained point out that the three metal complexes selectively bind G4-DNA with higher affinity, up to two orders of magnitude, with respect to B-DNA. The nickel(II) complex 1 was found to be the most effective G4-DNA stabilizer and the Kb values decrease in the order 1 > 2 ≈ 3. Innovative computational investigat…

Schiff base metal complexes Nickel Copper Zinc Spectroscopy Computational Chemistry.Circular dichroismSchiff basebiologyChemistryStereochemistryGeneral Chemical Engineeringchemistry.chemical_elementBiological activityGeneral ChemistryZincG-quadruplexbiology.organism_classificationSettore CHIM/08 - Chimica FarmaceuticaMetalHeLachemistry.chemical_compoundCrystallographyG-quadruplex DNASettore CHIM/03 - Chimica Generale E InorganicaSettore BIO/10 - Biochimicavisual_artvisual_art.visual_art_mediumDNARSC Adv.
researchProduct

Varieties of Algebras with Superinvolution of Almost Polynomial Growth

2015

Let A be an associative algebra with superinvolution ∗ over a field of characteristic zero and let $c_{n}^{\ast }(A)$ be its sequence of corresponding ∗-codimensions. In case A is finite dimensional, we prove that such sequence is polynomially bounded if and only if the variety generated by A does not contain three explicitly described algebras with superinvolution. As a consequence we find out that no intermediate growth of the ∗-codimensions between polynomial and exponential is allowed.

SequencePolynomialSuperinvolutionGeneral Mathematics010102 general mathematicsGrowth; Polynomial identity; SuperinvolutionZero (complex analysis)Field (mathematics)010103 numerical & computational mathematicsGrowthPolynomial identity01 natural sciencesExponential functionCombinatoricsSettore MAT/02 - AlgebraBounded functionAssociative algebraMathematics (all)0101 mathematicsVariety (universal algebra)Mathematics
researchProduct

Set valued integrability in non separable Fréchet spaces and applications

2016

AbstractWe focus on measurability and integrability for set valued functions in non-necessarily separable Fréchet spaces. We prove some properties concerning the equivalence between different classes of measurable multifunctions. We also provide useful characterizations of Pettis set-valued integrability in the announced framework. Finally, we indicate applications to Volterra integral inclusions.

Set (abstract data type)Pure mathematicsSettore MAT/05 - Analisi MatematicaGeneral Mathematics010102 general mathematics010103 numerical & computational mathematics0101 mathematicsmeasurable multifunction integrable multifunction non-separable Fr'{e}chet space Volterra inclusion.01 natural sciencesSeparable spaceMathematicsMathematica Slovaca
researchProduct

An Introduction to Computational Complexity

2016

This chapter is not strictly about algebra. However, this chapter offers a set of mathematical and computational instruments that will allow us to introduce several concepts in the following chapters. Moreover, the contents of this chapter are related to algebra as they are ancillary concepts that help (and in some cases allow) the understanding of algebra.

Set (abstract data type)symbols.namesakeTheoretical computer scienceComputational complexity theoryComputer scienceAsymptotic computational complexityWorst-case complexitysymbolsComputational problemAlgebra over a fieldComputational resourceHuffman coding
researchProduct