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

not

  • Matlab trainning

    Basic introduction of Matlab functions Easy example code and explanation  Fit those users who are not familiar with Matlab

    标签: Matlab;trainning

    上传时间: 2015-12-22

    上传用户:cjw560467

  • 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

  • GoAhead Webs 2.1.5

    ===================================== GoAhead WebServer 2.1.8 Release notes ===================================== .. notES: .. This document is maintained using the reStructuredText markup system. .. You may download this from <http://docutils.sf.net>. Also note that running .. the docutils code requires that a version of Python version 2.1 or later .. be installed on the machine. Since the GoAhead release procedure itself .. runs in Python, this should not be a problem. .. .. To add new entries to the release notes, follow the markup shown below .. (releases should be underlined with a row of '=' characters, each item .. noted within a release should be underlined with '-' characters.

    标签: web server embedded arm

    上传时间: 2016-01-30

    上传用户:zrxkn

  • GoAhead Webs 2.1.5 embedded webserver arm

    ===================================== GoAhead WebServer 2.1.8 Release notes ===================================== .. notES: .. This document is maintained using the reStructuredText markup system. .. You may download this from <http://docutils.sf.net>. Also note that running .. the docutils code requires that a version of Python version 2.1 or later .. be installed on the machine. Since the GoAhead release procedure itself .. runs in Python, this should not be a problem. .. .. To add new entries to the release notes, follow the markup shown below .. (releases should be underlined with a row of '=' characters, each item .. noted within a release should be underlined with '-' characters.

    标签: web html embed server arm small http

    上传时间: 2016-01-30

    上传用户:zrxkn

  • 计算本征值程序

    Computes all eigenvalues and eigenvectors of a real symmetric matrix a, ! which is of size n by n, stored in a physical np by np array. ! On output, elements of a above the diagonal are destroyed. ! d returns the eigenvalues of a in its first n elements. ! v is a matrix with the same logical and physical dimensions as a, ! whose columns contain, on output, the normalized eigenvectors of a. ! nrot returns the number of Jacobi rotations that were required. ! Please notice that the eigenvalues are not ordered on output. ! If the sorting is desired, the addintioal routine "eigsrt" ! can be invoked to reorder the output of jacobi.

    标签: 计算 程序

    上传时间: 2016-06-04

    上传用户:1512313

  • 32feet.NET 3.5 Bluetooth coding

    32feet.NET is a shared-source project to make personal area networking technologies such as Bluetooth, Infrared (IrDA) and more, easily accessible from .NET code. Supports desktop, mobile or embedded systems. 32feet.NET is free for commercial or non-commercial use. If you use the binaries you can just use the library as-is, if you make modifications to the source you need to include the 32feet.NET License.txt document and ensure the file headers are not modified/removed. The project currently consists of the following libraries:- Bluetooth IrDA Object Exchange Bluetooth support requires a device with either the Microsoft, Widcomm, BlueSoleil, or Stonestreet One Bluetopia Bluetooth stack. Requires .NET Compact Framework v3.5 or above and Windows CE.NET 4.2 or above, or .NET Framework v3.5 for desktop Windows XP, Vista, 7 and 8. A subset of functionality is available for Windows Phone 8 and Windows Embedded Handheld 8 in the InTheHand.Phone.Bluetooth.dll library.

    标签: feet 3.5 NET 32

    上传时间: 2016-07-06

    上传用户:magister2016

  • asp实现限制一个ip只能访问一次的方法

    asp实现限制一个ip只能访问一次的方法 <%  '/////////////////////////////////////////////////////  '// //  '//作用:一个IP地址只允许访问本页一次 //  '//引用:<!-- #include file="Check_Ip.asp" --> //  '// //  '/////////////////////////////////////////////////////    'Response.Charset = 936 '设置输出编码为简体中文  'Response.Buffer = false '关闭缓冲区    Dim Fso,ts,IpList,Cfs    '设置Cookies函数  Function SetCookie()  Response.Cookies("IsBrow") = "Brow" Response.Cookies("IsBrow").Expires = Date+365  End Function    '记录IP地址函数  Function WriteIp(FileName, IpAddress)  Set Fso = Server.CreateObject("Scripting.FileSystemObject")  Set ts = Fso.OpenTextFile(Server.MapPath(FileName),8,true)  ts.WriteLine IpAddress  ts.Close  Set ts = nothing  Set Fso = nothing  End Function    '读取IP地址函数  Function ReadIpList(FileName)  Set Fso = Server.CreateObject("Scripting.FileSystemObject")  If not Fso.FileExists(Server.MapPath(FileName)) Then  CreateFile("Iplist.txt")  Exit Function  End If    Set ts = Fso.OpenTextFile(Server.MapPath(FileName))  Iplist = ts.ReadAll  ts.Close  Set ts = nothing  Set Fso = nothing  ReadIpList = Iplist  End Function    '创建文件函数  Function CreateFile(FileName)  Set Fso = Server.CreateObject("Scripting.FileSystemObject")  Set Cfs = Fso.CreateTextFile(Server.MapPath(FileName))  Cfs.Close  Set Cfs = nothing  Set Fso = nothing  End Function    '关闭当前IE窗口函数(注:IE6下通过,其他浏览器未测试)  Function CloseWindow()  'Response.Write "<script>window.location='javascript:window.opener=null;window.close();'</script>"  Response.Redirect "http://www.baidu.com" End Function    Ip = Request.ServerVariables("REMOTE_ADDR") '获取浏览者IP地址    Cookie = Request.Cookies("IsBrow") '获取当前Cookies  'Response.Write Cookie    If Request.ServerVariables("HTTP_X_FORWARDED_FOR") <> "" Then  Response.Write "本站不允许使用代理访问" Response.End()  Else  If Cookie = "Brow" Then  CloseWindow()  Else  If Instr(ReadIpList("Iplist.txt"),Ip) <>0  Then  CloseWindow()  Else  WriteIp "Iplist.txt" , Ip  End If  SetCookie()  End If  End If  %>

    标签: asp 访问

    上传时间: 2016-07-14

    上传用户:helei0915

  • mcp2make 1.0.2

    The version of CodeWarrior used in the ARM Development Suite cannot export projects in makefile format. Manually producing makefiles from CodeWarrior projects is not an easy task. The aim of mcp2make is to make the conversion simpler and to require substantially less effort. mcp2make is supplied as a free-of-charge, unsupported utility.

    标签: mcp2make

    上传时间: 2017-01-19

    上传用户:zbxinu

  • 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

    上传用户:糖儿水嘻嘻