Search results for " approximation"

showing 10 items of 575 documents

New solutions for prefabricated secondary substations in the view of sustainability

2016

The secondary substations will assume an important role as “smart nodes” of the smart grid. So in few years there will be a widespread dissemination on the territory of this apparatus. Consequently, great care have to be taken not only on safety issues, but also on the constructive methodology, in order to determine low environmental impact and decommissioning cost. This paper focuses on innovative solutions for the realization of prefabricated secondary substations, in the direction of sustainability. Innovative layout and enclosure topologies have been here taken into account. In particular, by considering that the substation concrete box is, at the same time, uneconomical and with strong…

Engineeringbusiness.industryprefabricated substationRenewable Energy Sustainability and the Environment020209 energyEnclosureEnergy Engineering and Power Technology02 engineering and technologyhuman exposureSettore ING-IND/32 - Convertitori Macchine E Azionamenti ElettriciNetwork topologyCivil engineeringConstructiveConstruction engineeringNuclear decommissioningSmart gridComputer Networks and CommunicationHardware and ArchitectureContainer (abstract data type)Sustainability0202 electrical engineering electronic engineering information engineeringEnvironmental impact assessmentdistance of first approximation (DPA)businesssmart grid
researchProduct

Second-order hydrodynamic effects on the response of three semisubmersible floating offshore wind turbines

2020

Abstract Floating structures have become the most feasible solution for supporting wind turbines when offshore wind project move to deeper water. In this paper, a hydrodynamic analysis of three different semisubmersible floating offshore wind turbines is carried out including second-order hydrodynamic effects. The three examined platforms are V-shaped semisubmersible, Braceless semisubmersible and OC4-DeepCwind semisubmersible and are used to support the NREL 5 MW reference wind turbine. The main objective of the present study is to investigate and compare the hydrodynamic response of the three different semisubmersible floaters in two water depths (100 m, and 200 m) under different load co…

Environmental Engineering020209 energyHydrodynamic loadsOcean Engineering02 engineering and technology01 natural sciencesTurbineTransfer functionSemisubmersible floating wind turbines010305 fluids & plasmas0103 physical sciences0202 electrical engineering electronic engineering information engineeringWind powerSecond-order wave loadsbusiness.industryTension (physics)Newman's approximationMooringOffshore wind powerDragEngineering and TechnologybusinessFloating platformQuadratic transfer functionGeologyMarine engineeringOcean Engineering
researchProduct

A shoreline boundary condition for a highly nonlinear Boussinesq model for breaking waves

2012

Abstract A physically based strategy was used to model swash zone hydrodynamics forced by breaking waves within a Boussinesq type of model. The position and the velocity of the shoreline were determined continuously in space by solving the physically-based equations of the shoreline motion; moreover, a fixed grid method, with a wet–dry interface, was adopted for integrating the Boussinesq model. The numerical stability of the model was improved by means of an extrapolation method. To validate the proposed methodology, the classical analytical solution for the shoreline motion of a monochromatic wave train over a plane beach was considered. The comparison between the analytical and numerical…

Environmental EngineeringBoussinesq modelSettore ICAR/02 - Costruzioni Idrauliche E Marittime E IdrologiaExtrapolationrun-up Boussinesq model Breaking wavesBreaking waveOcean EngineeringMechanicsRun-upPhysics::GeophysicsNonlinear systemBreaking wavesGeotechnical engineeringBoundary value problemBoussinesq approximation (water waves)Run-up; Boussinesq model; Breaking wavesMonochromatic electromagnetic plane waveGeologySwashNumerical stability
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

Approximation properties of higher degree F-transforms based on B-splines

2015

The paper deals with the F-transform with polynomial components with respect to a generalized fuzzy partition given by B-splines. We investigate approximation properties of the inverse F-transform in this case and prove that using B-splines allows us to improve the quality of approximation of smooth functions.

Equioscillation theoremDiscrete mathematicsPolynomialApproximation theoryBox splineApproximation errorApplied mathematicsInverseSpouge's approximationMinimax approximation algorithmMathematics2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)
researchProduct

Evanescent wave approximation for non-Hermitian Hamiltonians

2020

The counterpart of the rotating wave approximation for non-Hermitian Hamiltonians is considered, which allows for the derivation of a suitable effective Hamiltonian for systems with some states undergoing decay. In the limit of very high decay rates, on the basis of this effective description we can predict the occurrence of a quantum Zeno dynamics, which is interpreted as the removal of some coupling terms and the vanishing of an operatorial pseudo-Lamb shift.

