Search results for "Gari"

showing 10 items of 716 documents

Computation of flow velocity in rough channels

2006

Accurate estimate of flow-velocity profile is of crucial importance both for scientific purposes and for solving numerous engineering problems that include, among others, sediment transport, contaminant transport, flow resistance evaluation. This paper presents a new empirical equation to represent the vertical velocity profile. The proposed equation is essentially a modified form of the well-known logarithm law of the wall and contains three parameters having a clear physical meaning. The applicability of the equation and its accuracy assessment for different hydraulic conditions, including non-uniform conditions, is verified by using experimental data obtained by different sources. The va…

Empirical equationsLogarithmComputationExperimental dataLaw of the wallFlow velocityApplied mathematicsGeotechnical engineeringVertical velocitySediment transportOpen-channels Flow velocity profiles experimentsWater Science and TechnologyCivil and Structural EngineeringMathematicsJournal of Hydraulic Research
researchProduct

Strawberry fields forever: That is, how many grams of plastics are used to grow a strawberry?

2020

Abstract In important areas of the agricultural sector, plastic is one of the most important tools for improving the managerial and economic performance of companies. Horticultural production under protected cultivation, in particular, makes abundant use of plastic polymers—polymers that mostly turn into waste. This study aims to identify similar organisational models among farmers operating in the strawberry production sector in relation to their intention to recycle plastic material and which factors characterize these models (attitudes, subjective norms, perceived behavioural control, and socio-demographic characteristics) and to quantify the plastic used in relation to the different typ…

Environmental EngineeringRelation (database)Plastic recyclingPolymers0208 environmental biotechnologyControl (management)02 engineering and technology010501 environmental sciencesManagement Monitoring Policy and LawFragaria01 natural sciencesProduction (economics)RecyclingWaste Management and Disposal0105 earth and related environmental sciencesbusiness.industryCircular economyGeneral MedicineEnvironmental economics020801 environmental engineeringItalyOrder (business)AgricultureSustainabilityBusinessPlasticsJournal of Environmental Management
researchProduct

Nutri-priming as an efficient means to improve the agronomic performance of molybdenum in common bean (Phaseolus vulgaris L.).

2019

International audience; Microelements play important roles in improving crop productivity and quality. Two traditional methods of providing micronutrients are soil and foliar application, yet the cost involved and phytotoxicity risks poses a major challenge in most global agricultural areas. Nutri-priming represents thus a very promising and viable alternative to ensure that the plants' requirements for micronutrients are met. This paper explores the Mo-priming effects on the germination, growth and yield components of common bean (Phaseolus vulgaris L.). In order to accomplishthis research objective, our study is divided in two phases. The first phase seeks to determine the effects of two …

Environmental EngineeringTime Factors010504 meteorology & atmospheric sciencesGreenhouseGerminationPriming (agriculture)010501 environmental sciences01 natural sciencesPhaseolus vulgarischemistry.chemical_compoundNitrogen FixationEnvironmental ChemistryWaste Management and Disposal0105 earth and related environmental sciences2. Zero hungerMolybdenumPhaseolusbiologyDose-Response Relationship DrugCrop yieldfood and beveragesBeanBiological nitrogen fixationNutrientsbiology.organism_classificationPollutionCrop ProductionchemistryAgronomyGerminationChlorophyll[SDE]Environmental SciencesSeedsNitrogen fixationPhytotoxicityPhaseolusNutri-primingThe Science of the total environment
researchProduct

Assessing the potential of Albufera de València Lagoon sediments for the restoration of charophyte meadows

2013

Abstract Albufera de Valencia Lagoon, the largest littoral lagoon on the Iberian Peninsula, has been affected by eutrophication processes since the 1970s due to the direct dumping of sewage waters of industrial, agricultural and urban origin. Consequently, the submerged vegetation that covered the bottom of the lagoon has been lost (charophytes and Potamogeton spp., Myriophyllum spp. and Ceratophyllum spp.). Despite efforts to improve water quality, this vegetation has not recovered. No information about the potential of the recent sediments to host charophyte development is available. In this study, we analysed several sediment cores taken from different areas of the lagoon to determine th…

Environmental EngineeringbiologyMyriophyllumEcologySedimentManagement Monitoring Policy and Lawbiology.organism_classificationCeratophyllumChara vulgarisLittoral zoneEnvironmental scienceWater qualityPotamogetonEutrophicationNature and Landscape ConservationEcological Engineering
researchProduct

Estimation of selected skin parameters during a series of beauty treatments in women with acne: a pilot study

2021

Background: Acne vulgaris occurs most often in young people and can significantly decrease the quality of life. Properly selected dermatological therapy and cosmetic procedures can effectively improve the skin condition of acne patients. Aim of the study: The aim of this study was to examine how various cosmetics treatments affect facial sebum levels, skin hydration, and desquamation in young women with acne vulgaris. Material and Methods: 101 women with acne aged 19–29 (M = 22.5 years, SD = 2.3 years) were included in the study. The following cosmetic treatments were used over a 12-week period: intensive pulsing light, alpha-hydroxy acids, cavitation peeling, non-needle mesotherapy, diamon…

