Un nouveau moteur de recherche embarqué conçu pour les objets intelligents. Ces dispositifs sont généralement équipés d'extrêmement de faible quantité de RAM et une grande capacité de stockage Flash NANAD. Pour faire face à ces contraintes matérielles contradictoires, les moteurs de recherche classique privilégient soit la scalabilité en insertion ou la scalabilité en requête, et ne peut pas répondre à ces deux exigences en même temps. En outre, très peu de solutions prennent en charge les suppressions de documents et mises à jour dans ce contexte. nous avons introduit trois principes de conception, à savoir y Write-Once Partitioning, Linear Pipelining and Background Linear Merging, et montrent comment ils peuvent être combinés pour produire un moteur de recherche intégré concilier un niveau élevé d'insertion / de suppression / et des mises à jour. Nous avons mis en place notre moteur de recherche sur une Board de développement ayant un représentant de configuration matérielle pour les objets intelligents et avons mené de vastes expériences en utilisant deux ensembles de données représentatives. Le dispositif expérimental résultats démontrent la scalabilité de l'approche et sa supériorité par rapport à l'état des procédés de l'art. / A new embedded search engine designed for smart objects. Such devices are generally equipped with extremely low RAM and large Flash storage capacity. To tackle these conflicting hardware constraints, conventional search engines privilege either insertion or query scalability but cannot meet both requirements at the same time. Moreover, very few solutions support document deletions and updates in this context. we introduce three design principles, namely Write-Once Partitioning, Linear Pipelining and Background Linear Merging, and show how they can be combined to produce an embedded search engine reconciling high insert/delete/update rate and query scalability. We have implemented our search engine on a development board having a hardware configuration representative for smart objects and have conducted extensive experiments using two representative datasets. The experimental results demonstrate the scalability of the approach and its superiority compared to state of the art methods.

This project focuses on a system that answers questions formulated in natural language. Firstly, the report discusses problems associated with question answering systems and some commonly employed approaches. Emphasis is laid on shallow methods, which do not require many linguistic resources. The second part describes our work on a system that answers factoid questions, utilizing Czech Wikipedia as a source of information. Answer extraction is partly based on specific features of Wikipedia and partly on pre-defined patterns. Results show that for answering simple questions, the system provides significant improvements in comparison with a standard search engine.

Visma Labs AB or Visma wanted to conduct experiments to see if file metadata could be indexed for searching files on a public cloud storage. Given that storing files in a public cloud storage is cheaper than the current storage solution, the implementation could save Visma money otherwise spent on expensive storage costs. The thesis is therefore to find and evaluate an approach chosen for indexing file metadata and searching files on a public cloud storage with the chosen distributed search engine Elasticsearch. The architecture of the proposed solution is similar to a file service and was implemented using several containerized services for it to function. The results show that the file service solution is indeed feasible but would need further tuning and more resources to function according to the demands of Visma. / Visma Labs AB eller Visma ville genomföra experiment för att se om filmetadata skulle kunna indexeras för att söka efter filer på ett publikt moln. Med tanke på att lagring av filer på ett publikt moln är billigare än den nuvarande lagringslösningen, kan implementeringen spara Visma pengar som spenderas på dyra lagringskostnader. Denna studie är därför till för att hitta och utvärdera ett tillvägagångssätt valt för att indexera filmetadata och söka filer på ett offentligt molnlagring med den utvalda distribuerade sökmotorn Elasticsearch. Arkitekturen för den föreslagna lösningen har likenelser av en filtjänst och implementerades med flera containeriserade tjänster för att den ska fungera. Resultaten visar att filservicelösningen verkligen är möjlig men skulle behöva ytterligare modifikationer och fler resurser att fungera enligt Vismas krav.

This thesis studies the characteristics of data hosted on the interplanetary name system, which is a part of the interplanetary file system. From these records, information such as file names, locations, and sizes, was investigated. Data was collected on the number of peers hosting the records, thereby determining the decentralization of the record on the network. Data on how often content on the network changes, were collected and investigated. In addition to evaluating records, a search engine was prototyped to show how to integrate the data into a system. A large part of the network was crawled and the rate of change was found to be high. Most of the peers were found to host HTML files. Most content identifiers found were hosted by more than one peer. This means that a search engine needs to be able to support text file formats and revisit peers regularly to be up-to-date with the records.

