diff --git a/group22/1193590951/githubitem/bin/com/github/mrwengq/sec/struts.xml b/group22/1193590951/githubitem/bin/com/github/mrwengq/sec/struts.xml
new file mode 100644
index 0000000000..404aa778e1
--- /dev/null
+++ b/group22/1193590951/githubitem/bin/com/github/mrwengq/sec/struts.xml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<struts>
+    <action name="login" class="com.github.mrwengq.sec.LoginAction">
+        <result name="success">/jsp/homepage.jsp</result>
+        <result name="fail">/jsp/showLogin.jsp</result>
+    </action>
+    <action name="logout" class="com.github.mrwengq.sec.LogoutAction">
+    	<result name="success">/jsp/welcome.jsp</result>
+    	<result name="error">/jsp/error.jsp</result>
+    </action>
+</struts>
diff --git a/group22/1193590951/githubitem/src/com/github/mrwengq/sec/ArrayUtil.java b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/ArrayUtil.java
new file mode 100644
index 0000000000..3b037d2cc9
--- /dev/null
+++ b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/ArrayUtil.java
@@ -0,0 +1,252 @@
+package com.github.mrwengq.sec;
+
+public class ArrayUtil {
+	
+	/**
+	 * 给定一个整形数组a , 对该数组的值进行置换
+		例如： a = [7, 9 , 30, 3]  ,   置换后为 [3, 30, 9,7]
+		如果     a = [7, 9, 30, 3, 4] , 置换后为 [4,3, 30 , 9,7]
+	 * @param origin
+	 * @return
+	 */
+	public void reverseArray(int[] origin){ //为了避免过多使用空间，没有采用空间复制的方式进行置换
+ 		int len = origin.length;
+		int temp = 0;
+		for(int i = len ; i>0;i--){			//len - i 是从小到大    
+			if(len - i > (int) (len-1)/2){
+				break;
+			}
+			temp = origin[len-i];			
+			origin[len-i] = origin[i-1];	//i-1是从大到小
+			origin[i-1] = temp;
+			
+		}
+		
+	}
+	
+	/**
+	 * 现在有如下的一个数组：   int oldArr[]={1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5}   
+	 * 要求将以上数组中值为0的项去掉，将不为0的值存入一个新的数组，生成的新数组为：   
+	 * {1,3,4,5,6,6,5,4,7,6,7,5}  
+	 * @param oldArray
+	 * @return
+	 */
+	
+	public int[] removeZero(int[] oldArray){
+		int removeNum =0;
+		for(int i = 0;i<oldArray.length;i++){
+			if(0==oldArray[i]){
+				removeNum++;
+			}
+		}
+		int[] newArray = new int[oldArray.length-removeNum];
+		int j = 0;
+		for(int i = 0;i<oldArray.length;i++){
+			if(0!=oldArray[i]){
+				newArray[j] = oldArray[i];
+				j++;
+			}
+		}
+		return newArray;
+	}
+	
+	/**
+	 * 给定两个已经排序好的整形数组， a1和a2 ,  创建一个新的数组a3, 使得a3 包含a1和a2 的所有元素， 并且仍然是有序的
+	 * 例如 a1 = [3, 5, 7,8]   a2 = [4, 5, 6,7]    则 a3 为[3,4,5,6,7,8]    , 注意： 已经消除了重复
+	 * @param array1
+	 * @param array2
+	 * @return
+	 */
+	
+	public int[] merge(int[] array1, int[] array2){
+		int newArrayLen = array1.length+array2.length;
+		for(int i = 0;i<array1.length;i++){   //查找两个数组中重复元素；没重复一次新的数组长度减1
+			for(int j =0;j<array2.length;j++){
+				if(array1[i]==array2[j]){
+					newArrayLen--;
+				} 
+			}
+		}
+		int index1 = 0; //数组1的下标
+		int index2 = 0;//数组2的下标
+		int[] newArray = new int[newArrayLen];
+		for(int i = 0;i<newArray.length;i++){
+			if(index1>array1.length-1){
+				newArray[i] = array2[index2++];
+				break;
+			}
+			if(index2>array2.length-1){
+				newArray[i] = array1[index1++];
+				break;
+			}
+			if(array1[index1]>array2[index2]){
+				newArray[i] = array2[index2++];
+			}else if(array1[index1]<array2[index2]){
+				newArray[i] = array1[index1++];
+			}else{
+				newArray[i] = array1[index1++];
+				index2++;
+			}
+		}
+		return  newArray;
+	}
+	/**
+	 * 把一个已经存满数据的数组 oldArray的容量进行扩展， 扩展后的新数据大小为oldArray.length + size
+	 * 注意，老数组的元素在新数组中需要保持
+	 * 例如 oldArray = [2,3,6] , size = 3,则返回的新数组为
+	 * [2,3,6,0,0,0]
+	 * @param oldArray
+	 * @param size
+	 * @return
+	 */
+	public int[] grow(int [] oldArray,  int size){
+		int newArraylen = oldArray.length+size;
+		int[] newArray = new int[newArraylen];
+		for(int i = 0;i<oldArray.length;i++){
+			newArray[i] = oldArray[i];
+		}
+		
+		return newArray;
+	}
+	
+	/**
+	 * 斐波那契数列为：1，1，2，3，5，8，13，21......  ，给定一个最大值， 返回小于该值的数列
+	 * 例如， max = 15 , 则返回的数组应该为 [1，1，2，3，5，8，13]
+	 * max = 1, 则返回空数组 []
+	 * @param max
+	 * @return
+	 */
+	public int[] fibonacci(int max){
+		if(max<=0){
+			throw new RuntimeException("max不能小于等于0");
+		}
+		if(1==max){
+			return new int[0];
+		}
+		if(2==max){
+			return new int[]{1,1};
+		}
+		int[] temp = new int[100];
+		temp[0] = 1;
+		temp[1] = 1;
+		int len = 2 ;
+		
+		while(true){
+			int next = temp[len-1]+temp[len-2]; 
+			if(next>max){
+				break;
+			}
+			if(len-1>temp.length){
+				temp = copyAddArray(temp);
+			}
+			temp[len] = next;
+			len++;
+			
+		}
+		int[] fbn = new int[len];
+		System.arraycopy(temp, 0, fbn, 0, len);
+		return fbn;
+	}
+	private int[] copyAddArray(int elementData[]) { //对数组扩容 增加量为原长度3/4
+		int ob[] = new int[elementData.length+(elementData.length * 3) / 4];
+		System.arraycopy(elementData ,0, ob, 0,elementData.length);
+		return ob;
+	}
+	
+	/**
+	 * 返回小于给定最大值max的所有素数数组
+	 * 例如max = 23, 返回的数组为[2,3,5,7,11,13,17,19]
+	 * @param max
+	 * @return
+	 */
+	public int[] getPrimes(int max){
+		if(max<3){
+			return null;
+		}
+		int[] temp = new int[100];
+		int index = 0;
+		int i = 2;//最小素数
+		while(i<max){
+			boolean isPrime = true;
+			for(int z = 2;z<i;z++){ //以满足素数的条件进行判断
+				if(i%z==0){
+					isPrime = false;
+					break;
+				}
+			}
+			if(!isPrime){ //非素数跳出本次循环
+				i++;
+				continue;
+			}
+			if(index+1>temp.length-1){ //判断空间是否充足，否扩容
+				temp = copyAddArray(temp);
+			}
+			temp[index++] = i;
+			i++;
+		}
+		int[] prime = new int[index];
+		System.arraycopy(temp, 0, prime, 0, index);
+		return prime;
+	}
+	
+	/**
+	 * 所谓“完数”， 是指这个数恰好等于它的因子之和，例如6=1+2+3
+	 * 给定一个最大值max， 返回一个数组， 数组中是小于max 的所有完数
+	 * @param max
+	 * @return
+	 */
+	public int[] getPerfectNumbers(int max){
+		if(max <2){
+			return null;
+		}
+		
+		int[] temp = new int[100];
+		int index = 0;
+		int i = 2;
+		while(i<max){
+			int sum = 0;
+			for(int z=1;z<i;z++){
+				if(i%z == 0){
+					sum += z;
+				}
+			}
+			if(i != sum){
+				i++;
+				continue;
+			}
+			if(index+1>temp.length-1){ //判断空间是否充足，否扩容
+				temp = copyAddArray(temp);
+			}
+			temp[index++] = i;
+			i++;
+		}
+		if(0==index){
+			return null;
+		}
+		int[] perfectNum  = new int[index];
+		System.arraycopy(temp, 0, perfectNum, 0, index);
+		return perfectNum;
+	}
+	
+	/**
+	 * 用seperator 把数组 array给连接起来
+	 * 例如array= [3,8,9], seperator = "-"
+	 * 则返回值为"3-8-9"
+	 * @param array
+	 * @param s
+	 * @return
+	 */
+	public String join(int[] array, String seperator){
+		StringBuilder stb = new StringBuilder();
+		for(int i = 0; i<array.length; i++){
+			stb.append(array[i]);
+			if(i==array.length-1){
+				continue;
+			}
+			stb.append(seperator);
+		}
+		return stb.toString();
+	}
+	
+
+}
diff --git a/group22/1193590951/githubitem/src/com/github/mrwengq/sec/ArrayUtilTest.java b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/ArrayUtilTest.java
new file mode 100644
index 0000000000..2adb2ed329
--- /dev/null
+++ b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/ArrayUtilTest.java
@@ -0,0 +1,93 @@
+package com.github.mrwengq.sec;
+
+import static org.junit.Assert.*;
+
+import org.junit.After;
+import org.junit.Before;
+import org.junit.Test;
+
+public class ArrayUtilTest {
+	ArrayUtil au = null;
+	@Before
+	public void setUp() throws Exception {
+		au = new ArrayUtil();
+	}
+	
+	@After
+	public void tearDown() throws Exception {
+	}
+
+	@Test
+	public void testReverseArray() {
+		int[] origin = new int[]{7, 9 , 30, 3,17};
+		au.reverseArray(origin);
+		int[] b = new int[]{17,3, 30, 9,7};
+		assertArrayEquals(origin, b);
+		
+	}
+
+	@Test
+	public void testRemoveZero() {
+		int[] oldArray = new int[]{1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5};
+		int[] a = au.removeZero(oldArray);
+		int[] b = new int[]{1,3,4,5,6,6,5,4,7,6,7,5};
+		assertArrayEquals(a, b);
+	}
+
+	@Test
+	public void testMerge() {
+		int[] array1 = {3, 5, 7,8};
+		int[] array2 = {4, 5, 6,7};
+		int[] a =  au.merge(array1, array2);
+		int[] b = new int[]{3,4,5,6,7,8};
+		assertArrayEquals(a, b);
+	}
+
+	@Test
+	public void testGrow() {
+		int[] oldArray = {2,3,6};
+		int[] a = au.grow(oldArray, 3);
+		int[] b = new int[]{2,3,6,0,0,0};
+		assertArrayEquals(a, b);
+	}
+
+	@Test
+	public void testFibonacci() {
+		int[] a = au.fibonacci(15);
+		int[] b = {1,1,2,3,5,8,13};
+		assertArrayEquals(a, b);
+		int[] c = au.fibonacci(22);
+		int[] d = {1,1,2,3,5,8,13,21};
+		assertArrayEquals(c, d);
+		int[] e = au.fibonacci(12);
+		int[] f = {1,1,2,3,5,8};
+		assertArrayEquals(e, f);
+	}
+
+	@Test
+	public void testGetPrimes() {
+		int[] a = au.getPrimes(23);
+		int[] b = {2,3,5,7,11,13,17,19};
+		assertArrayEquals(a, b);
+	}
+
+	@Test
+	public void testGetPerfectNumbers() {
+		int[] a = au.getPerfectNumbers(7);
+		int[] b = {6};
+		assertArrayEquals(a, b);
+		int[] c = au.getPerfectNumbers(50);
+		int[] d = {6,28};
+		assertArrayEquals(c, d);
+	}
+
+	@Test
+	public void testJoin() {
+		int[] array = {3, 5, 7,8}; 
+		String a = au.join(array, "**");
+		String b = "3**5**7**8";
+		assertEquals(a,b);
+		
+	}
+
+}
diff --git a/group22/1193590951/githubitem/src/com/github/mrwengq/sec/LoginAction.java b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/LoginAction.java
new file mode 100644
index 0000000000..833e3ec6a9
--- /dev/null
+++ b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/LoginAction.java
@@ -0,0 +1,39 @@
+package com.github.mrwengq.sec;
+
+/**
+ * 这是一个用来展示登录的业务类， 其中的用户名和密码都是硬编码的。
+ * @author liuxin
+ *
+ */
+public class LoginAction{
+    private String name ;
+    private String password;
+    private String message;
+
+    public String getName() {
+        return name;
+    }
+
+    public String getPassword() {
+        return password;
+    }
+
+    public String execute(){
+            if("test".equals(name) && "1234".equals(password)){
+                this.message = "login successful";
+                return "success";
+            }
+            this.message = "login failed,please check your user/pwd";
+            return "fail";
+    }
+
+    public void setName(String name){
+        this.name = name;
+    }
+    public void setPassword(String password){
+        this.password = password;
+    }
+    public String getMessage(){
+        return this.message;
+    }
+}
diff --git a/group22/1193590951/githubitem/src/com/github/mrwengq/sec/Struts.java b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/Struts.java
new file mode 100644
index 0000000000..2f6ba104a4
--- /dev/null
+++ b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/Struts.java
@@ -0,0 +1,134 @@
+package com.github.mrwengq.sec;
+
+import java.lang.reflect.Method;
+import java.net.URL;
+import java.util.HashMap;
+import java.util.Iterator;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+
+import org.dom4j.Attribute;
+import org.dom4j.Document;
+import org.dom4j.DocumentException;
+import org.dom4j.Element;
+import org.dom4j.io.SAXReader;
+/*
+         
+		0. 读取配置文件struts.xml
+ 		
+ 		1. 根据actionName找到相对应的class ， 例如LoginAction,   通过反射实例化（创建对象）
+		据parameters中的数据，调用对象的setter方法， 例如parameters中的数据是 
+		("name"="test" ,  "password"="1234") ,     	
+		那就应该调用 setName和setPassword方法
+		
+		2. 通过反射调用对象的exectue 方法， 并获得返回值，例如"success"
+		
+		3. 通过反射找到对象的所有getter方法（例如 getMessage）,  
+		通过反射来调用， 把值和属性形成一个HashMap , 例如 {"message":  "登录成功"} ,  
+		放到View对象的parameters
+		
+		4. 根据struts.xml中的 <result> 配置,以及execute的返回值，  确定哪一个jsp，  
+		放到View对象的jsp字段中。
+        
+ */
+public class Struts {
+
+    public static View runAction(String actionName, Map<String,String> parameters) {
+    	View view = new View();
+    	//0.读取xml文件
+    	Document doc = createDOC("struts.xml");  
+    	Class actionClass= queryClass(actionName, doc); 
+    	//1.实例化对象调用set方法
+    	Set<String> paramNames = parameters.keySet(); //取出调用方法所用参数名称
+    	Iterator<String> iter = paramNames.iterator();
+    	Object ob = null;
+    	 try {
+			ob = actionClass.newInstance();
+			while(iter.hasNext()){
+				String temp = iter.next();
+				String methodName = "set"+temp.replaceFirst( temp.substring(0,1),temp.substring(0,1).toUpperCase());//方法名称
+				String methodParam = parameters.get(temp);  //方法参数
+				Method me= actionClass.getMethod(methodName,String.class);
+				me.invoke(ob,methodParam);				
+			}
+			//2.调用execute反方法取出返回值
+			String actionMethod = (String)actionClass.getMethod("execute").invoke(ob);
+			//3.调用所有的get，并保存返回值
+			Map map = new HashMap();
+			Method[] methods = actionClass.getMethods(); 
+			for(Method method : methods){
+				String methodName = method.getName();
+				if(methodName.substring(0,3).equals("get")){
+					Object value = method.invoke(ob);
+					String key = methodName.substring(3,methodName.length()).toLowerCase();
+					map.put(key, value);
+				}
+			}
+			view.setParameters(map);//将数据保存到view中
+			//4.设置返回结果视图
+			String jsp = queryResult(actionName,doc,actionMethod);
+			view.setJsp(jsp);
+		} catch (Exception e) {
+			e.printStackTrace();
+		}
+    	 
+    	return view;
+    }
+    private static String queryResult(String actionName,Document doc,String actionMethod){
+    	String reView = null; 
+    	Element el = queryActionElement(actionName,doc);//查找action元素
+    	List<Element> resultEl =  el.elements("result");
+    	for(Element rel : resultEl){
+    		Attribute att = rel.attribute("name");
+    		if(att.getValue().equals(actionMethod)){
+    			reView = rel.getText();
+    		}
+    	}
+    	return reView;
+    }
+    //查找对应的action元素
+    private static Element queryActionElement(String actionName, Document doc){
+    	Element root = doc.getRootElement();
+    	Element actionElement = null;
+    	List<Element> list = root.elements("action");
+    	for(Element el : list){
+    		Attribute att = el.attribute("name");
+    		if(att.getValue().equals(actionName)){
+    			actionElement = el;
+    		}
+    	}
+		return actionElement;
+    	
+    }
+    //查找action类
+	private static Class queryClass(String actionName, Document doc) {
+		Element el = queryActionElement(actionName,doc);//查找action元素
+    	Attribute att = el.attribute("class");
+    	String className = att.getValue();
+    		
+    	Class actionClass  = null;
+    	try {
+			 actionClass = Class.forName(className);
+		} catch (ClassNotFoundException e) {
+			e.printStackTrace();
+		}
+    	return actionClass;
+	}  
+	//获取document对象
+    private static Document createDOC(String fileName){
+    	
+    	//使用dom4j的读取xml文件
+    	SAXReader sr = new SAXReader();
+    	URL fileUrl = Struts.class.getResource(fileName);
+    	Document doc = null;
+    	try {
+    		doc = sr.read(fileUrl);
+    	} catch (DocumentException e) {
+    		// TODO Auto-generated catch block
+    		e.printStackTrace();
+    	}
+    	return doc;
+    }
+
+}
diff --git a/group22/1193590951/githubitem/src/com/github/mrwengq/sec/StrutsTest.java b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/StrutsTest.java
new file mode 100644
index 0000000000..2b848ce991
--- /dev/null
+++ b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/StrutsTest.java
@@ -0,0 +1,43 @@
+package com.github.mrwengq.sec;
+
+import java.util.HashMap;
+import java.util.Map;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+
+
+
+
+public class StrutsTest {
+
+	@Test
+	public void testLoginActionSuccess() {
+		
+		String actionName = "login";
+        
+		Map<String,String> params = new HashMap<String,String>();
+        params.put("name","test");
+        params.put("password","1234");
+        
+        
+        View view  = Struts.runAction(actionName,params);        
+        
+        Assert.assertEquals("/jsp/homepage.jsp", view.getJsp());
+        Assert.assertEquals("login successful", view.getParameters().get("message"));
+	}
+
+	@Test
+	public void testLoginActionFailed() {
+		String actionName = "login";
+		Map<String,String> params = new HashMap<String,String>();
+        params.put("name","test");
+        params.put("password","123456"); //密码和预设的不一致
+        
+        View view  = Struts.runAction(actionName,params);        
+        
+        Assert.assertEquals("/jsp/showLogin.jsp", view.getJsp());
+        Assert.assertEquals("login failed,please check your user/pwd", view.getParameters().get("message"));
+	}
+}
diff --git a/group22/1193590951/githubitem/src/com/github/mrwengq/sec/View.java b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/View.java
new file mode 100644
index 0000000000..1c09f0ba33
--- /dev/null
+++ b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/View.java
@@ -0,0 +1,23 @@
+package com.github.mrwengq.sec;
+
+import java.util.Map;
+
+public class View {
+	private String jsp;
+	private Map parameters;
+	
+	public String getJsp() {
+		return jsp;
+	}
+	public View setJsp(String jsp) {
+		this.jsp = jsp;
+		return this;
+	}
+	public Map getParameters() {
+		return parameters;
+	}
+	public View setParameters(Map parameters) {
+		this.parameters = parameters;
+		return this;
+	}
+}
diff --git a/group22/1193590951/githubitem/src/com/github/mrwengq/sec/struts.xml b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/struts.xml
new file mode 100644
index 0000000000..404aa778e1
--- /dev/null
+++ b/group22/1193590951/githubitem/src/com/github/mrwengq/sec/struts.xml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<struts>
+    <action name="login" class="com.github.mrwengq.sec.LoginAction">
+        <result name="success">/jsp/homepage.jsp</result>
+        <result name="fail">/jsp/showLogin.jsp</result>
+    </action>
+    <action name="logout" class="com.github.mrwengq.sec.LogoutAction">
+    	<result name="success">/jsp/welcome.jsp</result>
+    	<result name="error">/jsp/error.jsp</result>
+    </action>
+</struts>