代码搜索：舒服点
找到约 10,000 项符合「舒服点」的源代码
代码结果 10,000
www.eeworm.com/read/357171/10213984
m 14-3.m
I = checkerboard(8);
PSF = fspecial('gaussian',7,10);
%点扩散函数
V = .0001;
BlurredNoisy = imnoise(imfilter(I,PSF),'gaussian',0,V);
%加性噪声
WT = zeros(size(I));
WT(5:end-4,5:end-4) = 1;
J1 = deconvl
www.eeworm.com/read/357171/10214112
m 6-10.m
[x y z]=ellipsoid(1,2,3,5,1,10); %椭圆体数据的产生
view(3) %三维视角
surface(x,y,z)
title('椭圆体：中心点(1,2,3)，半径(5,1,10)')
www.eeworm.com/read/356491/10225599
m twopoint20.m
function twopoint20
%TWOPOINT20 Two point step size gradient methods 两点步长梯度法2
%参考文献：J. Barzilai and J. M. Borwein Two point step size gradient methods
%IMA Journal of Numerical Analysis Vol .8
www.eeworm.com/read/356491/10225600
m twopoint10.m
function twopoint10
%TWOPOINT10 Two point step size gradient methods 两点步长梯度法1
%参考文献：J. Barzilai and J. M. Borwein Two point step size gradient methods
%IMA Journal of Numerical Analysis Vol .8
www.eeworm.com/read/280981/10274842
m logistic1.m
r=linspace(2,4,500);%生成线性序列，描点
initial=linspace(0.3,0.7,50);%生成线性序列
trans=200;
k=1;
while k
www.eeworm.com/read/279550/10421077
txt noj 1087 并查集.txt
#include
#include
#include
//G++ and GCC
#define NMAX 100005
typedef struct line
{
int a;//线连接的两个点
int b;
bool has;//这条线是否没被删去
}line;
typedef struct a
www.eeworm.com/read/279550/10421262
txt 判断有向图是否有环.txt
#include
#include
#include
#include
using namespace std;
#define NMAX 105
int path[NMAX][NMAX];
int Ingree[NMAX];//各个点的入度
//判断一个有向图是否有环
/*
输入：
4
www.eeworm.com/read/353523/10441554
m ex031600.m
% 第三章: 例 3.16:
%
b = [0.0181, 0.0543, 0.0543, 0.0181];
a = [1.0000, -1.7600, 1.1829, -0.2781];
m = 0:length(b)-1; l = 0:length(a)-1;
K = 500; k = 1:1:K;
w = pi*k/K; % [0, pi] 分成501个点.
num =
www.eeworm.com/read/353494/10443444
cpp merge.cpp
// Merge.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include
using namespace std;
distinct(int single_array[],int num);
int _tmain(int argc, _TCHAR* argv[])
{
int N1,N2;