Diese Dissertation beschreibt das Design und die Implementierung eines effizienten Suchsystems für linguistische Korpora. Das bestehende und auf einer relationalen Datenbank basierende System ANNIS ist spezialisiert darin, Korpora mit verschiedenen Arten von Annotationen zu unterstützen und nutzt Graphen als einheitliche Repräsentation der verschiedener Annotationen. Für diese Dissertation wurde eine Hauptspeicher-Datenbank, die rein auf Graphen basiert, als Nachfolger für ANNIS entwickelt. Die Korpora werden in Kantenkomponenten partitioniert und für verschiedene Typen von Subgraphen werden unterschiedliche Implementationen zur Darstellung und Suche in diesen Komponenten genutzt. Operationen der Anfragesprache AQL (ANNIS Query Language) werden als Kombination von Erreichbarkeitsanfragen auf diesen verschiedenen Komponenten implementiert und jede Implementierung hat optimierte Funktionen für diese Art von Anfragen. Dieser Ansatz nutzt die verschiedenen Strukturen der unterschiedlichen Annotationsarten aus, ohne die einheitliche Darstellung als Graph zu verlieren. Zusätzliche Optimierungen, wie die parallele Ausführung von Teilen der Anfragen, wurden ebenfalls implementiert und evaluiert. Da AQL eine bestehende Implementierung besitzt und diese für Forscher offen als webbasierter Service zu Verfügung steht, konnten echte AQL-Anfragen aufgenommen werden. Diese dienten als Grundlage für einen Benchmark der neuen Implementierung. Mehr als 4000 Anfragen über 18 Korpora wurden zu einem realistischen Workload zusammengetragen, der sehr unterschiedliche Arten von Korpora und Anfragen mit einem breitem Spektrum von Komplexität enthält. Die neue graphbasierte Implementierung wurde mit der existierenden, die eine relationale Datenbank nutzt, verglichen. Sie führt den Anfragen im Workload im Vergleich ~10 schneller aus und die Experimente zeigen auch, dass die verschiedenen Implementierungen für die Kantenkomponenten daran einen großen Anteil haben. / This dissertation describes the design and implementation of an efficient system for linguistic corpus queries. The existing system ANNIS is based on a relational database and is focused on providing support for corpora with very different kinds of annotations and uses graphs as unified representations of the different annotations. For this dissertation, a main memory and solely graph-based successor of ANNIS has been developed. Corpora are divided into edge components and different implementations for representation and search of these components are used for different types of subgraphs. AQL operations are interpreted as a set of reachability queries on the different components and each component implementation has optimized functions for this type of queries. This approach allows exploiting the different structures of the different kinds of annotations without losing the common representation as a graph. Additional optimizations, like parallel executions of parts of the query, are also implemented and evaluated. Since AQL has an existing implementation and is already provided as a web-based service for researchers, real-life AQL queries have been recorded and thus can be used as a base for benchmarking the new implementation. More than 4000 queries from 18 corpora (from which most are available under an open-access license) have been compiled into a realistic workload that includes very different types of corpora and queries with a wide range of complexity. The new graph-based implementation was compared against the existing one, which uses a relational database. It executes the workload ~10 faster than the baseline and experiments show that the different graph storage implementations had a major effect in this improvement.

This report describes my work with a website for a company that helps other companies book conferences. Creating this website, I have worked from a Mobile First perspective to create an interface. The interface was then tested on potential users. I then used guidelines from Googles own documentation on search engine optimization. The purpose of this work is to create and deliver a website where users can turn to MH Konferens and let them handle booking and planning of their conferences. / Denna rapport beskriver arbetet med en webbplats för ett företag som jobbar med att boka konferenser åt andra företag. Jag har i framtagandet av webbplatsen utgått från Mobile First och skapat ett gränssnitt. Gränssnittet har sedan testats på användare och slutligen har jag utgått från Googles egen dokumentation för att optimera webbplatsen för sökmotorer. Syftet med arbetet är att skapa en webbplats som leder till att användare kan vända sig till MH konferens och låta dem ta hand om bokning och planering av deras konferenser.

