• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 250
  • 191
  • 69
  • 37
  • 28
  • 18
  • 12
  • 10
  • 10
  • 9
  • 9
  • 8
  • 4
  • 3
  • 3
  • Tagged with
  • 700
  • 124
  • 114
  • 101
  • 96
  • 91
  • 88
  • 84
  • 82
  • 77
  • 74
  • 73
  • 72
  • 69
  • 69
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
131

Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies

Lutz, Carsten 30 May 2022 (has links)
Entity Relationship (ER) diagrams are among the most popular formalisms for the support of database design [7, 12, 17, 6]. Their classical use in the (usually computer aided) database design process can roughly be described as follows: after evaluating the requirements of the application, the database designer constructs an ER schema, which represents the conceptual model of the new database. CASE tools can be used to automatically transform the ER schema into a relational database schema, which is then manually fine-tuned. During the last years, the initially rather simple ER formalisms has been extended by various means of expressivity to account for new, more complex application areas such as schema integration for data warehouses [12, 3, 13]. Designing a conceptual model with such enriched ER diagrams is a nontrivial task: there exist complex interactions between the various means of expressivity, which quite often result in unnoticed inconsistencies in the ER schemas and in implicit ramifications of the modeling that have not been intended by the designer. To address this problem, Description Logics (DLs) have been proposed and succesfully used as a tool for reasoning about ER diagrams and thereby detecting the aforementioned anomalies [5, 6, 8].
132

Artificial intelligence application for feature extraction in annual reports : AI-pipeline for feature extraction in Swedish balance sheets from scanned annual reports

Nilsson, Jesper January 2024 (has links)
Hantering av ostrukturerade och fysiska dokument inom vissa områden, såsom finansiell rapportering, medför betydande ineffektivitet i dagsläget. Detta examensarbete fokuserar på utmaningen att extrahera data från ostrukturerade finansiella dokument, specifikt balansräkningar i svenska årsredovisningar, genom att använda en AI-driven pipeline. Syftet är att utveckla en metod för att automatisera datautvinning och möjliggöra förbättrad dataanalys. Projektet fokuserade på att automatisera utvinning av finansiella poster från balansräkningar genom en kombination av Optical Character Recognition (OCR) och en modell för Named Entity Recognition (NER). TesseractOCR användes för att konvertera skannade dokument till digital text, medan en BERT-baserad NER-modell tränades för att identifiera och klassificera relevanta finansiella poster. Ett Python-skript användes för att extrahera de numeriska värdena som är associerade med dessa poster. Projektet fann att NER-modellen uppnådde hög prestanda, med ett F1-score på 0,95, vilket visar dess effektivitet i att identifiera finansiella poster. Den fullständiga pipelinen lyckades extrahera över 99% av posterna från balansräkningar med en träffsäkerhet på cirka 90% för numerisk data. Projektet drar slutsatsen att kombinationen av OCR och NER är en lovande lösning för att automatisera datautvinning från ostrukturerade dokument med liknande attribut som årsredovisningar. Framtida arbeten kan utforska att förbättra träffsäkerheten i OCR och utvidga utvinningen till andra sektioner av olika typer av ostrukturerade dokument. / The persistence of unstructured and physical document management in fields such as financial reporting presents notable inefficiencies. This thesis addresses the challenge of extracting valuable data from unstructured financial documents, specifically balance sheets in Swedish annual reports, using an AI-driven pipeline. The objective is to develop a method to automate data extraction, enabling enhanced data analysis capabilities. The project focused on automating the extraction of financial posts from balance sheets using a combination of Optical Character Recognition (OCR) and a Named Entity Recognition (NER) model. TesseractOCR was used to convert scanned documents into digital text, while a fine-tuned BERT-based NER model was trained to identify and classify relevant financial features. A Python script was employed to extract the numerical values associated with these features. The study found that the NER model achieved high performance metrics, with an F1-score of 0.95, demonstrating its effectiveness in identifying financial entities. The full pipeline successfully extracted over 99% of features from balance sheets with an accuracy of about 90% for numerical data. The project concludes that combining OCR and NER technologies could be a promising solution for automating data extraction from unstructured documents with similar attributes to annual reports. Future work could explore enhancing OCR accuracy and extending the methodology to other sections of different types of unstructured documents.
133

Interference mitigation and interference avoidance for cellular OFDMA-TDD networks

