Search results for "Train"

showing 10 items of 4562 documents

Density as a constraint and the separation of internal excitation energy in TDHF

1985

We present a fast and efficient constrained Hartree-Fock iteration scheme which constraints the complete density distribution to remain constant. The scheme is particularly suited to a coordinate- or momentum-space representation. The technique is applied to separate the collective and the internal energy in a propagating TDHF state. We study the behavior of these two energies in an16O+16O collision.

Constraint (information theory)PhysicsNuclear and High Energy PhysicsClassical mechanicsInternal energyNuclear TheoryNuclear fusionConstant (mathematics)CollisionRepresentation (mathematics)ExcitationEnergy (signal processing)Computational physicsZeitschrift f�r Physik A Atoms and Nuclei
researchProduct

Random Variables Recorded Under Mutually Exclusive Conditions: Contextuality-by-Default

2014

We present general principles underlying analysis of the dependence of random variables (outputs) on deterministic conditions (inputs). Random outputs recorded under mutually exclusive input values are labeled by these values and considered stochastically unrelated, possessing no joint distribution. An input that does not directly influence an output creates a context for the latter. Any constraint imposed on the dependence of random outputs on inputs can be characterized by considering all possible couplings (joint distributions) imposed on stochastically unrelated outputs. The target application of these principles is a quantum mechanical system of entangled particles, with directions of …

Constraint (information theory)SpinsJoint probability distributionControl theoryContext (language use)Statistical physicsMutually exclusive eventsRandom variableKochen–Specker theoremMathematicsSpin-½
researchProduct

Editorial message

2006

Geometric Computing and Reasoning (GCR) is a new track of SAC and it is dedicated to the recent trends in the domain of geometric constraint solving and automated, or computer aided, deduction in geometry.

Constraint (information theory)Theoretical computer scienceComputer scienceQuantitative Biology::Tissues and OrgansTrack (rail transport)Geometric computingComputingMethodologies_COMPUTERGRAPHICSDomain (software engineering)Proceedings of the 2006 ACM symposium on Applied computing
researchProduct

A Learning-Automata Based Solution for Non-equal Partitioning: Partitions with Common GCD Sizes

2021

The Object Migration Automata (OMA) has been used as a powerful tool to resolve real-life partitioning problems in random Environments. The virgin OMA has also been enhanced by incorporating the latest strategies in Learning Automata (LA), namely the Pursuit and Transitivity phenomena. However, the single major handicap that it possesses is the fact that the number of objects in each partition must be equal. Obviously, one does not always encounter problems with equally-sized groups (When the true underlying problem has non-equally-sized groups, the OMA reports the best equally-sized solution as the recommended partition.). This paper is the pioneering attempt to relax this constraint. It p…

Constraint (information theory)Transitive relationTheoretical computer scienceLearning automataComputer scienceGreatest common divisorState spaceSpace (commercial competition)Partition (database)Automaton
researchProduct

How to apply the Kirkwood–Buff theory to individual species in salt solutions

2013

It is generally assumed that the Kirkwood–Buff (KB) theory cannot be applied to anions and cations individually in a solution, as one cannot simulate this system in an open ensemble due to the electroneutrality constraint. By applying our recently derived KB theory for closed systems, we show that one does have access to single-ion properties in Molecular Dynamics. Our findings are supported by simulations for a model of a salt solution in which particles interact with WCA potentials, as well as for the NaCl/water system using the Particle Mesh Ewald technique for electrostatics.

Constraint (information theory)chemistry.chemical_classificationMolecular dynamicsSalt solutionchemistryComputational chemistryParticle MeshGeneral Physics and AstronomySalt (chemistry)ThermodynamicsPhysical and Theoretical ChemistryElectrostaticsChemical Physics Letters
researchProduct

Argumentation graphs with constraint-based reasoning for collaborative expertise

2018

International audience; Collaborative processes are very important in telemedicine domain since they allow for making right decisions in complex situations with multidisciplinary staff. When modelling these collaborative processes, some inconsistencies can appear. In semantic modelling (conceptual graphs), these inconsistencies are verified using constraints. In this work, collaborative processes are represented using an argumentation system modelled in a conceptual graph formalism where inconsistencies could be particular bad attack relation between arguments. To overcome these inconsistencies, two solutions are proposed. The first one is to weight the arguments evolving in the argumentati…

