用服务来更好地服务客户—专访利盟大中华区董事总经理曾德文先生

利盟国际有限公司是一个快速成长的集研发、制造、营销、服务于一体的国际知名企业，拥有强大的核心技术和很多专利技术，并且在国、内外企业级客户的解决方案方面拥有众多的成功案例，是一家唯一专注于为全球用户提供领先的打印解决方案和打印服务的供应商。     

Novell最低成本身份管理解决方案

正2010年11月16日,北京-Novell公司于近日宣布,一项全面的最新研究证明,在一个5年期检验中,Novell身份和访问管理解决方案具有比竞争对手低25%的总体拥有成本。由独立顾问咨询组织Rencana所做的这项研究工作对50多家客户和系统集成厂商就Novell、CA、IBM、Oracle和Courion的身份解决方案进行了调查。     

Novell身份管理解决方案

Novell公司近日宣布,一项全面的最新研究证明,在一个5年期检验中,Novell身份和访问管理解决方案（http：//www.novell.com/solutions/identity-and-access/）具有比竞争对手低25%的总体拥有成本。由独立顾问咨询组织Rencana所做的这项研究工作对50多家客户和系统集成厂商就Novell、CA、IBM、Oracle和Courion的身份解决方案进行了调查。     

施耐德电推出APC NetShelter SV

近日，全球能效管理专家施耐德电气宣布推出APCNetShelterSV。这款经济实用的机架解决方案不仅拥有业界认可的设计理念，并且实现了机架基础配件的无缝集成，能够为多种高度、宽度以及深度提供解决方案，迎接IT隔境中的业务挑战。     

朗讯光网络产品规划总监Heinz Zallmann——面向新形势的战略

朗讯的客户群包括面向全球范围的通信服务运营商、政府以及企业。截至2003年9月，朗讯在全球拥有3.3万名员工，2003财年的收入为85亿美元。朗讯由集成网络解决方案部、移动解决方案部和朗讯全球服务部三大运营机构组成，光网络组属于集成网络解决方案部。谈及朗讯重新修订的战略时，     

IBM和Network Appliance建立存储联盟

IBM存储系统事业部和Network Appliance(NetApp)公司宣布建立存储战略合作关系，以此来推动企业实现随需应变的信息解决方案。同时对IBM的存储解决方案系列进行扩展，IBM拥有业界最丰富和最先进的存储和信息管理产品。     

Novell推出先进的Linux系统管理解决方案

Novell于近日宣布推出SUSE Manager，该产品是企业Linux环境最先进的系统管理解决方案。作为跨物理、虚拟和云环境管理SUSELinuxEnterpriseServer和其它LinuX发行版的最佳解决方案，即使部署变得非常复杂，SUSEManager也可明显降低LinuX部属的总拥有成本。     

发烧级多任务处理平台：华硕L1N64-SLIWS

2007年5月9日，汤姆逊宣布，法国第二大移动运营商SFR选择汤姆逊为其提供一个全面的宽带解决方案，来促进其以家庭移动用户为中心的策略实施。这个项目更进一步强化了汤姆逊在迅速发展的VoIP、IPTV和宽频互动服务的综合解决方案市场的领导地位。这些解决方案能使运营商拥有全球性的IMS框架体系。     

网络化视频监控在考场中的应用

无论是单独由网络摄像机组成的解决方案，还是由模拟摄像机和网络视频服务器组成的解决方案，IP监控都已证明其吸引力越来越大了。短短几年，网络视频监控的“地盘”不断拓展，进入到各行各业当中。以下便是一个教育领域的网络监控案例。[编者按]     

MAYA EX——另类USB接口5.1声道“声卡”

韩国MAYA EX是笔记本电脑和台式机理想的外接USB音频解决方案，它通过最为常见的USB1.1接口进行连接，令你的机器拥有5.1声道的环绕音频．能进行DTS 5.1和AC-35.1的解码回放．它还拥有光纤输入接口和输出接口。     

On BAN logic and hash functions or: how an unjustified inference rule causes problems

BAN logic, an epistemic logic for analyzing security protocols, contains an unjustifiable inference rule. The inference rule assumes that possession of H(X) (i.e., the cryptographic hash value of X) counts as a proof of possession of X, which is not the case. As a result, BAN logic exhibits a problematic property, which is similar to unsoundness, but not strictly equivalent to it. We will call this property ‘unsoundness’ (with quotes). The property is demonstrated using a specially crafted protocol, the two parrots protocol. The ‘unsoundness’ is proven using the partial semantics which is given for BAN logic. Because of the questionable character of the semantics of BAN logic, we also provide an alternative proof of ‘unsoundness’ which we consider more important.     

Random oracle-based anonymous credential system for efficient attributes proof on smart devices

