Let R be a Cohen-Macaulay local ring with maximal ideal m. In this paper we present a procedure for computing the coefficient ideals, in particular the Ratllif-Rush closure, of a m−primary ideal I ⊂ R.

With the help of computer algorithms, we improve the lower bound on the edge Folkman number Fe(3, 3; 5) and vertex Folkman number Fv(3, 3; 4), and thus show that the exact values of these numbers are 15 and 14, respectively. We also present computer enumeration of all critical graphs.

Reliability theory is used to assess the sensitivity of a passive flexion and active flexion of the human lower leg Finite Element (FE) models with Total Knee Replacement (TKR) to the variability in the input parameters of the respective FE models. The sensitivity of the active flexion simulating the stair ascent of the human lower leg FE model with TKR was presented before in [1,2] whereas now...

A combined experimental and theoretical approach has been used to investigate the redox properties of two dinuclear Ru(II) complexes, 2a and 2b, containing the planar dpt-ph-dpt bridging ligand (dpt-ph-dpt = 1'',4''-bis(2,4-dipyrid-2'-yl-1,3,5-triazin-6-yl)benzene). The redox properties of the free bridging ligand and the X-ray structure of 2a have also been reported, together with the X-ray st...

This paper deals with electromagnetic design and 2-D (two-dimensional) magnetic field analysis of novel low force ripple linear switched reluctance (LSR) motor. The configuration that has been presented here has a higher number of rotor poles than stator poles, and the purpose of this configuration is to improve the force ripple, which is the weak point of LSRMs. In order to illustrate the ...

Physically-based animation techniques enable more realistic and accurate animation to be created. Such approaches require the creation of a complex simulation model that, for computer graphics applications, can efficiently produce realistic-looking animations. We present a process to automatically create animatable nonconforming hexahedral finite element (FE) simulation models of facial soft ti...

Grammatical Evolution is an evolutionary algorithm that can evolve complete programs using a Backus Naur form grammar as a plug-in component to describe the output language. An important issue of Grammatical Evolution, and evolutionary computation in general, is the difficulty in dealing with deceptive problems and avoid premature convergence to local optima. Novelty search is a recent techniqu...

Realizing indistinguishablility obfuscation (IO) based on well-understood computational assumptions is an important open problem. Recently, realizing functional encryption (FE) has emerged as promising directing towards that goal. This is because: (1) compact single-key FE (where the functional secret-key is of length double the ciphertext length) is known to imply IO [Anath and Jain, CRYPTO 20...