Search results for "init"

showing 10 items of 6629 documents

Cloning, purification, and nucleotide-binding traits of the catalytic subunit A of the V1VO ATPase from Aedes albopictus.

2007

The Asian tiger mosquito, Aedes albopictus, is commonly infected by the gregarine parasite Ascogregarina taiwanensis, which develops extracellularly in the midgut of infected larvae. The intracellular trophozoites are usually confined within a parasitophorous vacuole, whose acidification is generated and controlled by the V(1)V(O) ATPase. This proton pump is driven by ATP hydrolysis, catalyzed inside the major subunit A. The subunit A encoding gene of the Aedes albopictus V(1)V(O) ATPase was cloned in pET9d1-His(3) and the recombinant protein, expressed in the Escherichia coli Rosetta 2 (DE3) strain, purified by immobilized metal affinity- and ion-exchange chromatography. The purified prote…

Circular dichroismVacuolar Proton-Translocating ATPasesATPaseProtein subunitGene ExpressionGenes InsectBiologyIn Vitro Techniquesmedicine.disease_causelaw.inventionAdenosine TriphosphateATP hydrolysislawAedesCatalytic DomainmedicineAnimalsNucleotideCloning MolecularEscherichia coliDNA Primerschemistry.chemical_classificationPhotoaffinity labelingBase SequenceMolecular biologyProtein SubunitsSpectrometry FluorescenceBiochemistrychemistrySpectrometry Mass Matrix-Assisted Laser Desorption-Ionizationbiology.proteinRecombinant DNAInsect ProteinsBiotechnologyProtein expression and purification
researchProduct

CLOSING THE LOOP: STUDY OF INTEGRATED CYCLES WITH NATURAL AND ARTIFICIAL SOLUTIONS FOR THE PRODUCTION OF ENERGY, MINERALS AND FRESH WATER

Circular economy Reverse electrodialysis Minerals recovery Magnesium Hydroxide Waste Heat to Power Salinity Gradient Heat Engine
researchProduct

Debates with Small Transparent Quantum Verifiers

2014

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most NP to the collection of all Turing-decidable languages (recursive languages). When the verifier is further constrained to make the correct decision with probability 1, the corresponding class goes up from the regular languages up to at least E.

Class (computer programming)Theoretical computer scienceComputer scienceProgramming languageString (computer science)0102 computer and information sciencescomputer.software_genre01 natural sciences010305 fluids & plasmasRegular language010201 computation theory & mathematicsQubit0103 physical sciencesQuantum finite automataQuantumcomputerZero errorQuantum computer
researchProduct

Injectors with a central socle in a finite solvable group

2013

Abstract In response to an Open Question of Doerk and Hawkes (1992) [2, IX §4, p. 628] , we shall describe three constructions for the Z π -injectors of a finite solvable group, where Z π is the Fitting class formed by the finite solvable groups whose π -socle is central (and π is a set of prime numbers).

Class (set theory)Algebra and Number Theoryfitting classinjectorPrime numberFitting subgroupCombinatoricsSet (abstract data type)Soclecentral socleSolvable groupfinite solvable group theoryNilpotent groupMathematics
researchProduct

Complex powers and non-compact manifolds

2002

We study the complex powers $A^{z}$ of an elliptic, strictly positive pseudodifferential operator $A$ using an axiomatic method that combines the approaches of Guillemin and Seeley. In particular, we introduce a class of algebras, ``extended Weyl algebras,'' whose definition was inspired by Guillemin's paper on the subject. An extended Weyl algebra can be thought of as an algebra of ``abstract pseudodifferential operators.'' Many algebras of pseudodifferential operators are extended Weyl algebras. Several results typical for algebras of pseudodifferential operators (asymptotic completeness, construction of Sobolev spaces, boundedness between apropriate Sobolev spaces, >...) generalize to…

Class (set theory)Applied Mathematicsmedia_common.quotation_subjectMathematics - Operator AlgebrasAxiomatic systemMathematics::Spectral TheoryInfinityManifoldAlgebraSobolev spaceMathematics - Spectral TheoryOperator (computer programming)Mathematics - Analysis of PDEsCompleteness (order theory)FOS: MathematicsOperator Algebras (math.OA)Spectral Theory (math.SP)Mathematics::Symplectic GeometryAnalysisEigenvalues and eigenvectorsAnalysis of PDEs (math.AP)media_commonMathematics
researchProduct

Fast Matrix Multiplication

2015

Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n2.3755). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le~Gall has led to an improved algorithm running in time O(n2.3729). These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time O(n2.3725), and identify a wide class of variants of this approach which cannot result in an algorithm with running time $O(n^{2.3078}); in particular, this approach cannot prove the conjecture that for every e > 0, …

Class (set theory)Conjecturepeople.profession0102 computer and information sciences02 engineering and technology01 natural sciencesIdentity (music)Matrix multiplicationRunning timeCombinatorics010201 computation theory & mathematicsTensor (intrinsic definition)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingCoppersmithpeopleMathematicsCoppersmith–Winograd algorithmProceedings of the forty-seventh annual ACM symposium on Theory of Computing
researchProduct

Bounding Techniques and Their Application to Simplified Plastic Analysis of Structures

1990

In the framework of the simplified analysis methods for elastoplastic analysis problems, the bounding techniques possess an important role. A class of these techniques, based on the so-called perturbation method, are here presented with reference to finite element discretized structures. A general bounding principle is presented and its applications are illustrated by means of numerical examples.

Class (set theory)DiscretizationBounding overwatchComputer scienceApplied mathematicsPerturbation methodFinite element methodAnalysis method
researchProduct

Products of formations of finite groups

2006

[EN] In this paper criteria for a product of formations to be X-local, X a class of simple groups, are obtained. Some classical results on products of saturated formations appear as particular cases.

Class (set theory)Finite groupAlgebra and Number TheoryGrups Teoria deX-local formationOmega-local formationAlgebraProduct (mathematics)Simple groupÀlgebraFinite groupMATEMATICA APLICADAFormation productMathematics
researchProduct

On X-saturated formations of finite groups

2005

[EN] In the paper, a Frattini-like subgroup associated with a class X of simple groups is introduced and analysed. The corresponding X-saturated formations are exactly the X-local ones introduced by Förster. Our techniques are also very useful to highlight the properties and behaviour of omega-local formations. In fact, extensions and improvements of several results of Shemetkov are natural consequences of our study.

Class (set theory)Finite groupAlgebra and Number TheorySaturated formationGrups Teoria deP-saturated formationX-local formationLocal formationOmega-local formationGeneralized frattini subgroupOmega-saturated formationAlgebraSimple groupX-saturated formationÀlgebraFinite groupAlgebra over a fieldMATEMATICA APLICADAMathematics
researchProduct

On a class of supersoluble groups

2014

A subgroup H of a finite group G is said to be S-semipermutable in G if H permutes with every Sylow q-subgroup of G for all primes q not dividing |H|. A finite group G is an MS-group if the maximal subgroups of all the Sylow subgroups of G are S-semipermutable in G. The aim of the present paper is to characterise the finite MS-groups.

Class (set theory)Finite groupGeneral MathematicsSylow theoremsGrups Teoria deAlgebraCombinatoricsBT-groupMS-groupÀlgebraAlgebra over a fieldFinite groupMATEMATICA APLICADASoluble PST-groupT0-groupMathematics
researchProduct