新建文件夹

基于Fortran算法的dineof代码(Detailed code of dineof based on Fortran algorithm.Detailed writing of specific practices.)

谭浩强c++课件第五章 是一个很好的C++学习课件 值得拥有(Hemopurification c++ courseware fifth chapter is a good learning courseware deserve C++)

PQ-Fiber 是清华大学土木工程系结构工程研究所基于大型通用有限元程序ABAQUS 开 发的一组材料单轴滞回本构模型的集合。主要用于在钢筋混凝土结构、钢结构等的弹塑性时 程分析中定义杆系结构的材料本构，同时可用于任何只需要定义材料单轴滞回本构模型的情 况。 作者以 FORTRAN 编译文件.obj 的形式在网上免费发布PQ-Fiber 的最新版本，以供广 大科研与工程设计人员使用，发布的版本没有功能限制。请使用者尊重知识产权，(PQ-Fiber is a Structural Engineering Research Institute of Civil Engineering Department of Tsinghua University. It is based on the large general finite element program ABAQUS. A set of uniaxial hysteretic constitutive models is set up. It is mainly used for elastic-plastic properties of reinforced concrete structures and steel structures. In the process analysis, the material constitutive equation of the bar structure is defined, and it can be used for any material requiring only a uniaxial hysteretic constitutive model. The situation. The author releases the latest version of PQ-Fiber on the Internet for free in the form of FORTRAN compiler.Obj. The use of large research and engineering designers has no functional limitations. Invites users to respect intellectual property rights,)

说明：  程序主要实现了四阶龙哥库塔，程序注释很详细(The fourth-order Longkouta is mainly realized, and the program annotations are very detailed.)

Delphi源码编写的屏幕放大镜，可以把屏幕上的文字和图片放大显示，在Windows中被列为辅助功能。放大的内容是按比例放大。拖动滑块可改变放大位数，使用时，晃动鼠标到其它需要放大内容的地方即可，在放大镜窗口中即可看到放大后的图像。

Asp.net开发的图书馆管理系统，功能齐全，可以直接供使用，编码完整，不管是新手还是老手都比较适合下载。(The library management system developed by Asp.net can be directly used and coded. It is suitable for both novice and experienced users.)

说明：  STM32+ILI9341八位驱动,成功点亮屏幕(STM32 + ILI9341 8-bit driver successfully lights up the screen)

可以用于ABAQUS子程序中创建蠕变模型，关于蠕变损伤分析(Used to create creep models in ABAQUS subroutines)

说明：  差分进化算法,具有几个差分进化的变种形式(Differential evolution algorithm)

1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.