نتایج جستجو برای: bound ary value problems
تعداد نتایج: 1420797 فیلتر نتایج به سال:
until now single values of irr are traditionally used to estimate the time value of cash flows. since uncertainty exists in estimating cost data, the resulting decision may not be reliable. the most commonly cited drawbacks to using the internal rate of return in evaluatton of deterministic cash flow streams is the possibility of multiple conflicting internal rates of return. in this paper we p...
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the quality of these relaxations by studying the approximation ratio of sparse eigenvalue relaxations. Our results are used to improve the performance of branch-and-bound algorithms to produce exact solutions to subset se...
Within the scope of this investigation, MATLAB simulation code for digital video broadcasting–for satellite–second generation (DVB-S2) has been constructed. Forward error correction (FEC) rates as 3/5, 2/3, and 3/4 across additive white Gaussian noise (AWGN) Rayleigh fading channels are used to evaluate system's performance, mainly while working on quadrature phase-shift keying (QPSK), 8-ary (8...
In this paper, we extend the construction by Yu and Gong for families of M-ary sequences of period q − 1 from the array structure of an M-ary Sidelnikov sequence of period q2 − 1, where q is a prime power and M|q − 1. The construction now applies to the cases of using any period qd − 1 for 3 ≤ d < (1/2)(√q − (2/√q)+ 1) and q > 27. The proposed construction results in a family of M-ary seqeunces...
Following [1], in this note we compute the average number of protected points in all k-ary trees with n internal points.
POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most approaches (including point-based and policy iteration techniques) operate by refining a lower bound of the optimal value function. Several approaches (e.g., HSVI2, SARSOP, grid-based approaches and online forward search) also refine an upper boun...
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. In this paper, we introduce a general constr...
we describe under various conditions abelian subgroups of the automorphism group $mathrm{aut}(t_{n})$ of the regular $n$-ary tree $t_{n}$, which are normalized by the $n$-ary adding machine $tau =(e, dots, e,tau )sigma _{tau }$ where $sigma _{tau }$ is the $n$-cycle $left( 0,1, dots, n-1right) $. as an application, for $n=p$ a prime number, and for $n=4$, we prove that...
New designs for families of sequences over GF ( ) with low cross correlation, balance property, and large linear span are presented. The key idea of the new designs is to use short -ary sequences of period with the two-level autocorrelation function together with the interleaved structure to construct a set of long sequences with the desired properties. The resulting sequences are interleaved s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید