Results 1  10
of
203,341
Constructing signals with prescribed properties
 IEEE Signal Processing Lett
"... Abstract—This letter introduces a general framework for constructing signals with prescribed properties that can be described as inner products of the signal with a set of vectors, with almost arbitrary construction and constraint spaces. We first derive a procedure for constructing a signal in a gi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract—This letter introduces a general framework for constructing signals with prescribed properties that can be described as inner products of the signal with a set of vectors, with almost arbitrary construction and constraint spaces. We first derive a procedure for constructing a signal in a
Closure Operators With Prescribed Properties
 in Lecture Notes in Mathematics, SpringerVerlag, Berlin
, 1987
"... : The notion of closure operator on a category is explored, utilizing the approach of Dikranjan and Giuli. Conditions on the underlying factorization structure are given, which allow the construction of closure operators satisfying a variety of extra conditions. KEY WORDS: closure operator, factori ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
: The notion of closure operator on a category is explored, utilizing the approach of Dikranjan and Giuli. Conditions on the underlying factorization structure are given, which allow the construction of closure operators satisfying a variety of extra conditions. KEY WORDS: closure operator, factorization structure, separated object, sheaf, closure commuting with pullbacks CLASSIFICATION: 18A32, 18B99, 18D30 0 INTRODUCTION The basic idea for a closure operator on a category X is to have for each object X an extensive, isotone and idempotent operation on the partially ordered class of its subobjects. For these operations to be compatible with the structure of X , one would like the X  morphisms to be "continuous" in some sense with respect to them. If X has pullbacks (to be thought of as inverse images) of monos, this quite literally means that inverse images of closed subobjects are closed. It turns out that this notion of closure operator may be generalized in two ways. Often parti...
A DEGREE CONDITION FOR THE EXISTENCE OF kFACTORS WITH PRESCRIBED PROPERTIES
, 2004
"... Let k be an integer such that k ≥ 3, and let G be a 2connected graph of order n with n ≥ 4k +1,kn even, and minimum degree at least k + 1. We prove that if the maximum degree of each pair of nonadjacent vertices is at least n/2, then G has a kfactor excluding any given edge. The result of Nishimur ..."
Abstract
 Add to MetaCart
Let k be an integer such that k ≥ 3, and let G be a 2connected graph of order n with n ≥ 4k +1,kn even, and minimum degree at least k + 1. We prove that if the maximum degree of each pair of nonadjacent vertices is at least n/2, then G has a kfactor excluding any given edge. The result of Nishimura (1992) is improved. 1. Introduction and
Constructing semisimple padic Galois representations with prescribed properties
, 2003
"... 1 Introduction and sketch of proof of the main theorem The study of padic representations of absolute Galois groups of number fields, i.e., continuous representations ρ: GK → GLn(Qp) with GK the absolute Galois group of a number field and p a prime, is one of the central themes ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
1 Introduction and sketch of proof of the main theorem The study of padic representations of absolute Galois groups of number fields, i.e., continuous representations ρ: GK → GLn(Qp) with GK the absolute Galois group of a number field and p a prime, is one of the central themes
DOI 10.1007/s0015800803001
"... Optimal design of periodic functionally graded composites with prescribed properties ..."
Abstract
 Add to MetaCart
Optimal design of periodic functionally graded composites with prescribed properties
Results 1  10
of
203,341