Search results for "python"
showing 10 items of 160 documents
Patvaļīgi sašķiebtu numura zīmju atpazīšana
2018
Mūsdienu pasaulē neironu tīkli ir iekarojuši lielu interesi pētnieku un inženieru vidū. Ir labi zināms, ka dziļās mašīnmācīšanās modeļi labi spēj pildīt klasifikācijas uzdevumus. Tāpēc rodas jautājums, vai neironu tīkli labi spētu klasificēt Latvijā reģistrēto automašīnu numura zīmes. Ja neironu tīkls to spēj izdarīt, tad rodas sekojoši jautājumi, vai tas to dara labāk kā citi līdzīgi risinājumi un vai tas ir efektīvs risinājums. Maģistra darba mērķis ir pārliecināties, vai neironu tīkli spēj efektīvi un precīzi klasificēt numura zīmes, izmantojot satvaru TensorFlow. Lai sasniegtu darba mērķi, tika paveikti vairāki uzdevumi: izpētītas skaitļošanas resursu izmaksas, izveidots TensorFlow mode…
Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars
2021
We consider the following problem: A researcher identified a small number of molecules with a certain property of interest and now wants to find further molecules sharing this property in a database. This can be described as learning molecular classes from small numbers of positive examples. In this work, we propose a method that is based on learning a graph grammar for the molecular class. We consider the type of graph grammars proposed by Althaus et al. [2], as it can be easily interpreted and allows relatively efficient queries. We identify rules that are frequently encountered in the positive examples and use these to construct a graph grammar. We then classify a molecule as being conta…
Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform
2012
Motivation The Burrows-Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing the BWT of very large string collections has prevented these techniques from being widely applied to the large sets of sequences often encountered as the outcome of DNA sequencing experiments. In previous work, we presented a novel algorithm that allows the BWT of human genome scale data to be computed on very moderate hardware, thus enabling us to investigate the BWT as a tool for the compression of such datasets. Results We first used simulated reads to explore the relationship between the level of compression and the error rate, the leng…
Conditional measures and their applications to fuzzy sets
1991
Abstract Given a ⊥-decomposable measure with respect to a continuous t-conorm, as introduced by the author in an earlier paper (see Section 1), we can construct ⊥-conditional measures as implications. These fulfil a ‘generalized product law’ replacing the product in the classical law by any other strict t-norm ⊥ and turn out to be decomposable with respect to an operation ⊥ V depending on ⊥, ⊥ and the condition set V (Section 2). More general, conditional measures are introduced axiomatically and are shown to be ⊥-conditional measures with respect to some ⊥-decomposable measure (Section 3). ‘Bayesian-like’ models are given which are alternatives to that presented by the author in a recent p…
Finding Invariants of Group Actions on Function Spaces, a General Methodology from Non-Abelian Harmonic Analysis
2008
In this paper, we describe a general method using the abstract non-Abelian Fourier transform to construct “rich” invariants of group actions on functional spaces.
Hybrid electric vehicle powertrain design: Construction of topologies and initial design schemes
2018
This paper introduces the generic representation and construction methods for the architectures of the four-wheel-drive hybrid electric vehicle (HEV) powertrain, which achieve the unified rules to represent and construct all types of HEV powertrains. To map the architecture into numerical variables and add it into optimization, the kinematic matrix of the HEV powertrain is extracted corresponding to the topological structure. Based on the torque distribution requirement of four-wheel-drive HEV, the initial design schemes (architecture and parameters) are created by charge-under-go feasibility inspection.
Pathfinder' personāžu pārvaldīšanas sistēma
2019
Kvalifikācijas darba mērķis ir izveidot programmatūru ‘Pathfinder’ galda spēles personāžu izveidošanai un pārvaldīšanai un tas dokumentāciju. Timekļa vietne atvieglo personāža izveidošanas procesu atbilstoši iesācēja komplekta noteikumiem, kā arī ļauj saglabāt personāža progresu, dod iespēju pierakstīt savus piedzīvojumus. Sistēma sastāv no 5 moduļiem, kuru funkcionalitāte ir aprakstīta šajā dokumentā. Izstrāde notika izmantojot Django ietvaru.
An Approach to the Automatic Comparison of Reference Point-Based Interactive Methods for Multiobjective Optimization
2021
Solving multiobjective optimization problems means finding the best balance among multiple conflicting objectives. This needs preference information from a decision maker who is a domain expert. In interactive methods, the decision maker takes part in an iterative process to learn about the interdependencies and can adjust the preferences. We address the need to compare different interactive multiobjective optimization methods, which is essential when selecting the most suited method for solving a particular problem. We concentrate on a class of interactive methods where a decision maker expresses preference information as reference points, i.e., desirable objective function values. Compari…
PenRed: An extensible and parallel Monte-Carlo framework for radiation transport based on PENELOPE
2021
Monte Carlo methods provide detailed and accurate results for radiation transport simulations. Unfortunately, the high computational cost of these methods limits its usage in real-time applications. Moreover, existing computer codes do not provide a methodology for adapting these kind of simulations to specific problems without advanced knowledge of the corresponding code system, and this restricts their applicability. To help solve these current limitations, we present PenRed, a general-purpose, stand-alone, extensible and modular framework code based on PENELOPE for parallel Monte Carlo simulations of electron-photon transport through matter. It has been implemented in C++ programming lan…
Imaginary time propagation code for large-scale two-dimensional eigenvalue problems in magnetic fields
2013
We present a code for solving the single-particle, time-independent Schr\"odinger equation in two dimensions. Our program utilizes the imaginary time propagation (ITP) algorithm, and it includes the most recent developments in the ITP method: the arbitrary order operator factorization and the exact inclusion of a (possibly very strong) magnetic field. Our program is able to solve thousands of eigenstates of a two-dimensional quantum system in reasonable time with commonly available hardware. The main motivation behind our work is to allow the study of highly excited states and energy spectra of two-dimensional quantum dots and billiard systems with a single versatile code, e.g., in quantum …