Search results for " Mathematical"

showing 10 items of 686 documents

Influence of the Height of Municipal Solid Waste Landfill on the Formation of Perched Leachate Zones

2015

Waste settlement as well as consolidation phenomena, which occur inside a landfill for municipal solid waste (MSW), can cause a decrease in waste permeability. This can lead to a reduction in conveyance of the leachate drainage system. It is therefore possible that a so-called perched leachate zone will form. Such a zone is constituted by an area in the body of the landfill where the leachate is temporarily trapped and is unable to infiltrate downward. This phenomenon is influenced by many factors, which include rain infiltration rate, waste moisture and composition, landfill height, and so on. The main aim of the paper is to elucidate the role played by landfill height in the formation of …

Environmental EngineeringBioreactor landfillMunicipal solid wasteSettore ICAR/03 - Ingegneria Sanitaria-AmbientaleConsolidation (soil)MoistureEnvironmental engineeringPermeability (earth sciences)Hydraulic conductivityMunicipal solid waste landfillMunicipal wastes Landfill Leachate Mathematical models Settlement Hydraulic conductivityEnvironmental ChemistryEnvironmental scienceLeachateGeneral Environmental ScienceCivil and Structural EngineeringJournal of Environmental Engineering
researchProduct

Mathematical and numerical modeling of an airlift perfusion bioreactor for tissue engineering applications

2022

The Tissue Engineering (TE) strategy is widely focused on the development of perfusion bioreactors to promote the production of three-dimensional (3D) functional tissues. To optimize tissue production, it is worth investigating the engineering parameters of a bioreactor system for identifying a beneficial range of operation variables. Mathematical and numerical modeling of a perfusion bioreactor is capable to provide relevant insights into the fluid flow and nutrients transport while predicting experimental data and exploring the impact of changing operating parameters, such as fluid velocities. In this work, the hydrodynamic parameters and oxygen transport were investigated using mathemati…

Environmental EngineeringFlow rate and mass transport mathematical modelBiomedical EngineeringComputational fluid dynamics simulationBioengineeringDynamic cell cultureTissue engineeringBiotechnology
researchProduct

Modelling Inoculum Availability ofPlurivorosphaerella nawaein Persimmon Leaf Litter with Bayesian Beta Regression

2019

AbstractCircular leaf spot (CLS), caused byPlurivorosphaerella nawae, is a serious disease of persimmon (Diospyros kaki) inducing necrotic lesions on leaves, defoliation and fruit drop. Under Mediter-ranean conditions,P. nawaeforms pseudothecia in the leaf litter during winter and ascospores are released in spring infecting susceptible leaves. Persimmon growers are advised to apply fungicides for CLS control during the period of inoculum availability, which was defined based on ascospore counts under the microscope. A model of inoculum availability ofP. nawaewas developed and evaluated as an alternative to ascospore counts. Leaf litter samples were collected weekly in L’Alcúdia from 2010 to…

EpidemiologyVapour Pressure DeficitMycosphaerella nawaePlant ScienceMycologyEarly warning systemsPlurivorosphaerella nawaeVapor pressure deficitU40 Surveying methodsCLs upper limitsMycologyLeaf spotU10 Mathematical and statistical methodsH20 Plant diseasesDiospyros kakiFungicidesWarning systemsEcologybiologyDiospyros kakiPlant litterbiology.organism_classificationIntegrated nested Laplace approximation (INLA)FungicideHorticultureAscosporeCircular leaf spotBeta regressionAgronomy and Crop Sciencedecision support systems
researchProduct

Improved GNSS positioning exploiting a vehicular P2P infrastructure

2010

This paper considers the possibility to exploit external altitude measurements to improve the performance of a Kalman based GNSS receiver. The altitude measurements are provided by means of a peer to peer network, that is supposed to be based on the evolution of the 802.11 standard for the vehicular environment, namely the WAVE (802.11p). The performance of such a system are investigated for different characteristics of the aiding measurement and for a different number and disposals of the aiding peers. The aiding measurement is obtained starting from the altitude measurements that the other peers in the network send to the aided user. The experiments highlight the need for a parameter that…

EquationsExploitSatellitesbusiness.industryGNSS vehicularReliability (computer networking)Real-time computingIndexesKalman filterPeer-to-peerReliabilitycomputer.software_genreReceiversGNSS vehicular; Equations; Indexes; Kalman filters; Mathematical model; Receivers; Reliability; SatellitesConsistency (database systems)Mathematical modelGeographyGNSS applicationsP2P localization Kalman filtering GNSS WAVESatellite navigationMobile telephonybusinessKalman filterscomputerSimulation2010 5th Advanced Satellite Multimedia Systems Conference and the 11th Signal Processing for Space Communications Workshop
researchProduct

Desenvolupament de les habilitats matemàtiques en alumnat amb espina bífida: revisió bibliogràfica

2019

espanolEl alumnado con Espina Bifida presenta dificultades a la hora de desarrollar sus habilidades matematicas. Se ha analizado con profundidad el concepto de Espina Bifida, para tener una primera vision de lo que este conlleva. Para la revision se ha realizado una busqueda bibliografica en las bases de datos scopus, Dialnet y Google Academico, seleccionando 18 articulos objeto de analisis. Los resultados obtenidos han permitido dar respuesta a los objetivos planteados, obteniendo informacion sobre los enfoques practicos en el area de matematicas con este colectivo y analizar, asi, la efectividad de los mismos. Ademas, en las conclusiones extraidas, se encuentra la necesidad de llevar a ca…

