In this program, several statistical fading channel simulators using the SUM-of-Sinusoids (SoS)has been implemented.A Rayleigh fading channel impulse respose using jakes model has been generated in matlab
標(biāo)簽： SUM-of-Sinusoids statistical simulators program
上傳時(shí)間： 2017-05-30
上傳用戶：ainimao
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points, data - matrix with data points, OUTPUT: R - rotation matrix and T - translation vector accordingly so newdata = R*data + T . newdata are transformed data points to fit model see help icp for more information
標(biāo)簽： points the minimize respect
上傳時(shí)間： 2014-01-02
上傳用戶：gyq
Relationship Between the Sum of Squared Difference (SSD) and Cross Correlation for Template Matching Konstantinos G. Derpanis York University kosta@cs.yorku.ca Version 1.0 December 23, 2005
標(biāo)簽： Relationship Correlation Difference Template
上傳時(shí)間： 2014-01-10
上傳用戶：妄想演繹師
In this program we calculate the sum of the incident and scattered fields in a 90 degree conducting wedge by using the analytic and Image theotem method
標(biāo)簽： conducting calculate the scattered
上傳時(shí)間： 2014-10-27
上傳用戶：lizhen9880
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標(biāo)簽： optimizing different the shortest
上傳時(shí)間： 2014-10-25
上傳用戶：1159797854
Replace every element on the diagonal of an array with the sum of the elements on the current column OR row. Labview
標(biāo)簽： the diagonal elements Replace
上傳時(shí)間： 2017-08-24
上傳用戶：lps11188
z-trenning z-tickets. mipt lucky tickets. Count of numbers with 2*n digits in base k such that sum of first n digits is same as second n digits.
標(biāo)簽： z-trenning z-tickets tickets numbers
上傳時(shí)間： 2014-01-05
上傳用戶：luopoguixiong
Implement the step 2 of two-level logic minimization. Our goal is to find the minimum (exact minimum) sum-of-products expression for a given function.
標(biāo)簽： minimization Implement the two-level
上傳時(shí)間： 2014-01-09
上傳用戶：無(wú)聊來(lái)刷下
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶：jeffery
中南賽區(qū)ACM競(jìng)賽題 Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle.
標(biāo)簽： two-dimensional Description negative integers
上傳時(shí)間： 2013-12-22
上傳用戶：lijianyu172
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