「民以食為天」，飲食與我們的生活息息相關。近年來由於食安風暴肆虐，自行烹煮的需求隨之高漲。然而在家自行烹煮時常會面臨不知道該烹煮什麼料理的問題，因此有便利的食譜搜尋系統對烹煮的人而言將是相當方便的。然而使用搜尋系統時，由於我們只知道想用某些特定食材進行烹煮，而不知道哪些食譜含有特定食材，因此在以少數食材進行查詢時不免會得到過多的食譜結果而難以快速找到喜好的食譜。我們建立了一個食譜搜尋的自動完成機制，並依照該機制實做出了食譜搜尋引擎。使用者使用系統進行搜尋時，我們將會依照使用者輸入的食材尋找適合搭配的食材推薦給使用者，幫助使用者在查詢時使用更完整的Query讓搜尋系統可以找到更少更精準的食譜，幫助使用者更快的找到喜歡的食譜。然而只推薦搭配性食材，可能會推薦出與Query中的食材是替代關係的食材，也就是通常不會一起出現的食材，因此我們也進行了替代性食材的研究。給定由兩個食材組成的食材配對，我們研究如何自動的判斷替代性食材。我們將問題轉化成分類問題來解決，並使用One-Class Classification的技術解決分類問題中的Imbalanced Problem。我們使用f1-score觀看One-Class Classification與傳統分類器的比較。經實驗測試，One Class Classification與傳統分類器相比，One Class Classification較能協助我們解決Imbalanced Problem。

Academic fulltext search engine Egothor has recently became starting point of several thesis aimed on searching. Until now, there was no solution available to provide robust set of web content processing tools. This master thesis is aiming on design and implementation of distributed search system working primary with internet sources. We analyze first generation components for processing of web content and summarize their primary features. We use those features to propose architecture of distributed web search engine. We aim mainly to phases of data fetching, processing and indexing. We also describe final implementation of such system and propose few ideas for future extensions.

This thesis deals with the audit of the board game e-commerce web sites. Nowa-days there is a great number of websites of varying quality, so it is necessary to choose between them. The development of the Internet shifted the emphasis from quantity to quality. With this fact comes the topic of auditing web sites. The first part of the thesis concerns with the theoretical bases of audit of web sites in various sections. The second part includes the representation of the mar-ket of board games and its target group. Based on the first theoretical part the evaluation criteria are created, which are used for the audit of seven selected web sides of board games. This audit is evaluated in the next chapter, which then leads into the conclusion of the work in the form of recommendations for changes in order to increase the competitiveness of each evaluated e-commerce.

Cette thèse se situe dans un axe novateur de recherches en ingénierie et en management des systèmes d’information, elle articule à la fois les aspects de quatre domaines de recherche issus de l’Informatique, des Sciences des Systèmes d’information et des Sciences Humaines et des aspects pratiques liées aux entreprises du Web 2.0. Le «Crowdsourcing», comme son nom l’indique, désigne l’approvisionnement par la foule; Les études et les recherches sur cette thèse se font rares mais celles qui existent confirment l’intérêt managérial des plateformes de Crowdsourcing, grâce à leur rôle incontestable dans la création de valeur. Néanmoins, la foule est composée de groupe d’amateurs hétérogènes, c’est pour cela qu’elle représente aussi une source d’incompétence. Dans ce cadre, notre hypothèse opérationnelle pose que l’apprentissage de la foule stimule la création de valeur dans les plateformes Crowdsourcing. Ainsi, notre travail est, principalement organisé autour de la conception et l’élaboration d’un outil pour l’apprentissage de la foule au sein des plateformes de Crowdsourcing. Ce travail est de nature complexe et relève à la fois d’un travail de recherche et d’une pratique d’ingénierie. C’est pour cela que nous optons pour une démarche constructiviste exploratoire de type qualitative moyennant la méthode de recherche ingénierique qui vise à définir et à concevoir une approche d’apprentissage adaptée aux plateformes de Crowdsourcing et à l’implémenter par la suite au sein d’une plateforme Crowdsourcing de test spécialisée dans les Backlinks. Des expérimentations basées sur des entretiens semi-directifs viendront, à la fin de ce travail, confirmer ou infirmer nos hypothèses. / This thesis is situated in an innovative line of research in engineering and management information systems, it articulates both the aspects of four disciplines of research in the Computer Science, Information Systems, Human Sciences and practical aspects related to Web 2.0 companies. The "Crowdsourcing" as its name suggests, refers to the sourcing by the crowd, studies and research on this topic are infrequent but those that exist confirm the managerial interest of Crowdsourcing platforms, thanks to their undeniable role in value creation. Nevertheless, the crowd is composed of heterogeneous group of amateurs that is why it is also a source of incompetence. Our operating hypothesis posits that learning the crowd stimulates the creation of value in the Crowdsourcing platforms. Thus, our work is mainly organized around the design and development of a tool for learning the crowd in Crowdsourcing platforms. This work is complex and involves both a research work and practical engineering. That is why we choose an exploratory qualitative constructivist approach and an ingénierique research method to define and develop a suitable approach of learning adapted to the Crowdsourcing platforms and implement it thereafter within our test Crowdsourcing platform specializes in Backlinking. Experiments based on semi-structured interviews will, confirm or deny our hypotheses.