نتایج جستجو برای: truncation map

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

2002
P. de Forcrand O. Philipsen

We present results on the QCD phase diagram for small densities without reweighting. Our simulations are performed with an imaginary chemical potential µI for which the fermion determinant is positive. On an 8 3 × 4 lattice with 2 flavors of staggered quarks, we map out the pseudo-critical temperature Tc(µI). For µI /T ≤ π/3, this is an analytic function whose Taylor expansion converges rapidly...

2013
KUEI-NUAN LIN

In this paper we describe the defining equations of the Rees algebra and the special fiber ring of a truncation I of a complete intersection ideal in a polynomial ring over a field with homogeneous maximal ideal m. To describe explicitly the Rees algebra R(I) in terms of generators and relations we map another Rees ring R(M) onto it, where M is the direct sum of powers of m. We compute a Gröbne...

2009

Cystinosin is predicted to comprise seven transmembrane domains but its actual topology remains unknown. As a first step to address this issue, we used a classical gene fusion approach in which a topology reporter is fused to various truncated fragments of the membrane protein of interest in order to map the topological orientation of a set of truncation sites along the polypeptide (see Manoil ...

2016
Heyuan Wang H. Y. Wang

A five-mode truncation of the Navier-Stokes equations for a two-dimensional incompressible fluid on a torus is studied. Its stationary solutions and stability are presented; the existence of attractor and the global stability of the system are discussed. The whole process, which shows a chaos behavior approached through an involved sequence of bifurcations with the changing of Reynolds number, ...

1994
Chen-Kuei Yang Ja-Chen Lin Wen-Hsiang Tsai

A new color image compression technique based on moment-preserving and block truncation coding is proposed. An input image is divided into nonoverlapping blocks and each block pixel is assigned one of two representative colors, which are computed with analytic formulas derived from preserving certain moments in the block. A bit map is then generated for each block to represent the pixels’ color...

2010
Davide Penazzi

We proceed with an analysis of 1-basedness for bounded hyperdefinable groups of the form G/G where G = E(K) is the semialgebraic connected component of the K-points of an elliptic curve over a saturated real closed field K, or G a truncation of E(K); we follow the method developed in [1]. We then relate the map G→ G/G with the algebraic geometric notion of reduction, and we characterize 1-based...

2014
Chang-Ming Wu Yu-Chen Hu Kuo-Yu Liu Jun-Chou Chuang

In this paper, a simple active image authentication scheme for the compressed images of block truncation coding (BTC) is proposed. In this scheme, the authentication codes of the compressed blocks are generated from the random value induced by the random seed. The authentication code of each compressed block is embedded into the bit map. The bit length of each authentication code can be chosen ...

2009
Bill Casselman

One of the most basic tools in the theory of automorphic forms is the truncation operator, first defined in [Langlands: 1966] but elaborated in later work of Jim Arthur (particularly [Arthur: 1978] and [Arthur: 1980]). In spite of its fundamental nature, there are many mysteries about it. In this article I’ll not dispel many of these, but I’ll at least motivate its definition by relating it to ...

2009
Tom Kennedy

Real space renormalization group maps, e.g., the majority rule transformation, map Ising type models to Ising type models on a coarser lattice. We show that each coefficient of the renormalized Hamiltonian in the lattice gas variables depends on only a finite number of values of the renormalized Hamiltonian. We introduce a method which computes the values of the renormalized Hamiltonian with hi...

Journal: :journal of sciences, islamic republic of iran 2014
v. fakoor

kernel density estimators are the basic tools for density estimation in non-parametric statistics.  the k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in  which  the  bandwidth  is varied depending on the location of the sample points. in this paper‎, we  initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...

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

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