The longitudinal relaxation times (T1) of water in concentrated silica and alumina slurries were measured as a function of solids content. It was shown that the results could be fit very well with a two-phase fast-exchange model between free and surface-bound water. As expected, values of T1 for bound water were in the order of 20–2000 times lower than that for free water, indicating a higher effective viscosity of the surface-bound water. The strength of the interaction depended on the particular surface, and all of the aluminas examined interacted more strongly with water than the two silicas studied, which themselves differed considerably. The chemical mechanical polishing (CMP) removal rate of tantalum by silica slurries was shown to be directly correlated with the interaction parameters, derived from the NMR relation times rather than with total surface hydroxyl group concentration. 相似文献
An equation for the kinetics of partial drop spreading is proposed. This equation was empirically derived from experimental data for the spreading kinetics of partially wetting liquids in terms of the wet area versus time. The equation has the form of an exponential power law (EPL), and transforms into the well-known power law for complete wetting, when the equilibrium contact angle approaches zero. The EPL fits very well available experimental data. To lend additional support to the validity of this generalized equation, it will be demonstrated that when it is transformed to present the dynamic contact angle (DCA), it fits very well DCA experimental data for other wetting processes, such as capillary flow and tape coating. 相似文献
In this paper, we present a unified treatment and analysis of a dynamic traffic network model with elastic demands formulated and studied as a projected dynamical system. We propose a travel route choice adjustment process that satisfies the projected dynamical system. Under certain conditions, stability and asymptotical stability of the equilibrium patterns are then derived. Finally, two discrete-time algorithms, the Euler method and the Heun method, are proposed for the computation of the solutions, and convergence results established. The convergence results depend crucially on stability analysis. The performance of the algorithms is then illustrated on several transportation networks. 相似文献
This research extends previous work with dynamic models to manage groundwater quality by using the consumptive nitrate use rate instead of the nitrate application rate. The analysis indicates that misspecification results in overestimation of economic benefits, and supra-optimum nitrogen fertilizer application rates and groundwater nitrate stocks at a steady state. 相似文献
Following the introduction and preliminary investigations of analytic Zariski structures in Peatfield and Zilber (Ann pure Appl Logic 132:125–180, 2005) an example of an analytic Zariski structure extending an algebraically closed field is provided. The example is constructed using Hrushovski’s method of free amalgamation, and a topology is introduced in which we can verify the analytic Zariski axioms. 相似文献
Vertex-reinforced random walk is a random process which visits a site with probability proportional to the weight wk of the number k of previous visits. We show that if wk∼ kα, then there is a large time T0 such that after T0 the walk visits 2, 5, or ∞ sites when α < 1, = 1, or > 1, respectively. More general results are also proven.
相似文献
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. 相似文献
In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered. 相似文献
A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.
In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.
In this paper we study a subclass of dynamic process graphs called
-output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is
-complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a
-complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion. 相似文献