Python as a programming language for the introductory programming courses

Tämä kandidaatintyö tutkii tietotekniikan perusopetuksessa keskeisen aiheen,ohjelmoinnin, alkeisopetusta ja siihen liittyviä ongelmia. Työssä perehdytään ohjelmoinnin perusopetusmenetelmiin ja opetuksen lähestymistapoihin, sekä ratkaisuihin, joilla opetusta voidaan tehostaa. Näitä ratkaisuja työssä ovat mm. ohjelmointikielen valinta, käytettävän kehitysympäristön löytäminen sekä kurssia tukevien opetusapuvälineiden etsiminen. Lisäksi kurssin läpivientiin liittyvien toimintojen, kuten harjoitusten ja mahdollisten viikkotehtävien valinta kuuluu osaksitätä työtä. Työ itsessään lähestyy aihetta tutkimalla Pythonin soveltuvuutta ohjelmoinnin alkeisopetukseen mm. vertailemalla sitä muihin olemassa oleviin yleisiin opetuskieliin, kuten C, C++ tai Java. Se tarkastelee kielen hyviä ja huonoja puolia, sekä tutkii, voidaanko Pythonia hyödyntää luontevasti pääasiallisena opetuskielenä. Lisäksi työ perehtyy siihen, mitä kaikkea kurssilla tulisi opettaa, sekä siihen, kuinka kurssin läpivienti olisi tehokkainta toteuttaa ja minkälaiset tekniset puitteet kurssin toteuttamista varten olisi järkevää valita.

A mathematical study of fuzzy logic; an algebraic approach

Fuzzy set theory and Fuzzy logic is studied from a mathematical point of view. The main goal is to investigatecommon mathematical structures in various fuzzy logical inference systems and to establish a general mathematical basis for fuzzy logic when considered as multi-valued logic. The study is composed of six distinct publications. The first paper deals with Mattila'sLPC+Ch Calculus. THis fuzzy inference system is an attempt to introduce linguistic objects to mathematical logic without defining these objects mathematically.LPC+Ch Calculus is analyzed from algebraic point of view and it is demonstratedthat suitable factorization of the set of well formed formulae (in fact, Lindenbaum algebra) leads to a structure called ET-algebra and introduced in the beginning of the paper. On its basis, all the theorems presented by Mattila and many others can be proved in a simple way which is demonstrated in the Lemmas 1 and 2and Propositions 1-3. The conclusion critically discusses some other issues of LPC+Ch Calculus, specially that no formal semantics for it is given.In the second paper the characterization of solvability of the relational equation RoX=T, where R, X, T are fuzzy relations, X the unknown one, and o the minimum-induced composition by Sanchez, is extended to compositions induced by more general products in the general value lattice. Moreover, the procedure also applies to systemsof equations. In the third publication common features in various fuzzy logicalsystems are investigated. It turns out that adjoint couples and residuated lattices are very often present, though not always explicitly expressed. Some minor new results are also proved.The fourth study concerns Novak's paper, in which Novak introduced first-order fuzzy logic and proved, among other things, the semantico-syntactical completeness of this logic. He also demonstrated that the algebra of his logic is a generalized residuated lattice. In proving that the examination of Novak's logic can be reduced to the examination of locally finite MV-algebras.In the fifth paper a multi-valued sentential logic with values of truth in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper developes some ideas of Goguen and generalizes the results of Pavelka on the unit interval. Our proof for the completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if, and only if the algebra of the valuesof truth is a complete MV-algebra. The Compactness Theorem holds in our well-defined fuzzy sentential logic, while the Deduction Theorem and the Finiteness Theorem do not. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning. The last paper is a continuation of the fifth study. The semantics and syntax of fuzzy predicate logic with values of truth in ana injective MV-algerba are introduced, and a list of universally valid sentences is established. The system is proved to be semanticallycomplete. This proof is based on an idea utilizing some elementary properties of injective MV-algebras and MV-homomorphisms, and is purely algebraic.

Variabilitat temporal i espacial en l'acumulació del sediment fi al riu Isàbena (Conca del Segre)

En aquest treball s’ha estudiat la variabilitat temporal i espacial en l’acumulació de sediment fi a la llera del riu Isàbena (Conca de l’Ebre) al llarg d’un any (1 de Juny de 2007 al 31 de maig de 2008) així com la seva relació amb l’arribada de sediments a l’embassament de Barasona, amb el mètode directe de camp, en aquest cas el cilindre de resuspensió. Aquesta tècnica s’ha aplicat a quatre seccions ubicades al tram baix de l’Isàbena. Amb les dades obtingudes, s’ha analitzat la dinàmica de les acumulacions a les diferents estacions de l’any, tractant de trobar patrons característics.

The concept of temporal 'plus' epilepsy.

