La presente investigación de análisis teórico y de literatura tuvo como objetivo evidenciar la necesidad e importancia de realizar diversos estudios que exploren las atribuciones causales planteadas por egresados de Educación inicial respecto a las mallas curriculares con las que fueron formados. Para ello, se revisaron trabajos de investigación y análisis tanto nacionales como internacionales que recogen percepciones y atribuciones causales de estudiantes universitarios y egresados de la carrera de Educación sobre formación inicial docente. Luego de examinar cada uno de ellos, se pudo identificar que varios exestudiantes presentan una insatisfacción en cuanto a su proceso de formación, puesto que no se sentían completamente preparados para poner en práctica sus conocimientos en diferentes contextos, ni para abordar situaciones que se puedan presentar hoy en día en el aula. Frente a esto, resulta importante partir de sus percepciones y aportes para elaborar mejoras en los currículos de formación docente y por ende, elevar el nivel de la calidad educativa peruana. / The purpose of this theoretical analysis and literature research was to demonstrate the need and importance to make different studies that explore the causal attributions that the university students and graduates of Education suggest about their early years’curriculums. For this, we look at national and international investigations that gather the university students and Education graduates’ causal attributions about their formation process. After we examinated each one of them, it is possible to identify that the majority of the exstudents were not satisfied with their formation process, since they did not feel completely prepared to implement their knowledge in different contexts nor to have a good manage of the different adversities that could occur in the classroom nowadays. From this, it is important to start from their perceptions and contributions to elaborate improvements in the teacher’s curriculum and therefore, raise peruvian’s education quality level. / Trabajo de investigación

This work describes models of modern language theory - finite automata, regular grammars and regular expressions. A web application converting among these models is implemented.

This thesis explores Web Information Extraction (WIE) and how it has been used in decision making and to support businesses in their daily operations. The research focuses on a WIE system based on Genetic Programming (GP) with an extensible model to enhance the automatic extractor. This uses a human as a teacher to identify and extract relevant information from the semi-structured HTML webpages. Regular expressions, which have been chosen as the pattern matching tool, are automatically generated based on the training data to provide an improved grammar and lexicon. This particularly benefits the GP system which may need to extend its lexicon in the presence of new tokens in the web pages. These tokens allow the GP method to produce new extraction patterns for new requirements.

<p>The complex behavior of computer systems offers many challenges for <i>formal verification</i>. The analysis quickly becomes difficult as the number of participating processes increases.</p><p>A <i>parameterized system</i> is a family of systems parameterized on a number <i>n</i>, typically representing the number of participating processes. The <i>uniform verification problem</i> — to check whether a property holds for each instance — is an infinite-state problem. The automated analysis of parameterized and infinite-state systems has been the subject of research over the last 15–20 years. Much of the work has focused on safety properties. Progress in verification of liveness properties has been slow, as it is more difficult in general.</p><p>In this thesis, we consider verification of parameterized and infinite-state systems, with an emphasis on liveness, in the verification framework called <i>regular model checking (RMC)</i>. In RMC, states are represented as words, sets of states as regular expressions, and the transition relation as a regular relation.</p><p>We extend the automata-theoretic approach to RMC. We define a <i>specification logic</i> sufficiently strong to specify systems representable using RMC, and linear temporal logic properties of such systems, and provide an automatic translation from a specification into an analyzable model.</p><p>We develop <i>acceleration techniques</i> for RMC which allow more uniform and automatic verification than before, with greater power. Using these techniques, we succeed to verify safety and liveness properties of parameterized protocols from the literature.</p><p>We present a novel <i>reachability based</i> verification method for verification of liveness, in a general setting. We implement the method for RMC, with promising results.</p><p>Finally, we develop a framework for the verification of dynamic networks based on graph transformation, which generalizes the systems representable in RMC. In this framework we verify the latest version of the DYMO routing protocol, currently being considered for standardization by the IETF.</p>

