Search results for " Programming"

showing 10 items of 1616 documents

Nesting Problems : Exact and Heuristic Algorithms

2013

Nesting problems are two-dimensional cutting and packing problems involving irregular shapes. This thesis is focused on real applications on Nesting problems such as the garment industry or the glass cutting. The aim is to study different mathematical methodologies to obtain good lower bounds by exact procedures and upper bounds by heuristic algorithms. The core of the thesis is a mathematical model, a Mixed Integer Programming model, which is adapted in each one of the parts of the thesis. This study has three main parts: first, an exact algorithm for Nesting problems when rotation for the pieces is not allowed; second, an Iterated Greedy algorithm to deal with more complex Nesting problem…

nestingcutting and packing:MATEMÁTICAS::Investigación operativa::Programación entera [UNESCO]integer programming:MATEMÁTICAS::Investigación operativa [UNESCO]UNESCO::MATEMÁTICAS::Investigación operativaUNESCO::MATEMÁTICAS::Investigación operativa::Programación entera
researchProduct

A Multi-Objective Design Approach for the c Chart Considering Taguchi Loss Function

2014

The present paper proposes a multi-objective design approach for the c chart, considering in the optimization process of the chart parameters both the statistical and the economic objectives. In particular, the minimization of the hourly total quality related costs is the considered objective to carry out the economic goal, whereas the statistical objective is reached by the minimization the out-of-control average run length of the chart. A mixed integer non-linear constrained mathematical model is formulated to solve the treated multi-objective optimization problem, whereas the Pareto optimal frontier is described by the «-constraint method. In order to show the employment of the proposed …

non-linear constrained mathematical programming ModelTaguchi loss functione-constraint methodstatistical process controlPareto optimal frontiermulti-objective optimization problemSettore ING-IND/16 - Tecnologie E Sistemi Di Lavorazione
researchProduct

Continuous models combining slacks-based measures of efficiency and super-efficiency

2022

AbstractIn the framework of data envelopment analysis (DEA), Tone (Eur J Oper Res 130(3):498–509, 2001) introduced the slacks-based measure (SBM) of efficiency, which is a nonradial model that incorporates all the slacks of the evaluated decision-making units (DMUs) into their efficiency scores, unlike classical radial efficiency models. Next, Tone (Eur J Oper Res 143(1):32–41, 2002) developed the SBM super-efficiency model in order to differentiate and rank efficient DMUs, whose SBM efficiency scores are always 1. However, as pointed out by Chen (Eur J Oper Res 226(2):258–267, 2013), some interpretation problems arise when the so-called super-efficiency projections are weakly efficient, le…

nonlinear programmingsuper-inefficiencydata envelopment analysisUNESCO::CIENCIAS TECNOLÓGICASManagement Science and Operations Researchsuper-efficiencyCentral European Journal of Operations Research
researchProduct

Modeling epidemics through ladder operators

2020

Highlights • We propose an operatorial model to describe epidemics. • The model describes well the asymptotic numbers of the epidemics. • Ladder operators are used to model exchanges between the “actors” of the system.

operatorial modelCoronavirus disease 2019 (COVID-19)Computer scienceSevere acute respiratory syndrome coronavirus 2 (SARS-CoV-2)General MathematicsGeneral Physics and Astronomy01 natural sciencesMeasure (mathematics)Quantitative Biology::OtherArticle010305 fluids & plasmasOperator (computer programming)Simple (abstract algebra)0103 physical sciencesApplied mathematicsQuantitative Biology::Populations and EvolutionLimit (mathematics)Quantitative Biology - Populations and Evolution010301 acousticsSettore MAT/07 - Fisica MatematicaApplied MathematicsPopulations and Evolution (q-bio.PE)Statistical and Nonlinear PhysicsComputer Science::Social and Information NetworksTransformation (function)Ladder operatorspreading of newsFOS: Biological sciences( H ρ ) -induced dynamicChaos, Solitons, and Fractals
researchProduct

Asymptotic Lipschitz regularity for tug-of-war games with varying probabilities

2018

We prove an asymptotic Lipschitz estimate for value functions of tug-of-war games with varying probabilities defined in $\Omega\subset \mathbb R^n$. The method of the proof is based on a game-theoretic idea to estimate the value of a related game defined in $\Omega\times \Omega$ via couplings.

osittaisdifferentiaaliyhtälötPure mathematicsComputer Science::Computer Science and Game TheoryTug of war010102 general mathematicslocal Lipschitz estimatesLipschitz continuity01 natural sciencesnormalized p(x)-laplaciandynamic programming principle010104 statistics & probabilityMathematics - Analysis of PDEsFOS: Mathematicspeliteoria91A05 91A15 91A50 35B65 35J60 35J92stochastic games0101 mathematicsValue (mathematics)AnalysisAnalysis of PDEs (math.AP)Mathematicsstokastiset prosessit
researchProduct

