calculate and plot M-PSK for AWGN channel with exact phase
標(biāo)簽： calculate channel M-PSK exact
上傳時(shí)間： 2013-12-22
上傳用戶：
A case study on D-AMPS 1900 channels. An exact analytical expression for the tracking MSE on two-tap FIR channels is presented and utilized.
標(biāo)簽： analytical expression channels tracking
上傳時(shí)間： 2013-12-01
上傳用戶：edisonfather
Simple exact Solutions to Burgers Equation
標(biāo)簽： Solutions Equation Burgers Simple
上傳時(shí)間： 2014-11-27
上傳用戶：星仔
calculate the p-value of Fisher exact Test
標(biāo)簽： calculate p-value Fisher exact
上傳時(shí)間： 2017-09-18
上傳用戶：ywqaxiwang
The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic simplicity and its intuitively appealing derivation. As a consequence, MVA may be applied, both in an exact and approximate manner, to a large variety of models.
標(biāo)簽： with calculating present polling
上傳時(shí)間： 2014-11-17
上傳用戶：kelimu
The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order
標(biāo)簽： identification considered features separati
上傳時(shí)間： 2016-09-20
上傳用戶：FreeSky
an approach for capturing similarity between words that was concerned with the syntactic similarity of two strings. Today we are back to discuss another approach that is more concerned with the meaning of words. Semantic similarity is a confidence score that reflects the semantic relation between the meanings of two sentences. It is difficult to gain a high accuracy score because the exact semantic meanings are completely understood only in a particular context.
標(biāo)簽： similarity capturing concerned syntactic
上傳時(shí)間： 2014-01-05
上傳用戶：wmwai1314
In the previous article, we presented an approach for capturing similarity between words that was concerned with the syntactic similarity of two strings. Today we are back to discuss another approach that is more concerned with the meaning of words. Semantic similarity is a confidence score that reflects the semantic relation between the meanings of two sentences. It is difficult to gain a high accuracy score because the exact semantic meanings are completely understood only in a particular context.
標(biāo)簽： similarity presented capturing previous
上傳時(shí)間： 2013-12-13
上傳用戶：wcl168881111111
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
In this program we calculate the scattering field of a infinite rectangular surface. I use Physical Optic method and compare the result with exact solution.
標(biāo)簽： rectangular scattering calculate Physical
上傳時(shí)間： 2014-01-19
上傳用戶：362279997
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
