Isomorphism Continuum Stored Energy Functional for Finite Thermoelastic Deformation

Continuum mechanics for isotropic finite thermoelastic deformations have been reviewed. Thermal effects on mechanical responses of rubbers have been captured by the isomorphism continuum stored energy (CSE) functional with the multiplicative decomposition of deformation gradient while preserving the structure of symmetry for finite structural deformation. The CSE finite thermoelastic model fits and predicts experimental data of SR and NR-C60 rubbers at different external temperatures. For internal temperature effects of both NR and NR-SIC rubbers, the CSE finite thermoelastic model of stored energy and entropy, along with the newly developed CTE and CI models, fits both nominal stress-stretch and temperature change-stretch experimental data in uniaxial extension tests.

ISOMORPHISMS AND DERIVATIONS IN C*-ALGEBRAS

In this article, we prove the Hyers-Ulam-Rassias stability of the following Cauchy-Jensen functional inequality：‖f （x） ＋ f （y） ＋ 2f （z） ＋ 2f （w）‖ ≤‖ 2f x ＋ y2 ＋ z ＋ w ‖（0.1）This is applied to investigate isomorphisms between C＊-algebras, Lie C＊-algebras and JC＊-algebras, and derivations on C＊-algebras, Lie C＊-algebras and JC＊-algebras, associated with the Cauchy-Jensen functional equation 2f （x ＋ y/2 ＋ z ＋ w） = f（x） ＋ f（y） ＋ 2f（z） ＋ 2f（w）.

Simulated annealing algorithm for detecting graph isomorphism

Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.

SMALL INTO ISOMORPHISM FROM(c_0)INTO C(Ω)TYPE

If T is an isomorphism of （c0） into C（Ω） （where Ω is a sequentially compact and paracompact space, or a compact metric space in particular）, which satisfies the condition ｜｜T｜｜·｜｜T^-1｜｜ ≤ 1 ＋ε for some ε ∈ （0,1/5）, then T/｜｜T｜｜ is close to an isometry with an error less than 9ε. The proof of this article is simple without using the dual space or adjoint operator.

The Homomorphism and Isomorphism on Hypergroup

Basing on the papers from [1] to [4], this paper gives some further research,mainly solves the following problems:(1) It proved that several theorems of subgroup which have been raised to the hypergroup are still true.(2) It proved that the isomorphous relationship of the bottomgroups which guid to the hypergroup can still keep such relationship.(3) It proved that the basic isomorphous Theorem and the homogenous Theorem of the bottomgroup which raise to the hypergroup are still true.(4) It point out that when the isomorphous bottomgroups have been raised to the hypergroup,the conditions which form the isomorphism should be lessened.

ADJACENT MARTIX METHOD OF IDENTIFYING ISOMORPHISM TO PLANAR KINEMATIC CHAIN WITH MULTIPLE JOINTS AND HIGHER PAIRS

The adjacent matrix method for identifying isomorphism to planar kinematic chain with multiple joints and higher pairs is presented. The topological invariants of the planar kinematic chain can be calculated and compared by adjacent matrix. The quantity of calculation can be reduced effectively using the several divisions of bars and the reconfiguration of the adjacent matrix. As two structural characteristics of adjacent matrix, the number of division and division code are presented. It can be identified that two kinematic chains are isomorphic or not by comparing the structural characteristics of their adjacent matrixes using a method called matching row-to-row. This method may be applied to the planar linkage chain too. So, the methods of identifying isomorphism are unified in the planar kinematic chain that has or hasn＇t higher pairs with or without multiple joints. And it has some characters such as visual, simple and convenient for processing by computer, and so on.

GPU acceleration of subgraph isomorphism search in large scale graph

A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.

ISOMORPHISMS OF CIRCULANT DIGRAPHS OF DEGREE 3

In this paper, we introduce a new approach to characterize the isomor-phisms of circulant digraphs. In terms of this method, we completely determine theisomorphic classes of circulant digraphs of degree 3. In particular, we characterizethose circulant digraphs of degree 3 which don't satisfy Adam's conjecture.

