j1939 附录a附录b
标签: j1939
上传时间: 2022-06-09
上传用户:moh2000
排序算法、字典和B-树的C++语言实现 代码内容 包括以下算法: qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert sort shl.c sort: shell sort has.c dictionary: hash tables bin.c dictionary: binary tree rbt.c dictionary: red-black trees skl.c dictionary: skip lists ext.c external sort btr.c btree 语言 C++ 编译平台 Visual C++ 作者 Thomas Niemann 备注 来自Sorting and Searching Algorithms:A Cookbook
标签: sort qsort quicksort insert
上传时间: 2013-12-15
上传用户:silenthink
【问题描述】已知线性方程组AX=B,求解该方程组。参考算法: 消去法:将列向量B加到矩阵A的最后一列,构成增广矩阵AB。对AB进行下列三种初等变换,使原矩阵A的部分的主对角线上的元素均为1,其余元素均为0,则原列向量B的部分即为X的值: 1. 将矩阵的一行乘以一个不为0的数 2. 将矩阵的一行加上另一行的倍数 3. 交换矩阵中两行的位置
上传时间: 2015-06-18
上传用户:stvnash
Rotating shafts experience a an elliptical motion called whirl. It is important to decompose this motion into a forward and backward whil orbits. The current function makes use of two sensors to generate a bi-directional spectrogram. The method can be extended to any time-frequency distribution % % compute the forward/backward Campbell/specgtrogram % % INPUT: % y (n x 2) each column is measured from a different sensor % /////// % __ % |s1| y(:,1) % |__| % __ % / \ ________|/ % | | | s2 |/ y(:,2) % \____/ --------|/ % % Fs Sampling frequnecy % % OUTPUT: % B spectrogram/Campbel diagram % x x-axis coordinate vector (time or Speed) % y y-axis coordinate vector (frequency [Hz])
标签: experience elliptical decompose important
上传时间: 2015-06-23
上传用户:372825274
本书第一部分讲述的是传统的网络接口N e t B I O S、重定向器以及通过重定向器进行的各类 网络通信。尽管本书大部分内容均围绕Wi n s o c k编程这一主题展开,但是, A P I比起Wi n s o c k 来,仍然具有某些独到之处
上传时间: 2015-07-08
上传用户:恋天使569
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签: Implemented following compile command
上传时间: 2014-01-01
上传用户:lhc9102
* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.msstate.edu, Mississippi State University) * IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT * OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR" * HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
上传时间: 2015-09-24
上传用户:mpquest
EIA(ELECTRONIC INDUSTRIES ALLIANCE)标准文档EIA-CEA-861-B,A DTV Profile for Uncompressed High Speed Digital Interfaces。
标签: ELECTRONIC INDUSTRIES ALLIANCE EIA-CEA
上传时间: 2015-09-27
上传用户:hphh
This I develops based on the B/S structure student managementsystem management system, hoped brings a help to the novice
标签: managementsystem management structure develops
上传时间: 2014-01-07
上传用户:钓鳌牧马
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
标签: WoodenSticks Description length wooden
上传时间: 2014-03-08
上传用户:netwolf