gamification theory

Graph Theory Solution for Microsoft bridge Problem Microsoft's bridge problem is that four people have to use a flashlight when crossing a bridge at night. There is only one flashlight, and at most two people can pass each time, the speed of the four people crossing the bridge is 1 minute, 2 minutes, 5 minutes, and 10 minutes respectively. How long does it take for four people to go through the bridge at least?If graph

From: http://blog.sina.com.cn/s/blog_50f98dfa0100a86r.html Introduction to metacognitive theory and learning, edited by bloggers The most important teaching is to teach students to learn, and the most important learning is to learn. In recent years, many large, medium, and primary schools in China have carried out teaching of learning methods, guided students in learning methods, and achieved some results. At the same time, there are also many proble

Graph theory (graph Theory) is a branch of mathematics. It takes the graph as the research object. A graph in graph theory is a graph of a given point and a line connected to two points, which is usually used to describe a particular relationship between something, a point representing something, and a line connecting two points to indicate that the corresponding

To the users of Photoshop software for detailed analysis to share the color of the basic knowledge and color theory. Analytical sharing: Basic knowledge of color Open your Photoshop, create a new document, there are two very important options, one is the color mode (bitmap/grayscale/rgb color/cmyk color), one is the number of digits (1-bit/8-bit/16-bit/32-bit). What is a color mode? Create a new do

Talking about SEO, has always been a lot of other people headache topic. Some people say that SEO is to promote, but also some people say that SEO is a deceptive thing, every day with that point content, outside the chain, to brag about their ability to have how high, such people are not a few. But is this true? It is no wonder that the site is not well ranked. I want to say is "SEO is the theory to practice through!" There are too many theoretical ex

1. Normal domain expansionIn the study domain \ (f\) of the algebraic expansion \ (e\), the first premise is that the expansion of \ (e\) is present, followed by all the expansion of the same space, that is, they are operational. The space that satisfies such conditions is the algebraic closure of \ (f\), using the language of set theory, the algebraic closure can be described as the sum of the divisions of all the polynomial. The legitimacy of this d

be illegal due to duplicate number of problems. In this case, replace the question number that appears in the section with a number that is not present in the paragraph so that the new descendant is re-obtained. (3) Mutation operator. In genetic algorithms, the probability of mutation is generally small. The mutation is not segmented, but only one of the genes in a segment. The operation of mutation is as follows: randomly generate a mutation position p in [1,n] range, select a mutation gene f

known as the Shadow Price;3, according to the second structure division can more clearly express the shadow price and the optimal solution of the base variable structure. At the same time, the relationship between the original problem and duality problem is found by the combination of this structure and duality problem:1), assuming that the original problem is a resource actual ability problem, the duality problem is the resource pricing problem, and the test number of the relaxation variable o

can have multiple levels and references can be only one level5.sizeof refers to the size of the pointed variable, and the sizeof pointer gets the size of the pointer itself.6. When the pointer is passed as a function parameter, the copy of the argument is passed to the formal parameter, such as the following program (a), the reference is passed as a function parameter instead of the copy, and the reference is a true share of the same inner deposit element.Program (a):#include #include #include

#include #includeusing namespacestd;Const intMAXV = +;Const intINF =0xFFFFFFF;structedge{intU,v,cost;} E[MAXV];BOOLCMP (Edge A,edge b) {returnA.cost B.cost;}intFATHER[MAXV];intFindfather (intx) { intA =x; while(x! = father[x]) x=Father[x]; //Path Compression while(A! =Father[a]) { inttemp =A; A=Father[a]; Father[temp]=x; } returnx;} intKruskal (intNintm) { intans=0, numedge=0; for(intI=0; ii; Sort (e,e+m,cmp); for(intI=0; i) { intfau=Findfather (E[I].U); intf

I also smattering, only know can be proved, here also do not waste time. (Refer to "Introduction to Algorithms" for details)Finally, explain why there is a negative right side of the time can not:The connection matrix is as follows (picture can be drawn by itself):1 2 31 \ 2 12 2 \-43 1-4 \Then the first mark of the point is 3 and Dis[3] is recorded as 1, but in fact dis[3] should be 2, so there will be an error.Finally, attach a code that is not so standard:1#include 2#include 3 intm[ -][ -],e

