电子信息工程专业课程体系中的计算机教育

随着社会经济的不断的快速的发展,电子信息工程行业需要更多的相关的运用型的人才,对于培养相关的人才的要求,本文对电子信息工程的专业的学生进行进一步的探究和培养,根据具体的对于学生的培养的目标已经相关的课程的指标体系和有关的教学的内容,重新整理和研究提出了相关的比较有价值的电子信息工程专业的课程设计。     

英文简历常用词汇

adaptable适应性强的active主动的，活跃的aggressive有进取心的amicable友好的analytical善于分析的apprehensive有理解力的aspiring有志气的，有抱负的audacious大胆的，有冒险精神的capable有能力的，有才能的careful办理仔细的competent能胜任的cooperative有合作精神的creative富创造力的dedicated有奉献精神的dependable可靠的diplomatic老练的，有策略的disciplined守纪律的dutiful尽职的well--educated受过良好教育的efficient有效率的energetic精力充沛的learned精通某门学问的logical条理分明的methodical有方法的modest谦虚的pun…     

新时期信息技术教学范畴内EXCEL多维引用的应用方法研究

EXCEL的多维引用的技术是新时期的信息技术的教学的重要部分,对EXCEL的技术的原理和应用对策的深层次的研究是非常有意义的。而多维的引用技能也是EXCEL中的实际运用的范围,并且拥有很高的引用价值。本文就新时期的信息技术的教学范畴内EXCEL多维引用的应用方法进行研究。     

基于面向服务的架构的信息安全应用研究

在面向服务的架构的环境下,传统的安全机制已经不能满足面向服务的架构环境下的应用系统的安全需求,怎样在不使面向服务的架构的松耦合、高伸缩性优势受到影响的同时,研究出在面向服务的架构下的信息安全实现模型,从而满足面向服务的架构下的应用系统的安全需求,是当前亟待解决的问题.因此,本文进行了基于面向服务的架构的信息安全应用研究.     

1001计算机的运算速度及其匹配问题

通常人们所说的计算机的运算速度,一般是指的平均运算速度。它是指计算机平均每秒钟可执行的指令条数。在计算平均运算速度时,要涉及到计算机执行的程序中各种指令的比例,因为不同的指令的执行速度是不一样的。不同类型的程序所用的指令种类的比例是不同的,所以计算出来的运算速度也是大不相同的。     

高职高专学校计算机专业计算机应用能力培养模式探讨

伴随社会不断的进步,现在的社会对像高职高专这种类型的学校的计算机专业毕业生计算机的应用能力的要求变的更高,今天对高职高专类型学校的计算机专业的毕业生水平及质量重要的标尺之一就是计算机的应用能力强弱以及计算机的技术水平高低.此文将对怎样提升高职高专的计算机专业的学生计算机方面的应用能力展开讨论.     

浅谈计算机数据挖掘

随着经济的高速发展,我们的社会进入了网络信息的时代,产生了数以万计的数据。在这些各色各样的数据背后隐藏着大量的信息。怎样从这些不同的数据中找出规律,发现对我们的生活有帮助的信息,这一问题,越来越多的受到人们的关注。而我们所讲的数据挖掘就是从大量的,不完全的,有各种声音的,模糊不清的,随机的实际应用数据中,提纯隐含在最里面的,人们原先并不清楚的,但是又是潜藏且有用信息和知识的过程。数据挖掘的技术其目的就是应对当今社会信息的爆炸,为大量信息的处理提供了科学和行之有效的手段。     

一种新的删除HB(κ)树的结点的算法

Foster的删除HB(κ)树的结点的算法的主要思想是先删除结点再自下而上处理某些子树,涉及自下而上的后退.提出一种新的删除HB(κ)树的结点的算法,其主要思想是先自上而下处理某些子树再删除结点,不涉及自下而上的后退.举例说明新算法的执行过程.证明新算法是正确的.与Foster的删除HB(κ)树的结点的算法相比,新算法不涉及辅助栈的使用.设n是HB(κ)树的结点的个数.新算法的时间复杂性是0(log2n),与Foster的删除HB(κ)树的结点的算法的相同.实验结果表明新算法的平均执行对间比Foster的删除HB(κ)树的结点的算法短.新算法的空间复杂性是O(1),比Foster的删除HB(κ)树的结点的算法低.     

硬派圈子

不论是立着的、躺着的、壁挂的、手提的,也不论是圆的亦或方的,总之,简单代替复杂,将会变成时尚,正如“最高效的管理即是最简单的管理”、“真正的道理是最朴实的道理”一样,简洁的外观、简单的造型,体现的是设计师真正的水平。     

基于语料库与层次词典的自动文摘研究

自动文摘研究作为自然语言处理研究的一个重要且实用的分支,目前逐渐成为Internet信息检索等应用领域的重要研究课题之一.该文提出的基于语料库的文摘试图将传统的基地语言学分析的文摘方法和基于统计的文摘方法的优点结合在一起.基于语料库的文摘方法的实质即以系统外的分析代价换取系统内的算法效率.该文描述的算法给出了基于层次词典的关键字提取和基于语料库的自动文摘的实现.     