Attributes proof in anonymous credential systems is an effective way to balance security and privacy in user authentication; however, the linear complexity of attributes proof causes the existing anonymous credential systems far away from being practical, especially on resource-limited smart devices. For efficiency considerations, we present a novel pairing-based anonymous credential system which solves the linear complexity of attributes proof based on aggregate signature scheme. We propose two extended signature schemes, BLS+ and BGLS+, to be cryptographical building blocks for constructing anonymous credentials in the random oracle model. Identity-like information of message holder is encoded in a signature in order that the message holder can prove the possession of the input message along with the validity of a signature. We present issuance protocol for anonymous credentials embedding weak attributes which are referred to what cannot identify a user in a population. Users can prove any combination of attributes all at once by aggregating the corresponding individual credentials into one. The attributes proof protocols on AND and OR relation over multiple attributes are also given. The performance analysis shows that the aggregation-based anonymous credential system outperforms both the conventional Camenisch–Lysyanskaya pairing-based system and the accumulator-based system when prove AND and OR relation over multiple attributes, and the size of credential and public parameters are shorter as well.     

面向云服务的轻量级匿名订阅系统

针对已有匿名订阅系统订阅方式不灵活、用户端运算量大以及用户访问次数不受限制等缺陷,在Canard等人系统的基础上,提出一个面向云服务的轻量级匿名订阅系统。新系统的构造过程使用了关于掌握Au-Susilo-Mu签名的知识证明、改进的集合成员证明以及双线性对运算的性能优化技术。与已有系统相比,新系统同时满足以下性质：允许用户一次性订阅多种服务类型;对用户的访问次数作出限制;不允许用户与他人共享使用电子钱包;为用户提供了较强的隐私保护等级。该系统可证能安全地实现匿名订阅的功能。仿真实验表明,当被证明的秘密值在50～1 050内变化时,用户在Access协议中的运行效率较同类系统提高了79.5%～83.2%。     

我国童装设计的现状分析及应对策略初探

儿童的问题已经引起国人的日益关注,而我国童装业起步较晚,存在着各种问题,文章分析了我国童装设计中存在的主要问题及原因,在此基础上,结合童装的特点,提出了若干应对策略。     

Using hints to increase the effectiveness of an automated reasoning program: Case studies

In this article we consider the use of hints to help guide the search for a proof. Under the hints strategy, the value of a generated clause is determined, in part, by whether or not the clause subsumes or is subsumed by a user-supplied hint clause. We have implemented the hints strategy and have experimented with it extensively. We summarize our experiences for a variety of reasoning tasks, including proof checking, proof completion, and proof finding. We conclude that the hints strategy has value beyond simply “giving the proof to find the proof.”     

The real creators of Cobol

Contrary to persistent myths, a committee initially created Cobol in 1959, not one person. The article outlines the creation and mission of the committee that developed the language and a few of the major inputs and influences on Cobol's initial development, including the people actually involved. This material is based on documents from the 1959 committee work which are in the possession of the author     

基于通用可组合理论的办议安全性证明方法讨论

文章介绍了可证明安全协议设计中较为流行的UC模型,对UC模型的提出、证明目标、证明过程等进行了总结和分析。通过一个公钥加密通信协议的举例,解释了UC模型下的证明过程。文章最后给出使用UC模型的一般规律。     

面向真实云存储环境的数据持有性证明系统

对数据动态更新和第三方审计的支持的实现方式是影响现有数据持有性证明（provable data possession,简称PDP）方案实用性的重要因素.提出面向真实云存储环境的安全、高效的PDP系统IDPA-MF-PDP.通过基于云存储数据更新模式的多文件持有性证明算法MF-PDP,显著减少审计多个文件的开销.通过隐式第三方审计架构和显篡改审计日志,最大限度地减少了对用户在线的需求.用户、云服务器和隐式审计者的三方交互协议,将MF-PDP和隐式第三方审计架构结合.理论分析和实验结果表明：IDPA-MF-PDP具有与单文件PDP方案等同的安全性,且审计日志提供了可信的审计结果历史记录;IDPA-MF-PDP将持有性审计的计算和通信开销由与文件数线性相关减少到接近常数.     

A proof of the nonrestoring division algorithm and its implementation on an ALU

This article describes a proof of the functional correctness of a nonrestoring division algorithm and its implementation on an ALU. The first part of the proof deals with the correctness of the division algorithm with respect to a specification of division on the integer level. The second part is concerned with the correctness of the actual implementation, which is proven by checking several refinements of the algorithm. All the proofs have been mechanically checked with the Boyer-Moore theorem-proving system, in some cases making use of the interactive proof checker for the system.     

On inverse DEA model: The case of variable returns to scale

Lertworasirikul et al. (2011) proposed an inverse BCC model for the case of VRS. They used an MOLP model to assist them in the process of finding inputs. The proof of the main theorem contains considerable mistakes which invalidate the proof. Moreover, there are some ambiguities about the use of MOLP. The current article points out the drawbacks of Lertworasirikul et al. (2011) and then corrects the use of MOLP in a proposed inverse BCC model. This commentary continues with a revision of the aforementioned theorem with a valid proof. The proposed proof is entirely different from and simpler than Lertworasirikul et al’s. (2011). A numerical example illustrates the proposed models.