Mutual solubilities of hydrocarbons and water with the CPA EoS

The knowledge of hydrocarbon/water phase equilibria is important in the design and operation of equipment for petroleum transport and refining and petrochemical plants. The presence of water in a hydrocarbon mixture can affect the product quality and damage the operation equipment due to corrosion and formation of gas hydrates. Tracing the concentration of hydrocarbons in aqueous media is also important for technical purposes like preventing oil spills and for ecological concerns such as predicting the fate of these organic pollutants in the environment.     

Twist points of planar domains

We establish a potential theoretic approach to the study of twist points in the boundary of simply connected planar domains.

     

Category with a natural cone

Generally, in homotopy theory a cylinder object (or, its dual, a path object) is used to define homotopy between morphisms, and a cone object is used to build exact sequences of homotopy groups. Here, an axiomatic theory based on a cone functor is given. Suspension objects are associated to based objects and cofibrations, obtaining homotopy groups referred to an object and relative to a cofibration, respectively. Exact sequences of these groups are built. Algebraic and particular examples are given. We point out that the main results of this paper were already stated in [3], and the purpose of this article is to give full details of the foregoing.     

开关布局中本质不同的开关线路计算

通过对开关布局问题的研究，来解决一类象开关线路一样比较特殊，比较复杂的布局优化问题。从而寻找出这类问题的全局优化算法。本应用对称群对集合的作用，轨道，不动点等讨论了开关布局问题，给出了本质不同的开关线路个数的计算公式。     

Vojta's Main Conjecture for blowup surfaces

In this paper, we prove Vojta's Main Conjecture for split blowups of products of certain elliptic curves with themselves. We then deduce from the conjecture bounds on the average number of rational points lying on curves on these surfaces, and expound upon this connection for abelian surfaces and rational surfaces.

     

On the number of full levels in tries

We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2^k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log_1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Periodic solutions of nonlinear impulsive differential inclusions with constraints

In this paper we obtain the existence of periodic solutions for nonlinear ``invariance' problems monitored by impulsive differential inclusions subject to impulse effects.

     

Identifying Linking-Pin Organizations in Inter-Organizational Networks

Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems.     

多目标半定规划的互补弱鞍点和G-鞍点最优性条件

对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题，给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义．然后，在较弱的凸性条件下，利用含矩阵和向量约束的择一性定理，建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件．     

Sub-bundles of the complexified tangent bundle

We study embeddings of complex vector bundles, especially line bundles, in the complexification of the tangent bundle of a manifold. The aim is to understand implications of properties of interest in partial differential equations.