检索结果-内蒙古大学图书馆

Efficient Collusion-Resisting Secure Sum Protocol

电子学报(英文版) 2011年第3期20卷 407-413页

作者： ZHU Youwen HUANG Liusheng YANG Wei YUAN Xing National High Performance Computing Center at Hefei Department of Computer Science and Technology University of Science and Technology of China Hefei China Suzhou Institute for Advanced Study University of Science and Technology of China Suzhou China

Secure sum protocol is a significant secure multiparty computation protocol and it has various applications in privacy-preserving distributed multiparty computation. However, most existing secure sum protocols rarely considered how to resist underlying collusion which is a significant practical problem. Urabe et al. proposed a collusion-resistant secure sum protocol, but too much cost of communication and computation results in its low performance efficiency. In this paper, we propose security definitions to measure secure multiparty computation protocol's capability of resisting potential collusion. Then, we precisely analyze several previous secure sum protocols' capability of resisting collusion. In addition, considering realistic requirement to resist collusion and performance efficiency needs, we present a novel collusion-resisting secure sum protocol. Theoretical analysis and experimental results confirm that our secure sum protocol is efficient and has strong capability of resisting potential collusion such that it is much superior to previous ones. The communication overheads and computation complexity of our scheme both are linearity of the number of participants. Besides, our protocol's capability of resisting collusion is adjustable according to different security needs.

关键词：安全多方计算协议抗合谋隐私保护安全总结安全协议计算结果通信开销安全需求

来源：评论

学校读者我要写书评

暂无评论

A Novel Multiparty Quantum Secret Sharing Scheme of Secure Direct Communication Based on Bell States and Bell Measurements

引用

Chinese Physics Letters 2011年第5期28卷 22-25页

作者： SHI Run-Hua HUANG Liu-Sheng YANG Wei ZHONG Hong National High Performance Computing Center at Hefei Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027 School of Computer Science and Technology Anhui UniversityHefei 230039 Suzhou Institute for Advanced Study University of Science and Technology of ChinaSuzhou 215123

We present a novel quantum secret sharing scheme of secure direct communication and analyze its *** scheme takes Einstein-Podolsky-Rosen(EPR)pairs in Bell states as quantum *** order to obtain thedirect communication message,all agents only need to perform Bell measurements,not to perform any local unitary *** total efficiency in this scheme approaches 100%as the classical information exchanged is unnecessary except for the eavesdropping checks.

关键词： scheme quantum unitary

来源：评论

学校读者我要写书评

暂无评论

Collaborative Localization Method in Wireless Sensor Networks: A Game Theoretic Perspective

引用

电子学报(英文版) 2011年第1期20卷 155-160页

作者： HUANG He SUN Yu-e XIAO Mingjun XU Hongli CHEN Guoliang Department of Computer Science and Technology University of Science and Technology of China Hefei China Suzhou Institute for Advanced Study University of Science and Technology of China Suzhou China Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang China

Most of the localization algorithms use neighbor nodes and anchor nodes to refine the position of nodes estimation. Nevertheless, there has not been any paper mentioned the problem of how to refine the position of nodes in a most rational way. The GTCMS (Game theory based confidence mass-spring) algorithm proposed in our paper elegantly solved this *** game theory. In the position refining procedure of GTCMS, each node first selects the neighbor nodes which will be used to adjust its position by following the natural game course users converge to a Nash equilibrium, and then uses the best response theorem we proposed to adjust its position. We also prove that the GTCMS algorithm could achieve the global Nash equilibrium. Compared with traditional localization methods, GTCMS algorithm greatly reduces the localization error rate and converges much more efficiently.

关键词：定位方法博弈论无线传感器网络协同节点位置定位算法纳什均衡改进估计

来源：评论

学校读者我要写书评

暂无评论

Workshop on Modeling the Perception of Intentions 34

Workshop on Modeling the Perception of Intentions

引用

34th Annual Meeting of the Cognitive science Society: Building Bridges Across Cognitive sciences Around the World, CogSci 2012

作者： Pautler, David Tversky, Barbara Ullman, Shimon Baldwin, Dare Pollick, Frank E. Tenenbaum, Josh Gao, Tao Pantelis, Peter Programme in Computational Social Cognition Institute of High Performance Computing 1 Fusionopolis Way 16-16 Connexis Singapore138632 Singapore Department of Psychology Stanford University Building 420 StanfordCA94305-2130 United States Department of Computer Science And Applied Mathematics Ziskind Building Weizmann Institute of Science Room 208 Rehovot76100 Israel Department of Psychology Straub Hall 1227 University of Oregon EugeneOR97403 United States Dept of Psychology Room 702 58 Hillhead Street GlasgowG12 8QB United Kingdom Building 46-4015 77 Massachusetts Avenue CambridgeMA02139 United States Building 46-4053 CambridgeMA02139 United States Psychology Building Busch Campus 152 Frelinghuysen Road PiscatawayNJ08854-8020 United States

