Search results for "osso"

showing 10 items of 801 documents

Smart molecular/MoS2 Heterostructures Featuring Light and Thermally-Induced Strain Driven by Spin Switching

2020

In this work we exploit the ability of spin-crossover molecules to switch between two spin states, upon the application of external stimuli, to prepare smart molecular/2D heterostructures. Through the chemical design of the hybrid interface, that involves a covalent grafting between the two components, we obtain a hybrid heterostructure formed by spin-crossover nanoparticles anchored on chemically functionalized monolayers of semiconducting MoS2. In the resulting hybrid, the strain generated by the molecular system over the MoS2 layer, as a consequence of a thermal or light-induced spin switching, results in a dramatic and reversible change of its electrical and optical properties. This nov…

Materials scienceSpintronicsSpin statesNanoparticleNanotechnologyHeterojunction02 engineering and technology010402 general chemistry021001 nanoscience & nanotechnology01 natural sciences0104 chemical scienceschemistry.chemical_compoundCondensed Matter::Materials SciencechemistrySpin crossoverMonolayerMolecule0210 nano-technologyMolybdenum disulfide
researchProduct

Bimetallic MnIII–FeII hybrid complexes formed by a functionalized MnIII Anderson polyoxometalate coordinated to FeII: observation of a field-induced …

2015

The synthesis and crystal structure of an Anderson POM functionalized with two 2,6-di(pyrazol-1-yl)-pyridine (1-bpp) ligands are reported (compound 1). High-frequency electron paramagnetic resonance (HF-EPR) and magnetic measurements show that it presents a significant negative axial zero-field splitting and field-induced slow relaxation of magnetization due to the presence of isolated MnIII anisotropic magnetic ions. Complexation of 1 with FeII gives rise to a 2D cationic network formed by Anderson POMs coordinated to two FeII ions through the two tridentate 1-bpp ligands and to other two FeII ions through two oxo ligands in compound 2, and to an anionic polymeric network formed by Anderso…

Materials scienceStereochemistryRelaxation (NMR)General ChemistryCrystal structureLIESSTlaw.inventionCrystallographyMagnetizationlawSpin crossoverPolyoxometalateMaterials ChemistryMoleculeElectron paramagnetic resonanceJournal of Materials Chemistry C
researchProduct

Electroswitching of the single-molecule magnet behaviour in an octahedral spin crossover cobalt(ii) complex with a redox-active pyridinediimine ligand

2020

Thermal-assisted spin crossover and field-induced slow magnetic relaxation coexist in the solid state for the mononuclear cobalt(II) complex with the non-innocent 2,6-bis(N-4-methoxyphenylformimidoyl)pyridine ligand. One-electron oxidation of the paramagnetic low-spin CoII ion (SCo = 1/2) to the diamagnetic low-spin CoIII ion (SCo = 0) leads to the electroswitching of the slow magnetic relaxation in acetonitrile solution.

Materials sciencechemistry.chemical_element02 engineering and technology010402 general chemistry01 natural sciencesCatalysisIonParamagnetismchemistry.chemical_compoundSpin crossoverMaterials ChemistrySingle-molecule magnetAcetonitrileLigandMetals and AlloysGeneral Chemistry021001 nanoscience & nanotechnology3. Good health0104 chemical sciencesSurfaces Coatings and FilmsElectronic Optical and Magnetic MaterialsCrystallographychemistryCeramics and CompositesDiamagnetismCondensed Matter::Strongly Correlated Electrons0210 nano-technologyCobaltChemical Communications
researchProduct

A genetic algorithm for the minimum generating set problem

2016

Graphical abstractDisplay Omitted HighlightsWe propose a novel formulation for the MGS problem based on multiple knapsack.The so-conceived MGS problem is solved by a novel GA.The GA embeds an intelligent construction method and specialized crossover operators.We perform a thorough comparison with regards to state-of-the-art algorithms.The proposal proves to be very competitive, specially for large and hard instances. Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinat…

Mathematical optimization021103 operations researchContinuous knapsack problemCrossover0211 other engineering and technologies02 engineering and technologyCutting stock problemKnapsack problemGenetic algorithm0202 electrical engineering electronic engineering information engineeringSubset sum problem020201 artificial intelligence & image processingGreedy algorithmSoftwareGeneralized assignment problemMathematicsApplied Soft Computing
researchProduct

Multi-objective memetic optimization for the bi-objective obnoxious p -median problem

2018

Abstract Location problems have been studied extensively in the optimization literature, the p-median being probably one of the most tackled models. The obnoxious p-median is an interesting variant that appears in the context of hazardous location. The aim of this paper is to formally introduce a bi-objective optimization model for this problem, in which a solution consists of a set of p locations, and two conflicting objectives arise. On the one hand, the sum of the minimum distance between each client and their nearest open facility and, on the other hand, the dispersion among facilities. Both objective values should be kept as large as possible for a convenient location of dangerous faci…

Mathematical optimization021103 operations researchInformation Systems and Managementbusiness.industryComputer scienceCrossoverFeasible region0211 other engineering and technologiesContext (language use)02 engineering and technologySpace (commercial competition)Management Information SystemsSet (abstract data type)Artificial IntelligenceMutation (genetic algorithm)0202 electrical engineering electronic engineering information engineeringMemetic algorithm020201 artificial intelligence & image processingLocal search (optimization)businessSoftwareKnowledge-Based Systems
researchProduct

