共查询到20条相似文献,搜索用时 15 毫秒
1.
基于渐进启发式的《数据结构》线性表的教学 总被引:1,自引:0,他引:1
《数据结构》是计算机专业的核心专业课程,在专业课程体系中起着决定性的作用。其中的线性表是该课程的基石,学生在学习时普遍存在"三难"。从教和学的角度出发,按照渐进的方式采用启发式、实例演示式教学,探讨线性表的教学内容和教学过程,藉此帮助学生掌握该课程的学习方法、提高学习兴趣、提升学习效率。 相似文献
2.
3.
线性链表插入元素与删除元素算法的分析 总被引:1,自引:1,他引:0
从线性表的链式存储下元素的插入与删除的基本思想出发,分别给出了操作实现的算法思想。分析了算法思想的实现方法,以及具体实现的思路。把实践总结表达出来。还指出了这两个算法的相同点及它们之间存在的差异。最后,总结了算法的实现要点及实现思路。 相似文献
4.
5.
6.
7.
《国际计算机数学杂志》2012,89(6):665-670
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pair of nodes at distance 2 have different colors. Every graph has a radio coloring by simply assigning the odd integers 1,3, 5, @, but there is then a big difference between the smallest and largest colors. We define the span of a radio coloring of G as one plus the difference between the smallest and largest colors. We study radio colorings of a hypercube with the objective of finding such a coloring with minimum span. We develop a formulation for what we believe is the complete solution to this question in the form of a conjecture. 相似文献
8.
9.
《IEEE transactions on pattern analysis and machine intelligence》1987,(2):289-292
The problem of authentication of mutually suspicious parties is one that is becoming more and more important with the proliferation of distributed systems. In this paper we describe a protocol, based on the difficulty of finding discrete logarithms over finite fields, by which users can verify whether they have matching credentials without revealing their credentials to each other unless there is a match. This protocol requires a trusted third party, but does not require it to be available to the users except when they sign up for the system. Thus it is useful in situations in which a trusted third party exists but is not available to all users at all times. 相似文献
10.
11.
郑雪辰 《数码设计:surface》2010,(2):163-165
随着CG(Computer Graphics)技术的普及,CG原画成为许多绘画者的主攻方向。它的应用多在游戏和影视的概念设定中,以2D为主。在游戏中大量的人、物和场景设计都是通过CG原画完成的,用途十分之广。本文通过一些实践和总结,浅谈CG原画的色彩应用。 相似文献
12.
Coloring periodicities of two-dimensional mappings 总被引:6,自引:0,他引:6
We show how the parameter plane for two-dimensional mappings can be colored according to periodicity to reveal patterns of finite attracting orbits and chaos. 相似文献
13.
14.
John Cerella 《Pattern recognition》1977,9(2):65-68
Pigeons learn no more of the visual projections of a three dimensional object than of an abstract object. They lack the capacity to integrate the transformations of perspective. 相似文献
15.
A. I. Provotar 《Cybernetics and Systems Analysis》1997,33(2):155-161
16.
目前的动态查找表都是树结构,对于结点量很大的情况,其所需存储空间过大且查找效率低的缺点突出.对此.文章设计了一种新的动态查找表,将有序静态链表结构与结点群"逆序插入"算法相结合,相比树结构动态查找表有两个优势:1.所需存储空间小;2.结点群的结点数越多,则动态查找效率越高.该方法的要点是:先将已有结点用静态链表构造出一个有序表,简称"主表".若某"结点群"要插入该主表中,需将该结点群用静态链表构造成一个有序"副表",然后用逆序算法对副表中各结点查找其在主表中的插入点,并从对应的插入点与主表进行链接,最后将链接好的主表和副表一次性收集到一个新的静态链表中.类似的"逆序删除"也可以删除整个副表的结点. 相似文献
17.
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSatur algorithm for the classic Coloring Problem, a pruning criterion arising from equity constraints is proposed and analyzed. The good performance of the algorithm is shown through computational experiments over random and benchmark instances. 相似文献
18.
Ernst Althaus Stefan Canzar Khaled Elbassioni Andreas Karrenbauer Julián Mestre 《Algorithmica》2011,61(2):342-361
We consider the interval constrained coloring problem, which appears in the interpretation of experimental data in biochemistry. Monitoring hydrogen-deuterium exchange
rates via mass spectroscopy experiments is a method used to obtain information about protein tertiary structure. The output
of these experiments provides data about the exchange rate of residues in overlapping segments of the protein backbone. These
segments must be re-assembled in order to obtain a global picture of the protein structure. The interval constrained coloring problem is the mathematical abstraction of this re-assembly process. 相似文献
19.
In this paper we study the following NP-complete problem: given an interval graph G = (V,E) , find a node p -coloring such that the cost is minimal, where denotes a partition of V whose subsets are ordered by nonincreasing cardinality. We present an O(m
χ
(G) + n log n) time ε -approximate algorithm (ε < 2) to solve the problem, where n , m , and χ #(G) are the number of nodes of the interval graph, its number of cliques, and its chromatic number, respectively. The
algorithm is shown to solve the problem exactly on some classes of interval graphs, namely, the proper and the containment
interval graphs, and the intersection graphs of sets of ``short' intervals. The problem of determining the minimum number
of colors needed to achieve the minimum over all p -colorings of G is also addressed.
Received February 1, 1996; revised August 22, 1997. 相似文献
20.
为了给脉动生物反应器提供一个稳定可靠,且输出力量和工作行程可调的脉动源,设计并研制出一种新型直线电机;该电机采用动磁分体式结构,解决了该类电机输出力不平稳的问题,同时利用STC89C52为核心的控制模块,设计出正负脉冲变频电源,使脉动源输出压力达到160mmHg,输出流量达到100ml;经过反复的实验论证,此直线电机运行可靠,各项指标均已达到设计要求;与同类相比,该电机结构设计新颖,工作安全可靠,性价比高. 相似文献