Phase Retrieval Techniques for Radar Ambiguity Problems.
Picture codes
We introduce doubly-ranked (DR) monoids in order to study picture codes. We show that a DR-monoid is free iff it is pictorially stable. This allows us to associate with a set C of pictures a picture code B(C) which is the basis of the least DR-monoid including C. A weak version of the defect theorem for pictures is established. A characterization of picture codes through picture series is also given.
Planning identification experiments for cell signaling pathways: An NFκB case study
Mathematical modeling of cell signaling pathways has become a very important and challenging problem in recent years. The importance comes from possible applications of obtained models. It may help us to understand phenomena appearing in single cells and cell populations on a molecular level. Furthermore, it may help us with the discovery of new drug therapies. Mathematical models of cell signaling pathways take different forms. The most popular way of mathematical modeling is to use a set of nonlinear...
Poids des duaux des codes BCH de distance prescrite et sommes exponentielles
Soit un entier pair. On considère un code BCH binaire de longueur et de distance prescrite avec . Le poids d’un mot non nul du dual de peut s’exprimer en fonction d’une somme exponentielle. Nous montrerons que cette somme n’atteint pas la borne de Weil et nous proposerons une amélioration de celle-ci. En conséquence, nous obtiendrons une amélioration de la borne de Carlitz-Uchiyama sur le poids des mots du dual de .
Poids des duaux des codes BCH de distance prescrite et sommes exponentielles
Poids et équivalence des codes linéaires
Poisson Summation, the Ambiguity Function, and the Theory of Weyl-Heisenberg Frames.
Polyabelian loops and Boolean completeness
We consider the question of which loops are capable of expressing arbitrary Boolean functions through expressions of constants and variables. We call this property Boolean completeness. It is a generalization of functional completeness, and is intimately connected to the computational complexity of various questions about expressions, circuits, and equations defined over the loop. We say that a loop is polyabelian if it is an iterated affine quasidirect product of Abelian groups; polyabelianness...
Polynômes des poids de certains codes et fonctions thêta de certains réseaux
Polynomial matrix solution to the discrete fixed-LAG smoothing problem
Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites
Power spectrum of the periodic group pulse process
Powers and generalized cardinal numbers for HCH-objects --- basic notions.
Prädiktionsentropie der slowakischen Schrift
Predictability problems of global change as seen through natural systems complexity description. II: Approach.
Predictability problems of global change as seen through natural systems complexity description. I: General statements.
Prediction for Two Processes and the Nehari Problem.
Princip maxima entropie
Principal concepts of systems fuzzification. Fuzzification of systems for technical and medical practice. I
Příspěvek k problému validizace