Search results for " Software"
showing 10 items of 1178 documents
Izšķirošās IKT izvēles nākamās digitālās dekādes robežšķirtnē Latvijas skolu izglītības politikas veidošanas sistēmā : promocijas darbs Vadības dokto…
2008
Darbā aplūkotas vairākas izšķirošas izvēles, kuras ir jāveic Latvijas izglītības sistēmai tuvākajos gados sakarā ar pasaules ieiešanu nākamajā digitālajā dekādē, ko pavada ne tikai būtiskas datoru infrastruktūras un lietojumu izmaiņas, bet arī pārmaiņas visā sabiedrībā kopumā, tajā skaitā vadības metodēs, koncepcijās un, līdz ar to arī izglītības sfērā un izglītības vadībā (IV) it īpaši. Darbs veltīts šo pārmaiņu teorētiskajai un praktiskajai bāzei, īpašu uzmanību pievēršot atklātā pirmkoda programmatūras (APP) lietošanas iespējām un aspektiem mācību procesā Latvijas skolās, galveno uzmanību pievēršot operētājsistēmu, biroja programmatūras un interneta risinājumu, tajā skaitā e-mācību, izvē…
Conformation constraints for efficient viscoelastic fluid simulation
2017
The simulation of high viscoelasticity poses important computational challenges. One is the difficulty to robustly measure strain and its derivatives in a medium without permanent structure. Another is the high stiffness of the governing differential equations. Solutions that tackle these challenges exist, but they are computationally slow. We propose a constraint-based model of viscoelasticity that enables efficient simulation of highly viscous and viscoelastic phenomena. Our model reformulates, in a constraint-based fashion, a constitutive model of viscoelasticity for polymeric fluids, which defines simple governing equations for a conformation tensor. The model can represent a diverse pa…
Capturing and Indexing Rehearsals: The Design and Usage of a Digital Archive of Performing Arts
2015
International audience; Preserving the cultural heritage of the performing arts raises difficult and sensitive issues, as each performance is unique by nature and the juxtaposition between the performers and the audience cannot be easily recorded. In this paper, we report on an experimental research project to preserve another aspect of the performing arts—the history of their rehearsals. We have specifically designed non-intrusive video recording and on-site documentation techniques to make this process transparent to the creative crew, and have developed a complete workflow to publish the recorded video data and their corresponding meta-data online as Open Data using state-of-the-art audi…
On the Existence of 1-Bounded Bi-ideals with the WELLDOC Property
2015
A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. The proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-Rauzy words are given in two papers by Balkova et al. The WELLDOC property for bounded bi-ideals is analysed inthis paper. The existence of a 1-bounded bi-ideal over thefinite alphabet that satisfies the WELLDOC property has beenproved by the authors.
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
2007
The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…
Partial Finitely Generated Bi-Ideals
2016
Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. This paper gives a solution for some problems for partial reccurrent words. This paper gives an algorithm for a given finitely generated bi-ideal, how to construct a new basis of ultimately finitely generated bi-ideal, which generates the same given bi-ideal. The paper states that it is always possible to find a basis for a given finitely generated bi-ideal. The main results of this paper are presented in third section. At first, we show that if two irreduciable bi-ideals are different, they will differ in infinitely many places. This led to the st…
About Graph Mappings
2019
Summary In this articles adjacency-preserving mappings from a graph to another are formalized in the Mizar system [7], [2]. The generality of the approach seems to be largely unpreceeded in the literature to the best of the author’s knowledge. However, the most important property defined in the article is that of two graphs being isomorphic, which has been extensively studied. Another graph decorator is introduced as well.
About Graph Unions and Intersections
2020
Summary In this article the union and intersection of a set of graphs are formalized in the Mizar system [5], based on the formalization of graphs in [7].
A Coupled Fixed Point Theorem in Fuzzy Metric Space Satisfying ϕ-Contractive Condition
2013
The intent of this paper is to prove a coupled fixed point theorem for two pairs of compatible and subsequentially continuous (alternately subcompatible and reciprocally continuous) mappings, satisfyingϕ-contractive conditions in a fuzzy metric space. We also furnish some illustrative examples to support our results.
Distributed Learning Automata-based S-learning scheme for classification
2019
This paper proposes a novel classifier based on the theory of Learning Automata (LA), reckoned to as PolyLA. The essence of our scheme is to search for a separator in the feature space by imposing an LA-based random walk in a grid system. To each node in the grid, we attach an LA whose actions are the choices of the edges forming a separator. The walk is self-enclosing, and a new random walk is started whenever the walker returns to the starting node forming a closed classification path yielding a many-edged polygon. In our approach, the different LA attached to the different nodes search for a polygon that best encircles and separates each class. Based on the obtained polygons, we perform …