车载多接入边缘网络中联合资源分配和动态任务卸载方案

针对车联网中车辆移动速度过快产生的任务卸载失败问题,设计了一个有效的任务卸载风险评估模型,并提出了联合资源分配的动态任务卸载方案。将时间、能耗和风险共同建模为系统效用,通过联合优化卸载决策、资源分配来最大化系统效用。优化问题被公式化为混合整数非线性规划,在给定卸载决策的情况下,利用凸优化技术解决计算资源分配问题,功率分配通过分式规划技术来优化。仿真分析了车辆移动性对系统效用的影响,证明了所提方案的合理性。     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

开尔文模型粘弹性Timoshenko梁的动力分析与应用

基于Kelvin模型张量形式本构关系导出粘弹性Timoshenko梁自由振动微分方程组,给出两端简支粘弹性梁的固有频率解析解。对粘弹性梁的振动特性进行了分析和比较。以此计算材料开尔文模型粘弹性阻尼系数,结果表明,该方法准确可靠。     

应用时标分离和动态逆方法设计飞行器的姿态控制系统

在对飞行器的姿态控制过程中,针对飞行器姿态控制系统模型的非线性特性,线性的控制方法难以直接应用,应用非线性控制理论来设计姿态控制律十分必要。结合时标分离的思想将系统姿态的运动学部分和动力学部分分别视为慢变子系统和快变子系统,2次应用动态逆的设计方法来设计控制律,仿真结果表明,系统能够快速地跟踪期望的姿态角,跟踪的精度高,该方法简单可行,具有一定的实用性。     

Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process

This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Switching costs,dynamic uncertainty,and buyer–seller relationships

We analyze strategic relationships between buyers and sellers in markets with switching costs and dynamic uncertainty by investigating the scenario wherein a representative buyer trades with two foreign sellers located in the same foreign country. We show that, under exchange rate uncertainty, switching costs may lead to switching equilibria where both sellers co‐exist in the market with the buyer, or no‐switching equilibria where either seller captures the market. The presence of exchange rate uncertainty facilitates competition by allowing the sellers to co‐exist in the market with the buyer. However, if the level of uncertainty is beyond a threshold, the only viable equilibria are those where one of the sellers captures the market. Further, depending on the level of exchange rate uncertainty and the sellers' variable costs, switching costs may either raise or lower the level of prices in long‐term contracts between the buyer and the sellers. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Bayesian strategies for dynamic pricing in e‐commerce

E‐commerce platforms afford retailers unprecedented visibility into customer purchase behavior and provide an environment in which prices can be updated quickly and cheaply in response to changing market conditions. This study investigates dynamic pricing strategies for maximizing revenue in an Internet retail channel by actively learning customers' demand response to price. A general methodology is proposed for dynamically pricing information goods, as well as other nonperishable products for which inventory levels are not an essential consideration in pricing. A Bayesian model of demand uncertainty involving the Dirichlet distribution or a mixture of such distributions as a prior captures a wide range of beliefs about customer demand. We provide both analytic formulas and efficient approximation methods for updating these prior distributions after sales data have been observed. We then investigate several strategies for sequential pricing based on index functions that consider both the potential revenue and the information value of selecting prices. These strategies require a manageable amount of computation, are robust to many types of prior misspecification, and yield high revenues compared to static pricing and passive learning approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Machine maintenance with workload considerations

Machine maintenance is modeled in the setting of a single‐server queue. Machine deterioration corresponds to slower service rates and failure. This leads to higher congestion and an increase in customer holding costs. The decision‐maker decides when to perform maintenance, which may be done pre‐emptively; before catastrophic failures. Similar to classic maintenance control models, the information available to the decision‐maker includes the state of the server. Unlike classic models, the information also includes the number of customers in queue. Considered are both a repair model and a replacement model. In the repair model, with random replacement times, fixed costs are assumed to be constant in the server state. In the replacement model, both constant and variable fixed costs are considered. It is shown in general that the optimal maintenance policies have switching curve structure that is monotone in the server state. However, the switching curve policies for the repair model are not always monotone in the number of customers in the queue. Numerical examples and two heuristics are also presented. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

动态旋流器湍流流场的模拟研究

采用雷诺应力模型对动态旋流器湍流流场进行模拟.模拟结果与文献实验数据基本吻合,证明该模型的正确性.其中,轴向和切向速度的模拟结果和实际结果非常接近;径向速度的模拟将有助于旋流器结构及性能的分析.所建立的模型和所使用的计算方法为深入探讨动态水力旋流器的流场特性、分离机理及结构优化设计提供了一条有效的途径.     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015