1,722,229 research outputs found
Armand Carrel, 1800-1836 : un républicain réaliste
No full textCrochemore Gilles. Armand Carrel, 1800-1836 : un républicain réaliste. In: Études Normandes, 52e année, n°2, 2003. Un tour de Normandie. pp. 36-44
Perbandingan Algoritma Knuth-Morris-Pratt dan Apostolico-Crochemore pada Aplikasi Kamus Bahasa Indonesia-Belanda
No full textThis research discusses about how to perform word searching in foreign language dictionary using two exact string matching algorithms. This research is aimed to know which algorithm is better between Knuth-Morris-Pratt algorithm and Apostolico-Crochemore algorithm in string matching process. String matching is an important part of string searching processes in a document. String matching algorithm that is used in this research are Knuth-Morris-Pratt algorithm and Apostolico-Crochemore algorithm. Knuth-Morris-Pratt algorithm performs the comparisons of the text and the pattern from left to right in the first index. Whereas Apostolico-Crochemore algorithm performs the comparisons of the text and the pattern from left to right in the second index. The result of this research shows that Apostolico-Crochemore algorithm is faster than Knuth-Morris-Pratt algorithm in word searching process. The average running time of Apostolico-Crochemore algorithm is 0.196 seconds, and Knuth-Morris-Pratt algorithm is 0.199 seconds. The Apostolico-Crochemore algorithm has better time complexity than the Knuth-Morris-Pratt Algorithm, the Apostolico-Crochemore Algorithm has a time complexity of θ (n), while the Knuth-Morris-Pratt Algorithm has a time complexity of θ (n2).Penelitian ini membahas tentang bagaimana melakukan pencarian kata pada kamus bahasa asing dengan menggunakan Algoritma pencocokan kata. Penelitian ini bertujuan untuk mengetahui Algoritma yang lebih baik diantara Algoritma Knuth Morris Pratt dan Algoritma Apostolico-Crochemore untuk proses pencocokan kata. Pencocokan kata merupakan bagian penting dari sebuah proses pencarian kata dalam sebuah dokumen. Algoritma pencocokan kata yang digunakan dalam penelitian ini adalah Algoritma Knuth Morris Pratt dan Apostolico-Crochemore. Algoritma Knuth Morris Pratt melakukan perbandingan teks dan pattern dimulai dari kiri ke kanan pada indeks pertama, sedangkan Algoritma Apostolico-Crochemore melakukan perbandingan teks dan pattern dimulai dari kanan ke kiri pada indeks yang kedua, Hasil dari penelitian ini menunjukkan bahwa Algoritma Apostolico-Crochemore lebih cepat dibandingkan Algoritma Knuth-Morris-Pratt untuk proses pencarian kata. Hasil rata-rata running time Algoritma Apostolico-Crochemore adalah 0.196 detik dan Algoritma Knuth-Morris-Pratt adalah 0.199 detik. Algoritma Apostolico-Crochemore memiliki kompleksitas waktu lebih baik dibandingkan Algoritma Knuth-Morris-Pratt, Algoritma Apostolico-Crochemore memiliki kompleksitas waktu sebesar θ (n), sedangkan Algoritma Knuth-Morris-Pratt mempunyai kompleksitas waktu sebesar θ (n2).Skripsi Sarjan
Linear-Time Computation of Shortest Covers of All Rotations of a String
Get PDFWe show that lengths of shortest covers of all rotations of a length-n string over an integer alphabet can be computed in (n) time in the word-RAM model, thus improving an (n log n)-time algorithm from Crochemore et al. (Theor. Comput. Sci., 2021). Similarly as Crochemore et al., we use a relation of covers of rotations of a string S to seeds and squares in S³. The crucial parameter of a string S is the number ξ(S) of primitive covers of all rotations of S. We show first that the time complexity of the algorithm from Crochemore et al. can be slightly improved which results in time complexity Θ(ξ(S)). However, we also show that in the worst case ξ(S) is Ω(|S|log |S|). This is the main difficulty in obtaining a linear time algorithm. We overcome it and obtain yet another application of runs in strings
La tradition républicaine à Rouen sous la monarchie constitutionnelle
No full textCrochemore Gilles. La tradition républicaine à Rouen sous la monarchie constitutionnelle. In: Études Normandes, 54e année, n°4, 2005. Histoire et paysages. pp. 17-28
Armand Carrel, 1800-1836 : un républicain réaliste
No full textCrochemore Gilles. Armand Carrel, 1800-1836 : un républicain réaliste. In: Études Normandes, 52e année, n°2, 2003. Un tour de Normandie. pp. 36-44
On a Lemma of Crochemore and Rytter
No full textInternational audienceCrochemore and Rytter introduced in 1995 a structural lemma on three squares starting at the same position. This influential lemma has been used by many researchers in the field of periodicities in strings. In particular, Fraenkel and Simpson used it in 1998 to obtain a universal upper bound for the maximum number of distinct squares occurring in a string. We present a generalization of Crochemore and Rytter's lemma by exploiting the combinatorics of two squares starting at the same position
On-line construction of a small automaton for a finite set of words
No full textIn this paper we describe a ``light'' algorithm for the on-line construction
of a small automaton recognising a finite set of words.
The algorithm runs in linear time.
We carried out good experimental results on the
suffixes of a text, showing how this automaton is small. For the
suffixes of a text, we propose a modified construction that leads
to an even smaller automaton
The production of canned peach in Pelotas: a strategic analysis of the Crochemore firm
No full textThis study aimed to understand the elements that made possible the Crochemore firm reintegration in the agribusiness market, as well as its strategic positioning. Crochemore firm is located in Colônia Santo Antônio which is part of the 7th District of Pelotas. In this community there were in the past high concentrations of agribusiness firms, which over time had to close their doors. More specifically in the mid-1980s, with the so-called Brazilian crisis of the 1980s, many firms went to bankruptcy. One of them was the Crochemore firm and despite of haven’t been able to continue operating at that time, managed to resume their activities using a different strategic positioning from the other firms. In this case study, we sought information from Crochemore firm managers and their four customer segments: Large Wholesales and Hypermarkets (S1); Supermarkets (S2); Minimarkets and Convenience houses (S3); Restaurants (S4). The study assessed the degree of importance that each of these segments assigned to several competitive criteria, as reviewed in the literature, when buying from canned peach sellers. The theoretical relevance of this study stems from the use of a framework suitable for the regional context and to the competitive environment of the production chain as well as the strategic management of the Crochemore firm. From the practical side, the study relevance is due to the influence on other business that the Crochemore firm can generate in the region and the dynamic development of the productive chain. Beyond of showing the possibility of firm reintegrations in the business, the results presented the most important competitive criteria ranked by the four different customer segments. For the costumer segments the most important criteria were the product quality, reliability and reputation of the seller firm, which were pointed out as decisive for choosing a canned peach seller. On the other hand, the information obtained made possible the identification of "innovativeness" and "culture and tradition" as specific new competitive criteria for Crochemore firm to develop new opportunities or increase the firm strategic position in their markets.Este estudo tem como objetivo principal entender os elementos que possibilitaram a reinserção da agroindústria Crochemore no mercado, bem como seu posicionamento estratégico. A agroindústria Crochemore está localizada na Colônia Santo Antônio que é parte do 7º Distrito de Pelotas. Nesta localidade já houve uma grande concentração de agroindústrias, as quais ao longo do tempo foram encerrando suas atividades. Mais especificamente em meados dos anos de 1980, com a denominada crise dos anos 80, muitas agroindústrias não resistiram e quebraram. Uma destas agroindústrias foi a agroindústria Crochemore, que apesar de não ter conseguido continuar operando nesta época, conseguiu retomar suas atividades utilizando um posicionamento estratégico diferente das demais. Neste estudo de caso, buscaram-se informações, juntamente aos gestores da agroindústria Crochemore e a quatro segmentos de seus clientes: Macro atacados e Hipermercados (S1); Supermercados (S2); Minimercados e casas de conveniências (S3); Restaurantes (S4). Procurou-se avaliar o grau de importância que cada um destes segmentos atribui para diversos critérios competitivos, identificados através de uma revisão bibliográfica, na hora de comprar a conserva de pêssego da agroindústria Crochemore. A relevância teórica deste estudo deriva da utilização de um modelo conceitual (framework) apropriado para a contextualização do ambiente competitivo da cadeia de produção do pêssego da região da gestão estratégica da agroindústria Crochemore. Do ponto de vista prático, a relevância do estudo deve-se a que a agroindústria Crochemore pode gerar influência sobre outras agroindústrias da região e sobre a dinâmica de desenvolvimento da cadeia produtiva. Além de mostrar a possibilidade de reinserção competiva para outras empresas do setor. Os resultados permitiram perceber os critérios competitivos mais importantes e priorizados pelos quatro diferentes segmentos de clientes, como padrão de qualidade e confiabilidade e reputação da empresa Crochemore, os quais foram apontados como decisivos na hora da escolha da compota de pêssego. Da mesma forma, as informações obtidas possibiltaram identificar novos critérios competitivos específicos para a agroindústria Crochemore, como a “inovatividade” e a “cultura e tradição", oportunizando à agroindústria Crochemore potenciais aspectos para manutenção e/ou melhoria da sua posição estratégica nos seus mercados
Longest Motifs with a Functionally Equivalent Central Block
Get PDFInternational audienceThis paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [Crochemore et al., LATIN 2004] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [Crochemore et al., LATIN 2004] and extend to the case of regular expressions with no Kleene closure or complement operation. We show that a single general algorithmic tool that is a non-trivial extension of the ideas introduced in [Crochemore et al., LATIN 2004] can handle all the various kinds of longest block motifs defined in this paper. The algorithm complexity is, in all cases, in O(n log n)
Studi Perbandingan Kinerja Teoretis dan Riil Algoritma Exact String Matchingapostolico-Crochemore dan Optimal Mismatch pada UU MD3
No full textUU MD3 atau yang juga dikenal dengan UU Nomor 2 Tahun 2018 merupakan undang-undang yang mengatur tentang wewenang, tugas, hak dan kewajiban serta kode etik lembaga legislatif negara. Melalui lembaga legislatif inilah masyarakat dapat menyampaikan aspirasi. Untuk mempermudah penggunaanya didalam masyarakat dibuatlah aplikasi pencarian string berbasis desktop dengan studi kasus UU MD3. Pada peneletian ini membandingkan kompleksitas waktu (Ɵ) serta running time untuk fase preprocessing dan pencarian dari algoritma Apostolico-Crochemore dan Optimal Mismatch yang diimplementasikan didalam sistem yang di buat. Algoritma Apostolico-Crochemore memiliki rata-rata waktu pencocokan sebesar 374.8 ms, dan pada Algoritma OptimalMismatch memiliki rata-rata waktu pencocokan sebesar 350.1 ms. Kedua algoritma tersebut memiliki kompleksitas waktu sebesar Ɵ (m) dalam fase preprocessing, dan pada fase pencarian algoritma Apostolico-Crochemore memiliki kompleksitas waktu sebesar Ɵ (n), sedangkan algoritma Optimal Mismatch memiliki kompleksitas waktu sebesar Ɵ (mn).Law of MD3or as known as Law Number 2 in 2018 is the law which regulates the authority, duty, right and obigation as well as code of ethics of state legislative institute.Through this legislative institute, society may deliver their aspirations. In order to facilitate the use in society, string search application desktop base is created using the Law of MD3 as the case study.
This research compares between time complexity (Ɵ) and running time for preprocessing fase and the searcher of algorithm Apostolico-Crochemore and Optimal Mismatch which is implemented on the created system. Algorithm Apostolico-Crochemore has time compatibility average 374.8 ms, and Algorithm Optimal Mismatch has time compatibility average 350.1 ms.
Both algorithms have time complexcity around Ɵ (m) in preprocessing face, and while algorithm Apostolico-Crochemore searcher has time complexcity around Ɵ (n), whereas algorithm Optimal Mismatch has time complexcity around Ɵ (mn).94 HalamanSkripsi Sarjan
- …
