课程文献中心 更多>>

关键词： 信息与计算科学   数据结构   专题学习  

摘要： 结合信息与计算科学专业设置,本文分析了数据结构课程教学现状,从整合教学内容、设置教学梯度和完善教学手段等方面进行研究与探索.本课题针对交叉学科的特点强调学以致用和知识的融会贯通,搭建了开放的专题学习平台,提高了学生的自主学习和研究能力,初步取得了较好的教学效果,为数据结构课程的教学改革提供了参考.

关键词： 《数据结构》课程   体验式教学模式   教学目标   应用  

摘要： 体验式教学模式在具体课堂教学中的应用具有重要的现实意义，不仅利于激发学生对课堂学习的兴趣，而且还利于引导学生通过体验操作来获得教学知识。在大学计算机教学中，《数据结构》是一门必不可少的专业基础课程，学习数据结构知识为大学生后续的计算机专业学习能够奠定良好的基础。本文将从构建《数据结构》课程的体验式教学目标入手，研究体验式教学模式在《数据结构》课程教学中的具体应用。

关键词： Data Structures   String Searching   Retrieval   Top-k  

摘要： Let D = {d_1, d_2,...} be a collection of string documents of n characters in total, which are drawn from an alphabet set Sigma =[sigma] ={1,2,3,... sigma}. The top-k document retrieval problem is to maintain D as a data structure, such that when ever a query Q=(P, k) comes, we can report (the identifiers of) those k documents that are most relevant to the pattern P (of p characters). The relevance of a document d_r with respect to a pattern P is captured by score(P, d_r), which can be any function of the set of locations where P occurs in d_r. Finding the most relevant documents to the user query is the central task of any web-search engine. In the case of web-data, the documents can be demarcated along word boundaries. All the search engines use inverted index as the back-bone data structure. For each word occurring in the document collection, the inverted index stores the list of documents where it appears. It is often augmented with relevance score and/or positional information. However, when data consists of strings (e. g., in bioinformatics or Asian language texts), there are no word demarcation boundaries and the queries are arbitrary substrings instead of being proper valid words. In this case, string data structures have to be used and central approach is to use suffix tree (or string B-tree) with appropriate augmenting data structures. The work by Hon, Shah and Vitter [FOCS 2009], and Navarro and Nekrich [SODA 2012] resulted in a linear space data structure with optimal O(p+k) query time solution for this problem. This was based on geometric interpretation of the query. We extend this central problem, in two important areas of massive data sets. First, we consider an external memory disk based index, where we give near optimal results. Next, we consider compression aspects of data structure, reducing the storage space. This is central goal of the active research field of succinct data structures. We present several results, which improve upon several previ

关键词： Discrete black hole   holographic principle   Komar mass   light sheet   "it from bit"  

摘要： Rather than tiling the black hole horizon by Planck area patches, we suggest that bits of information inhabit, universally and holographically, the entire black core interior, a bit per a light sheet unit interval of order Planck area difference. The number of distinguishable (tagged by a binary code) configurations, counted within the context of a discrete holographic shell model, is given by the Catalan series. The area entropy formula is recovered, including Cardy's universal logarithmic correction, and the equipartition of mass per degree of freedom is proven. The black hole information storage resembles, in the count procedure, the so-called stack data structure.

摘要： Software systems are now pervasive throughout our world. The re- liability of these systems is an urgent necessity. A large degree of research effort on increasing software reliability is dedicated to requirements, architec- ture, design, implementation and testing-activities that are performed before system deployment. While such approaches have become substantially more advanced, software remains buggy and failures remain expensive. We take a radically different approach to reliability from previous ap- proaches, namely contract-driven data structure repair for runtime error recov- ery, where erroneous executions of deployed software are corrected on-the-fly using rich behavioral contracts. Our key insight is to transform the software contract-which gives a high level description of the expected behavior-to an efficient implementation which repairs the erroneous data structures in the program state upon an error. To improve efficiency, scalability, and effective- ness of repair, in addition to rich behavioral contracts, we leverage the current erroneous state, dynamic behavior of the program, as well as repair history and abstraction. A core technical problem our approach to repair addresses is construc- tion of structurally complex data that satisfy desired properties. We present a novel structure generation technique based on dynamic programming-a clas- sic optimization approach-to utilize the recursive nature of the structures. We use our technique for constraint-based testing. It provides better scala- bility than previous work. We applied it to test widely-used web browsers and found some known and unknown bugs. Our use of dynamic programming in structure generation opens a new future direction to tackle the scalability problem of data structure repair. This research advances our ability to develop correct programs. For programs that already have contracts, error recovery using our approach can come at a low cost. The same contracts can be used for systematic

关键词： 考核机制   学位课程   教学改革   教学质量   能力素质评价体系  

摘要： 《数据结构》这门课程是计算机科学专业中难得系数极高的一门核心课程,学生普遍认为难学、难懂、难理解,对数据结构中提出的抽象算法和设计思想不易消化,更谈不上灵活应用。为此我院提出改革数据结构的考核机制,由此推进教学的改革,让学生从枯燥的理论学习中解脱出来,由用促进有针对性的学习,由学习提高应用效率,最后达学用双赢。

关键词： Local Alignment   Graph Structure   Label Function   Adjacency Edge   Genome Alignment  

摘要： Background: Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference. Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment. Results: We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures. Conclusion: We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools.

关键词： CDIO理念   数据结构教学模式   创新思考   实践  

摘要： 数据结构教学课程中，具有内容专业性强、算法较为抽象、生涩难懂等特点，经过不断的研究，提出了基于CDIO理念下的教学模式，改变了传统的数据结构教学方式，采用多元化的创新理论，将数据结构理论与实践有机的结合，降低了学生学习的难度。本文就对CDIO理念进行介绍，并探讨基于CDIO理念下数据结构教学创新模式的启示与具体措施。

关键词： 都市电影   结构模型   电影票房   内地城市   产业分析   中国   华语   个体体验  

摘要： 陈犀禾教授和程功将“新都市电影”定义为：“近年来，以表现现代都市青年生活为主题、以表达他们的情感与趣味为宗旨、并以他们构成市场和票房主体的中小成本影片”，认为这些影片“在主题和风格上与之前的都市电影相比，有着明显的差别，更加重视个体的都市体验。这种体验区别于‘都市一代’边缘化的个体体验，转向了类型化和商业化的表达”，

关键词： 行为导向教学法   大脑风暴式教学   项目驱动式教学  

摘要： 从多年数据结构课程的教学实践中发现,以教师为主体的传统教学模式发挥的作用越来越不明显.为了提高教学效果,以我院11级学生为对象,将行为导向教学法应用在数据结构教学中,综合使用该教学法中的三种教学模式,即大脑风暴式教学、项目驱动式教学、案例研究式教学,最终在学生能力和成绩方面,收到了良好的效果.