نتایج جستجو برای: g multiplier
تعداد نتایج: 450914 فیلتر نتایج به سال:
In this study, a C~K band frequency synthesizer used in broadband electronic warfare equipment was designed, developed, and the measurement results were presented. The structure of designed generates signal up to 6 GHz using only direct digital synthesizer(DDS) without mixer or multiplier. For signals above frequency, uses addition, variable sampling DDS circuit improve quality by reducing spur...
Intermediate goods are another produced factor of production, like capital. Considering intermediate goods in production function makes multiplier be even larger than the one. In this paper, based on the approach of Jones (2007,2010) We computed multipliers by intermediate goods. For this purpose, we used Input – Output table of Statistical Center of Iran (base year: 2001). Finding show that 10...
A locally integrable function m(ξ, η) defined on R × R is said to be a bilinear multiplier on R of type (p1, p2, p3) if Bm(f, g)(x) = Z
The set of all multiplier extensions to the whole group G of a representation of a normal subgroup TV is completely described, and necessary and sufficient conditions are given for equivalence of two such extensions.
The Lagrange multiplier for the kinetic energy e is shown to be −γcm on a singular arc, where γ (g/J) is derived from engine and driveline characteristics and cm ≈ 1. Using this value as an approximation for constrained arcs as well, the cost function is J(s, x) ≈ −γcme + C(s) that yields the residual cost φ(x) = −γcme. The factor β corresponds to the constant Lagrange multiplier for time and i...
Using Lagrange’s multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp. 2003 E...
Multiplication is a basic operation in any signal processing application. Multiplication is the most important one among the four arithmetic operations like addition, subtraction, and division. Multipliers are usually hardware intensive, and the main parameters of concern are high speed, low cost, and less VLSI area. The propagation time and power consumption in the multiplier are always high. ...
The problem of a multiplier ω(n) of the Nörlund means and convex maps of the unit disc is being considered again, but with a multiplier ω(n) of different form then that appeared by Ziad S. Ali in [1]. With this we would have brought up again in a rather unified approach the results of G. Pólya, and I.J. Schonberg in [7], T. Basgoze, J.L. Frank and F.R. Keogh in [3], and Ziad S. Ali in [2]. The ...
Let D be an affine difference set of order n in an abelian group G relative to a subgroup N . Set H̃ = H \ {1, ω}, where H = G/N and ω = ∏ σ∈H σ. Using D we define a two-to-one map g from H̃ to N . The map g satisfies g(σ) = g(σ) and g(σ) = g(σ−1) for any multiplier m of D and any element σ ∈ H̃. As applications, we present some results which give a restriction on the possible order n and the grou...
Each finite p-perfect group G (p a prime) has a universal central p-extension coming from the p part of its Schur multiplier. Serre gave a StiefelWhitney class approach to analyzing spin covers of alternating groups (p = 2) aimed at geometric covering space problems that included their regular realization for the Inverse Galois Problem. A special case of a general result is that any finite simp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید