化学教学内容情感性艺术处理的策略

化学教学内容是教学系统的基本要素之一。对教学内容作情感性艺术处理,显示了教师高超的化学教学艺术。其艺术策略分为:一是巧妙组织教学内容来调节学生的学习心向,包括心理匹配策略、超出预期策略;二是有效地利用教学内容中的情感资源来陶冶学生的情操,包括展示情感策略、发掘情感策略、诱发情感策略、赋予情感策略。     

绿色产品零售企业与市场消费者策略选择演化分析

线上线下结合营销模式有效缓解了流通渠道不畅和营销方式单一的问题,进而促进绿色产品消费。在相关假设的基础上,通过构建绿色产品零售企业和市场消费者的演化博弈模型,重现博弈主体的动态演进过程。研究结果表明,在线上线下结合营销模式中,绿色产品零售企业与消费者演化博弈系统存在两个可能的均衡状态,分别是O{维持传统营销策略,使用传统渠道购买产品}、C{建立线上营销策略,使用线上渠道购买产品}。演化博弈系统的演进受到9个相关因素的干扰,这些因素通过影响博弈主体的收益、成本及潜在的风险损失等发生作用。在理论推导的基础上,以被调研的A绿色产品零售企业为样本进行数值模拟,验证理论推导的正确性,给出上述影响因素的作用强度。     

汽车制造商分时租赁模式采用及产品线策略研究

考虑自有平台和第三方平台两种分时租赁方式,将汽车质量划分为性能质量和环境质量,构建销售模式、纯分时租赁模式和混合模式下的产品线策略模型,研究制造商产品线策略与商业模式之间的相互作用。研究发现,同品牌产品间竞争和合并效应是分时租赁模式影响产品线策略的两个关键因素。同品牌产品间竞争的加剧和合并效应的增大都会激励企业选择性能更好的车型而忽略其环境表现。分时租赁模式能同时改进利润与产品环境表现,但存在条件:当消费者价格敏感性较低时,使用成本高且合并效应小是实现同时改进的条件;当消费者价格敏感较高时,使用成本低且合并效应小则是同时改进的条件。     

A-P-S组合策略的多重绩效及其“褪色”效应分析

为了降低城市交通拥堵及空气污染程度,本文在现有研究的基础上引入罚款政策,利用系统动力学方法原理构建了机动车污染物减排管控模型。通过仿真和比较分析来探索空气污染收费(Air pollution charging fee,简称APCF)、罚款(penalty)和补贴(subsidy)政策(简称A-P-S策略)的作用效果。研究结果表明:一方面,组合策略具有多重绩效,不但能够降低污染损失(经济-环境效益)、死亡人口的生命价值(社会-经济效益)、交通拥堵程度(社会效益)和机动车污染物总量(环境效益),而且能大大改善环境生态承载力(环境效益)和机动车非法出行增长量(社会安全绩效);另一方面,政策在实施过程中也会遇到一定的局限性,如初期的滞后性,后期的“褪色”效应和“反弹”效应,因此,从长期来看,需要及时调整组合方案。最后,根据仿真结果提出了相应的政策建议,进而为城市交通和环保等相关部门提供决策参考。     

考虑低碳偏好及碳减排的闭环供应链回收及专利授权策略

研究考虑消费者低碳偏好的闭环供应链回收、碳减排与专利授权决策问题。分别构建制造商回收再制造、零售商回收再制造支付固定专利费、零售商回收再制造支付单位专利费的闭环供应链模型,分析低碳消费者比例、普通消费者对再制品的接受程度及碳权交易价格,对企业回收、碳减排及定价决策的影响,并比较了三种模式下企业及供应链的利润。研究表明:随着市场中低碳消费者比例及普通消费者对再制品接受程度的提高,总会使得回收率及碳减排率增加;碳权交易价格的提高,也会促使制造商提高碳减排率;对制造商来说,其利润在零售商回收再制造且支付固定专利费用下实现最优。从自身利润最优的角度出发,作为领导者的制造商将总是选择零售商回收再制造且支付固定专利费用模式。     

产能约束下的闭环供应链制造商合作策略研究

构建了一个由制造商、回收商和零售商组成的闭环供应链模型,运用Stackelberg博弈对产能约束下制造商的合作策略进行了研究。研究发现:制造商始终有与回收商或零售商合作的经济动机,且当产能较小时,更倾向于与零售商合作;反之,则更倾向与回收商进行合作。此外,相对于无合作模式,不同合作策略对于回收率、供应链整体利润、新产品与再制品总体环境影响程度以及消费者剩余的影响会随着制造商产能大小的变化发生改变,而不同合作策略对于总体环境影响程度的影响与制造商的再制造水平也存在关联。     

Parameter choice by discrepancy principles for ill-posed problems leading to optimal convergence rates

Schock (Ref. 1) considered a general a posteriori parameter choice strategy for the Tikhonov regularization of the ill-posed operator equationTx=y which provides nearly the optimal rate of convergence if the minimal-norm least-squares solution belongs to the range of the operator (T ^* T) ^v , o<v1. Recently, Nair (Ref. 2) improved the result of Schock and also provided the optimal rate ifv=1. In this note, we further improve the result and show in particular that the optimal rate can be achieved for 1/2v1.The final version of this work was written while M. T. Nair was a Visiting Fellow at the Centre for Mathematics and Its Applications, Australian National University, Canberra, Australia. The work of S. George was supported by a Senior Research Fellowship from CSIR, India.     

The BKK root count in

The root count developed by Bernshtein, Kushnirenko and Khovanskii only counts the number of isolated zeros of a polynomial system in the algebraic torus . In this paper, we modify this bound slightly so that it counts the number of isolated zeros in . Our bound is, apparently, significantly sharper than the recent root counts found by Rojas and in many cases easier to compute. As a consequence of our result, the Huber-Sturmfels homotopy for finding all the isolated zeros of a polynomial system in can be slightly modified to obtain all the isolated zeros in .

     

Optimal life strategies in organisms exposed to recurrent critical events

The optimal partition of energy between survival and reproduction is considered for a population subject to recurrent and potentially lethal critical events. The best strategy is found by maximizing fitness, a functional derived from the Lotka equation. The dynamics is governed by a second-order, age-varying, nonlinear system. The energy storage and the probability of survival are the state variables, while the amounts of energy placed into and withdrawn from the storage are the controls. The optimal life strategy is shown to be as follows: build up the storage at the very beginning of life, and then progressively deplete it to resist the critical events.This work was partially supported by MURST Project Ricerche sui Fondamenti della Conservazione della Natura. The authors would like to thank C. Ricci for suggesting the problem and C. Matessi for helpful discussion.     

Cyclical games with prohibitions

We consider a certain combinatorial game on a digraph for two cases of the price function. For one case the game in question extends the cyclical game studied in Ehrenfeucht and Mycielski (1979) and Gurvitch, Karzanov and Khachiyan (1988) which, in its turn, is a generalization of the well-known problem of finding a minimum mean cycle in an edge-weighted digraph. We prove the existence of optimal uniform stationary strategies for both cases and give algorithms to find such strategies.This work was partially supported by Chaire municipale, Mairie de Grenoble.