Programmer Group

Data processing and visualization (I) -- Numpy Foundation 1 background Although the list can complete array operation, it is not an array in the real sense. When the amount of data is large, its speed is very slow, so NumPy extension library is provided to complete array operation. Many advanced extension libraries also rely on it, such as Sc ...

        We introduced the distribution hypothesis before, mainly through the context to construct a co-occurrence matrix, cosine similarity, Jaccard similarity and point mutual information can be used to measure the similarity or relevance of words based on the co-occurrence matrix. In order to avoid the statistical unrelia ...

FCM algorithm is a clustering algorithm based on partition. Its idea is to maximize the similarity between objects divided into the same cluster and minimize the similarity between different clusters. Fuzzy C-means algorithm is an improvement of ordinary C-means algorithm. Ordinary C-means algorithm is hard for data division, while FCM is a f ...

solve the problem Find a factorial n !   m o d P n! \ mod P n! modP. executive summary In this paper, a fast factorial ...

This paper mainly analyzes the Yansai 2015D problem, applies the optimization model, and involves the genetic algorithm and simulated annealing algorithm in modern optimization algorithms. Modern optimization algorithms (genetic algorithm, simulated annealing algorithm, ant colony algorithm and tabu search algorithm) are very powerful, but th ...

1. Divide the goods equally Now there are n items, and each item has a value. Now I want to distribute these items to two people. It is required that the total value of the items distributed by each of the two people is the same (the number can be different, and the total value can be the same). The remaining items need to be thrown away. Now ...

1, Introduction to cellular automata Development of cellular automata The original cellular automata was proposed by von Neumann in the 1950s to simulate the self replication of biological cells, but it has not been paid attention to by the academic community In 1970, after John Horton Conway of Cambridge University designed a computer game &q ...

1, Introduction to cellular automata Development of cellular automata The original cellular automata was proposed by von Neumann in the 1950s to simulate the self replication of biological cells, but it has not been paid attention to by the academic community In 1970, after John Horton Conway of Cambridge University designed a computer game &q ...

1. Introduction to cellular automata Development of 1-cell automata The original cellular automata was proposed by Von Neumann in the 1950s to mimic the self-replication of biological cells.But it has not been taken seriously by the academia. It was only after John Horton Conway of the University of Cambridge designed a computer game called &q ...

  1, Introduction to particle swarm optimization Particle swarm optimization algorithm was proposed by Dr. Eberhart and Dr. Kennedy in 1995. It comes from the study of bird predation behavior. Its basic core is to make use of the information sharing of individuals in the group, so as to make the movement of the whole group produce an evol ...