IE-0day-code

对监控视频中的行人进行检测并统计行人数量(Counting Heads in Video)

用delphi编写的一个可以换皮肤的程序，包括了所有源程序-used to prepare the skin for a procedure, including all source

An algorithm for tabu search methode for solving optimization problems

This just a simple Winsocket chat program, check it out, and feel free to give me tips and comment, through email or on this website. -This is just a simple Winsocket chat program, check it out, and feel free to give me tips and comment, through email or on this website.

消息队列开发,实现消息队列创建删除,发送回收-Message Queue development, realize the creation of message queue delete, send recovery

报刊订阅管理系统.能够实现报刊订阅的基本功能，包括新报刊信息的录入、订阅、查询等操作以及后台数据库的备份和恢复。用户合法注册后必须输入有效密码才能成功进入此系统，可以进行订阅报刊，查询信息，统计信息等操作。对于非法操作，系统有识别和防护措施。 3)元件库存管理：库存的出、入库功能； 4)元件销售统计：统计日、月、季和年的销售量 5)元件查询功能：可对库存、销售进行查询。 (Newspaper subscription management system. To achieve the basic functions of subscriptions, including new press information input, subscription information, operation, and back-end database backup and recovery. After registration the user must enter a valid legal order to successfully enter the system password, you can subscribe to newspapers, query information, statistics, and other operations. For the illegal operation, system identification and protection measures. 3) component inventory management: out of stock, storage functions 4) components sales statistics: Statistics Day, monthly, quarterly and annual sales of 5) element query function: to inventory and sales inquiries.)

vc++ 课程设计 航班管理系统 自己写的(airport)

VB的个人收支管理系统，完成了个人的收支管理需求(VB VB Personal search sub)

说明：  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.)

网络词典的协议实现功能！可以客户端去访问服务器端查询词典！-Network protocol dictionary feature! Clients can access server-side queries to the dictionary!