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

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

Two-Phase

  • 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

  • 基于頻率插值的4.0kbps 語音編碼器的性能和設計(英文)

    The 4.0 kbit/s speech codec described in this paper is based on a Frequency Domain Interpolative (FDI) coding technique, which belongs to the class of prototype waveform Interpolation (PWI) coding techniques. The codec also has an integrated voice activity detector (VAD) and a noise reduction capability. The input signal is subjected to LPC analysis and the prediction residual is separated into a slowly evolving waveform (SEW) and a rapidly evolving waveform (REW) components. The SEW magnitude component is quantized using a hierarchical predictive vector quantization approach. The REW magnitude is quantized using a gain and a sub-band based shape. SEW and REW phases are derived at the decoder using a phase model, based on a transmitted measure of voice periodicity. The spectral (LSP) parameters are quantized using a combination of scalar and vector quantizers. The 4.0 kbits/s coder has an algorithmic delay of 60 ms and an estimated floating point complexity of 21.5 MIPS. The performance of this coder has been evaluated using in-house MOS tests under various conditions such as background noise. channel errors, self-tandem. and DTX mode of operation, and has been shown to be statistically equivalent to ITU-T (3.729 8 kbps codec across all conditions tested.

    標簽: frequency-domain interpolation performance Design kbit_s speech coder based and of

    上傳時間: 2018-04-08

    上傳用戶:kilohorse

  • 三相整流器LCL濾波器設計

    Design and Control of an LCL-filter-based three-phase active rectifier  早期的文章

    標簽: LCL-filter-based three-phase rectifier control Design active and an of

    上傳時間: 2018-05-19

    上傳用戶:wangweiyaorui

  • 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

  • GSM 03.40

    Digital cellular telecommunications system (Phase 2+); Technical realization of the Short Message Service (SMS) Point-to-Point (PP) (3GPP TS 03.40 version 7.5.0 Release 1998)

    標簽: GSM

    上傳時間: 2019-06-14

    上傳用戶:twogozi

  • GSM 03.48

    Digital cellular telecommunications system (Phase 2+); Security mechanisms for SIM application toolkit; Stage 2 (3GPP TS 03.48 version 8.8.0 Release 1999)

    標簽: GSM

    上傳時間: 2019-06-14

    上傳用戶:twogozi

  • virtual decomposition control

    obot control, a subject aimed at making robots behave as desired, has been extensively developed for more than two decades. Among many books being published on this subject, a common feature is to treat a robot as a single system that is to be controlled by a variety of control algorithms depending on different scenarios and control objectives. However, when a robot becomes more complex and its degrees of freedom of motion increase substantially, the needed control computation can easily go beyond the scope a modern computer can handle within a pre-specified sampling period. A solution is to base the control on subsystem dynamics.

    標簽: decomposition virtual control

    上傳時間: 2019-09-04

    上傳用戶:txb96

主站蜘蛛池模板: 驻马店市| 宜宾市| 临沭县| 巨鹿县| 章丘市| 屏边| 镇康县| 阜新| 体育| 竹北市| 永靖县| 孟连| 金寨县| 东海县| 仙桃市| 出国| 揭西县| 荆州市| 衡阳市| 紫金县| 广水市| 富顺县| 武邑县| 二手房| 儋州市| 孙吴县| 嘉善县| 应城市| 雷波县| 上虞市| 东乡族自治县| 东丰县| 临城县| 博罗县| 山阳县| 辽阳市| 青川县| 延寿县| 福泉市| 尤溪县| 海伦市|