Evolutionary multi-objective optimization algorithms for fuzzy portfolio selection

2016

Graphical abstractDisplay Omitted HighlightsWe consider a constrained three-objective optimization portfolio selection problem.We solve the problem by means of evolutionary multi-objective optimization.New mutation, crossover and reparation operators are designed for this problem.They are tested in several algorithms for a data set from the Spanish stock market.Results for two performance metrics reveal the effectiveness of the new operators. In this paper, we consider a recently proposed model for portfolio selection, called Mean-Downside Risk-Skewness (MDRS) model. This modelling approach takes into account both the multidimensional nature of the portfolio selection problem and the requir…

Mathematical optimization021103 operations researchOptimization problemCrossover0211 other engineering and technologiesEvolutionary algorithm02 engineering and technologyFuzzy logicMulti-objective optimization0202 electrical engineering electronic engineering information engineeringExpected returnPortfolio020201 artificial intelligence & image processingAlgorithmSoftwarePossibility theoryMathematicsApplied Soft Computing
researchProduct

An open-source GA framework for optimizing the seismic upgrading design of RC frames through BRBs

2022

Abstract Optimizing seismic upgrading interventions in reinforced concrete (RC) structures is a difficult task, due to the inner non-linearity of the analyses usually performed. Additionally, it is well known that the displacement demand to the structure depends from the mass and stiffness of the system, and consequently its definition cannot be made a-priori. This paper presents the application of a soft-computing method -i.e. Genetic Algorithm (GA)- for the shaping optimization of code-compliant seismic upgrading interventions on plane RC frames through Buckling-Restrained Braces (BRB). The metaheuristic procedure allows to minimize the cost while ensuring the required safety level, witho…

Mathematical optimizationComputer scienceMonte Carlo methodCrossoverStability (learning theory)StiffnessPython (programming language)Settore ICAR/09 - Tecnica Delle CostruzioniGenetic algorithmMutation (genetic algorithm)medicineBRB Genetic algorithm Optimization Seismic upgradingmedicine.symptomcomputerMetaheuristicCivil and Structural Engineeringcomputer.programming_languageEngineering Structures
researchProduct

A double genetic algorithm for the MRCPSP/max

2011

This paper presents a heuristic solution procedure for a very general resource-constrained project scheduling problem. Here, multiple execution modes are available for the individual activities of the project. In addition, minimum as well as maximum time lags between different activities may be given. The objective is to determine a mode and a start time for each activity such that the temporal and resource constraints are met and the project duration is minimised. Project scheduling problems of this type occur e.g. in process industries. The heuristic is a two-phased genetic algorithm with different representation, fitness, crossover operator, etc., in each of them. One of the contribution…

Mathematical optimizationGeneral Computer ScienceOperations researchHeuristicbusiness.industryComputer scienceCrossoverSchedule (project management)Management Science and Operations ResearchWork in processScheduling (computing)Modeling and SimulationGenetic algorithmResource managementProject managementbusinessComputers & Operations Research
researchProduct

Developing Domain-Knowledge Evolutionary Algorithms for Network-on-Chip Application Mapping

2013

This paper addresses the Network-on-Chip (NoC) application mapping problem. This is an NP-hard problem that deals with the optimal topological placement of Intellectual Property cores onto the NoC tiles. Network-on-Chip application mapping Evolutionary Algorithms are developed, evaluated and optimized for minimizing the NoC communication energy. Two crossover and one mutation operators are proposed. It is analyzed how each optimization algorithm performs with every genetic operator, in terms of solution quality and convergence speed. Our proposed operators are compared with state-of-the-art genetic operators for permutation problems. Finally, the problem is approached in a multi-objective w…

Mathematical optimizationMutation operatorTheoretical computer scienceComputer Networks and CommunicationsComputer scienceQuality control and genetic algorithmsCrossoverEvolutionary algorithmGenetic operatorMulti-objective optimizationNetwork on a chipArtificial IntelligenceHardware and ArchitectureSimulated annealingGenetic algorithmGenetic representationSoftwareMicroprocessors and Microsystems
researchProduct

A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

2010

In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function to eliminate violations of the time window constraint as well as the capacity constraint from offspring solutions generated by the EAX operator have proven essential to the heuristic's performance. Experimental results on Solomon's and Gehring and Homberger benchmarks demonstrate that our algorithm outperforms previous approaches and is able to improve 184 best-known solutions out of 356 instance…

Mathematical optimizationSDG 16 - PeaceGeneral Computer ScienceHeuristic (computer science)EconomicsSDG 16 - Peace Justice and Strong InstitutionsCrossoverMemetic algorithmManagement Science and Operations ResearchEAX mode/dk/atira/pure/sustainabledevelopmentgoals/peace_justice_and_strong_institutionsPenalty functionVehicle routingJustice and Strong InstitutionsModeling and SimulationVehicle routing problemMemetic algorithmPenalty methodEnhanced Data Rates for GSM EvolutionRouting (electronic design automation)AlgorithmTime windowsMathematicsComputers and Operations Research
researchProduct