Location:
Search - get the p
Search list
Description: 抛物线法求解
方程的构造方法:给出[0,1]区间上的随机数(服从均匀分布)作为方程的根p*.
设你的班级数为a3,学号的后两位数分别为a2与a1,从而得到你的三次方程
例如:你的31班的12号,则你的方程是21x3+60x2+2x+a0=0的形式.
方程中的系数a0由你得到的根p*来确定.
-parabolic equation method Construction Methods : given interval [0,1] on the random number (subject to uniform distribution) as the root equation p *. set up your classes at a3, after learning of the double-digit for a1 and a2, so you get the three equations for example : your 31 classes on the 12th, then your equation is 21x3 60x2 2x a0 = 0 forms. the equation coefficients a0 you get from the root of p * to determine.
Platform: |
Size: 883 |
Author: 董方 |
Hits:
Description:
改进的牛顿法求解：
方程的构造方法:给出[0,1]区间上的随机数(服从均匀分布)作为方程的根p*.
设你的班级数为a3,学号的后两位数分别为a2与a1,从而得到你的三次方程
例如:你的31班的12号,则你的方程是21x3+60x2+2x+a0=0的形式.
方程中的系数a0由你得到的根p*来确定.
-improve Newton's method : Construction of the equation : given interval [0,1] on the random number (subject to uniform distribution) as the root equation p *. set up your classes at a3, after learning of the double-digit for a1 and a2, so you get the three equations for example : Your 31 classes on the 12th, then your equation is 21x3 60x2 2x a0 = 0 forms. the equation coefficients a0 you get from the root of p * to determine.
Platform: |
Size: 801 |
Author: 董方 |
Hits:
Description: 抛物线法求解
方程的构造方法:给出[0,1]区间上的随机数(服从均匀分布)作为方程的根p*.
设你的班级数为a3,学号的后两位数分别为a2与a1,从而得到你的三次方程
例如:你的31班的12号,则你的方程是21x3+60x2+2x+a0=0的形式.
方程中的系数a0由你得到的根p*来确定.
-parabolic equation method Construction Methods : given interval [0,1] on the random number (subject to uniform distribution) as the root equation p *. set up your classes at a3, after learning of the double-digit for a1 and a2, so you get the three equations for example : your 31 classes on the 12th, then your equation is 21x3 60x2 2x a0 = 0 forms. the equation coefficients a0 you get from the root of p * to determine.
Platform: |
Size: 790 |
Author: 董方 |
Hits:
Description: 计算机操作系统的生产者与消费者问题
一组生产者向一组消费者提供消息，它们共享一个有界缓冲池，生产者向其中投放消息，消费者从中取得消息。生产者要不断将数据放入共享的缓冲，消费者要不断从缓冲取出数据。消费者必须等生产者取走数据后才能再放新数据(不覆盖数据)，消费者必须等生产者放入新数据后才能去取(不重复)。-computer operating system, the producer and a consumer group to a group of producers to provide consumers with information, they shared a bounded buffer pool, which put producers to news consumers to get news. Producers will continue to share the data into the buffer, consumers should continue to extract data from the buffer. Consumers must be removed so producers can recapture data after new data (not cover data), consumers must wait producers Add new data after Mysteriously (repetition).
Platform: |
Size: 1663 |
Author: 紫水晶 |
Hits:
Description: 用P/Invoke显示设备内存信息
P/Invoke with compact framework get the Memory Status and Storage Cards
Platform: |
Size: 220426 |
Author: zeng |
Hits:
Description: 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0 / 1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
Platform: |
Size: 8915 |
Author: 周易 |
Hits:
Description: Novel Composition Test Functions for Numerical Global Optimization
func_test.m is the main program, a basic PSO algorithm PSO_func.m is attached.
SIS_novel_func.m is the function program,including six composition functions
f=SIS_novel_func(x,func_num)
func_num: from 1 to 6
Now it's just for 10D
The mat files are the associate data files used in the SIS_novel_func.
Using func_plot.m, you could get the 2-D landscape maps for the six functions.
reference:
J. J. Liang, P. N. Suganthan and K. Deb, "Novel Composition Test Functions for Numerical
Global Optimization", IEEE Swarm Intelligence Symposium, pp. 68-75, June 2005.
Platform: |
Size: 59653 |
Author: fyg26856469 |
Hits:
Description: 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
Platform: |
Size: 8192 |
Author: 周易 |
Hits:
Description: 抛物线法求解
方程的构造方法:给出[0,1]区间上的随机数(服从均匀分布)作为方程的根p*.
设你的班级数为a3,学号的后两位数分别为a2与a1,从而得到你的三次方程
例如:你的31班的12号,则你的方程是21x3+60x2+2x+a0=0的形式.
方程中的系数a0由你得到的根p*来确定.
-parabolic equation method Construction Methods : given interval [0,1] on the random number (subject to uniform distribution) as the root equation p*. set up your classes at a3, after learning of the double-digit for a1 and a2, so you get the three equations for example : your 31 classes on the 12th, then your equation is 21x3 60x2 2x a0 = 0 forms. the equation coefficients a0 you get from the root of p* to determine.
Platform: |
Size: 1024 |
Author: 董方 |
Hits:
Description:
改进的牛顿法求解：
方程的构造方法:给出[0,1]区间上的随机数(服从均匀分布)作为方程的根p*.
设你的班级数为a3,学号的后两位数分别为a2与a1,从而得到你的三次方程
例如:你的31班的12号,则你的方程是21x3+60x2+2x+a0=0的形式.
方程中的系数a0由你得到的根p*来确定.
-improve Newton's method : Construction of the equation : given interval [0,1] on the random number (subject to uniform distribution) as the root equation p*. set up your classes at a3, after learning of the double-digit for a1 and a2, so you get the three equations for example : Your 31 classes on the 12th, then your equation is 21x3 60x2 2x a0 = 0 forms. the equation coefficients a0 you get from the root of p* to determine.
Platform: |
Size: 1024 |
Author: 董方 |
Hits:
Description: 抛物线法求解
方程的构造方法:给出[0,1]区间上的随机数(服从均匀分布)作为方程的根p*.
设你的班级数为a3,学号的后两位数分别为a2与a1,从而得到你的三次方程
例如:你的31班的12号,则你的方程是21x3+60x2+2x+a0=0的形式.
方程中的系数a0由你得到的根p*来确定.
-parabolic equation method Construction Methods : given interval [0,1] on the random number (subject to uniform distribution) as the root equation p*. set up your classes at a3, after learning of the double-digit for a1 and a2, so you get the three equations for example : your 31 classes on the 12th, then your equation is 21x3 60x2 2x a0 = 0 forms. the equation coefficients a0 you get from the root of p* to determine.
Platform: |
Size: 1024 |
Author: 董方 |
Hits:
Description: java编程思想中文第三版(PDF)
本书已经成为广大java程序员和爱好者们手中必备的宝典,它在广大读者心中的地位已无可替代.其作者Bruce Eckel 也已经成为众多java 程序员心中的大师.-java programming Chinese thinking third edition (PDF) this book has become the java-loving programmers and get the required hands, the book in the hearts of its readers, the status irreplaceable. its author Bruce Eckel has become a large jav a master programmer mind.
Platform: |
Size: 4011008 |
Author: super |
Hits:
Description: 这是微软的视频压缩标准VC-1的spec文档，VC-1和H.264一样是下一代数字高清电视的视频压缩标准。和较为公开的H.264不同，VC-1是SMTP(美国电影协会）所有，只有付费才能拿到对应的代码和spec.-This is Microsoft s video compression standard VC-1 of the spec file, VC-1 and H.264, is a next-generation digital high-definition television video compression standards. And a more open H.264 different, VC-1 is the SMTP (Motion Picture Association of America) all, and only pay to get the corresponding code and spec.
Platform: |
Size: 2289664 |
Author: gao |
Hits:
Description: 一体美国原版书，好不容易才搞到的。网上没有的，是别人扫描下来的。对通信专业的人很有用-One American original book, managed to get the. Not online, is to scan down others. Of communication were very useful professional
Platform: |
Size: 23563264 |
Author: 王云 |
Hits:
Description: 功能基本实现，录入合法的LL1文法，将输出LL1预测分析表-Function of the basic implementation, input the valid LL1 grammar, you ll get the output-LL1 prediction analysis table
Platform: |
Size: 54272 |
Author: MrChen |
Hits:
Description: 這是一份介紹ASP.NET基本概念的電子書
這份電子書是一份屬於power pointer 的檔案.它包括14份講義,容量為4.24MB-it is a power pointer to introduce basic
concepts in ASP.NET you can get the basic concepts from this materials. It includes 14 lecture notes. it has about 4.24MB of size.
Platform: |
Size: 4450304 |
Author: fongpuichi |
Hits:
Description: OLED DISPLAY MODULE
I m using a 160x128 Graphic OLED Display from Densitron (DD-160128FC-2A) with the ATmega1281. The LCD is controlled via a SEPS525 OLED Driver IC. I use the LCD in 8bit parallel mode.
Both the LCD and controller datasheet is VERY vague and I struggle to get the LCD to respond.
The OLED controller is configured via 3 registers, IR (Index), WDR (Write Data Register) & RDR (Read Data Register).
It is the first time I come across this register INDEXING method and can t find any examples or discussions on the control sequence.
Platform: |
Size: 560128 |
Author: ren |
Hits:
Description: 获取隐藏进程, 获取隐藏进程, -get the hidden process，get the hidden process，get the hidden process
Platform: |
Size: 2048 |
Author: 马鹏斐 |
Hits:
Description: 这是Java编程思想的第四版的英文版的pdf格式的简版 希望获得英语版的朋友可参考下-This is the fourth edition of Java programming ideas in English pdf format version of Jane' s friends want to get the English version can be found under the
Platform: |
Size: 4197376 |
Author: 笃行 |
Hits:
Description: 抓图小工具REV 3.0 可独立批量抓图
新增批量抓图功能，带更新图片功能，可设置时间间隔、抓取数量、信息提示、放大镜功能、方向键微调功能。
批量抓图技巧：
针对网页验证码需要点击更新再抓取的，勾选[点击更新图片]，鼠标拖动[坐标获取]的右边图形移动到需要点击的地方自动获取坐标，设置时间间隔，设置抓取数量，点击批量抓图按钮，完成！
如果不需要点击更新不勾选[点击更新图片]即可
本程序可辅助OCR识别，图形识别与自动控制-Grab a small tool independently REV 3.0 New Batch Capture Batch Capture feature, with updated picture functions, you can set time interval, the number of crawling, information, tips, a magnifying glass function, the arrow keys to fine-tune the functionality. Batch Capture techniques: code for web pages need to click update and then to crawl, check [click Update Photo], drag the mouse [coordinates to obtain] the right of the graph need to click where to move to automatic acquisition coordinates, set the time interval, set the grab the number, click on Batch Capture button to complete! If you do not click the update does not check the [Click the Update Photo] can this program can assist OCR recognition, pattern recognition and automatic control
Platform: |
Size: 86016 |
Author: moto |
Hits: