Search results for "Peace"

showing 10 items of 705 documents

Nicotine enhances antisaccade performance in schizophrenia patients and healthy controls

2013

Abstract Nicotine has been proposed to be a cognitive enhancer, particularly in schizophrenia patients. So far, the published studies of nicotine effects on antisaccade performance in schizophrenia patients only tested participants who were deprived smokers. Thus, we aimed to test both smoking and non-smoking patients as well as healthy controls in order to extend previous findings. Moreover, we employed a paradigm using standard and delayed trials. We hypothesized that, if nicotine is a genuine cognitive enhancer, its administration would improve antisaccade performance both in smoking and non-smoking participants. A total of 22 patients with schizophrenia (12 smokers and 10 non-smokers) a…

Malemedicine.medical_treatmentStatistics as TopicNicotine2738 Psychiatry and Mental Health0302 clinical medicine2736 Pharmacology (medical)Pharmacology (medical)Nicotinic AgonistsCotinineCross-Over StudiesSmokingCognitionMiddle Aged16. Peace & justice3. Good healthPsychiatry and Mental healthNicotinic acetylcholine receptor3004 PharmacologySchizophreniaFemaleSmoking statusPsychologymedicine.drugClinical psychologyAdultNicotinemedicine.medical_specialtyAdolescentNicotine patch610 Medicine & healthAdministration CutaneousYoung Adult03 medical and health sciencesDouble-Blind MethodInternal medicineReaction TimeSaccadesmedicineHumansEffects of sleep deprivation on cognitive performanceBeneficial effectsPharmacologyAnalysis of Variancemedicine.disease030227 psychiatryElectrooculography10054 Clinic for Psychiatry Psychotherapy and PsychosomaticsSchizophrenia030217 neurology & neurosurgery
researchProduct

A multi-parametric evolution strategies algorithm for vehicle routing problems

2007

Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …

Mathematical optimizationDynamic Source RoutingSDG 16 - PeaceComputer scienceEqual-cost multi-path routingEvolution strategiesArtificial IntelligenceVehicle routing problemVehicle routing problemHeuristicsDestination-Sequenced Distance Vector routingTriangular routingStatic routingDistribution managementPolicy-based routingSDG 16 - Peace Justice and Strong InstitutionsGeneral EngineeringPath vector protocol/dk/atira/pure/sustainabledevelopmentgoals/peace_justice_and_strong_institutionsJustice and Strong InstitutionsComputer Science ApplicationsDistance-vector routing protocolLink-state routing protocolMultipath routingHeuristicsAlgorithmExpert systems with applications
researchProduct

Modelling agricultural risk in a large scale positive mathematical programming model

2020

International audience; Mathematical programming has been extensively used to account for risk in farmers' decision making. The recent development of the positive mathematical programming (PMP) has renewed the need to incorporate risk in a more robust and flexible way. Most of the existing PMP-risk models have been tested at farm-type level and for a very limited sample of farms. This paper presents and tests a novel methodology for modelling risk at individual farm level in a large scale model, called individual farm model for common agricultural policy analysis (IFM-CAP). Results show a clear trade-off between including and excluding the risk specification. Albeit both alternatives provid…

Mathematical optimizationEconomics and EconometricsScale (ratio)Computer scienceComputationprogrammation mathématique positive020209 energyexpected utilitySample (statistics)highest posterior density02 engineering and technologypolitique agricole communerisk and uncertainty0202 electrical engineering electronic engineering information engineeringEuropean common agricultural policyExpected utility hypothesisagricultureEstimationrisque et incertitude2. Zero hungerbusiness.industry020208 electrical & electronic engineering[SHS.ECO]Humanities and Social Sciences/Economics and Finance16. Peace & justicemodèle de fermePMPComputer Science ApplicationsAgriculturebusinessCommon Agricultural PolicyScale modelpositive mathematical programmingInternational Journal of Computational Economics and Econometrics
researchProduct

