dala

ASP.NET信息管理系统开发实例导航第3章 物业管理系统-ASP.NET development of information management system navigation example, Chapter 3 of the property management system

使用Http在线自动升级程序，类似瑞星的自动升级功能。-use automatic escalation procedures, similar Rising automatic update feature.

局域网网络通信编程实例 获取局域网内其他计算机的信息-LAN network communications programming examples LAN access to other computer information

Java编程思想第四版完整中文高清版，适合学习java的小伙伴(Java Programming Thought 4th Edition Complete Chinese HD Edition, Suitable for Small Partners Learning Java)

this file about Brain computer interface and its types like p300 detection

CORBA provides a standard mechanism for defining the interfaces between components as well as some tools to facilitate the implementation of those interfaces using the developer’s choice of languages. Two features that CORBA provides are: • Platform independence • Language independence  Platform independence means that CORBA object can be used on any platform for which there is a CORBA orb implementation. Language independence means that CORBA objects and clients can be implemented in just about any programming language.

Windows 的 socket 编程入门实践 实现server与client的通信-Windows of the socket programming practice to achieve entry-server and client communications

【实例简介】果云开发板底板原理图.pdf

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

今天尝试写一个小demo实现下之前看过的代码，目的了解不同文件的数据访问，掌握如何获取前台数据，如何将数据库的数据在前端页面展示。 awt可视化界面可已实现提交数据到数据库，也可查询数据在控制台打印。 web工程：主要是web前台输入并提交数据，然后在另一页面展示数据库内容(Today, try to write a little demo to achieve before the next read the code, the purpose of understanding the data access different files, learn how to get the reception of data, how the data in the to show the front page. awt visual interface has been implemented to submit data to the , query data can also be printed on the console. web project: mainly web frontend to enter and submit data, and then display the contents of the in another page)