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

implEMent

在java程序中一个类实现接口类时用的关键词。ObjectimplEMentsObject如java中定义的接口Animal,实现接口的类定义如下:publicclassTigerimplEMentsAnimal。
  • In this work an implEMentation of a geometric nonlinear controller for chaos synchronization in a Fi

    In this work an implEMentation of a geometric nonlinear controller for chaos synchronization in a Field Programmable Gate Array (FPGA) is presented. The Lorenz chaotic system is used to show the implEMentation of chaos synchronization via nonlinear controller implEMented in a Xilinx FPGA Virtex-II 2v2000ft896-4. The main idea is to design a nonlinear geometric controller which synchronizes a slave Lorenz system to a master system and then implEMent them into the FPGA.

    标签: synchronization implEMentation controller geometric

    上传时间: 2013-12-17

    上传用户:3到15

  • Abstract - A fl exible multiscale and directional representation for images is proposed. The s

    Abstract - A fl exible multiscale and directional representation for images is proposed. The scheme combines directional fi lter banks with the Laplacian pyramid to provides a sparse representation for two- dimensional piecewise smooth signals resembling images. The underlying expansion is a frame and can be designed to be a tight frame. Pyramidal directional fi lter banks provide an effective method to implEMent the digital curvelet transform. The regularity issue of the iterated fi lters in the directional fi lter bank is examined.

    标签: representation directional multiscale Abstract

    上传时间: 2013-12-15

    上传用户:zxc23456789

  • This book was developed for information technology (IT) professionals who plan to take the related

    This book was developed for information technology (IT) professionals who plan to take the related Microsoft Certified Professional Exam 70-299, implEMenting and Administering Security in a Microsoft Windows Server 2003 Network, and for IT professionals who implEMent and manage software solutions for Windows-based environments using Microsoft tools and technologies.

    标签: professionals information technology developed

    上传时间: 2014-01-08

    上传用户:wang5829

  • Description Combination of book reader and Web browsers. This program can be used for Web browsi

    Description Combination of book reader and Web browsers. This program can be used for Web browsing, reading news sites, downloading and reading books and atricles from the Web. It is not implEMent all HTML browser functionality - it doesn t show images and is not able to proceed forms. The main idea was to make it possible to view normal sites (not WAP sites) on very small screen of mobile phone. This application share a lot of code with MobiReader and first of all is inteded to be used to browse text data.

    标签: Description Combination Web browsers

    上传时间: 2013-12-16

    上传用户:qweqweqwe

  • ISIS Timer Design

    A design about 8051 (running at 12MHz) based system with 3 7-Seg displays and two buttons to implEMent the following functions.  1. When press the + button, the display C = A+B.  2. When press the button, the display C = A - B.  “A” and “B” are 8-bit inputs when “C” is 9-bit output. 

    标签: ISIS AT89C52

    上传时间: 2015-05-05

    上传用户:guoxiy

  • Shop Cart

    An application that adds products to an electronic shopping cart. The application uses three classes: Product, ShoppingCart, and ShoppingCartApplication. Part of the work has been done for you and is provided in the student archive. You will implEMent the method in ShoppingCartApplication that reads product information from the keyboard and creates a Product object.

    标签: Product ShoppingCart

    上传时间: 2015-11-12

    上传用户:chengzi74

  • intel ich 10

    implEMent smbus  ,pci protocol spec.

    标签: intel ich 10h 10 pdf

    上传时间: 2016-08-15

    上传用户:kennyplds

  • 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

    上传用户:糖儿水嘻嘻

  • Eclipse_4_Tutorial

    Talbe of contents:      1、the e4 application model      2、implEMent views      3、extending the application model      4、dependency injiection basic      5、behavior  annotations      6、services      7、eclipse 3.x  vs eclipse 4.- which platform to use?      8、soft migration from 3.x to eclipse 4(e4)

    标签: Tutorial Eclipse

    上传时间: 2017-04-26

    上传用户:xiefy