搜索结果
找到约 130 项符合
last 的查询结果
按分类筛选
- 全部分类
- 书籍 (34)
- 其他 (9)
- 单片机开发 (6)
- Java编程 (5)
- 其他书籍 (4)
- 编辑器/阅读器 (4)
- 数值算法/人工智能 (4)
- 通讯编程文档 (4)
- 单片机编程 (3)
- 可编程逻辑 (3)
- matlab例程 (3)
- 汇编语言 (3)
- 教程资料 (2)
- C/C++语言编程 (2)
- 教育系统应用 (2)
- VC书籍 (2)
- 文件格式 (2)
- 技术管理 (2)
- 中间件编程 (2)
- 书籍源码 (2)
- VHDL/FPGA/Verilog (2)
- Linux/Unix编程 (2)
- SQL Server (2)
- Internet/网络编程 (2)
- 电源技术 (1)
- 通信网络 (1)
- 无线通信 (1)
- 压缩解压 (1)
- 其他嵌入式/单片机内容 (1)
- Applet (1)
- 数学计算 (1)
- 数据库系统 (1)
- 操作系统开发 (1)
- 串口编程 (1)
- 通讯/手机编程 (1)
- 电子书籍 (1)
- DSP编程 (1)
- 人工智能/神经网络 (1)
- 软件设计/软件工程 (1)
- 嵌入式/单片机编程 (1)
- SCSI/ASPI (1)
- 行业发展研究 (1)
- 数据结构 (1)
- 认证考试资料 (1)
- 多媒体处理 (1)
- 源码 (1)
- 论文 (1)
- 技术资料 (1)
文件格式 Aiming at the application of passive trackinn based on sensor array, a new passive trackinn usinn se
Aiming at the application of passive trackinn based on sensor array, a new passive trackinn usinn sensor array
based on particle filter was proposed. Firstly, the“fake points" could be almost entirely and exactly deleted with the aids of the
sensor array at the expense of an additional sensor. Seco ...
文件格式 In this article, we present an overview of methods for sequential simulation from posterior distribu
In this article, we present an overview of methods for sequential simulation from posterior distributions.
These methods are of particular interest in Bayesian filtering for discrete time dynamic models
that are typically nonlinear and non-Gaussian. A general importance sampling framework is develop ...
单片机开发 1 安装：首先安装MPLAB IDE V7.42的程序
1 安装：首先安装MPLAB IDE V7.42的程序，然后再安装C的组件PICC8.05-PL.安装过程中全部确认选择，完毕后重启计算机。
2 激活：(PICC8.05-PL)
运行“开始”菜单下的“HI-TECH SOFTWARE”中的 激活（Complier Activation）程序，
再同时启动算号器程序（HtkeyGen.exe）,将Last Name前的勾去掉，填入公司名称，算出相应内
...
通讯编程文档 You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your pr
You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your private data, one for the common data in order to receive data from other applications like Excel, WinWord etc. and at last, I ll give you a handy-dandy class you can derive ANY MFC object from, to make ...
其他书籍 Data mining (DM) is the extraction of hidden predictive information from large databases (DBs). Wit
Data mining (DM) is the extraction of hidden predictive information from large databases
(DBs). With the automatic discovery of knowledge implicit within DBs, DM uses
sophisticated statistical analysis and modeling techniques to uncover patterns and relationships
hidden in organizational DBs. Over t ...
技术管理 This paper provides incumbent wireless Internet service providers (WISPs), new WISPs and demanding
This paper provides incumbent wireless Internet service providers (WISPs), new WISPs and
demanding new markets (such as government and education) with a technical analysis of
alternatives for implementing last-mile wireless broadband services.
Internet/网络编程 pav 反病毒源码 /*************************************************************************** * * * Fi
pav 反病毒源码
/***************************************************************************
* *
* File: ANTI-VIRUS *
* Function: This program demostrating file anti-virus managment *
* *
* Author: Long Yun Liang *
* First edit: 1995,3,10 *
* Last edit: 1996,11,5 All Rights Reserved *
* *
* ...
matlab例程 Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai - bi
Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute:
pi = (mu*ai - bi)^+
sum(pi) = Pt
By Daniel Perez Palomar (last revision: May 10, 2004).
matlab例程 This function obtains a unitary matrix Q such that: d=diag(Q *diag(lmd)*Q). In other words, it gi
This function obtains a unitary matrix Q such that: d=diag(Q *diag(lmd)*Q).
In other words, it gives a way to generate a matrix with given eigenvalues and diagonal elements.
By Daniel Perez Palomar (last revision: May 10, 2004).
Feel free to distribute this file as it is (without including any ...
数值算法/人工智能 北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the
北京大学ACM比赛题目
Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the ma ...