The Deformation Analysis of the 3D Alignment Control Network Based on the Multiple Congruence Models

In the construction and maintenance of particle accelerators,all the accelerator elements should be installed in the same coordinate system,only in this way could the devices in the actual world be consistent with the design drawings.However,with the occurrence of the movements of the reinforced concrete cover plates at short notice or building deformations in the long term,the control points upon the engineering structure will be displaced,and the fitness between the subnetwork and the global control network may be irresponsible.Therefore,it is necessary to evaluate the deformations of the 3D alignment control network.Different from the extant investigations,in this paper,to characterize the deformations of the control network,all of the congruent models between the points measured in different epochs have been identified,and the congruence model with the most control points is considered as the primary or fundamental model,the remaining models are recognized as the additional ones.Furthermore,the discrepancies between the primary S-transformation parameters and the additional S-transformation parameters can reflect the relative movements of the additional congruence models.Both the iterative GCT method and the iterative combinatorial theory are proposed to detect multiple congruence models in the control network.Considering the actual work of the alignment,it is essential to identify the competitive models in the monitoring network,which can provide us a hint that,even the fitness between the subnetwork and the global control network is good,there are still deformations which may be ignored.The numerical experiments show that the suggested approaches can describe the deformation of the 3D alignment control network roundly.

Effects of Collocational Congruency,Frequency and L2 Proficiency on the Processing of English Adjective-Noun Collocations

The present study investigates the effects of congruency and frequency on adjective-noun collocational processing for Chinese learners of English at two proficiency levels based on the data obtained in an online acceptability judgment task.The subject pool of this research included 60 English majors studying at a university in China;30 were selected as a higher-proficiency group and 30 as a lower-proficiency group according to their Vocabulary Levels Test(Schmitt et al.,2001)scores and their self-reported proficiency in English.The experimental materials were programmed to E-prime 2.0 and included six types of collocations:(1)15 high-frequency congruent collocations,(2)15 low-frequency congruent collocations,(3)15 high-frequency incongruent collocations,(4)15 low-frequency incongruent collocations,(5)15 Chinese-only items,and(6)75 unrelated items for baseline data.The collected response times(RTs)and accuracy rates data were statistically analyzed by the use of an ANOVA test and pairwise comparisons through SPSS 16.0 software.The results revealed that:(1)the adjective-noun collocational processing of Chinese English learners is influenced by collocational frequency,congruency and L2 proficiency;(2)the processing time is affected by the interaction of congruency and frequency;and(3)the interactive effect of L2 proficiency in conjunction with congruency and frequency also influences the processing quality.

A SPECIAL KIND OF PRINCIPAL CONGRUENCES ON MS-ALGEBRAS

In this article, for any a in the MS-algebra L, the author considers the con- gruence of the form defined by （x,y） ∈θa→←x∧a°° = y ∧a° and x ∨ a°° = y ∨ a°°. A characterization of subdirectly irreducible MS-algebras is given and it is also proved that the union of two principal congruences having this form is a principal congruence if and only if L ∈ K2 ∨ K3.

Architectures and Algorithms of Generalized Congruence Neural Networks

In this paper a novel class of neural networks called generalized congruence neural networks (GCNN) is proposed. All neurons in the neural networks are activated in the form of congruence. The architectures, learning rules and two algorithms are presented. Simulation results indicate that such network has satisfactory generalization properties near the sample points. Since this kind of neural nets can be easily operated and implemented, it is appropriate to make further research concerning the theory and applications of GCNN.

The Least Distributive Lattice Congruence on Commutative Distributive Semiring

In this paper, we describe the least distributive lattice congruence on a commutative distributive semiring.

Divisible Semiring Congruences on Distributive Semiring

In this paper, we describe all the divisible semiring congruences on a distributive semiring S and also establish a one_to_one, inclusion_preserving mapping from the set of full, closed, self_conjagate, ideal subsemirings of S to the set of all divisible semiring congruences on S.

ON SYMMETRIC EXTENDED MS-ALGEBRAS WHOSE CONGRUENCES ARE PERMUTABLE

Algebras whose congruences are permutable were investigated by a number of authors in the literature. In this paper, we study the symmetric extended MS-algebras whose congruences are permutable. Some results obtained by Jie Fang on symmetric extended De Morgan algebras are generalized.

On Infinite Disjoint Congruence Covering Systems

In this paper we show that for any α∈(0,l] there exists an infinite disjoint covering system {a1(modni)}i=1∞ such that

COBORDISM AND ROKHLIN CONGRUENCES

In this paper, we give a cobordism proof of the higher dimensional Rokhlin congruences established in [8].

P-congruence-free Epigroups

