电视文化对青少年婚恋观的负面影响及对策

婚恋观是人生观的重要组成部分。青少年时期是人生观、价值观形成的关键时期。随着电视机的普及、收视率的提高,电视文化这种新的文化形态对青少年的发展及教育的影响日渐广泛,电视中一些不良信息对青少年婚恋观的形成具有潜移默化的影响。本文着重从电视文化的传播特点和传播内容两方面入手,分析电视文化对于青少年婚恋观的负面影响,并针对如何减少电视文化对青少年婚恋观的负面影响做了初步探讨。     

概率分布模型的飞机战备完好率评估与预测

飞机战备完好率是军用飞机战斗力的重要体现.在分析目前部队常用的飞机战备完好率算法缺陷的基础上,建立了基于概率分布的飞机战备完好率计算模型,该模型体现了飞机任务可靠性、维修性与战备完好性之间的关系.以某型飞机为例,通过分析飞机任务可靠度,利用飞机可靠性、维修性、保障性及作战训练任务的历史统计数据,依据概率分布模型对飞机的...     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

航天装备大数据资源平台构建技术研究

航天装备研制涉及论证、研制、生产、试验、综合保障等各个环节,所产生的数据具有种类多、数据量大、异构性强等特点,且数据资源分散于各科研机构院所,形成一个个数据孤岛,严重制约了型号数据的统一管理和协同应用。为了建立“逻辑统一、物理分散”的航天装备统一大数据中心,本文提出一种航天装备大数据资源平台构建技术,该平台基于统一的数据编目规范,综合利用云计算、微服务、区块链等技术,可实现多维异构数据深度融合管控,实现基于型号科研生产活动下的数据逻辑统一管理和实体分布式存储,能够解决航天装备整个研制活动全要素全过程的数据采集和可控共享的现实需求,为各业务场景下的数据分析奠定基础。     

弹道导弹打击航空母舰末制导有效区的确定与评估

在地地弹道式导弹与航空母舰攻防对抗中,需要研究航母是否在导弹进攻的有效区内。针对具有末制导的弹道式导弹具有再入机动变轨特性,建立了导弹再入机动飞行模型,提出了导弹在不同的再入条件下,对其飞行弹道及机动能力进行仿真计算的方法,通过仿真确定出了导弹打击航空母舰的有效区域。在此基础上,探讨了导弹在以不同的再入姿态、不同的再入飞行高度实施末制导时,导弹落点的有效区域、边界外形及有效区的变化范围。从所得结果来看,所建模型及仿真方法正确可行,在一定程度上解决了弹道导弹打击航空母舰战斗群作战保障急需解决的一些问题。     

弹道导弹打击航空母舰末制导寻的方法研究

在弹道导弹与航母战斗群的攻防对抗中,弹道导弹需要采用有效的寻的方法以便在对抗中占优势。通过分析航母的运动特性,建立了预测其运动态势的数学模型;在此基础上,采用预测落点的末制导方法,在导弹弹头再入大气层后,通过多次预测和修正,实时修正由于航母运动和再入过程中大气影响等各种干扰因素所引起的落点偏差,以保证弹头能以较好的精度命中目标。从数字仿真结果来看,该方法成功率高,且制导精度较高,具有较强的工程应用价值。     

新经济环境下内部审计风险形成的主客观因素及防范

本文从客观和主观两个方面分析社会主义市场经济条件下,内部审计风险形成的原因,并尝试提出了相应的防范措施,即增强内部审计人员的风险意识、提高内部审计队伍的整体素质、采用内部审计的科学方法、加强内部审计的机构管理和完善内部审计的监控制度。     

Relaxed sequencing games have a nonempty core

We study sequencing situations with a fixed initial order and linear cost functions. Cost savings can be obtained by rearranging jobs. Next to finding an optimal order, an additional issue is formed by the division of these savings. Cooperative game theory studies this issue. A common assumption states that cooperation between players is restricted to groups that are connected according to the initial order. The value of disconnected groups is defined additively over their connected components. In this paper we allow players in disconnected coalitions to switch places as long as they do not hurt the players not in the coalition under consideration. The resulting games are called relaxed sequencing games. Although they have been studied before, no general results on stable profit divisions have been derived so far. In this paper we prove that relaxed sequencing games have a nonempty core, i.e., they all have stable profit divisions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

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