Under the guidance of OBE concept,a set of programming ability enhancement scheme and an evaluable ability assessment system are constructed based on the actual needs of enterprises and a project-driven teaching mode,while taking into account the specific characteristics of programming courses.In practice,a variety of teaching and practical methods are combined,and a systematic learning module is designed to develop software technical talents with the aim of mastering programming skills and improving programming ability,the scheme combined with the teacher-student inheritance method and designed a systematic course learning module.It is expected to implement the concept of"student-centered,output-oriented,continuous improvement"in the implementation process,and the software technical talents can meet the needs of enterprises and society.

Attribute-based encryption (ABE) is a technique used to encrypt data, it has the flexibility of access control, high security, and resistance to collusion attacks, and especially it is used in cloud security protection. However, a large number of bilinear mappings are used in ABE, and the calculation of bilinear pairing is time-consuming. So there is the problem of low efficiency. On the other hand, the decryption key is not uniquely associated with personal identification information, if the decryption key is maliciously sold, ABE is unable to achieve accountability for the user. In practical applications, shared message requires hierarchical sharing in most cases, in this paper, we present a message security hierarchy ABE scheme for this scenario. Firstly, attributes were grouped and weighted according to the importance of attributes, and then an access structure based on a threshold tree was constructed according to attribute weight. This method saved the computing time for decryption while ensuring security and on-demand access to information for users. In addition, with the help of computing power in the cloud, two-step decryption was used to complete the access, which relieved the computing and storage burden on the client side. Finally, we simulated and tested the scheme based on CP-ABE, and selected different security levels to test its performance. The security proof and the experimental simulation result show that the proposed scheme has high efficiency and good performance, and the solution implements hierarchical access to the shared message.

以培养目标作为导向,逐步完善课程体系,通过多维度达成度评价机制,对课程达成度、指标点达成度和毕业要求达成度进行客观评价,寻找需要改进的突破点,进而提出具体方案和改进措施,把持续改进的理念应用于工程教育专业认证的实践中,形成"以学生为中心、以学习产出为导向"的教学设计、教学实施以及教学评价.调查结果表明,持续性改进措施有效地提升了学生各方面的能力,使其得到了用人单位的认可,达到了工程教育专业认证的目的.

In order to protect the sensitive data represented as XML documents in a trusted collaborative system where sensitive data are not shared, an XML privacy-preserving data disclosure decision scheme was proposed under the assumption of a trusted server. This scheme is inspired by the idea of separating storage structure and content. Temporary access matrix is used to represent structure authorization and the vector represents the content authorization of leaf node. According to the conversion rules, access matrix not only represents access authorization of all nodes but also keeps the main structure of the XML document. With the combination of the vector and matrix, it can provide different access views for different group users with different purposes. In addition, start-end encoding is used to encode all the nodes for locating nodes and the content; privilege matrix solves the problem of privacy synchronization change for all users. At the same time, authentication polynomials are used to verify different users and improve the security level. The experimental results show that the scheme not only effectively protects XML sensitive data but also reduces the storage pressure on the server side; at the same time, from the response time, we know that it is beneficial for the rapid search and information positioning.

对电子文件完整性检查的方法进行了研究.电子文件完整性检查主要是关注某个文件是否被更改.利用信息摘要函数强有力的加密机制,识别文件发生的微小变化,只要是入侵者成功的攻击导致文件任何改变,都能被电子文件完整性检测系统发现,从而保证了对电子文件的完整性检查.文章介绍了CRC32、MD5、SHA-1算法的C语言实现.

With XML becoming a promising standard for data storage, describing, transferring and exchanging information on the Internet, data security and privacy protection of XML become the focus of research in recent years. In order to achieve the authorization of legitimate user and ensure the secure access to sensitive information, in this paper, in the context of cloud storage, with the purpose of sharing sensitive XML information, a polynomial authorization scheme with Kerberos authentication was proposed, which was based on the users' access purpose and privacy policy. In this scheme, first, Kerberos authentication was used to identify the user, and then the polynomial whose coefficients were from the leaf node address was used to complete the authorization of user. For the legitimate user, under the interaction of authorization polynomials and the global structure view, authorization matrix is generated dynamically, its temporary and dynamic characteristics greatly improves the security of the system. Finally, with the help of authorization matrix and auxiliary information tables, security queries were successfully completed. The experimental results show that the scheme not only effectively protects XML sensitive data, but also reduces the server's storage pressure, at the same time it is beneficial to the rapid search and information positioning.