A homography formulation to the 3pt plus a common direction relative pose problem

2014

International audience; In this paper we present an alternative formulation for the minimal solution to the 3pt plus a common direction relative pose prob-lem. Instead of the commonly used epipolar constraint we use the homog-raphy constraint to derive a novel formulation for the 3pt problem. This formulation allows the computation of the normal vector of the plane defined by the three input points without any additional computation in addition to the standard motion parameters of the camera. We show the working of the method on synthetic and real data sets and compare it to the standard 3pt method and the 5pt method for relative pose estima-tion. In addition we analyze the degenerate condi…

Mathematical optimizationPlane (geometry)Epipolar geometryComputation[ INFO.INFO-RB ] Computer Science [cs]/Robotics [cs.RO][INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO]Motion (geometry)16. Peace & justiceConstraint (information theory)[INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]NormalPoseMathematicsHomography (computer vision)
researchProduct

A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

2010

In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function to eliminate violations of the time window constraint as well as the capacity constraint from offspring solutions generated by the EAX operator have proven essential to the heuristic's performance. Experimental results on Solomon's and Gehring and Homberger benchmarks demonstrate that our algorithm outperforms previous approaches and is able to improve 184 best-known solutions out of 356 instance…

Mathematical optimizationSDG 16 - PeaceGeneral Computer ScienceHeuristic (computer science)EconomicsSDG 16 - Peace Justice and Strong InstitutionsCrossoverMemetic algorithmManagement Science and Operations ResearchEAX mode/dk/atira/pure/sustainabledevelopmentgoals/peace_justice_and_strong_institutionsPenalty functionVehicle routingJustice and Strong InstitutionsModeling and SimulationVehicle routing problemMemetic algorithmPenalty methodEnhanced Data Rates for GSM EvolutionRouting (electronic design automation)AlgorithmTime windowsMathematicsComputers and Operations Research
researchProduct

Using the witness method to detect rigid subsystems of geometric constraints in CAD

2010

International audience; This paper deals with the resolution of geometric constraint systems encountered in CAD-CAM. The main results are that the witness method can be used to detect that a constraint system is over-constrained and that the computation of the maximal rigid subsystems of a system leads to a powerful decomposition method. In a first step, we recall the theoretical framework of the witness method in geometric constraint solving and extend this method to generate a witness. We show then that it can be used to incrementally detect over-constrainedness. We give an algorithm to efficiently identify all maximal rigid parts of a geometric constraint system. We introduce the algorit…

