A 'Subject Indexing Language' (SIL) is an artificial language used for formulating names of subjects. Although classificationists have sought for universals in many fields of study such as, philosophy, biology, general systems theory, etc., the search for a deep structure of SILs formally began with Ranganathan's idea of 'absolute syntax' and was brought to the present by G. Bhattacharyya and D. Austin. Whereas Bhattacharyya's deep structure of SIL is primarily based on classificatory principles (parallel to 'absolute syntax'), the deep structure proposed by Austin has a linguistic connotation. The present study describes and compares two such deep structurebased SILs, viz., PRECIS (PREserved Context Index System) and DSIS (Deep Structure Indexing System), a recent computerized version of POPSI (POstulate-based Permuted Subject Indexing), developed by F. J. Devadason at Documentation Research and Training Centre, Bangalore, India. Both also belong to the category of SILs typified as 'string indexing' languages. The study involves: i) writing of a suitable DSIS index entry generation program, ii) using both PRECIS (in-house) and DSIS programs to index a collection of representative sample documents from the soft sciences, iii) analyzing and comparing their respective syntactic and semantic aspects in terms of both linguistic and classificatory principles, and iv) applying some measures of efficiency and effectiveness. It was realized that certain modifications in the existing DSIS string manipulation algorithms are necessary to make the program fully operational. Although, no attempts have been made to quantify the measures of effectiveness and efficiency as such, suggestions have been provided as to what these probably would be. Some indications of their searching difficulties for a prospective searcher have been put forward as well.

Die ZBW möchte mit der Implementierung eines automatischen Sacherschließungsverfahrens einerseits dem Umstand einer stetigen Zunahme an Onlinedokumenten Rechnung tragen und andererseits bei der Inhaltserschließung neue Wege beschreiten. Neben der Entlastung der intellektuellen Erschließung durch ein semi- oder vollautomatisches Verfahren soll es darüber hinaus möglich sein, ZBW-fremde digitale Informationsressourcen jeglicher Art mit maschineller Hilfe zu indexieren und in einem gemeinsamen Suchraum auffindbar zu machen. Im derzeitigen Projekt werden hierzu die in der ZBW zur Anwendung kommenden Vokabulare (verbale Sacherschließung mit Standard-Thesaurus Wirtschaft, bzw. klassifikatorische Erschließung mit der Standardklassifikation Wirtschaft) für das maschinelle Verfahren angepasst, trainiert und evaluiert. Die Erfahrungen der ZBW mit der organisatorischen Implementierung automatischer Sacherschließung sowie die Möglichkeiten der Auswertung dieser Verfahren stehen im Mittelpunkt des Vortrages.

Made available in DSpace on 2014-06-11T19:32:42Z (GMT). No. of bitstreams: 0 Previous issue date: 2008-04-25Bitstream added on 2014-06-13T19:43:19Z : No. of bitstreams: 1 rubi_mp_dr_mar.pdf: 790111 bytes, checksum: 6053f265f59d6a694359c64f083ce323 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / A política de indexação deve ser representada por meio de uma filosofia que reflita os objetivos do sistema. Um dos aspectos concernentes à política de indexação diz respeito à conversão retrospectiva de dados e à compatibilidade de linguagem de indexação entre integrantes de um mesmo sistema cooperativo. Com o advento das tecnologias, foi possível pensar em cooperação entre bibliotecas e, conseqüentemente, em catalogação cooperativa. Esse novo panorama da catalogação trouxe um grande avanço para área: agilização da catalogação, diminuindo o tempo de serviço e otimizando esse processo, uma vez que há o aproveitamento de registros bibliográficos copiados de outras bases de dados. No entanto, houve outra conseqüência: o processo de identificação de assunto por meio da análise foi simplificado, reduzindo-o a uma simples operação de cópia , contemplando a forma do documento, e deixando de lado o conteúdo . Essa simplificação da prática nos remete a uma questão teórica e conceitual muito discutida, porém ainda não sedimentada, na área de Biblioteconomia: a conceituação de indexação e catalogação de assunto. A tese dessa pesquisa é considerar que as incoerências cometidas durante a indexação são resultados de desconhecimento da catalogação de forma e de conteúdo pelo bibliotecário, da ausência de política e manual de indexação para bibliotecas que serviriam como orientações ao trabalho do indexador e instrumento para sua formação em serviço, além de uma sistemática para identificação de conceitos. / The indexing policy must be represented by means of a philosophy that reflects the system's aims. One of the aspects concerning the indexing policy is relating to the data retrospective conversion and the compatibility of indexing language among members of a same cooperative system. The appearing of the technologies made it possible to think of cooperation among libraries and, consequentely, of cooperative cataloguing. The new scene of the cataloguing brought a great advance to the field: agility of cataloguing, decreasing the time of service and optimizing this process, since it is possible the utilization of bibliographic records copied from other databases. Nevertheless, there were other consequence: the process of subject's cataloguing (indexing) was simplified reducing it to a simple operation of copy, taking into account the document's form, disregarding the content. This practice simplification refers to a theoretical and high discussed conceptual matter, not yet well sedimented in Librarianship: the concept of indexing and subject cataloguing. The thesis of this research considers that the incoherences made during the indexing are results of non-discerment between descriptive cataloguing and subject cataloguing by the librarian, of the absence of policy and handbook of indexing for libraries which would be useful as guidelines to the indexer's work and instrument to his education in service, besides a systematics to identify concepts. We intend to present a theoretical methodological proposal for the working up of guidelines of indexing policy for the building of cooperative catalogs in university libraries, by means of the indexing process, from the socio-cognitive approach with librarians and users in the context of the university library, and in the conceptual perspective of the theoretical aspects that involve the indexing and the subject cataloguing.

