代码搜索:FOUNDATION
找到约 10,000 项符合「FOUNDATION」的源代码
代码结果 10,000
www.eeworm.com/read/186640/8921089
txt readme.txt
HTTP Virtual Disk.
Copyright (C) 2006 Bo Brant閚.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as publi
www.eeworm.com/read/186637/8921185
h crack.h
// crack.h :
//
// This is a part of the Microsoft Foundation Classes C++ library.
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// This source code is only intended as a suppl
www.eeworm.com/read/383548/8936605
makefile
# This is a part of the Microsoft Foundation Classes C++ library.
# Copyright (C) 1992-1998 Microsoft Corporation
# All rights reserved.
#
# This source code is only intended as a supplement to th
www.eeworm.com/read/383548/8936658
cpp stdafx.cpp
// stdafx.cpp : source file that includes just the standard includes
//
// This is a part of the Microsoft Foundation Classes C++ library.
// Copyright (C) 1992-1998 Microsoft Corporation
// All r
www.eeworm.com/read/284309/8945689
m izak.m
function sig=izak(dzt)
%IZAK Inverse Zak transform.
% SIG=IZAK(DZT) computes the inverse Zak transform of matrix DZT.
%
% DZT : (N,M) matrix of Zak samples.
% SIG : Output signal (M*N,1) containing t
www.eeworm.com/read/284309/8945698
m umaxbert.m
function y=umaxbert(u);
%UMAXBERT Determination of the maximum value of u for Bertrand distribution.
% Y=UMAXBERT(u) is the function Y(u)=(H(u)+u/2)/(H(u)-u/2)-fmax/fmin.
% Doing UMAX = fzero('umaxbe
www.eeworm.com/read/284309/8945715
m anapulse.m
function y=anapulse(N,ti);
%ANAPULSE Analytic projection of unit amplitude impulse signal.
% y=ANAPULSE(N,TI) returns an analytic N-dimensional signal
% whose real part is a Dirac impulse at t=TI.
%
www.eeworm.com/read/284309/8945721
m anastep.m
function y=anastep(N,ti);
%ANASTEP Analytic projection of unit step signal.
% Y=ANASTEP(N,TI) generates the analytic projection of a
% unit step signal.
%
% N : number of points.
% TI : starting pos
www.eeworm.com/read/284309/8945780
m divider.m
function [N,M]=divider(N1);
%DIVIDER Find dividers of an integer.
% [N,M]=DIVIDER(N1) find two integers N and M such that M*N=N1 and
% M and N as close as possible from sqrt(N1).
%
% Example :
% N1