扭转约束对无防火保护钢柱抗火性能影响分析

应用ANSYS软件计算了钢柱在标准升温模式下的温度场,然后利用ANSYS的耦合分析模块,将温度场导入结构分析,分析了不同约束下轴心受压钢柱在温度升高时的力学反应,同时考虑了荷载比以及长细比对不同约束钢柱抗火性能的影响.研究表明:扭转约束钢柱的抗火性能要优于柱端没有扭转约束的简支柱;当钢柱长细比系数在30以内时,扭转约束...     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000     

An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines

We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.     

On a class of multiple failure mode systems

The primary objective of this work is to introduce and perform a detailed study of a class of multistate reliability structures in which no ordering in the levels of components' performances is necessary. In particular, the present paper develops the basic theory (exact reliability formulae, reliability bounds, asymptotic results) that will make it feasible to investigate systems whose components are allowed to experience m ≥ 2 kinds of failure (failure modes), and their breakdown is described by different families of cut sets in each mode. For illustration purposes, two classical (binary) systems are extended to analogous multiple failure mode structures, and their reliability performance (bounds and asymptotic behavior) is investigated by numerical experimentation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 167–185, 2002; DOI 10.1002/nav.10007     

路、Ti^＊广义θ-图的成分着色

设H是一个超图（图）,对于它的一个k边着色c：E（H）→{1,2,∧k},我们记f（H,c）是由k种颜色中,由同一色类导出的子超图（子图）中所含分枝数最少的子超图（子图）的分枝数。fk（H）表示H中所有k边着色中f（H,c）的最大值,即fk（H）=maxf（H,c）。本文主要研究了路、Ti’、广义θ-图的成分着色,并得到了fi（Pn）=（n-1/k,f（Ti^＊）=[i-1/k]＋1∫k（Gθ）=2     

On the hierarchy of γ‐valid cuts in global optimization

Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

无源电流放大器的实现及应用

利用对偶原则,将带阻型ＲＣ双Ｔ桥滤波器变换成带通型ＲＣ双Ｔ桥滤波器,其等效电路的部分支路呈现负阻抗特性．利用这种特性实现了无源电流放大．最后给出了两个应用电路     

圆波导斜劈形端口辐射器的有限元分析

有限元法(FEM)适用于电磁场的散射、辐射和透射,运用三维有限元法分析了圆波导斜劈形辐射器的辐射场并计算出圆波导内部场分布,用此方法计算了X波段的辐射场,与相关文献进行了比较,结果在主瓣相当一致,分析表明在C波段圆波导TM01模斜劈形辐射器斜切角为30°时,辐射波束偏离轴向27°～42°,增益为11～14dB,可以作为高功率微波的辐射天线。     

Failure profiles of coherent systems

In this paper we first introduce and study the notion of failure profiles which is based on the concepts of paths and cuts in system reliability. The relationship of failure profiles to two notions of component importance is highlighted, and an expression for the density function of the lifetime of a coherent system, with independent and not necessarily identical component lifetimes, is derived. We then demonstrate the way that failure profiles can be used to establish likelihood ratio orderings of lifetimes of two systems. Finally we use failure profiles to obtain bounds, in the likelihood ratio sense, on the lifetimes of coherent systems with independent and not necessarily identical component lifetimes. The bounds are relatively easy to compute and use. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Realignment in the National Football League: Did they do it right?

The National Football League (NFL) in the United States expanded to 32 teams in 2002 with the addition of a team in Houston. At that point, the league was realigned into eight divisions, each containing four teams. We describe a branch‐and‐cut algorithm for minimizing the sum of intradivisional travel distances. We consider first the case where any team can be assigned to any division. We also consider imposing restrictions, such as aligning the AFC (American Football Conference) and the NFC (National Football Conference) separately or maintaining traditional rivalries. We show that the alignment chosen by the NFL does not minimize the sum of intradivisional travel distances, but that it is close to optimal for an alignment that aligns the NFC and AFC separately and imposes some additional restrictions. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 683–701, 2003.