The concept of temporal 'plus' epilepsy (T+E) is not new, and a number of observations made by means of intracerebral electrodes have illustrated the complexity of neuronal circuits that involve the temporal lobe. The term T+E was used to unify and better individualize these specific forms of multilobar epilepsies, which are characterized by electroclinical features primarily suggestive of temporal lobe epilepsy, MRI findings that are either unremarkable or show signs of hippocampal sclerosis, and intracranial recordings which demonstrate that seizures arise from a complex epileptogenic network including a combination of brain regions located within the temporal lobe and over closed neighbouring structures such as the orbitofrontal cortex, the insulo-opercular region, and the temporo-parieto-occipital junction. We will review here how the term of T+E has emerged, what it means, and which practical consideration it raises.

Left temporal lobe epilepsy revealing left posterior cortical atrophy due to Alzheimer's disease.

Seizures can be an early symptom of Alzheimer's disease (AD) and can precede cognitive decline. Early epilepsy in AD can mimic transient epileptic amnesic syndrome (TEAS) or epileptic amnesic syndrome. We report the case of a patient who started a cerebrospinal fluid (CSF)-proven AD with partial seizures and TEAS that secondarily became a cortical posterior atrophy syndrome. CSF biomarkers showed a high amyloid production, amyloidopathy, and high level of total tau and p-Tau. This observation adds data to the complex AD-early epilepsy interactions and illustrates that atypical AD can cause a TEAS. Possible red flags for an underlying neurodegenerative process in TEAS are discussed.

Progresso temporal da ferrugem e fungicidas para controle das doenças foliares do pessegueiro

O objetivo do trabalho foi avaliar o progresso da ferrugem do pessegueiro e a eficiência de fungicidas no controle de da ferrugem e do furo-de-bala em pomares da região metropolitana de Curitiba-PR. Os ensaios foram conduzidos em pomar comercial com o delineamento experimental em blocos ao acaso, Cultivar Chimarrita, com quatro tratamentos (mancozebe, tiofanato metílico, clorotalonil e testemunha, sem pulverização) e quatro repetições, nas safras de 2004/2005 e 2005/2006. Cada fungicida foi pulverizado oito vezes, com intervalo de 15 a 20 dias entre as aplicações. A avaliação do progresso da epidemia de ferrugem e a eficiência dos fungicidas no controle das doenças foram feitas com base na incidência e severidade da doença nas folhas e na porcentagem de desfolha das plantas. A taxa de progresso da doença e o inóculo inicial na testemunha não diferiram significativamente entre os anos. Todos os fungicidas reduziram a desfolha e a severidade da ferrugem, mas o clorotalonil foi melhor e também reduziu a incidência em ambos os anos. Os fungicidas mancozebe e tiofanato metílico reduziram a incidência de furo-de-bala.

Matkapuhelinverkon MAP-protokollatoteutus älyverkkopalveluiden ohjauspisteeseen

Työssä esitellään yleiseurooppalaisen GSM-matkapuhelinjärjestelmän verkkoelementtejä ja perehdytään niiden väliseen standardoituun merkinantoprotokollaan. Lisäksi tarkastellaan protokollan lyhytsanomien välitykseen liittyviä operaatioita ja niissä tapahtunutta kehitystä standardoinnin eri vaiheissa. Tavoitteena oli toteuttaa GSM-matkapuhelinverkon merkinantoprotokollaan perustuva ohjelma, jonka tehtävänä on välittää lyhytsanomia matkapuhelin- ja lyhytsanomakeskuksen välillä. Matkapuhelimeen päättyvän lyhytsanoman välitykseen liittyy lisäksi reititystiedon hakeminen vastaanottajan kotirekisteristä. Toteutuksessa on ohjelmointirajapinta, joka helpottaa matkapuhelinverkon uusien palvelusovellusten kehittämistä. Toteutus testattiin standardoituja testitapauksia soveltaen. Yhdenmukaisuustestauksessa käytettiin apuna merkinantoanalysaattoria. Testauksessa tarkastettiin, että protokolla toimii loogisesti oikein. Suorituskykyä ei ole voitu testata todellisessa testiympäristössä, mutta ohjelmallisesti toteutettujen simulaattoreiden avulla on saatu hyviä tuloksia.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.

Simulation Supported Robot Programming using XML

The main objective of this master's thesis is to study robot programming using simulation software, and also how to embed the simulation software into company's own robot controlling software. The further goal is to study a new communication interface to the assembly line's components -more precisely how to connect the robot cell into this new communication system. Conveyor lines are already available where the conveyors use the new communication standard. The robot cell is not yet capable of communicating with to other devices using the new communication protocols. The main problem among robot manufacturers is that they all have their own communication systems and programming languages. There has not been any common programming language to program all the different robot manufacturers robots, until the RRS (Realistic Robot Simulation) standards were developed. The RRS - II makes it possible to create the robot programs in the simulation software and it gives a common user interface for different robot manufacturers robots. This thesis will present the RRS - II standard and the robot manufacturers situation for the RRS - II support. Thesis presents how the simulation software can be embedded into company's own robot controlling software and also how the robot cell can be connected to the CAMX (Computer Aided Manufacturing using XML) communication system.