全垫升式气垫船水压场数值模拟

提出了任意分布的气垫压力所产生的水压场的计算方法 ,对椭圆域上均匀分布的气垫压力产生的水压场进行了数值模拟 ,并将计算结果与实验进行了比较 .结果表明 ,用数值模拟的方法研究全垫升式气垫船水压场是可行的     

罗兰C信号模拟器的设计与实现

运用数控技术产生罗兰C信号 ;通过对罗兰C脉冲的傅立叶分析和采样分析 ,确定仪器所用的采样频率和滤波器 ,给出了设计及实现罗兰C信号模拟器的原理     

利用AHP确定决策方案排序的一种改进方法

针对在用AHP法求解权重排序向量时 ,用不同的计算方法导致排序方案不一致的矛盾现象 ,提出了一种在单准则下综合各个排序方案信息的方法 ,使AHP法更趋于完善     

基于科学计量的机器学习技术发展评估分析

机器学习是通过数据训练使机器获取新的知识和技能的计算机技术,是人工智能技术的核心和前沿领域之一。本文以Web of Science?核心合集收录的机器学习领域相关SCI论文和incoPat全球专利数据库收录的机器学习领域相关专利为数据源,运用科学计量方法对文献数据和专利数据进行时间、地域和机构分布分析,展示了机器学习领域研究实力的分布情况,并对机器学习的发展趋势进行了分析;然后利用主题聚类分析方法及可视化软件VOSviewer,挖掘出机器学习领域的关键技术、技术热点;最后对结果进行了总结分析,以期为我国机器学习发展布局提供参考和借鉴。     

残余电压对连发型脉冲功率电源的影响

为了研究残余电压对连发型脉冲功率电源的影响,分析了混合储能型脉冲功率电源的充放电过程及残余电压的来源及其对连续充放电过程的影响,并进行了仿真。仿真结果表明:混合储能型脉冲功率电源可以合理利用残余电压,从而缩短脉冲功率电源的充放电时间,有利于提高电磁发射装置的连发频率,通过能量回收还有利于提高发射效率。     

Dynamic pricing in a trade-in program with replacement and new customers

Trade-in programs have been widely adopted to enhance repeat purchase from replacement customers. Considering that a market consists of replacement and new segments, we study the joint and dynamic decisions on the selling price of new product (hereafter, “selling price”) and the trade-in price involved in the program. By adopting a vertical product differentiation choice model, we investigate two scenarios in this paper. In the base model, the manufacturer has sufficiently large production capacity to fulfill the customer demand. We characterize the structural properties of the joint pricing decisions and compare them with the optimal pricing policy under regular selling. We further propose a semi-dynamic trade-in program, under which the new product is sold at a fixed price and the trade-in price can be adjusted dynamically. Numerical experiments are conducted to evaluate the performance of the dynamic and semi-dynamic trade-in programs. In an extended model, we consider the scenario in which the manufacturer stocks a batch of new products in the beginning of the selling horizon and the inventory cannot be replenished. Following a revenue management framework, we characterize the structural properties with respect to time period and inventory level of new products.     

A guarantee rate optimization model for wastewater treatment system design under uncertainty

We consider a design problem for wastewater treatment systems that considers uncertainty in pollutant concentration levels at water sources. The goal is to optimize the selection of treatment technologies and pipeline connections, so that treated wastewater can achieve specified effluents discharge limits as well as possible. We propose a new two-stage model to optimize a set of guarantee levels, that is, the maximum concentration level of source pollutants for which treated wastewater can be compliant with discharge limits. In the first stage, treatment technologies and pipeline connections are selected. In the second stage, when pollutant concentration levels are revealed, wastewater distribution and mixing are determined. A key attractiveness of the proposed guarantee rate optimization model is that it can be simplified into a single-stage mixed-integer linear program. In our numerical experiments based on real-world pollutants data, the guarantee rate model demonstrates its advantages in terms of computational efficiency, scalability and solution quality, compared with the standard probability maximization model. Finally, the methodology proposed in this paper can also be applied to other two-stage problems under uncertainty with similar uncertainty characteristics.     

基于区域覆盖度的航迹灰关联算法

研究了在雷达存在系统误差情况下的航迹关联问题,分析了时变系统误差对航迹形成的影响,将系统时变误差的影响用灰区域来描述。提出了一种基于区域覆盖度的航迹关联算法,研究了算法在不同条件下的适用性,并将该算法拓展应用到异步等速率情况下,带有时间误差和系统误差直接进行关联,仿真结果显示关联正确率较高。     

Dynamic pricing and replenishment: Optimality,bounds, and asymptotics

In many applications, managers face the problem of replenishing and selling products during a finite time horizon. We investigate the problem of making dynamic and joint decisions on product replenishment and selling in order to improve profit. We consider a backlog scenario in which penalty cost (resulting from fulfillment delay) and accommodation cost (resulting from shortage at the end of the selling horizon) are incurred. Based on continuous‐time and discrete‐state dynamic programming, we study the optimal joint decisions and characterize their structural properties. We establish an upper bound for the optimal expected profit and develop a fluid policy by resorting to the deterministic version of the problem (ie, the fluid problem). The fluid policy is shown to be asymptotically optimal for the original stochastic problem when the problem size is sufficiently large. The static nature of the fluid policy and its lack of flexibility in matching supply with demand motivate us to develop a “target‐inventory” heuristic, which is shown, numerically, to be a significant improvement over the fluid policy. Scenarios with discrete feasible sets and lost‐sales are also discussed in this article.