The syntax of different natural languages are different, hence the parsing of different natural languages are also different, thus leadings to structures of their parsing-trees being different. The reason that the sentences in different natural languages can be translated to each other is that they have the same meaning. This paper discusses a new sentence parsing, called semantic-parsing, based on semantic units theory. It is a new theory where a sentence of a natural language is not regarded as of words and phrases arranged linearly; rather it is expected to consist of semantic units with or without type-parameters. This is a new parsing approach where the syntax-parsing-tree and semantic-parsing-tree are isomorphic. It is also a new approach in which the structure-trees of the sentences in all different natural languages can correspond.

In this paper, the reasons for the shortcoming of Zadeh's fuzzy set theory — it cannot correctly reflect different kinds of fuzzy phenomenon in the natural world — are discussed. In addition, the proof of the error of Zadeh's fuzzy set theory — it incorrectly defined the set complement that cannot exist in Zadeh's fuzzy set theory — is proposed. This error of Zadeh's fuzzy set theory causes confusion in thinking, logic and conception. It causes the seriously mistaken belief that logics of fuzzy sets necessarily go against classical and normal thinking, logic and conception. Two new fuzzy set theories, C-fuzzy set theory and probability-like fuzzy set theory, the N-fuzzy set theory, are proposed. The two are equivalent, and both overcome the error and shortcoming of Zadeh's fuzzy set theory, and they are consistent with normal, natural and classical thinking, logic and concepts. The similarities of N-fuzzy set theory with probability theory are also examined.

As we know, the conflict problem is a very important problem in memory system of super computer, there are two kinds of conflict-free memory system approaches: skewing scheme approach and prime memory system approach. Previously published prime memory approaches are complex or wasting 1/p of the memory space for filling the “holes” [17], where p is the number of memory modules. In this paper, based on Chinese remainder theorem, we present a perfect prime memory system which only need to find the d Mod p without wasting any memory space and without computing the quotient.