检索结果-南通市图书馆

Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion

第五届中国不确定系统年会

作者： cuilian you~(1,2) ~1department of mathematical sciences tsinghua university,beijing 100084,china ~2department of mathematics and computer science hebei university,baoding 071002,china

＜正＞Uncertain variables are measurable func- tions from uncertainty spaces to the set of real num- *** order to discuss the mathematical properties of uncertain sequences,some limit theorems based on continuous uncertain measure are *** ad- dition,a new kind of convergence,convergence uni- formly almost surely,is ***,relation- ships between convergence almost surely uniformly and convergence almost surely,convergence in mea- sure,convergence in mean,and convergence in distri- bution are discussed.

关键词： Uncertain measure Uncertain variable Expected value Convergence

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2005年第9期15卷 851-856页

作者： LI Shundong**, DAI Yiqi and you Qiyou(department of computer science and Technology, tsinghua university, beijing 100084, china) department of computer science and Technology Tsinghua University Beijing 100084 China

Secure multi-party computation is a focus of international cryptography in recent years. Protocols for Yao’s millionaires’ problem have become an important building block of many secure multi-party computation protocols. Their efficiency are crucial to the efficiency of many secure multi-party computation protocols. Unfortunately, known protocols for Yao’s millionaires’ problem have high computational complexity or communication complexity. In this study, based on the 1-out-of-m oblivious transfer and set-inclusion problem, we propose a new protocol to solve this problem. This new protocol is very efficient in terms of both computational and communication complexities. Its privacy-preserving property is also proved by simulation paradigm which is generally accepted in the study of secure multi-party computation. We also compare the information leakage of our new protocol and the known protocols.

关键词： secure multi-party computation Yao’s millionaires’ problem 1-out-of-m oblivious transfer set-inclusion problem.

Compactness in fuzzy logic

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese science Bulletin 1998年第14期43卷 1166-1171页

作者： YING Mingsheng department of computer science and Technology, tsinghua university, beijing 100084, china department of computer science and Technology Tsinghua University Beijing China

Compactness in Pavelka’s fuzzy logic for some compact lattices of truth values is shown, and the concept of gradual compactness is introduced to establish some corresponding results in a more general setting.

关键词： fuzzy logic compactness gradual compactness.

维普期刊数据库

A note on the crossed product R(A, α) associated with PSL_2(R)

在线全文

学校读者我要写书评

暂无评论

science china mathematics 2008年第11期51卷 2081-2088页

作者： WU WenMing 1 School of mathematical and computer science, Chongqing Normal university, Chongqing 400047, china 2 department of mathematical science, tsinghua university, beijing 100084, china School of mathematical and computer science Chongqing Normal University Chongqing China department of mathematical science Tsinghua University Beijing China

Given the hyperbolic measure dxdy/y2 on the upper half plane H, the rational actions of PSL2(R) on H induces a continuous unitary representation α of this group on the Hilbert space L2(H, dxdy/y2). Supposing that A = {Mf : f ∈ L∞(H, dxdy/y2)}, we show that the crossed product R(A,α) is of type I. In fact, the crossed product R(A,α) is *-isomorphic to the von Neumann algebra B(L2(P,ν))■LK, where LK is the abelian group von Neumann algebra generated by the left regular representation of K.

关键词： crossed product rational actions PSL2(R) von Neumann algebras

A secure multi-party computation solution to intersection problems of sets and rectangles

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2006年第5期16卷 538-545页

作者： LI Shundong, DAI Yiqi, WANG Daoshun and LUO Ping (department of computer science and Technology, beijing Normal university, beijing 100875, china department of computer science and Technology, tsinghua university, beijing 100084, china) department of computer science and Technology Beijing Normal University Beijing 100875 China department of computer science and Technology Tsinghua University Beijing 100084 China

Secure multi-party computation (SMC) is a research focus in international cryptographic community. At present, there is no SMC solution to the intersection problem of sets. In this paper, we first propose a SMC solution to this problem. Applying Cantor encoding method to computational geometry problems, and based on the solution to set-intersection problem, we further propose solutions to points inclusion problem and intersection problem of rectangles and further prove their privacy-preserving property with widely accepted simulation paradigm. Compared with the known solutions, these new solutions are of less computational complexity and less communication complexity, and have obvious superiority in computational and communication complexity.

关键词： Cantor encoding secure multi-party computation set-intersection rectangle-intersection computational complexity.