Foutekova, Ellina P. January 2009 (has links)
In recent years, cellular systems based on orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) have gained considerable popularity. Two of the major reasons for this are, on the one hand, that OFDMA enables the receiver to effectively cope with multipath propagation while keeping the complexity low. On the other hand, TDD offers efficient support for cell-specific uplink (UL)/downlink (DL) asymmetry demands by allowing each cell to independently set its UL/DL switching point (SP). However, cell-independent SP gives rise to crossed slots. In particular, crossed slots arise when neighbouring cells use the same slot in opposing link directions, resulting in base station (BS)-to-BS interference and mobile station (MS)-to-MS interference. BS-to-BS interference, in particular, can be quite detrimental due to the exposed location of BSs, which leads to high probability of line-of-sight (LOS) conditions. The aim of this thesis is to address the BS-to-BS interference problem in OFDMA-TDDcellular networks. A simulation-based approach is used to demonstrate the severity of BS-to-BS interference and a signal-to-interference-plus-noise ratio (SINR) equation for OFDMA is formulated to aid system performance analysis. The detrimental effects of crossed slot interference in OFDMA-TDD cellular networks are highlighted by comparing methods specifically targeting the crossed slots interference problem. In particular, the interference avoidance method fixed slot allocation (FSA) is compared against state of the art interference mitigation approaches, viz: random time slot opposing (RTSO) and zone division (ZD). The comparison is done based on Monte Carlo simulations and the main comparison metric is spectral efficiency calculated using the SINR equation formulated in this thesis. The simulation results demonstrate that when LOS conditions among BSs are present, both RTSO and ZD perform worse than FSA for all considered performance metrics. It is concluded from the results that current interference mitigation techniques do not offer an effective solution to the BS-to-BS interference problem. Hence, new interference avoidance methods, which unlike FSA, do not sacrifice the advantages of TDD are open research issues addressed in this thesis. The major contribution of this thesis is a novel cooperative resource balancing technique that offers a solution to the crossed slot problem. The novel concept, termed asymmetry balancing, is targeted towards next-generation cellular systems, envisaged to have ad hoc and multi-hop capabilities. Asymmetry balancing completely avoids crossed slots by keeping the TDD SPs synchronised among BSs. At the same time, the advantages of TDD are retained, which is enabled by introducing cooperation among the entities in the network. If a cell faces resource shortage in one link direction, while having free resources in the opposite link direction, the free resources can be used to support the overloaded link direction. In particular, traffic can be offloaded to near-by mobile stations at neighbouring cells that have available resources. To model the gains attained with asymmetry balancing, a mathematical framework is developed which is verified by Monte Carlo simulations. In addition, asymmetry balancing is compared against both ZD and FSA based on simulations and the results demonstrate the superior performance of asymmetry balancing. It can be concluded that the novel interference avoidance approach is a very promising candidate to.
134

Patterns of use of referring expressions in English and Japanese dialogues

Yoshida, Etsuko January 2008 (has links)
The main aim of the thesis is to investigate how discourse entities are linked with topic chaining and discourse coherence by showing that the choice and the distribution of referring expressions is correlated with the center transition patterns in the centering framework. The thesis provides an integrated interpretation in understanding the behaviour of referring expressions in discourse by considering the relation between referential choice and the local and global coherence of discourse. The thesis has three stages: (1) to provide a semantic and pragmatic perspective in a contrastive study of referring expressions in English and Japanese spontaneous dialogues, (2) to analyse the way anaphoric and deictic expressions can contribute to discourse organisation in structuring and focusing the specific discourse segment, and (3) to investigate the choice and the distribution of referring expressions in the Map Task Corpus and to clarify the way the participants collaborate to judge the most salient entity in the current discourse against their common ground. Significantly, despite the grammatical differences in the form of reference between the two languages, the ways of discourse development in both data sets show distinctive similarities in the process by which the topic entities are introduced, established, and shifted away to the subsequent topic entities. Comparing and contrasting the choice and the distribution of referring expressions of the four different transition patterns of centers, the crucial factors of their correspondent relations between English and Japanese referring expressions are shown in the findings that the topic chains of noun phrases are constructed and are treated like proper names in discourse. This can suggest that full noun phrases play a major role when the topic entity is established in the course of discourse. Since the existing centering model cannot handle the topic chain of noun phrases in the anaphoric relations in terms of the local focus of discourse, centering must be integrated with a model of global focus to account for both pronouns and full noun phrases that can be used for continuations across segment boundaries. Based on Walker’s cache model, I argue that the forms of anaphors are not always shorter, and the focus of attention is maintained by the chain of noun phrases rather than by (zero) pronouns both within a discourse segment and over discourse segment boundaries. These processes are predicted and likely to underlie other uses of language as well. The result can modify the existing perspectives that the focus of attention is normally represented by attenuated forms of reference, and full noun phrases always show focus-shift. In addition, necessary extension to the global coherence of discourse can link these anaphoric relations with the deictic expressions over discourse segment boundaries. Finally, I argue that the choice and the distribution of referring expressions in the Map Task Corpus depends on the way the participants collaborate to judge the most salient entity in the current discourse against their common ground.
135

