Results 31 to 40 of about 4,258,467 (384)

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

open access: yesIEEE Access, 2022
We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals $K_{\mathrm{max}}^{a}$ is the ...
Michel Kulhandjian   +5 more
doaj   +1 more source

Computing Optimal Experimental Designs via Interior Point Method [PDF]

open access: yes, 2012
In this paper, we study optimal experimental design problems with a broad class of smooth convex optimality criteria, including the classical A-, D- and p th mean criterion.
Lu, Zhaosong, Pong, Ting Kei
core   +2 more sources

One kind power mean of the hybrid Gauss sums

open access: yesOpen Mathematics, 2018
In this paper, we use the analysis method and the properties of trigonometric sums to study the computational problem of one kind power mean of the hybrid Gauss sums. After establishing some relevant lemmas, we give an exact computational formula for it.
Lan Qi, Wenpeng Zhang
doaj   +1 more source

HDP Algorithms for Trajectory Tracking and Formation Control of Multi-Agent Systems

open access: yesIEEE Access, 2022
A heuristic dynamic programming (HDP) algorithm for trajectory tracking and formation control of multi-agent systems (MAS) is presented in this paper. The selected HDP method allows for an online optimal control design. The multi-agent control problem is
Ernesto F. M. Ferreira   +2 more
doaj   +1 more source

Computing with Formulas [PDF]

open access: yes, 2020
In this chapter, we will go one step beyond the Hello, World! example of the first chapter, and introduce programming with mathematical formulas. Such formulas are essential parts of most programs written for scientific applications, and they are also useful for introducing the concept of variables, which is a fundamental part of all programming ...
openaire   +1 more source

On the hybrid power mean of two kind different trigonometric sums

open access: yesOpen Mathematics, 2019
The main purpose of this paper is using the analytic method, the properties of trigonometric sums and Gauss sums to study the computational problem of one kind hybrid power mean involving two different trigonometric sums, and give an interesting ...
Zhuoyu Chen, Wenpeng Zhang
doaj   +1 more source

Onboard Processing of Synthetic Aperture Radar Backprojection Algorithm in FPGA

open access: yesIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2022
Synthetic aperture radar is a microwave technique to extracting image information of the target. Electromagnetic waves that are reflected from the target are acquired by the aircraft or satellite receivers and sent to a ground station to be processed by ...
David Mota   +6 more
doaj   +1 more source

Grounding-line flux formula applied as a flux condition in numerical simulations fails for buttressed Antarctic ice streams

open access: yesThe Cryosphere, 2018
. Currently, several large-scale ice-flow models impose a condition on ice flux across grounding lines using an analytically motivated parameterisation of grounding-line flux. It has been suggested that employing this analytical expression alleviates the
R. Reese, R. Winkelmann, G. Gudmundsson
semanticscholar   +1 more source

The formula-controlled logical computer “Stanislaus” [PDF]

open access: yesMathematics of Computation, 1960
The evaluation of a formula of propositional calculus is considerably simplified if this formula is written in the parenthesis-free notation of the Warsaw School, [1]. The Warsaw notation may be formulated in the following way: There are symbols for operations, e.g.: N for negation; K for conjunction; A for disjunction; E for equivalence; C for ...
openaire   +1 more source

Formulas for series computations [PDF]

open access: yesApplicable Algebra in Engineering, Communication and Computing, 1992
Let \(K\) be a field of characteristic 0, \(\overline K\) an algebraic closure of \(K\) and \(K(x)\) the rational function field in one variable \(x\) over \(K\). The paper describes an algorithm that computes for an element \(f\) of \(K(x)\) for each \(n\in\mathbb N\) and \(m\in\{1,\dots,n\}\) a univariate polynomial \(B_{nm}\) over \(K\) whose roots ...
openaire   +1 more source

Home - About - Disclaimer - Privacy