Let P denote the equivalence relation on an epigroup in which any of its classes consists precisely of those elements owning the same pseudo-inverse. The purpose of the paper is to characterize epigroups on which any congruence either contains P or its join with P is the identity relation on epigroups. As a special subclass of epigroups, completely 0-simple semigroups having the same property are also described.

Rectangular Ring Congruences on an E-inversive Semiring

In this paper, we discussed the property of rectangular band semiring congruence and ring congruence on a semiring and gave some characterizations and structure of rectangular ring congruence on an E-inversive semiring.

On the Error Term for the Number of Solutions of Certain Congruences

Let f(x) be an irreducible polynomial of degree m ≥ 2 with integer coefficients,and let r(n) denote the number of solutions x of the congruence f(x) ≡ 0(mod n) satisfying0 ≤ x < n. Define ?(x) =Σ 1≤n≤x r(n)-αx, where α is the residue of the Dedekind zeta function ζ(s, K) at its simple pole s = 1. In this paper it is shown that ∫_1~X?~2(x)dx? ε{X^(3-6/m+3+ε)if m ≥ 3,X^(2+ε) if m = 2,for any non-Abelian polynomial f(x) and any ε > 0. This result constitutes an improvement upon that of Lü for the error terms on average.

Fibonacci Congruences and Applications

When we study a congruence T(x) ≡ ax modulo m as pseudo random number generator, there are several means of ensuring the independence of two successive numbers. In this report, we show that the dependence depends on the continued fraction expansion of m/a. We deduce that the congruences such that m and a are two successive elements of Fibonacci sequences are those having the weakest dependence. We will use this result to obtain truly random number sequences xn. For that purpose, we will use non-deterministic sequences yn. They are transformed using Fibonacci congruences and we will get by this way sequences xn. These sequences xn admit the IID model for correct model.

Congruences on an Orthodox Semigroup

Let 5 be an orthodox semigroup and γ the least inverse congruence on 5. C(S) denotes the set of all congruences on S. In this paper we introduce the concept of admissible triples for S, where admissible triples are constructed by the congruences on S/γ , the equivalences on E(S)/L and E(S)/R. The notation Ca(S) denotes the set of all admissible triple for S. We prove that every congruence ρ on S can be uniquely determined by the admissible triple induced by ρ, and there exists a lattice isomomorphism between C(S) and Ca(S).

Super Congruences Involving Alternating Harmonic Sums

Let p be an odd prime, the harmonic congruence such as , and many different variations and generalizations have been studied intensively. In this note, we consider the congruences involving the combination of alternating harmonic sums, where PP denotes the set of positive integers which are prime to p. And we establish the combinational congruences involving alternating harmonic sums for positive integer n=3,4,5.

Congruences and Ideals of Ockham Algebras with de Morgan Skeleton

In this note, we study of those congruences on an Ockham algebra with de Morgan skeleton that the quotient algebras belong to the class of de Morgan algebras. We particularly give a description of those kernel ideals that generate these congruences.

One Class of the Least Congruences on Completely Regular Semigroups

Congruence is a very important aspect in the study of the semigroup theory.In general,the Kernel-trace characterizations,Green's relations and subvarieties are main tools in the consideration of congruences on completely regular semigroups.In this paper,we give one class of congruences on completely regular semigroups with the representation of wreath product of translational hulls on completely simple semigroups.By this new way,the least Clifford semigroup congruences on completely regular semigroups are generalized.

P-kernel Normal System of Strong P-congruences on P-inversive Semigroups

Let S（P） be a P-inversive semigroup. In this paper we describe the strong P-congruences on S（P） in terms of their P-kernel normal systems. We prove that any strong P-congruence on S（P） can present a P-kernel normal system; conversely any P-kernel normal system of S（P） can determine a strong P-congruence.

Analogous Systems Principles and Concepts of Traditional Chinese Medicine and Congruence Couple Therapy

This article explicates the analogous principles and concepts between traditional Chinese medicine(TCM)and congruence couple therapy(CCT).Although originating out of vastly different times and places,TCM and CCT share a view of health based on systems understanding to facilitate the interconnections of the parts of an organism rather than focusing on eliminating symptoms.Both approaches aim to release Qi(气)and vitality by removing blockages through adjusting the interactions,adaptation,and balance of multiple elements and Yin‑Yang energies.The goal is to liberate the Qi or life force through improved holistic balance and cooperation.While TCM focuses on interventions at the level of the body,CCT focuses on the attention,awareness,acknowledgement,and alignment of the four human dimensions consisting of the intrapsychic,interpersonal,intergenerational,and universal‑spiritual.In light of the current trend toward increasing mental,substance use,and neurological disorders,in particular among countries of middle and low income,dialogue to explore these compatibilities between TCM and CCT is conducive to the continuous evolution of TCM and Western therapies to address not only physical health but also the exigencies of contemporary addiction and mental health care within a mind–body relationship matrix.