码迷,mamicode.com
首页 >  
搜索关键字:step motor    ( 4140个结果
matlab中使用正弦波合成方波(带动画)
x=0:0.1:6*pi; for step=1:2:100 s=0; for i=1:2:step s = s+1/i*sin(i*x); end plot(s);set(figure(1),'visible','off'); filename=[num2str(step, '%04d'),'.p...
分类:其他好文   时间:2014-07-10 13:49:02    阅读次数:922
Text Converted into Speech in Pi
Step 1: Convert any text into uint8 type in matlab : Step 2: Add models in matlab : copy the uint8 numbers and put them in Repeating Sequence Stair mo...
分类:其他好文   时间:2014-07-10 13:47:42    阅读次数:327
微软职位内部推荐-SENIOR SDE
微软近期Open的职位:This Job is eligible for the following work arrangements :Flex TimeJob Description:Are you ready to take the next step in your career? Do ...
分类:其他好文   时间:2014-07-10 12:35:31    阅读次数:212
Teamcenter10 step-by-step installation in Linux env-Oracle services startup and shutdown
After following the first three posts about Oracle installation, you should finish installing Oracle successfully. We will further discuss how to star...
分类:数据库   时间:2014-07-10 11:07:13    阅读次数:393
[leetcode] Edit Distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
分类:其他好文   时间:2014-07-07 23:16:52    阅读次数:197
Problem Triangle
Problem Description:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For ex...
分类:其他好文   时间:2014-07-07 15:29:11    阅读次数:280
MyEclipse8.5破解方法
Step:1、建立一个任意名称的Java Project2、在该工程中建立一个名文MyEclipseGen的Java文件(MyEclipseGen.java)3、运行下面的代码,会在控制台出现"please input register name:",输入任意一个名字,回车后生成序列号4、点击 My...
分类:系统相关   时间:2014-07-02 00:12:25    阅读次数:264
Compile wireless driver on Lenovo W520 with Debian
First step: I have to make the wireless ethernet card start to work for my Lenovo W520 with Debian installed. Initially, I installed the package firmw...
分类:其他好文   时间:2014-06-30 13:47:42    阅读次数:257
Edit Distance
题目 Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 operations permitte...
分类:其他好文   时间:2014-06-30 00:46:38    阅读次数:262
正整数划分的另一种解法 (纯递归)
Step 1: n ==1 : return 1 n == 2 : return  [1,1],[2]Step 2:for n > 2a.arr.push(n)b.arr.push([n-1,1])c.1 get result of recursion(n-2)c.2 combine n==2 & result => retc.3 remove duplicate record in retcod...
分类:其他好文   时间:2014-06-28 07:17:11    阅读次数:255
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!