Search results for " programmi"

showing 10 items of 1629 documents

Hierarchical Evolutionary Algorithms and Noise Compensation via Adaptation

2007

Hierarchical Evolutionary Algorithms (HEAs) are Nested Algorithms composed by two or more Evolutionary Algorithms having the same fitness but different populations. More specifically, the fitness of a Higher Level Evolutionary Algorithm (HLEA) is the optimal fitness value returned by a Lower Level Evolutionary Algorithm (LLEA). Due to their algorithmic formulation, the HEAs can be efficiently implemented in Min-Max problems. In this chapter the application of the HEAs is shown for two different Min-Max problems in the field of Structural Optimization. These two problems are the optimal design of an electrical grounding grid and an elastic structure. Since the fitness of a HLEA is given by a…

Human-based evolutionary computationComputer scienceCultural algorithmGenetic algorithmEvolutionary algorithmMemetic algorithmInteractive evolutionary computationAlgorithmEvolutionary computationEvolutionary programming
researchProduct

Prediction of BOD5 content of the inflow to the treatment plant using different methods of black box - the case study

2020

The publication presents the possibility of modeling in a 1 d advance of the content of organic compounds in the influent wastewater to the treatment plant, where the content of these compounds is determined by both the biochemical and chemical oxygen demand. To predict the quality of the wastewater at the inflow a set of indicators where used to make measurements on a daily basis. In order to develop statistical models 3 methods where used, namely: multivariate adaptive regression splines (MARS), boosted trees (BT), and genetic programming (GP). The carried-out calculations showed that, to calculate the BOD5 there can only be used models developed on the basis of the value of daily wastewa…

HydrologyBoosted treesWastewater treatment plant (WWTP)Black boxOrganic compoundsBOD5Content (measure theory)Environmental scienceMultivariate adaptive regression splinesInflowCODGenetic programmingDESALINATION AND WATER TREATMENT
researchProduct

Estimación mediante programación genética de los patrones del suelo humectantes para el riego por goteo

2012

Drip irrigation is considered as one of the most efficient irrigation systems. Knowledge of the soil wetted perimeter arising from infiltration of water from drippers is important in the design and management of efficient irrigation systems. To this aim, numerical models can represent a powerful tool to analyze the evolution of the wetting pattern during irrigation, in order to explore drip irrigation management strategies, to set up the duration of irrigation, and finally to optimize water use efficiency. This paper examines the potential of genetic programming (GP) in simulating wetting patterns of drip irrigation. First by considering 12 different soil textures of USDA–SCS soil texture t…

Hydrologysoil texture triangleIrrigationHydrusnumerical modelsinfiltraciónSoil textureHYDRUS 2Dmodelos numéricosDrip irrigationinfiltrationtriángulo de texturas del suelosoil texture triangle.Wetted perimeterInfiltration (hydrology)LoamSettore AGR/08 - Idraulica Agraria E Sistemazioni Idraulico-Forestaligenetic programmingprogramación genéticaWettingnumerical modelAgronomy and Crop ScienceMathematics
researchProduct

Steiner configurations ideals: Containment and colouring

2021

Given a homogeneous ideal I&sube

HypergraphSteiner systemsCurrent (mathematics)General MathematicsIdeals of points Monomial ideals Steiner systems Symbolic powers of ideals Waldschmidt constantideals of points0102 computer and information sciencesCommutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryMonomial idealsFOS: MathematicsComputer Science (miscellaneous)Mathematics - Combinatorics13F55 13F20 14G50 51E10 94B270101 mathematicsAlgebraic Geometry (math.AG)Engineering (miscellaneous)MathematicsSymbolic powers of idealsmonomial idealsContainment (computer programming)ConjectureIdeal (set theory)Mathematics::Commutative Algebralcsh:Mathematics010102 general mathematicslcsh:QA1-939Mathematics - Commutative AlgebraIdeals of pointsWaldschmidt constantComplement (complexity)Settore MAT/02 - AlgebraSteiner systemCover (topology)010201 computation theory & mathematicssymbolic powers of idealsIdeals of points; Monomial ideals; Steiner systems; Symbolic powers of ideals; Waldschmidt constantCombinatorics (math.CO)Settore MAT/03 - Geometriamonomial ideals ideals of points symbolic powers of ideals Waldschmidt constant Steiner systems
researchProduct

Analysis of the IEEE 802.11e EDCA Under Statistical Traffic

2006

Many models have been proposed to analyze the performance of the IEEE 802.11 distributed coordination function (DCF) and the IEEE 802.11e enhanced distributed coordination function (EDCA) under saturation condition. To analyze DCF under statistical traffic, Foh and Zukerman introduce a model that uses Markovian Framework to compute the throughput and delay performance. In this paper, we analyze the protocol service time of EDCA mechanism and introduce a model to analyze EDCA under statistical traffic using Markovian Framework. Using this model, we analyze the throughput and delay performance of EDCA mechanism under statistical traffic.

