Search results for "Ricerca"

showing 10 items of 641 documents

Halloysite nanotubes/pluronic nanocomposites for waterlogged archeological wood: thermal stability and X-ray microtomography

2020

Filling a polymer with halloysite nanotubes is considered a promising strategy to generate nanocomposites with tailored physicochemical properties. We have focused our attention on pluronic block copolymer/halloysite nanocomposites prepared by melt blending. The effect of composition on thermal stability and polymer crystallinity was investigated by thermogravimetry and differential scanning calorimetry. Electron microscopy was used to monitor the nanoparticle distribution in the polymeric matrix. The pluronic thermal stability is reduced by the clay nanoparticles. Concerning the polymer crystallinity, it is slightly decreased even if the melting temperature is lowered by halloysite. Furthe…

Materials scienceCrystallization of polymersNanoparticleengineering.materialHalloysiteNanocompositesDifferential scanning calorimetryThermal stabilityPhysical and Theoretical Chemistrychemistry.chemical_classificationNanocompositeNanocompositeHalloysite; Nanocomposites; Nanotube; Pluronic; Restoration; Thermal degradation; Waterlogged wood; X-ray microtomography;HalloysitePluronicPolymerCondensed Matter PhysicsArchaeologyNanotubeThermogravimetrychemistryX-ray microtomographyRestorationThermal degradationengineeringSettore L-ANT/10 - Metodologie della Ricerca ArcheologicaWaterlogged woodJournal of Thermal Analysis and Calorimetry
researchProduct

Dynamic Coalitional TU Games: Distributed Bargaining among Players' Neighbors

2013

We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. The game differs from other ones in the literature on dynamic, stochastic or interval valued TU games as it combines dynamics of the game with an allocation protocol for the players that dynamically interact with each other. The protocol is an iterative and decentralized algorithm that offers a paradigmatic mathematical description of negotiation and bargaining processes. The first part of the paper contributes to the definition of a robust (coalitional) TU game and the development of a distributed bargaining protoc…

Mathematical optimizationComputer Science::Computer Science and Game TheorySequential gameComputer scienceCombinatorial game theoryExample of a game without a valueFOS: MathematicsSimultaneous gameElectrical and Electronic EngineeringTransferable utilityMathematics - Optimization and ControlGame theoryBondareva–Shapley theoremBargaining problemNon-cooperative gameUtility theoryStochastic gameComputingMilieux_PERSONALCOMPUTINGScreening gameComputer Science ApplicationsBargaining processCore (game theory)Control and Systems EngineeringOptimization and Control (math.OC)Repeated gameSettore MAT/09 - Ricerca OperativaoptimizationMathematical economicsGame theory
researchProduct

Team Theory and Person-by-Person Optimization with Binary Decisions

2012

In this paper, we extend the notion of person-by-person (pbp) optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and submodularity. We also generalize the concept of pbp optimization to the case where groups of $m$ decisions makers make joint decisions sequentially, which we refer to as $m$b$m$ optimization. The main contribution is a description of sufficient conditions, verifiable in polynomial time, under which a pbp or an $m$b$m$ optimization algorithm converges to the team-optimum. As a second contribution, we prese…

Mathematical optimizationControl and Optimizationcontrol optimizationBinary decision diagramApplied MathematicsTeam Theory; Person-by-Person Optimization; Pseudo-Boolean OptimizationApproximation algorithmState vectorTeam TheoryPerson-by-Person OptimizationSubmodular set functionVector optimizationPseudo-Boolean OptimizationComplete informationSettore MAT/09 - Ricerca OperativaGreedy algorithmTime complexityMathematicsSIAM Journal on Control and Optimization
researchProduct

Robust control of uncertain multi-inventory systems via linear matrix inequality

2008

We consider a continuous time linear multi inventory system with unknown demands bounded within ellipsoids and controls bounded within ellipsoids or polytopes. We address the problem of "-stabilizing the inventory since this implies some reduction of the inventory costs. The main results are certain conditions under which "-stabilizability is possible through a saturated linear state feedback control. All the results are based on a Linear Matrix Inequalities (LMIs) approach and on some recent techniques for the modeling and analysis of polytopic systems with saturations.

Mathematical optimizationLinear Matrix InequalitiesPolytopeDynamical Systems (math.DS)stock control93xxcontinuous systems linear matrix inequalities linear systems manufacturing systems robust control state feedback stock control uncertain systemsimpulse control inventory control hybrid systemsSettore ING-INF/04 - AutomaticaControl theoryFOS: Mathematicsmanufacturing systemsMathematics - Dynamical Systemslinear matrix inequalitiesstate feedbackTime complexityMathematics - Optimization and ControlInventory systemsMathematicsInventory controlLinear Matrix Inequalities; Inventory systemsLinear systemlinear systemsLinear matrix inequality93Cxx;93xxLinearity93Cxxhybrid systemsEllipsoidComputer Science Applicationsimpulse control; inventory control; hybrid systemsuncertain systemsControl and Systems EngineeringOptimization and Control (math.OC)Control systemBounded functioncontinuous systemsPerpetual inventorycontinuous systems; linear matrix inequalities; linear systems; manufacturing systems; robust control; state feedback; stock control; uncertain systemsinventory controlRobust controlSettore MAT/09 - Ricerca Operativarobust controlimpulse control
researchProduct

