Search results for " optimization."

showing 10 items of 2333 documents

Electromagnetic Sensitivity Analysis and Shape Optimization Using Method of Moments and Automatic Differentiation

2009

Sensitivity analysis is an important part of gradient-based optimization of electromagnetic devices. We demonstrate how sensitivity analysis can be incorporated into an existing in-house method of moments solver with a relatively small amount of labor by using a technique called automatic differentiation (AD). This approach enables us to obtain (geometrical) sensitivities of the discrete solution with accuracy up to numerical precision. We compare the assembly time and memory usage of the modified and original solvers. Moreover, we optimize the shape of a dipole antenna and the dimensions of a Yagi-Uda array using the presented AD technique, traditional response level finite difference sens…

Antenna arrayMathematical optimizationAutomatic differentiationFinite difference methodShape optimizationSensitivity (control systems)Electrical and Electronic EngineeringMethod of moments (statistics)SolverAlgorithmGradient methodMathematicsIEEE Transactions on Antennas and Propagation
researchProduct

Solvent-free microwave-assisted extraction of polyphenols from olive tree leaves: Antioxidant and antimicrobial properties

2017

International audience; Response surface methodology (RSM) and artificial neural networks (ANN) were evaluated and compared in order to decide which method was the most appropriate to predict and optimize total phenolic content (TPC) and oleuropein yields in olive tree leaf (Olea europaea) extracts, obtained after solvent-free microwave- assisted extraction (SFMAE). The SFMAE processing conditions were: microwave irradiation power 250-350 W, extraction time 2-3 min, and the amount of sample 5-10 g. Furthermore, the antioxidant and antimicrobial activities of the olive leaf extracts, obtained under optimal extraction conditions, were assessed by several in vitro assays. ANN had better predic…

Antioxidantmedicine.medical_treatment[SDV]Life Sciences [q-bio]Pharmaceutical ScienceAntioxidantsAnalytical Chemistrychemistry.chemical_compoundDrug Discovery[SDV.IDA]Life Sciences [q-bio]/Food engineeringAntimicrobial; Antioxidant; Oleuropein; Olive leaves; Optimization; Solvent-free microwave extraction; Organic ChemistryOlive leavesMicrowaves04 agricultural and veterinary sciences040401 food scienceAnti-Bacterial AgentsChemistry (miscellaneous)Molecular MedicineAntioxidantAntibacterial activityOptimizationStaphylococcus aureusMicrobial Sensitivity TestsArticlelcsh:QD241-4410404 agricultural biotechnologyOlive leaflcsh:Organic chemistryOleuropeinOleaStaphylococcus epidermidismedicine[SPI.GPROC]Engineering Sciences [physics]/Chemical and Process EngineeringResponse surface methodologyPhysical and Theoretical ChemistryOleuropeinolive leaves; solvent-free microwave extraction; oleuropein; antioxidant; antimicrobial; optimizationChromatographyPlant ExtractsExtraction (chemistry)Organic ChemistryPolyphenolsolive leaves;solvent-free microwave extraction;oleuropein;antioxidant;antimicrobial;optimizationPlant LeaveschemistryPolyphenolYield (chemistry)Solvent-free microwave extractionSolventsAntimicrobialNeural Networks Computer
researchProduct

ACTIVE HOUSE PROTOCOL APPLICATION IN MEDITERRANEAN CLIMATE : an energy-efficient kindergarden in Coppito

2022

La U.E. intende raggiungere la neutralità climatica entro il 2050. Questo articolo mira a colmare il divario nella scelta di soluzioni migliorative delle condizioni di vita negli assetti territoriali (SDG n.11) per il raggiungimento delle prestazioni energetiche attese (SDG n.7) e diffondere l’adozione di nuovi approcci e misure per la progettazione sostenibile (SDG n.13). Tali obiettivi sono stati conseguiti mediante l’applicazione di un processo di reverse engineering all’asilo Ape Tau, L’Aquila, località Coppito, dopo il sisma del 2009. Le soluzioni progettuali impiegate nell’edificio sono state analizzate secondo livelli quantitativi suggeriti dall’approccio olistico del protocollo Acti…

