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

2011 8th international conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th international conference on Natural computation, ICNC'11

作者： Zheng, Yunping Li, Zujia Sarem, Mudar Lin, Guang Hu, Liqiang School of Computer Science and Engineering South China University of Technology Guangzhou China School of Software Enginneering Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781612841816

In this paper, inspired by the idea of the triangle and square packing problems, by using the combination of triangle subpatterns and square subpatterns, we propose a new representation method of gray images based on the triangular and square non-symmetry and anti-packing model (TSNAM). Also, we present a TSNAM representation algorithm of gray images and analyze the storage structures and the total data amount of the algorithm. By comparing the representation algorithm of the TSNAM with those of the latest improved indirect triangle non-symmetry and anti-packing model (IITNAM) and the conventional linear quadtree (LQT), the theoretical and experimental results in this paper show that the former can greatly reduce the numbers of subpatterns or nodes and simultaneously save the data storage much more effectively than the latter, and therefore it is a better method to represent gray images. © 2011 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Distributed quantum programming

Distributed quantum programming

引用

8th international conference on Unconventional computation

作者： D'Hondt, Ellie Vandriessche, Yves Vrije Univ Brussel Software Languages Lab B-1050 Elsene Belgium

ISBN: (纸本)3642037445

In this paper we explore the structure and applicability of the Distributed Measurement Calculus (DMC), an assembly language for distributed measurement-based quantum computations. We describe the formal language's syntax and semantics, both operational and denotational, and state several properties that are crucial to the practical usability of our language, such as equivalence of our semantics, as well as compositionality and context-freeness of DMC programs. We show how to put these properties to use by constructing a composite program that implements distributed controlled operations, in the knowledge that the semantics of this program does not change under the various composition operations. Our formal model is the basis of a quantum virtual machine construction for distributed quantum computations, which we elaborate upon in the latter part of this work. this virtual machine embodies the formal semantics of DMC such that programming execution no longer needs to be analysed by hand. Far from a literal translation, it requires a substantial concretisation of the formal model at the level of data structures, naming conventions and abstraction mechanisms. At the same time we provide automatisation techniques for program specification where possible to obtain an expressive and user-friendly programming environment.

关键词： Quantum computing Measurement-based quantum computing Distributed computing Formal models Virtual machines

来源：评论

学校读者我要写书评

暂无评论

Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant computation-Cost 1

引用

5th international conference on Provable Security, (ProvSec 2011)

作者： Chen, Cheng Zhang, Zhenfeng Feng, Dengguo Chinese Acad Sci Inst Software State Key Lab Informat Secur Beijing 100190 Peoples R China

ISBN: (数字)9783642243165

ISBN: (纸本)9783642243158

Attribute-based encryption provides good solutions to the problem of anonymous access control by specifying access policies among private keys or ciphertexts over encrypted data. In ciphertext-policy attribute-based encryption (CP-ABE), each user is associated with a set of attributes, and data is encrypted with access structures on attributes. A user is able to decrypt a ciphertext if and only if his attributes satisfy the ciphertext access structure. CF-ABE is very appealing since the ciphertext and data access policies are integrated together in a natural and effective way. Most current CF-ABE schemes incur large ciphertext size and computation costs in the encryption and decryption operations which depend at least linearly on the number of attributes involved in the access policy. In this paper, we present two new CF-ABE schemes, which have both constant-size ciphertext and constant computation costs for a non-monotone AND gate access policy, under chosen plaintext and chosen ciphertext attacks. the security of first scheme can be proven CPA-secure in standard model under the decision n-BDHE assumption. And the security of second scheme can be proven CCA-secure in standard model under the decision n-BDHE assumption and the existence of collision-resistant hash functions. Our scheme can also be extended to the decentralizing multi-authority setting.

关键词： Attribute-based encryption chosen ciphertext security efficiency

来源：评论

学校读者我要写书评

暂无评论

Weak bisimulations for the Giry monad

Weak bisimulations for the Giry monad

引用

6th international conference on theory and Application of Models of computation (TAMC 09)

作者： Doberkat, Ernst-Erich Tech Univ Dortmund Chair Software Technol Dortmund Germany

