代码搜索：FOUNDATION

找到约 10,000 项符合「FOUNDATION」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/458010/7314272

m lpcar2pp.m

function pp=lpcar2pp(ar) %LPCAR2PP LPC: Convert ar filter to power spectrum polynomial in cos(w) PP=(AR) % the pp is a polynomial such that |polyval(ar,e^jw)|^2 = polyval(pp,cos(w)) % Copyri
·
www.eeworm.com/read/458010/7314274

m irfft.m

function x=irfft(y,n) %IRFFT Inverse fft of a conjugate symmetric spectrum X=(Y,N) % Y contains FIX(1+N/2) complex samples from the spectrum: if argument N % is specified then Y will be truncate
·
www.eeworm.com/read/458010/7314284

m rotqr2ro.m

function r=rotqr2ro(q) %ROTQR2RO converts a real quaternion to a 3x3 rotation matrix % Inputs: % % Q(4,1) real-valued quaternion (with magnitude = 1) % % Outputs: % % R(3,3) Input
·
www.eeworm.com/read/458010/7314291

m peak2dquad.m

function [v,xy,t,m]=peak2dquad(z) %PEAK2DQUAD find quadratically-interpolated peak in a 2D array % % Inputs: Z(m,n) is the input array % % Outputs: V is the peak value % XY
·
www.eeworm.com/read/457303/7328172

m4 aclocal.m4

# generated automatically by aclocal 1.9.6 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005 Free Software Foundation, Inc. # This file is free software;
·
www.eeworm.com/read/456497/7348114

cpp c31.cpp

// c31.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include "Card.h" int main(int argc, char* argv[]) { Card book1( "Dune", "Frank Herbert", 2 ); C
·
www.eeworm.com/read/456471/7348799

txt xercesnotice.txt

========================================================================= == NOTICE file corresponding to section 4(d) of the Apache License, == == Version 2.0, in this case for the Apa
·
www.eeworm.com/read/455443/7372349

m4 aclocal.m4

# generated automatically by aclocal 1.7.9 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002 # Free Software Foundation, Inc. # This file is free software; the Free Software F
·
www.eeworm.com/read/454111/7398774

notice

========================================================================= == NOTICE file corresponding to section 4(d) of the Apache License, == == Version 2.0, in this case for the Apache Derby d
·
www.eeworm.com/read/454069/7401713

muse p06.muse

#title P06: 分组的背包问题 * 问题 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。这些物品被划分为若干组，每组中的物品互相冲突，最多选一件。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。 * 算法 这个问题变成了每组物品有若干种策略：是选择本组的某一件，还是一件都不选。也就是说设f[k][v]表示前k组物品花费费用v ...
·