Optimal-Power-Flow-in-Microgrids

计数器用一个开关K控制，当K=1时，可逆加法计数器进行计数，K=0时可逆减法计数器进行计数，即可构成一个具有清零和预置功能的可逆加减法计数器-counter with a control switch K, K = 1, the reversible addition counter for counting, K = 0 reversible subtraction counter for counting, with constitutes a reset and preset function of reversible counter subtract

基于ipv6的单框异步对话软件。对于初步学习ipv6的有帮助-based on the single asynchronous dialogue box software. Preliminary study for the help ipv6

好东西进入文件夹routersim2，运行SRSINSTA.EXE安装Routersim2.0。再把crack文件夹下的文件复制到安装目录下覆盖原文件，并运行shkccna2.exe。至此破解完成，2.0版已经可以使用，若要升级到2.1版，请将upto2.1目录内文件复制到安装目录下覆盖原文件，并再次运行shkccna2.exe。这样2.1版就可使用了。...能够管理图书馆的书目(good things into folders routersim2 running SRSINSTA.EXE Routersim2.0 installation. Then crack folder of documents copied to the installation directory coverage under the original document, and run the shkccna2.exe. Thus crack completed version 2.0 can use, in order to upgrade to version 2.1, I would be grateful if upto2.1 directory to copy the installation directory coverage under the original document, and once again running shkccna2.exe. This version 2.1 can be used. ... To manage the library programs.)

最近一直在用keras，说点个人感受。 1、keras根植于python及theano，人气比较旺。 2、提供较为上层的框架，搞个深度学习的原型非常方便。 3、更新很快，我记得几个月前还没有multi-task的能力，最近再查就提供了graph的对象。 4、最重要的，文档很全。这点超过其它类似的基于theano的框架（Lasagne, Opendeep, Blocks）(Keras is a high-level neural networks library, written in Python and capable of running on top of either TensorFlow or Theano. It was developed with a focus on enabling fast )

说明：  数据结构，实现树的父亲孩子表示、孩子兄弟表示(Data structure, father-child representation and child-brother representation of trees)

说明：  读取宇视sdk下载，视频比较全面，winform版本的(Read the universal vision SDK to download, and the video is relatively comprehensive)

单射函数问题 设函数f将点集S = {0,1, , n -1}映射为f (S) = { f (i) | iÎ S} Í S 。单射函数问题要 从S中选取最大子集X Í S 使f (X )是单射函数。 例如，当n=7， f (S) = {1,0,0,2,2,3,6} Í S 时， X = {0,1,6} Í S 是所求的最大子集。-Injective function, the function f the problem will be the point set based S = (0,1,  , n-1) maps to f (S) = (f (i) | iÎ S) Í S. Injective function of the problem from the largest subset of S, select the X Í S so that f (X) is injective function. For example, when n = 7, f (S) = (1,0,0,2,2,3,6) Í S, when, X = (0,1,6) Í S is a subset of the desired maximum.

opc server and wak server

VC++学习的一部书籍，有很好的讲解和说明，图文并茂，形象易懂，很好的一本书！(VC++ learning a book, have a good explanation and instructions, illustrations, image understand, a good book!)

很好的解决大文件传输,以及视频数据的发送也可以借鉴.-Very good solution to large file transfers, as well as send video data can also learn from.