ISBN: (纸本)9780976831884

Attributing intentions to others based on observations of their behavior is a core cognitive ability. It is also a necessary precursor to social judgments such as judgments about responsibility and morality. The seminal work of Heider and Simmel (1944) highlighted the spontaneity, richness, and range of intention attributions that can be elicited by a stimulus as impoverished as moving geometric figures. Subsequent research has revealed a wide range of visuospatial cues that suggest specific intentions as well as observer attributes that influence judgments. How are such cues and observer attributes integrated into an inferred specific intention? A handful of processing models have used frameworks such as schema-matching or probabilistic inference to integrate such cues. This workshop will address two questions: 1) How have different fundamental paradigms fared in the quest for a model of human intention perception? and 2) What questions about this topic are most in need of answers? © CogSci *** rights reserved.

关键词： action understanding computational modeling event perception intention recognition probabilistic inference social cognition theory of mind

来源：评论

学校读者我要写书评

暂无评论

Controlled quantum perfect teleportation of multiple arbitrary multi-qubit states

引用

science China(Physics,Mechanics & Astronomy) 2011年第12期54卷 2208-2216页

作者： SHI RunHua HUANG LiuSheng YANG Wei ZHONG Hong National High Performance Computing Center at Hefei Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China School of Computer Science and Technology Anhui University Hefei 230039 China Suzhou Institute for Advanced Study University of Science and Technology of China Suzhou 215123 China

We present an efficient controlled quantum perfect teleportation scheme. In our scheme, multiple senders can teleport multiple arbitrary unknown multi-qubit states to a single receiver via a previously shared entanglement state with the help of one or more controllers. Furthermore, our scheme has a very good performance in the measurement and operation complexity, since it only needs to perform Bell state and single-particle measurements and to apply Controlled-Not gate and other single-particle unitary operations. In addition, compared with traditional schemes, our scheme needs less qubits as the quantum resources and exchanges less classical information, and thus obtains higher communication efficiency.

关键词： perfect quantum teleportation controlled quantum teleportation quantum state sharing

来源：评论

学校读者我要写书评

暂无评论

An ontology-based MicroRNA knowledge sharing and acquisition framework

An ontology-based MicroRNA knowledge sharing and acquisition...

引用

IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)

作者： Jingshan Huang Xingyu Lu Dejing Dou William T. Gerthoffer Jiangbo Dang Judith A. Blake Ming Tan School of Computing University of South Alabama Mobile AL U.S.A. Siemens Corporate Research Siemens Corporation Princeton NJ U.S.A. Computer and Information Science Department University of Oregon Eugene OR U.S.A. The Jackson Laboratory Bar Harbor ME U.S.A. Department of Biochemistry & Molecular Biology University of South Alabama Mobile AL U.S.A. Mitchell Cancer Institute University of South Alabama Mobile AL U.S.A.

ISBN: (纸本)9781467327466

MicroRNAs (miRNAs) play important roles in various biological processes by regulating their target genes. Therefore, miRNAs are closely associated with development, diagnosis, and prognosis for many diseases. The prediction of miRNA targets remains a challenging task for biologists because it involves an extremely large amount of data sources to be explored: to manually integrate information of identified targets and related information from various sources is time-consuming and error-prone; most of all, it is subject to biologists' limited prior knowledge. In this paper we investigated an ontology-based knowledge sharing framework to assist biologists in unraveling important roles of miRNAs in human disease in an automated and more efficient manner, (i) We developed the very first domain-specific ontologies in the miRNA field, Ontology for MicroRNA Target (OMIT), (ii) According to the global metadata model defined in ontologies, heterogeneous data sources were annotated and seamlessly integrated and stored into a central Resource Description Framework (RDF) data repository, (iii) We then enabled ontology-based queries, instead of traditional SQL queries, by inferring new statements from RDF data triples. Consequently we were able to acquire hidden knowledge originally implicit and unclear, yet critical, to biologists.

关键词： Ontologies Semantics Biology Resource description framework Databases Engines Cognition

来源：评论

学校读者我要写书评

暂无评论

Largest area convex hull of axis-aligned squares based on imprecise data

