Results 201 to 210 of about 122,015 (230)
Multi-objective and cross-scale inverse design of temperature-control materials via physics-constrained machine learning. [PDF]
Natl Sci RevDing D +20 more
europepmc +1 more source
Stress-State-Dependent Reinforcement of Cement-Stabilized Soil Using Waste Brick Powder and Glass Fiber. [PDF]
Materials (Basel)Yin X, Rahman MM, Wang J, Mohammed A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the American Mathematical Society, 1988
Summary: A new, surprisingly simple proof is given of the finiteness of the set of matroids minor-minimally not representable over GF(3). It is, in fact, proved that every such matroid has rank or corank at most 3.
Kahn, Jeff, Seymour, Paul
openaire +2 more sources
Summary: A new, surprisingly simple proof is given of the finiteness of the set of matroids minor-minimally not representable over GF(3). It is, in fact, proved that every such matroid has rank or corank at most 3.
Kahn, Jeff, Seymour, Paul
openaire +2 more sources
Codesign of a Computationally Intensive Problem in GF(3)
18th IEEE/IFIP International Workshop on Rapid System Prototyping (RSP '07), 2007A reprogrammable hardware platform is used for the co-design and implementation of a computational intensive mathematical problem, namely the listing of irreducible polynomials over Galois fields of order 3 (GF(3)), The main goal is to accelerate the performance compared to an existing software implementation.
Kenneth B. Kent +2 more
openaire +1 more source
Studia Logica, 2002
For an algebra \textbf{A}, \(p_n({\mathbf A})\) denotes the number of essentially \(n\)-ary term functions over \textbf{A}. It was shown by \textit{G. Grätzer} and \textit{R. Padmanabhan} [Proc. Am. Math. Soc. 28, 75-80 (1971; Zbl 0215.34501)] that an algebra \textbf{A} is a nontrivial affine space over GF(3) if and only if \(p_n({\mathbf A})=(2^n-(-1)^
openaire +2 more sources
For an algebra \textbf{A}, \(p_n({\mathbf A})\) denotes the number of essentially \(n\)-ary term functions over \textbf{A}. It was shown by \textit{G. Grätzer} and \textit{R. Padmanabhan} [Proc. Am. Math. Soc. 28, 75-80 (1971; Zbl 0215.34501)] that an algebra \textbf{A} is a nontrivial affine space over GF(3) if and only if \(p_n({\mathbf A})=(2^n-(-1)^
openaire +2 more sources
Family of fast transforms over GF(3) logic
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings., 2004New classes of recursive transforms over GF(3) have been introduced here. They are based on simple recursive equations what allows to obtain corresponding fast forward and inverse transforms and very regular butterfly diagrams. The classification is further extended into various transforms with horizontal and vertical permutations.
Bogdan J. Falkowski, Cheng Fu 0001
openaire +2 more sources