虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

DSP-Applications-<b>usINg</b>-C-and-the-

  • OpenOffice.org document containing: List of codes i have tested on a JinPeng C2000 mobile and the

    OpenOffice.org document containing: List of codes i have tested on a JinPeng C2000 mobile and their results. Some works, others not it is explained what code does if work. They are introduced where you type digits when making a call, unless specify it is not necesary to press call, like for wellknown *#06# -> that shows IMEI.

    标签: OpenOffice containing document JinPeng

    上传时间: 2013-12-13

    上传用户:BIBI

  • OpenOffice.org document containing: List of codes i have tested on a JinPeng C2000 mobile and the

    OpenOffice.org document containing: List of codes i have tested on a JinPeng C2000 mobile and their results. Some works, others not it is explained what code does if work. They are introduced where you type digits when making a call, unless specify it is not necesary to press call, like for wellknown *#06# -> that shows IMEI.

    标签: OpenOffice containing document JinPeng

    上传时间: 2017-04-05

    上传用户:13517191407

  • Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a

    Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.

    标签: Multiplicative undirected Shortest measured

    上传时间: 2017-04-08

    上传用户:邶刖

  • In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o

    In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.

    标签: optimizing different the shortest

    上传时间: 2014-10-25

    上传用户:1159797854

  • full wave rectifierDuring the period from 伪 to 蟺, the input voltage vs input current is are positive

    full wave rectifierDuring the period from 伪 to 蟺, the input voltage vs input current is are positive and the power flows from supply to the load. The converter is said to be operated at rectification mode .During the period from 蟺 to 蟺+伪 , the input voltage vs is negative and the input current is is positive and reverse power flows from load to the supply. The converter is said to be operated in inversion mode. Depending on the value of 伪, average output voltage can be either positive or negative and hence provides 2 quadrant operation.

    标签: input rectifierDuring the positive

    上传时间: 2017-04-10

    上传用户:alan-ee

  • I ll probably write up a short article next week outlining how the ActionScript works, so people can

    I ll probably write up a short article next week outlining how the ActionScript works, so people can modify it, and work with it more easily in Flex. You can download the component and source code here. There are some instructions in the FLA on how to use it. Note that this is not a compiled component, so it won t show up in the components panel. You will have to copy the component, and the source file into your project. If anyone really wants a compiled version, let me know and I can provide one. As always, I d love to hear how people use it, and would appreciate it if you would post back to the comments if you make any significant modifications so that other people can benefit from them.

    标签: ActionScript outlining probably article

    上传时间: 2017-04-20

    上传用户:c12228

  • 一道程序编译顺序的考题

    一道程序编译顺序的考题,涉及到函数调用的先后顺序及运算符号的优先级等问题。下面我展开给你讲。 C的程序编译总是从main函数开始的,这道题的重点在“fun((int)fun(a+c,b),a-c)) ”语句。 系统首先要确定最外层 fun()函数的实参,第一个参数的确定需要递归调用fun()函数(不妨称其为内层函数)。内层函数的两个参数分别为x=a+b=2+8=10、y=b=5,执行函数体x+y=10+5=15,于是得外层函数的参数x=15。其另一个参数y=a-c=2-b=-6,再次执行函数体,得最终返回值x+y=15+(-6)=9。

    标签: 程序编译

    上传时间: 2014-12-03

    上传用户:徐孺

  • This example sets up the PLL in x10/2 mode, divides SYSCLKOUT by six to reach a 25Mhz HSPCLK (assumi

    This example sets up the PLL in x10/2 mode, divides SYSCLKOUT by six to reach a 25Mhz HSPCLK (assuming a 30Mhz XCLKIN). The clock divider in the ADC is not used so that the ADC will see the 25Mhz on the HSPCLK. Interrupts are enabled and the EVA is setup to generate a periodic ADC SOC on SEQ1. Two channels are converted, ADCINA3 and ADCINA2.

    标签: SYSCLKOUT example divides HSPCLK

    上传时间: 2014-01-25

    上传用户:ljt101007

  • 用JAVA开发的提醒精灵

    用JAVA开发的提醒精灵,是B/S与C/S很好的结合!

    标签: JAVA

    上传时间: 2017-04-29

    上传用户:啊飒飒大师的

  • Professional Android Application Development,英文,内容详尽,适合进阶 Chapter 1: Hello, Android . . . . . . . .

    Professional Android Application Development,英文,内容详尽,适合进阶 Chapter 1: Hello, Android . . . . . . . . . . . . . . . . . . . . .. . Chapter 2: Getting Started . . . . . . . . . . . . . . . . . . . .. . Chapter 3: Creating Applications and Activities . . . . . . . . . . . Chapter 4: Creating User Interfaces . . . . . . . . . . . . . . . .. . Chapter 5: Intents, Broadcast Receivers, Adapters, and the Internet113 Chapter 6: Data Storage, Retrieval, and Sharing . . . . . . . . . .. . Chapter 7: Maps, Geocoding, and Location-Based Services . . . . . .. Chapter 8: Working in the Background . . . . . . . . . . . . . . . . . Chapter 9: Peer-to-Peer Communication . . . . . . . . . . . . . . .. . Chapter 10: Accessing Android Hardware . . . . . . . . . . . . . . . . Chapter 11: Advanced Android Development . . . . . . . . . . . . .. . Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

    标签: Android Professional Application Development

    上传时间: 2013-12-12

    上传用户:aig85