Results 1  10
of
8,071
OVER F2 AND F3
"... Abstract. We consider arrays of size 2 × 2 × 2 and 2 × 2 × 2 × 2 over the fields with two and three elements. We use computer algebra to determine the canonical forms of these arrays with respect to the action of the semidirect product of general linear groups with the symmetric group. For each cano ..."
Abstract
 Add to MetaCart
Abstract. We consider arrays of size 2 × 2 × 2 and 2 × 2 × 2 × 2 over the fields with two and three elements. We use computer algebra to determine the canonical forms of these arrays with respect to the action of the semidirect product of general linear groups with the symmetric group. For each
InductiveDataType Systems
, 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schem ..."
Abstract

Cited by 821 (23 self)
 Add to MetaCart
Schema", whichgeneral39I theusual recursor definitions fornatural numbers and simil9 "basic inductive types". This combined lmbined was shown to bestrongl normalIk39f The purpose of this paper is toreformul33 and extend theGeneral Schema in order to make it easil extensibl3 to capture a
ON THE (3, F) GENERALIZATIONS OF THE FIBONACCI SEQUENCE
, 1995
"... ...purpose of this paper is to derive formulas for all (3, F) generalized Fibonacci sequences as functions of the terms of seven sixthorder recursive sequences. Let S = {a, h, c} and Sc be the group of permutations on S. Let i be the identity; and a{ah),p{ac), y = (b c) be the two cycles; and 8 ..."
Abstract
 Add to MetaCart
...purpose of this paper is to derive formulas for all (3, F) generalized Fibonacci sequences as functions of the terms of seven sixthorder recursive sequences. Let S = {a, h, c} and Sc be the group of permutations on S. Let i be the identity; and a{ah),p{ac), y = (b c) be the two cycles; and 8
MAFFT version 5: improvement in accuracy of multiple sequence alignment
 NUCLEIC ACIDS RES
, 2005
"... The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed high ..."
Abstract

Cited by 801 (5 self)
 Add to MetaCart
The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. That is, we replaced the reference to >.� ) in and similarly for 11"�) in Equation 3, where 0 :::; J.l :::; 1 is the momentum term. It is easy to show that if the modified system of equations converges to a fixed point F, then F is also a fixed point of the original system (since if>.� ) = >
On the Folkman Number f(2, 3, 4)
, 2007
"... Let f(2, 3, 4) denote the smallest integer n such that there exists a K4free graph of order n for which any 2coloring of its edges yields at least one monochromatic triangle. It is wellknown that such a number must exist. For a long time the best known upper bound, provided by J. Spencer, said th ..."
Abstract
 Add to MetaCart
that f(2, 3, 4) < 3 · 10 9. Recently, L. Lu announced that f(2, 3, 4) < 10 000. In this note, we will give a computer assisted proof showing that f(2, 3, 4) < 1000. To prove it we will generalize the idea of Goodman giving a necessary and sufficient condition for a graph G to yield a
MATHEMATICAL COMMUNICATIONS 481 Math. Commun. 16(2011), 481–489. Applications of a generalized form of Gauss’s second theorem
, 2010
"... to the series 3F2 ..."
Storage and executive processes in the frontal lobes.
 Science,
, 1999
"... The human frontal cortex helps mediate working memory, a system that is used for temporary storage and manipulation of information and that is involved in many higher cognitive functions. Working memory includes two components: shortterm storage (on the order of seconds) and executive processes th ..."
Abstract

Cited by 401 (5 self)
 Add to MetaCart
cognitive functions, and how are these implemented in frontal cortex? Recent discussions of this issue have focused on working memory, a system used for temporary storage and manipulation of information. The system is divided into two general components: shortterm storage and a set of "
Session F3F BUILDING MATHEMATICS LEARNING APPLICATIONS BY MEANS OF CONSMATH
"... Abstract In this paper we describe the ConsMath approach to the construction of interactive applications that allow students to learn how to solve problems of Mathematics and related fields that involve symbolic computations. ConsMath is a tool that can be used by tutors in order to build their own ..."
Abstract
 Add to MetaCart
their own sets of interactive problems. It supports a methodology by which, starting from a static document that shows a resolution of a particular problem, a tutor can create a set of interactive problems in two steps. The first step builds a generalization of the problem where the initial formulae
Results 1  10
of
8,071