Search results for "FPR"

showing 10 items of 24 documents

Inductive types in homotopy type theory

2012

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for intensional systems of type theory as well as a computational approach to algebraic topology via type theory-based proof assistants such as Coq. The present work investigates inductive types in this setting. Modified rules for inductive types, including types of well-founded trees, or W-types, are presented, and the basic homotopical semantics of such types are determined. Proofs of all results have been formally verified by the Coq proof assistant, and the proof s…

FOS: Computer and information sciencesComputer Science - Logic in Computer Science03B15 03B70 03F500102 computer and information sciences01 natural sciencesComputer Science::Logic in Computer ScienceFOS: MathematicsA¹ homotopy theoryCategory Theory (math.CT)0101 mathematicsMathematicsHomotopy lifting propertyType theory inductive types homotopy-initial algebraHomotopy010102 general mathematicsMathematics - Category TheoryIntuitionistic type theoryMathematics - LogicSettore MAT/01 - Logica MatematicaLogic in Computer Science (cs.LO)Algebran-connectedType theoryTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsProof theoryTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSHomotopy type theoryComputer Science::Programming LanguagesLogic (math.LO)
researchProduct

On Language Adequacy

2015

Abstract The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most general one being: the compatibility of the language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory of syntax T of any categorial language L generated by the so-called classical categorial grammar, and also on the ground of its extension to the bi-level, intensional and ex- tensio…

categorial grammartruthPrinciple of compositionalitySemantics (computer science)constituent of knowledgeMeaning (philosophy of language)Denotationreferringcompatibility of syntax and semanticsintensional semanticsAZ20-999interpretationMathematicsontological objectInterpretation (logic)Categorial grammarcommunicationmeaningcategorizationtoken-type distinctionalgebraic modelsLinguisticsSyntax (logic)PhilosophyTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESdenotationcompositionalityTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSextensional semanticsHistory of scholarship and learning. The humanitiesOn LanguageStudies in Logic, Grammar and Rhetoric
researchProduct

Counting in the Two Variable Guarded Logic with Transitivity

2005

We show that the extension of the two-variable guarded fragment with transitive guards (GF+TG) by functionality statements is undecidable. This gives immediately undecidability of the extension of GF+TG by counting quantifiers. The result is optimal, since both the three-variable fragment of the guarded fragment with counting quantifiers and the two-variable guarded fragment with transitivity are undecidable. We also show that the extension of GF+TG with functionality, where functional predicate letters appear in guards only, is decidable and of the same complexity as GF+TG. This fragment captures many expressive modal and description logics.

Discrete mathematicsTransitive relationGuarded logicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESFragment (logic)Description logicFunctional predicateTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSExtension (predicate logic)Undecidable problemMathematicsDecidability
researchProduct

Exploring Students’ Metacognitive Knowledge: The Case of Integral Calculus

2020

Previous studies of integral calculus have mainly explored students&rsquo

Public AdministrationInterviewMetacognitionPhysical Therapy Sports Therapy and Rehabilitation050105 experimental psychologyEducationmetacognitive knowledgeTaxonomy (general)Fundamental theorem of calculusintegral calculusDevelopmental and Educational PsychologyComputer Science (miscellaneous)Mathematics educationComputingMilieux_COMPUTERSANDEDUCATION0501 psychology and cognitive sciencesMathematics instructionfundamental theorem of calculusKnowledge level05 social sciences050301 educationProcedural knowledgeVDP::Matematikk og Naturvitenskap: 400::Matematikk: 410Computer Science ApplicationsIntegral calculusintegral-area relationshipTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESmonitoring strategiesTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSPsychologylcsh:L0503 educationlcsh:EducationEducation Sciences
researchProduct

Minimal forbidden words and symbolic dynamics

1996

We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system defined by L.

Discrete mathematicsFactorial010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Symbolic dynamicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesInvariant (physics)16. Peace & justice01 natural sciencesCombinatorics010201 computation theory & mathematicsTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSInformation complexityFormal language0101 mathematicsComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUSMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

