亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

nd-ed-Vol-two

  • a sub-cell WENO reconstruction method

    We introduce a sub-cell WENO reconstruction method to evaluate spatial derivatives in the high-order ADER scheme. The basic idea in our reconstruction is to use only r stencils to reconstruct the point-wise values of solutions and spatial derivatives for the 2r-1 th order ADER scheme in one dimension, while in two dimensions, the dimension-by-dimension sub-cell reconstruction approach for spatial derivatives is employed. Compared with the original ADER scheme of Toro and Titarev (2002) [2] that uses the direct derivatives of reconstructed polynomials for solutions to evaluate spatial derivatives, our method not only reduces greatly the computational costs of the ADER scheme on a given mesh, but also avoids possible numerical oscillations near discontinuities, as demonstrated by a number of one- and two-dimensional numerical tests. All these tests show that the 5th-order ADER scheme based on our sub-cell reconstruction method achieves the desired accuracy, and is essentially non-oscillatory and computationally cheaper for problems with discontinuities.

    標簽: 高精度格式

    上傳時間: 2016-01-13

    上傳用戶:ccsdcczd

  • Phase Unwrapping 2D

    Two 2D phase unwrapping approaches are included:  1. Phase quality guided path following method.  2. Goldstein's branch cut method. The algorithms are described in:  D. C. Ghiglia and M. D. Pritt, Two-Dimensional Phase Unwrapping:  Theory, Algorithms and Software. New York: Wiley-Interscience, 1998.

    標簽: Unwrapping Phase 2D

    上傳時間: 2016-04-30

    上傳用戶:seanjsj

  • 2N5550,2N5551

    2N5550,2N5551 amplifier transistors NPN silicon. This document describes the features of 2N5550 and 2N5551. You can check or search the characteristics of these two transistors by this document and decide which transistor you need.

    標簽: 2N5550 2N5551 數據手冊

    上傳時間: 2016-07-19

    上傳用戶:hsuhueisan

  • msp430f

     Knobs in consumer, appliances, and automotive technologies at lower system cost and power. ? Linear and rotational encoders The LDC1312 and LDC1314 are easily configured via ? Buttons in home electronics, wearables, an I2C interface. The two-channel LDC1312 is manufacturing, and automotive available in a WSON-12 package and the fourchannel LDC1314 is available in a WQFN-16? Keypads in manufacturing and appliances package.? Slider buttons in consumer products ? Metal detection in industrial and automotive 

    標簽: 430f msp 430

    上傳時間: 2016-07-22

    上傳用戶:tongmoonsky

  • 傳感器網絡中基于到達時間差有效的凸松弛方法的穩健定位

    We consider the problem of target localization by a network of passive sensors. When an unknown target emits an acoustic or a radio signal, its position can be localized with multiple sensors using the time difference of arrival (TDOA) information. In this paper, we consider the maximum likelihood formulation of this target localization problem and provide efficient convex relaxations for this nonconvex optimization problem.We also propose a formulation for robust target localization in the presence of sensor location errors. Two Cramer-Rao bounds are derived corresponding to situations with and without sensor node location errors. Simulation results confirm the efficiency and superior performance of the convex relaxation approach as compared to the existing least squares based approach when large sensor node location errors are present.

    標簽: 傳感器網絡

    上傳時間: 2016-11-27

    上傳用戶:xxmluo

  • 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.)

    標簽: 算法 排序

    上傳時間: 2017-04-01

    上傳用戶:糖兒水嘻嘻

  • 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){      int i,k;      int *tmp=(int*)malloc((high-low+1)*sizeof(int));      int left_low=low;      int left_high=mid;      int right_low=mid+1;      int right_high=high;      for(k=0;left_low<=left_high&&right_low<=right_high;k++)      {      if(arr[left_low]<=arr[right_low]){                                        tmp[k]=arr[left_low++];                                        }      else{           tmp[k]=arr[right_low++];           } }             if(left_low<=left_high){                              for(i=left_low;i<=left_high;i++){                                                               tmp[k++]=arr[i];                                                               }                              }       if(right_low<=right_high){                              for(i=right_low;i<=right_high;i++)                                                                tmp[k++]=arr[i];                                                        }                              for(i=0;i<high-low+1;i++)                                                       arr[low+i]=tmp[i];       } void merge_sort(int a[],int p,int r){      int q;      if(p<r){              q=(p+r)/2;              merge_sort(a,p,q);              merge_sort(a,q+1,r);              merge(a,p,q,r);              }      } int main(){     int a[8]={3,5,8,6,4,1,1};     int i,j;     int x=10;     merge_sort(a,0,6);     printf("after Merging-Sort:\n");     for(i=0;i<7;i++){                      printf("%d",a[i]);                      }     printf("\n");     i=0;j=6;     do{                                    if(a[i]+a[j]==x){                                  printf("exist");                                  break;                                  }                  if(a[i]+a[j]>x)                                 j--;                  if(a[i]+a[j]<x)                                 i++;                       }while(i<=j);     if(i>j)              printf("not exist");     system("pause");     return 0;     }

    標簽: c語言 算法 排序

    上傳時間: 2017-04-01

    上傳用戶:糖兒水嘻嘻

  • MPO與MTP接插件的定義與區別

    The CommScope InstaPATCH? 360 and ReadyPATCH? solutions utilize a standards-compliant multi-fiber connector to provide high density termination capability. The connector is called an MPO (Multi-fiber Push On) connector by the standards. In many cases, multi-fiber connector products are referred to as MTP connectors. This document is intended to clarify the difference between the two terms – MPO and MTP.

    標簽: MPO MTP 插件 定義

    上傳時間: 2017-04-12

    上傳用戶:asdfghjkl1234567890

  • 無線信道仿真代碼

    Modelling the Wireless Propagation Channel -A simulation approach with Matlab - 1st Ed一書中的所有程序

    標簽: 無線信道 仿真 代碼

    上傳時間: 2017-05-17

    上傳用戶:zhaoyaqun

  • L9352B

    Description The L9352B is an integrated quad low-side power switch to drive inductive loads like valves used in ABS systems. Two of the four channels are current regulators with current range from 0 mA to 2.25 A. All channels are protected against fail functions. They are monitored by a status output.

    標簽: L9352B

    上傳時間: 2019-03-27

    上傳用戶:guaixiaolong

主站蜘蛛池模板: 通江县| 鲁山县| 合山市| 罗江县| 平武县| 霍州市| 汉川市| 镇平县| 茶陵县| 广饶县| 南汇区| 平邑县| 太和县| 锡林浩特市| 穆棱市| 铜陵市| 屯门区| 高雄县| 岑溪市| 水富县| 东乌珠穆沁旗| 万源市| 天峻县| 扎囊县| 新乡县| 温州市| 平谷区| 兴山县| 新郑市| 米脂县| 万宁市| 祥云县| 丰宁| 磐安县| 三亚市| 韶山市| 贵阳市| 龙井市| 南召县| 同德县| 游戏|