REPORT ON THE DECIPHERMENT OF THE AMERICAN STRIP CIPHER 0–2 BY THE GERMAN FOREIGN OFFICE

This paper presents a new attack on a block cipher, which is stronger than all previously considered attacks. This “chosen-key attack” is a generalization of the well accepted chosen-text attack. We give an example of a block cipher which is strong under a chosen-text attack, but immediately vulnerable to a chosen-key attack. A general chosen-key attack breaks an n bit key cipher in 2 ^n/2 operations. A black-box argument shows that this is the best possible for general attacks.     

对Chen等人电子选举方案的密码学分析和修正

摘要2004年,Chen等人提出一个安全的匿名网络选举方案。指出Chen等人给出的方案是不安全的;另外,给出一个满足电子选举安全要求的修正方案。     

Comment on “A strong provably secure IBE scheme without bilinear map” by M. Zheng,Y. Xiang and H. Zhou [J. Comput. Syst. Sci. 81 (2015) 125–131]

Zheng, Xiang and Zhou published in Journal of Computer and System Sciences in 2015 a “strong provably secure IBE scheme without bilinear map”. In this note, we provide two very simple attacks on their scheme.     

FURTHER NOTES FOR A SELF-STUDY COURSE IN BLOCK-CIPHER CRYPTANALYSIS

To every aspiring cryptanalyst, especially those just starting to study cryptanalysis, there is no standard textbook to refer. A year ago, the existing literature on block-cipher cryptanalysis was organized in a self-study course in a way that could help students learn cryptanalysis step by step. [5] Since then, various new cryptanalytic methods have sprung up and have been added to the cryptanalytic literature. This paper attempts to acquaint the student with the new cryptanalytic methods and serve as further notes to the course in block-cipher cryptanalysis.     

A SELF-STUDY COURSE IN BLOCK-CIPHER CRYPTANALYSIS

Studying cryptanalysis is difficult because there is no standard textbook, and no way of knowing which cryptanalytic problems are suitable for different levels of students. This paper attempts to organize the existing literature of block-cipher cryptanalysis in a way that students can use to learn cryptanalytic techniques and ways to break new algorithms.     

Cryptanalysis of two three-party encrypted key exchange protocols

Due to the simplicity of maintaining human memorable passwords without any assistant storage device, password-based three-party encrypted key exchange (3PEKE) protocol has become one of the most promising research fields on user authentication and secure communication. In 2008, Chen et al. and Yoon and Yoo both pointed that Chang and Chang's password-based 3PEKE scheme cannot resist against undetectable on-line password guessing attacks, and then respectively proposed an improved protocol to eliminate the security vulnerability. However, based on the security analyses conducted by us, we find that both of their protocols are still vulnerable against undetectable on-line password guessing attacks. Accordingly, we develop a novel 3PEKE protocol to remedy these authentication flaws. Moreover, our proposed protocol can achieve better performance efficiency by requiring only four message transmission rounds. In conclusion, we can claim that our proposed 3PEKE protocol is more secure and efficient in comparison with the protocols proposed by Chen et al. and Yoon and Yoo.     

Security of Wang et al.''s group-oriented (t,n) threshold signature schemes with traceable signers

This paper describes a new forgery attack on the group-oriented (t,n) threshold signature schemes proposed by Wang et al. Our attack is more fundamental than Tseng–Jan's attack in the sense that it cannot be recognized or blocked at the designated clerk level of the signature schemes.     

Cryptanalysis of Liaw''s broadcasting Cryptosystem

In 1999, Liaw proposed a new broadcasting cryptosystem, which requires smaller bandwidth as compared to the previously proposed broadcasting cryptosystems. However, this article will show that the proposed system is insecure enough by presenting a conspiracy attack on it. We will also point out some ambiguous problems in Liaw's paper. Moreover, we propose an improved broadcasting cryptosystem, which is a slight modification of the proposed system to overcome the conspiracy attack.     

Attack on a concast signature scheme

Al-Ibrahim, Ghodosi and Pieprzyk proposed several methods of batch signature verification suitable for concast communication. These schemes are all based on El-Gamal-type signature schemes. We prove that their preferred scheme, which does not require interaction among the various signers, is insecure.     

Breaking the Shin-Shin-Rhee remotely keyed encryption schemes

Remotely keyed encryption (RKE) schemes provide fast symmetric encryption and decryption using a small-bandwidth security module and a powerful host. Such schemes keep the key inside the security module to prevent key compromise.Shin, Shin, and Rhee proposed a length-preserving as well as a length-increasing RKE scheme that both use only a single round of interaction between host and security module. With the length-preserving scheme they claim to answer an open problem of Blaze, Feigenbaum, and Naor.However, in the present paper we show that both their schemes are completely insecure. Further, we present heuristic arguments on why a one-round length-preserving RKE scheme might be impossible.