A Supplementary Text to “Contextuality in Canonical Systems of Random Variables” by Ehtibar N. Dzhafarov, Víctor H. Cervantes, and Janne V. Kujala (P…

2017

Mathematical Proofs

TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSMathematicsofComputing_GENERAL
researchProduct

Transformations that preserve learnability

1996

We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identification type I, if the transformation always maps I-identifiable sets into I-identifiable sets.

Computer scienceLearnabilityType (model theory)Inductive reasoningAlgebraTuring machinesymbols.namesakeIdentification (information)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTransformation (function)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSRecursive functionssymbolsInitial segment
researchProduct

Electron Ion Collider: The Next QCD Frontier: Understanding the glue that binds us all

2016

International audience; This White Paper presents the science case of an Electron-Ion Collider (EIC), focused on the structure and interactions of gluon-dominated matter, with the intent to articulate it to the broader nuclear science community. It was commissioned by the managements of Brookhaven National Laboratory (BNL) and Thomas Jefferson National Accelerator Facility (JLab) with the objective of presenting a summary of scientific opportunities and goals of the EIC as a follow-up to the 2007 NSAC Long Range plan. This document is a culmination of a community-wide effort in nuclear science following a series of workshops on EIC physics over the past decades and, in particular, the focus…

Nuclear and High Energy Physicsdesign [accelerator]nucl-th[PHYS.NUCL]Physics [physics]/Nuclear Theory [nucl-th]parton: distribution functionnucleus: structure functionpolarized beamstructure function: spin[PHYS.NEXP]Physics [physics]/Nuclear Experiment [nucl-ex]nucl-exstructure function [nucleon]Atomicproposed [colliding beams]design [detector]Particle and Plasma Physicsquantum chromodynamics[PHYS.HEXP]Physics [physics]/High Energy Physics - Experiment [hep-ex]ddc:530Nuclearsaturation [gluon]colliding beams [electron nucleon]Hardware_REGISTER-TRANSFER-LEVELIMPLEMENTATIONdetector: designaccelerator: designhep-exnew physicsMolecularhep-phelectron nucleon: colliding beamsnucleon: structure functionstructure function [nucleus]Nuclear & Particles PhysicseRHICTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESelectron nucleus: colliding beamscolliding beams: proposedTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS[PHYS.HPHE]Physics [physics]/High Energy Physics - Phenomenology [hep-ph]gluon: saturationELICspin [structure function]Software_PROGRAMMINGLANGUAGEScolliding beams [electron nucleus]distribution function [parton]Hardware_LOGICDESIGNJefferson Lab
researchProduct

Designing alarm sounds for the control of a hydraulic platform

2011

The design of alarm sounds is a subtle yet important challenge. Our conceptions and stereotypes of what alarm sounds sound like are usually quite entrenched, which may be limiting the acceptance of new alarm sounds into the domain of traditional ones. This paper presents the design approaches undertaken for the case of redesigning a set of alarm and notification sounds. An analysis of the approaches' effectiveness, some design decisions, and other challenges faced are presented herein, while preliminary feedback on their effectiveness is discussed.

Sound (medical instrument)ALARMComputer scienceHuman–computer interactionTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSControl (management)LimitingSet (psychology)SimulationDomain (software engineering)Proceedings of the 6th Audio Mostly Conference: A Conference on Interaction with Sound
researchProduct

Chemotherapy-induced antitumor immunity requires formyl peptide receptor 1.

2015

How dying tumor cells get noticed Besides killing tumor cells directly, some chemotherapies, such as anthracyclines, also activate the immune system to kill tumors. Vacchelli et al. discovered that in mice, anthracycline-induced antitumor immunity requires immune cells to express the protein formyl peptide receptor 1 (FPR1). Dendritic cells (DCs) near tumors expressed especially high amounts of FPR1. DCs normally capture fragments of dying tumor cells and use them to activate nearby T cells to kill tumors, but DCs lacking FPR1 failed to do this effectively. Individuals with breast or colon cancer expressing a variant of FPR1 and treated with anthracyclines showed poor metastasis-free and ov…

AnthracyclineColorectal cancermedicine.medical_treatmentT-LymphocytesBreast Neoplasmsmicrofluidic chipchemotherapyPolymorphism Single NucleotideFormyl peptide receptor 1immune responseMiceImmune systemImmunityCell Line TumorNeoplasmsmedicineLeukocytesAnimalsHumansAnthracyclinesAllelesAnnexin A1ChemotherapyMultidisciplinarybusiness.industryDendritic Cellsmedicine.diseaseReceptors Formyl PeptideImmunity InnateChemotherapy AdjuvantCancer cellImmunologyCancer researchFemalebusinessColorectal NeoplasmsAdjuvantFPR1 microfluidicScience (New York, N.Y.)
researchProduct