see
共 327 篇文章
see 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 327 篇文章，持续更新中。
// Hint: These classes are intended to be used as base classes. Do not // simply add your code to t
// Hint: These classes are intended to be used as base classes. Do not
// simply add your code to these files - instead create a new class
// derived from one of CSizingControlBarXX classes and put
pls see it again welcome program
pls see it again welcome program
pls see it again welcome program
pls see it again welcome program
UC1610 program ,pls see it ,welcome
UC1610 program ,pls see it ,welcome
These are the examples from the book Java Examples in a Nutshell, 2nd Edition, by David Flanagan.
These are the examples from the book Java Examples in a Nutshell, 2nd
Edition, by David Flanagan.
See the file index.html for more information.
Java课程设计案例精编源代码 see s
Java课程设计案例精编源代码 see s
This program simulates plant identification using frequency block least mean square (FBLMS) alogrith
This program simulates plant identification using frequency block least mean square (FBLMS) alogrithm
reference: 《LMS算法的频域快速实现》 LMS is modified by XXX in XXX place, see details in XXX relevant docum
//构造具有指定的标签的菜单 files = new Menu("文件(F)") compile = new Menu("编辑(E)") see = new Menu("查看(V
//构造具有指定的标签的菜单
files = new Menu("文件(F)")
compile = new Menu("编辑(E)")
see = new Menu("查看(V)")
format = new Menu("格式(O)")
font = new Menu("字体和颜色(F)...") //在格式菜单下再添加一个字体及颜色的菜单
hel
We can see that using Gauss-Seidel iterative methods need only 13 timed to make   =
We can see that using Gauss-Seidel iterative methods need only 13 timed to make          
But using Jacobi method after 25 times
OpenSVM was developped under Visual C++ 6.0 SP6, You can open the workspace file(*.dsw) in the ope
OpenSVM was developped under Visual C++ 6.0 SP6,
You can open the workspace file(*.dsw) in the opensvm-src folder.
The folder include the svm.h and svm.cpp which in the libsvm (Copyright (c) 2000
Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form
Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a line
These are the examples from the book Java Examples in a Nutshell, 2nd Edition, by David Flanagan.
These are the examples from the book Java Examples in a Nutshell, 2nd
Edition, by David Flanagan.
See the file index.html for more information.
fp_add_sub,resource using maxplusII ,more details see the source
fp_add_sub,resource using maxplusII ,more details see the source
This program is distributed in the hope that it will be useful, ** but WITHOUT ANY WARRANTY without
This program is distributed in the hope that it will be useful,
** but WITHOUT ANY WARRANTY without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
** G
See Hanoi.cpp for the implementation of this cla
See Hanoi.cpp for the implementation of this cla
最大流
最大流，The programs are designed to run under BSD UNIX.
All programs read from the standard input and write to the standard
output. Run "make" to compile the programs and generators.
File "list" lists
proteus的例子－计算器
proteus的例子－计算器，大家SEE一下
When I first studied Kalman filtering, I saw many advanced signal processing submissions here at the
When I first studied Kalman filtering, I saw many advanced signal processing submissions here at the MATLAB Central File exchange, but I didn t see a heavily commented, basic Kalman filter present to
1）Firstly, open wvfb 2）Sencondly, run fhas_win32.exe, and then see the effect on wvfb, click on the
1）Firstly, open wvfb
2）Sencondly, run fhas_win32.exe, and then see the effect on wvfb, click on the button by mouse.
Graphviz - Graph Drawing Programs from AT&T Research and Lucent Bell Labs See doc/build.html for
Graphviz - Graph Drawing Programs from AT&T Research and Lucent Bell Labs
See doc/build.html for prerequisites and detailed build notes.