We propose using statistical regular pavings (SRPs) as an efficient and adaptive statistical data structure for processing massive, multi-dimensional data. A regular paving (RP) is an ordered binary tree that recursively bisects a box in $\Rz^{d}$ along the first widest side. An SRP is extended from an RP by allowing mutable caches of recursively computable statistics of the data. In this study we use SRPs for two major applications: estimating histogram densities and summarising large spatio-temporal datasets. The SRP histograms produced are $L_1$-consistent density estimators driven by a randomised priority queue that adaptively grows the SRP tree, and formalised as a Markov chain over the space of SRPs. A way to select an estimate is to run a Markov chain over the space of SRP trees, also initialised by the randomised priority queue, but here the SRP tree either shrinks or grows adaptively through pruning or splitting operations. The stationary distribution of the Markov chain is then the posterior distribution over the space of all possible histograms. We then take advantage of the recursive nature of SRPs to make computationally efficient arithmetic averages, and take the average of the states sampled from the stationary distribution to obtain the posterior mean histogram estimate. We also show that SRPs are capable of summarizing large datasets by working with a dataset containing high frequency aircraft position information. Recursively computable statistics can be stored for variable-sized regions of airspace. The regions themselves can be created automatically to reflect the varying density of aircraft observations, dedicating more computational resources and providing more detailed information in areas with more air traffic. In particular, SRPs are able to very quickly aggregate or separate data with different characteristics so that data describing individual aircraft or collected using different technologies (reflecting different levels of precision) can be stored separately and yet also very quickly combined using standard arithmetic operations.

Pagrindinis šio darbo tikslas susipažinti su steganografijos mokslu bei statistiniais stegoanalizės metodais, kurių dėka slepiama ir atrandama informacija įvairiuose failuose. Šitame magistro darbe išnagrinėti, aprašyti bei įgyvendinti du steganografijos ir du stegoanalizės metodai. Visi metodai realizuoti JAVA programavimo kalba, daliai matematiniams skaičiavimams atlikti panaudota MAPLE programa. Darbo pabaigoje pateikta metodų analizė. / The main goal of the thesis is to review the methods of steganography and steganalysis and to experiment with them. Steganography helps to embed hidden messages in such way that anyone except the intended recipient is unaware of the existence of the message but with the use of statistical steganalysis methods those hidden messages can be detected. This thesis consists of two steganography (LSB and LSBH) and two steganalysis methods (RS and PoV) description and implementation. All methods were implemented with JAVA code. Thesis is concluded with a comparison of these methods' quality.

No description available.

The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking. Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obtain a probabilistic MSO logic by adding an expected second order quantifier. In the scope of this quantifier, membership is determined by a Bernoulli process. This approach turns out to be universal and is applicable for finite and infinite words as well as for finite trees. In order to prove the expressive equivalence of this probabilistic MSO logic to probabilistic automata, we show a Nivat-theorem, which decomposes a recognisable function into a regular language, homomorphisms, and a probability measure. For regular expressions, we build upon existing work to obtain probabilistic regular expressions on finite and infinite words. We show the expressive equivalence between these expressions and probabilistic Muller-automata. To handle Muller-acceptance conditions, we give a new construction from probabilistic regular expressions to Muller-automata. Concerning finite trees, we define probabilistic regular tree expressions using a new iteration operator, called infinity-iteration. Again, we show that these expressions are expressively equivalent to probabilistic tree automata. On a second track of our research we investigate Constraint LTL over multidimensional data words with data values from the infinite tree. Such LTL formulas are evaluated over infinite words, where every position possesses several data values from the infinite tree. Within Constraint LTL on can compare these values from different positions. We show that the model checking problem for this logic is PSPACE-complete via investigating the emptiness problem of Constraint Büchi automata.

This thesis examines the interactions between the continuum function and large cardinals. It is know, by a result of Easton, that the continuum function on regular cardinals has great freedom in ZFC. However, large cardinals lay additional constraints to possible behaviour of the continuum function. We focus on weakly compact and measurable cardinal to point out the differences in interactions with the continuum function between various types of large cardinals. We also study the case of indescribable cardinals for the comparison, and the results lead us to conclude that it is not easy to pinpoint the reason for these differences. 1

Title: The realization problem for von Neumann regular rings Author: Samuel Mokriš Department: Department of Algebra Supervisor of the master thesis: Mgr. Pavel Růžička, Ph.D., Department of Algebra Abstract: With every unital ring R, one can associate the abelian monoid V (R) of isomor- phism classes of finitely generated projective right R-modules. Said monoid is a conical monoid with order-unit. Moreover, for von Neumann regular rings, it satisfies the Riesz refinement property. In the thesis, we deal with the question, under what conditions an abelian conical re- finement monoid with order-unit can be realized as V (R) for some unital von Neumann regular ring or algebra, with emphasis on countable monoids. Two generalizations of the construction of V (R) to the context of nonunital rings are presented and their interrelation is analyzed. To that end, necessary properties of rings with local units and modules over such rings are devel- oped. Further, the construction of Leavitt path algebras over quivers is presented, as well as the construction of a monoid associated with a quiver that is isomorphic to V (R) of the Leavitt path algebra over the same quiver. These methods are then used to realize directed unions of finitely generated free abelian monoids as V (R) of algebras over any given field. A method...