Results 1  10
of
281
Proof of the alternating sign matrix conjecture
, 1995
"... The number of n × n matrices whose entries are either −1, 0, or 1, whose row and column sums are all 1, and such that in every row and every column the nonzero entries alternate in sign, is proved to be [1!4!... (3n −2)!]/[n!(n+1)!... (2n −1)!], as conjectured by Mills, Robbins, and Rumsey. ..."
Abstract

Cited by 127 (4 self)
 Add to MetaCart
The number of n × n matrices whose entries are either −1, 0, or 1, whose row and column sums are all 1, and such that in every row and every column the nonzero entries alternate in sign, is proved to be [1!4!... (3n −2)!]/[n!(n+1)!... (2n −1)!], as conjectured by Mills, Robbins, and Rumsey.
The Importance of Being Biased
, 2002
"... The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NPhard to approximate this problem 1.36067, improving on the previously known hardness result for a 6 factor. 1 ..."
Abstract

Cited by 90 (8 self)
 Add to MetaCart
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NPhard to approximate this problem 1.36067, improving on the previously known hardness result for a 6 factor. 1
The Systemic Enterprise Architecture Methodology (SEAM)  Business and IT Alignment for Competitveness
 SEAM). Published at the International Conference on Enterprise Information Systems 2003 (ICEIS 2003
, 2003
"... For companies to be more competitive, they need to align their business and IT resources. Enterprise Architecture is the discipline whose purpose is to align more effectively the strategies of enterprises together with their processes and their resources (business and IT). Enterprise architecture is ..."
Abstract

Cited by 70 (27 self)
 Add to MetaCart
For companies to be more competitive, they need to align their business and IT resources. Enterprise Architecture is the discipline whose purpose is to align more effectively the strategies of enterprises together with their processes and their resources (business and IT). Enterprise architecture is complex because it involves different types of practitioners with different goals and practices during the lifecycle of the required changes. Enterprise Architecture can be seen as an art and is largely based on experience. But Enterprise Architecture does not have strong theoretical foundations. As a consequence, it is difficult to teach, difficult to apply, and does not have true computersupported tool. This lack of tool is unfortunate as such tools would make the discipline much more practical. This paper presents how system sciences, by defining the concept of the systemic paradigm, can provide these theoretical foundations. It then gives a concrete example of the application of these foundations by presenting the SEAM paradigm. With the systemic paradigm, the enterprise architects can improve their understanding of the existing methodologies, and thus find explanations for the practical problems they encounter. With the SEAM paradigm, architects can use a methodology that alleviates most of these practical problems and can be supported by a tool. 1.
Analysis of signalling pathways using continuous time Markov chains
 Transactions on Computational Systems Biology
, 2006
"... Abstract. We describe a quantitative modelling and analysis approach for signal transduction networks. We illustrate the approach with an example, the RKIP inhibited ERK pathway [CSK + 03]. Our models are high level descriptions of continuous time Markov chains: proteins are modelled by synchronous ..."
Abstract

Cited by 57 (14 self)
 Add to MetaCart
Abstract. We describe a quantitative modelling and analysis approach for signal transduction networks. We illustrate the approach with an example, the RKIP inhibited ERK pathway [CSK + 03]. Our models are high level descriptions of continuous time Markov chains: proteins are modelled by synchronous processes and reactions by transitions. Concentrations are modelled by discrete, abstract quantities. The main advantage of our approach is that using a (continuous time) stochastic logic and the PRISM model checker, we can perform quantitative analysis such as what is the probability that if a concentration reaches a certain level, it will remain at that level thereafter? or how does varying a given reaction rate affect that probability? We also perform standard simulations and compare our results with a traditional ordinary differential equation model. An interesting result is that for the example pathway, only a small number of discrete data values is required to render the simulations practically indistinguishable.
PublicKey Cryptographic Primitives Provably as Secure as Subset Sum
"... We propose a semanticallysecure publickey encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum problem. The subset sum assumption required for the security of our scheme is weaker than that of existing subsetsum based encrypt ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
encryption schemes, namely the latticebased schemes of Ajtai and Dwork (STOC ’97), Regev (STOC ’03, STOC ’05), and Peikert (STOC ’09). Additionally, our proof of security is simple and direct. We also present a natural variant of our scheme that is secure against keyleakage attacks, as well as an oblivious
Homomorphic signatures for polynomial functions
, 2010
"... We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm to produce a signature on the mean, standard deviation, and other statistics of the signed data. Prev ..."
Abstract

Cited by 56 (4 self)
 Add to MetaCart
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm to produce a signature on the mean, standard deviation, and other statistics of the signed data. Previous systems for computing on signed data could only handle linear operations. For polynomials of constant degree, the length of a derived signature only depends logarithmically on the size of the data set. Our system uses ideal lattices in a way that is a “signature analogue” of Gentry’s fully homomorphic encryption. Security is based on hard problems on ideal lattices similar to those in Gentry’s system.
The Quality of Growth
, 1999
"... The future is a chance you should take. It is a creation and everyone has his or her own vision. It will look the way we make it look. —Maja Sasek Over 5,000 children and students from Albania, BosniaHerzegovina, Bulgaria, FYR Macedonia, and Romania took part in art and essay contests on their visi ..."
Abstract

Cited by 54 (4 self)
 Add to MetaCart
The future is a chance you should take. It is a creation and everyone has his or her own vision. It will look the way we make it look. —Maja Sasek Over 5,000 children and students from Albania, BosniaHerzegovina, Bulgaria, FYR Macedonia, and Romania took part in art and essay contests on their vision of the future for themselves, their cities, and their countries and regions. A selection of their paintings was displayed in an exhibit entitled “Children Look to the Horizon, ” which was shown at the World
Pest Externalities from Agricultural Inputs
 American Journal of Agricultural Economics
, 1989
"... Agricultural inputs such as water, pesticide, and even time may have the unintended effect of stimulating some pest populations, leading to crop losses. A conceptual model is developed to contrast optimal use of pesticide and nonpesticide inputs with myopic use patterns which ignore pest externaliti ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
to be ignored by agricultural producers. Target p. rt resurgence, resulting from unintended destruction of natural predators, has been considered by Feder and Regev, Reichelderfer and Bender, Zavaleta and Ruesink, and Shoemaker. The optimal management of pest resistance to pesticides has also received
Circular and leakage resilient publickey encryption under subgroup indistinguishability  (or: Quadratic residuosity strikes back
 In CRYPTO
, 2010
"... The main results of this work are new publickey encryption schemes that, under the quadratic residuosity (QR) assumption (or Paillier’s decisional composite residuosity (DCR) assumption), achieve keydependent message security as well as high resilience to secret key leakage and high resilience to ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
The main results of this work are new publickey encryption schemes that, under the quadratic residuosity (QR) assumption (or Paillier’s decisional composite residuosity (DCR) assumption), achieve keydependent message security as well as high resilience to secret key leakage and high resilience to the presence of auxiliary input information. In particular, under what we call the subgroup indistinguishability assumption, of which the QR and DCR are special cases, we can construct a scheme that has: • Keydependent message (circular) security. Achieves security even when encrypting affine functions of its own secret key (in fact, w.r.t. affine “keycycles ” of predefined length). Our scheme also meets the requirements for extending keydependent message security to broader classes of functions beyond affine functions using previous techniques of [BGK, ePrint09] or [BHHI, Eurocrypt10]. • Leakage resiliency. Remains secure even if any adversarial lowentropy (efficiently computable) function of the secret key is given to the adversary. A proper selection of parameters allows for a “leakage rate ” of (1 − o(1)) of the length of the secret key.
Results 1  10
of
281