UoM_XiaoShuaiShuai的博客

迪菲-赫尔曼秘钥交换(Diffie-Hellman Key Exchange)

The OSI Security ArchitectureTo assess effectively the security needs of an organisation and to evaluate and choose various security products and policies, we need some systematic way of defining the r

Evaluation of Machine Learning Algorithm Once you have done a machine learning model for classification problem, we want to know the accuracy of prediction of the model. We can use accuracy, precision

What is GSON? A Java serialization/deserialization library to convert Java Objects into JSON and back is designed by google.(Check open source GSON project)A GSON Project I wrote a GSON project.(Chec

outJSONWhat is JSON? Here is a JSON.{ "name": "Shuai Wang", "id": "1240031", "subject": [ "Algorithm", "Internet", "Database", "Java" ], "grade": 72.5, "has_girlfriend": tr

Java - 编程规范(Programming Convention)常量命名(Naming Contants) Spell named constants using all uppercase letters with the underscore used to seperate “words”. For example,public static final double INTREST_

Java - 字符串(String)There is no primitive type for strings in Java. But there is a class called String used to store and process strings. For example,String s = "I fall in love with ZL";字符串的连接(Concatenat

Java - 表达式和赋值语句(Expressions & Assignment Statements)标识符(Identifier) The name of a variable(or other items you might define like method names, class names, etc) is called an identifier.An identifier ca

Java - IntroductionWhat is Java? Java is well-known as a programming language for Internet applications. Why is the language named “Java”? One believable story is that the name was thought by a membe

暴力破解(Brute Force)简介(Introduction) Brute force is a very general problem-solving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each

递归法(Recursion)简介(Introduction) Recursion occurs when a thing is defined in terms of itself or of its type. Recursion is an important algorithmic design technique. In this blog, we talk about some algo

减治法——搜索第k小元素(Decrease and Conquer by a Factor - Finding the kth smallest element)问题(Problem) Find the kth smallest element in an unsorted array.分割(Partitioning) Partitioning an array around some pivo

减治法——内插法搜索(Decrease and Conquer by a Factor - Interpolation Search)内插法搜索(Interpolation Search) If the elements of a sorted array are distributed reasonably evenly, interpolation search performs better

减治法——二分查找算法(Decrease and Conquer by a Factor - Binary Search Algorithm)减治法简介(Introduction) Decease-and-Conquer is a famous algorithmic design technique. basically, in the approach the size of problem

图——拓扑排序(Graph - Topological Sort)简介(Introduction) We know some problems in real life can be modelled as graph like task planning. Assume a directed edge from a to b means that task a must be done befo

图——广度优先搜索(Graph - Breadth First Search)简介(Introduction) Breadth-first search(BFS) visits all nodes in alphabetical order that are one step away from start node, then all nodes that are two steps away

图——深度优先搜索(Graph - Depth First Search)简介(Introduction) Depth-first search(DFS) is an algorithm for traversing or searching tree or graph data structure. One starts at the root(selecting some arbitrary

图——基本概念(Graph - Concepts)序言(Preface) Graph algorithms are very practical as a lot of problems in real life can be modelled as graph. Such as, network design, flow design, planning, scheduling, route f

分治法——主定理(Divide and Conquer - The Master Theorem)Divide-and-Conquer Recurrences What is the time required to solve a problem of size n by divide-and-conquer?Generally, we split the problem into b smal