Search results for "programming."

showing 10 items of 3035 documents

A grid representation for distributed virtual environments

2004

Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environments (DVE) very common nowadays. The architecture and behavior of these systems are very similar to new grid computing applications where concepts such as sharing and high scalability are extremely exploited. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective DVE system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3-D avatars) to the arbiters (servers) in the system. As an alternative to the ad-hoc heuristic proposed in the l…

Computació en núvolRealitat virtualbusiness.industryHeuristic (computer science)Computer scienceDistributed computingEvolutionary algorithmcomputer.software_genreGridInteractive programmingVirtual realityClient-server systemsGrid computingServerEmbedded systemScalabilityGrid computingSystems architecturePerformance evaluationHeuristicsbusinessOpen systemscomputerArquitectura client-servidor (Informàtica):Informàtica::Arquitectura de computadors [Àrees temàtiques de la UPC]
researchProduct

Exploring parallel capabilities of an innovative numerical method for recovering image velocity vectors field

2010

In this paper an efficient method devoted to estimate the velocity vectors field is investigated. The method is based on a quasi-interpolant operator and involves a large amount of computation. The operations characterizing the computational scheme are ideal for parallel processing because they are local, regular and repetitive. Therefore, the spatial parallelism of the process is studied to rapidly proceed in the computation on distributed multiprocessor systems. The process has shown to be synchronous, with good task balancing and requiring a small amount of data transfer.

ComputationNumerical analysisProcess (computing)MultiprocessingField (computer science)Computational scienceComputer Science ApplicationsSettore MAT/08 - Analisi NumericaOperator (computer programming)Parallel processing (DSP implementation)Modeling and SimulationModelling and SimulationImage velocity vectors field Quasi-interpolant operator B-spline functions Distributed multiprocessor systemsAlgorithmMathematicsData transmissionMathematical and Computer Modelling
researchProduct

Uniqueness of solutions for some elliptic equations with a quadratic gradient term

2008

We study a comparison principle and uniqueness of positive solutions for the homogeneous Dirichlet boundary value problem associated to quasi-linear elliptic equations with lower order terms. A model example is given by −Δu + λ |∇u| 2 u r = f (x) ,λ , r >0. The main feature of these equations consists in having a quadratic gradient term in which singularities are allowed. The arguments employed here also work to deal with equations having lack of ellipticity or some dependence on u in the right hand side. Furthermore, they could be applied to obtain uniqueness results for nonlinear equations having the p-Laplacian operator as the principal part. Our results improve those already known, even…

Computational MathematicsNonlinear systemControl and OptimizationOperator (computer programming)Quadratic equationControl and Systems EngineeringMathematical analysisPrincipal partGravitational singularityUniquenessBoundary value problemMathematicsTerm (time)ESAIM: Control, Optimisation and Calculus of Variations
researchProduct

An Analysis of the Influence of Noneffective Instructions in Linear Genetic Programming

2020

Abstract Linear Genetic Programming (LGP) represents programs as sequences of instructions and has a Directed Acyclic Graph (DAG) dataflow. The results of instructions are stored in registers that can be used as arguments by other instructions. Instructions that are disconnected from the main part of the program are called noneffective instructions, or structural introns. They also appear in other DAG-based GP approaches like Cartesian Genetic Programming (CGP). This article studies four hypotheses on the role of structural introns: noneffective instructions (1) serve as evolutionary memory, where evolved information is stored and later used in search, (2) preserve population diversity, (3)…

Computational MathematicsTheoretical computer scienceDataflowComputer scienceLinear genetic programmingPopulation diversitySymbolic regressionCartesian genetic programmingDirected acyclic graphBiological EvolutionAlgorithmsNeutral mutationEvolutionary Computation
researchProduct

Parallelization of adaptive MC integrators

2019

Abstract Monte Carlo (MC) methods for numerical integration seem to be embarrassingly parallel on first sight. When adaptive schemes are applied in order to enhance convergence however, the seemingly most natural way of replicating the whole job on each processor can potentially ruin the adaptive behaviour. Using the popular VEGAS-Algorithm as an example an economic method of semi-micro parallelization with variable grain-size is presented and contrasted with another straightforward approach of macro-... Title of program: pvegas.c Catalogue Id: ADGU_v1_0 Nature of problem Monte Carlo (MC) methods for numerical integration seem to be embarassingly parallel on first sight. When adaptive schem…