With the advent of digital imagery and its wide spread application in all vistas of life, it has become an important component in the world of communication. Video content ranging from broadcast news, sports, personal videos, surveillance, movies and entertainment and similar domains is increasing exponentially in quantity and it is becoming a challenge to retrieve content of interest from the corpora. This has led to an increased interest amongst the researchers to investigate concepts of video structure analysis, feature extraction, content annotation, tagging, video indexing, querying and retrieval to fulfil the requirements. However, most of the previous work is confined within specific domain and constrained by the quality, processing and storage capabilities. This thesis presents a novel framework agglomerating the established approaches from feature extraction to browsing in one system of content based video retrieval. The proposed framework significantly fills the gap identified while satisfying the imposed constraints of processing, storage, quality and retrieval times. The output entails a framework, methodology and prototype application to allow the user to efficiently and effectively retrieved content of interest such as age, gender and activity by specifying the relevant query. Experiments have shown plausible results with an average precision and recall of 0.91 and 0.92 respectively for face detection using Haar wavelets based approach. Precision of age ranges from 0.82 to 0.91 and recall from 0.78 to 0.84. The recognition of gender gives better precision with males (0.89) compared to females while recall gives a higher value with females (0.92). Activity of the subject has been detected using Hough transform and classified using Hiddell Markov Model. A comprehensive dataset to support similar studies has also been developed as part of the research process. A Graphical User Interface (GUI) providing a friendly and intuitive interface has been integrated into the developed system to facilitate the retrieval process. The comparison results of the intraclass correlation coefficient (ICC) shows that the performance of the system closely resembles with that of the human annotator. The performance has been optimised for time and error rate.

Many applications require storage and indexing of new kinds of data in main-memory, e.g. color histograms, textures, shape features, gene sequences, sensor readings, or financial time series. Even though, many domain index structures were developed, very a few of them are implemented in any database management system (DBMS), usually only B-trees and hash indexes. A major reason is that the manual effort to include a new index implementation in a regular DBMS is very costly and time-consuming because it requires integration with all components of the DBMS kernel. To alleviate this, there are some extensible indexing frameworks. However, they all require re-engineering the index implementations, which is a problem when the index has third-party ownership, when only binary code is available, or simply when the index implementation is complex to re-engineer. Therefore, the DBMS should allow including new index implementations without code changes and performance degradation. Furthermore, for high performance the query processor needs knowledge of how to process queries to utilize plugged-in index. Moreover, it is important that all functionalities of a plugged-in index implementation are correct. The extensible main memory database system (MMDB) Mexima (Main-memory External Index Manager) addresses these challenges. It enables transparent plugging in main-memory index implementations without code changes. Index specific rewrite rules transform complex queries to utilize the indexes. Automatic test procedures validate the correctness of them based on user provided index meta-data. Moreover, the same optimization framework can also optimize complex queries sent to a back-end DBMS by exposing hidden indexes for its query optimizer. Altogether, Mexima is a complete and extensible platform for transparently index integration, utilization, and evaluation.

The world is drowning in data. The recent explosion of web publishing, XML data, bioinformation, scientific data, image data, geographical map data, and even email communications has put a strain on our ability to manage the information contained there. In general, the influx of massive data sets for all kinds of data present a number of difficulties with storage, organization of information, and data accessibility. A primary computing challenge in these cases is how to compress the data but still allow it to be queried quickly.In real-life situations, many instances of data are highly compressible, presenting a major opportunity for space savings. In mobile applications, such savings are critical, since space and the power to access information are at a premium. In a streaming environment, where new data are being generated constantly, compression can aid in prediction as well. In the case of bioinformatics, understanding succinct representations of DNA sequences could lead to a more fundamental understanding of the nature of our own "data stream," perhaps even giving hints on secondary and tertiary structure, gene evolution, and other important topics.In this thesis, we focus our attention on the important problem of <i>compressed text indexing<\i>, where the goal is to compress a text document and allow arbitrary searching for patterns in the best possible time <i>without first decompressing the text<\i>. We develop a number of compressed data structures that either solve this problem directly, or are used as smaller components of an overall text indexing solution. Each component has a number of applications beyond text indexing as well. For each structure, we provide a theoretical study of its space usage and query performance on a suite of operations crucial to access the stored data. In each case, we relate its space usage to the <i>compressed size of the original data</i> and show that the supported operations function in near-optimal or optimal time. We also present a number of experimental results that validate our theoretical findings, showing that our methodology is competitive with the state-of-the-art. / Dissertation

