登录
首页 » Python » backend

backend

于 2014-08-16 发布 文件大小:1KB
0 246
下载积分: 1 下载次数: 1

代码说明:

  This example demonstrates how to use the backend service in Google-App-Engine. 1. Change name of application in app.yml and firstmodule.yaml to the name of you application 2. Upload the files 3. Open the main page

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Wiener
    设计一维纳滤波器 (1). 产生三组观测数据:首先根据S(n)=aS(n-1)+w(n)产生信号S(n),将其加噪声(信噪比分别为20db,10db,6db),得到观测数据X1(n),X2(n),X3(n)。. (2). 估计Xi(n),i=1,2,3的AR模型参数。假设信号长度为L,AR模型阶数为N,分析实验结果,并讨论改变L,N对实验结果的影响。(Design a Wiener filter (1) produces three sets of observations: First, according to S (n) = aS (n-1)+ w (n) generates the signal S (n), to add noise (SNR are 20db, 10db, 6db ), obtained observational data X1 (n), X2 (n), X3 (n). . (2) estimated Xi (n), i = 1,2,3 of the AR model parameters. Assuming the signal length L, AR model order N, the analysis of experimental results, and discuss the changes in L, N to the experimental results.)
    2012-01-12 10:18:20下载
    积分:1
  • (pso)matlab[matlab]
    这是粒子群较详细的工具箱,有不同的应用,并且有实例(This is a more detailed PSO toolbox, there are different applications and have examples of)
    2010-05-10 09:18:23下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • pian
    matlab 实现电缆的偏心率检测 源码,通过垂直的两个方向的X光照射数据,可得到偏心率。(based on the data throw by the X rays in two dirctions of 90 degree,we can get the eccentricity of the Coaxial cable.)
    2010-11-26 19:49:11下载
    积分:1
  • che_zai_ni_bian_qi
    车载并联均流型逆变器的设计与实现.前级高频升压采用推挽软开关技术。(Onboard parallel pattern and realize the inverter design. )
    2014-08-13 09:39:26下载
    积分:1
  • music
    采用music算法对采样的阵列信号进行处理,根据预先给定的值进行估计,采用标准差的方式进行估计。music算法性能的好坏(The music algorithm on sampled array signal processing, based on an estimated value given in advance, an estimated using standard differential manner. music algorithm performance is good or bad)
    2013-05-11 14:13:47下载
    积分:1
  • IntGaussLager
    在Matlab中用高斯—拉盖尔公式及高斯—埃尔米特公式求函数的近似积分。(How to use IntGaussLager and IntGaussHermite formula expressions caltulate approximate integration of functional in Matlab.)
    2011-05-06 16:57:12下载
    积分:1
  • Caesar_Cipher
    network security algorithm ceasar cipher codes, simple implementation
    2013-11-30 07:39:32下载
    积分:1
  • dc-dc
    Three phase high frequency isolated DC-DC converter (published in ELSEVIER)is simulated under symmetrical open loop control. It provides Low voltage conversion ratio, isolation, good regulation with fast dynamic response
    2014-08-14 16:32:36下载
    积分:1
  • zerocode2
    零相关窗互补码产生及相关性和互相关性计算(Complementary code produces zero correlation window and the correlation and cross-correlation calculations)
    2011-10-25 17:12:27下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载