Separable anisotropic differential operators and applications

The nonlocal boundary value problems for anisotropic partial differential-operator equations with a dependent coefficients are studied. The principal parts of the appropriate generated differential operators are nonself-adjoint. Several conditions for the maximal regularity and the fredholmness in Banach-valued Lp-spaces of these problems are given. These results permit us to establish that the inverse of corresponding differential operators belongs to Schatten q-class. Some spectral properties of the operators are investigated. In applications, the nonlocal BVP's for quasielliptic partial differential equations and for systems of quasielliptic equations on cylindrical domain are studied.     

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive in practice. Encouraging computational results are presented for large-scale problems. The author thanks the Associate Editor and an anonymous referee for their helpful comments.     

A sequence and structural study of transmembrane helices

A comparison is made between the distribution of residue preferences, three dimensional nearest neighbour contacts, preferred rotamers, helix-helix crossover angles and peptide bond angles in three sets of proteins: a non-redundant set of accurately determined globular protein structures, a set of four-helix bundle structures and a set of membrane protein structures. Residue preferences for the latter two sets may reflect overall helix stabilising propensities but may also highlight differences arising out of the contrasting nature of the solvent environments in these two cases. The results bear out the expectation that there may be differences between residue type preferences in membrane proteins and in water soluble globular proteins. For example, the -branched residue types valine and isoleucine are considerably more frequently encountered in membrane helices. Likewise, glycine and proline, residue types normally associated with `helix-breaking' propensity are found to be relatively more common in membrane helices. Three dimensional nearest neighbour contacts along the helix, preferred rotamers, and peptide bond angles are very similar in the three sets of proteins as far as can be ascertained within the limits of the relatively low resolution of the membrane proteins dataset. Crossing angles for helices in the membrane protein set resemble the four helix bundle set more than the general non-redundant set, but in contrast to both sets they have smaller crossing angles consistent with the dual requirements for the helices to form a compact structure while having to span the membrane. In addition to the pairwise packing of helices we investigate their global packing and consider the question of helix supercoiling in helix bundle proteins.     

Rational choice based on vague preferences

This paper studies vague preferences. In contrast to the concept of fuzzy preferences, the more general notion of vague preferences does not entail the assumption that the different degrees of preference are completely ordered. It is shown that the more general concept of a vague preference order arises very naturally in the context of aggregating a set of (exact) weak orders. Furthermore, necessary and sufficient conditions for the rationalizability of an exact choice function by means of a vague preference order are given. It turns out that in the general case these conditions are weaker than in the case where the degrees of preference are completely ordered. Consequently, there exist choice functions which are rationalizable by a general vague preference order but which are not rationalizable by a fuzzy preference order, or more generally by any vague preference order which induces a complete ranking of the degrees of preference. Examples of such choice functions are provided.This is a revised version of a discussion paper which was written at the University of Karlsruhe. I am grateful to Georg Bol and an anonymous referee for valuable comments. The research has been made possible by a fellowship of the DFG (Deutsche Forschungsgemeinschaft) which is also gratefully acknowledged.     

Relative K-homology and K-homology of an ideal

We provide a straightforward proof of one of the main results of the Baum-Douglas K-homology theory: If A is a separable nuclear C ^*-algebra and I an ideal of A, then the natural restriction map K ⁰(A, I) K ⁰(I) is an isomorphism of Abelian groups.     

Dynamic models of segregation†

Some segregation results from the practices of organizations, some from specialized communication systems, some from correlation with a variable that is non‐random; and some results from the interplay of individual choices. This is an abstract study of the interactive dynamics of discriminatory individual choices. One model is a simulation in which individual members of two recognizable groups distribute themselves in neighborhoods defined by reference to their own locations. A second model is analytic and deals with compartmented space. A final section applies the analytics to ‘neighborhood tipping.’ The systemic effects are found to be overwhelming: there is no simple correspondence of individual incentive to collective results. Exaggerated separation and patterning result from the dynamics of movement. Inferences about individual motives can usually not be drawn from aggregate patterns. Some unexpected phenomena, like density and vacancy, are generated. A general theory of ‘tipping’ begins to emerge.     

确定性矩阵可分离压缩成像

针对可分离压缩传感使用的可分离随机正交矩阵在处理大尺度图像等高维信号感知时难度太大或成本过高的问题,引入确定性测量矩阵,提出确定性矩阵可分离压缩传感,可将如托普利兹矩阵及循环矩阵等具有确定性结构的矩阵作为可分离压缩传感的左、右可分离矩阵.该方案可以降低独立元素的数目,从而显著降低前端物理实现的难度与成本.数值模拟实验分别评估了该方法在不同采样率及不同图像尺寸下的压缩重建性能,结果表明该方法在独立元素非常少的情形下得到与原随机正交矩阵相近的重建质量,证明了其可行性.     

Computational aspects of two-segment separable programming

Recursive separable programming algorithms based on local, two-segment approximations are described for the solution of separable convex programs. Details are also given for the computation of lower bounds on the optimal value by both a primal and a dual approach, and these approaches are compared. Computational comparisons of the methods are provided for a variety of test problems, including a water supply application (with more than 600 constraints and more than 900 variables) and an econometric modelling problem (with more than 200 variables). Research supported by National Science Foundation Grants MCS74-20584 A02 and MCS-7901066.