carlos.raymundo@upc.edu.pe / This paper focuses on the important problem of semanticaware search in textual (structured, semi-structured, NoSQL) databases. This problem has emerged as a required extension of the standard containment keyword based query to meet user needs in textual databases and IR applications. We provide here a new approach, called SemIndex, that extends the standard inverted index by constructing a tight coupling inverted index graph that combines two main resources: a general purpose semantic network, and a standard inverted index on a collection of textual data. We also provide an extended query model and related processing algorithms with the help of SemIndex. To investigate its effectiveness, we set up experiments to test the performance of SemIndex. Preliminary results have demonstrated the effectiveness, scalability and optimality of our approach.

Recent advances in multimedia technologies have helped create extensive digital video repositories. Users need to be able to search these large video repositories in order to find videos that have preferred content. In order to meet the needs of users, videos in these repositories need to be indexed. Manual indexing is not an appropriate method due to the time and effort involved. Instead, videos need to be accurately indexed by utilizing computer-based methods. Automatic video indexing techniques use computer technology to analyze low-level video features to identify the content that exists in videos. The type of indexing used in this study is automatic affective video indexing, which is an attempt to index videos by automatically detecting content that elicits an emotional response from individuals. The specific affect-related content of interest in this proposed study is slapstick comedy, a technique that is used in videos with humor. The methodology of this study analyzed the audio stream as well as the motion of targeted objects in videos. The relationship between the changes in the two low-level features was used to identify if slapstick comedy was present in the video and where the instance of slapstick could be found. There were three research questions presented in the study which were associated with the two goals. Research Question 1 determined whether or not the targeted content could be identified using low-level features. Research Question 2 measured the relationship between the experimental results and the ground truth in terms of identifying the location of the targeted content in video. Research Question 3 determined whether one type of low-level feature was more strongly associated with the target content than the other. Goal 1 was to utilize sound and motion to predict the existence of slapstick comedy in videos. Goal 2 was to utilize sound and motion to predict the location of slapstick comedy in videos. The results of the study showed that Goals 1 and 2 were partially met, prompting an investigation into methodology improvements as part of this research. The results also showed that motion was more strongly related to the target content than sound.

Orientador: Mariângela Spotti Lopes Fujita / Banca: Helen de Castro Silva Casarin / Banca: Ana Lúcia Silva Terra / Resumo: A indexação consiste em extrair de um documento termos que representem um determinado assunto com o objetivo de referenciá-lo de forma condensada para uma recuperação temática da informação. Por sua vez, tem-se a política de indexação como meios de apontar diretrizes que possam auxiliar na consistência da indexação, na formulação de manuais, na conduta do profissional. Tem-se como problema, a carência de discussões que abordem a questão da indexação e política de indexação no contexto da deficiência visual, bem como a dificuldade na conduta do profissional bibliotecário diante da carência de investigações teóricas e metodológicas sobre políticas de indexação direcionadas aos sistemas de informação que possuam usuários com deficiência visual. Propõe-se realizar um estudo sociocultural da prática do profissional bibliotecário com enfoque à indexação e política de indexação no contexto da deficiência visual em bibliotecas que se destinem ao atendimento de usuários cegos. Deste modo, objetiva-se contribuir com subsídios para a discussão de uma política de indexação direcionada às bibliotecas acessíveis para deficientes visuais, de modo que se apresentem como um amparo para o bibliotecário indexador no contexto da sua prática profissional, bem como afirmar a garantia cultural e o acesso à informação aos usuários com deficiência visual. A pesquisa foi realizada em bibliotecas destinadas somente aos deficientes visuais ou com um setor disponível para o atendimento desses usuários. A... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: Indexing consists of extracting from a document terms that represent a certain subject in order to refer to it in a condensed way for a thematic retrieval of information. In turn, we have the indexation policy as means of pointing guidelines that can help in the consistency of indexing, in the formulation of manuals, in the conduct of the professional. We have as a problem, the lack of discussions that address the issue of indexation and indexing policy in the context of visual impairment, as well as the difficulty in the conduct of the professional librarian in the face of the lack of theoretical and methodological investigations on systems-oriented indexing policies users with visual impairment. It is proposed to conduct a sociocultural study of the practice of the professional librarian with a focus on indexing and indexing policy in the context of visual impairment in libraries that are intended to serve blind users. In this way, the objective is to contribute with subsidies for the discussion of an indexation policy directed to accessible libraries for the visually impaired, so that they are presented as an amparo for the index librarian in the context of their professional practice, as well as assert the cultural guarantee and access to information for visually impaired users. The research was carried out in libraries designed only for the visually impaired or with an available sector for the care of these users. The participating institutions are located in Brazil and ... (Complete abstract click electronic access below) / Mestre

