Search results for "DF"

showing 10 items of 1699 documents

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Computational complexity theoryLogiccomputational complexityguarded fragmentsatisfiability problemBinary numberTheoretical Computer ScienceCombinatoricsArts and Humanities (miscellaneous)Computer Science::Logic in Computer ScienceClosure operatorEquivalence (formal languages)MathematicsDiscrete mathematicssatisfiability problemcomputational complexitydecidabilityequivalence closureSatisfiabilityDecidabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (computer programming)Hardware and ArchitectureTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSBoolean satisfiability problemSoftwareJournal of Logic and Computation
researchProduct

Pini Language and PiniTree Ontology Editor: Annotation and Verbalisation for Atomised Journalism

2020

We present a new ontology language Pini and the PiniTree ontology editor supporting it. Despite Pini language bearing lot of similarities with RDF, UML class diagrams, Property Graphs and their frontends like Google Knowledge Graph and Protege, it is a more expressive language enabling FrameNet-style natural language annotation for Atomised journalism use case.

Computer science05 social sciences050801 communication & media studies02 engineering and technologycomputer.file_formatOntology languageProtégéLinguisticsAnnotation0508 media and communicationsUnified Modeling Language0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingJournalismClass diagramRDFcomputerNatural languagecomputer.programming_language
researchProduct

Automatic Calibration of an Industrial RGB-D Camera Network Using Retroreflective Fiducial Markers

2019

This paper describes a non-invasive, automatic, and robust method for calibrating a scalable RGB-D sensor network based on retroreflective ArUco markers and the iterative closest point (ICP) scheme. We demonstrate the system by calibrating a sensor network comprised of six sensor nodes positioned in a relatively large industrial robot cell with an approximate size of 10 m × 10 m × 4 m . Here, the automatic calibration achieved an average Euclidean error of 3 c m at distances up to 9.45 m . To achieve robustness, we apply several innovative techniques: Firstly, we mitigate the ambiguity problem that occurs when detecting a marker at long range or low resolution by comparing the…

Computer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologylcsh:Chemical technologytime-of-flightBiochemistryArticleVDP::Food science and technology: 600Analytical Chemistrylaw.inventionIndustrial robotlawRegion of interestRobustness (computer science)automatic calibration0202 electrical engineering electronic engineering information engineeringCalibrationVDP::Næringsmiddelteknologi: 600lcsh:TP1-1185Computer visionElectrical and Electronic EngineeringInstrumentationbusiness.industryambiguity problemIterative closest point3D sensors020207 software engineeringretroreflective markersAtomic and Molecular Physics and OpticsTime of flightTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESRGB color model020201 artificial intelligence & image processingArtificial intelligencebusinessFiducial markerWireless sensor networkSensors
researchProduct

ViziQuer: A Visual Notation for RDF Data Analysis Queries

2019

Visual SPARQL query notations aim at easing the RDF data querying task. At the current state of the art there is still no generally accepted visual graph-based notation suitable to describe RDF data analysis queries that involve aggregation and subqueries. In this paper we present a visual diagram-centered notation for SPARQL select query formulation, capable to handle aggregate/statistics queries and hierarchic queries with subquery structure. The notation is supported by a web-based prototype tool. We present the notation examples, describe its syntax and semantics and describe studies with possible end users, involving both IT and medicine students.

Computer scienceEnd userProgramming languageInformationSystems_INFORMATIONSTORAGEANDRETRIEVAL010401 analytical chemistry05 social sciencesQuery formulationInformationSystems_DATABASEMANAGEMENTcomputer.file_formatNotationcomputer.software_genre01 natural sciences0104 chemical sciencesSPARQLGraph (abstract data type)0501 psychology and cognitive sciencesVisual notationRDFcomputer050107 human factors
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

Grammars++ for modelling information in text

1999

Abstract Grammars provide a convenient means to describe the set of valid instances in a text database. Flexibility in choosing a grammar can be exploited to provide information modelling capability by designing productions in the grammar to represent entities and relationships of interest to database applications. Additional constraints can be specified by attaching predicates to selected nonterminals in the grammar. When used for database definition, grammars can provide the functionality that users have come to expect of database schemas. Extended grammars can also be used to specify database manipulation, including query, update, view definition, and index specification.

Computer scienceViewmedia_common.quotation_subjectComputerApplications_COMPUTERSINOTHERSYSTEMScomputer.software_genreQuery languageDatabase designAdaptive grammarRule-based machine translationmedia_commonGrammarProgramming languagebusiness.industryDatabase schemaPredicate (grammar)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESExtended Affix GrammarHardware and ArchitectureAffix grammarStochastic context-free grammarSynchronous context-free grammarArtificial intelligenceL-attributed grammarbusinesscomputerSoftwareNatural language processingInformation SystemsInformation Systems
researchProduct

Grammar is the heart of language : grammar and its role in language learning among Finnish university students

2015

This article presents and discusses views on grammar and its role in formal language learning amongst Finnish university students. The results are based on a questionnaire which was distributed to students at the University of Jyväskylä as part of institutional action research. The background to the project was a feeling amongst some teachers of increased divergence between student respectively language teacher understandings of the role of grammar in language teaching. This concern raised the need to find out how students view grammar. The knowledge about thoughts on grammar amongst students would then help teachers to adjust and adept the way grammar is used in language teaching. The main…

Computer sciencefolk linguistics/sociolinguisticsTeaching methodmedia_common.quotation_subjectContext (language use)ta6121language learningwritten languageFormal languageComputingMilieux_COMPUTERSANDEDUCATIONtoimivuuskielen oppiminenfunctionalitymedia_commonGrammarnormatiivisuusLanguage acquisitionSecond-language acquisitionLinguisticskielioppiTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESnormativityLanguage educationgrammaremic/eticNatural language
researchProduct

Iterative pairs and multitape automata

1996

In this paper we prove that if every iterative k-tuple of a language L recognized by a k-tape automaton is very degenerate, then L is recognizable. Moreover, we prove that if L is an aperiodic langnage recognized by a deterministic k-tape automaton, then L is recognizable.

ComputingMilieux_GENERALDiscrete mathematicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESFinite-state machineAperiodic graphFree monoidDegenerate energy levelsMathematicsAutomaton
researchProduct

libvdwxc: A library for exchange-correlation functionals in the vdW-DF family

2017

We present libvdwxc, a general library for evaluating the energy and potential for the family of vdW-DF exchange--correlation functionals. libvdwxc provides an efficient implementation of the vdW-DF method and can be interfaced with various general-purpose DFT codes. Currently, the GPAW and Octopus codes implement interfaces to libvdwxc. The present implementation emphasizes scalability and parallel performance, and thereby enables \textit{ab initio} calculations of nanometer-scale complexes. The numerical accuracy is benchmarked on the S22 test set whereas parallel performance is benchmarked on ligand-protected gold nanoparticles ($\text{Au}_{144}(\text{SC}_{11}\text{NH}_{25})_{60}$) up to…

Condensed Matter - Materials ScienceMaterials scienceAb initioMaterials Science (cond-mat.mtrl-sci)FOS: Physical sciences02 engineering and technology021001 nanoscience & nanotechnologyCondensed Matter Physics01 natural sciencesMolecular physicsComputer Science ApplicationsMechanics of MaterialsModeling and SimulationTest set0103 physical sciencesoctopus (software)General Materials SciencevdW-DF family010306 general physics0210 nano-technologyEnergy (signal processing)libvdwxc
researchProduct

Generation and Evolution of Spin-, Valley-, and Layer-Polarized Excited Carriers in Inversion-Symmetric WSe2

2016

We report the spin-selective optical excitation of carriers in inversion-symmetric bulk samples of the transition metal dichalcogenide (TMDC) WSe2. Employing time- and angle-resolved photoelectron spectroscopy (trARPES) and complementary time-dependent density functional theory (TDDFT), we observe spin-, valley-, and layer-polarized excited state populations upon excitation with circularly polarized pump pulses, followed by ultrafast ( < 100     fs ) scattering of carriers towards the global minimum of the conduction band. TDDFT reveals the character of the conduction band, into which electrons are initially excited, to be two-dimensional and localized within individual layers, whereas at t…

Condensed Matter - Materials Sciencetr-ARPESCondensed Matter - Mesoscale and Nanoscale PhysicsTDDFT530 PhysicsMesoscale and Nanoscale Physics (cond-mat.mes-hall)Materials Science (cond-mat.mtrl-sci)FOS: Physical sciences10192 Physics Institute2D materialsSettore FIS/03 - Fisica Della Materia3100 General Physics and Astronomy
researchProduct