Results 1  10
of
11,267
by the Israeli Academy of Science.
, 2001
"... ‡ Research supported by the Fund for the Promotion of Research at the Technion, and ..."
Abstract
 Add to MetaCart
‡ Research supported by the Fund for the Promotion of Research at the Technion, and
Israeli Academy of Science. Correspondence author:
"... Running title: Large gene screening of vasculogenesis from human embryonic stem cells Key words: human embryonic stem cells; differentiation; development; vascular; endothelial cells; smooth muscle cells; vasculogenesis; angiogenesis ..."
Abstract
 Add to MetaCart
Running title: Large gene screening of vasculogenesis from human embryonic stem cells Key words: human embryonic stem cells; differentiation; development; vascular; endothelial cells; smooth muscle cells; vasculogenesis; angiogenesis
the Israeli Academy of Sciences. PUB TYPE Reports Research/Technical (143) Speeches/Conference Papers (150)
"... Two hypotheses related to the emergence of multiword speech were explored: (1) that multiword speech follows developments in children's ability to map communicative intents to singleword expressions; and (2) that the acquisition of these mapping principles paves the way for the emergence of sy ..."
Abstract
 Add to MetaCart
Two hypotheses related to the emergence of multiword speech were explored: (1) that multiword speech follows developments in children's ability to map communicative intents to singleword expressions; and (2) that the acquisition of these mapping principles paves the way for the emergence of syntax. The developments consist of an increase in the use of multiple realization rules for the same intent and an increase in the use of variabletype, selective realization rules. Sixteen 12 to 29montho16 children were videotaped six times in a year. The emergence of syntax was found to follow by 06 months a steep increase in the use of multiple mapping rules for the realization of the same intents in oneword utterances, as well as an "explosion " in the use of variabletype mapping rules. The results raise the possibility that an understanding of the componential structure of communicative intents, and of thst ways selected components may be mapped to expressions, is a necessary antecedent to understanding the mastery of patterned speech. (Author/SH) ********************************R***********V.******** * *************** * Reproductions suppli.A by EDRS are the best that can be made * * from the original document. *
Publickey Cryptosystems Provably Secure against Chosen Ciphertext Attacks
 In Proc. of the 22nd STOC
, 1995
"... We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model. No such secure ..."
Abstract

Cited by 284 (20 self)
 Add to MetaCart
by the Israeli Academy of Sciences. Email: naor@wisdom.weizmann.ac.il. z IBM Research Division, T.J ...
Universal OneWay Hash Functions and their Cryptographic Applications
, 1989
"... We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We ..."
Abstract

Cited by 357 (15 self)
 Add to MetaCart
We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We prove constructively that universal oneway hash functions exist if any 11 oneway functions exist. Among the various applications of the primitive is a OneWay based Secure Digital Signature Scheme which is existentially secure against adoptive attacks. Previously, all provably secure signature schemes were based on the stronger mathematical assumption that trapdoor oneway functions exist. Key words. cryptography, randomized algorithms AMS subject classifications. 68M10, 68Q20, 68Q22, 68R05, 68R10 Part of this work was done while the authors were at the IBM Almaden Research Center. The first author was supported in part by NSF grant CCR88 13632. A preliminary version of this work app...
Broadcast Encryption
, 1994
"... We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The goal is to allow a central broadcast site to broadcast secure transmissions to an arbitrary set of recipients while minimizing key management related ..."
Abstract

Cited by 326 (10 self)
 Add to MetaCart
We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The goal is to allow a central broadcast site to broadcast secure transmissions to an arbitrary set of recipients while minimizing key management related transmissions. We present several schemes that allow a center to broadcast a secret to any subset of privileged users out of a universe of size n so that coalitions of k users not in the privileged set cannot learn the secret. The most interesting scheme requires every user to store O(k log k log n) keys and the center to broadcast O(k 2 log 2 k log n) messages regardless of the size of the privileged set. This scheme is resilient to any coalition of k users. We also present a scheme that is resilient with probability p against a random subset of k users. This scheme requires every user to store O(log k log(1=p)) keys and the center to broadcast O(k log 2 k log(1=p)) messages. Prel...
Are There Universal Aspects in the Structure and Contents of Human Values
 Journal of Social Issues
, 1994
"... This article presents a theory of potentially universal aspects in the content of human values. Ten types of values are distinguished by their motivational goals. ..."
Abstract

Cited by 289 (2 self)
 Add to MetaCart
This article presents a theory of potentially universal aspects in the content of human values. Ten types of values are distinguished by their motivational goals.
Bidding and Allocation in Combinatorial Auctions
 In ACM Conference on Electronic Commerce
, 2000
"... When an auction of multiple items is performed, it is often desirable to allow bids on combinations of items, as opposed to only on single items. Such an auction is often called "combinatorial ", and the exponential number of possible combinations results in computational intractability ..."
Abstract

Cited by 277 (11 self)
 Add to MetaCart
When an auction of multiple items is performed, it is often desirable to allow bids on combinations of items, as opposed to only on single items. Such an auction is often called "combinatorial ", and the exponential number of possible combinations results in computational intractability of many aspects regarding such an auction. This paper considers two of these aspects: the bidding language and the allocation algorithm. First we consider which kinds of bids on combinations are allowed and how, i.e. in what language, they are specified. The basic tradeoff is the expressibility of the language versus its simplicity. We consider and formalize several bidding languages and compare their strengths. We prove exponential separations between the expressive power of different languages, and show that one language, "ORbids with phantom items", can polynomially simulate the others. We then consider the problem of determining the best allocation  a problem known to be computationally intractable. We suggest an approach based on Linear Programming (LP) and motivate it. We prove that the LP approach finds an optimal allocation if and only if prices can be attached to single items in the auction. We pinpoint several classes of auctions where this is the case, and suggest greedy and branchandbound heuristics based on LP for other cases. 1
Randomness is Linear in Space
 Journal of Computer and System Sciences
, 1993
"... We show that any randomized algorithm that runs in space S and time T and uses poly(S) random bits can be simulated using only O(S) random bits in space S and time T poly(S). A deterministic simulation in space S follows. Of independent interest is our main technical tool: a procedure which extracts ..."
Abstract

Cited by 254 (19 self)
 Add to MetaCart
We show that any randomized algorithm that runs in space S and time T and uses poly(S) random bits can be simulated using only O(S) random bits in space S and time T poly(S). A deterministic simulation in space S follows. Of independent interest is our main technical tool: a procedure which extracts randomness from a defective random source using a small additional number of truly random bits. 1
Results 1  10
of
11,267