TFIND searches for one or more strings (boolean AND) in a text file. TFIND reports all lines where the string(s) were found (or NOT found by option). The search can be limited to a field in a fixed field (i.e. column oriented) list. An extended search mode is available, where only letters and digits are relevant. Other options: case sensitive search, alternative errorlevel with number of hits, header line with file name, LFN, custom prefix
标签： TFIND searches boolean reports
上传时间： 2016-01-24
上传用户：lindor
This a collection of MATLAB functions for extended Kalman filtering, unscented Kalman filtering, particle filtering, and miscellaneous other things. These utilities are designed for reuse and I have found them very useful in many projects. The code has been vectorised for speed and is stable and fast.
标签： filtering Kalman collection functions
上传时间： 2013-12-23
上传用户：ljmwh2000
Welcome to the Wrox Press C++ tutorial "I hope you ll enjoy reading this tutorial with your portable, your work, or your home PC. It s a perfect companion to the Introduction to Visual C++ 6.0 Standard Edition manual and is a proven aid to understanding the C++ language. The material in this tutorial is adapted from my book Beginning Visual C++ 6.0, to provide you with a thorough grounding in pure C++. I ve been careful to address the new standards in C++ laid out by the ANSI and ISO committees and I encourage you to adopt these conventions so that your programs are maintainable for years to come.
标签： tutorial Welcome reading portabl
上传时间： 2016-01-26
上传用户：wsf950131
This the second tutorial of the Writing Device Drivers series. There seems to be a lot of interest in the topic, so this article will pick up where the first left off. The main focus of these articles will be to build up little by little the knowledge needed to write device drivers. In this article, we will be building on the same example source code used in part one. In this article, we will expand on that code to include Read functionality, Handle Input/Ouput Controls also known as IOCTLs, and learn a bit more about IRPs.
标签： the interest tutorial Drivers
上传时间： 2016-01-28
上传用户：lmeeworm
Introduction Some times it is required that we build a shared library (DLL) from an m-file. M-files are functions that are written in Matlab editor and can be used from Matlab command prompt. In m-files, we employ Matlab built-in functions or toolbox functions to compute something. In my past articles, I showed you some ways to use Matlab engine (vis. API, C++ class or Matlab engine API) for employing Matlab built-in functions, but what about functions that we develop? How can we use them in VC? Is there any interface? This article shows you an idea to employ your own Matlab functions.
标签： Introduction required M-files library
上传时间： 2016-01-29
上传用户：zhoujunzhen
TinyLogin is a suite of tiny Unix utilities for handling logging into, being authenticated by, changing one s password for, and otherwise maintaining users and groups on an embedded system. It also provides shadow password support to enhance system security. TinyLogin is, as the name implies, very small, and makes an excellent complement to BusyBox on an embedded System. It can be used without BusyBox, of course, but I envision them being used together most of the time.
标签： authenticated TinyLogin utilities handling
上传时间： 2016-01-30
上传用户：253189838
Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结束：dis即为所有点对的最短路径矩阵 3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。 考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
标签： Floyd-Warshall Shortest Pairs Paths
上传时间： 2013-12-01
上传用户：dyctj
These templates are based on the documented outlines from Tim Ryan s "The Anatomy of a Design Document" articles (published on Gamasutra). The filler text comes straight from the articles, and have been slightly edited for clarity (and to use the British spelling NMP). To read the articles (which I would highly suggest), check out these links: http://www.gamasutra.com/features/19991019/ryan_01.htm -- Part 1 http://www.gamasutra.com/features/19991217/ryan_01.htm -- Part 2
标签： documented templates outlines Anatomy
上传时间： 2014-01-02
上传用户：13215175592
数据结构 1、算法思路： 哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。
上传时间： 2016-03-05
上传用户：lacsx
基于OFDM的无线宽带系统仿真It contains mainly two parts, i.e. link-level simulator and system-level simulator. Link-level simulator focus on a single-cell single-user scenario, where signal is transmitted from tx, and estimated at rx. Comparing the difference in tx/rx signal, the error rate can be found out. The output of the link-level simulator is the BLER/BER vs. SNR mapping table, that can be used for the system-level simulation. System-level simulator focus on a multi-cell multi-user scenario. For the sake of simplicity, it takes the mapping table aquired in the link-level simulation, measure the actural SNR, and finds the corresponding error rate.
标签： simulator i.e. system-level link-level
上传时间： 2016-03-15
上传用户：xsnjzljj