Logarithmic opinion pools for conditional random fields

Smith, Andrew January 2007 (has links)
Since their recent introduction, conditional random fields (CRFs) have been successfully applied to a multitude of structured labelling tasks in many different domains. Examples include natural language processing (NLP), bioinformatics and computer vision. Within NLP itself we have seen many different application areas, like named entity recognition, shallow parsing, information extraction from research papers and language modelling. Most of this work has demonstrated the need, directly or indirectly, to employ some form of regularisation when applying CRFs in order to overcome the tendency for these models to overfit. To date a popular method for regularising CRFs has been to fit a Gaussian prior distribution over the model parameters. In this thesis we explore other methods of CRF regularisation, investigating their properties and comparing their effectiveness. We apply our ideas to sequence labelling problems in NLP, specifically part-of-speech tagging and named entity recognition. We start with an analysis of conventional approaches to CRF regularisation, and investigate possible extensions to such approaches. In particular, we consider choices of prior distribution other than the Gaussian, including the Laplacian and Hyperbolic; we look at the effect of regularising different features separately, to differing degrees, and explore how we may define an appropriate level of regularisation for each feature; we investigate the effect of allowing the mean of a prior distribution to take on non-zero values; and we look at the impact of relaxing the feature expectation constraints satisfied by a standard CRF, leading to a modified CRF model we call the inequality CRF. Our analysis leads to the general conclusion that although there is some capacity for improvement of conventional regularisation through modification and extension, this is quite limited. Conventional regularisation with a prior is in general hampered by the need to fit a hyperparameter or set of hyperparameters, which can be an expensive process. We then approach the CRF overfitting problem from a different perspective. Specifically, we introduce a form of CRF ensemble called a logarithmic opinion pool (LOP), where CRF distributions are combined under a weighted product. We show how a LOP has theoretical properties which provide a framework for designing new overfitting reduction schemes in terms of diverse models, and demonstrate how such diverse models may be constructed in a number of different ways. Specifically, we show that by constructing CRF models from manually crafted partitions of a feature set and combining them with equal weight under a LOP, we may obtain an ensemble that significantly outperforms a standard CRF trained on the entire feature set, and is competitive in performance to a standard CRF regularised with a Gaussian prior. The great advantage of LOP approach is that, unlike the Gaussian prior method, it does not require us to search a hyperparameter space. Having demonstrated the success of LOPs in the simple case, we then move on to consider more complex uses of the framework. In particular, we investigate whether it is possible to further improve the LOP ensemble by allowing parameters in different models to interact during training in such a way that diversity between the models is encouraged. Lastly, we show how the LOP approach may be used as a remedy for a problem that standard CRFs can sometimes suffer. In certain situations, negative effects may be introduced to a CRF by the inclusion of highly discriminative features. An example of this is provided by gazetteer features, which encode a word's presence in a gazetteer. We show how LOPs may be used to reduce these negative effects, and so provide some insight into how gazetteer features may be more effectively handled in CRFs, and log-linear models in general.
136

Implementation and Certification of ISO/IEC 29110 in an IT Startup in Peru

García Paucar, Luis Hernán, Laporte, Claude Y, Arteaga, Yaylli, Bruggmann, Marco 18 March 2015 (has links)
This article presents the implementation of ISO/IEC 29110 in a four-person IT startup company in Peru. After completing the implementation of the ISO/IEC 29110 project management and software implementation processes using an agile approach, the next step was to execute these processes in a project with an actual customer: software that facilitates communication between clients and legal consultants at the second-largest insurance companies in Peru. Managing the project and developing the software took about 900 hours. Using ISO/ IEC 29110 software engineering practices enabled the startup to plan and execute the project while expending only 18 percent of the total project effort on rework (i.e., wasted effort). In this article, the authors also describe the steps and the effort required by the VSE to be granted an ISO/IEC 29110 certificate of conformity. The startup became the first Peruvian VSE to obtain an ISO/IEC 29110 certification. The ISO/IEC 29110 certification facilitated access to new clients and larger projects.
137

