kez88799

功过模拟单功能流水线调度过程，掌握流水线技术，学会就算流水线的吞吐率，加速比，效率(Merits and demerits of single-function simulation pipeline for the activation process, master pipeline technology, even if the pipeline throughput Institute, speedup, efficiency)

DOS下装机必准备工具,EXE文件和批处理文件,DOS下以前经常用到的.(DOS must be installed under preparation tool, EXE file and the batch file, DOS under the previously frequently used.)

elementnormalize Source Code for Andriod.

可以对应收款进行计算、提醒、打印，使用快速、便捷。vbe、宏。(Receivables can be calculated, reminded and printed.)

【实例简介】C#通信调试工具1.0(带源码) 串口通信，网络通信，很好用的工具。

一款局域网通信工具,适用于DELPHI5，安装后能访问局域网的资源，并进行通信。-one LAN communications tools, applicable to Delphi 5, would be able to visit after the installation of LAN resources, and communications.

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

iexplorer BHO plugin

通过客户端和服务器的连接实现通话，数据查询，中英文对照查询-Through the client and server connections realize calls, data inquiries, in bilingual query

控制中常常要测试被通讯协议理解的正确性，看完这个代码，自己动手写一个吧，不用再求人了。--自创-control often to test the communication protocol understood by the correctness, reading the code, to write himself a bar, do not have to ask for the.-- Inventing