Estimationmedicine.medical_specialtySeries (mathematics)business.industrymedia_common.quotation_subjectcavitation peelingmedicine.diseaseDermatologyAHABeautysonophoresismedicineacne vulgarismicrodermabrasionbusinessAcnemedia_commonMedical Science Pulse
researchProduct

On the statistics of pairs of logarithms of integers

2022

We study the statistics of pairs of logarithms of positive integers at various scalings, either with trivial weights or with weights given by the Euler function, proving the existence of pair correlation functions. We prove that at the linear scaling, which is not the usual scaling by the inverse of the average gap, the pair correlations exhibit a level repulsion similar to radial distribution functions of fluids. We prove total loss of mass phenomena at superlinear scalings, and constant nonzero asymptotic behavior at sublinear scalings. The case of Euler weights has applications to the pair correlation of the lengths of common perpendicular geodesic arcs from the maximal Margulis cusp nei…

Euler functionAlgebra and Number Theorypair correlationmatematiikkatilastomenetelmätlogarithms of integersDiscrete Mathematics and Combinatoricslevel repulsionfunktiotlogaritmit
researchProduct

Uncommon Suffix Tries

2011

Common assumptions on the source producing the words inserted in a suffix trie with $n$ leaves lead to a $\log n$ height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of $n$ and another one whose saturation level is negligible with respect to $\log n$. Both are built from VLMC (Variable Length Markov Chain) probabilistic sources; they are easily extended to families of sources having the same properties. The first example corresponds to a ''logarithmic infinite comb'' and enjoys a non uniform polynomial mixing. The second one corresponds to a ''factorial infinite comb'' for which mixing is uniform and exponential.

FOS: Computer and information sciencesCompressed suffix arrayPolynomialLogarithmGeneral MathematicsSuffix treevariable length Markov chain[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Generalized suffix treeprobabilistic source0102 computer and information sciences02 engineering and technologysuffix trie01 natural scienceslaw.inventionCombinatoricslawComputer Science - Data Structures and AlgorithmsTrieFOS: Mathematics0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)Mixing (physics)[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]MathematicsDiscrete mathematicsApplied MathematicsProbability (math.PR)020206 networking & telecommunicationssuffix trie.Computer Graphics and Computer-Aided Design[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]010201 computation theory & mathematicsmixing properties60J05 37E05Suffix[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilitySoftware
researchProduct

A subquadratic algorithm for minimum palindromic factorization

2014

We give an $\mathcal{O}(n \log n)$-time, $\mathcal{O}(n)$-space algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string $S [1..n]$, in $\mathcal{O}(n \log n)$ time our algorithm returns the minimum number of palindromes $S_1,\ldots, S_\ell$ such that $S = S_1 \cdots S_\ell$. We also show that the time complexity is $\mathcal{O}(n)$ on average and $\Omega(n\log n)$ in the worst case. The last result is based on a characterization of the palindromic structure of Zimin words.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)PalindromeCharacterization (mathematics)Binary logarithmOmegaSubstringTheoretical Computer ScienceString algorithmComputational Theory and MathematicsFactorizationComputer Science - Data Structures and AlgorithmsC++ string handlingPalindromeDiscrete Mathematics and CombinatoricsData Structures and Algorithms (cs.DS)FactorizationTime complexityAlgorithmMathematicsComputer Science - Discrete Mathematics
researchProduct

Computational Limitations of Affine Automata

2019

We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-values affine automata is simulated in logarithmic space. Second, we give an impossibility result for algebraic-valued affine automata. As a result, we identify some unary languages (in logarithmic space) that are not recognized by algebraic-valued affine automata with cutpoints.

FOS: Computer and information sciencesDiscrete mathematics050101 languages & linguisticsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESUnary operationFormal Languages and Automata Theory (cs.FL)Computer scienceComputation05 social sciencesComputer Science - Formal Languages and Automata Theory02 engineering and technology[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Nonlinear Sciences::Cellular Automata and Lattice GasesLogarithmic spaceAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0501 psychology and cognitive sciencesAffine transformationImpossibilityComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUS
researchProduct

Finite state verifiers with constant randomness

2014

We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers. A corollary of our main result is that the class of outcome problems corresponding to O(log n)-space …

FOS: Computer and information sciencesDiscrete mathematicsClass (set theory)Computer Science - Logic in Computer ScienceFinite-state machineGeneral Computer ScienceComputational Complexity (cs.CC)Binary logarithmLogic in Computer Science (cs.LO)Theoretical Computer ScienceComputer Science - Computational ComplexityBounded functionVerifiable secret sharingConstant (mathematics)Time complexityRandomnessMathematics
researchProduct