Search results for "SAC"

showing 10 items of 3337 documents

The Multiple Multidimensional Knapsack with Family-Split Penalties

2021

Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties (MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and Multidimensional Knapsack Problems. It reckons with items categorized into families and where if an individual item is selected to maximize the profit, all the items of the same family must be selected as well. Items belonging to the same family can be assigned to different knapsacks; however, in this case, split penalties are incurred. This problem arises in resource management of distributed computing contexts and Service Oriented Architecture environments. An exact algorithm based on the exploitation of a specific combi…

Mathematical optimizationCombinatorial optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceKnapsack Problem0211 other engineering and technologiesBenders’ cuts; Combinatorial optimization; Integer programming; Knapsack Problems; Resource assignmentResource assignment02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing Engineering0502 economics and businessInteger programming050210 logistics & transportation021103 operations research05 social sciencesBenders’ cutInteger programmingSolverKnapsack ProblemsBenders’ cutsExact algorithmKnapsack problemModeling and SimulationCombinatorial optimizationEuropean Journal of Operational Research
researchProduct

A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

2002

Abstract In this paper we develop several heuristic algorithms for the two-dimensional cutting problem (TDC) in which a single stock sheet has to be cut into a set of small pieces, while maximising the value of the pieces cut. They can be considered to be general purpose algorithms because they solve the four versions of the TDC: weighted and unweighted, constrained and unconstrained. We begin by proposing two constructive procedures based on simple bounds obtained by solving one-dimensional knapsack problems. We then use these constructive algorithms as building blocks for more complex procedures. We have developed a greedy randomised adaptive search procedure (GRASP) which is very fast an…

Mathematical optimizationGeneral Computer ScienceGRASPSearch procedureManagement Science and Operations ResearchConstructiveTabu searchCutting stock problemKnapsack problemModeling and SimulationConstructive algorithmsHeuristicsAlgorithmMathematicsComputers & Operations Research
researchProduct

On Using a Hierarchy of Twofold Resource Allocation Automata to Solve Stochastic Nonlinear Resource Allocation Problems

2007

Recent trends in AI attempt to solve difficult NP-hard problems using intelligent techniques so as to obtain approximately-optimal solutions. In this paper, we consider a family of such problems which fall under the general umbrella of "knapsack-like" problems, and demonstrate how we can solve all of them fast and accurately using a hierarchy of Learning Automata (LA). In a multitude of real-world situations, resources must be allocated based on incomplete and noisy information, which often renders traditional resource allocation techniques ineffective. This paper addresses one such class of problems, namely, Stochastic Non-linear Fractional Knapsack Problems. We first present a completely …

Mathematical optimizationHierarchyLearning automataKnapsack problemComponent (UML)Convergence (routing)Resource allocationField (computer science)MathematicsAutomaton
researchProduct

Learning Automata-Based Solutions to Stochastic Nonlinear Resource Allocation Problems

2009

“Computational Intelligence” is an extremely wide-ranging and all-encompassing area. However, it is fair to say that the strength of a system that possesses “Computational Intelligence” can be quantified by its ability to solve problems that are intrinsically hard. One such class of NP-Hard problems concerns the so-called family of Knapsack Problems, and in this Chapter, we shall explain how a sub-field of Artificial Intelligence, namely that which involves “Learning Automata”, can be used to produce fast and accurate solutions to “difficult” and randomized versions of the Knapsack problem (KP).

Mathematical optimizationNonlinear systemClass (computer programming)Learning automataKnapsack problemContinuous knapsack problemResource allocationStochastic optimizationComputational intelligenceMathematics
researchProduct

Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration

2015

Abstract In this paper, an original formulation of the control problem for optimal PV array reconfiguration, following a Total Cross Tied layout, is proposed. The formulation follows the well-known subset sum problem, which is a special case of the knapsack problem. The reconfiguration is a measure devoted to mitigate the mismatch effect and maximize the output power of small photovoltaic plants under non-homogeneous working conditions. Therefore, reconfiguration means changing the connections of the solar panels adaptively by a dynamic switching matrix. The control system implements an easy dynamic programming algorithm to change the switches layout. The use of the Munkres assignment metho…

Mathematical optimizationRenewable Energy Sustainability and the EnvironmentComputer sciencePhotovoltaic systemMismatch Photovoltaic modules Optimization Reconfiguration.Control reconfigurationPower (physics)Settore ING-IND/33 - Sistemi Elettrici Per L'EnergiaDynamic programmingSettore ING-IND/31 - ElettrotecnicaHungarian algorithmKnapsack problemControl systemSubset sum problemGeneral Materials ScienceSolar Energy
researchProduct

Genomic run-on evaluates transcription rates for all yeast genes and identifies gene regulatory mechanisms

2004

Most studies of eukaryotic gene regulation have been done looking at mature mRNA levels. Nevertheless, the steady-state mRNA level is the result of two opposing factors: transcription rate (TR) and mRNA degradation. Both can be important points to regulate gene expression. Here we show a new method that combines the use of nylon macroarrays and in vivo radioactive labeling of nascent RNA to quantify TRs, mRNA levels, and mRNA stabilities for all the S. cerevisiae genes. We found that during the shift from glucose to galactose, most genes undergo drastic changes in TR and mRNA stability. However, changes in mRNA levels are less pronounced. Some genes, such as those encoding mitochondrial pro…

Mature messenger RNATranscription GeneticRNA StabilityGenes FungalMolecular Sequence DataBiologySaccharomycesTranscripció genèticaTranscription (biology)Gene Expression Regulation FungalGene expressionP-bodiesRNA MessengerMolecular BiologyGenePhylogenyRegulation of gene expressionMessenger RNAGene knockdownGenomeGene Expression ProfilingGalactoseRNA FungalCell BiologyBlotting NorthernMolecular biologyCell biologyGenòmicaGlucose
researchProduct

Polysaccharide remains in Maya mural paintings: is it an evidence of the use of plant gums as binding medium of pigments and additive in the mortar?

2020

A number of monosaccharides characteristic of plant gums were found in paint layers and preparation layers of samples of Maya mural paintings of 10 archaeological sites located in Campeche and Yucatan regions. This finding opens the question about the deliberate use of these organic polymers as additives for improving workability and mechanical properties in the preparation layer mortar and conferring cohesion to the pigments in the paint layer. The study performed by GC-MS has confirmed the presence, in significant amounts, of a series of monosaccharides, being glucose and mannose between the most abundantly found. Nevertheless, the low amount present in most of the samples hindered the qu…

Maya artadditiveArcheologymedia_common.quotation_subjectPlant GumsMuralPolysaccharidePigmentPintura rupestrepigmentBotanyMayaPigments vegetalslcsh:CC1-960media_commonchemistry.chemical_classificationPaintingArthumanitiesPlant pigmentsmonosaccharideschemistryvisual_artmortarvisual_art.visual_art_mediumlcsh:ArchaeologyMortarArt maiabinding medium
researchProduct

Prenatal diagnosis of sacrococcygeal teratomas by two- and three-dimensional ultrasound

2002

We suspected two fetuses of having sacrococcygeal teratomas following initial two-dimensional ultrasound scanning at 18 and 22 weeks' gestation. The fetuses were then scanned with three-dimensional multiplanar surface and three-dimensional orthogonal planar ultrasound to establish a definitive diagnosis. Although we made a presumptive diagnosis in both cases after initial two-dimensional scanning, with three-dimensional ultrasound we were better able to define the degree of involvement of the sacrum and other pelvic structures of prognostic importance. Copyright © 2002 ISUOG

Measurement methodmedicine.medical_specialtyThree dimensional ultrasoundRadiological and Ultrasound Technologybusiness.industryUltrasoundObstetrics and GynecologyPresumptive diagnosisPrenatal diagnosisGeneral MedicineSacrummedicine.diseaseSurgeryReproductive MedicineMedicineRadiology Nuclear Medicine and imagingRadiologyTeratomabusinessUltrasound in Obstetrics and Gynecology
researchProduct

L'arbitratge regi a la ciutat de Xátiva en el context previ a la introducció de la insaculació (1416-1427)

2017

Estudi documental que analitza com, a inicis del regnat d’Alfons el Magnànim, la sistemàtica lluita de bàndols entre el patriciat urbà a la ciutat de Xàtiva va determinar una ingerència règia cada vegada més decidida en les eleccions municipals. En aquest sentit, a partir de fonts arxivístiques reials i municipals, la recerca presenta el marc sociopolític existent en dita ciutat i quines foren les primeres petjades de l’arbitratge monàrquic desenvolupat per dit sobirà. En concret, s’exposen els procediments electorals municipals que es succeïren a Xàtiva des de 1416, el fracàs dels quals conduirà a l’atorgament –per primera vegada a la Corona d’Aragó– del privilegi d’insaculació en 1427. Th…

Medical TerminologyInsaculacióIntervencionisme monàrquicPatriciat urbá:9 - Geografía e historia::93 - Historia. Ciencias auxiliares de la historia. Archivista. Numismática. Paleografía. Diplomática [CDU]Medical Assisting and TranscriptionMedievalismo
researchProduct

Nuclear and chloroplast DNA variation in Cephalaria squamiflora (Dipsacaceae), a disjunct Mediterranean species

2009

Cephalaria squamiflora is a chamaephyte restricted to rupicolous habitats in islands of the Western (Balearic Islands, Sardinia) and Eastern Mediterranean (Crete and few Aegean islands). Four narrowly distributed races (subspp. squamiflora, mediterranea, ebusitana, balearica) have been described to encompass the morphological variation within the species. We have used nuclear ribosomal ITS and cpDNA sequences to assess how the patterns of molecular differentiation are related to taxonomic and geographic boundaries. Extensive intragenomic ITS variation was detected in samples from all territories, the average sequence divergence among cloned ribotypes was 1.339%. The parsimony network of clo…

Mediterranean climateBalearic islandsbiologygovernment.political_districtPlant ScienceDisjunctbiology.organism_classificationDipsacaceaeMonophylyChloroplast DNAEvolutionary biologyBotanygovernmentVicarianceBiological dispersalEcology Evolution Behavior and SystematicsTAXON
researchProduct