We study the existence of bisimulations for Kleisli morphisms associated with the Giry monad of subprobabilities over Polish spaces. We first investigate these morphisms and show that the problem can be reduced to the existence of bisimulations for objects in the base category of stochastic relations using simulation equivalent congruences. this leads us to a criterion for two objects to be bisimilar.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Design contest overview: Combined architecture for network stream categorization and intrusion detection (CANSCID) 10

Design contest overview: Combined architecture for network s...

引用

Proceedings of the Eighth ACM/IEEE international conference on Formal Methods and Models for Codesign

作者： Pellauer, Michael Agarwal, Abhinav Khan, Asif Ng, Man Cheuk Vijayaraghavan, Muralidaran Brewery, Forrest Emer, Joel Massachusetts Institute of Technology Computation Structures Group Computer Science and AI Lab. Cambridge MA United States University of California Santa Barbara High Level Design Group Electrical and Computer Engineering Santa Barbara CA United States Intel Corporation VSSAD Group Hudson MA United States

ISBN: (纸本)9781424478859

this year we received 8 submissions for our Deep Packet Inspection problem. 6 submissions used FPGAs, and 2 used GP-GPUs. the organizers find it significant that no team submitted a software-only solution that did not use some kind of hardware accelerator an indication that software alone could not meet the required line rate. this year the contest ended in a tie. Congratulations to the joint winners, Team Sasao Lab and Team Limenators, each having implemented 140 patterns while maintaining line rate. Additionally, Team Sasao Lab was the only team to use an NFA approach rather than DFAs for matching the regular expressions. Full results are given in Table II. the performance of the two winners was verified by the organizers using undisclosed test inputs. the performance of the other teams is self-reported. © 2010 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resource Scheduling in Disruption-Prone software Development Environments 1

引用

13th international conference on foundations of software science and computational structures/Joint European conferences on theory and Practice of software

作者： Xiao, Junchao Osterweil, Leon J. Wang, Qing Li, Mingshu Chinese Acad Sci Inst Software Lab Internet Software Technol Beijing 100190 Peoples R China Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA Chinese Acad Sci Inst Software Key Lab Comp Sci Beijing 100190 Peoples R China

ISBN: (数字)9783642120299

ISBN: (纸本)9783642120282

Good resource scheduling plays a pivotal role in successful software development projects. However, effective resource scheduling is complicated by such disruptions as requirements changes, urgent bug fixing, incorrect or unexpected process execution, and staff turnover. Such disruptions demand immediate attention, but can also impact the stability of other ongoing projects. Dynamic resource rescheduling can help suggest strategies for addressing such potentially disruptive events by suggesting how to balance the need for rapid response and the need for organizational stability. this paper proposes a multi-objective rescheduling method to address the need for software project resource management that is able to suggest strategies for addressing such disruptions. A genetic algorithm is used to support rescheduling computations. Examples used to evaluate this approach suggest that it can support more effective resource management in disruption-prone software development environments.

关键词： Disruption rescheduling multi-objective genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Intelligent Computer Mathematics - 16th Symposium, Calculemus 2009 - 8th international conference, MKM 2009 - Held as Part of CICM 2009, Proceedings

Intelligent Computer Mathematics - 16th Symposium, Calculemu...

引用

16th Symp. on the Integration of Symbolic computation and Mechanized Reasoning, Calculemus 2009 and 8th Int. Conf. on Mathematical Knowledge Management, MKM 2009. Held as part of the Confs. on Intelligent Computer Mathematics, CICM 2009

ISBN: (纸本)3642026133

the proceedings contain 39 papers. the topics discussed include: computational logic and continuous mathematics, pure and applied;abstraction-based information technology: a framework for open mechanized reasoning;some traditional mathematical knowledge management;conservative retractions of propositional logic theories by means of Boolean derivatives: theoretical foundations;a comparison of equality in computer algebra and correctness in mathematical pedagogy;exploring a quantum theory with graph rewriting and computer algebra;ACL2 verification of simplicial degeneracy programs in the Kenzo system;combined decision techniques for the existential theory of the reals;algorithms for the functional decomposition of Laurent polynomials;formal proof: reconciling correctness and understanding;Openmath content dictionaries for SI quantities and units;and the characteristics of writing environments for mathematics: behavioral consequences and implications for software design and usability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field

