Results 241 to 250 of about 920,273 (264)
Some of the next articles are maybe not open access.

BF AND ANTI-BF THEORIES IN THE GENERALIZED CONNECTION FORMALISM

Modern Physics Letters A, 2004
We present a generalized connection formalism to explicitly determine an off-shell BRST–anti-BRST algebra for BF theories. This results in the construction of anti-BF theories based on an anti-BRST exact quantum action. These are not fundamentally different from BF theories, since they are in complete duality with respect to a mirror symmetry of the ...
Aidaoui, A., Doebner, H.-D., Tahiri, M.
openaire   +1 more source

Revisiting the TCNQF 4 0 / 1 - / 2 - ${{\bf TCNQF}_{\bf 4}^{{\bf 0/1 - /2 - }} }$ Catalysis Mechanism for the F e C N 6 3 - / 4 - ${\left[ {{\bf Fe}\left( {{\bf CN}} \right)_{\bf 6} } \right]^{{\bf 3 - /4 - }} }$ - S 2 O 6 2 - ${{\bf S}_{\bf 2} {\bf O}_{\bf 6}^{{\bf 2 - }} }$ / S 4 O 6 2 - ${{\bf S}_{\bf 4} {\bf O}_{\bf 6}^{{\bf 2 - }} }$ Redox Reaction.

Chemphyschem : a European journal of chemical physics and physical chemistry, 2023
The front cover artwork was done by Michelle Farrelly, a member of the Martin group at Monash University. The image represents a perspective of a cuvette in which the catalysis of the thiosulfate-ferricyanide reaction was achieved by a TCNQF4 -based redox reaction in aqueous solution.
Anbrah E, Alzubidi   +2 more
openaire   +1 more source

Distributed BFS algorithms

26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985
This paper develops a new distributed BFS algorithm for an asynchronous communication network. This paper presents two new BFS algorithms with improved communication complexity. The first algorithm has complexity O((E+V1.5)?logV) in communication and O(V1.5?logV) in time. The second algorithm uses the technique of the first recursively and achieves O(E?
Baruch Awerbuch, Robert G. Gallager
openaire   +1 more source

Aggregation of [Cu${{\bf }{{{\bf II}\hfill \atop \bf 4\hfill}}}$] Building Blocks into [Cu${{\bf }{{{\bf II}\hfill \atop \bf 8\hfill}}}$] Clusters or a [Cu${{\bf }{{{\bf II}\hfill \atop \bf 4\hfill}}}$] Chain through Subtle Chemical Control

Chemistry – A European Journal, 2004
AbstractCoordination complexes of the ligand H3L [1,3‐bis(3‐oxo‐3‐phenylpropionyl)‐2‐hydroxy‐5‐methylbenzene] with CuII are reported. Clusters showing various nuclearities or modes of supramolecular organization have been prepared by slightly changing the reaction conditions and have been crystallographically characterized. The reaction of H3L with one
Guillem Aromí   +9 more
openaire   +1 more source

The Polynomial Degree of the Grassmannian $${\mathcal G_{\bf 1,}{\bf n,}{\bf 2}}$$

Designs, Codes and Cryptography, 2006
For a subset ? of PG(N, 2) a known result states that ? has polynomial degree ? r, r? N, if and only if ? intersects every r-flat of PG(N, 2) in an odd number of points. Certain refinements of this result are considered, and are then applied in the case when ?
R. Shaw, N. A. Gordon
openaire   +1 more source

A NEW FAST VARIANT (BF*F08) OF THE BF POLYMORPHISM

International Journal of Immunogenetics, 1982
SUMMARYA new variant in the BF polymorphism was found in one individual from an isolate (Dogons) of Mali. It might correspond to the expression of a new allele BF*F08 with haemolytic activity.
C, Davrinche   +4 more
openaire   +2 more sources

On simplicial BF theory

Doklady Mathematics, 2008
This paper is a short summary of the author's constructions and results in [``Notes on simplicial \(BF\) theory'', \url{arXiv:hep-th/0610326v3}], which were later extended in his Ph. D. thesis [``Discrete \(BF\) theory'', \url{arXiv:0809.1160v2}], and may serve as an introduction or as a guide to these works. The author's results fit into the framework
openaire   +2 more sources

Bf POLYMORPHISM AND ANKYLOSING SPONDYLITIS

The Lancet, 1978
The authors have typed 44 Italian A.S. patients for Bf (all carried the B27 antigen, none were B27 homozygous): 27 had Bf SS, 14 SF, 2 S1S, and 1 FF. Phenotype frequencies of the Bf locus are in the Hardy-Weinberg equilibrium and in good agreement with our control group (χ25 6.30, 0 ...
MIGONE, Nicola   +3 more
openaire   +3 more sources

BF-tree

Proceedings of the VLDB Endowment, 2014
The increasing volume of time-based generated data and the shift in storage technologies suggest that we might need to reconsider indexing. Several workloads - like social and service monitoring - often include attributes with implicit clustering because of their time-dependent nature.
Manos Athanassoulis, Anastasia Ailamaki
openaire   +1 more source

Modules M such that ${\rm {\bf Ext}}_{{\bf \textit{R}}}^{\bf{1}}{({\bf \textit{M}},-)}$ Commutes with Direct Limits

Algebras and Representation Theory, 2012
We will use Watts’s theorem together with Lenzing’s characterization of finitely presented modules via commuting properties of the induced tensor functor in order to study commuting properties of covariant Ext-functors.
openaire   +1 more source

Home - About - Disclaimer - Privacy