Results 1  10
of
2,949
QoSaware middleware for web services composition
 IEEE TRANS. SOFTWARE ENG
, 2004
"... The paradigmatic shift from a Web of manual interactions to a Web of programmatic interactions driven by Web services is creating unprecedented opportunities for the formation of online BusinesstoBusiness (B2B) collaborations. In particular, the creation of valueadded services by composition of ..."
Abstract

Cited by 486 (6 self)
 Add to MetaCart
The paradigmatic shift from a Web of manual interactions to a Web of programmatic interactions driven by Web services is creating unprecedented opportunities for the formation of online BusinesstoBusiness (B2B) collaborations. In particular, the creation of valueadded services by composition
Linear models and empirical bayes methods for assessing differential expression in microarray experiments.
 Stat. Appl. Genet. Mol. Biol.
, 2004
"... Abstract The problem of identifying differentially expressed genes in designed microarray experiments is considered. Lonnstedt and Speed (2002) derived an expression for the posterior odds of differential expression in a replicated twocolor experiment using a simple hierarchical parametric model. ..."
Abstract

Cited by 1321 (24 self)
 Add to MetaCart
Abstract The problem of identifying differentially expressed genes in designed microarray experiments is considered. Lonnstedt and Speed (2002) derived an expression for the posterior odds of differential expression in a replicated twocolor experiment using a simple hierarchical parametric model
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
 PROCEEDINGS OF THE TWENTYFIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distributionfree model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract

Cited by 347 (14 self)
 Add to MetaCart
depth threshold circuits would have dramatic consequences for cryptography and number theory: in particular, such an algorithm could be used to break the RSA cryptosystem, factor Blum integers (composite numbers equivalent to 3 modulo 4), and detect quadratic residues. The results hold even if the learning
Computationally private information retrieval with polylogarithmic communication
 Advances in Cryptology—EUROCRYPT ’99
, 1999
"... We present a singledatabase computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable intractability assumption, which we call the ΦHiding Assumption (ΦHA): essentially the difficulty of deciding whether a ..."
Abstract

Cited by 256 (2 self)
 Add to MetaCart
a small prime> 2 divides ϕ(m), where m is a composite integer of unknown factorization. Our result also implies the existence of tworound CS proof systems under a concrete complexity assumption. Keywords: Integer factorization, Euler’s function, Φhiding assumption, private information retrieval
Cryptographic Applications of thResiduosity Problem with an Odd Integer
"... Abstract Let and n be positive integers. An integer z with gcd(z;n) = 1 is called a thresidue modn if there exists an integer x such that z x (mod n), or a thnonresidue modn if there doesn't exist such anx. Denote by Z n the set of integers relatively prime to n between 0 and n. The problem ..."
Abstract
 Add to MetaCart
of determining whether or not a randomly selected element z 2 Z n is a thresidue modn is called the thResiduosity Problem ( thRP), and appears to be intractable when n is a composite integer whose factorization is unknown. In this paper, we explore some important properties of thRP for the case where
An exponential number of generalized Kerdock codes
 Inform. Control
, 1982
"... If n 1 is an odd composite integer then there are at least 2 tl/2)~f ~ pairwise inequivalent binary errorcorrecting codes of length 2 n, size 22n, and minimum distance 2 n 12(1/2)n 1. 1. ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
If n 1 is an odd composite integer then there are at least 2 tl/2)~f ~ pairwise inequivalent binary errorcorrecting codes of length 2 n, size 22n, and minimum distance 2 n 12(1/2)n 1. 1.
On the Density of Odd Integers . . .
, 1979
"... It is shown that odd integers k such that k * 2 ” $ 1 is prime for some positive integer n have a positive lower density. More generally, for any primes p1,..., pI, the integers k such that k is relatively prime to each of p1,...,pr, and such that k * prlp:a *.*p: ’ + 1 is prime for some n,,..., II ..."
Abstract
 Add to MetaCart
It is shown that odd integers k such that k * 2 ” $ 1 is prime for some positive integer n have a positive lower density. More generally, for any primes p1,..., pI, the integers k such that k is relatively prime to each of p1,...,pr, and such that k * prlp:a *.*p: ’ + 1 is prime for some n
Noninteractive ZeroKnowledge
 SIAM J. COMPUTING
, 1991
"... This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages for which ..."
Abstract

Cited by 214 (18 self)
 Add to MetaCart
for which no efficient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, it is shown that the NPcomplete language of satisfiability also possesses noninteractive zeroknowledge proofs.
Recent approaches to global optimization problems through Particle Swarm Optimization
 Natural Computing
, 2002
"... This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detecting multiple minimizers are described. Moreover, results on the ability of the PSO in tackling Multiobjective, Minimax, In ..."
Abstract

Cited by 211 (34 self)
 Add to MetaCart
, Integer Programming and # 1 errorsinvariables problems, as well as problems in noisy and continuously changing environments, are reported. Finally, a Composite PSO, in which the heuristic parameters of PSO are controlled by a Differential Evolution algorithm during the optimization, is described
Divisibility of Sums of Powers of Odd Integers
"... A number of sequences based on sums of powers of integers is presented. This approach provides a simple derivation of some well known sequences, as well as the construction of many new sequences. The sums of powers of integers have been the subject of much research over the years. This has led to m ..."
Abstract
 Add to MetaCart
A number of sequences based on sums of powers of integers is presented. This approach provides a simple derivation of some well known sequences, as well as the construction of many new sequences. The sums of powers of integers have been the subject of much research over the years. This has led
Results 1  10
of
2,949