MMS-master

说明：  会议室管理系统源代码为且翁群翁群翁骑我发给电饭锅(Using Ajax to add, delete, modify and query)

功能简介：文件:新建,保存,另存为,退出编辑:复制,粘贴,剪切,格式:字体(有系统所有字体和大小),自动换行,替代，查找可以加载图片的。(Features: File: New, Save, Save As, Exit Edit: Copy, paste, cut, Format: Font (with all fonts and size of the system), word wrap, alternative, find that you can load images.)

编写一个控制台程序，模拟在ATM机的存款和取款过程，当输入给定的卡号和密码（初始卡号和密码到数据文件里查看）时，系统能登录ATM系统，根据用户的身份不同显示不同的程序界面；取款 　　每次取款金额只能为100的倍数，总额不超过2000元，不允许透支。且取款之后，要记录取款的金额和时间。 存款 　　每次存款金额只能为100的倍数，总额不超过2000元。 修改密码 　　新密码长度不小于6位，不允许出现6位完全相同的情况，只有旧密码正确，新密码符合要求，且两次输入相同的情况下才可以成功修改密码。(Write a console program to simulate the ATM deposits and withdrawals process, when you enter a given number and password (the initial number and password to the data file view), the system can log in ATM systems, according to the user' s identity different display different The program interface withdrawal amount each withdrawal can only be a multiple of 100, the total does not exceed 2,000 yuan, does not allow overdrafts. And withdrawals after the withdrawal of the amount to be recorded and time. Deposit Amount per Deposit only a multiple of 100, totaling no more than 2,000 yuan. Change Password New Password length not less than six, allowed six identical situation, only the old password is correct, the new password meets the requirements, and enter the same case twice before they can successfully change the password.)

暂时放置在java中 lda的 还是不错的(lda em matlab)

介绍LeTeX的使用，是一本入门教程，文风很好，有很多例子，很简洁！(manufacturer of bandages/disposable with ISO/CE from china www.elasticbandage.com)

此为问卷调查系统 最好请跑在tomcat6.0下 系统有一些bug 以后会进行更新(This system is best for the survey, please run the system in tomcat6.0 some bug will be updated later)

shiro基础资料，包含简单的基本内容，供大家学习使用(shiro learning data for boay)

说明：  beetl是新一代模板引擎，比常见的Java服务端模板引擎都优秀(Beetl is a new generation of template engines, better than the common Java server-side template engines)

drp项目虽是个小型项目，但对写毕业论文是很有帮助的()

说明：  一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。要求：分别用普通方法和递归方法实现(A frog can jump up a step or two at a time. Find out how many jumping methods the frog can use to jump up an n-step. Requirements: Implemented by common method and recursive method respectively)