策略介绍：
这是一款微马丁策略，与其它的马丁策略不同，不是开仓就加仓，主要是根据k线形态的支撑位和压力位，以及均线来做单，加仓的间隔以及加仓的倍率可以调整，这样的微马丁策略市场上市很少见也是很新颖的，最大的程度降低了风险，从而盈利能力却能大大提高，由于它异常优异的表现吸引大批人，喜欢的可以自己下载测试。
Strategy introduction:
This is a micro Martin strategy, which is different from other Martin strategies. It is not to open a position to increase a position. It is mainly based on the support level and pressure level of the K-line shape, as well as the moving average. The interval of increasing a position and the ratio of increasing a position can be adjusted. This kind of micro Martin strategy is rare and novel in the market. It reduces the risk to the greatest extent, but greatly improves the profitability Because of its excellent performance, it attracts a large number of people. Those who like it can download the test by themselves. (2021-04-07, C/C++, 108KB, 下载0次)
本书示例丰富，图文并茂，以让人容易理解的方式阐释了算法，旨在帮助程序员在日常项目中更好地发挥算法的能量。书中的前三章将帮助你打下基础，带你学习二分查找、大O表示法、两种基本的数据结构以及递归等。余下的篇幅将主要介绍应用广泛的算法
This book is rich in examples and illustrates algorithms in an easy-to-understand way, aiming to help programmers better use the energy of algorithms in their daily projects. The first three chapters of the book will help you lay the foundation for learning binary search, big O representation, two basic data structures and recursion. The rest of the article will focus on algorithms that are widely used. (2019-05-06, C/C++, 16155KB, 下载0次)
本资源包括《OpenCV3编程入门_毛星云编著_电子工业出版-》+源码、《opencv3机器视觉Python语言实现_刘波》+源码、《深度学习与计算机视觉 算法原理、框架应用与代码实现》+源码、《计算机视觉_算法与应用_Richard Szeliski》、《数字图像处理_第三版_中_冈萨雷斯》、《图像处理、分析与机器视觉（第三版）（美）桑卡，（美）赫拉瓦卡，（美）博伊尔著》、《机器视觉算法与应用双语版-Carsten Stegar》、视觉与深度学习实战付费课程视频（价格昂贵）+源码，深感资源来之不易，望下载者好好珍惜，文件太大，下载的为网盘链接。
This resource includes "Introduction to OpenCV3 Programming Mao Nebula Editing Electronic Industry Publishing -"+Source Code","Opencv3 Machine Vision Python Language Implementation Liu Bo"+Source Code", "Deep Learning and Computer Vision Algorithms Principle, Framework Application and Code Implementation"+Source Code Code","Computer Vision Algorithms and Applications Richard Szeliski","Digital Image Processing Third Edition Gonzales Image Processing, Analysis and Machine Vision (3rd Edition) (USA) Sanka, (USA) Heravaka, (USA) Boyle, (Bilingual Edition of Machine Vision Algorithms and Applications - Carsten Stegar), Visual and Deep Learning Payment Course Video (expensive) +Source Code, I deeply feel that resources are hard to come by. I hope that downloaders will cherish them very much. The files are too large and the downloaded links are on the webdisk. (2019-03-22, C/C++, 198KB, 下载30次)
本书系统讲解机器人学的理论知识，主要内容包括：机器人操作臂的几何性质，引起操作臂运动的力和力矩，与操作臂机械设计有关的问题和控制方法，机器人编程方法等。本书曾作为美国斯坦福大学机器人学导论的教材，经过两次修订。书中还包括大量分级的习题和编程作业，适合教学参考。
This book to explain the theory knowledge of robotics, main contents include: the geometric properties of the robot manipulator, caused by the movement of the actuating arm of force and moment, and manipulator mechanical design related issues and control method, the robot programming methods. This book has been used as an introduction to robotics in the United States, the teaching material, after two amendments. The book also includes a large number of graded exercises and programming assignments, suitable for teaching reference. (2016-04-06, C/C++, 18177KB, 下载4次)
本书系统讲解机器人学的理论知识，主要内容包括：机器人操作臂的几何性质，引起操作臂运动的力和力矩，与操作臂机械设计有关的问题和控制方法，机器人编程方法等。本书曾作为美国斯坦福大学机器人学导论的教材，经过两次修订。书中还包括大量分级的习题和编程作业，适合教学参考。
本书可作为高等院校相关专业的教材或参考书，也可供相关技术人员参考。
This book explains the theoretical knowledge of robotics, the main contents include: the geometric properties of the robot manipulator arm, causing the operating arm motion forces and moments, and problems related to the operating arm of the mechanical design and control methods, robot programming methods. The book served as Stanford University textbook Introduction to Robotics, amended twice. The book also includes a large number of graded exercises and programming assignments for teaching reference.
This book can serve as institutions of higher learning related materials or reference books, but also for related technical officers. (2016-03-05, C/C++, 18281KB, 下载9次)
为什么小小的蚂蚁能够找到食物？他们具有智能么？设想，如果我们要为蚂蚁设计一个人工智能的程序，那么这个程序要多么复杂呢？首先，你要让蚂蚁能够避开障碍物，就必须根据适当的地形给它编进指令让他们能够巧妙的避开障碍物，其次，要让蚂蚁找到食物，就需要让他们遍历空间上的所有点；再次，如果要让蚂蚁找到最短的路径，那么需要计算所有可能的路径并且比较它们的大小，而且更重要的是，你要小心翼翼的编程，因为程序的错误也许会让你前功尽弃。这是多么不可思议的程序！太复杂了，恐怕没人能够完成这样繁琐冗余的程序。
Why tiny ants to find food? They have the intelligence it? Imagine if we want to design an artificial ant program, then this program how complicated you want it? First, you have to let the ants can avoid obstacles, we must give it compiled into the terrain under the appropriate instructions so that they can cleverly avoiding obstacles, and secondly, to make the ants find food, they need to get them to traverse space on all points again, if you want the ants to find the shortest path, then you need to calculate all possible paths and compare their size, but more importantly, you have to careful programming, because the wrong procedure may make you come to naught. This is such an incredible program! Too complicated, I am afraid that no one can accomplish this tedious redundancy program. (2013-11-30, C/C++, 9KB, 下载3次)
目的：了解直觉模糊多属性决策的基本概念、原理、方法，对实际中简单的模糊决策问题能够应用直觉模糊理论进行问题描述、建模、求解。
要求：① 熟练掌握直觉模糊理论的基本定义和相关概念；② 深入了解直觉模糊多属性决策模型，并能够编程实现。
Objective: To understand the intuitionistic fuzzy multi-attribute decision-making of basic concepts, principles, methods, and practice simple fuzzy decision-making problems, can be applied intuitionistic fuzzy theory for problem description, modeling, solving. Requirements: ① mastered the basic definition of intuitionistic fuzzy theory and related concepts (2) understanding of intuitionistic fuzzy multi-attribute decision model, and can be programmed. (2012-10-30, C/C++, 985KB, 下载38次)
本程序通过控制机器人的行动和方向打击虫子，在规定时间内打完虫子就赢了。适合于广大打虫子玩家和编程初学者。
This program through the control of the robot' s actions and direction to combat insects, kick down the insects within the specified time will win. Suitable for playing in the majority of insects players and programming beginners. (2012-06-24, C/C++, 31797KB, 下载4次)
在3*3组成的九宫格棋盘上，摆有8个将牌，每一个将牌都刻有1-8中的某一个数码。棋盘中留有一个空格，允许其周围的某一个将牌向空格移动，这样通过移动将牌就可以不断改变将牌的布局。给定一种初始的将牌布局或结构（称初始状态）和一个目标布局（称目标状态），编程给出一个最优的走法序列。
3* 3 composed of squared board, put 8 cards, each of the license are inscribed with a digital 1-8. The chessboard left a space that allows its around a brand move to the space, so that by moving the license can be changing the layout of the license. To set an initial layout of the license or structure (called the initial state) and a layout of the target (called the target state), programmed to give an optimal sequence of moves. (2012-05-19, C/C++, 129KB, 下载2次)
在3*3组成的九宫格棋盘上，摆有8个将牌，每一个将牌都刻有1-8中的某一个数码。棋盘中留有一个空格，允许其周围的某一个将牌向空格移动，这样通过移动将牌就可以不断改变将牌的布局。给定一种初始的将牌布局或结构（称初始状态）和一个目标布局（称目标状态），编程给出一个最优的走法序列
3* 3 in the composition of squared board, will put eight cards, each engraved with the brand are 1-8 in one digital. Left the board in a space that allows it to be around a certain brand to the mobile space, so by moving the card can be changing the layout of the cards. Will be given one kind of card layout or the initial structure (called the initial state) and a target distribution (called the target state), the program gives an optimal sequence of moves (2011-11-19, C/C++, 2KB, 下载6次)
用矩形域二元分片双一次插值算法对原程序做了修改（说实话，原程序我没看懂）。用模糊控制算法，对于非线性系统和数学模型难以建立的系统来说更易理解和编程！
Rectangular domain with two yuan slice Dual time interpolation algorithm for the original program was revised (to be honest, I did not understand the original program). Fuzzy control algorithm for nonlinear systems and mathematical models is difficult to establish the system easier to understand and programming! (2011-08-08, C/C++, 9KB, 下载11次)
两个乒乓球队进行比赛，各出三人。甲队为a,b,c三人，乙队为x,y,z三人。已抽签决定
比赛名单。有人向队员打听比赛的名单。a说他不和x比，c说他不和x,z比，请编程序找出
三队赛手的名单。
Two table tennis team to compete, all the three. A team is a, b, c three-, B team for the x, y, z three. List of games have been decided by drawing lots. The game was to find out the list of members. a ratio of said he did not, and x, c said he did not, and x, z ratio, programmed to identify a list of three teams racing. (2011-05-04, C/C++, 2KB, 下载2次)
a星算法 神经网络编程，对于空地左键单击后会产生障碍，对障碍左键单击会消除障碍，对于起点，两次左键盘单击会消除起点，如果不存在起点，单击右键会产生起点，如果存在起点不存在终点，单击右键会产生终点，如果既存在起点又存在终点，单击右键会消除终点，点击开始寻路回画出路径
a star algorithm neural network programming, for the vacant left-click will create an obstacle on the obstacle left-click will remove the obstacles, the starting point, the two left-click on the keyboard will eliminate a starting point, if there is no point, right-click will generate a starting point, if there is no end point, right-click will produce the end, if there is only a starting point and end point exists, right-click will remove the end, click on the path began to find its way back to draw (2010-12-25, C/C++, 58KB, 下载19次)
介绍了一个舞蹈机器人设计、及制作和调试全过程。通过对舞蹈机器人机械部分和电气部分的设计、控制软件编程，使机器人完成相应的功能
Describes a dance robot design, and production and debug the whole process. Through dance robot mechanical parts and electrical parts of the design, control software, programming, robot to complete the corresponding function (2010-06-21, C/C++, 9708KB, 下载52次)
基本遗传算法的C语言源程序。（遗传算法的应用范围极其广泛，它可应用于函数优化、组合优化、生产调度问题、自动控制、机器人学、图像处理、人工生命、遗传编程以及机器学习等领域。）
Basic genetic algorithm C language source code. (Genetic algorithm extremely broad range of applications, it can be applied to function optimization, combinatorial optimization, production scheduling problem, automatic control, robotics, image processing, artificial life, genetic programming, as well as machine learning and other fields.) (2008-11-23, C/C++, 3KB, 下载53次)
这是一个pso程序源代码，pso源于对鸟群捕食行为的研究而发明的进化计算技术，属于进化算法的一种。
优点：收敛速度快，具有全局寻优能力，而且编程简单，易于推广使用。
This is a pso source code, pso out of the flock of predatory behavior and evolutionary computation invention of the technology is an evolutionary algorithm. Advantages : fast convergence with global optimization capability and programming simple and easy to use. (2007-04-12, C/C++, 12KB, 下载334次)
此程序是一款为年轻人设计的脑筋游戏，它可以按照我们的意愿在屏幕上自如地移动，是人工智能领域中的经典问题。利用计算机强大的计算机能力和庞大的存储空间可以采用讨论问题每一步走法，并存储形成的状态。当某一走法不可能达到目标时，可以回溯到并选择另一种走法。采用这种方法可以节省编程者的劳动。对于简单的问题能够轻松得到答案。但是在此处，由于求胜过程中出现的中间状态实在太多，在通常使用微机上仍可能出现内存不足的问题，这就迫使要考虑让计算机多一点逻辑上的选择判断消除大量不必要的中间状态，尽量达到要求，也就是采用人工智能的方法来解决问题。
A procedure is designed for young people's brains game, it can in accordance with our wishes on the screen to move freely is in the field of artificial intelligence classic problem. Computer use powerful computer capabilities and the huge storage space can be used to discuss issues every step, Storage and formed the state. When a law to impossible to meet the targets, and can be traced to the choice of law to another. This approach can save the labor program. For simple issues can be easy to get an answer. But here, because the course to win the intermediate state is too many. In normal use PC may still be the problem of insufficient memory. This forced the computer to consider allowing more logical choice judge to eliminate the unnecessary intermediate state, to meet the requirement, (2006-12-28, C/C++, 13KB, 下载12次)
上述算法的终止准则为H终止准则。要求编写通用程序。
关于函数的要求：
直线搜索所计算的函数自己任选。
共轭梯度法所计算的函数：①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取。
程序自行编写（禁止采用调用现成软件的方式），编程语言自选。
above algorithm criteria for the termination of H termination criteria. Requests for common procedures. The demands on function : linear search function by calculating their options. The conjugate gradient method by calculating function : calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in reference books or other materials were selected at random. Self-preparation procedure (called ban on the use of existing software) (2005-12-13, C/C++, 9KB, 下载29次)
上述算法的终止准则为H终止准则。
编写通用程序。：
直线搜索所计算的函数自己任选。①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取。
程序自行编写（禁止采用调用现成软件的方式），编程语言自选。从独立完成所有实验内容的学生中遴选出
above algorithm criteria for the termination of H termination criteria. Preparation of common procedures. : Linear search function by calculating their options. calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in reference books or other materials were selected at random. Self-preparation procedure (called ban on the use of existing software), on-demand programming language. From an experimental content complete all of (2005-12-13, C/C++, 14KB, 下载13次)
直线搜索可以为最优化提供搜索区间。上述算法的终止准则为H终止准则。通用程序。
①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取程序自行编写（禁止采用调用现成软件的方式），编程语言自选。
straight search for the optimal search interval. This algorithm criteria for the termination of H termination criteria. Common procedures. calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in other reference materials or arbitrary selection procedures to prepare themselves (called ban on the use of existing software), on-demand programming language. (2005-12-13, C/C++, 34KB, 下载39次)