Search results for " Languages"

showing 10 items of 1859 documents

Arturs Ozols (1912–1964). In Honorem (Res Latvienses, II)

2013

Krājums tapis kā Latvijas Universitātes 48. prof. Artura Ozola dienas starptautiskās zinātniskās konferences „Valodas gramatiskā un leksiskā sistēma, tās funkcionalitāte un normatīvums” (15.–16.03.2012.) materiālu apkopojums.

Zinātniskā darbībaLiterārā valoda - pētniecībaArturs Ozols (1912–1964):HUMANITIES and RELIGION::Languages and linguistics::Other languages::Baltic languages [Research Subject Categories]
researchProduct

Linguistica Lettica, Nr. 1

1997

ZoomorfismiAspektologie - Litauischen AspektLatviešu valodaAdverbiAbreviatūraTerminu veidošanaLatvian sentencesValodas spēleNenoteiktas personas teikumu problēmaSintaktiskās konstrukcijasConservatism of languageValodas lingvostatiskā izpētePriekšvārdiTekstveidePragmatiskie izteicieniVārda leksiskās nozīmes motivācijaVārddarināšanaLietvārds - latgaliešu gramatikaLatīnismi 17.gs. avotosTranslations - Latvian literary polysystemLietuviu kalbaLingvistisko pētījumu datorizācijaLatviešu valodas augu nosaukumiPiena un tā produktu nosaukumi - latgaliskās izloksnes:HUMANITIES and RELIGION::Languages and linguistics::Other languages::Baltic languages [Research Subject Categories]Darbības vārda laika formas
researchProduct

Semantic aware RSS query algebra

2010

International audience; Existing XML query algebras are not fully appropriate to retrieve RSS news items mainly due to three reasons: 1) RSS is text rich and its content is dependent on the wording and verbification of the author, thus semantic aware operators are needed; 2) news items are dynamic and consequently time oriented retrieval is needed; 3) a news item may evolve through time, or overlap with other news items and hence identifying relationships between items is also needed. In this paper, we aim to solve these issues by providing a dedicated RSS algebra based on semantic-aware operators that consider RSS characteristics. The provided operators are application domain specific and …

[ INFO.INFO-IR ] Computer Science [cs]/Information Retrieval [cs.IR][INFO.INFO-WB] Computer Science [cs]/Webcomputer.internet_protocolComputer scienceRSS[ INFO.INFO-WB ] Computer Science [cs]/Web[SCCO.COMP]Cognitive science/Computer science02 engineering and technologyQuery optimizationQuery algebraQuery expansion[SCCO.COMP] Cognitive science/Computer scienceApplication domain020204 information systems0202 electrical engineering electronic engineering information engineering[INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]Equivalence (formal languages)[ INFO.INFO-MM ] Computer Science [cs]/Multimedia [cs.MM][INFO.INFO-MM] Computer Science [cs]/Multimedia [cs.MM]Semantic queryInformation retrieval[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB][INFO.INFO-WB]Computer Science [cs]/Web[INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM]computer.file_format[ INFO.INFO-DB ] Computer Science [cs]/Databases [cs.DB][INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR][ SCCO.COMP ] Cognitive science/Computer science020201 artificial intelligence & image processing[INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR]computerXML
researchProduct

Extending SPARQL with Temporal Logic

2009

The data integration and sharing activities carried on in the framework of the Semantic Web lead to large knowledge bases that must be queried, analyzed, and exploited efficiently. Many of the knowledge representation languages of the Semantic Web, starting with RDF, are based on directed, labeled graphs, which can be also manipulated using graph algorithms and tools coming from other domains. In this paper, we propose an analysis approach of RDF graphs by reusing the verification technology developed for concurrent systems. To this purpose, we define a translation from the SPARQL query language into XTL, a general-purpose graph manipulation language implemented in the CADP verification too…