Constraint based reasoningmedical deontologyComputer Networks and CommunicationsComputer sciencedomain0206 medical engineeringMédecine humaine et pathologieArgumentation theory02 engineering and technologyInconsistenciesWeightingdecision makingArgumentation theoryAutreMultidisciplinary approachframeworksCredibilityconceptual graphs0202 electrical engineering electronic engineering information engineeringinconsistenciesCompetence (human resources)Health professionalsManagement scienceMedical deontology[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]decision-makingargumentation theory16. Peace & justice020601 biomedical engineeringWeightingassignmentConceptual graphsHardware and ArchitectureConceptual graph020201 artificial intelligence & image processingweightingteleexpertiseDecision makingpreference-based argumentationmanagement[SDV.MHEP]Life Sciences [q-bio]/Human health and pathologySoftwareFuture Generation Computer Systems
researchProduct

Decision Support Systems Based on CLP Approach in SMEs

2006

The paper focuses on a selected class of decision problems related with the production flow planning in SMEs, particularly in new production orders. Verification of orders gives a possibility to evaluate whether resources capacity of a manufacturer is balanced with the orderer's requirements. The class of decision problems under analysis is included in the scope of organizational production preparation and can be naturally determined by available CLP (Constraint Logic Programming) tools. The approach proposed in the paper is based on establishment of an interface which facilitates its task oriented use. The system has been presented on the basis of a sample order execution in a manufacturer…

Constraint logic programmingDecision support systemClass (computer programming)Operations researchScope (project management)Computer scienceInterface (Java)Constraint satisfaction problemDecision problemFlow planningDecision supportConstraint logic programmingSystems engineeringProduction (economics)Constraint satisfaction problem2006 IEEE Conference on Emerging Technologies and Factory Automation
researchProduct

Dynamic factorial graphical models for dynamic networks

2014

Dynamic networks models describe a growing number of important scientific processes, from cell biology and epidemiology to sociology and finance. Estimating dynamic networks from noisy time series data is a difficult task since the number of components involved in the system is very large. As a result, the number of parameters to be estimated is typically larger than the number of observations. However, a characteristic of many real life networks is that they are sparse. For example, the molec- ular structure of genes make interactions with other components a highly-structured and, therefore, a sparse process. Penalized Gaussian graphical models have been used to estimate sparse networks. H…

Constraint optimization Dynamic networks Gaussian graphical models Penalized likelihood Symmetry models Time-course dataSettore SECS-S/01 - Statistica
researchProduct

Optimal switches in multi-inventory systems

2007

Given a switched multi-inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function related to the cost of the resets. We discuss a family of instances that can be solved in polynomial time by linear programming. We do this by introducing a set-covering formulation with a totally unimodular constraint matrix.

Constraint theoryLinear programmingOptimizationSchedulingSet theorySettore MAT/09 - Ricerca Operativa
researchProduct

Estimation of recombinant protein production in Pichia pastoris base don a constraint-based model

2012

[EN] A previously validated constraint based model and possibilistic MFA have been used to design a simple estimator of protein production rate in Pichia pastoris cultures. A structured model of the yeast P. pastoris metabolism is used to predict the balance of key energetic equivalents such as ATP from available measurements, mainly substrate consumption, gases exchange rates and biomass specific growth. It has been shown that ATP flux can be related to biomass growth and protein productivity specific rates by linear regression. Cross-validation has been applied for robust parameter fitting on the basis of chemostat, steady-state experimental conditions. In this way, protein estimation can…

Constraint-based modelbiologyUncertaintyfood and beveragesEstimatorBiomassProtein productivity predictionChemostatPossibilistic metabolic flux analysisBioinformaticsbiology.organism_classificationIndustrial and Manufacturing EngineeringYeastINGENIERIA DE SISTEMAS Y AUTOMATICAComputer Science ApplicationsPichia pastorisConstraint (information theory)Pichia pastorisControl and Systems EngineeringModeling and SimulationLinear regressionBiological systemFlux (metabolism)Mathematics
researchProduct