Espina Bífida dificultats matemàtiques intervencions educatives habilitats cognitives Espina Bífida dificultades matemáticas intervenciones educativas habilidades cognitivas Spina Bifida mathematical difficulties educational interventions cognitive abilities ArtículoGeneral Earth and Planetary Sciences:PSICOLOGÍA [UNESCO]UNESCO::PSICOLOGÍAGeneral Environmental Science
researchProduct

Array programming with NumPy.

2020

Array programming provides a powerful, compact and expressive syntax for accessing, manipulating and operating on data in vectors, matrices and higher-dimensional arrays. NumPy is the primary array programming library for the Python language. It has an essential role in research analysis pipelines in fields as diverse as physics, chemistry, astronomy, geoscience, biology, psychology, materials science, engineering, finance and economics. For example, in astronomy, NumPy was an important part of the software stack used in the discovery of gravitational waves1 and in the first imaging of a black hole2. Here we review how a few fundamental array concepts lead to a simple and powerful programmi…

FOS: Computer and information sciences/639/705/1042Computer science/639/705/794Interoperability/639/705/117Review ArticleStatistics - Computationohjelmointikielet01 natural sciences03 medical and health sciencesSoftwareSoftware Designlaskennallinen tiede0103 physical sciencesFOS: Mathematics010303 astronomy & astrophysicsComputation (stat.CO)030304 developmental biologycomputer.programming_languageSolar physics0303 health sciencesMultidisciplinaryApplication programming interfacebusiness.industryNumPyComputational sciencereview-articleComputational BiologyPython (programming language)Computer science/704/525/870Computational neuroscienceProgramming paradigmSoftware designComputer Science - Mathematical Software/631/378/116/139Programming LanguagesArray programmingohjelmistokirjastotSoftware engineeringbusinessMathematical Software (cs.MS)computerMathematicsSoftwarePythonNature
researchProduct

Combinatorial proofs of two theorems of Lutz and Stull

2021

Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…

FOS: Computer and information sciences28A80 (primary) 28A78 (secondary)General MathematicskombinatoriikkaCombinatorial proofComputational Complexity (cs.CC)01 natural sciencesCombinatoricsMathematics - Metric GeometryHausdorff and packing measures0103 physical sciencesClassical Analysis and ODEs (math.CA)FOS: Mathematics0101 mathematicsMathematicsAlgorithmic information theoryLemma (mathematics)Euclidean spacePigeonhole principle010102 general mathematicsOrthographic projectionHausdorff spaceMetric Geometry (math.MG)Projection (relational algebra)Computer Science - Computational ComplexityMathematics - Classical Analysis and ODEsfraktaalit010307 mathematical physicsmittateoria
researchProduct

Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing

2015

In the k-junta testing problem, a tester has to efficiently decide whether a given function f: {0, 1}n → {0, 1} is a k-junta (i.e., depends on at most fc of its input bits) or is ε-far from any k-junta. Our main result is a quantum algorithm for this problem with query complexity Õ([EQUATION]) and time complexity Õ(n[EQUATION]). This quadratically improves over the query complexity of the previous best quantum junta tester, due to Atıcı and Servedio. Our tester is based on a new quantum algorithm for a gapped version of the combinatorial group testing problem, with an up to quartic improvement over the query complexity of the best classical algorithm. For our upper bound on the time complex…

FOS: Computer and information sciencesComputer Science - Computational ComplexityQuantum Physics0103 physical sciencesFOS: Physical sciences010307 mathematical physicsComputational Complexity (cs.CC)Computer Science::Computational ComplexityQuantum Physics (quant-ph)010306 general physics01 natural sciences
researchProduct

RationalizeRoots: Software Package for the Rationalization of Square Roots

2019

The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.

FOS: Computer and information sciencesComputer Science - Symbolic ComputationHigh Energy Physics - TheoryHigh energy particleFeynman integralComputationGeneral Physics and AstronomyFOS: Physical sciencesengineering.materialSymbolic Computation (cs.SC)Rationalization (economics)01 natural sciences010305 fluids & plasmasHigh Energy Physics - Phenomenology (hep-ph)Square root0103 physical sciencesComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONAlgebraic number010306 general physicsMathematical PhysicsVariable (mathematics)MapleMathematical Physics (math-ph)AlgebraHigh Energy Physics - PhenomenologyHigh Energy Physics - Theory (hep-th)Hardware and ArchitectureengineeringComputer Science - Mathematical SoftwareMathematical Software (cs.MS)
researchProduct

Splicing Systems from Past to Future: Old and New Challenges

2014

A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will concentrate on a specific behaviour of a type of splicing systems, introduced by P\u{a}un and subsequently developed by many researchers in both linear and circular case of splicing definition. In particular, we will present recent results on this topic and how they stimulate new challenging investigations.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Formal Languages and Automata Theory (cs.FL)Splicing Systems Formal Languages.ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal LanguagesACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting SystemsComputer Science - Formal Languages and Automata TheorySplicing Systems Formal languages Regular languages DNA computingComputingMilieux_MISCELLANEOUS[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science - Discrete Mathematics
researchProduct