[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO][INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB][INFO.INFO-WB] Computer Science [cs]/Web[INFO.INFO-WB]Computer Science [cs]/Web[ INFO.INFO-WB ] Computer Science [cs]/WebInformationSystems_DATABASEMANAGEMENTlabeled transition system[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]ACM : H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages/H.2.3.3: Query languagesSPARQL[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulationmodel checkingRDFACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.4: Model checking[ INFO.INFO-DB ] Computer Science [cs]/Databases [cs.DB]temporal logicACM : D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.4: Model checking[INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB][ INFO.INFO-LO ] Computer Science [cs]/Logic in Computer Science [cs.LO]ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages/H.2.3.3: Query languages[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulationverification
researchProduct

Reconnaissance de la Forme 3D et Estimation de la Profondeur Implémentation sur FPGA Spartan 3A d'un SoC pour la Vision 3D (Shape From Focus) Problém…

2007

Le terme de « vision 3D » ou « de numérisation 3D », est apparu à la fin des années 1990, pour désigner des techniques d'acquisition de mesures tridimensionnelle sur des surfaces, techniques ayant la caractéristique de donner des nuages de points denses et importants dont l'ordre de grandeur est de quelques dizaines à plusieurs millions de points. Le nuage de points représente en fait l'information de l'image de profondeur et selon des différents traitements à l'image on peut aboutir à un ordre de précision de la reconstitution de l'objet ou scène en 3D. La vision 3D demeure une méthodologie de base pour réassurer le mécanisme de reconstitution des images tridimensionnelles. Outre les besoi…

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI][INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV][SPI.NANO] Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics[SPI.TRON] Engineering Sciences [physics]/Electronics[INFO.INFO-ES] Computer Science [cs]/Embedded Systems[INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]
researchProduct

Topological properties of cellular automata on trees

2012

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata Theory0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Complexity (cs.CC)Topology01 natural scienceslcsh:QA75.5-76.95[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]0101 mathematicsF.1.1;F.1.2;F.1.3MathematicsCellular Automata and Lattice Gases (nlin.CG)lcsh:Mathematics010102 general mathematicsCellular automaton tree shift expansivity permutivity right-closingness opennesslcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonComputer Science - Computational Complexity010201 computation theory & mathematicsTree (set theory)lcsh:Electronic computers. Computer scienceF.1.2F.1.3ExpansiveNonlinear Sciences - Cellular Automata and Lattice GasesF.1.1Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

XA2C Framework for XML Alteration/Adaptation

2010

XML has crossed the borders of software engineering and has spread to other areas such as e-commerce, identification, information storage, instant messaging and others. It is used to communicate crucial data over these domains. Thus, allowing non-expert programmers to manipulate and control their XML data is essential. In the literature, this issue has been dealt with from 3 perspectives: (i) XML alteration/adaptation techniques requiring a certain level of expertise to be implemented and are not unified yet, (ii) mashups, which are not formally defined yet and are not specific to XML data, and (iii) XML-oriented visual languages based on structural transformations and data extraction mainl…

[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]DatabaseProgramming languagecomputer.internet_protocolComputer science02 engineering and technologycomputer.software_genre[INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]Set (abstract data type)Identification (information)Visual languageData extraction020204 information systems[ INFO.INFO-PL ] Computer Science [cs]/Programming Languages [cs.PL]0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingMashupControl (linguistics)Adaptation (computer science)computerXMLComputingMilieux_MISCELLANEOUS
researchProduct

Towards an XML Adaptation/Alteration Control Framework

2010

International audience

[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL][ INFO.INFO-PL ] Computer Science [cs]/Programming Languages [cs.PL]ComputingMilieux_MISCELLANEOUS[INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]
researchProduct

OntoVersionGraph : a change management methodology dedicated to formal ontologies and their user views in a collaborative context

2014

The world changes over time, impacting the knowledge of every subdomain it contains. Therefore systems describing the knowledge of a certain domain should be able to consider changes occurred to keep its knowledge representation up-to-date. Formal ontologies are one of them: they explicitly and formally represent the knowledge of a domain in all its forms and modes of existence. Collaboratively developed, a formal ontology allows the domain users to understand each other by sharing the same terminology despite the different assumptions they have on the domain conceptualization. However, due to its completeness, the complexity of its conceptualization can sometimes make the domain knowledge …

[INFO.INFO-WB] Computer Science [cs]/WebOntology VersioningFormal OntologyGestion du changement dans les ontologiesDescription LogicOntologie formelleOntology EvolutionLogique de descriptionKnowledge ManagementOntoVersionGraphEvolution d'ontologieOntology Change ManagementGestion du changementVersioning d'ontologieWeb sémantique[INFO.INFO-MO] Computer Science [cs]/Modeling and SimulationSemantic WebOWL[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
researchProduct

Asymptotic bit frequency in Fibonacci words

2021

It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]FOS: Computer and information sciences[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Mathematics::CombinatoricsDiscrete Mathematics (cs.DM)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Combinatorics (math.CO)[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct