Search results for "script"
showing 10 items of 5143 documents
Creencias sobre el aprendizaje de las ciencias de los estudiantes del máster de profesorado de enseñanza secundaria
2017
En este trabajo se muestran los resultados de un estudio empírico sobre las creencias de futuros docentes de enseñanza secundaria acerca de los procesos de aprendizaje de la ciencia, registradas mediante un cuestionario de escala likert que han cumplimentado 188 estudiantes del Máster de Profesorado de Educación Secundaria, de las especialidades de ciencia y tecnología. En primer lugar se han clasificado las diversas creencias por su relación con diferentes modelos didácticos y se ha realizadoun estudio descriptivo para conocer cuáles son las creencias más extendidas entre tales estudiantes. Posteriormente se ha desarrollado un análisis de las relaciones internas entre tales creencias y hem…
Complex ecological models with simple dynamics: From individuals to populations
1994
The aim of this work is to study complex ecological models exhibiting simple dynamics. We consider large scale systems which can be decomposed into weakly coupled subsystems. Perturbation Theory is used in order to get a reduced set of differential equations governing slow time varying global variables. As examples, we study the influence of the individual behaviour of animals in competition and predator-prey models. The animals are assumed to do many activities all day long such as searching for food of different types. The degree of competition as well as the predation pressure are dependent upon these activities. Preys are more vulnerable when doing some activities during which they are …
ideal: an R/Bioconductor package for interactive differential expression analysis
2020
AbstractBackgroundRNA sequencing (RNA-seq) is an ever increasingly popular tool for transcriptome profiling. A key point to make the best use of the available data is to provide software tools that are easy to use but still provide flexibility and transparency in the adopted methods. Despite the availability of many packages focused on detecting differential expression, a method to streamline this type of bioinformatics analysis in a comprehensive, accessible, and reproducible way is lacking.ResultsWe developed the ideal software package, which serves as a web application for interactive and reproducible RNA-seq analysis, while producing a wealth of visualizations to facilitate data interpr…
The review of internet marketing use in Latvia's companies
2017
Development of new technologies and increasing competition require new solutions in business applications in internet marketing and advertising. The paper deals with issues related to advertising activities in internet marketing. There were presented both theoretical findings and empirical analysis of the survey conducted among Latvia's companies. The survey was carried out with the assistance of telemarketing company (telephone interviews) among companies selected from Register of Enterprises LURSOFT. The analysis of survey results compared companies responses depending on the company size and turnover changes during the last three years. Various statistical indicators were used for this a…
Algorithmic Information Theory and Computational Complexity
2013
We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency computation was introduced by Rose and McNaughton in early sixties and developed by Trakhtenbrot, Kinber, Degtev, Wechsung, Hinrichs and others. A transducer is a finite-state automaton with an input and an output. We consider the possibilities of probabilistic and frequency transducers and prove sever…
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.
Querying the Guarded Fragment with Transitivity
2016
We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration. Surprisingly, we show that query answering under GF2 + TG, i.e., the two-variable fragment of GF + TG, is already undecidable (even without equality), whereas its monadic fragment is decidable; in fact, it is 2exptime-complete in combined complexity and coNP-complete in data complexity. We also show that for a restricted class of queries, query answering under GF+TG is decidable. © 2013 Springer-Verlag.
Dimensions of random affine code tree fractals
2014
We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.
Two-Variable First-Order Logic with Equivalence Closure
2012
We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2-NExpTime, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2-NExpTime-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite sa…
The small-world of 'Le Petit Prince': Revisiting the word frequency distribution
2016
[EN] Many complex systems are naturally described through graph theory, and different kinds of systems described as networks present certain important characteristics in common. One of these features is the so-called scale-free distribution for its node s connectivity, which means that the degree distribution for the network s nodes follows a power law. Scale-free networks are usually referred to as small-world because the average distance between their nodes do not scale linearly with the size of the network, but logarithmically. Here we present a mathematical analysis on linguistics: the word frequency effect for different translations of the Le Petit Prince in different languages. Compar…