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

two-column

  • 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

  • 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

  • 基于多尺度字典的图像超分辨率重建

    Reconstruction- and example-based super-resolution (SR) methods are promising for restoring a high-resolution (HR) image from low-resolution (LR) image(s). Under large magnification, reconstruction-based methods usually fail to hallucinate visual details while example-based methods sometimes introduce unexpected details. Given a generic LR image, to reconstruct a photo-realistic SR image and to suppress artifacts in the reconstructed SR image, we introduce a multi-scale dictionary to a novel SR method that simultaneously integrates local and non-local priors. The local prior suppresses artifacts by using steering kernel regression to predict the target pixel from a small local area. The non-local prior enriches visual details by taking a weighted average of a large neighborhood as an estimate of the target pixel. Essentially, these two priors are complementary to each other. Experimental results demonstrate that the proposed method can produce high quality SR recovery both quantitatively and perceptually.

    标签: Super-resolution Multi-scale Dictionary Single Image for

    上传时间: 2019-03-28

    上传用户:fullout

  • Bi-density twin support vector machines

    In this paper we present a classifier called bi-density twin support vector machines (BDTWSVMs) for data classification. In the training stage, BDTWSVMs first compute the relative density degrees for all training points using the intra-class graph whose weights are determined by a local scaling heuristic strategy, then optimize a pair of nonparallel hyperplanes through two smaller sized support vector machine (SVM)-typed problems. In the prediction stage, BDTWSVMs assign to the class label depending on the kernel density degree-based distances from each test point to the two hyperplanes. BDTWSVMs not only inherit good properties from twin support vector machines (TWSVMs) but also give good description for data points. The experimental results on toy as well as publicly available datasets indicate that BDTWSVMs compare favorably with classical SVMs and TWSVMs in terms of generalization

    标签: recognition Bi-density machines support pattern vector twin for

    上传时间: 2019-06-09

    上传用户:lyaiqing