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

PUBLIC

  • The OReilly Struts book (title not set yet) will be available sometime in the 3rd quarter of 2002.

    The OReilly Struts book (title not set yet) will be available sometime in the 3rd quarter of 2002. Published by OReilly, this book covers both Struts 1.0 and 1.1. The beta or draft chapters are being made available for download to facilitate an early PUBLIC review process for the material.

    标签: available sometime OReilly quarter

    上传时间: 2014-01-22

    上传用户:familiarsmile

  • SQLite is a software library that implements a self-contained, serverless, zero-configuration, trans

    SQLite is a software library that implements a self-contained, serverless, zero-configuration, transactional SQL database engine. SQLite is the most widely deployed SQL database engine in the world. It is used in countless desktop computer applications as well as consumer electronic devices including cellphones, PDAs, and MP3 players. The source code for SQLite is in the PUBLIC domain.

    标签: zero-configuration self-contained implements serverless

    上传时间: 2013-12-09

    上传用户:manlian

  • a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded s

    a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded systems. All crypto protocols require the generation and use of secret values that must be unknown to attackers.Random number generators (RNG) are required to generate PUBLIC/private key pairs for asymmetric algorithm such as RSA and symmetric algorithm such as AES.

    标签: FPGA-based generator embedded hardware

    上传时间: 2014-01-09

    上传用户:一诺88

  • RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digit

    RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, PUBLIC key and private key. PUBLIC key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (PUBLIC key), n=pq Descryption (D) . D=C° mod(n), o = d (private key

    标签: crypthograph information Adleman Rivest

    上传时间: 2017-09-01

    上传用户:chfanjiang

  • 文件Java排课系统的报告

    My JSP 'TeacherMain.jsp' starting page var $=function(id) { return document.getElementById(id); } function show_menu(num){ for(i=0;i

    标签: C++

    上传时间: 2015-07-03

    上传用户:xiyuzhu

  • 多线程游戏

    /**  * 用于在逻辑和界面间传输数据的bean  * @version 1.0  */ PUBLIC class DataBean {     private int first = -1;     private int second = -1;     PUBLIC int getFirst() {         return first;     }     PUBLIC int getSecond() {         return second;     }     PUBLIC void setFirst(int firt) {         this.first = firt;     }     PUBLIC void setSecond(int second) {         this.second = second;     }     /**      * 将1,2次均置为初始状态

    标签: 多线程小游戏 翻牌小游戏

    上传时间: 2015-11-07

    上传用户:dddhhhwww

  • c语言程序源

    #include <iostream> using namespace std; class Student { PUBLIC: Student(int, int); int num; int grade; }; Student::Student(int n, int g) { num = n; grade = g; } int maxGradeIndex(Student* s) { int maxGrade, index = 0, i = 0; maxGrade = s[0].grade; for (i = 0; i<5; i++) { if (s[i].grade > maxGrade) { maxGrade = s[i].grade; index = i; } } return  index; } int main() { Student a[5] = { Student(1, 86), Student(2, 60), Student(3, 72), Student(4, 95), Student(5, 66) }; int maxGradeStNum = maxGradeIndex(a); cout << "成绩最好学生的学号是:" << a[maxGradeStNum].num << endl; cout << "成绩最好学生的成绩是:" << a[maxGradeStNum].grade << endl; getchar(); return 0; }

    标签: c语言 程序

    上传时间: 2016-04-23

    上传用户:burt1025

  • java学生数据库

    /*import java.util.Scanner; //主类 PUBLIC class student122 {   //主方法   PUBLIC static void main(String[] args){     //定义7个元素的字符数组     String[] st = new String[7];     inputSt(st);       //调用输入方法     calculateSt(st);   //调用计算方法     outputSt(st);      //调用输出方法   }   //其他方法   //输入方法 private static void inputSt(String st[]){     System.out.println("输入学生的信息:");   System.out.println("学号 姓名 成绩1,2,3");   //创建键盘输入类   Scanner ss = new Scanner(System.in);   for(int i=0; i<5; i++){     st[i] = ss.next(); //键盘输入1个字符串   } }   //计算方法 private static void calculateSt(String[] st){   int sum = 0;         //总分赋初值 int ave = 0;         //平均分赋初值 for(int i=2;i<5;i++) {   /计总分,字符变换成整数后进行计算   sum += Integer.parseInt(st[i]); } ave = sum/3;         //计算平均分 //整数变换成字符后保存到数组里 st[5] = String.valueOf(sum); st[6] = String.valueOf(ave); }   //输出方法 private static void outputSt(String[] st){     System.out.print("学号 姓名 ");   //不换行   System.out.print("成绩1 成绩2 成绩3 ");   System.out.println("总分 平均分");//换行   //输出学生信息   for(int i=0; i<7; i++){     //按格式输出,小于6个字符,补充空格     System.out.printf("%6s", st[i]);   }   System.out.println();            //输出换行 } }*/   import java.util.Scanner;   PUBLIC class student122 {   PUBLIC static void main(String[] args) { // TODO 自动生成的方法存根 String[][] st = new String[3][8]; inputSt(st); calculateSt(st); outputSt(st); }   //输入方法 private static void inputSt(String st[][]) { System.out.println("输入学生信息:"); System.out.println("班级 学号 姓名 成绩:数学 物理 化学"); //创建键盘输入类 Scanner ss = new Scanner(System.in); for(int j = 0; j < 3; j++) { for(int i = 0; i < 6; i++) { st[j][i] = ss.next(); } } } //输出方法 private static void outputSt(String st[][]) { System.out.println("序号 班级 学号 姓名 成绩:数学 物理 化学 总分 平均分"); //输出学生信息 for(int j = 0; j < 3; j++) { System.out.print(j+1 + ":"); for(int i = 0; i < 8; i++) { System.out.printf("%6s", st[j][i]); } System.out.println(); } }     //计算方法     private static void calculateSt(String[][] st)     {      int sum1 = 0;      int sum2 = 0; int sum3 = 0;      int ave1 = 0;      int ave2 = 0;      int ave3 = 0;      for(int i = 3; i < 6; i++)      {      sum1 += Integer.parseInt(st[0][i]);      }      ave1 = sum1/3;           for(int i = 3; i < 6; i++)      {      sum2 += Integer.parseInt(st[1][i]);      }      ave2 = sum2/3;           for(int i = 3; i < 6; i++)      {      sum3 += Integer.parseInt(st[2][i]);      }      ave3 = sum3/3;           st[0][6] = String.valueOf(sum1);      st[1][6] = String.valueOf(sum2);      st[2][6] = String.valueOf(sum3);      st[0][7] = String.valueOf(ave1);      st[1][7] = String.valueOf(ave2);      st[2][7] = String.valueOf(ave3);     } }

    标签: java 数据库

    上传时间: 2017-03-17

    上传用户:simple

  • CCS样式选择符设计

    CCS样式选择符,初学者,设计,DW,网页制作,大一作业 部分预览: <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>CSS样式选择符</title> <style type="text/css">  body  { background-image:url(images/%E8%83%8C%E6%99%AF%E5%9B%BE%E7%89%87.jpg); background-repeat:repeat;  }    .class1  { text-align:center; font-weight:bolder;  }  .class2  { font-family:"仿宋"; text-indent:8em;  }    .class3  { font-size:18px; font-family:"宋体"; text-indent:4em;  }    #id1  { font-family:Zombie, Verdana, "Comic Sans MS"; font-style:oblique; font-size:64px;  }    #id2  { font-family:"黑体"; font-size:36px;  }  #id3  { color:#F69; font-weight:bolder; text-shadow:#FCC;  } </style> </head> <body>  <table width="780" height="1555" border="0" cellspacing="0" align="center" bgcolor="#FFFFFF">   <tr height="30">    <td align="center"><img src="images/顶部图片.jpg" /></td>   </tr>

    标签: CCS 网页设计

    上传时间: 2017-12-07

    上传用户:圈圈Ace

  • java入门编程合集

    题目:古典问题:有一对兔子,从出生后第3个月起每个月都生一对兔子,小兔子长到第三个月后每个月又生一对兔子,假如兔子都不死,问每个月的兔子总数为多少?    //这是一个菲波拉契数列问题 PUBLIC class lianxi01 { PUBLIC static void main(String[] args) { System.out.println("第1个月的兔子对数:    1"); System.out.println("第2个月的兔子对数:    1"); int f1 = 1, f2 = 1, f, M=24;      for(int i=3; i<=M; i++) {       f = f2;       f2 = f1 + f2;       f1 = f;       System.out.println("第" + i +"个月的兔子对数: "+f2);          } } } 【程序2】    题目:判断101-200之间有多少个素数,并输出所有素数。 程序分析:判断素数的方法:用一个数分别去除2到sqrt(这个数),如果能被整除, 则表明此数不是素数,反之是素数。    PUBLIC class lianxi02 { PUBLIC static void main(String[] args) {     int count = 0;     for(int i=101; i<200; i+=2) {      boolean b = false;      for(int j=2; j<=Math.sqrt(i); j++)      {         if(i % j == 0) { b = false; break; }          else           { b = true; }      }         if(b == true) {count ++;System.out.println(i );}                                   }     System.out.println( "素数个数是: " + count); } } 【程序3】    题目:打印出所有的 "水仙花数 ",所谓 "水仙花数 "是指一个三位数,其各位数字立方和等于该数本身。例如:153是一个 "水仙花数 ",因为153=1的三次方+5的三次方+3的三次方。 PUBLIC class lianxi03 { PUBLIC static void main(String[] args) {      int b1, b2, b3; 

    标签: java 编程

    上传时间: 2017-12-24

    上传用户:Ariza