多样化的用户定制线缆

从电力与精确数字、模拟信号,到高压气态和液态介质,如今的用户定制电缆几乎无所不传。线缆制造商们现在可以提供的连接线缆材料可谓五花八门,从多种规格的传统铜线和光纤,到各类软管和导管,甚至包括碳纤维等半导体材料。在对一种专用电缆的设计作出最终决定前,要做一点“外形匹配”的工作。通常要回答的问题包括:“要传输些什么?”、“有什么限制条件?”、“完成任务应该采用何种连接物”。在进行优化的阶段,还要另外考虑使用环境,包括可能存在的电磁干扰、机械应力影响(如扭曲和/或摩擦)、化学和/或高温的损伤。细绞合铜导线在进行大功率…     

FORECASTING MINERAL SUPPLY FROM MINERAL RENT DATA

An optimal control model of exhaustible resources is used to clarify the long run relationship between mineral rent and depletion cost at the industry level. A standard first order condition of the time rate of change of rents is reformulated to reveal that rent data may be used to help forecast the rise in extraction costs resulting from resource depletion. This application of the theory of exhaustible resources is illustrated using historical mineral industry rent and extraction cost data. A forecast of U.S. coal extraction costs, following the method proposed in this paper, suggests that future rates of extraction cost increases will be similar to rates experienced in the past.     

C 1 Quintic Splines on Type-4 Tetrahedral Partitions

Starting with a partition of a rectangular box into subboxes, it is shown how to construct a natural tetrahedral (type-4) partition and associated trivariate C ¹ quintic polynomial spline spaces with a variety of useful properties, including stable local bases and full approximation power. It is also shown how the spaces can be used to solve certain Hermite and Lagrange interpolation problems.     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.     

Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach

We address the problem of determining the topology and bridge-capacity assignments for a network connecting a number of token rings via source-routing bridges. The objective is to minimize the cost of bridge installations while meeting the network users' performance requirements. The problem is modeled as a mixed 0–1 integer program. A comparison is given between two solution algorithms: a simulated annealing algorithm using the flow-deviation algorithm for each routing subproblem, and a drop algorithm using the simplex method for the same subproblems to provide benchmark solutions. In the former algorithm, the routing subproblem is formulated as a nonlinear program with penalty functions to model node and link capacity constraints, and in the latter as a multicommodity flow model with the same capacity constraints. Computational results show that the simulated-annealing/flow-deviation algorithm produced substantially better solutions than the LP-based drop algorithm.     

On the evolution of islands

Letn cells be arranged in a ring, or alternatively, in a row. Initially, all cells are unmarked. Sequentially, one of the unmarked cells is chosen at random and marked until, aftern steps, each cell is marked. After thekth cell has been marked the configuration of marked cells defines some number of islands: maximal sets of adjacent marked cells. Let ξ _k denote the random number of islands afterk cells have been marked. We give explicit expressions for moments of products of ξ _k ’s and for moments of products of 1/ξ _k ’s. These are used in a companion paper to prove that if a random graph on the natural number is made by drawing an edge betweeni≧1 andj>i with probabilityλ/j, then the graph is almost surely connected ifλ>1/4 and almost surely disconnected ifλ≦1/4.     

Information and asymptotic efficiency of the case-cohort sampling design in Cox's regression model

Efficiencies of the maximum pseudolikelihood estimator and a number of related estimators for the case-cohort sampling design in the proportional hazards regression model are studied. The asymptotic information and lower bound for estimating the parametric regression parameter are calculated based on the effective score, which is obtained by determining the component of the parametric score orthogonal to the space generated by the infinite-dimensional nuisance parameter. The asymptotic distributions of the maximum pseudolikelihood and related estimators in an i.i.d. setting show that these estimators do not achieve the computed asymptotic lower bound. Simple guidelines are provided to determine in which instances such estimators are close enough to efficient for practical purposes.