Computational MethodComputational PhysicsFOS: Electrical engineering electronic engineering information engineeringProgramming LanguageComputer HardwareSoftware
researchProduct

HAWK 2.0: A Monte Carlo program for Higgs production in vector-boson fusion and Higgs strahlung at hadron colliders

2019

Abstract The Monte Carlo integrator HAWK provides precision predictions for Higgs production at hadron colliders in vector-boson fusion and Higgs strahlung, i.e. in production processes where the Higgs boson is Attached to WeaK bosons. The fully differential predictions include the full QCD and electroweak next-to-leading-order corrections. Results are computed as integrated cross sections and as binned distributions for important hadron-collider observables. Title of program: HAWK, version 2.0 Catalogue Id: AEWT_v1_0 Nature of problem Precision calculation of cross sections and differential distributions for Higgs-boson production in vector-boson fusion and Higgs strahlung at the LHC as de…

Computational MethodComputational PhysicsHigh Energy Physics::PhenomenologyComputer Science::Programming LanguagesHigh Energy Physics::ExperimentElementary Particles
researchProduct

FlexibleSUSY—A spectrum generator generator for supersymmetric models

2019

This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018) Abstract We introduce FlexibleSUSY, a Mathematica and C++ package, which generates a fast, precise C++ spectrum generator for any SUSY model specified by the user. The generated code is designed with both speed and modularity in mind, making it easy to adapt and extend with new features. The model is specified by supplying the superpotential, gauge structure and particle content in a SARAH model file; specific boundary conditions e.g. at the GUT, weak or intermediate scales are defined in a separate F... Title of program: FlexibleSUSY Catalogue Id: AEVI_v1_0 Nature of problem Determini…

Computational PhysicsFOS: Electrical engineering electronic engineering information engineeringProgramming LanguagesInterdisciplinary sciencesOtherComputer HardwareSoftwareElementary Particles
researchProduct

AMYR 2: A new version of a computer program for pair potential calculation of molecular associations

2019

Abstract AMYR is a computer program for the calculation of molecular associations using Fraga's pairwise atom - atom potential. The interaction energy is evaluated through a 1/R expansion. The electrostatic energy is calculated through either the one-centre-per atom or the three-centres-per atom model by Hunter and Sanders. A pairwise dispersion energy term is included in the potential and corrected by a damping function. The program carries out energy minimizations through variable metric methods. Th... Title of program: AMYR 2 Catalogue Id: ADIW_v1_0 Nature of problem The program determines the optimum separation and relative orientation of two interacting molecular systems through a mini…

Computational PhysicsMolecular PhysicsComputer Science::Programming LanguagesBiological SciencesMolecular BiologyPhysical Chemistry
researchProduct

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Computational complexity theoryLogiccomputational complexityguarded fragmentsatisfiability problemBinary numberTheoretical Computer ScienceCombinatoricsArts and Humanities (miscellaneous)Computer Science::Logic in Computer ScienceClosure operatorEquivalence (formal languages)MathematicsDiscrete mathematicssatisfiability problemcomputational complexitydecidabilityequivalence closureSatisfiabilityDecidabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (computer programming)Hardware and ArchitectureTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSBoolean satisfiability problemSoftwareJournal of Logic and Computation
researchProduct

An advanced variant of an interpolatory graphical display algorithm

2004

In this paper an advanced interpolatory graphical display algorithm based on cardinal B-spline functions is provided. It is well-known that B-spline functions are a flexible tool to design various scale rapresentations of a signal. The proposed method allows to display without recursion a function at any desiderable resolution so that only initial data and opportune vectors weight are involved. In this way the structure of the algorithm is independent across the scale and a computational efficiency is reached. In this paper mono and bi-dimensional vectors weight generated by means of centered cubic cardinal B-spline functions have been supplied. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Wei…

Computational complexity theoryScale (ratio)Computer scienceSIGNAL (programming language)Structure (category theory)Recursion (computer science)Ocean EngineeringGraphical displayFunction (mathematics)Resolution (logic)Algorithm
researchProduct