Equity in genetic newborn screening

State‐level newborn screening allows for early treatment of genetic disorders, which can substantially improve health outcomes for newborns. As the cost of genetic testing decreases, it is becoming an essential part of newborn screening. A genetic disorder can be caused by many mutation variants; therefore, an important decision is to determine which variants to search for (ie, the panel design), under a testing budget. The frequency of variants that cause a disorder and the incidence of the disorder vary by racial/ethnic group. Consequently, it is important to consider equity issues in panel design, so as to reduce disparities among different groups. We study the panel design problem using cystic fibrosis (CF) as a model disorder, considering the trade‐offs between equity and accuracy, under a limited budget. Most states use a genetic test in their CF screening protocol, but panel designs vary, and, due to cost, no state's panel includes all CF‐causing variants. We develop models that design equitable genetic testing panels, and compare them with panels that maximize sensitivity in the general population. Our case study, based on realistic CF data, highlights the value of equitable panels and provides important insight for newborn screening practices.     

Multi-objective design optimization of composite submerged cylindrical pressure hull for minimum buoyancy and maximum buckling load capacity

This paper presents the design optimization of composite submersible cylindrical pressure hull subjected to 3 MPa hydrostatic pressure. The design optimization study is conducted for cross-ply layups [0s/90t/0u], [0s/90t/0u]s, [0s/90t]s and [90s/0t]s considering three uni-directional composites, i.e. Carbon/Epoxy, Glass/Epoxy, and Boron/Epoxy. The optimization study is performed by coupling a Multi-Objective Genetic Algorithm (MOGA) and Analytical Analysis. Minimizing the buoyancy factor and maximizing the buckling load factor are considered as the objectives of the optimization study. The objectives of the optimization are achieved under constraints on the Tsai-Wu, Tsai-Hill and Maximum Stress composite failure criteria and on buckling load factor. To verify the optimization approach, optimization of one particular layup configuration is also conducted in ANSYS with the same objectives and constraints.     

基于摩擦磨损的数学模型的分布及讨论

主要讨论基于摩擦磨损的数学模型的分布性态和分布近似问题。引用无穷小概念,结合0-1律讨论了该模型的分布收敛于退化正态分布的条件。并在一定的矩条件下,利用特征函数,得到了该模型的分布近似于标准正态分布的误差。     

一种面向移动Agent的多任务并行计算模型及算法

介绍了一种面向移动Agent的并行计算模型,给出了采用十标度策略解决任务排序,采用满射策略解决任务映射的算法。该模型允许多个计算任务在异构主机构成的分布式环境下同时进行计算,并且通过算法优化,降低移动Agent之间的通信成本,减少网络流量。     

基于遗传算法的弹炮混编防空群火力分配

近期局部战争中的防空作战经验表明:实施弹炮混编可以大大提高防空武器系统的作战效能,而如何实施有效的火力分配又是其中的一个重要环节.针对陆军弹炮混编防空群射击指挥中的火力分配问题,简要分析了防空导弹和高炮武器系统射击的不同特点,提出了弹炮混编防空群的火力分配方法,并建立了优化火力分配方案的数学模型.在此基础上,采用遗传算法对此模型求解.结果表明,遗传算法为弹炮混编防空群的火力优化分配问题提供了一条有效途径.     

舰艇编队对空防御火力分配评价模型

未来高技术条件下水面舰艇编队防空作战能力是其生存能力的关键因素.对舰艇编队防空来讲,进行硬抗击的武器主要是舰空导弹和舰炮两种,如何合理地利用这些武器,最大地发挥舰艇编队的防空作战能力,成为舰艇对空防御作战研究的一个重要课题.结合舰艇编队对空防御的实际情况,利用模糊数学的方法,建立了舰艇编队对空防御火力分配方案的模糊综合评价模型.     

论军队院校科研管理资源配置机制建设

分析了目前军队院校科研管理资源配置机制中存在的问题及原因,提出了军队院校建立科学高效优化合理的科研管理资源配置机制的基本思路:建立基于学科的资源优化配置机制;建立和完善资源开放平台和共享机制;建立尊重和适应市场规律、科学合理的人才资源配置机制。     

一种用于求解火力分配问题的混沌优化算法

针对火力分配问题,提出了一种新颖的用于解决组合优化问题的混沌优化算法.该算法利用混沌搜索的方法得到新的合法解,充分利用了混沌的随机性和遍历性等特点来改善寻优效率.通过设定逃逸系数,算法在寻优过程中具有了能够跳出局部极小点到达全局最优点的能力.仿真结果表明,该方法的寻优效率明显高于Hopfield等其他优化方法.     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Maximizing project cash availability

Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006