Ape TauPerformance assessmentMulti-criteria optimizationSustainable developmentSustainable development Multilayer dry construction Performance assessment Multi-criteria optimization Ape TauSettore ICAR/10 - Architettura TecnicaMulti-layer dry constructionApe Tau; Multi-criteria optimization; Multi-layer dry construction; Performance assessment; Sustainable development
researchProduct

Scenario optimization asset and liability modelling for individual investors

2006

We develop a scenario optimization model for asset and liability management of individual investors. The individual has a given level of initial wealth and a target goal to be reached within some time horizon. The individual must determine an asset allocation strategy so that the portfolio growth rate will be sufficient to reach the target. A scenario optimization model is formulated which maximizes the upside potential of the portfolio, with limits on the downside risk. Both upside and downside are measured vis- `a-vis the goal. The stochastic behavior of asset returns is captured through bootstrap simulation, and the simulation is embedded in the model to determine the optimal portfolio. …

Application portfolio managementComputer scienceLiabilityDownside riskGeneral Decision SciencesAsset allocationAsset and liability managementTime horizonManagement Science and Operations ResearchAsset returnBlack–Litterman modelMicroeconomicsReplicating portfolioPortfolioCapital asset pricing modelPost-modern portfolio theoryPortfolio optimizationPersonal asset allocation stochastic programmingBeta (finance)Upside potential ratio
researchProduct

On spline methods of approximation under L-fuzzy information

2011

This work is closely related to our previous papers on algorithms of approximation under L-fuzzy information. In the classical theory of approximation central algorithms were worked out on the basis of usual, that is crisp splines. We describe central methods for solution of linear problems with balanced L-fuzzy information and develop the concept of L-fuzzy splines.

Approximation theoryClassical theorySpline (mathematics)Mathematical optimizationComputingMethodologies_PATTERNRECOGNITIONBox splineFuzzy setLinear problemApplied mathematicsApproximation algorithmFuzzy logicMathematics2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2011)
researchProduct

Finite element approximation of parabolic hemivariational inequalities

1998

In this paper we introduce a finite element approximation for a parabolic hemivariational initial boundary value problem. We prove that the approximate problem is solvable and its solutions converge on subsequences to the solutions of the continuous problem

Approximation theoryControl and OptimizationPartial differential equationSignal ProcessingVariational inequalityMathematical analysisInitial value problemBoundary value problemAnalysisFinite element methodComputer Science ApplicationsMathematics
researchProduct

Real-time clothoid approximation by Rational Bezier curves

2008

This paper presents a novel technique for implementing Clothoidal real-time paths for mobile robots. As first step, rational Bezier curves are obtained as approximation of the Fresnel integrals. By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant. This on-line approach guarantees that an RBC has the same behavior as the original Clothoid using a low curve order. The resulting Clothoidal path allows any two arbitrary poses to be joined in a plane. RBCs working as Clothoids are also used to search for the shortest bounded-curvature path with a significant comput…

Approximation theoryMathematical optimizationFunction approximationComputationBézier curveMobile robotMotion planningFresnel integralInvariant (mathematics)AlgorithmMathematics2008 IEEE International Conference on Robotics and Automation
researchProduct

Reduced complexity models in the identification of dynamical networks: Links with sparsification problems

2009

In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…

Approximation theoryMathematical optimizationSettore ING-INF/04 - AutomaticaDynamical systems theoryComputational complexity theoryNode (networking)A priori and a posteriorisparsification compressing sensing estimation networksNetwork topologyGreedy algorithmTopology (chemistry)MathematicsProceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
researchProduct

Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem

2021

The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour …

Arc routing050210 logistics & transportationMathematical optimization021103 operations researchComputer science05 social sciencesBranch-price-and-cut0211 other engineering and technologiesTransportation02 engineering and technologyTravelling salesman problemConstraint (information theory)Set (abstract data type)Branch-and-cut0502 economics and businessRouting (electronic design automation)DistrictingBranch and cutArc routingCivil and Structural EngineeringTransportation Science
researchProduct

New Heuristic Algorithms for the Windy Rural Postman Problem

2005

[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.

Arc routingMathematical optimizationGeneral Computer ScienceHeuristic (computer science)MetaheuristicsManagement Science and Operations ResearchRural postman problemSearch algorithmModeling and SimulationHeuristicsHeuristicsWindy rural postman problemMATEMATICA APLICADAArc routingAlgorithmMathematics
researchProduct