MECHANISM DESIGN FOR OPTIMAL CONSENSUS PROBLEMS

2006

We consider stationary consensus protocols for networks of dynamic agents with fixed and switching topologies. At each time instant, each agent knows only its and its neighbors’ state, but must reach consensus on a group decision value that is function of all the agents’ initial state.We show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives. We prove that such objectives can be chosen so that rational agents have a unique optimal proto…

Mathematical optimizationMechanism designDynamic agentsComputer sciencemedia_common.quotation_subjectDistributed computingmechanismcontainment controlRational agentStationary consensus protocolsNetwork topologyTopologyUniform consensusComputer Science::Multiagent SystemsSwitching topologiesComputer Science::Systems and ControlDynamic agents; Protocol design; Stationary consensus protocols; Switching topologiesSettore MAT/09 - Ricerca OperativaFunction (engineering)Protocol designProtocol (object-oriented programming)Game theoryMulti agent systemsmedia_common
researchProduct

Construction and optimality of a special class of balanced designs

2006

The use of balanced designs is generally advisable in experimental practice. In technological experiments, balanced designs optimize the exploitation of experimental resources, whereas in marketing research experiments they avoid erroneous conclusions caused by the misinterpretation of interviewed customers. In general, the balancing property assures the minimum variance of first-order effect estimates. In this work the authors consider situations in which all factors are categorical and minimum run size is required. In a symmetrical case, it is often possible to find an economical balanced design by means of algebraic methods. Conversely, in an asymmetrical case algebraic methods lead to e…

Mathematical optimizationOrthogonality (programming)Computer scienceHeuristic (computer science)Property (programming)Settore SECS-S/02 - Statistica Per La Ricerca Sperimentale E TecnologicaManagement Science and Operations Researchbalancingnearly orthogonalarraytwo- and three-level designsoptimalityEmpirical researchMinimum-variance unbiased estimatorEconometricsinteraction estimabilityAlgebraic numberSafety Risk Reliability and QualityMarketing researchCategorical variableasymmetrical (mixed-level) design
researchProduct

Applying fuzzy Particle Swarm Optimization to Multi-unit Double Auctions

2010

Abstract In the context of Quadratic Programming Problems, we use a fuzzy Particle Swarm Optimization (PSO) algorithm to analyze a Multi-unit Double Auction (MDA) market. We give also a Linear Programming (LP) based upper bound to help the decision maker in dealing with constraints in the mathematical model. In the computational study, we evaluate our algorithm and show that it is a feasible approach for processing bids and calculating assignments.

Mathematical optimizationParticle Swarm Optimization fuzzy numbers mathematical programming quadratic assignment problemInformation Systems and ManagementLinear programmingQuadratic assignment problemStrategy and ManagementMechanical EngineeringParticle swarm optimizationManagement Science and Operations ResearchSettore MAT/05 - Analisi MatematicaFuzzy numberQuadratic programmingMulti-swarm optimizationSettore MAT/09 - Ricerca OperativaEngineering (miscellaneous)MetaheuristicActive set methodMathematics
researchProduct

Average flow constraints and stabilizability in uncertain production-distribution systems

2009

We consider a multi-inventory system with controlled flows and uncertain demands (disturbances) bounded within assigned compact sets. The system is modelled as a first-order one integrating the discrepancy between controlled flows and demands at different sites/nodes. Thus, the buffer levels at the nodes represent the system state. Given a long-term average demand, we are interested in a control strategy that satisfies just one of two requirements: (i) meeting any possible demand at each time (worst case stability) or (ii) achieving a predefined flow in the average (average flow constraints). Necessary and sufficient conditions for the achievement of both goals have been proposed by the aut…

Mathematical optimizationStochastic stabilityControl and OptimizationComputer scienceSCHEDULING POLICIESUNKNOWN INPUTSInventory control; Robust controlRobust controlUncertain systemsUncertain demandsManagement Science and Operations ResearchControl strategies; Inventory systems; Uncertain demands; Worst caseStability (probability)Distribution systemMULTI-INVENTORY SYSTEMSControl theoryProduction (economics)Inventory control Robust control Stochastic stabilityAverage costInventory systemsMathematicsInventory controlStochastic processControl strategiesApplied MathematicsWorst caseNETWORKSControllabilityFlow (mathematics)Bounded functionProduction controlRobust controlSettore MAT/09 - Ricerca OperativaMANUFACTURING SYSTEMS
researchProduct

Il Mediterraneo come arena della formazione e della ricerca

2010

Mediterraneo Formazione RicercaSettore ICAR/21 - Urbanistica
researchProduct

Zur Methodenfrage bei der Erforschung von Mündlichkeit am Beispiel von Projektarbeit in DaF

2009

In dem vorliegenden Beitrag sollen an den Forschungsgegenstand Mündlichkeit methodologische Überlegungen geknüpft und im Projektunterricht an einem Einzelfall exemplifiziert werden. Damit siedelt sich diese Abhandlung im Rahmen der in der DaF-Forschung seit einigen Jahren geführten Methodendiskussion an und vertieft hier insbesondere die Auseinandersetzung mit qualitativen Ansätzen.

Metodologia della ricerca empirica competenza parlare lavoro di progetto
researchProduct