ON THE ISOMETRIC ISOMORPHISM OF PROBABILISTIC METRIC SPACES

There are two kinds of isometric isomorphism in probabilistic metric space theory. The first is that a PM space (E, F) is isometrically isomorphic to another PM space (E', F'), and the second is that a PM space (E, F) is isometrically isomorphic to a generating space of quasi-metric family (E', d(r), r is an element of (0, 1)). This paper establishes the connection between the two kinds of isometric isomorphism.

Weak Isomorphism of Finite Group

On the basis of the quasi-isomorphism of finite groups, a new mapping, weak isomorphism, from a finite group to another finite group is defined. Let G and H be two finite groups and G be weak-isomorphic to H. Then G≌H if G satisfies one of the following conditions. 1） G is a finite Abelian group. 2） The order of G is p^3. 3 ） The order of G is p^n＋1 and G has a cyclic normal subgroup N = 〈a〉 of order p^n. 4） G is a nilpotent group and if p^││G│, then for any P ∈ Sylp （G）, P has a cyclic maximal subgroup, where p is a prime; 5） G is a maximal class group of order p4（p〉3）.

Characterizations of Isomorphisms by Multiplicative Maps on Operator Algebras

In this paper, we discuss some multiplicative preservers and give some characterizations of isomorphisms or conjugate isomorphisms on β(X), where β(X) denotes the algebra of all bounded linear operators on a Banach space X.

The Isomorphism Theorem of Regular Bisimple ω2-semigroups

In this paper we study the isomorphisms of two regular bisimple ω2- semigroups and obtain a criterion for two such semigroups to be isomorphic.

Similar Vertices and Isomorphism Detection for Planar Kinematic Chains Based on Ameliorated Multi-Order Adjacent Vertex Assignment Sequence

Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorphism detection based on the properties of similar vertices.In this paper,an ameliorated multi-order adjacent vertex assignment sequence(AMAVS)method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs.First,the specific definition of AMAVS is described.Through the calculation of the AMAVS,the adjacent vertex value sequence reflecting the uniqueness of the topology features is established.Based on the value sequence,all possible similar vertices,corresponding relations,and isomorphism discrimination can be realized.By checking the topological graph of KCs with a different number of links,the effectiveness and efficiency of the proposed method are verified.Finally,the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-D0F(degree of freedom)planar KCs.

ISOMORPHISMS OF VARIABLE HARDY SPACES ASSOCIATED WITH SCHRÖDINGER OPERATORS

Let L:=-△+V be the Schrodinger operator on R^(n)with n≥3,where V is a non-negative potential satisfying△^(-1)(V)∈L^(∞)(R^(n)).Let w be an L-harmonic function,determined by V,satisfying that there exists a positive constantδsuch that,for any x∈Rn,0<δ≤w(x)≤1.Assume that p(·):R^(n)→(0,1]is a variable exponent satisfying the globally log-Hölder continuous condition.In this article,the authors show that the mappings HL^(p)(·))(R^(n))■f■wf∈H^(p)(·)(R^(n))and HL^(p(·))(R^(n))■f■(-△)^(1/2)L^(-1/2)(f)∈H^(p(·))(R^(n))are isomorphisms between the variable Hardy spaces HL^(p(·))(R^(n)),associated with L,and the variable Hardy spaces H^(p(·))(R^(n)).

Subgraph Isomorphism Based Intrinsic Function Reduction in Decompilation

Program comprehension is one of the most important applications in decompilation. The more abstract the decompilation result the better it is understood. Intrinsic function is introduced by a compiler to reduce the overhead of a function call and is inlined in the code where it is called. When analyzing the decompiled code with lots of inlined intrinsic functions, reverse engineers may be confused by these detailed and repeated operations and lose the goal. In this paper, we propose a method based graph isomorphism to detect intrinsic function on the CFG (Control Flow Graph) of the target function first. Then we identify the boundary of the intrinsic function, determine the parameter and return value and reduce the intrinsic function to a single function call in the disassembled program. Experimental results show that our method is more efficient at reducing intrinsic functions than the state-of-art decompilers such as Hex-Rays, REC and RD (Retargetable Decompiler).