A verifiable low-level concurrent programming model based on colored Petri nets

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第10期54卷 2013-2027页

作者： WANG ShengYuan & DONG Yuan department of computer science and Technology,tsinghua university,beijing 100084,china department of computer science and Technology Tsinghua University Beijing China

Concurrent programs written in a machine-level language are being used in many areas,but the verification of such programs brings various new challenges to the programming language *** of existing contributions on verifying the safety properties of concurrent programs are for high-level languages,specifications,or calculi in the *** to the lack of abstraction at a low level,additional work is needed to extend these methods to machine-level *** paper describes an approach to integrate Petri nets into low-level concurrent programs to form a new programming model (abstract machine).A program in the programming model is a restricted version of colored Petri net,with transitions colored by assembly codes for machine-level threads,and places colored by shared data consisting of memory locations or *** analysis and verification approaches for usual Petri nets can be applied indirectly for such a low-level concurrent program.

关键词： low-level concurrent programs colored Petri nets abstract machine verification

Performance Modeling and Approximate Analysis of Multiserver Multiqueue Systems with Poisson and Self-similar Arrivals

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of university of science and Technology beijing 2001年第2期8卷 145-151页

作者： Zhiguang Shan, Chuang Lin, Yang Yang, Yan Wang (Information Engineering School, university of science and Technology beijing, beijing 100083, china) (department of computer science and Technology, tsinghua university, beijing 100084, china) Information Engineering School University of Science and Technology Beijing 100083 China

The problem of state space explosion is still ran outstanding challenge in Markovian performance analysis for multiserver multiqueue (MSMQ) systems. The system behavior of a MSMQ system is described using stochastic high-level Petri net (SHLPN) models, and an approximate performance analysis technique is proposed based on decomposition and refinement methods as well as iteration technique. A real MSMQ system, Web-server cluster, is investigated. The performance of an integrated scheme of request dispatching and scheduling is analyzed with both Poisson and self-similar request arrivals. The study shows that the approximate analysis technique significantly reduces the complexity of the model solution and is also efficient for accuracy of numerical results.

关键词： multiserver multiqueue (MSMQ) system Web-server cluster performance analysis stochastic high-level Petri net (SHLPN) request dispatching request scheduling

维普期刊数据库

SUPERCONVERGENCES OF THE ADINI'S ELEMENT FORSECOND ORDER EQUATION

在线全文

学校读者我要写书评

暂无评论

Journal of Computational mathematics 1999年第6期17卷 569-574页

作者： Ping Luo(department of computer science and Technology, Qinghua university, beijing 100084,china)Qun Lin(Institute of Systems science, Academia Sinica, beijing, 100080, china) 清华大学计算机系北京 100084 中科院系统科学所北京 100080

n this papers the asymptotic error expansions of Adini's element for the secondorder imhomogeneous Neumann problem are given and the superconvergence estimations are obtained. Moreover, a numerical example to support ... 详细信息

关键词： Adini's element Superconvergence estimation Asymptotic expansion.

维普期刊数据库

CUDA-Zero:a framework for porting shared memory GPU applications to multi-GPUs

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第3期55卷 663-676页

作者： CHEN DeHao , CHEN WenGuang & ZHENG WeiMin department of computer science and Technology, tsinghua university, beijing 100084, china department of computer science and Technology Tsinghua University Beijing China

As the prevalence of general purpose computations on GPU, shared memory programming models were proposed to ease the pain of GPU programming. However, with the demanding needs of more intensive workloads, it’s desirable to port GPU programs to more scalable distributed memory environment, such as multi-GPUs. To achieve this, programs need to be re-written with mixed programming models (e.g. CUDA and message passing). Programmers not only need to work carefully on workload distribution, but also on scheduling mechanisms to ensure the efficiency of the execution. In this paper, we studied the possibilities of automating the process of parallelization to multi-GPUs. Starting from a GPU program written in shared memory model, our framework analyzes the access patterns of arrays in kernel functions to derive the data partition schemes. To acquire the access pattern, we proposed a 3-tiers approach: static analysis, profile based analysis and user annotation. Experiments show that most access patterns can be derived correctly by the first two tiers, which means that zero efforts are needed to port an existing application to distributed memory environment. We use our framework to parallelize several applications, and show that for certain kinds of applications, CUDA-Zero can achieve efficient parallelization in multi-GPU environment.

关键词： CUDA parallelization data access pattern multi-GPU