搜索结果
找到约 547 项符合
J-LinkV 的查询结果
源码 计算声学响度
Computation of loudness (Zwicker model) according to ISO 532B / DIN 45631 norms. 
This model is valid for steady sounds.
Code based on BASIC program published in the following article:
Program for calculating loudness according to DIN 45 631 (ISO 532B)",
E.Zwicker and H.Fastl, J.A.S.J (E) 12, 1 ...
源码 多项式计算代码
void DFS(MGraph G, int i)
{
    int j;
    visited[i] = TRUE;
    printf("%c ",    G.vexs[i]);
&nbsp; &nbsp; for (j=0; j<G.numVertexes; ++j)
&nbsp; &nbsp; {
&nbsp; &nbsp; &nbsp; &nbsp; if (G.arc[i][j]!=INFINITY &nbsp;&& &nbsp;!visited[j])
&nbsp; &nbsp; &nbsp; ...
源码 运动会源代码
#include&nbsp;<malloc.h>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;
#include&nbsp;<stdio.h>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;
#include&nbsp;<stdlib.h>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;
#include&nbsp;<string.h>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;
#define&nbsp;NULL&nbsp;0&nbsp;&nbsp; &nbsp;&nbsp ...
软件 学生成绩查询
#include "string.h"
#include "ctype.h"
#include "stdio.h"
search(char pd[])
{FILE *fp;
int time=0,i=0,j=0,add[80],k=0,m;
char *ch,
str[900];
m=strlen(pd);
if((fp=fopen("haha.txt","r"))==NULL)
{
printf("Cannot open this file\n");
exit(0);
}
for(;!feof(fp);i++)
{
str[i]=fgetc(fp);
if(to ...
源码 学生成绩管理啊
#include "string.h"
#include "ctype.h"
#include "stdio.h"
search(char pd[])
{FILE *fp;
&nbsp;int time=0,i=0,j=0,add[80],k=0,m;
&nbsp;char *ch,
&nbsp;str[900];
&nbsp;m=strlen(pd);
&nbsp;if((fp=fopen("haha.txt","r"))==NULL)
&nbsp;{
&nbsp; printf("Cannot open this file\n");
&nbsp; exit(0);
&nbsp;}
for( ...
论文 移动通信虚拟教学实验系统的设计与开发(硕士毕业论文)
移动通信是通信、电子信息类专业的-f-j主要课程，一直被各高校所重视，但
该课程的覆盖面广、内容多，概念理解起来比较抽象。实验课程作为理论课程的重
要补充，可以很好的弥补书本教学的直观性不足。目前的移动通信实验系统大多是
以实验箱配合PC机的模式，但局限于演示和验证性的实验内容教学效果较差，同
时也很难激发学 ...
书籍 Stream of Variation Modeling and Analysis
Shi J. -Stream of Variation Modeling and Analysis for Multistage Manufacturing Processes-CRC Press (2006)
偏差流经典教材
密歇根大学 史建军
源码 java学生数据库
/*import java.util.Scanner;
//主类
public class student122 {
&nbsp;&nbsp;//主方法
&nbsp;&nbsp;public static void main(String[] args){
&nbsp;&nbsp;&nbsp;&nbsp;//定义7个元素的字符数组
&nbsp;&nbsp;&nbsp;&nbsp;String[] st = new String[7];
&nbsp;&nbsp;&nbsp;&nbsp;inputSt(st); &nbsp ...
源码 c语言算法排序
1．Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and
another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.)
#include<stdio.h>
#include<stdlib.h>
void merge(int arr[],int low,int mid,int high){
&nbsp; ...