Search results for "Abstract algebra"

showing 10 items of 452 documents

Simple variable-volume injector for flow-injection systems

1990

Abstract A simple and versatile variable-volume injector is described for the introduction of samples in flow-injection systems. The device delivers precisely and reproducibly (usually r.s.d.

ChemistryAnalytical chemistryInjectorMechanicsBiochemistryAnalytical Chemistrylaw.inventionVolume (thermodynamics)Flow (mathematics)Simple (abstract algebra)lawEnvironmental ChemistrySpectroscopyVariable (mathematics)Analytica Chimica Acta
researchProduct

New approach to condensed pyrid-2-ones

2002

We wish to report a simple procedure for the preparation of 5-substituted-thienopyridin-7-ones and 7-substituted-1,6-naphthyridin-5(6H)-ones, in good yields, from the dianions of 3-methylthiophene-2-carboxylic and 2-methylnicotinic acids on treatment with nitriles. Brun Sanchez, Eva Maria, Eva.M.Brun@uv.es ; Gil Grau, Salvador, Salvador.Gil@uv.es ; Parra Alvarez, Margarita, Margarita.Parra@uv.es

ChemistryCarboxylic acidsUNESCO::QUÍMICAOrganic Chemistry:QUÍMICA::Química orgánica [UNESCO]HeterocyclesCombinatorial chemistry:QUÍMICA [UNESCO]Addition reactionslcsh:QD241-441lcsh:Organic chemistrySimple (abstract algebra)Computational chemistryNitrilesCarboxylic acids ; Nitriles ; Addition reactions ; Heterocycles ; Tandem reactionsTandem reactionsUNESCO::QUÍMICA::Química orgánica
researchProduct

On the Reaction of (tBu2SnO)3 with Organochlorosilanes. Simple Formation of [(tBu2SnO)2(tBu2SiO)]

2008

ChemistrySimple (abstract algebra)Analytical chemistryPhysical chemistryX ray analysis
researchProduct

Extension of Walsh's rules to more general systems

1972

It is demonstrated that location of hydrogen atoms within bonding distance of a simple triatomic molecule can alter the order of energy levels relative to that of the parent system without significantly changing the behavior of the orbital energies under geometrical variation. As a result the ground state electronic configurations of H n AB2 systems often differ from those of triatomics with the same number of electrons and this fact is shown to be directly responsible for the existence of such distinctive geometrical structures as those possessed by cyclopropane, cyclopropyl and allyl cations and cyclopropene. Thus the familiar prescription of Walsh's rules which states that isoelectronic …

ChemistryTriatomic moleculeWalsh diagramCyclopropenechemistry.chemical_compoundSimple (abstract algebra)Excited stateQuantum mechanicsMoleculeChiropracticsElectron configurationPhysical and Theoretical ChemistryAtomic physicsGround stateTheoretica Chimica Acta
researchProduct

DenseYOLO: Yet Faster, Lighter and More Accurate YOLO

2020

As much as an object detector should be accurate, it should be light and fast as well. However, current object detectors tend to be either inaccurate when lightweight or very slow and heavy when accurate. Accordingly, determining tolerable tradeoff between speed and accuracy of an object detector is not a simple task. One of the object detectors that have commendable balance of speed and accuracy is YOLOv2. YOLOv2 performs detection by dividing an input image into grids and training each grid cell to predict certain number of objects. In this paper we propose a new approach to even make YOLOv2 more fast and accurate. We re-purpose YOLOv2 into a dense object detector by using fine-grained gr…

Class (computer programming)Computer sciencebusiness.industry05 social sciencesDetectorFunction (mathematics)010501 environmental sciencesObject (computer science)01 natural sciencesObject detectionImage (mathematics)Task (computing)Simple (abstract algebra)0502 economics and businessComputer visionArtificial intelligence050207 economicsbusiness0105 earth and related environmental sciences2020 11th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)
researchProduct

Noise-tolerant efficient inductive synthesis of regular expressions from good examples

1997

We present an almost linear time method of inductive synthesis restoring simple regular expressions from one representative (good) example. In particular, we consider synthesis of expressions of star-height one, where we allow one union operation under each iteration, and synthesis of expressions without union operations from examples that may contain mistakes. In both cases we provide sufficient conditions defining precisely the class of target expressions and the notion of good examples under which the synthesis algorithm works correctly, and present the proof of correctness. In the case of expressions with unions the proof is based on novel results in the combinatorics of words. A genera…

Class (set theory)CorrectnessComputer programComputer Networks and CommunicationsComputer scienceComputer experimentTheoretical Computer ScienceHardware and ArchitectureSimple (abstract algebra)Regular expressionTime complexityAlgorithmSoftwareProgram synthesisNew Generation Computing
researchProduct

TOPOLOGICAL QUANTUM DOUBLE

1994

Following a preceding paper showing how the introduction of a t.v.s. topology on quantum groups led to a remarkable unification and rigidification of the different definitions, we adapt here, in the same way, the definition of quantum double. This topological double is dualizable and reflexive (even for infinite dimensional algebras). In a simple case we show, considering the double as the "zero class" of an extension theory, the uniqueness of the double structure as a quasi-Hopf algebra. A la suite d'un précédent article montrant comment l'introduction d'une topologie d'e.v.t. sur les groupes quantiques permet une unification et une rigidification remarquables des différentes définitions,…

Class (set theory)UnificationSimple (abstract algebra)Zero (complex analysis)Structure (category theory)Statistical and Nonlinear PhysicsUniquenessExtension theoryTopologyQuantumMathematical PhysicsMathematicsReviews in Mathematical Physics
researchProduct

Imitation Learning and Anchoring through Conceptual Spaces

2007

In order to have a robotic system able to effectively learn by imitation and not merely reproduce the movements of a human teacher, the system should have the capability to deeply understand the perceived actions to be imitated. This paper deals with the development of a cognitive architecture for learning by imitation in which a rich conceptual representation of the observed actions is built. The purpose of the following discussion is to show how the same conceptual representation can be used both in a bottom-up approach, in order to learn sequences of actions by imitation learning paradigm, and in a top-down approach, in order to anchor the symbolical representations to the perceptual act…

Cognitive scienceSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniComputer sciencebusiness.industrymedia_common.quotation_subjectRepresentation (systemics)AnchoringCognitive architectureHUMAN ARM MOVEMENTS; SYSTEM; TIMERobotics Imitation LearningArtificial IntelligenceSimple (abstract algebra)Order (business)PerceptionArtificial intelligenceCognitive imitationImitationbusinessmedia_common
researchProduct

Nonlocal Quantum XOR Games for Large Number of Players

2010

Nonlocal games are used to display differences between classical and quantum world In this paper, we study nonlocal games with a large number of players We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player, a subclass of nonlocal games We illustrate those methods on the example of the N-player game (due to Ardehali [Ard92]) that provides the maximum quantum-over-classical advantage.

CombinatoricsAlgebraComputer Science::Computer Science and Game TheoryQuantum pseudo-telepathySimple (abstract algebra)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALQuantum worldQuantumMathematics
researchProduct

Improved Constructions of Quantum Automata

2008

We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use $\frac{4}{\epsilon} \log 2p + O(1)$ states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of logp than the previously known construction of [2]. Similarly to [2], our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some preliminary results in this direction.

CombinatoricsDiscrete mathematicsFinite-state machineSimple (abstract algebra)Quantum automataProbabilistic logicQuantum finite automataConstant (mathematics)MathematicsAutomatonExponential function
researchProduct