Identity Transformation of China through the Anti-Monopoly Law Penalty on Japanese Automotive Parts and Bearings Enterprises

The identity transformation of China is analyzed through the legal punishment given by China＇s National Development and Reform Commission on Japanese automotive parts and bearings enterprises that broke China＇s Monopoly Law by price- fixing in the automotive parts market of China for more than ten years. The standards for illegal conduction this penalty based are the international Cartel rules, the specific legal procedure is beyond the main concern of this study so the obscurity of how this penalty decided is kept aside for the sake of respecting the painstaking labor fruits of relevant executive departments as well as for dispensing political sensitivity related to any academic analysis developed. Three Japanese newspaper reports concerning this penalty fine are selected for critical discourse analysis. Emotional ambience of them is derogative, neutral, and approving respectively. Foucault＇s triad relationship of discourse-power-identity is borrowed and the postmodernists＇ view of the ＂other＂ is corroborated with the self-presentation of China. Positive self-presentation is underscored by the contrast of negative other-presentation and vice versa, the negative commendation on this punishment event revealed in certain news coverage is to lessen the negative image of Japanese enterprises because of their shared Japanese identity. However their fundamental tone maybe, the fact that China evolves to be able to handle the illegal international events in its confines with dignity is tacitly recognized as a warning in three newspapers. The new identity of China is thus highlighted as the role of the other by the Japanese media. The reason why Japanese accept it instead of staging substantial resistance is analyzed from the Japanese cultural considerations of the hierarchical sequence or the ＂weizhiyishi＂ （positional consciousness or postural consciousness）, and the practical reasons of why Hitachi and Nachi commit self-confession is analyzed. All these responses from Japanese side are the manifestation of China＇s being in charge of the situation, it has the ball at its feet in this power gaming.

Simplest Normal Forms of Generalized Neimark-Sacker Bifurcation

The normal forms of generalized Neimark-Sacker bifurcation are extensively studied using normal form theory of dynamic system. It is well known that if the normal forms of the generalized Neimark-Sacker bifurcation are expressed in polar coordinates, then all odd order terms must, in general, remain in the normal forms. In this paper, five theorems are presented to show that the conventional Neimark-Sacker bifurcation can be further simplified. The simplest normal forms of generalized Neimark-Sacker bifurcation are calculated. Based on the conventional normal form, using appropriate nonlinear transformations, it is found that the generalized Neimark-Sacker bifurcation has at most two nonlinear terms remaining in the amplitude equations of the simplest normal forms up to any order. There are two kinds of simplest normal forms. Their algebraic expression formulas of the simplest normal forms in terms of the coefficients of the generalized Neimark-Sacker bifurcation systems are given.

Rearrangeability of 7-stage 16 × 16 shuffle exchange networks

It has long been an outstanding conjecture that any(2^(n)×2^(n))-stage shuffle exchange network(Omega net-work)is rearrangeable for 2n 62n.Many researchers have failed to prove this conjecture,including a recent one established by Hasan.However,nobody has pointed out its fallacy.Therefore,as one of the objectives,this paper shall clarify this fact.Since the case of n 53 has been proven by many researchers[1,2],this paper uses a con-structive approach to prove that when n 54,the 7-stage 16616 shuffle exchange network is also rearrangeable.The paper also presents the model of a balanced tree to avoid internal conflict,the representation of permutations using a connection graph and loop graph,and the con-cepts of symmetry graph and identical transform.Based on graphic composition and bipartition,the permutations 16×16 are divided into five classes,with five assignment algorithms proposed.These algorithms are simpler,clearer and easier to program.The techniques used for n=4 may provide hints for the general case of n>4.