Chemisorption at interfaces between organic semiconductors and metals: role of the electron affinity

Chemisorption is a well-known phenomenon for many interfaces between organic semiconductors and metals. It is shown that many published data indicate that the occurrence of chemisorption can be rationalized upon the consideration of the metal work function versus the electron affinity of the organic semiconductor.     

Synthesis of thieno[2,3-d]pyrimidine and quinazoline derivatives from monothiooxamides

A method for syntheses of previously unknown derivatives of thieno[2,3-d]pyrimidines and quinazolines from monothiooxamides was proposed.     

A Mössbauer and Electrochemical Characterization of the Corrosion Products Formed from Marine and Marine-Antartic Environments

Hyperfine Interactions - Corrosion products formed on low alloy steel under two marine environments are characterised. Both environments are classified as C4 according to the ISO 9223 Standard. The...     

放射性9C束流不同贯穿深度上的线能谱测量

为阐述放射性⁹C束流应用于治癌的物理基础, 运用一个球形生物组织等效正比计数器测量了⁹C束流不同贯穿深度上的线能谱, 得到了沿束流贯穿深度上的剂量平均线能分布. 将实验测量得到的线能谱转换成为不同传能线密度在吸收剂量中所占份额的分布, 得到了该⁹C束流在不同贯穿深度上的剂量平均传能线密度分布. 将生物组织等效正比计数器测量得到的与先前通过平行板正比计数器测量得到的该⁹C束流的剂量平均传能线密度分布进行比较, 发现: 在束流入射通道上, 两者测量数据符合很好, 而在束流Bragg峰附近⁹C离子的沉积区域, 由组织等效正比计数器测量得到的剂量平均传能线密度值大于由平行板正比计数器测量得到的值.     

Poincaré-Hopf inequalities

In this article the main theorem establishes the necessity and sufficiency of the Poincaré-Hopf inequalities in order for the Morse inequalities to hold. The convex hull of the collection of all Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data determines a Morse polytope defined on the nonnegative orthant. Using results from network flow theory, a scheme is provided for constructing all possible Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data. Geometrical properties of this polytope are described.

     

On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences

We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of times, the k-level has subquadratic (O(n^2-1/2s) complexity. This answers one of the main open problems from the author’s previous paper [DCG 29, 375-393 (2003)], which provided a weaker upper bound for a restricted class of curves only (graphs of degree-s polynomials). When combined with existing tools (cutting curves, sampling, etc.), the new idea generates a slew of improved k-level results for most of the curve families studied earlier, including a near-O(n^3/2 bound for parabolas.     

Structuring Multi-attribute Value Hierarchies

The first stage in a multi-attribute value analysis is the development of a hierarchical structure of the attributes of the problem. This paper reports the process of developing such a structure for the problem of choosing a suitable mode of transport for radioactive waste. The initial hierarchy of attributes went through several stages of development as new insights emerged about the nature of the problem. Some of the reasons behind this restructuring are discussed, and several important questions about the structuring process are formulated.     

Synthesis of alkylindoles (review)

Methods for obtaining alkylindoles, excluding the Fischer synthesis and direct alkylation, developed during the last 15 years are correlated.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 9, pp. 1155–1172, September, 1987.     

A trust region method for solving the decentralized static output feedback design problem

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents anO(n ²) time sequential algorithm and anO(n ²/p+logn) time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, wherep andn represent respectively the number of processors and the number of vertices of the circular-arc graph.