引用

29th Annual international Cryptology conference

作者： Cascudo, Ignacio Chen, Hao Cramer, Ronald Xing, Chaoping Univ Oviedo Dept Math Oviedo Spain East China Normal Univ Inst Software Engn Shanghai 20062 Peoples R China Leiden Univ CWI Amsterdam & Math Inst NL-2300 RA Leiden Netherlands Nanyang Technol Univ Div Sci & Math Singapore 639798 Singapore

ISBN: (纸本)9783642033551

this work deals with "MPC-friendly" linear secret sharing schemes (LSSS), a mathematical primitive upon which secure multi-party computation (MPC) call be based and which was introduced by Cramer;Damgaard and Maurer (EUROCRYPT 2000). Chen and Cramer proposed a special class of such schemes that is constructed from algebraic geometry and that enables efficient secure multi-party computation over fixed finite fields (CRYP770 2006). We extend this in four ways. First, we propose an abstract coding-theoretic framework in which this class of schemes and its (asymptotic) properties can be cast and analyzed. Second;we show that for every finite field IF, there exists an infinite family of LSSS over IF, that is asymptotically good in the following sense: the schemes are "ideal," i.e., each share consists of a single F-q-element, and the schemes have t-strong multiplication on n players, where the corruption tolerance 3t/n-1, tends to a constant nu(q) with 0 < nu(q) < 7. when n tends to infinity. Moreover, when vertical bar F-q vertical bar tends to infinity, nu(q) tends to 1, which is optimal. this leads to explicit lower bounds on (tau) over cap (q), our measure of asymptotic optimal corruption tolerance. We achieve this by combining the results of Chen and Cramer with a dedicated field-descent method. In particular;in the F-2-case there exists a family of binary t-strongly multiplicative ideal LSSS with 3t/n-1 approximate to 2.86% when n tends to infinity, a one-bit secret and just a one-bit share for every player. Previously;such results were shown for F-q with q >= 49 a square. third;we present an infinite family of ideal schemes with t-strong multiplication that does not rely on algebraic geometry acid that works over every finite field F-q. Its corruption tolerance vanishes, yet still 3t/n-1 = Omega(1/(log log n) log n). Fourth and finally, we give an improved non-asymptotic tipper bound on corruption tolerance.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

foundations of software science and computation structures - 9th international conference, FOSSACS 2006. Held as part of the joint European conferences on theory and practice of software, ETAPS 2006, Proceedings

引用

9th international conference on foundations of software science and computation structures, FOSSACS 2006. Held as Part of the Joint European conferences on theory and Practice of software, ETAPS 2006

ISBN: (纸本)3540330453

the proceedings contain 29 papers. the topics discussed include: a theory for observational fault tolerance;smooth orchestrators;on the relative expressive power of asynchronous communication primitives;more on bisimulations for higher order π-calculus;register allocation after classical SSA elimination is NP complete;a logic of reachable patterns in linked data structures;dynamic policy discovery with remote attestation;distributed unfolding of Petri nets;a finite model construction for coalgebric modal logic;presenting functors by operations and equations;bigraphical models of context - aware systems;processes for adhesive rewriting systems;on metric temporal logic and faulty turing machines;and denotational semantics of hybrid automata.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

Reversing algebraic process calculi

引用

JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING 2007年第1-2期73卷 70-96页

作者： Phillips, Iain Ulidowski, Irek Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England Univ Leicester Dept Comp Sci Leicester LE1 7RH Leics England

Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We formulate a procedure for converting operators of standard algebraic process calculi such as CCS into reversible operators, while preserving their operational semantics. We define forward-reverse bisimulation and show that it is preserved by all reversible operators. (c) 2007 Elsevier Inc. All rights reserved.

关键词： reversible computation structural operational semantics (SOS) formats of SOS rules CCS with keys forward-reverse bisimulation congruence result

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：