专利信息作为目前国际知识产权中科技含量最高的存在,是国家和企业获取竞争优势最全面的技术情报来源.使用专利数据网的数据信息作为测试数据,采用K-means算法,针对专利文本数据进行聚类分析,旨在找出隐含在专利数据信息中不容易被直观发现或直接统计得出的数据情报信息.通过深入挖掘专利信息,提高专利信息利用率,使之转换为具有实际价值的情报信息,有效解决了对专利信息利用不足的问题.

近年来,随着科技的日益进步与发展,各种技术成果层出不穷,而专利信息资源几乎涵盖了所有的应用领域,成为人类取之不尽的知识宝库.基于此,笔者以寻求医药领域的专利数据中隐藏的关联信息为研究目标,通过网络爬虫技术获取原始测试数据,采用Apriori算法针对专利数据的IPC号进行关联分析.实验结果表明:Apriori算法挖掘出了专利IPC号之间的关联性,为动物医药领域的研究人员提供了方便.

Owing to the increasing of XML data on the web, the security search for a shared XML document in the cloud becomes a central issue in the database and information retrieval. In this paper, a new authorization and trusted query method is proposed to finish the security search for big data, which uses index vector to represent the authorization of content and uses the triangular matrix to represent XML’s structure. It not only provides the authorization of content but also considers the structure information. At the same time, query vector is created based on query keywords in order to improve the speed of search, and with the help of triangular matrix and authorization index, which also can efficiently speed up the process of search. Experiment shows that this method has good performance in security search for big data.

In applied undergraduate colleges and universities, good programming ability and engineering practice ability are the key factors to measure the quality of personnel training, and also one of the qualities that employers prefer. In this paper, project-based teaching is used as the major means, which integrated with the students' help as the assisted teaching, and it is explored in the actual programming courses. The practical results show that the project-based teaching has a good effect, arouses the students' enthusiasm for learning, improves the students' many skills, and achieves the teaching goal for the professional course. In the long run, this model has a profound influence on the subject and object of teaching, and on the further reform of teaching mode. Abstract: In view of the problems existing in the teaching of computer basic courses for no-computermajor in colleges and universities, this paper expounds the necessity of classified and hierarchical teaching reform in basic computer courses, and introduces the classified and hierarchical teaching knowledge module, the diversified teaching model and the comprehensive evaluation method.

为了提高入侵检测系统的检测精度,增加检测率及降低误报率,将随机森林算法引入到入侵检测系统中,提出了一种对随机森林的优化方法.该算法经各种降维处理及参数优化,最后应用于入侵检测模型中.经过多种数据集测试后的实验结果表明,相比于传统的入侵检测模型,引入随机森林算法后的模型,系统检测率最高提至95.2％,误报率最低降至2％以下,较好地提高了入侵检测系统的精度.

In the process of engineering applications, we often use a large number of vertices and edges to represent the complex system model, but sometimes the model is so complex that it is impossible to draw the graph neatly and beautifully by hand. So how to draw the graph automatically using the computer and how to make the graph visual become an important research topic. Based on the study on the genetic algorithm, SHLA algorithm and FR algorithm, we implement these algorithms by analyzing the pseudo-codes. Especially we focus on the study of the source programming about FR-boost and then implement an improved FR algorithm that selects XML document as the input and output graph files. It can effectively reduce the complexity of algorithm and increase the point-line graph's visualization.

以完成对杂乱无章的XML文档进行自动分类为目的,提出了一种基于下三角矩阵的XML文档表示方法,经过数学建模后,XML文档间的相似度比较问题转换成了矩阵之间的相似度计算.为了验证其执行效果,在采用该算法进行相似度计算的基础上,运用最近邻分类算法对XML测试文档集进行自动分类.实验结果表明,这种基于矩阵存储的XML相似度计算方法应用于分类中效果良好.