Evanescent waverotating wave approximationeffective HamiltonianGeneral Physics and AstronomyFOS: Physical scienceslcsh:Astrophysics01 natural sciencesArticle010305 fluids & plasmassymbols.namesake0103 physical scienceslcsh:QB460-466non-Hermitian HamiltonianLimit (mathematics)quantum Zeno effect010306 general physicslcsh:ScienceMathematical physicsQuantum Zeno effectCouplingPhysicsQuantum PhysicsBasis (linear algebra)open quantum systemsEffective hamiltonian Non-hermitian hamiltonian Open quantum systems Quantum zeno effect Rotating wave approximationHermitian matrixlcsh:QC1-999symbolsRotating wave approximationlcsh:QHamiltonian (quantum mechanics)Quantum Physics (quant-ph)lcsh:Physics
researchProduct

Forward and backward diffusion approximations for haploid exchangeable population models

2001

Abstract The class of haploid population models with non-overlapping generations and fixed population size N is considered such that the family sizes ν1,…,νN within a generation are exchangeable random variables. A criterion for weak convergence in the Skorohod sense is established for a properly time- and space-scaled process counting the number of descendants forward in time. The generator A of the limit process X is constructed using the joint moments of the offspring variables ν1,…,νN. In particular, the Wright–Fisher diffusion with generator Af(x)= 1 2 x(1−x)f″(x) appears in the limit as the population size N tends to infinity if and only if the condition lim N→∞ E((ν 1 −1) 3 )/(N Var …

Exchangeable random variablesStatistics and ProbabilityDualityPopulation geneticsCoalescent theoryDiffusion approximationModelling and SimulationQuantitative Biology::Populations and EvolutionNeutralityWright–Fisher diffusionHille–Yosida theoremWeak convergenceMathematicsWeak convergenceApplied MathematicsMathematical analysisHeavy traffic approximationCommutative diagramHille–Yosida theoremPopulation modelDiffusion processModeling and SimulationAncestorsDescendantsExchangeabilityCoalescentStochastic Processes and their Applications
researchProduct

Denoising Autoencoders for Fast Combinatorial Black Box Optimization

2015

Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Autoencoders (AE) are generative stochastic networks with these desired properties. We integrate a special type of AE, the Denoising Autoencoder (DAE), into an EDA and evaluate the performance of DAE-EDA on several combinatorial optimization problems with a single objective. We asses the number of fitness evaluations as well as the required CPU times. We compare the results to the performance to the Bayesian Optimization Algorithm (BOA) and RBM-EDA, another EDA which is based on a generative neural network which has proven competitive with BOA. For the considered pro…

FOS: Computer and information sciencesArtificial neural networkI.2.6business.industryFitness approximationComputer scienceNoise reductionI.2.8MathematicsofComputing_NUMERICALANALYSISComputer Science - Neural and Evolutionary ComputingMachine learningcomputer.software_genreAutoencoderOrders of magnitude (bit rate)Estimation of distribution algorithmBlack boxComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONNeural and Evolutionary Computing (cs.NE)Artificial intelligencebusinessI.2.6; I.2.8computerProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
researchProduct

Minimal Learning Machine: Theoretical Results and Clustering-Based Reference Point Selection

2019

The Minimal Learning Machine (MLM) is a nonlinear supervised approach based on learning a linear mapping between distance matrices computed in the input and output data spaces, where distances are calculated using a subset of points called reference points. Its simple formulation has attracted several recent works on extensions and applications. In this paper, we aim to address some open questions related to the MLM. First, we detail theoretical aspects that assure the interpolation and universal approximation capabilities of the MLM, which were previously only empirically verified. Second, we identify the task of selecting reference points as having major importance for the MLM's generaliz…

FOS: Computer and information sciencesComputer Science - Machine LearningMinimal Learning MachinekoneoppiminenStatistics - Machine Learninguniversal approximationMachine Learning (stat.ML)interpolointiapproksimointireference point selectionclusteringMachine Learning (cs.LG)
researchProduct

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

2016

International audience; We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.

FOS: Computer and information sciencesCoupled-task scheduling model[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Computer science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchComputational Complexity (cs.CC)Topology01 natural sciencesExecution timeTheoretical Computer ScienceComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)021103 operations researchJob shop schedulingPolynomial-time approximation algorithmApproximation algorithmCompatibility graphComplexityIdle timeComputer Science ApplicationsComputer Science - Computational Complexity[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsCompatibility (mechanics)Bipartite graphMinification
researchProduct