The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions

The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a Top-Down interpretation of tree automata. In this paper, we propose new constructions based on the Gluskov's one and on the one of Ilie and Yu one using a Bottom-Up interpretation. One of the main goals of this technique is to consider as a next step the links with deterministic recognizers, consideration that cannot be performed with classical Top-Down approaches. Furthermore, we exhibit a method to factorize transitions of tree automata and show that this technique is particularly interesting for these constructions, by considering natural factorizations due to the structure of regular expression.Comment: extended version of a paper accepted at CIAA 201

Root-Weighted Tree Automata and their Applications to Tree Kernels

In this paper, we define a new kind of weighted tree automata where the weights are only supported by final states. We show that these automata are sequentializable and we study their closures under classical regular and algebraic operations. We then use these automata to compute the subtree kernel of two finite tree languages in an efficient way. Finally, we present some perspectives involving the root-weighted tree automata

PENGARUH GAMBAR PERINGATAN KESEHATAN PADA BUNGKUS ROKOK TERHADAP KEPUTUSAN MEMBELI (STUDI PADA PEROKOK AKTIF DI KECAMATAN KUTA ALAM, BANDA ACEH)

Penelitian ini berjudul Pengaruh Gambar Peringatan Kesehatan pada Bungkus Rokok terhadap Keputusan Membeli (Studi pada Perokok Aktif di Kecamatan Kuta Alam, Banda Aceh). Penelitian ini bertujuan untuk mengetahui bagaimana pengaruh gambar peringatan kesehatan pada bungkus rokok terhadap keputusan membeli perokok aktif di Kecamatan Kuta Alam, Banda Aceh. Penelitian ini menggunakan metode kuantitatif dengan jenis penelitian eksplanatif yang bermaksud untuk mencari hubungan antara dua variabel atau lebih yang akan diteliti. Penelitian ini tidak sekedar menggambarkan bagaimana terjadinya suatu fenomena, tapi juga mencoba menjelaskan mengapa fenomena itu terjadi dan apa pengaruhnya. Teori yang digunakan untuk mendukung penelitian ini adalah teori Stimulus Organism Response yang biasanya disingkat dengan S-O-R. Populasi dalam penelitian ini adalah masyarakat yang berjenis kelamin laki-laki yang berada di Kecamatan Kuta Alam, Banda Aceh dengan jumlah 49.503 jiwa. Sampel penelitian diperoleh dengan menggunakan rumus Slovin yakni menjadi 100 orang. Sementara teknik penarikan sample menggunakan Proportional Stratified Random Sampling dan Purposive Sampling dengan teknik penarikan data menggunakan kuesioner. Hasil penelitian menunjukkan bahwa 93% dari 100 orang yang menjadi responden pada penelitian ini menyatakan mengerti akan maksud gambar yang ada pada bungkus rokok terbaru, 45% dari 100 responden tersebut menyatakan sudah mulai mengurangi mengkonsumsi rokok, dan 52% lainnya masih netral, sedangkan sisanya 3% menyatakan tidak setuju untuk mengurangi mengkonsumsi rokok. Dalam menganalisis data penelitian digunakan tabel tunggal dan tabel silang sedangkan untuk menguji hipotesis dengan menggunakan uji signifikan koefisien korelasi sederhana (uji t), dan hasil pengujian menunjukkan hubungan bahwa hipotesis (Ha) dapat diterima, dan diperoleh r = 0,451. Jika dilihat dari nilai koefisien korelasi dengan menggunakan skala Guilford terdapat hubungan yang cukup berarti antara gambar peringatan kesehatan pada bungkus rokok terhadap keputusan membeli perokok aktif di Kecamatan Kuta Alam.Keyword : Perokok Aktif, Keputusan Membeli, Gambar Peringatan Kesehata

Construction of rational expression from tree automata using a generalization of Arden's Lemma

Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this paper we generalize this important lemma to the rational tree languages. Moreover, we propose also a construction of a rational tree expression which denotes the accepted tree language of a finite tree automaton

Highly Symmetric Multiple Bi-Frames for Curve and Surface Multiresolution Processing

Wavelets and wavelet frames are important and useful mathematical tools in numerous applications, such as signal and image processing, and numerical analysis. Recently, the theory of wavelet frames plays an essential role in signal processing, image processing, sampling theory, and harmonic analysis. However, multiwavelets and multiple frames are more flexible and have more freedom in their construction which can provide more desired properties than the scalar case, such as short compact support, orthogonality, high approximation order, and symmetry. These properties are useful in several applications, such as curve and surface noise-removing as studied in this dissertation. Thus, the study of multiwavelets and multiple frames construction has more advantages for many applications. Recently, the construction of highly symmetric bi-frames for curve and surface multiresolution processing has been investigated. The 6-fold symmetric bi-frames, which lead to highly symmetric analysis and synthesis bi-frame algorithms, have been introduced. Moreover, these multiple bi-frame algorithms play an important role on curve and surface multiresolution processing. This dissertation is an extension of the study of construction of univariate biorthogonal wavelet frames (bi-frames for short) or dual wavelet frames with each framelet being symmetric in the scalar case. We will expand the study of biorthogonal wavelets and bi-frames construction from the scalar case to the vector case to construct biorthogonal multiwavelets and multiple bi-frames in one-dimension. In addition, we will extend the study of highly symmetric bi-frames for triangle surface multiresolution processing from the scalar case to the vector case. More precisely, the objective of this research is to construct highly symmetric biorthogonal multiwavelets and multiple bi-frames in one and two dimensions for curve and surface multiresolution processing. It runs in parallel with the scalar case. We mainly present the methods of constructing biorthogonal multiwavelets and multiple bi-frames in both dimensions by using the idea of lifting scheme. On the whole, we discuss several topics include a brief introduction and discussion of multiwavelets theory, multiresolution analysis, scalar wavelet frames, multiple frames, and the lifting scheme. Then, we present and discuss some results of one-dimensional biorthogonal multiwavelets and multiple bi-frames for curve multiresolution processing with uniform symmetry: type I and type II along with biorthogonality, sum rule orders, vanishing moments, and uniform symmetry for both types. In addition, we present and discuss some results of two-dimensional biorthogonal multiwavelets and multiple bi-frames and the multiresolution algorithms for surface multiresolution processing. Finally, we show experimental results on curve and surface noise-removing by applying our multiple bi-frame algorithms

A Top-Down Approach to Managing Variability in Robotics Algorithms

One of the defining features of the field of robotics is its breadth and heterogeneity. Unfortunately, despite the availability of several robotics middleware services, robotics software still fails to smoothly handle at least two kinds of variability: algorithmic variability and lower-level variability. The consequence is that implementations of algorithms are hard to understand and impacted by changes to lower-level details such as the choice or configuration of sensors or actuators. Moreover, when several algorithms or algorithmic variants are available it is difficult to compare and combine them. In order to alleviate these problems we propose a top-down approach to express and implement robotics algorithms and families of algorithms so that they are both less dependent on lower-level details and easier to understand and combine. This approach goes top-down from the algorithms and shields them from lower-level details by introducing very high level abstractions atop the intermediate abstractions of robotics middleware. This approach is illustrated on 7 variants of the Bug family that were implemented using both laser and infra-red sensors.Comment: 6 pages, 5 figures, Presented at DSLRob 2013 (arXiv:cs/1312.5952