Das Max-Planck-Institut für evolutionäre Anthropologie in Leipzig ist Mitglied einer Arbeits-gruppe bestehend aus mehreren Max-Planck-Instituten, die auf Basis von VuFind ein gemein-sames Resource Discovery System (RDS) entwickeln. Die vorliegende Arbeit beschäftigt sich mit der Frage, ob es sinnvoll wäre, das RDS in Leipzig lokal durch einen zweiten, externen Index zu ergänzen, um die inhaltlichen Bedürfnisse der Forschenden optimal abzudecken. Dazu werden RDS im Allgemeinen, VuFind im Speziellen, und die Funktionen und Inhalte des geplanten RDS charakterisiert. Nachfolgend ermöglicht eine Nutzungsanalyse auf Grund-lage einer Befragung unter den Forschenden am Institut in Leipzig eine Einschätzung der Kompatibilität zwischen den Vorgehensweisen der Forschenden und dem RDS. Aus den Er-gebnissen der Befragung werden Anforderungen an externe Indices abgeleitet, die durch ei-gene Recherche und Emailanfragen bei ausgewählten Anbietern überprüft werden. Die ab-schließende Diskussion stellt die bis dahin gewonnenen Erkenntnisse einander gegenüber und spricht Empfehlungen bezüglich der Fragestellung aus.:Abkürzungsverzeichnis 5 Abbildungsverzeichnis 6 1 Einleitung 7 2 Resource Discovery Systeme in Bibliotheken 9 2.1 Typen von Resource Discovery Systemen 9 2.2 VuFind 12 3 MPG.Discovery 15 4 Analyse des Nutzungsverhaltens 19 4.1 Methode 19 4.2 Ergebnisse 19 4.3 Fehlerbetrachtung 34 5 Kommerzielle Indices 36 5.1 Anforderungen an einen externen Index 36 5.2 WorldCat Discovery (OCLC) 37 5.3 EBSCO Discovery Service 38 5.4 Central Discovery Index (Ex Libris) 38 5.5 finc 39 5.6 K10plus-Zentral 40 5.7 Zusammenfassung 40 6 Diskussion 43 7 Quellenverzeichnis 46 7.1 Literatur 46 7.2 Emailauskünfte 47 7.3 Webseiten 48 7.4 Videos 50 8 Selbstständigkeitserklärung

Sammanfattning Titel: CSR-prestations påverkan på tillgång till kapital Nivå: Examensarbete på Grundnivå (kandidatexamen) i ämnet företagsekonomi Författare: Erika Sörell och Johanna Svarfvar Handledare: Jan Svanberg Datum: 2020 – juni  Syfte: Företags sociala ansvarstagande (CSR) blir en allt viktigare fråga i samhället och olika intressenter ställer högre krav på företagen. Det finns olika åsikter om CSR-aktiviteter är en onödig kostnad för företag. Att ha tillgång till kapital är dock av stort värde för alla sorters företag och påverkas av huruvida företag upplever kapitalbegränsningar eller inte, vilket kan mätas på olika sätt. Syftet med den här studien är att undersöka om CSR-prestationer kan påverka företags tillgång till kapital, med avseende på kapitalbegränsningar inom EU. Metod: Studien utgår från en positivistisk forskningsfilosofi med en hypotetisk-deduktiv ansats. Studien har en kvantitativ design med sekundärdata inhämtad från databasen Thomson Reuters Eikon. Urvalet består av 272 publika bolag inom EU med data för åren 2010–2019. Data har analyserats genom multipla regressionsanalyser i statistikprogrammet SPSS. Resultat och Slutsats: Resultatet påvisar inga tydliga samband mellan CSR-prestationer och de tre undersökta måtten på kapitalbegränsningar: KZ-index, WW-index och SA-index. Gemensamt för dessa är dock att sambanden är svaga. Det finns därmed inga bevis för att bra CSR-prestation skulle ha en positiv påverkan på företags tillgång till kapital, utan kapitalbegränsningar verkar yttra sig olika i olika företag och är därför svårt att mäta.  Examensarbetets bidrag: Studien bidrar till att utöka forskningen kring CSR-prestation och tillgång till kapital, och signalerar att kapitalbegränsningar är ett komplext mått och att det finns brister i hur kapitalbegränsningar mäts. Studien ger också ett praktiskt bidrag i form av stöd för företag i att engagera sig i CSR eftersom det kan ge positiva effekter för företaget.  Förslag till framtida forskning: Ett förslag till framtida forskning är att utöka studien till att omfatta andra delar av världen men också att undersöka andra mått på CSR-prestation, eller att dela upp ESG-måttet och studera de olika dimensionerna var för sig.  Nyckelord: CSR, ESG, tillgång till kapital, kapitalbegränsningar, KZ-index, WW-index, SA-index / Abstract Title: CSR performance affect on access to capital Level: Student thesis, final assignment for Bachelor Degree in Business Administration  Author: Erika Sörell and Johanna Svarfvar Supervisor: Jan Svanberg Date: 2020 – June  Aim: Corporate social responsibility (CSR) is becoming an increasingly important issue in the society and various stakeholders place higher demands on companies. There are different opinions about whether CSR activities are an unnecessary expense. Having access to capital is of great value to all kinds of companies and is affected of whether or not the company experiences capital constraints, which can be measured in different ways. The aim of this thesis is to investigate if CSR performance can affect companies’ access to capital, with regard to capital constraints within the EU. Method: The study applies a positivistic research philosophy with a hypothetical-deductible approach. The study has a quantitative research design with secondary data retrieved from the database Thomson Reuters Eikon. The sample consists of 272 public companies within the EU with data for the years 2010–2019. Data has been analyzed in the SPSS statistics program. Result och Conclusion: The results show no obvious relationship between CSR performance and the three measures of capital constraints examined: KZ-index, WW-index and SA-index. A shared characteristic is that the relationship is weak. There is thus no evidence that a good CSR performance would have a positive impact on companies’ access to capital. Capital constraints appear different in all companies and are therefore difficult to measure. Contribution of the thesis: The study contributes to expanding the research on CSR performance and access to capital, and signals that capital constraints are a complex measure and that there are shortcomings in how they are measured. The study also makes a practical contribution in form of support for companies in engaging in CSR as it can have positive effects. Suggestion for future research: One suggestion for future research is to extend the study to other parts of the world but also to study other ways of measuring CSR performance, or to split the examined ESG Score and study the different dimensions of CSR separately. Keywords: CSR, ESG, access to capital, capital constraints, KZ-index, WW-index, SA-index

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.

