scholarly journals Application of Divisors on a Hyperelliptic Curve in Python

2021 ◽  
Vol 3 ◽  
pp. 11-24
Author(s):  
Denys Boiko

The paper studies hyperelliptic curves of the genus g > 1, divisors on them and their applications in Python programming language. The basic necessary definitions and known properties of hyperelliptic curves are demonstrated, as well as the notion of polynomial function, its representation in unique form, also the notion of rational function, norm, degree and conjugate to a polynomial are presented. These facts are needed to calculate the order of points of desirable functions, and thus to quickly and efficiently calculate divisors. The definition of a divisor on a hyperelliptic curve is shown, and the main known properties of a divisor are given. There are also an example of calculating a divisor of a polynomial function, reduced and semi-reduced divisors are described, theorem of the existence of such a not unique semi-reduced divisor, and theorem of the existence of a unique reduced divisor, which is equivalent to the initial one, are proved. In particular, a semi-reduced divisor can be represented as an GCD of divisors of two polynomial functions. It is also demonstrated that each reduced divisor can be represented in unique form by pair of polynomials [a(x), b(x)], which is called Mumford representation, and several examples of its representation calculation are given. There are shown Cantor’s algorithms for calculating the sum of two divisors: its compositional part, by means of which a not unique semi-reduced divisor is formed, and the reduction part, which gives us a unique reduced divisor. In particular, special case of the compositional part of Cantor’s algorithm, doubling of the divisor, is described: it significantly reduces algorithm time complexity. Also the correctness of the algorithms are proved, examples of applications are given. The main result of the work is the implementation of the divisor calculation of a polynomial function, its Mumford representation, and Cantor’s algorithm in Python programming language. Thus, the aim of the work is to demonstrate the possibility of e↵ective use of described algorithms for further work with divisors on the hyperelliptic curve, including the development of cryptosystem, digital signature based on hyperelliptic curves, attacks on such cryptosystems.

HERALD ◽  
2017 ◽  
Vol 7 (19) ◽  
Author(s):  
Davorin Bajić

The paper describes the automated calculation of Herfindahl–Hirschman Index of regional specialization. Having used GIS programming and Python programming language, a tool has been designed to enable the automated calculation and visualization of the results of the observed index within ArcGIS software environment. Apart from the definition of basic regional specialization terms and the description of mathematical concept of Herfindahl–Hirschman Index, the paper outlines the programming procedure for designing a tool for the automated calculation by describing the code writing procedure. The results provide an explanation and a practical instance of the tool application in Republic of Srpska.


2020 ◽  
Vol 65 (1) ◽  
pp. 96-104
Author(s):  
Tatian-Cristian Mălin

We introduce in this paper an application developed in the Python programming language that can be used to generate digital signals with known frequencies and amplitudes. These digital signals, since have known parameters, can be used to create benchmarks for test and numerical simulation.


2021 ◽  
Vol 12 (2) ◽  
pp. 52-65
Author(s):  
Eviatar Rosenberg ◽  
Dima Alberg

A significant part of pension savings is in the capital market and exposed to market volatility. The COVID-19 pandemic crisis, like the previous crises, damaged the gains achieved in those funds. This paper presents a development of open-source finance system for stocks backtesting trade strategies. The development will be operated by the Python programming language and will implement application user interface. The system will import historical data of stocks from financial web and will produce charts for analysis of the trends in stocks price. Based on technical analysis, it will run trading strategies which will be defined by the user. The system will output the trade orders that should have been executed in retrospect and concluding charts to present the profit and loss that would occur to evaluate the performance of the strategy.


2021 ◽  
Vol 15 (4) ◽  
pp. 541-545
Author(s):  
Ugur Comlekcioglu ◽  
Nazan Comlekcioglu

Many solutions such as percentage, molar and buffer solutions are used in all experiments conducted in life science laboratories. Although the preparation of the solutions is not difficult, miscalculations that can be made during intensive laboratory work negatively affect the experimental results. In order for the experiments to work correctly, the solutions must be prepared completely correctly. In this project, a software, ATLaS (Assistant Toolkit for Laboratory Solutions), has been developed to eliminate solution errors arising from calculations. Python programming language was used in the development of ATLaS. Tkinter and Pandas libraries were used in the program. ATLaS contains five main modules (1) Percent Solutions, (2) Molar Solutions, (3) Acid-Base Solutions, (4) Buffer Solutions and (5) Unit Converter. Main modules have sub-functions within themselves. With PyInstaller, the software was converted into a stand-alone executable file. The source code of ATLaS is available at https://github.com/cugur1978/ATLaS.


Author(s):  
Jáchym Čepický ◽  
Luís Moreira de Sousa

The OGC® Web Processing Service (WPS) Interface Standard provides rules for standardizing inputs and outputs (requests and responses) for geospatial processing services, such as polygon overlay. The standard also defines how a client can request the execution of a process, and how the output from the process is handled. It defines an interface that facilitates publishing of geospatial processes and client discovery of processes and and binding to those processes into workflows. Data required by a WPS can be delivered across a network or they can be available at a server. <br><br> PyWPS was one of the first implementations of OGC WPS on the server side. It is written in the Python programming language and it tries to connect to all existing tools for geospatial data analysis, available on the Python platform. During the last two years, the PyWPS development team has written a new version (called PyWPS-4) completely from scratch. <br><br> The analysis of large raster datasets poses several technical issues in implementing the WPS standard. The data format has to be defined and validated on the server side and binary data have to be encoded using some numeric representation. Pulling raster data from remote servers introduces security risks, in addition, running several processes in parallel has to be possible, so that system resources are used efficiently while preserving security. Here we discuss these topics and illustrate some of the solutions adopted within the PyWPS implementation.


2018 ◽  
Author(s):  
Erki Aun ◽  
Age Brauer ◽  
Veljo Kisand ◽  
Tanel Tenson ◽  
Maido Remm

AbstractWe have developed an easy-to-use and memory-efficient method called PhenotypeSeeker that (a) generates ak-mer-based statistical model for predicting a given phenotype and (b) predicts the phenotype from the sequencing data of a given bacterial isolate. The method was validated on 167Klebsiella pneumoniaeisolates (virulence), 200Pseudomonas aeruginosaisolates (ciprofloxacin resistance) and 460Clostridium difficileisolates (azithromycin resistance). The phenotype prediction models trained from these datasets performed with 88% accuracy on theK. pneumoniaetest set, 88% on theP. aeruginosatest set and 96.5% on theC. difficiletest set. Prediction accuracy was the same for assembled sequences and raw sequencing data; however, building the model from assembled genomes is significantly faster. On these datasets, the model building on a mid-range Linux server takes approximately 3 to 5 hours per phenotype if assembled genomes are used and 10 hours per phenotype if raw sequencing data are used. The phenotype prediction from assembled genomes takes less than one second per isolate. Thus, PhenotypeSeeker should be well-suited for predicting phenotypes from large sequencing datasets.PhenotypeSeeker is implemented in Python programming language, is open-source software and is available at GitHub (https://github.com/bioinfo-ut/PhenotypeSeeker/).SummaryPredicting phenotypic properties of bacterial isolates from their genomic sequences has numerous potential applications. A good example would be prediction of antimicrobial resistance and virulence phenotypes for use in medical diagnostics. We have developed a method that is able to predict phenotypes of interest from the genomic sequence of the isolate within seconds. The method uses statistical model that can be trained automatically on isolates with known phenotype. The method is implemented in Python programming language and can be run on low-end Linux server and/or on laptop computers.


Sign in / Sign up

Export Citation Format

Share Document