“汉诺塔问题”初探

对“汉诺塔问题”的最少移动次数及实现最少移动次数的方案数量进行了研究,并证明了实现最少移动次数的方案是唯一的．     

整系数多项式不可约判别法

多项式在有理数域上可约的问题可以归结到整系数多项式能否分解成次数较低的整系数多项式的乘积的问题．Kronecker和Eisenstein分别给出了整系数多项式在有理数域上是否可约的判别方法，本文给出了另外一个判别整系数多项式不可约的判别法，对Eisenstein判别法予以补充．     

基于换乘次数最少的公交线路查询算法

在知道每条公交线上的站点的基础上,首先以换乘次数最少作为最优标准,当换乘次数相同时再以站．董数最少为最优标准,用集合的方法给出了任意两站点之间的最优公交线路的查询算法;并给出了,选择换乘次数多,但站点数少的公交线路的条件．     

关于Sikkema—Bernstein多项式导数的迭代极限

本首先给出了Sikkema-Bernstein多项式的迭代极限及误差估计；然后构造一个整系数Sikkema-Bernstein型多项式，并给出了该多项式的导数逼近导函数是有界变差时的收敛阶估计式。     

非线性常微分方程边值问题的数值近似

迭代亏量校正法常用于非线性常微分方程边值问题的数值求解，该方法可达到的最高精度受限于精确解的光滑性以及插值多项式的次数。本文通过对原迭代方法计算格式的改造，使改进的迭代亏量校正法的收敛阶显著提高。此外还讨论了该方法的收敛问题。数值实验结果表明，所给出的计算方法是十分有效的。     

例谈高等代数对初等代数的指导作用

利用矩阵的特征多项式给出了分式函数迭代式的一般计算公式，并结合此迭代式及因式分解等例说明高等代数对初等数具有一定的指导作用。     

求解下模集函数最大值问题的局部搜索算法

给出了求解具有简单约束的下模集函数最大值问题的一种局部搜索算法,并讨论了所给算法的性能保证．该算法的基本思想是：算法每次迭代总是在当前近似解集的邻域内,求出使目标函数取得最大的集合,将其作为新的近似解集．分析表明,所给算法是一种多项式时间近似算法．     

一个多项式正根的存在性

由于迭代的非线性性,许多关于多项式型迭代方程解的结果都是在一些比较复杂条件下得到的.针对多项式型迭代方程解存在性条件中的多项式进行了讨论,利用幂级数的性质给出此多项式正根存在的充分条件.     

代数基本定理的证明

文中的第一章“多项式”中给出了复数域上的一个重要定理——代数基本定理，但并没有给出定理的证明．我们将运用复变函数和近世代数的方法给出该定理的三种证明，来揭示数学定理证明方法的灵活性.     

关于"齐王赛马"对策的解

“齐王赛马”对策是矩阵对策中无纯策略意义解的典型例子．中给出了这个对策的一组解，但这个对策的最优策略并不是唯一的．本文给出“齐王赛马”对策解的普遍意义下的表达式，并对结论进行了简要分析．     

卡思卡特城堡

It is worthy of noting that, whilst Crookston Castle witnessed the earlier and happier portion of Mary's variegated life,     

Western and Eastern culture differences in commercial field

The communication of people partially is the communication of cultures. Culture has a direct effect on international commercial activities in all aspects. Different conceptions about time, space, equality, law and the like, lead people to deal with things in different ways. So to know cultures of the counterpart is to facil-itate our enterprises so as to have a smooth and successful communication in commercial activity.     

不同的吃喝玩乐

一、吃和喝吃苹果 eat an apple, 吃药 take medicine,吃糖 have some sweets,吃饭 have one's meals,吃馆子 dine out,吃惊 be surprised/     

漏洞百出的教育

Many college freshmen arrive woefully unprepared to do college work, and as disadvantaged populations continue to grow, the share of the American work force that has made it through college is expected to plummet. Many experts blame that educational failure not just on high schools but also on colleges. School & College, a special report by The Chronicle, looks at efforts to fix the system. What reforms would better prepare students for college? What should schools and colleges be doing differently? How should state and federal officials help?     

只要努力,不要后悔

There are numbers of crossroads on our long and unpredictable life journey where we totally have no idea about which direction to choose. No matter what our decision is, we should not turn back, but face the music and go ahead instead. I am this kind of girl who always does try without regretting, one example is how I dealt with my love.     

浅谈移民问题

Migration occurs behind a variety of reasons and has a great effect on the whole world. People may migrate in order to improve their economic situation, or in order to escape civil strife, persecution, and environmental disasters. The impact of migration is complex, bringing both benefits anddisadvantages. This paper briefly talks about the causes of migration, the allocation of benefits, and the ways in which individual countries and the international community deal with this important subject.     

风的曲线

Rosco and I wait for the fishermen to return.I sit at a wooden bench near the store at Mt.Baker Resort and watch the clouds change shape. Rosco has my belt around his neck and an eight foot tow chain hooked to a tree. Dogs must be on a leash. Ducks and rabbits are loose.     

团图为数的图中的闭团贯数

Given a graph G,a subgraph C is called a clique of G if C is a complete subgraph of G maximal under inclusion and |C|≥2. A clique-transversal set S of G is a set of vertices of G such that S meets all cliques of G. The clique-transversal number, denoted as TC (G), is the minimum cardinality of a clique-transversal set in G. The clique-graph of G, denoted as K (G), is the graph obtained by taking the cliques of G as vertices, and two vertices are adjacent if and only if the corresponding cliques in G have nonempty intersection. Let F be a class of graphs G such that F={G|K(G) is a tree}. In this paper the graphs in F having independent clique-transversal sets are shown and thus TC (G)/|G|≤1/2 for all G ∈ F.     

Sister Carrie, an Adherent of Desires

Sister Carrie is one of the most controversial characters in American literature.Thought as a "fallen woman" firstly,she was defined as a "new woman" by some critics later. However, by digging into the motivaton behind the whole process of Carrie's "success", the relationship between Carrie and her creator (the author), the social conditions of then American, it can be found that Carrie has never been free-standing on her thought and she has never found her real-sdf even after becoming a famous actress. In a society dominated by mass consumerism Carrie is only an adherent of her own desires. She also is a representative of all those country girls flooded into cities, a symbol and a sacrifice of the urbanization of America in a time countryside was overcome by cities.