Search results for "General Computer Science"

showing 10 items of 895 documents

Dynamical features of forest interactions

2000

Abstract The 3D computer simulations presented here were developed to study at the mesoscopic scale the formation of junctions and their impact on hardening of crystals. The simulations consider the evolution of a dislocation interacting with immobile dislocations in a fcc single crystal of copper where we incorporate well known dislocation interaction mechanisms. From these studies, we deduced a `breaking angle' which characterize the strength of the junctions.

Mesoscopic physicsMaterials scienceGeneral Computer ScienceCondensed matter physicsGeneral Physics and AstronomyGeneral ChemistryCondensed Matter::Mesoscopic Systems and Quantum Hall EffectCondensed Matter::Materials ScienceComputational MathematicsCrystallographyMechanics of MaterialsCondensed Matter::SuperconductivityHardening (metallurgy)General Materials ScienceDislocationSingle crystalThree dimensional modelComputational Materials Science
researchProduct

Car sequencing versus mixed-model sequencing: A computational study

2014

Abstract The paper deals with the two most important mathematical models for sequencing products on a mixed-model assembly line in order to minimize work overload the mixed-model sequencing (MMS) model and the car sequencing (CS) model. Although both models follow the same underlying objective, only MMS directly addresses the work overload in its objective function. CS instead applies a surrogate objective using so-called sequencing rules which restrict labor-intensive options accompanied with the products in the sequence. The CS model minimizes the number of violations of the respective sequencing rules, which is widely assumed to lead to minimum work overload. This paper experimentally co…

Mixed modelInformation Systems and ManagementGeneral Computer ScienceMathematical modelComputer scienceManagement Science and Operations Researchcomputer.software_genreIndustrial and Manufacturing EngineeringScheduling (computing)WeightingModeling and SimulationData miningcomputerSimulationEuropean Journal of Operational Research
researchProduct

An evolutionary approach to multi-objective scheduling of mixed model assembly lines

1999

In this paper a multi-objective genetic algorithm for the scheduling of a mixed model assembly line is proposed, pursuing the line stop time minimisation together with the component usage smoothing. Specific features of the developed GA are step by step random selection of diversified crossover and mutation operators, population control for the substitution of duplicate chromosomes, and in-process updating of GA control parameters. Three different formulation of the fitness function were been tested with some distinct line configurations.

Mixed modelMutation operatorEngineeringMixed Model assembly line; Multiobjective scheduling; Genetic algorithmFitness functionMixed Model assembly lineGeneral Computer Sciencebusiness.industryCrossoverGeneral EngineeringGenetic algorithmMultiobjective schedulingStop timeControl parametersAssembly linebusinessAlgorithmSmoothing
researchProduct

Using Internet videos to learn about controversies: Evaluation and integration of multiple and multimodal documents by primary school students

2020

Abstract In many Internet videos authors appear in front of the camera to present their particular view on a topic. Given the high consumption rate of Internet videos by teenagers, we explored the pros and cons of using these videos to learn about complex topics, compared to learning from textual web pages. Specifically, we studied how 207 primary school students (grades 4–6) evaluated and integrated multiple and multimodal web pages (text or video) while learning about the pros and cons of bottled water. Results showed no major role of modality in students' source memory, as measured by citations in their responses to an integration question and their memory for sources. Nevertheless, moda…

Modality (human–computer interaction)General Computer ScienceMultimediabusiness.industryInternet videos05 social sciences050301 educationprimary school educationmultiple document comprehensionmultimodal informationcomputer.software_genre050105 experimental psychologyEducationWeb pageshallowing hypothesis0501 psychology and cognitive sciencesThe InternetDigital readingbusinessPsychology0503 educationcomputerPeriod (music)Computers & Education
researchProduct

A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

2021

One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over the past 32 years. One of the early stubborn sets works shows how the basic conditions for reduction can be augmented to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a stronger reduction condition and provide extensive new correc…

Model checkingFOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTheoretical computer sciencepartial-order reductionGeneral Computer Sciencestutter equivalenceComputer sciencealgoritmiikkaCorrectness proofsRotation formalisms in three dimensionsTheoretical Computer ScienceLogic in Computer Science (cs.LO)Reduction (complexity)Partial order reductionstubborn setsEquivalence (measure theory)tietojenkäsittelyLTL
researchProduct

Verification of Well-Formed Communicating Recursive State Machines

2008

AbstractIn this paper we introduce a new (non-Turing equivalent) formal model of recursive concurrent programs called well-formed communicating recursive state machines (CRSM). CRSM extend recursive state machines (RSM) by allowing a restricted form of concurrency: a state of a module can be refined into a finite collection of modules (working in parallel) in a potentially recursive manner. Communication is only possible between the activations of modules invoked on the same fork. We study the model-checking problem of CRSM with respect to specifications expressed in a temporal logic that extends CaRet with a parallel operator (ConCaRet). We propose a decision algorithm that runs in time ex…

Model checkingModel checkingTheoretical computer scienceGeneral Computer ScienceComputer scienceInfinite state systemModuloConcurrencyTree automataTheoretical Computer ScienceFormal models of concurrency and recursionTuring machinesymbols.namesakeFormal specificationTemporal logicContext-free specificationsRecursionLinear-time logicsPushdown systemsAbstract interpretationAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESInfinite-state systemsrecursive state machinesymbolsState (computer science)Linear time logicAlgorithmComputer Science(all)
researchProduct

Scatter Search—Wellsprings and Challenges

2006

I came up with the idea of editing this volume in the summer of 2002 while working on the book "Scatter search methodologies and implementations in C" with Manuel Laguna in the University of Colorado at Boulder. There, Fred Glover kindly let me use his office, where I found a copy of the "Tabu Search Methods for Optimization" special issue that he edited in 1988 for the European Journal of Operational Research. This encounter made me realize that Scatter Search has reached a level of maturity as an optimization method that has parallels with what Tabu Search was experiencing in the late eighties. So I thought that the moment was perfect to embark on this project, which has been supported en…

Moment (mathematics)Information Systems and ManagementGeneral Computer ScienceOperations researchComputer scienceModeling and SimulationVolume (computing)Management Science and Operations ResearchMaturity (finance)Industrial and Manufacturing EngineeringTabu searchEuropean Journal of Operational Research
researchProduct

Star-free trace languages

1992

Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.

MonoidPure mathematicsGeneral Computer ScienceAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Star (graph theory)Cone (formal languages)Theoretical Computer ScienceTrace (semiology)Aperiodic graphFormal languageComputer Science::Programming LanguagesCommutative propertyMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Avoiding patterns in irreducible permutations

2016

We explore the classical pattern avoidance question in the case of irreducible permutations, <i>i.e.</i>, those in which there is no index $i$ such that $\sigma (i+1) - \sigma (i)=1$. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary numbers. Also, we present constructive bijections between the set of Motzkin paths of length $n-1$ and the sets of irreducible permutations of length $n$ (respectively fixed point free irreducible involutions of length $2n$) avoiding a pattern $\alpha$ for $\alpha \in \{13…

Motzkin pathFibonacci numberMathematics::CombinatoricsGeneral Computer ScienceSigmaBinary number[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Fixed point[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ConstructiveTheoretical Computer SciencesuccessionCombinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]irreducible permutationinvolutionDiscrete Mathematics and CombinatoricsBijection injection and surjectionPattern avoiding permutationMathematics
researchProduct

Multiple-attribute decision support system based on fuzzy logic for performance assessment

2005

Abstract This paper deals with the problem of assessing the performance of a set of production units, simultaneously considering different kinds of information, yielded by a Data Envelopment Analysis, a qualitative data analysis and an expert assessment. The tool for integrating heterogeneous data is a model that applies fuzzy logic to decision support systems. The results obtained are a holistic performance assessment of each unit of the set and a ranking order of the units.

Multi-attribute decision aiding systemsDecision support systemInformation Systems and ManagementGeneral Computer ScienceComputer sciencemedicine.medical_treatmentDecision treeDecision support systemsManagement Science and Operations Researchcomputer.software_genreFuzzy logicIndustrial and Manufacturing EngineeringDEAmedicineData envelopment analysisExpert evaluationDecision engineeringEvidential reasoning approachIntelligent decision support systemDEA; Decision support systems; Expert evaluation; Fuzzy logic; Multi-attribute decision aiding systemsFuzzy logicModeling and SimulationData miningcomputerDecision analysis cycleDecision analysisEuropean Journal of Operational Research
researchProduct