Les séries temporelles sont présentes dans de nombreux domaines d'application tels que la finance, l'agronomie, la santé, la surveillance de la Terre ou la prévision météorologique, pour n'en nommer que quelques-uns. En raison des progrès de la technologie des capteurs, de telles applications peuvent produire des millions, voir des des milliards, de séries temporelles par jour, ce qui nécessite des techniques rapides d'analyse et de synthèse.Le traitement de ces énormes volumes de données a ouvert de nouveaux défis dans l'analyse des séries temporelles. En particulier, les techniques d'indexation ont montré de faibles performances lors du traitement des grands volumes des données.Dans cette thèse, nous abordons le problème de la recherche de similarité dans des centaines de millions de séries temporelles. Pour cela, nous devons d'abord développer des opérateurs de recherche efficaces, capables d'interroger une très grande base de données distribuée de séries temporelles avec de faibles temps de réponse. L'opérateur de recherche peut être implémenté en utilisant un index avant l'exécution des requêtes.L'objectif des indices est d'améliorer la vitesse des requêtes de similitude. Dans les bases de données, l'index est une structure de données basées sur des critères de recherche comme la localisation efficace de données répondant aux exigences. Les index rendent souvent le temps de réponse de l'opération de recherche sous linéaire dans la taille de la base de données. Les systèmes relationnels ont été principalement supportés par des structures de hachage, B-tree et des structures multidimensionnelles telles que R-tree, avec des vecteurs binaires jouant un rôle de support. De telles structures fonctionnent bien pour les recherches, et de manière adéquate pour les requêtes de similarité. Nous proposons trois solutions différentes pour traiter le problème de l'indexation des séries temporelles dans des grandes bases de données. Nos algorithmes nous permettent d'obtenir d'excellentes performances par rapport aux approches traditionnelles.Nous étudions également le problème de la détection de corrélation parallèle de toutes paires sur des fenêtres glissantes de séries temporelles. Nous concevons et implémentons une stratégie de calcul incrémental des sketchs dans les fenêtres glissantes. Cette approche évite de recalculer les sketchs à partir de zéro. En outre, nous développons une approche de partitionnement qui projette des sketchs vecteurs de séries temporelles dans des sous-vecteurs et construit une structure de grille distribuée. Nous utilisons cette méthode pour détecter les séries temporelles corrélées dans un environnement distribué. / Time series arise in many application domains such as finance, agronomy, health, earth monitoring, weather forecasting, to name a few. Because of advances in sensor technology, such applications may produce millions to trillions of time series per day, requiring fast analytical and summarization techniques.The processing of these massive volumes of data has opened up new challenges in time series data mining. In particular, it is to improve indexing techniques that has shown poor performances when processing large databases.In this thesis, we focus on the problem of parallel similarity search in such massive sets of time series. For this, we first need to develop efficient search operators that can query a very large distributed database of time series with low response times. The search operator can be implemented by using an index constructed before executing the queries. The objective of indices is to improve the speed of data retrieval operations. In databases, the index is a data structure, which based on search criteria, efficiently locates data entries satisfying the requirements. Indexes often make the response time of the lookup operation sublinear in the database size.After reviewing the state of the art, we propose three novel approaches for parallel indexing and queryin large time series datasets. First, we propose DPiSAX, a novel and efficient parallel solution that includes a parallel index construction algorithm that takes advantage of distributed environments to build iSAX-based indices over vast volumes of time series efficiently. Our solution also involves a parallel query processing algorithm that, given a similarity query, exploits the available processors of the distributed system to efficiently answer the query in parallel by using the constructed parallel index.Second, we propose RadiusSketch a random projection-based approach that scales nearly linearly in parallel environments, and provides high quality answers. RadiusSketch includes a parallel index construction algorithm that takes advantage of distributed environments to efficiently build sketch-based indices over very large databases of time series, and then query the databases in parallel.Third, we propose ParCorr, an efficient parallel solution for detecting similar time series across distributed data streams. ParCorr uses the sketch principle for representing the time series. Our solution includes a parallel approach for incremental computation of the sketches in sliding windows and a partitioning approach that projects sketch vectors of time series into subvectors and builds a distributed grid structure.Our solutions have been evaluated using real and synthetics datasets and the results confirm their high efficiency compared to the state of the art.