Search results for "FC"

showing 10 items of 1442 documents

Groups with soluble minimax conjugate classes of subgroups

2008

A classical result of Neumann characterizes the groups in which each subgroup has finitely many conjugates only as central-by-finite groups. If $\mathfrak{X}$ is a class of groups, a group $G$ is said to have $\mathfrak{X}$-conjugate classes of subgroups if $G/core_G(N_G(H)) \in \mathfrak{X}$ for each subgroup $H$ of $G$. Here we study groups which have soluble minimax conjugate classes of subgroups, giving a description in terms of $G/Z(G)$. We also characterize $FC$-groups which have soluble minimax conjugate classes of subgroups.

Mathematics::Group TheoryT57-57.97Conjugacy classeSettore MAT/02 - AlgebraApplied mathematics. Quantitative methodsfc-groupspolycyclic groupssoluble minimax groupsSettore MAT/03 - Geometriasoluble minimax groups $FC$-groups polycyclic groups.conjugacy classes
researchProduct

Early entry events in Echovirus 30 infection

2020

Echovirus 30 (E30), a member of the enterovirus B species, is a major cause of viral meningitis, targeting children and adults alike. While it is a frequently isolated enterovirus and the cause of several outbreaks all over the world, surprisingly little is known regarding its entry and replication strategy within cells. In this study, we used E30 strain Bastianni (E30B) generated from an infectious cDNA clone in order to study early entry events during infection in human RD cells. E30B required the newly discovered Fc echovirus receptor (FcRn) for successful infection, but not the coxsackievirus and adenovirus receptor (CAR) or decay-accelerating factor (DAF), although an interaction with …

EchovirusvirusesReceptors FcVirus Replicationmedicine.disease_causeDisease OutbreaksPhylogenyEnterovirus0303 health sciencesbiologyenterovirusechovirusEnterovirus B HumanVirus-Cell InteractionsenteroviruksetCapsidaivokalvotulehdusRNA ViralECHO-viruksetEndosomeImmunologyEchovirus InfectionsCHO CellsCoxsackievirusMicrobiologyClathrininfektiotVirusCell Line03 medical and health sciencesCricetulusVirologyEnterovirus InfectionsViral meningitismedicineAnimalsHumans030304 developmental biologyearly entry030306 microbiologySequence Analysis DNAVirus Internalizationmedicine.diseasebiology.organism_classificationVirologyaseptic meningitisA549 CellsInsect Sciencebiology.proteinEnterovirus
researchProduct

Issues of Ethics and Methods in Studying Social Media

2016

The Editorial raises some challenging ethical and methodological aspects of Internet based research (such as protection of informational privacy, informed consent, general ethical guidelines vs case-based approach), which are further discussed in the five articles of this special issue.

FacebookComputingMilieux_THECOMPUTINGPROFESSIONCyberpsychologyCommunicationsocial media05 social sciencesComputingMilieux_LEGALASPECTSOFCOMPUTING050905 science studiesethicslcsh:P87-96lcsh:Communication. Mass mediaInformed consentInternet basedInternet based researchInformation ethics0502 economics and businessComputingMilieux_COMPUTERSANDSOCIETYparticipationEngineering ethicsSocial mediaSociology0509 other social sciencesSociology of the InternetSocial psychology050212 sport leisure & tourismMedia and Communication
researchProduct

Rapid construction of algebraic axioms from samples

1991

Abstract An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.

General Computer ScienceTheorySample (material)Theoretical Computer ScienceSeparation axiomAlgebraAxiom of extensionalityMathematics::LogicConstruction of the real numbersTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONCalculusReverse mathematicsAlgebraic numberAxiomComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Low-Power Audio Keyword Spotting using Tsetlin Machines

2021

The emergence of Artificial Intelligence (AI) driven Keyword Spotting (KWS) technologies has revolutionized human to machine interaction. Yet, the challenge of end-to-end energy efficiency, memory footprint and system complexity of current Neural Network (NN) powered AI-KWS pipelines has remained ever present. This paper evaluates KWS utilizing a learning automata powered machine learning algorithm called the Tsetlin Machine (TM). Through significant reduction in parameter requirements and choosing logic over arithmetic based processing, the TM offers new opportunities for low-power KWS while maintaining high learning efficacy. In this paper we explore a TM based keyword spotting (KWS) pipe…

FOS: Computer and information sciencesspeech commandSound (cs.SD)Computer scienceSpeech recognition02 engineering and technologykeyword spottingMachine learningcomputer.software_genreComputer Science - SoundReduction (complexity)Audio and Speech Processing (eess.AS)020204 information systemsFOS: Electrical engineering electronic engineering information engineering0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringArtificial neural networkLearning automatabusiness.industrylearning automatalcsh:Applications of electric power020206 networking & telecommunicationslcsh:TK4001-4102Pipeline (software)Power (physics)machine learningTsetlin MachineMFCCKeyword spottingelectrical_electronic_engineeringScalabilityMemory footprintpervasive AI020201 artificial intelligence & image processingMel-frequency cepstrumArtificial intelligencebusinesscomputerartificial neural networkEfficient energy useElectrical Engineering and Systems Science - Audio and Speech Processing
researchProduct