IEEE 802Computer sciencebusiness.industryQuality of serviceComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSMarkov processWireless local area networks (WLAN)ThroughputDistributed coordination functionThroughputComputer Science::OtherComputer Science::Performancebackoff algorithmsymbols.namesakeWireless lanComputer Science::Networking and Internet ArchitecturesymbolsbusinessThroughput (business)Protocol (object-oriented programming)Computer network
researchProduct

Capacity and Energy-Consumption Optimization for the Cluster-Tree Topology in IEEE 802.15.4

2011

International audience; 802.15.4 proposes to use a cluster-tree hierar- chy to organize the transmissions in Wireless Sensor Networks. In this letter, we propose a framework to analyze formally the capacity and the energy consumption of this structure. We derive a Mixed Integer Linear Programming (MILP) formulation to obtain a topology compliant with the standard. This formulation provides the optimal solution for the network capacity: this con- stitutes an upper bound for any distributed algorithms permitting to construct a cluster-tree. This framework can also be used to evaluate the capacity and to compare quantitatively different cluster-tree algorithms.

IEEE 802.15.4Mathematical optimizationLinear programming[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]Computer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Topology (electrical circuits)02 engineering and technologyTopologyNetwork topologyChannel capacity[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringInteger programmingIEEE 802.15[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]MILP[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]capacity020206 networking & telecommunicationsEnergy consumption[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]020202 computer hardware & architectureComputer Science ApplicationsDistributed algorithmModeling and Simulationcluster-treeWireless sensor network
researchProduct

Clustering with Terracotta

2008

Masteroppgave i informasjons- og kommunikasjonsteknologi 2008 – Universitetet i Agder, Grimstad In today’s java community, modern enterprise application products have more constraints and requirements then ever. High availability, application scalability and also good performance are required, which means an application is needed to be deployed on multiple JVMs, in other words, it has to be clustered or distributed. It is essential for the application to scale out well, has better performance and less complexity during development of clustering. This master thesis focuses on clustering with Terracotta which is a JVM level clustering technique. First I start analyzing the complexity when an …

IKT590VDP::Mathematics and natural science: 400::Information and communication science: 420::Theoretical computer science programming languages and programming theory: 421
researchProduct

Quantitative colorimetric-imaging analysis of nickel in iron meteorites.

2011

A quantitative analytical imaging approach for determining the nickel content of metallic meteorites is proposed. The approach uses a digital image of a series of standard solutions of the nickel-dimethylglyoxime coloured chelate and a meteorite sample solution subjected to the same treatment as the nickel standards for quantitation. The image is processed with suitable software to assign a colour-dependent numerical value (analytical signal) to each standard. Such a value is directly proportional to the analyte concentration, which facilitates construction of a calibration graph where the value for the unknown sample can be interpolated to calculate the nickel content of the meteorite. The…

INGENIERIA DE LA CONSTRUCCIONbusiness.product_categoryCost effectivenessCalibration curveEconomicsAstronomyAnalytical chemistryImaging analysisStandard solutionCalibration graphsAnalytical ChemistryStandard solutionsDigital imageIron meteoritesSpectro-photometric methodSoftwareNickelCost benefit analysisNational Institutes of HealthProcess engineeringDigital cameraChemistryNumerical valuesMeteoroidsCamerasImageJChemistryAnalytical equipmentPublic domain softwaresSpectrophotometryMeteoriteMeasuring instrumentsColorimetrySpectrophotometersStandardsAnalyte concentrationSample (material)IronColorCost effectivenessArticleColorimetric analysisInstrumentation (computer programming)Digital imageCCDbusiness.industryAnalytical signalsColorimetric-imaging analysisDimethylglyoximeSample solutionVisible spectrophotometrybusinessInstrumentsMeteoritesTalanta
researchProduct

An Iconic Framework for Learning the Art of Programming

2016

The integration of programming teachings, in all levels of education, highlights the need to acquire the art of programming for each individual student through versatile tools based on specific cognitive methods. Diversified linguistic metaphors have to be adopted by the developing frame, in order to highlight the qualities of each student. Therefore, a framework, oriented to learning the art of programming, must foster polychrome constructs representations, a number of data structures and an intuitive interfaces in order to make easier to understand the evolution of the algorithm that have to be developed. The following contribution will present a theoretical formalization of a framework f…

Iconic Language Visual Programming Language Unified Modeling Language Graphical Language Coding ProgrammingSettore INF/01 - Informatica
researchProduct

Benchmarking open data efforts through indices and rankings: Assessing development and contexts of use

2022

Abstract This paper aims to provide a broad perspective on the development of benchmarking open data efforts through indices and rankings over the years, both at the level of countries and allowing for a cross-country comparison. The methodology follows a systematic search for the relevant resources, their classification and identification of six open data benchmarks to be further analyzed, the identification of their key components through decomposition, their description, and identifying the similarities and differences. Three major groups of indices and four periods that characterize the efforts to benchmark and measure the development of open data are identified, where the first measure…

Identification (information)Measure (data warehouse)Open dataIndex (economics)Computer Networks and CommunicationsComputer scienceBenchmark (surveying)Rank (computer programming)Openness to experienceBenchmarkingElectrical and Electronic EngineeringData scienceTelematics and Informatics
researchProduct