检索结果-南通市图书馆

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) Univ Sci & Technol beijing Informat Engn Sch Beijing 100083 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R 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

Fuzzy tolerance quotient spaces and fuzzy subsets

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第4期53卷 704-714页

作者： ZHANG Ling1 & ZHANG Bo2,3,4* 1computer science & technology college, Anhui University, Anhui 230039, china 2State Key Laboratory of Intelligent technology and Systems, beijing 100084, china 3Tsinghua National Laboratory of information science & technology, beijing 100084, china 4information science & technology college, computer science & technology Department, Tsinghua University, beijing 100084, china 1. computer science & technology college Anhui University Anhui 230039 China2. State Key Laboratory of Intelligent Technology and Systems Beijing 100084 China3. Tsinghua National Laboratory of Information Science & Technology Beijing 100084 China4. Information Science & Technology College Computer Science & Technology Department Tsinghua University Beijing 100084 China

The structure and characteristic of fuzzy subsets are discussed by using the concepts of granulation and hierarchy in quotient space theory. First, the equivalence relation based quotient space theory is extended to the fuzzy tolerance relation. Second, the isomorphism and its discriminant of fuzzy tolerance relations are discussed. Finally, by using the fuzzy tolerance relation to define the fuzzy subset, its properties are addressed. The main results are given below: (1) several equivalent statements of fuzzy tolerance relations; (2) the definition of isomorphism of fuzzy tolerance relations; (3) the isomorphic discriminant of fuzzy tolerance relations; (4) the definition and properties of fuzzy subsets based on the fuzzy tolerance relations; and (5) the necessary and sufficient condition of the isomorphism of fuzzy subsets. These results will help us further comprehend the concepts of fuzzy tolerance relations and fuzzy subsets.

关键词： Fuzzy tolerance relation quotient space isomorphism fuzzy subset

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) Tsing Hua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Acad Sinica Inst Syst Sci Beijing 100080 Peoples R China

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.

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.

An introduction to Tsinghua Cloud

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第7期53卷 1481-1486页

作者： ZHENG WeiMin1,2 1Department of computer science and technology, Tsinghua University, beijing 100084, china 2Tsinghua National Laboratory for information science and technology, beijing 100084, china 1. Department of computer science and technology Tsinghua University Beijing 100084 China2. Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

Cloud computing has become a trend that draws attention from both academia and industry all over the world. This paper unveils details of Tsinghua Cloud, a comprehensive solution for cloud computing developed by Tsing... 详细信息

关键词： cloud computing distributed file system virtual computing environment data sharing

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) [a]Department of computer science and technology Beijing Normal University Beijing China [b]Department of computer science and technology Tsinghua University Beijing 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 New Clustering Algorithm for Categorical Attributes

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

International Journal of Minerals,Metallurgy and Materials 2000年第4期14卷 318-322页

作者： Songfeng Lu, Zhengding Lu (college of computer science and technology, Huazhong University of science and technology, Wuhan 430074, china) college of computer science and technology Huazhong University of Science and Technology Wuhan 430074 China

In traditional data clustering, similarity of a cluster of objects is measured by distance between objects. Such measures are not appropriate for categorical data. A new clustering criterion to determine the similarity between points with categorical attributes is pre- sented. Furthermore, a new clustering algorithm for categorical attributes is addressed. A single scan of the dataset yields a good clus- tering, and more additional passes can be used to improve the quality further.

关键词： data mining clustering similarity information

在线全文

学校读者我要写书评

暂无评论

咖啡因的科学共识

中国食品学报 2024年第6期24卷 498-504页

作者：中国食品科学技术学会北京100048

咖啡因是一种常见于咖啡、茶叶和可可等植物中的天然活性成分,作为功能添加成分已在国际食品领域广泛应用多年,适量摄入有助于健康人群提高注意力,促进运动能力,缓解疲劳。国内外相关食品安全监管机构一致认为,咖啡因虽在日常饮食中的... 详细信息

咖啡因是一种常见于咖啡、茶叶和可可等植物中的天然活性成分,作为功能添加成分已在国际食品领域广泛应用多年,适量摄入有助于健康人群提高注意力,促进运动能力,缓解疲劳。国内外相关食品安全监管机构一致认为,咖啡因虽在日常饮食中的摄入是安全的,但需关注个体差异、摄入量以及频率。许多国家和地区已对咖啡因在食品中的应用制定了严格的应用限量和标识规定。为进一步提升大众对咖啡因的科学认知,消除对咖啡因的偏见,推动咖啡因在相关食品产业的合理应用,中国食品科学技术学会组织食品科学、公共卫生、食品安全与食品营养等领域专家与相关产业界代表,通过现场咨询、文献检索、专题研讨等形式和方法,经广泛讨论形成咖啡因的科学共识,以推动咖啡因在我国的规范使用。

关键词：咖啡因健康益处摄入量应用管理

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

在线全文

学校读者我要写书评

暂无评论

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.