Maximal regularity via reverse Hölder inequalities for elliptic systems of n-Laplace type involving measures

2008

In this note, we consider the regularity of solutions of the nonlinear elliptic systems of n-Laplacian type involving measures, and prove that the gradients of the solutions are in the weak Lebesgue space Ln,∞. We also obtain the a priori global and local estimates for the Ln,∞-norm of the gradients of the solutions without using BMO-estimates. The proofs are based on a new lemma on the higher integrability of functions.

Pure mathematicsNonlinear systemLemma (mathematics)Laplace transformElliptic systemsGeneral MathematicsMathematical analysisMathematicsofComputing_NUMERICALANALYSISStandard probability spaceA priori and a posterioriType (model theory)Mathematical proofMathematics
researchProduct

Profit Margin Ratio, Markup, Profit Margin Per Unit, Economic Profit, and Profitability as Objectives for the Firm: An Economic Point-of-View

2015

We study five operational objectives for the firm: three marketing objectives (maximizing profit-margin ratio, maximizing markup, and maximizing profit-margin-per-unit), and two financial objective (maximizing economic profit (i.e., EVA) and maximizing profitability), as alternatives to the scholarly objective of maximizing profit. We prove that (i) Sales are lowest for profit-margin-per-unit, intermediate for profit-margin ratio and markup, and highest for profit maximization. Input consumption, including labor, is lower. Prices are in the reverse order. In terms of profit, profit-margin ratio, markup, and profit-margin-per-unit are necessarily less efficient than the classical profit maxi…

TheoryofComputation_MISCELLANEOUSMicroeconomicsNet profitGross profitMarginal profitProfit maximizationProfit marginEarnings before interest and taxesProfit centerProfitability indexBusinessSSRN Electronic Journal
researchProduct

On the Hierarchy Classes of Finite Ultrametric Automata

2015

This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k + 1)-head automata. Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. We introduce ultrametric Turing machines an…

Discrete mathematicsClass (set theory)TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFinite-state machineHierarchy (mathematics)Nonlinear Sciences::Cellular Automata and Lattice GasesCondensed Matter::Disordered Systems and Neural NetworksAutomatonAlgebraTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESsymbolsMathematics::Metric GeometryQuantum finite automataAutomata theoryUltrametric spaceComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

Worst Case Analysis of Non-local Games

2013

Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input x i to the i th player who then responds by sending an answer a i to the referee. The players win if the answers a i satisfy a condition that may depend on the inputs x i .

Computer Science::Computer Science and Game TheoryComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERAL0102 computer and information sciencesNon local01 natural sciences010201 computation theory & mathematicsQuantum stateSimple (abstract algebra)0103 physical sciencesQuantum worldQuantum information010306 general physicsMathematical economicsCase analysisMathematics
researchProduct

Measurement ofCP-violating asymmetries inB0→(ρπ)0decays using a time-dependent Dalitz plot analysis

2012

We report on a measurement of CP-violating asymmetries (A{sub CP}) in the Cabibbo-suppressed D{sup 0} {yields} {pi}{sup +}{pi}{sup -} and D{sup 0} {yields} K{sup +}K{sup -} decays reconstructed in a data sample corresponding to 5.9 fb{sup -1} of integrated luminosity collected by the upgraded Collider Detector at Fermilab. We use the strong decay D*{sup +} {yields} D{sup 0}{pi}{sup +} to identify the flavor of the charmed meson at production and exploit CP-conserving strong c{bar c} pair-production in p{bar p} collisions. High-statistics samples of Cabibbo-favored D{sup 0} {yields} K{sup -}{pi}{sup +} decays with and without a D*{sup {+-}} tag are used to correct for instrumental effects an…

Nuclear and High Energy PhysicsParticle physicsMesonCollider physicsmedia_common.quotation_subjectElectron–positron annihilationGeneral Physics and AstronomyDalitz plotMeasure (mathematics)01 natural sciencesResonance (particle physics)Asymmetrylaw.inventionNuclear physicsParticle decaylawTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0103 physical sciencesB meson010306 general physicsCollidermedia_commonPhysicsUnitarity010308 nuclear & particles physicsDetectorB-factoryCrystallographyDecay timePair productionCP violationHigh Energy Physics::ExperimentProduction (computer science)Collider Detector at FermilabBar (unit)Physical Review D
researchProduct