Concept

Jones polynomial

Related publications (15)

Design and Implementation of a Neural Network Based Predistorter for Enhanced Mobile Broadband

Alexios Konstantinos Balatsoukas Stimming

Digital predistortion is the process of using digital signal processing to correct nonlinearities caused by the analog RF front-end of a wireless transmitter. These nonlinearities contribute to adjacent channel leakage, degrade the error vector magnitude o ...

IEEE2019

This paper proposes a Voltage Stability Index (VSI) suitable for unbalanced polyphase power systems. To this end, the grid is represented by a polyphase multiport network model (i.e., hybrid parameters), and the aggregate behavior of the devices in each no ...

2019

Advanced Machine Learning Techniques for Self-Interference Cancellation in Full-Duplex Radios

Andreas Peter Burg, Andreas Toftegaard Kristensen

In-band full-duplex systems allow for more efficient use of temporal and spectral resources by transmitting and receiving information at the same time and on the same frequency. However, this creates a strong self-interference signal at the receiver, makin ...

IEEE2019

This thesis presents new flexible dynamic stochastic models for the evolution of market prices and new methods for the valuation of derivatives. These models and methods build on the recently characterized class of polynomial jump-diffusion processes for w ...

EPFL2017

Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynom ...

IEEE2016

A Complete Invariant Generation Approach for P-solvable Loops

Laura Ildiko Kovacs

We present an algorithm for generating all polynomial invariants of P-solvable loops with assignments and nested conditionals. We prove termination of our algorithm. The proof relies on showing that the dimensions of the prime ideals from the minimal decom ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

This paper discusses practical implementation of a generic camera model for a wide variety of common cameras equipped with catadioptric, fish-eye, short- or long focal length lenses. A unified approach of deriving approximate model parameters followed by a ...

2009

We present a method for generating polynomial invariants for a subfamily of imperative loops operating on numbers, called the P-solvable loops. The method uses algorithmic combinatorics and algebraic techniques. The approach is shown to be complete for som ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Aligator: A mathematica package for invariant generation

Laura Ildiko Kovacs

We describe the new software package Aligator for automatically inferring polynomial loop invariants, The package combines algorithms from symbolic summation and polynomial algebra with computational logic, and is applicable to the rich class of P-solvable ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

The link between the infinite mapping class group of the disk and the braid group on infinitely many strands

Jan Brunner

φ For all finite n ∈ N, there is a well-known isomorphism between the standard braid group Bn and the mapping class group π0Hn. This isomorphism has been exhaustively studied in literature, and generalized in many ways. For some basic topological reason, t ...

EPFL2008

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.