Match
共 52 篇文章
Match 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 52 篇文章，持续更新中。
This project does not contain a full, runnable application program. Instead, the only package ope.fo
This project does not contain a full, runnable application program. Instead, the only package ope.football contains two classes to represent match data for football (and possibly other team sports).
1、 MD5String、MD5File、MD5Print、MD5Match这四个函数是供调用的。其他是用来辅助这几个函数的子函数。 2、MD5String为加密字符串。 3、MD5File为加密
1、 MD5String、MD5File、MD5Print、MD5Match这四个函数是供调用的。其他是用来辅助这几个函数的子函数。
2、MD5String为加密字符串。
3、MD5File为加密这个文件。
4、MD5Print是将加密后的密文转换
程序接收键入的一个关键字和一个句子
程序接收键入的一个关键字和一个句子，若句子中不包含关键字，则显示‘NO MATCH’；若句子包含关键字则显示‘MATCH’，并把该关键字在句子中的位置用十六进制数显示出来。程序以输入CTRL+C退出
app_match
app_match
DN426 6通道工业监控应用的SAR ADC
<p>
</p>
<div>
The 14-bit LTC2351-14 is a 1.5Msps, low power SARADC with six simultaneously sampled differential inputchannels. It operates from a single 3V supply and featuressix independent
碟机Search流程说明 Search过程中
碟机Search流程说明
Search过程中，主要涉及到的问题是Search(搜索) 和Match（匹配），其目的就是能够准确地给光头定位。如果匹配才算是成功的？要跳转多少个Track（信迹）才能到目的位置，以及这些跳转指令又是如何？等等诸如此类的问题都将该文档中有详细的解释说明。在koala这个项目中，当 Servo不在做顺序读取，而因为某些特定目的要求需要做跳转读取，这时就需要用到Searc
JBoss, one of the leading java Open Source groups, integrates and develops these services for a full
JBoss, one of the leading java Open Source groups, integrates and develops these services for a full J2EE-based implementation. JBoss provides JBossServer, the basic EJB container, and Java Manage Pre
基于FPGA的光纤光栅解调系统的研究
<DD> 波长信号的解调是实现光纤光栅传感网络的关键，基于现有的光纤光栅传感器解调方法，提出一种基于FPGA的双匹配光纤光栅解调方法，此系统是一种高速率、高精度、低成本的解调系统，并且通过引入双匹配光栅有效地克服了双值问题同时扩大了检测范围。分析了光纤光栅的测温原理并给出了该方案软硬件设计，综合考虑系统的解调精度和FPGA的处理速度给出了基于拉格朗日的曲线拟合算法。 </DD>
<DL
Neural network match filter of chirp pulse compression Neural network match filter of chirp pulse co
Neural network match filter of chirp pulse compression Neural network match filter of chirp pulse compression
ngrep strives to provide most of GNU grep s common features, applying them to the network layer. ngr
ngrep strives to provide most of GNU grep s common features, applying them to the network layer. ngrep is a pcap-aware tool that will allow you to specify extended regular or hexadecimal expressions t
序列比对程式
序列比对程式，主要一开始输入两串DNA序列，然后设置MATCH的值，最后算出分数
A website for keeping track of wishes for your character in WoW Users are able to make a user accoun
A website for keeping track of wishes for your character in WoW Users are able to make a user account, register their in-game characters, make wishes that represent their in-game goals, and match them
get the match in asm language
get the match in asm language
the applet is used for Grocery Store Simulation,When you execute the main() method, the output shoul
the applet is used for Grocery Store Simulation,When you execute the main() method, the output should match the output file provided in the course website. You will be graded according to the correctn
试编写一程序
试编写一程序，比较两个字符串string1和string2所包含的字符是否相同。如果相同则显示‘Match’ ，否则，显示 ‘No match’，同时响铃提示。
比较字符串sample.asm(文件名) 试编写一程序：比较两个字符串stringl和string2所含的字符是否相同。若相同则显示‘Match’
比较字符串sample.asm(文件名)
试编写一程序：比较两个字符串stringl和string2所含的字符是否相同。若相同则显示‘Match’，否则，显示‘No match’。
Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same d
Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-
Unzip this file into a writeable directory. You should end up with a "Geocode" project, as well as
Unzip this file into a writeable directory.
You should end up with a "Geocode" project, as well as Bitmaps and TestData directories.
This sample geocodes single-match zip codes, entered by the us
American Gladiator,You are consulting for a game show in which n contestants are pitted against n gl
American Gladiator,You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants
输入一句子以及一子字符串（字符数分别小于50）
输入一句子以及一子字符串（字符数分别小于50） ，在句子中搜索是否含有该子字符串。如果句子中不包含子串,则显示’No match!’；否则显示’Match’，并把该子串在句子中第一个匹配的位置用十六进制数显示出来.
(比如 ‘we are studing abc’. 中包含’abc’子串,出现在第10H位上；但不包括’xyz’子串.)