Learn More
OBJECTIVE To create an end-to-end system to identify temporal relation in discharge summaries for the 2012 i2b2 challenge. The challenge includes event extraction, timex extraction, and temporal relation identification. DESIGN An end-to-end temporal relation system was developed. It includes three subsystems: an event extraction system (conditional random(More)
OBJECTIVE In this paper, we focus on three aspects: (1) to annotate a set of standard corpus in Chinese discharge summaries; (2) to perform word segmentation and named entity recognition in the above corpus; (3) to build a joint model that performs word segmentation and named entity recognition. DESIGN Two independent systems of word segmentation and(More)
The possibility of basing the security of cryptographic objects on the (minimal) assumption that NP ⊈ BPP is at the very heart of complexity-theoretic cryptography. Most known results along these lines are negative, showing that assuming widely believed complexity-theoretic conjectures, there are no reductions from an NP-hard problem to the task of breaking(More)
The possibility of basing cryptography on the minimal assumption NP BPP is at the very heart of complexity-theoretic cryptography. The closest we have gotten so far is lattice-based cryptography whose average-case security is based on the worst-case hardness of approximate shortest vector problems on integer lattices. The state-of-the-art is the(More)
We present new protocols for conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some predicate. • For general predicatesP : [N ]×[N ]→ {0,1}, we present two protocols that achieve o(N1/2) communication: the first achievesO(N1/3) communication and the second(More)
  • 1