A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Goal oriented ranking scheme

2010
*
Proceedings of the International Conference and Workshop on Emerging Trends in Technology - ICWET '10
*

But

doi:10.1145/1741906.1742019
dblp:conf/icwet/KhapardeMD10
fatcat:umkz7rhokfh3tawg7q2xmn4rqa
*one**of*criticism*of*EAs is lack*of*efficient and robust generic method to handle*the*constraints. ...*One*way to handle*the*constraint is use*the*penalty method .in this paper we have proposed a method to find*the*objective when*the*decision maker (DM) has to achieve*the*certain goal. ...*The*computational complexity*of**ranking**scheme*is .Note that if no feasible solution is present in*the*population (N=0),*the**ranking*according to*the*constraint and objective ( ), and when*P*=N*the**ranking*...##
###
On the rank of p-schemes

unpublished

A sharp upper and lower bounds

fatcat:rkdn3fwp7bgp7epq5jhpu4kdcq
*on**the**rank**of**schemes*in C*p*n with a certain order*of*thin radical are obtained. ... Finally, it is shown that*the**scheme*with minimum*rank*in C*p*n is unique up to isomorphism, and it is a fusion*of*any association*p*-*schemes*with degree*p*n . ... Acknowledgements*The*authors would like to thank Professor Ilia Ponomarenko for his valuable arguments in Example 6. ...##
###
Superspecial rank of supersingular abelian varieties and Jacobians

2015
*
Journal de Théorie des Nombres de Bordeaux
*

*The*authors thank

*the*organizers

*of*

*the*2013 Journées Arithmétiques,

*the*referee for valuable comments, Ritzenthaler for help with

*the*French abstract, and Oort for sharing

*the*idea for Proposition 4.4 ... and more generally for being a source

*of*inspiration for this work. ... For a BT 1 group

*scheme*G/k,

*the*

*p*-

*rank*

*of*G is f = dim Fp Hom(µ

*p*, G) where µ

*p*is

*the*kernel

*of*Frobenius

*on*G m . Then

*p*f is

*the*cardinality

*of*G(k). ...

##
###
Majority and Positional Voting in a Probabilistic Framework

1979
*
The Review of Economic Studies
*

Oxford University Press and

doi:10.2307/2297058
fatcat:6ygq5mlverhwnbs7tg3hcadn6a
*The*Review*of*Economic Studies, Ltd. are collaborating with JSTOR to digitize, preserve and extend access to*The*Review*of*Economic Studies. ... JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range*of*content in a trusted digital archive. ... A*scheme*f is anonymous iff, given any permutation a*on**the*set*of*individuals, f(x,*P*) = f(x, Pf) for all x E V and every N-tuple*of**rankings**P*. ...##
###
Superspecial rank of supersingular abelian varieties and Jacobians
[article]

2015
*
arXiv
*
pre-print

In this paper,

arXiv:1403.0023v2
fatcat:jj5m6rfbavegrdhasu5khzuj5y
*the*superspecial condition is generalized by defining*the*superspecial*rank**of*an abelian variety, which is an invariant*of*its*p*-torsion. ...*The*main results in this paper are about*the*superspecial*rank**of*supersingular abelian varieties and Jacobians*of*curves. ... For a BT 1 group*scheme*G/k,*the**p*-*rank**of*G is f = dim F*p*Hom(µ*p*, G) where µ*p*is*the*kernel*of*Frobenius*on*G m . Then*p*f is*the*cardinality*of*G(k). ...##
###
PACK/UNPACK on Coarse-Grained Distributed Memory Parallel Machines

1996
*
Journal of Parallel and Distributed Computing
*

Experimental results are presented