Largest area convex hull of axis-aligned squares based on im...

引用

Lecture Notes in computer science

作者： Daescu, Ovidiu Ju, Wenqi Luo, Jun Zhu, Binhai Department of Computer Science University of Texas Dallas TX United States Institute of Computing Technology Chinese Academy of Sciences China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Department of Computer Science Montana State University United States

ISBN: (纸本)9783642226847

Data collected from real world are often imprecise. A few algorithms were proposed recently to compute the convex hull of maximum area when the axis-aligned squares model is used to represent imprecise input data. If squares are non-overlapping and of different sizes, the time complexity of the best known algorithm is O(n7). If squares are allowed to overlap but have the same size, the time complexity of the best known algorithm is O(n 5). In this paper, we improve both bounds by a quadratic factor, i.e., to O(n5) and O(n3), respectively. © 2011 Springer-Verlag.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving computation of trust-value in wireless sensor networks

Privacy preserving computation of trust-value in wireless se...

引用

IEEE International Conference on Communication Software and Networks

作者： Yuan, Xing Huang, Liusheng Yangt, Wei National High Performance Computing Center at Hefei Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Suzhou Institute for Advanced Study University of Science and Technology of China Suzhou 215123 China

ISBN: (纸本)9781612844855

The traditional cryptographic mechanisms are not enough for wireless sensor networks (WSNs) when the control of sensor nodes are taken by an interior adversary. Trust management system can solve this problem efficiently, and enhance the security and reliability of WSNs. One of the key problems in trust management system is computing trust values of nodes. However, previous works pay little attention to preserving data privacy during computing trust values. This paper focus on the problem that how to protect the data privacy while computing trust values, and proposes a privacy preserving trust value computation (PPTC) protocol to solve this problem. We develop a new private distributed scalar product protocol based on semi-honest third party to achieve the PPTC protocol. A great advantage of PPTC protocol is that it does not need any encryption or decryption operations, and the computation and communication overheads is low to 0(n). What's more, we analyze the correctness and security of the PPTC protocol and prove that the protocol can resist to collusion of up to n 1 users. © 2011 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

The Importance of Precision in Humour Classification

The Importance of Precision in Humour Classification

引用

12th International Conference on Intelligent Data Engineering and Automated Learning (IDEAL 2011)

作者： Costa, Joana Silva, Catarina Antunes, Mario Ribeiro, Bernardete Computer Science Communication and Research Centre School of Technology and Management Polytechnic Institute of Leiria Portugal Department of Informatics Engineering Center for Informatics and Systems of the University of Coimbra (CISUC) Portugal Center for Research in Advanced Computing Systems (CRACS) Portugal

ISBN: (纸本)9783642238772

Humour classification is one of the most interesting and difficult tasks in text classification. Humour is subjective by nature, yet humans are able to promptly define their preferences. Nowadays people often search for humour as a relaxing proxy to overcome stressful and demanding situations, having little or no time to search contents for such activities. Hence, we propose to aid the definition of personal models that allow the user to access humour with more confidence on the precision of his preferences. In this paper we focus on a Support Vector Machine (SVM) active learning strategy that uses specific most informative examples to improve baseline performance. Experiments were carried out using the widely available Jester jokes dataset, with encouraging results on the proposed framework.

关键词： Support Vector Machine Active Learning Text Classification Humour classification

来源：评论

学校读者我要写书评

暂无评论

Reaction systems with duration

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6610卷 191-202页

作者： Brijder, Robert Ehrenfeucht, Andrzej Rozenberg, Grzegorz Leiden Institute of Advanced Computer Science Leiden Center for Natural Computing Leiden University Netherlands Department of Computer Science University of Colorado at Boulder United States

ISBN: (纸本)9783642199998

A reaction system is essentially a finite set of reactions, where each reaction consists of a finite set of reactants (needed for the reaction to take place), a finite set of inhibitors (each of which inhibits the reaction from taking place), and a finite set of products produced when the reaction takes place. A crucial feature of a reaction system is that (unless introduced from outside the system) an element (entity) from a current state will belong also to the successor state only if it is in the product set of a reaction that took place in the current state. In other words, an entity vanishes unless it is sustained by a reaction - a sort of "immediate decay" property. In this paper we relax this property, by providing each entity x with its duration d(x), which guarantees that x will last through at least d(x) consecutive states. Such reaction systems with duration are investigated in this paper. Among others we demonstrate that duration/decay is a result of an interaction with a "structured environment", and we also investigate fundamental properties of state sequences of reaction systems with duration. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：