The problem of Dirichlet for anisotropic quasilinear degenerate elliptic equations

We consider the Dirichlet problem for a class of anisotropic degenerate elliptic equations. New a priori estimates for solutions and for the gradient of solutions are established. Based on these estimates sufficient conditions guaranteeing the solvability of the problem are formulated. The results are new even in the semilinear case when the principal part is the Laplace operator.     

Threshold electrical switching in As45Te55-xInx and As50Te50-xInx glasses

The electrical switching behaviour of As₄₅Te_55-xIn_x (5≤x≤15) and As₅₀Te_50-xIn_x (2.5≤x≤11.5) has been studied over a wide range of compositions. These glasses are found to exhibit threshold switching. The composition dependence of switching voltage (V_t) has been found to exhibit a change in slope and a local minimum at compositions x=10 and 12.5 for As₄₅Te_55-xIn_x and x=7.5 and 10.8 for As₅₀Te_50-xIn_x, respectively. The slope change in V_t verses x and the local minimum have been identified using two network topological effects, namely the rigidity percolation threshold and the chemical threshold. Received: 23 August 2001 / Accepted: 27 August 2001 / Published online: 11 February 2002     

一维无序体系电子跳跃导电研究

建立了电子隧穿电导模型,推导了一维无序体系新的直流电导公式.通过计算20000格点无序体系的直流电导率,分析了直流电导率和温度及外场电压的关系,讨论了无序度对直流电导的影响.计算结果表明,无序体系的直流电导率随无序度的增加而减小;外加电场较小时,电导率相对较大,且出现一系列峰值,电压较大时,电导率反而较小;无序体系在低温区出现了负微分电阻特性,电导率随温度的升高而增大,在高温区电导率随温度的升高而减小.计算结果和实验符合很好 关键词： 无序体系 电子隧穿 直流电导率     

进口畸变条件下改善压气机性能的数值研究

依据"非定常两代流型"理论,验证了二维叶栅在均匀进气条件下,施加激励对其性能所起的改善作用,尔后重点研究了进口具有总压的周向畸变时,施加激励对其气动性能的影响。计算结果表明,在有无进口畸变时,施加一定的激励都会改善流场结构,气动参数有积极变化,压升和效率增加,特别是在流量比较小时,变化尤为明显.对于进口畸变和施加激励影响压气机性能的内在原因,从流场结构的变化方面进行了初步分析。     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.     

Large Discrepancy In Homogenous Quasi-Arithmetic Progressions

We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and gives a better bound on the discrepancy.     

Optimality problem for infinite dimensional bilinear systems

For any finite dimensional control system with arbitrary cost, Pontryagin's Maximum Principle (PMP) [N. Bensalem, Localisation des courbes anormales et problème d'accessibilité sur un groupe de Lie hilbertien nilpotent de degré 2, Thèse de doctorat, Université de Savoie, 1998. [6]] gives necessary conditions for optimality of trajectories. In the infinite dimensional case, it is well known that these conditions are no more true in general. The purpose of this paper is to establish an “approached” version of PMP for infinite dimensional bilinear systems, with fixed final time and without constraints on the final state. Moreover, if the set of control is contained in a closed bounded convex subset with operators defining its dynamics are compact, or if it is contained in a finite dimensional space, we get an “exact” version of PMP. We also give two applications of these results. The first one deals with sub-Riemannian geometry on nilpotent Hilbertian Lie groups for which we can define a sub-Riemannian distance. The second one deals with heat equation for which we analyse the necessary conditions to give the optimal controls.     

TRANILAST ^1H^13CNMR谱分析及其结构的鉴定

本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定.     

Euler configurations and quasi-polynomial systems

Consider the problem of three point vortices (also called Helmholtz’ vortices) on a plane, with arbitrarily given vorticities. The interaction between vortices is proportional to 1/r, where r is the distance between two vortices. The problem has 2 equilateral and at most 3 collinear normalized relative equilibria. This 3 is the optimal upper bound. Our main result is that the above standard statements remain unchanged if we consider an interaction proportional to r ^b, for any b < 0. For 0 < b < 1, the optimal upper bound becomes 5. For positive vorticities and any b < 1, there are exactly 3 collinear normalized relative equilibria. The case b = −2 of this last statement is the well-known theorem due to Euler: in the Newtonian 3-body problem, for any choice of the 3 masses, there are 3 Euler configurations (also known as the 3 Euler points). These small upper bounds strengthen the belief of Kushnirenko and Khovanskii [18]: real varieties defined by simple systems should have a simple topology. We indicate some hard conjectures about the configurations of relative equilibrium and suggest they could be attacked within the quasi-polynomial framework.