Trestněprávní odpovědnost právnických osob v ochraně životního prostředí / Criminal liability of legal entities in the area of environmental protection

Paráčková, Monika January 2014 (has links)
The purpose of this thesis is to assess the new legislation on criminal liability of legal entities in the area of environmental protection. At the beginning the thesis deals with the core terms of the whole thesis, which means environment and legal entities and it describes tort liability in the area of environmental protection in general. Then focuses in detail on the criminal liability of legal entities, which is relatively new institute for the law of the Czech Republic. It deals with the development of legislation, including the international and EU development and proceedings against legal entities and sanctions, which may be imposed. One of the chapters is devoted to the detailed specification of crimes against the environment, which can be committed by legal entities. The conclusion of the whole thesis is devoted to the use of the new legislation in the area of environmental protection in practice and its comparison with the legislation in the Netherlands.
138

Otevřené a užší zadávací řízení / Open and narrower public tender

Hrdina, Ondřej January 2014 (has links)
Open and narrower public tender The goal of my diploma thesis is to analyze public tenders in their open and narrower forms. In order to achieve my purpose, for my background information I utilize the Act no. 137/2006 Coll., on Public Contracts with the emphasis on the so-called "Large" amendment to the act on Public Contracts (no. 55/2012 Coll), which was passed in order to make public tenders more transparent, reduce or even clear off corruption from the process of public tenders a lastly to increase the effectiveness of spending public money. Literature is also widely used as sources of information for my thesis. Throughout my diploma thesis, I evaluate the contemporary legal state of public tenders, as well as the view of society on the topic. My diploma thesis consists of nine chapters. The first chapter offers insight into public tenders in the light of European Union Law, from which the Act no. 137/2006 Coll., on Public Contracts rises. Chapter two addresses the basic terminology and principals on which the Act stands upon. Having an understanding of these principles is necessary in order to make a deeper evaluation of public tenders. In order to have integrity of the subject, the third chapter outlines all the types of public tenders which are known in the Act no. 137/2006 Coll., on Public...
139

Trestněprávní odpovědnost v ochraně životního prostředí / Criminal liability in environmental protection

Novotná, Barbora January 2015 (has links)
141 Abstract The topic of this thesis is criminal liability within the environmental protection. Introductory chapters are devoted to the definition of basic concepts of the whole matter (environment, environmental protection, criminal liability etc.) and kinds of legal liability in the field of environmental protection. Another chapter deals with international and EU aspects of matter aforesaid. Furthermore, this thesis analyzes the adjustment of criminal liability within the environmental protection in the Czech Republic, at first for natural and consequently for legal persons whose criminal liability has been introduced in the Czech Republic for relatively short period of time. The final chapter is focused on the comparison of Czech and French criminal liability legislation of legal persons in relation to the environment.
140

Ochrana dobré pověsti právnické osoby / Protection of goodwil of legal entility

Kolářová, Eva January 2012 (has links)
The topic of this thesis is " Protection of goodwill of a legal entity". It is an issue which deserves an attention, but seldom can man find any legal literature or essays on this topic, especially in comparison with the sphere of protection of personal rights. As the modern age moves ahead, there are more legal entities and also it is much easier to affect the right to goodwill of a legal entity and the encroachments are becoming more frequent. Due to the tense wording of the Sentence 19b of the Act No. 40/1964 Coll., Civil Code, as amended, it is necessary to follow the practice of the courts to describe this topic. So it is in this thesis, which is primarily based on the judgements of the courts, especially from the decisions of the Supreme Court of the Czech Republic. The other sources, I used in this thesis, are the commentaries and other legal literature. The aim of this thesis is to describe what exactly is goodwill, how a person can interfere into the right to goodwill, in which circumstances the person will not be liable for the unjustified encroachment, and if it is found, that the person is liable for the unjustified encroachment, how can the legal entity defend its rights before the court. The thesis is divided into eight chapters, from which the first and the last ones are introduction...

Page generated in 0.0585 seconds