نتایج جستجو برای: and qp reducing

تعداد نتایج: 16845329  

2005
Jian-Rong Zhang Hong Jiang Yang Yang U E Vincent

We examine the collective behaviour of coupled Duffing Hamiltonian systems (HS) and show the existence of measure synchronization (MS) in the quasi-periodic (QP) and -chaotic states. We show that the dynamics of coupled Duffing Hamiltonians exhibit a transition to coherent invariant measure, their orbits sharing the same phase space as the coupling strength is increased. Transitions from QP mea...

2010
Raf Cluckers Georges Comte François Loeser

We prove that a (globally) subanalytic function f : X ⊂ Qp → Qp which is locally Lipschitz continuous with some constant C is piecewise (globally on each piece) Lipschitz continuous with possibly some other constant, where the pieces can be taken to be subanalytic. We also prove the analogous result for a subanalytic family of functions fy : Xy ⊂ Qp → Qp depending on p-adic parameters. The stat...

2012
Aditya Bhaskara Moses Charikar Rajsekar Manokaran Aravindan Vijayaraghavan

Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form ∑ i6=j aijxixj . QP captures many known combinatorial optimization problems, and assuming the unique games conjecture, semidefinite programming techniques give optimal approximation algorithms. We extend this body of work by initiating the study of Quadratic Programming problems where the...

Journal: :The Behavioral and brain sciences 2013
Bradley C Love

Pothos & Busemeyer (P&B) provide a compelling case that quantum probability (QP) theory is a better match to human judgment than is classical probability (CP) theory. However, any theory (QP, CP, or other) phrased solely at the computational level runs the risk of being underconstrained. One suggestion is to ground QP accounts in mechanism, to leverage a wide range of process-level data.

2010
Sam Lichtenstein

Remark. Apropos of reduction mod p: If V is a Qp-vector space and G ⊂ GL(V ) is a compact subgroup, then there exists a G-fixed lattice in V for the following reason. Pick any lattice L ⊂ V . Then the G-stabilizer of L is open and of finite index. So Λ = ∑ g∈G gL ⊂ V is also a lattice, and it is definitely G-stable. The same works with coefficients in any finite extension of Qp, or even in Qp (...

2013
Taisei Hosoido Futoshi Mori Keita Kiyoto Takashi Takagi Yukari Sano Megumi Goto Katsumi Nakajima Naomi Wada

Bipedal (Bp) locomotion is one of the most characteristic motor behaviors in human beings. Innate quadrupedal (Qp) four-legged animals also often walk bipedally. The walking posture, however, is significantly different between the two. This suggests that although both have a potential to walk bipedally, however, the human has a body scheme suitable for Bp locomotion, probably its skeletal syste...

2008
Tobias Schmidt

Given a compact p-adic Lie group G over a finite unramified extension L/Qp let GL/Qp be the product over all Galois conjugates of G. We construct an exact and faithful functor from admissible G-Banach space representations to admissible locally L-analytic GL/Qp -representations that coincides with passage to analytic vectors in case L = Qp. On the other hand, we study the functor ”passage to an...

Journal: :IEICE Transactions 2011
Xiaocong Jin Jun Sun Yiqing Huang Jia Su Takeshi Ikenaga

sequence method TS (%) BDPSNR (dB) BDBR (%) QP=16 QP=20 QP=24 QP=28 mobile qcif Jlee 2.0 6.6 14.4 28.1 -0.02 0.28 our 31.9 32.1 34.2 39.6 -0.04 0.70 hall qcif Jlee 2.0 5.3 28.4 43.5 0.00 -0.01 our 39.4 42.3 45.5 47.9 -0.03 0.94 container cif Jlee 8.1 39.7 48.1 53.9 0.03 -0.76 our 49.3 52.3 53.8 55.5 0.03 -0.79 coastguard cif Jlee 1.3 4.5 13.1 24.6 -0.02 0.30 our 31.3 30.6 32.1 34.4 -0.05 0.86 m...

1992
Kenneth D. Forbus

Abstrac t Qualitative Process theory has been successfully used to model a variety of domain s and in exploring several qualitative reasoning tasks. However, there has been little explicit analysis of where and how it breaks down. The purpose of this paper is to look a t several ways in which QP theory (or implementations of it) currently fail in some way. Two concepts for classifying QP models...

1999
Gary William Flake

Training a support vector machine (SVM) is usually done by mapping the underlying optimization problem into a quadratic programming (QP) problem. Unfortunately, high quality QP solvers are not readily available, which makes research into the area of SVMs difficult for the those without a QP solver. Recently, the Sequential Minimal Optimization algorithm (SMO) was introduced [1, 2]. SMO reduces ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید