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

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

and-<b>Computational</b>-science

  • 本文開發了一套基于J2EE技術的新兵思想評估系統。該系統基于多層B/S軟件架構

    本文開發了一套基于J2EE技術的新兵思想評估系統。該系統基于多層B/S軟件架構,提高了系統的穩定性、靈活性及安全性;通過使用UML的系統分析,MVC、DAO等設計模式及面向對象(VC++)的設計和開發,采用Spring、Hibernate、WebWork等框架技術,提高了開發的效率,為相關系統的設計開發探索了一條新思路。

    標簽: J2EE 評估系統 多層

    上傳時間: 2013-12-24

    上傳用戶:gxf2016

  • 高斯亞當消去法 GAUSSJ(A[],N,B[])用這個子過程實現高斯亞當消去法

    高斯亞當消去法 GAUSSJ(A[],N,B[])用這個子過程實現高斯亞當消去法

    標簽: GAUSSJ 高斯 子過程

    上傳時間: 2015-08-29

    上傳用戶:541657925

  • 生產排程計劃的一份源碼.JAVA.B/S結構的。希望對一部分人有幫助

    生產排程計劃的一份源碼.JAVA.B/S結構的。希望對一部分人有幫助

    標簽: JAVA 源碼

    上傳時間: 2015-08-30

    上傳用戶:小草123

  • BackProp算法:經典的B-P算法.

    BackProp算法:經典的B-P算法.

    標簽: BackProp B-P 算法

    上傳時間: 2014-11-22

    上傳用戶:xc216

  • by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See

    by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) the text of Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon

    標簽: L. published Schwartz Edition

    上傳時間: 2014-11-29

    上傳用戶:kr770906

  • by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See

    by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon

    標簽: L. published Schwartz Edition

    上傳時間: 2015-09-03

    上傳用戶:lifangyuan12

  • This text introduces the spirit and theory of hacking as well as the science behind it all it also p

    This text introduces the spirit and theory of hacking as well as the science behind it all it also provides some core techniques and tricks of hacking so you can think like a hacker, write your own hacks or thwart potential system attacks. 譯作:《黑客入侵的藝術》,也是從朋友的寶箱中搜來的,以前層大致瀏覽過,是難得一件的好資料。

    標簽: introduces the hacking science

    上傳時間: 2013-12-28

    上傳用戶:離殤

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

    標簽: Implemented following compile command

    上傳時間: 2014-01-01

    上傳用戶:lhc9102

  • 1.24位真彩色->256色灰度圖。 2.預處理:中值濾波。 3.二值化:用一個初始閾值T對圖像A進行二值化得到二值化圖像B。 初始閾值T的確定方法是:選擇閾值T=Gmax-(Gmax-G

    1.24位真彩色->256色灰度圖。 2.預處理:中值濾波。 3.二值化:用一個初始閾值T對圖像A進行二值化得到二值化圖像B。 初始閾值T的確定方法是:選擇閾值T=Gmax-(Gmax-Gmin)/3,Gmax和Gmin分別是最高、最低灰度值。 該閾值對不同牌照有一定的適應性,能夠保證背景基本被置為0,以突出牌照區域。 4.削弱背景干擾。對圖像B做簡單的相鄰像素灰度值相減,得到新的圖像G,即Gi,j=|Pi,j-Pi,j-1|i=0,1,…,439 j=0,1,…,639Gi,0=Pi,0,左邊緣直接賦值,不會影響整體效果。 5.用自定義模板進行中值濾波 區域灰度基本被賦值為0。考慮到文字是由許多短豎線組成,而背景噪聲有一大部分是孤立噪聲,用模板(1,1,1,1,1)T對G進行中值濾波,能夠得到除掉了大部分干擾的圖像C。 6.牌照搜索:利用水平投影法檢測車牌水平位置,利用垂直投影法檢測車牌垂直位置。 7.區域裁剪,截取車牌圖像。

    標簽: Gmax-G 1.24 Gmax 閾值

    上傳時間: 2014-01-08

    上傳用戶:songrui

  • 2005 Center for Biological & Computational Learning at MIT and MIT All rights reserved. Permissio

    2005 Center for Biological & Computational Learning at MIT and MIT All rights reserved. Permission to copy and modify this data, software, and its documentation only for internal research use in your organization is hereby granted, provided that this notice is retained thereon and on all copies. This data and software should not be distributed to anyone outside of your organization without explicit written authorization by the author(s) and MIT.

    標簽: Computational Biological MIT Permissio

    上傳時間: 2014-01-27

    上傳用戶:gaome

主站蜘蛛池模板: 房山区| 古蔺县| 涞水县| 乐山市| 玉龙| 永仁县| 奉贤区| 湖北省| 沐川县| 佳木斯市| 定日县| 成都市| 旺苍县| 大兴区| 长岛县| 泊头市| 普洱| 西藏| 水富县| 仪陇县| 司法| 隆林| 揭西县| 库车县| 富顺县| 东安县| 邢台县| 石河子市| 鄱阳县| 慈溪市| 闽清县| 崇信县| 三江| 丘北县| 江华| 武山县| 彰化县| 宜川县| 乐昌市| 满洲里市| 安多县|