用于WPF的.NET、WPF、DXRibbon
.NET, WPF, DXRibbon for WPF (2023-12-21, Others, 0KB, 下载0次)
Jzip windows Indonesia
Jzip windows Indonesia (2020-12-10, WINDOWS, 990KB, 下载0次)
本软件包用于 DL/T 645 协议的采集与数据处理。在硬件层的移植（主要针对于串口收发数据）完成之后， 用户仅需调用一个API即可完成针对于特定协议（DL/T 1997 或 DL/T 2007）的标识符数据读取、处理与存储。使用户无需关注请求数据的封包与接收数据的解包等复杂的协议内部操作，真正做到 一键采集。
This software package is used for DL / T 645 protocol acquisition and data processing. After the porting of hardware layer (mainly for serial port receiving and sending data), users only need to call an API to complete the reading, processing and storage of identifier data for specific protocols (DL / T 1997 or DL / T 2007). Users do not need to pay attention to the complex internal operation of the protocol such as the packet of the request data and the unpacking of the received data, so as to realize the one key acquisition. (2020-09-01, C/C++, 29KB, 下载9次)
376.1 和645-2007 规约解析
376.1 and 645-2007 protocol parse (2020-05-07, C/C++, 4521KB, 下载12次)
为简化问题，假设南京现有三条地铁线：1号线、2号线和3号线，线路都是双向的。3条地铁线的站点名分别如下，地铁线交叉的换乘点用T1、T2等表示。请根据3条地铁线的站点和换乘点构造图。编写程序，任意输入两个站名名称，输出乘坐地铁最少需要经过的车站数量（含输入的起点和终点，换乘站点只计算一次）。
地铁1号线（直线）经过车站：A1 A2 A3 T1 A4 A5 A6 A7 A8 T2 A9 A10 A11 A12 T3 A13 A14 A15 T4 A16
地铁2号线（直线）经过车站：B1 T5 B2 B3 B4 B5 T2 B6 B7 B8 B9 B10 B11 T3 B12 B13 T6 B14 B15
地铁3号线（环线）经过车站：C1 C2 C3 C4 C5 T1 C6 C7 C8 C9 C10 T5 C11 C12 C13 T6 C14 C15 T4 C16 C17 C18
In order to simplify the problem, it is assumed that there are three metro lines in Nanjing: Line 1, line 2 and line 3, all of which are bidirectional. The station names of the three metro lines are respectively as follows, and the transfer points of metro line crossing are represented by T1, T2, etc. Please refer to the structural drawing of the stops and transfer points of the three metro lines. Write a program, input the names of two stations, output the minimum number of stations that need to pass by the subway (including the input starting point and terminal point, the transfer station is only calculated once). Metro Line 1 (straight line) passing station: A1 A2 A3 T1 A4 A6 A7 A8 T2 A9 A10 a11 A12 T3 A13 A14 A15 T4 a16 Metro Line 2 (straight line) passing station: B1 T5 B2 B3 B4 B5 T2 B6 B7 B8 B9 B10 B11 T3 B12 B13 T6 B14 B15 Metro Line 3 (ring line) passing station: C1 C2 C3 C4 C5 T1 C6 C7 C8 C9 C10 T5 C11 C12 C13 T6 C14 C15 T4 C16 C17 C18 (2020-04-05, C/C++, 3KB, 下载0次)
in 2 bytes using USCI_A, sent with the LSB first. I set the loopback bit UCLISTEN so that
they are also received in the USCI_A and displayed on the LCD. The listing shows how
the USCI_A0 is
in 2 bytes using USCI_A, sent with the LSB first. I set the loopback bit UCLISTEN so that
they are also received in the USCI_A and displayed on the LCD. The listing shows how
the USCI_A0 is (2020-02-28, C/C++, 123KB, 下载0次)
provide yet another thermometer as an example in Listing 10.13. This uses the ADC12 in
SCI_A0 is
provide yet another thermometer as an example in Listing 10.13. This uses the ADC12 in
SCI_A0 is (2020-02-28, C/C++, 437KB, 下载0次)
BF算法实现,c++算法，数据结构课程作业
Data structure code,for reference only,BF algorithm (2019-11-20, Visual C++, 1079KB, 下载0次)
能量高效的改进pegasis路由协议，matlab实现
Energy-efficient improved PEGASIS routing protocol implemented by MATLAB (2019-05-29, matlab, 2KB, 下载2次)
qmw,nfelv jqenfke jq,fm vj qfmf,
qmw,nfelv jqenfke jq,fm vj qfmf, (2019-05-04, WINDOWS, 13KB, 下载0次)
FC模拟器 NES 任天堂 红白机 完全开放的 源代码！。编译需要DirectX 8 SDK支持！。DirectX 8 现在网上比较难找了。。有需要的可以联系我。
FC simulator NES Nintendo Red and White Machine completely open source code!. Compilation needs DirectX 8 SDK support!. DirectX 8 is now more difficult to find on the Internet. Contact me if necessary. (2019-04-02, C/C++, 10233KB, 下载3次)
ACER E5-471PG BIOS_Acer_1.13_A_A
ACER E5-471PG BIOS_Acer_1.13_A_A (2019-01-05, WINDOWS, 3872KB, 下载0次)
ACER E5-471PG BIOS_Acer_1.11_A_A
ACER E5-471PG BIOS_Acer_1.11_A_A (2019-01-05, WINDOWS, 3499KB, 下载0次)
ACER E5-471PG BIOS_Acer_1.07_A_A
ACER E5-471PG BIOS_Acer_1.07_A_A (2019-01-05, WINDOWS, 3499KB, 下载0次)
BIOS Implementation Test Suite (BITS)
ACER E5-471PG BIOS_Acer_1.07_A_A
ACER E5-471PG BIOS_Acer_1.11_A_A
ACER E5-471PG BIOS_Acer_1.13_A_A
ACER E5-471PG BIOS_Acer_1.15_A_A
BIOS Implementation Test Suite (BITS)
ACER E5-471PG BIOS_Acer_1.07_A_A
ACER E5-471PG BIOS_Acer_1.11_A_A
ACER E5-471PG BIOS_Acer_1.13_A_A
ACER E5-471PG BIOS_Acer_1.15_A_A (2019-01-05, WINDOWS, 3514KB, 下载0次)
有不少朋友联系让给个示例，今天抽了点时间做了一个演示的简单框架，等有空再增加示例吧，有了框架增加新的模块很容易。
目录结构说明：
bin ------- VFP COM，需要注册里面的ffff.dll演示版。
wwwroot --- asp文件根目录，把IIS网站目录设置到此目录。
demo ------ VFP BS 页面文件存放目录，可以有多级目录结构。
data ------ 数据文件存放的目录。
使用简单说明：
1、注册bin下的ffff.dll
2、设置IIS网站目录到wwwroot下，并且默认文档设置为index.asp
3、访问网站即可，比如：http://127.0.0.1。
提醒：此演示只提供开发模式运行，开发模式为源码方式运行，不适合较大的访问量（会引起IIS崩溃），仅供学习使用。
There are many friends to contact to give an example, today took some time to do a demonstration of a simple framework, wait until you have time to add examples, it is easy to have a framework to add new modules.
Description of directory structure:
Bin - --- VFP COM, you need to register the ffff. DLL demo.
Wwwroot - - ASP file root directory, set the IIS website directory to this directory.
Demo - --- VFP BS page file storage directory, can have a multi-level directory structure.
Data - --- The directory where data files are stored.
Use brief instructions:
1. ffff.dll under registered bin
2. Set the IIS website directory to wwwroot, and the default document is set to index. ASP
3. Visit the website, such as http://127.0.0.1.
Reminder: This demonstration only provides the development mode operation, the development mode is the source mode operation, not suitable for a large number of visits (will cause IIS crash), only for learning to use. (2018-12-02, VFP, 4880KB, 下载2次)
求解矩阵链相乘问题时动态规划算法的另一个例子。给定一个n个矩阵的序列（矩阵链）<A1,A2,...,An>，我们希望计算它们的乘积 A1A2...An
为了计算表达式，我们可以先用括号明确计算次序，然后利用标准的矩阵相乘算法进行计算。完全括号化(fully parenthesized)：它是单一矩阵，或者是两个完全括号化的矩阵乘积链的积。
例如如果有矩阵链为<A1,A2,A3,A4>,则共有5种完全括号化的矩阵乘积链。
(A1(A2(A3A4)))、(A1((A2A3)A4))、((A1A2)(A3A4))、((A1(A2A3))A4)、((A1(A2A3))A4)
Another example of dynamic programming algorithm for solving matrix chain multiplication problem. Given a sequence (matrix chain) of N matrices < A1, A2,..., An>, we want to compute their product A1A2... An. In order to calculate expressions, we can first use parentheses to specify the order of calculation, and then use the standard matrix multiplication algorithm to calculate. Fully parenthesized: It is the product of a single matrix or of two completely parenthesized product chains of matrices. For example, if there are matrix chains < A1, A2, A3, A4>, there are five completely bracketed matrix product chains. (A1 (A2 (A3A4), (A1 ((A2A3) A4), ((A1A2) (A3A4), ((A1A2) (A1 A4), ((A1 (A2A3)) A4, ((A1 (A2A3)) A4) and ((A1 (A2A3)) A4) (2018-11-25, C/C++, 1KB, 下载0次)
this is an exe about 12306
this is an exe about 12306 (2018-11-22, Others, 5287KB, 下载1次)
csr drivers version 0.5.1-a1
csr drivers version 0.5.1-a1 (2018-10-20, WINDOWS, 281KB, 下载0次)
实现A1/A2数据库与petrel直接连接的数据接口
A1/A2 connect petrel (2018-05-21, C#, 4045KB, 下载13次)