In this paper, we introduce a new algorithm for computing the syzygies of a sequence of polynomials. For this, we extend a given sequence to a Gröbner basis using Faugère’s F5 algorithm (see [1]). We show that if we keep all the reductions to zero during this computation, then at termination (by adding principal syzygies) we get a basis for the module of syzygies of input polynomials. We have i...

In this paper, we present an enhancement to the steganalysis algorithm that successfully attacks F5 steganographic algorithm using JPEG digital images. The key idea is related to the selection of an “optimal” value of β (the probability that a non-zero AC coefficient will be modified) for the image under consideration. Rather than averaging the values of β for 64 shifting steps worked on an ima...

Worker Preferences Firm Preferences w1 : [f1] f2 f3 f4 f5 f6 f7 f8 f1 : [w1] w2 w3 w4 w5 w6 w7 w8 w2 : f1 [f2] f3 f4 f5 f6 f7 f8 f2 : w1 [w2] w3 w4 w5 w6 w7 w8 w3 : f1 f2 [f3] f4 f5 f6 f7 f8 f3 : w1 w2 [w3] w4 w5 w6 w7 w8 w4 : f1 f2 f3 [f4] f5 f6 f7 f8 f4 : w1 w2 w3 [w4] w5 w6 w7 w8 w5 : f1 f2 f3 f4 [f5] f6 f7 f8 f5 : w1 w2 w3 w4 [w5] w6 w7 w8 w6 : f1 f2 f3 f4 f5 [f6] f7 f8 f6 : w1 w2 w3 w4 w5 ...

We adapt the p-group generation algorithm to classify small-dimensional nilpotent Lie algebras over small fields. Using an implementation of this algorithm, we list the nilpotent Lie algebras of dimension at most 9 over F2 and those of dimension at most 7 over F3 and F5 .

There are a lot of methods for embedding hidden information in JPEG format but no method have been presented so far with a high capacity and same accuracy. The loss of JPEG compression and the effects of such compression on the images have prevented the location area from being easily used for embedding and most of the methods apply the DCT coefficients of JPEG algorithm for this aspect. This p...

The ventral premotor area (F5) is part of the cortical circuit controlling visuomotor grasp. F5 could influence hand motor function through at least two pathways: corticospinal projections and corticocortical projections to primary motor cortex (M1). We found that stimulation of macaque F5, which by itself evoked little or no detectable corticospinal output, could produce a robust modulation of...

template matching is a widely used technique in many of image processing and machine vision applications. in this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to rotation, scale, translation and brightness (rstb) changes. for this purpose, we adopt the idea of ring projection transform (rpt) of image. in the proposed algorithm, two novel s...

In this paper, we present a steganalytic method that can reliably detect messages (and estimate their size) hidden in JPEG images using the steganographic algorithm F5. The key element of the method is estimation of the cover-image histogram from the stego-image. This is done by decompressing the stego-image, cropping it by four pixels in both directions to remove the quantization in the freque...

It is likely that the murine response to human recombinant TNFα (hrTNFα) may generate antibodies (Ab) to epitopes present in TNFα from other species. Here, we demonstrate that F5 antihrTNFα monoclonal antibody (mAb) recognizes feline TNFα while E8 anti-hrTNFα mAb failed to do so. In order to demonstrate that E8 and F5 mAb recognize different epitopes in the hrTNFα molecule, a constant concentra...

We construct a new efficient algorithm for finding Gröbner–Shirshov bases for noncommutative algebras and their representations. This algorithm uses the Macaulay matrix [F.S. Macaulay, On some formula in elimination, Proc. London Math. Soc. 33 (1) (1902) 3–27], and can be viewed as a representation theoretic analogue of the F4 algorithm developed by J.C. Faugère. We work out some examples of un...