by Ng Siu Kow Stephen, Wong Sai Fuk Victor. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1987. / Bibliography: leaves 41-42.

by Wong Charlmane. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1989. / Bibliography: leaves 59-60.

by Fan Wenning. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references (leaf 41). / Abstract --- p.1 / Acknowledgement --- p.2 / Chapter / Chapter I. --- Introduction --- p.4 / Chapter II. --- HSI Futures and Trading Pattern --- p.8 / Chapter III. --- Spread Trading --- p.24 / Chapter IV. --- Relationship between Change in Price and and Change in Market Indicators --- p.27 / Chapter V. --- Trading Based on Market Indicators --- p.30 / Chapter VI. --- Hedge Effectiveness --- p.39 / Bibliography --- p.41

by Chan Shuen-Yiu & Tse Wai-Chung Steven. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1987. / Bibliography: leaves 91-92.

by Yung Pui Yin Ellen. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1987. / Bibliography: leaf 52.

This thesis is concerned with quasigroups with a small number of associative triples. The minimum number of associative triples among quasigroups of orders up to seven has already been determined. The goal of this thesis is to determine the minimum for orders eight and nine. This thesis reports that the minimum number of associative triples among quasigroups of order eight is sixteen and among quasigroups of order nine is nine. The latter finding is rather significant and we present a construction of an infinite series of quasigroups with the number of associative triples equal to their order. Findings of this thesis have been a result of a computer search which used improved algorithm presented in this thesis. The first part of the thesis is devoted to the theory that shows how to reduce the search space. The second part deals with the development of the algorithm and the last part analyzes the findings and shows a comparison of the new algorithm to the previous work. It shows that new search program is up to four orders of magnitude faster than the one used to determine the minimum number of associative triples among quasigroups of order seven.

All practical text search systems use inverted indexes to quickly resolve user queries. Offline index construction algorithms, where queries are not accepted during construction, have been the subject of much prior research. As a result, current techniques can invert virtually unlimited amounts of text in limited main memory, making efficient use of both time and disk space. However, these algorithms assume that the collection does not change during the use of the index. This thesis examines the task of index maintenance, the problem of adapting an inverted index to reflect changes in the collection it describes. Existing approaches to index maintenance are discussed, including proposed optimisations. We present analysis and empirical evidence suggesting that existing maintenance algorithms either scale poorly to large collections, or significantly degrade query resolution speed. In addition, we propose a new strategy for index maintenance that trades a strictly controlled amount of querying efficiency for greatly increased maintenance speed and scalability. Analysis and empirical results are presented that show that this new algorithm is a useful trade-off between indexing and querying efficiency. In scenarios described in Chapter 7, the use of the new maintenance algorithm reduces the time required to construct an index to under one sixth of the time taken by algorithms that maintain contiguous inverted lists. In addition to work on index maintenance, we present a new technique for accumulator pruning during ranked query evaluation, as well as providing evidence that existing approaches are unsatisfactory for collections of large size. Accumulator pruning is a key problem in both querying efficiency and overall text search system efficiency. Existing approaches either fail to bound the memory footprint required for query evaluation, or suffer loss of retrieval accuracy. In contrast, the new pruning algorithm can be used to limit the memory footprint of ranked query evaluation, and in our experiments gives retrieval accuracy not worse than previous alternatives. The results presented in this thesis are validated with robust experiments, which utilise collections of significant size, containing real data, and tested using appropriate numbers of real queries. The techniques presented in this thesis allow information retrieval applications to efficiently index and search changing collections, a task that has been historically problematic.