Mathematical optimization[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulationrigidity theorygeometric constraints solvingComputation020207 software engineeringCADJacobian matrix02 engineering and technologyW-decompositionwitness configuration16. Peace & justiceWitness[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulationsymbols.namesakeJacobian matrix and determinant0202 electrical engineering electronic engineering information engineeringsymbols020201 artificial intelligence & image processingRigidity theoryAlgorithmAlgorithmsMathematics
researchProduct

Conformal equivalence of visual metrics in pseudoconvex domains

2017

We refine estimates introduced by Balogh and Bonk, to show that the boundary extensions of isometries between smooth strongly pseudoconvex domains in $\C^n$ are conformal with respect to the sub-Riemannian metric induced by the Levi form. As a corollary we obtain an alternative proof of a result of Fefferman on smooth extensions of biholomorphic mappings between pseudoconvex domains. The proofs are inspired by Mostow's proof of his rigidity theorem and are based on the asymptotic hyperbolic character of the Kobayashi or Bergman metrics and on the Bonk-Schramm hyperbolic fillings.

Mathematics - Differential GeometryComputer Science::Machine LearningPure mathematicsGeneral Mathematics32T15 32Q45 32H40 53C23 53C17Rigidity (psychology)Conformal mapMathematical proofComputer Science::Digital Libraries01 natural sciencesdifferentiaaligeometriaStatistics::Machine LearningCorollaryMathematics - Metric Geometry0103 physical sciencesFOS: MathematicsMathematics::Metric GeometryComplex Variables (math.CV)0101 mathematicsEquivalence (formal languages)kompleksifunktiotMathematicsMathematics - Complex VariablesMathematics::Complex Variables010102 general mathematicsMetric Geometry (math.MG)16. Peace & justiceDifferential Geometry (math.DG)Bounded functionComputer Science::Mathematical Software010307 mathematical physicsMathematische Annalen
researchProduct

Optimal maps and exponentiation on finite dimensional spaces with Ricci curvature bounded from below

2013

We prove existence and uniqueness of optimal maps on $RCD^*(K,N)$ spaces under the assumption that the starting measure is absolutely continuous. We also discuss how this result naturally leads to the notion of exponentiation.

Mathematics - Differential GeometryExponentiationLower Ricci bounds; Optimal maps; Optimal transport; RCD spaces01 natural sciencesMeasure (mathematics)Combinatoricssymbols.namesakeMathematics - Metric GeometryRCD spacesSettore MAT/05 - Analisi MatematicaFOS: MathematicsOptimal transportMathematics::Metric GeometryUniqueness0101 mathematicsLower Ricci bounds[MATH.MATH-MG]Mathematics [math]/Metric Geometry [math.MG]Ricci curvatureMathematicsDiscrete mathematics010102 general mathematicsMetric Geometry (math.MG)Absolute continuity16. Peace & justice010101 applied mathematicsMathematics::LogicDifferential geometryDifferential Geometry (math.DG)Fourier analysisBounded functionsymbolsOptimal mapsGeometry and Topology
researchProduct

Geodesic X-ray tomography for piecewise constant functions on nontrapping manifolds

2017

We show that on a two-dimensional compact nontrapping manifold with strictly convex boundary, a piecewise constant function is determined by its integrals over geodesics. In higher dimensions, we obtain a similar result if the manifold satisfies a foliation condition. These theorems are based on iterating a local uniqueness result. Our proofs are elementary.

Mathematics - Differential GeometryGeodesicinverse problemsGeneral Mathematics010102 general mathematicsGeodesic mapMathematical analysisBoundary (topology)16. Peace & justice01 natural sciencesManifoldFoliationinversio-ongelmatDifferential Geometry (math.DG)0103 physical sciencesPiecewiseFOS: Mathematics010307 mathematical physicsConstant functionMathematics::Differential Geometry0101 mathematicsConvex functionMathematics::Symplectic GeometryMathematics
researchProduct

Approximation by mappings with singular Hessian minors

2018

Let $\Omega\subset\mathbb R^n$ be a Lipschitz domain. Given $1\leq p<k\leq n$ and any $u\in W^{2,p}(\Omega)$ belonging to the little H\"older class $c^{1,\alpha}$, we construct a sequence $u_j$ in the same space with $\operatorname{rank}D^2u_j<k$ almost everywhere such that $u_j\to u$ in $C^{1,\alpha}$ and weakly in $W^{2,p}$. This result is in strong contrast with known regularity behavior of functions in $W^{2,p}$, $p\geq k$, satisfying the same rank inequality.

Mathematics - Differential GeometryHessian matrix35B99 46T10Monge-Ampère equationRank (differential topology)Space (mathematics)01 natural sciencesHessian minorssymbols.namesakeMathematics - Analysis of PDEsLipschitz domainFOS: MathematicsMathematics::Metric GeometryAlmost everywhere0101 mathematicsMathematicsosittaisdifferentiaaliyhtälötDiscrete mathematicsSequenceApplied Mathematicsta111010102 general mathematics16. Peace & justiceFunctional Analysis (math.FA)nonlinear approximationMathematics - Functional Analysis010101 applied mathematicsDifferential Geometry (math.DG)symbolsfunktionaalianalyysiAnalysisAnalysis of PDEs (math.AP)Nonlinear Analysis
researchProduct