doi:10.1006/jpdc.1996.0141
fatcat:riiq7urutjahtixj7yfmmwpd34
*on**the*CM-5. ... We present algorithms for performing these operations*on*coarse-grained parallel machines. ...*rank*d and shape L d 1 ; : : : ; L 0 M Mask array*of**rank*d and shape N d 1 ; : : : ; N 0 V Vector (*rank*-*one*array)*P*n Processor number N Global array size N = N d 1 N 0*P*Number*of*processors (*P*=*P*...##
###
THE p-TORSION OF CURVES WITH LARGE p-RANK

2009
*
International Journal of Number Theory
*

It is an open problem to classify which group

doi:10.1142/s1793042109002560
fatcat:xh2wgifyyfesjpm7o736ajzidy
*schemes*occur as*the**p*-torsion*of**the*Jacobians*of*these curves for f < g − 1. ... Consider*the*locus*of*smooth curves*of*genus g and*p*-*rank*f defined over an algebraically closed field k*of*characteristic*p*. ... Recall that f X = dim F*p*Hom(µ*p*, J X [*p*]) where*the*group*scheme*µ*p*is*the*kernel*of*Frobenius*on*G m . Using [17] ,*one*can compute*the**p*-*rank**of*X for a fixed choice*of*curve X and prime*p*. ...##
###
Recursive constructions for perfect secret sharing schemes

1999
*
Computers and Mathematics with Applications
*

In this paper, we propose some recursive constructions for perfect secret sharing

doi:10.1016/s0898-1221(99)00049-8
fatcat:vfqrsv73o5ghna3twnjfzr6uue
*schemes*with access structures*of*constant*rank*. ...*The*information rate*of*a secret sharing*scheme*is defined to be*the*ratio between*the*size*of*secret and*the*maximum size*of**the*shares. ... We define*p*(re, n) to be*the*lower bound*of**the*information rate*of*secret sharing*schemes*with uniform access structures*of**rank*re*on*n participants. ...##
###
Quot schemes in Grassmannians

2018
*
Indiana University Mathematics Journal
*

Here n is

doi:10.1512/iumj.2018.67.6301
fatcat:shsosilfojfnbkyewjnxiirh3i
*the*constant polynomial and O*p*is*the*free,*rank**p*sheaf*on*projective r-space*P*r over some affine base*scheme*S. ... We describe*the*closed strata that defines*the*Quot*schemes*Quot n O*p*/*P*r /S as closed subschemes in Grassmannians. ...*The*discussions that I had together with Greg ...##
###
Quot schemes in Grassmannians
[article]

2014
*
arXiv
*
pre-print

*The*Quot

*schemes*we consider are those parametrizing finite length n quotient sheaves

*of*

*the*free,

*rank*

*p*sheaf

*on*projective r-space. ... We describe

*the*closed strata that defines certain Quot

*schemes*as closed subschemes in Grassmannians. ...

*The*discussions that I had together with Greg ...

##
###
The p-torsion of curves with large p-rank
[article]

2008
*
arXiv
*
pre-print

It is an open problem to classify which group

arXiv:math/0601596v2
fatcat:vvqsb3fwkvbvhbhcffga4wbwpe
*schemes*occur as*the**p*-torsion*of**the*Jacobians*of*these curves for f < g-1. ... Consider*the*locus*of*smooth curves*of*genus g and*p*-*rank*f defined over an algebraically closed field k*of*characteristic*p*. ... Acknowledgments*The*author was partially supported by NSF grant DMS-07-01303 and would also like to thank J. Achter, D. Glass, F. Oort, and*the*referee. ...##
###
A short guide to p-torsion of abelian varieties in characteristic p
[article]

2006
*
arXiv
*
pre-print

There are many equivalent ways to describe

arXiv:math/0609658v1
fatcat:5ehb4naglzcobfy3zr557lrdjq
*the**p*-torsion*of*a principally polarized abelian variety in characteristic*p*. ... We briefly explain these methods and then illustrate them for abelian varieties A*of*arbitrary dimension g in several important cases, including when A has*p*-*rank*f and a-number 1 and when A has*p*-*rank*... We denote this group*scheme*by L. Example 2.2. Let α*p*be*the*kernel*of*Frobenius*on*G a . As a k-*scheme*, α*p*≃ Spec(k[x]/x*p*). ...##
###
Fissions of Classical Self-Dual Association Schemes

1999
*
Journal of combinatorial theory. Series A
*

We describe fission

doi:10.1006/jcta.1999.2970
fatcat:fxlmiltrivferg5wj53gasae3q
*schemes**of*most known classical self-dual association*schemes*, such as*the*Hamming*scheme*H(n, q) when q is a prime power. ... These fission*schemes*are themselves self-dual, with*the*exception*of*certain quadratic forms*schemes*in even characteristic. ... ACKNOWLEDGMENT Financial support has been provided by a grant from*the*Natural Sciences and Engineering Research Council*of*Canada. ...##
###
An alternative direct proof of Gibbard?s random dictatorship theorem

2003
*
Review of Economic Design
*

Gibbard(1977) showed that when

doi:10.1007/s10058-003-0102-2
fatcat:p5lrmrzrqbesnkvljjosqqjxsa
*the*number*of*alternatives is finite and larger than two, and individual preferences are linear (strict), a strategy-proof decision*scheme*(a probabilistic analogue*of*a ... social choice function or a voting rule) is a convex combination*of*decision*schemes*which are, in his terms, either unilateral or duple. ...*The*value*of**the*probability*of*an alternative does not depend*on*what alternative it is, but depends*on*for whom it is*the*top-*ranked*alternative. ...##
###
Adaptive reduced-rank RLS algorithms based on joint iterative optimization of adaptive filters for space-time interference suppression

2008
*
Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing
*

This paper presents novel adaptive reduced-

doi:10.1109/icassp.2008.4518483
dblp:conf/icassp/LamareN08
fatcat:vwtufnedpbeqjcz6lpzsx2olue
*rank*filtering algorithms based*on*joint iterative optimization*of*adaptive filters. ...*The*novel*scheme*consists*of*a joint iterative optimization*of*a bank*of*fullrank adaptive filters that constitute*the*projection matrix and an adaptive reduced-*rank*filter that operates at*the*output ... PROPOSED REDUCED-*RANK**SCHEME*AND LEAST SQUARES DESIGN In this section we detail*the*principles*of**the*proposed reduced-*rank**scheme*using a projection operator based*on*adaptive filters and present a least ...
« Previous

*Showing results 1 — 15 out of 579,606 results*