颗粒物质的两个典型效应及其研究现状的分析

概述了颗粒物质领域中粮仓现象和巴西坚果效应两个典型现象及其解释理论，分析其理论的成功和不足之处，并给出了一些看法。     

用力敏传感器测量乙醇水溶液的表面张力系数与浓度的关系

用硅压阻式力敏传感器测量了纯水、乙醇的表面张力系数，并测量了不同浓度的乙醇水溶液的表面张力系数，得到了乙醇水溶液的表面张力系数随浓度的变化曲线．     

高维非线性系统边值问题的奇摄动

利用渐近方法和对角化技巧研究了伴有边界摄动的高维非线性系统边值问题的奇摄动，在适当的假设下，证得摄动问题解的存在并导出其解关于ε的高阶近似．     

关于序列覆盖s映射

本文定义了两类序列覆盖映射，讨论了度晴空间的序列覆盖ｓ映象，特别地，我们证明了空间Ｘ具有点可数弱当且仅当Ｘ是度量空间的１序列覆盖的商ｓ映象，这回答了１９７０年Ｔ．Ｈｏｓｈｉｎａ提出了一个问题。     

液滴的脉动雾化

应用稳定性分析,本文显示一球形液滴可以由参数共振而促使形成比原液滴直径小得多的小微滴。表面张力和周围气体的密度将延缓这一雾化过程。与达朗伯表观体力有关的两重迭平面流体层的界面不稳定性与参数共振引起的界面不稳定性有着密切的关系。     

A relaxed primal-dual path-following algorithm for linear programming

In this paper, we provide an easily satisfied relaxation condition for the primaldual interior path-following algorithm to solve linear programming problems. It is shown that the relaxed algorithm preserves the property of polynomial-time convergence. The computational results obtained by implementing two versions of the relaxed algorithm with slight modifications clearly demonstrate the potential in reducing computational efforts.Partially supported by the North Carolina Supercomputing Center, the 1993 Cray Research Award, and a National Science Council Research Grant of the Republic of China.     

Finding an efficient solution to linear bilevel programming problem: An effective approach

Multilevel programming is developed to solve the decentralized problem in which decision makers (DMs) are often arranged within a hierarchical administrative structure. The linear bilevel programming (BLP) problem, i.e., a special case of multilevel programming problems with a two level structure, is a set of nested linear optimization problems over polyhedral set of constraints. Two DMs are located at the different hierarchical levels, both controlling one set of decision variables independently, with different and perhaps conflicting objective functions. One of the interesting features of the linear BLP problem is that its solution may not be Paretooptimal. There may exist a feasible solution where one or both levels may increase their objective values without decreasing the objective value of any level. The result from such a system may be economically inadmissible. If the decision makers of the two levels are willing to find an efficient compromise solution, we propose a solution procedure which can generate effcient solutions, without finding the optimal solution in advance. When the near-optimal solution of the BLP problem is used as the reference point for finding the efficient solution, the result can be easily found during the decision process.     

A finiteness theorem for maximal independent sets

Denote bymi(G) the number of maximal independent sets ofG. This paper studies the setS(k) of all graphsG withmi(G) = k and without isolated vertices (exceptG K ₁) or duplicated vertices. We determineS(1), S(2), andS(3) and prove that |V(G)| 2 ^k–1 +k – 2 for anyG inS(k) andk 2; consequently,S(k) is finite for anyk. Supported in part by the National Science Council under grant NSC 83-0208-M009-050