moto e2 基站定位0.1版软件，基于moto e2的sdk和使用arm-linux-g
上传时间： 2013-12-18
上传用户：
图的深度遍历，输出结果为（红色为键盘输入的数据，权值都置为1）： 输入顶点数和弧数:8 9 输入8个顶点. 输入顶点0:a 输入顶点1:b 输入顶点2:c 输入顶点3:d 输入顶点4:e 输入顶点5:f 输入顶点6:g 输入顶点7:h 输入9条弧. 输入弧0:a b 1 输入弧1:b d 1 输入弧2:b e 1 输入弧3:d h 1 输入弧4:e h 1 输入弧5:a c 1 输入弧6:c f 1 输入弧7:c g 1 输入弧8:f g 1 深度优先遍历: a b d h e c f g 程序结束.
标签：
上传时间： 2016-04-04
上传用户：lht618
Atheros无线芯片AR-6000系列wince 6驱动源代码(这东西我也没用过别问我,我是搜别的wince资源搜到的) AR6K SDIO support. Requires firmware 1.1 on SD13 cards. readme: Atheros Communications AR6001 WLAN Driver for SDIO installation Read Me March 26,2007 (based on k14 fw1.1) Windows CE Embedded CE 6.0 driver installation. 1. Unzip the installation file onto your system (called installation directory below) 2. Create an OS design or open an existing OS design in Platform Builder 6.0. a. The OS must support the SD bus driver and have an SD Host Controller driver (add these from Catalog Items). b. Run image size should be set to allow greater than 32MB. 3. a. From the Project menu select Add Existing Subproject... b. select AR6K_DRV.pbxml c. select open This should create a subproject within your OS Design project for the AR6K_DRV driver. 4. Build the solution. 转自Tony嵌入式,原文地址：http://www.cevx.com/bbs/dispbbs.asp?boardID=4&ID=11762&page=1
标签： wince Requires firmware Atheros
上传时间： 2014-11-11
上传用户：bibirnovis
Fraqtive is a program for drawing Mandelbrot and Julia fractals. It uses a very fast algorithm and generates high quality, smooth images.
标签： Mandelbrot and algorithm Fraqtive
上传时间： 2016-04-12
上传用户：独孤求源
华恒科技 HHCF5249-R3 技术手册 第一章 产品简介 第二章 软件系统 第三章 硬件系统 第四章 机械特性 第五章 底板的硬件设计 第六章 售后服务及技术支持 附录 附录A 初始化 附录B LINUX 常见术语 附录C 常用LINUX 命令 附录D GCC 与GDB 附录E MAKEFILE 附录F UCLINUX 系统分析 uClinux 简介 uClinux 小型化的做法 uClinux 的开发环境 uClinux 的内存管理 工具及内核 附录G 图形界面（GUI）接口函数API 附录H 参考资料
上传时间： 2013-12-24
上传用户：a6697238
sbgcop: Semiparametric Bayesian Gaussian copula estimation This package estimates parameters of a Gaussian copula, treating the univariate marginal distributions as nuisance parameters as described in Hoff(2007). It also provides a semiparametric imputation procedure for missing multivariate data. Version: 0.95 Date: 2007-03-09 Author: Peter Hoff Maintainer: Peter Hoff <hoff at stat.washington.edu> License: GPL Version 2 or later URL: http://www.stat.washington.edu/hoff CRAN checks: sbgcop results Downloads: Package source: sbgcop_0.95.tar.gz MacOS X binary: sbgcop_0.95.tgz Windows binary: sbgcop_0.95.zip Reference manual: sbgcop.pdf
标签： Semiparametric estimation parameters estimates
上传时间： 2016-04-15
上传用户：talenthn
sbgcop: Semiparametric Bayesian Gaussian copula estimation This package estimates parameters of a Gaussian copula, treating the univariate marginal distributions as nuisance parameters as described in Hoff(2007). It also provides a semiparametric imputation procedure for missing multivariate data. Version: 0.95 Date: 2007-03-09 Author: Peter Hoff Maintainer: Peter Hoff <hoff at stat.washington.edu> License: GPL Version 2 or later URL: http://www.stat.washington.edu/hoff CRAN checks: sbgcop results Downloads: Windows binary: sbgcop_0.95.zip
标签： Semiparametric estimation parameters estimates
上传时间： 2016-04-15
上传用户：qilin
sbgcop: Semiparametric Bayesian Gaussian copula estimation This package estimates parameters of a Gaussian copula, treating the univariate marginal distributions as nuisance parameters as described in Hoff(2007). It also provides a semiparametric imputation procedure for missing multivariate data. Version: 0.95 Date: 2007-03-09 Author: Peter Hoff Maintainer: Peter Hoff <hoff at stat.washington.edu> License: GPL Version 2 or later URL: http://www.stat.washington.edu/hoff CRAN checks: sbgcop results Downloads: Reference manual: sbgcop.pdf
标签： Semiparametric estimation parameters estimates
上传时间： 2014-12-08
上传用户：一诺88
LR(1)文法实现四则运算程序，支持正整数和浮点数运算，有很强大的排错能力。在VC６.０下开发，能够在G++编译器下编译运行
上传时间： 2014-12-03
上传用户：kelimu
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
标签： mathematician Christian Goldbach Leonhard
上传时间： 2016-04-22
上传用户：wangchong