针对传统随机森林算法不能有效、快速地处理海量高维数据,导致分类效果不理想的问题,以提高分类准确率和运行效率为目的,提出了一种基于Hadoop平台的分布式可扩展随机森林算法。该算法采用基于袋外数据集测试准确率变化的特征选择算法,在分布式平台上使用MapReduce构建随机森林,然后通过改变袋外数据的每一列特征获取每一棵决策树对应的特征重要性度量及权重,运用两者的加权求和求得特征重要性排序,其中决策树的权重取决于决策树与集体随机森林预测的一致性。最后,在特征重要性排序的基础上引入了一定的随机性,确保了每棵树的强度,又减少了树与树间的相关性。实验结果表明,相比于传统单机模式下的随机森林特征选择算法,该算法在分类的准确性和运行效率上效果良好。

文章从当前信息化进程不断加快,以及应用愈加广泛的背景出发,以信息工程专业综合实训为例,从综合实训的必要性、内容和具体的实施细节等方面,进一步说明了综合实训课程的重要性,并重点探讨了综合实训的具体实施策略.

In order to better protect the data in XML document, a novel method is presented for the XML (eXtensible Markup language) tree structure, which is based on Shamir's secret sharing about polynomial interpolation. In this paper, according to purpose-based access control we establish different structure views for different users, and then pick out the address of leaf nodes' content in structure view as the coefficient in polynomial. The modified theory of secret sharing is adopted to accomplish the security protection for XML. To evaluate this model, experiments were conducted to measure its performance.

Proxy signature schemes have been suggested for use in a number of applications, so the security of proxy signature scheme is more and more important.However, at present, almost all the proxy signature schemas were proven secure in the random oracle model, which has received a lot of criticism.Recently, Yu et al. proposed a designated verifier proxy signature scheme without random oracles by using Waters hashing technique.The formal models and a strictly logical process were provided in this schema.But Kang et al. show some attacks on Yu et al.s scheme and offer its insecurity proof.In this paper, in order to overcome the weaknesses in Yu et al.s scheme we make supplements on it and make it secure resist Kang et al.s attacks.

以培养新一代创新人才为目标、提高实践性教学质量为核心，总结了目前实践性教学中存在的不足；结合学院自身的实际情况，提供了促进实践性教学的具体方案；同时借助于督导监管及校企合作机制，大力地促进学生的创新和实践能力，对高校实践性教学改革有一定的借鉴作用。

With eXtensible Markup Language (XML) becoming a ubiquitous language for data storage and transmission in various domains, effectively safeguarding the XML document containing sensitive information is a critical issue. In this study, the authors propose a new access control model with filtering privacy. Based on the idea of separating the structure and content of the XML document, they provide a method to extract the main structure of the XML document and use matrix to save the structure information, at the same time, the start-end region encoding is used to combine the corresponding structure and content skillfully. These not only save the storage space but also efficiently speed up the search and make it convenient to find the relevant elements, especially the finding of the related content. In order to evaluate the security and efficiency of this model, the security analysis and simulation experiment verify its performance in this work.

To facilitate the structure inquiry for XML documents and quickly determine the ancestor-descendant,parent-child,sibling relationship of any two nodes,a new dynamic labeling scheme for XML documents is proposed.The ring-shaped structure is used to organize the sibling nodes by referencing the idea of the prefix group labeling scheme and encode self label in alphabetical order method.The problems of high cost and low efficiency of the existing labeling scheme for XML documents are improved,and the dynamically updating is realized.The labels of existing nodes needn't to label again,and the aforementioned three basic relationships of any two nodes can be accurately determined in constant time.The experimental result proves that:the XML tree's fan-out degree and depth have less influence on the size of encoding space using this scheme;the scheme supports the full dynamically updating and the coding efficiency is the best for the XML documents with high fan-out degree;the scheme has good performance in both the static coding and the dynamic updating.