Diverse partner selection with brood recombination in genetic programming

2018

The ultimate goal of learning algorithms is to find the best solution from a search space without testing each and every solution available in the search space. During the evolution process new solutions (children) are produced from existing solutions (parents), where new solutions are expected to be better than existing solutions. This paper presents a new parent selection method for the crossover operation in genetic programming. The idea is to promote crossover between two behaviourally (phenotype) diverse parents such that the probability of children being better than their parents increases. The relative phenotype strengths and weaknesses of pairs of parents are exploited to find out i…

partner selectionkoneoppiminenbrood recombinationgeneettiset algoritmitmonimuotoisuusgenetic programmingevoluutiolaskenta
researchProduct

Need for speed? Exploring the relative importance of patents and utility models among German firms

2017

Despite the wide use of two-tiered patent systems (patents and utility models (UMs)), there is little empirical evidence about how often UMs are actually used, what kind of firms use them to protect their intellectual property, and how firms rank them relative to patents. We offer such an analysis using data from Germany. We find that larger firms are more likely to use both protection methods. Moreover, a short life cycle of products and services is associated with an increased likelihood to use UMs. The features and functioning of the German UM system are of broader interest because it has been a benchmark for several second tier patent protection systems around the world. peerReviewed

patentsIntellectual propertyGermanManagement of Technology and InnovationBenchmark (surveying)Germany0502 economics and businessEconomics050207 economicsEmpirical evidenceintellectual property strategyta512Utility modelta511Public economics05 social sciencesRank (computer programming)patenttijärjestelmäthyödyllisyysmallitShort lifelanguage.human_languagetwo-tiered patent systemutility modellanguagePatentpatentitPatent systemGeneral Economics Econometrics and Finance050203 business & managementEconomics of Innovation and New Technology
researchProduct

Hard x-ray photoelectron spectroscopy: a snapshot of the state-of-the-art in 2020

2021

Journal of physics / Condensed matter 33(23), 233001 (1-44) (2021). doi:10.1088/1361-648X/abeacd

photoemission spectroscopyPhotoemission spectroscopyComputer sciencephotoelectron spectroscopy02 engineering and technology021001 nanoscience & nanotechnologyCondensed Matter Physics01 natural sciencesEngineering physics530X-ray photoelectron spectroscopyhard x-ray photoelectron spectroscopy0103 physical sciencesSnapshot (computer storage)General Materials Scienceddc:530Instrumentation (computer programming)010306 general physics0210 nano-technologyDen kondenserade materiens fysik
researchProduct

Interactively Learning the Preferences of a Decision Maker in Multi-objective Optimization Utilizing Belief-rules

2020

Many real life problems can be modelled as multiobjective optimization problems. Such problems often consist of multiple conflicting objectives to be optimized simultaneously. Multiple optimal solutions exist to these problems, and a single solution cannot be said to be the best without preferences given by a domain expert. Preferences can be used to find satisfying solutions: optimal solutions, which best match the expert’s preferences. To model the preferences of the expert, and aid him/her in finding satisfying solutions, a novel method is proposed. The method utilizes machine learning combined with belief-rule based systems to adaptively train a belief rule based system to learn a domai…

preference modellingmallintaminenOptimization problemLinear programmingComputer scienceProcess (engineering)päätöksentukijärjestelmät02 engineering and technologyMachine learningcomputer.software_genreMulti-objective optimizationbelief-rule based systemsdecision makingoptimointiConflicting objectives020204 information systems0202 electrical engineering electronic engineering information engineeringPreference (economics)business.industryDecision makermonitavoiteoptimointiExpert systemmachine learningkoneoppiminenmultiple objective optimization020201 artificial intelligence & image processingArtificial intelligencebusinesscomputerPython2020 IEEE Symposium Series on Computational Intelligence (SSCI)
researchProduct

Linear Types for Higher Order Processes with First Class Directed Channels

1995

Abstract We present a small programming language for distributed systems based on message passing processes. In contrast to similar languages, channels are one-to-one connections between a unique sender and a unique receiver process. Process definitions and channels are first class values and the topology of process systems can change dynamically. The operational semantics of the language is defined by means of graph rewriting rules. A static type system based on the notion of linear types ensures that channels are always used as one-to-one connections.

process algebrasGraph rewritinggraph rewritingTheoretical computer scienceGeneral Computer ScienceProcess (engineering)Computer scienceMessage passinglinear typesTopology (electrical circuits)Communicating sequential processesType (model theory)Operational semanticsTheoretical Computer Scienceoperational semanticsComputer Science::Programming Languagesdistributed programmingcomputerComputer Science(all)Computer Science::Information Theorycomputer.programming_languageElectronic Notes in Theoretical Computer Science
researchProduct