An Introduction to the Theory of Matrix Near-Rings

Matrix rings are prominent in abstract algebra. In this paper we give an overview of the theory of matrix near-rings. A near-ring differs from a ring in that it does not need to be abelian and one of the distributive laws does not hold in general. We introduce two ways in which matrix near-rings can be defined and discuss the structure of each. One is as given by Beildeman and the other is as defined by Meldrum. Beildeman defined his matrix near-rings as normal arrays under the operation of matrix multiplication and addition. He showed that we have a matrix near-ring over a near-ring if, and only if, it is a ring. In this case it is not possible to obtain a matrix near-ring from a proper near-ring. Later, in 1986, Meldrum and van der Walt defined matrix near-rings over a near-ring as mappings from the direct sum of n copies of the additive group of the near-ring to itself. In this case it can be shown that a proper near-ring is obtained. We prove several properties, introduce some special matrices and show that a matrix notation can be introduced to make calculations easier, provided that n is small.

Rescuing High-Tech Sectors from Imminent Disaster, Using Isomorphic Lessons & Organisational Learning Strategies as Prerequisite Tools to Manage Safety

Within high-risk industries, efficient management of safety is an important element of organisational efforts to reduce accidents. Most organisations such as nuclear, aviation and oil and gas sectors have a safety management system (SMS) which provides sequence of organisational procedure to identify hazards, mitigation of risk, measure performance, investigate incidents and maintain an on-going continuous improvement. However, experts believe that when such complex organisations complement safety management system with isomorphic lessons and organisational learning strategies to manage safety, there will be a high propensity to aggressively reduce risk and save cost. Undoubtedly, learning from accidents/incidents is one of many ways to manage safely in any given organisation. As a result, this paper is intended to ascertain if organisations use isomorphic lessons and organisational learning as strong feature of organisation’s practice capable of promoting stronger safety culture;and if lessons learned from other high-risk sectors can help inform risk-based decisions in organisations. Risk experts and by extension the nuclear sector, could have learned from past accident such as the Three Mile Island of 1979 and employ lessons learned to forestall future occurrences. Primary data was gathered via online, and research population are health and safety professionals from aviation, nuclear, and the oil and gas sectors. The sample size recruited are aviation (n = 59, 25%);nuclear (n = 124, 54%);and oil and gas (n = 49, 21%). Statistical Package for the Social Sciences (SPSS) software was used to analyse 232 responses used for this paper.

ISOMETRIC ISOMORPHISMS OF TRIANGULAR BANACH ALGEBRAS

Let A and B be Banach algebras.Let M be a Banach A,B module with bounded 1.Then T=AM 0B is a Banach algebra with the usual operations and the norm AM 0B=‖A‖+‖M‖+‖B‖.Such an algebra is called a triangular Banach algebra.In this paper the isometric isomorphisms of triangular Banach algebras are characterized.

基于三全育人的高职劳动教育与专业教育同构共生探析

高职劳动教育与专业教育以三全育人为指引,二者的同构共生符合历史社会发展趋势。三全育人视阈下,高职院校应该从劳动教育机制与评价标准的建构、劳动教育目标和内容的融通、劳动教育实践的拓展和劳动教育形式的创新等方面促进劳动教育与专业教育的同构共生。

STUDY ON ISOMORPHISM OF PLANAR KINEMATIC CHAINS

The isomorphism of planar kinematic chains is studied. The original methods for de- tecting isomorphism is discussed. A new matrix, the link -link path matrix, is presented to show the structures of planar kinematic chains. It is simple and reliable to detect isomorphism of planar kinematic chains by using the link-link path matrix.