$proxy0, this method is implemented by the Proxy.h invoke method (called the Businesshandler.invoke method);This is followed by the Invoke method (the argument is this, and args).This invokes the corresponding method of the Usermanagerimpl, which is then returned to the client.This completes the entire invocation relationship.Reflection, reflection, Programmer's pleasure Through the previous article on the dynamic agent in-depth analysis, and now think of it is very interesting, in fac

, this algorithm is really amazing.Implementation method:The topic is to create an adjacency table for each vertex, that is, to save all vertices that are directly connected to the vertex through an edge, the graph is bidirectional, plus two sides when adding edges.The above is an adjacency table for each vertex based on the given graph, an adjacency table for each vertex based on the input, and a record of the query as a query, and the results of 3,5 and 5,3 are the same.And check the use of th

answer.Of course, for the negative power loop also has a solution, after the introduction of the SPFA algorithm will be added.The code is as follows:#include #include#includestring.h>intn,e,s;structnode{intx; inty; intVal;} m[ the];intdis[ the],pre[ the],a,b,w[ the][ the];intBellmanford (ints) { inti,j; for(i=1; i) Dis[i]=W[s][i]; Dis[s]=0;p re[s]=0; for(i=1; i1; i++) for(j=1; j) if(dis[m[j].x]+m[j].valDis[m[j].y]) {DIS[M[J].Y]=dis[m[j].x]+M[j].val; PRE[M[J].Y]=m[j].x; }

folder B: Renaming considerations if the path name is the same, it is renamed.　　If the path name is different, it is renamed and clipped.　　　　C: Delete Note: Delete in Java does not go to the Recycle Bin. To delete a folder, note that the folder cannot contain files or Folders file class (the function of the file Class) A: Judge function public boolean isdirectory (): Determines whether the directory public boolean ISFI Le (): Determine if the file is PuBlic Boolean exists (): Determines whether

and architecture12. Explanation of the server monitoring scheme13.Shell Getting started with scriptingAnti-hacker scanning technology under 14.LinuxThat's basically it, note that I've got a big review of every directory here, and there's a lot of detail in it. I'll start with this big catalogue! 650) this.width=650; "src=" Http://img.baidu.com/hi/ldw/w_0014.gif "alt=" W_0014.gif "/>This article from "Lele Run" blog, please be sure to keep this source http://10851431.blog.51cto.com/10841431/1749

scheduling timing can be divided into1. Preemptive scheduling: high-priority processes preempt the processor and leave the process being processed in the ready queue.2. Non-preemptive scheduling: When the highest priority of a process in the ready queue is higher than the highest priority of a process running in the processor, it does not leave the running process out of the processor, but rather the header of the high-priority queue at the ready.1.11 Dead LockMultiple processes are deadlocked

--static RP address each device must be the same=============================================OTV MulticastOTV three Layer two layer informationControl Pane---ASM (multicast)/ADJ (unicast)---each form a neighbor distribution list----Tambo Update entryData Pane---SSMED----ISIS forms neighbor----unicast neighborISIS----MAC UpdateFeature OTVInterface OV1OTV Join-interOTV Extend-vlanUn:otve Adj/use-adjMu:otve Control-group 239.1.1.1OTV Site-id 0x, same site to the sameOTV Site-vlanOTV Data-group 232

experience, but the foundation is very solid, on the Java work mechanism, common design ideas, Common Java Development Framework Master Proficiency, you can add.4, feel that they are very cow B, the general needs can be done. However, the knowledge points are not systematized, it is difficult to continue the breakthrough in the technical field can add.5. Ali Java senior Daniel Live to explain the knowledge points, share knowledge, many years of work experience combing and summary, with everyone

The basic idea: the SPFA algorithm is the queue implementation of the Bellman-ford algorithm, using the DIS array to represent the current shortest distance between the point and the source point, and whether the array vis marks the point in the queue, initially only the source point is in the queue, each time the point V of the team head is removed, and the side V->u from V is enumerated, The length of the edge is Len, determine whether the Dist[v]+len is less than dist[u], if less than t