排污监察博弈与策略选择

针对当前排污监察的现状,提出了环境监察部门聘用环境监察员与排污单位之间的监察与反监察博弈观点.就监察员不同的收入结构,分别建立了监察排污静态博弈模型和查处排污动态博弈模型,探讨了监察员固定收入结构与罚款提成收入结构对那什均衡的影响,得出了监察员与排污单位的期望得益.通过分析有关参数,提出了排污监察中信息不对称问题的解决方法,探求了环境监察部门的策略选择.     

农村违法占地与基层干部寻租的演化博弈分析

乡村振兴背景下我国农村宅基地价值不断提升,农民建房需求大幅增加,但建设用地指标紧缺且审批复杂,因此滋生出农户违法占地与基层干部寻租现象.构建演化博弈模型,研究了在无政府监察与政府监察的情形下农户与基层干部群体在违法占地现象中的策略选择问题,依据不同情况求出相应均衡解并得到相应结论;然后结合河南省部分农村违法占地案例,运用仿真计算对其进行分析并验证相关结论;最后站在政府部门的角度提出政策建议,力图遏制农村违法占地与干部寻租现象,推动我国农村经济高质高效发展.     

谈珠算自我调控学习

珠算自我调控学习是一个意志过程,需要珠算学习者付出时间和努力。珠算自我调控学习是一个复杂心理活动过程。设定珠算学习目标,安排珠算学习计划,选择和运用珠算学习策略,监察珠算学习进程,评价珠算学习结果．调节珠算学习行为,排除干扰、克服困难,每一个步骤和过程都需要珠算学习者     

战略性绩效管理系统设计中的决策问题

战略性绩效管理系统的设计中存在很多决策问题,本以一家制造业公司为例,介绍了应用Nash均衡建立绩效监察博弈模型。确定组织的绩效系统规模;通过AHP方法的创新应用,确定组织的关键业务领域,同时对组织关键业绩指标分类分层设计的思路做了简要阐述。     

基于时变相关的金融风险传染效应的非参数方法研究

传染效应是监察、控制金融风险跨市场和地区传导的重要内容.在考虑金融市场波动相关系数的时变特征和非正态特征基础上,提出了一种基于DCC模型的动态相关系数传染效应的非参数检验方法.同时,利用方法实证检验了美国次贷危机对中国大陆、中国香港和英国股市的风险传染特征.结果表明,动态相关系数确实不服从正态分析,故结合Wilcoxon符号秩检验验证了美国股市对其余三个市场传染效应的存在性.     

自我监控对数学解题作业的影响

自我监控是元认知的一种成分，它是指个体为了达到预定的目标，将自身正在进行的实践活动过程作为对象，不断地对其进行自觉地计划、监察、检查、评价、反馈、控制和调节的过程，近些年来，心理学家对自我监控与学习的关系作了大量的研究，包括自我监控的结构、自我监控与思维品质的关系、阅读理解中的自我监控、记忆活动中的自我监控、写作中的自我监控等等。     

地方政府间治理空气污染行为的演化博弈与仿真研究

地方政府治理空气污染的执行力度是影响区域空气质量的直接因素,文中研究影响地方政府治理空气污染行为的因素。文章内容从演化博弈视角探讨地方政府自身及地方政府间协同治理空气污染的决策演化过程。研究显示,中央政府抽查行为,对地方政府的治理成本补贴,增大对地方政府的奖励与惩罚,增大对区域联合治理行为的惩罚与奖励,有助于提升地方政府治理空气污染行为的执行效力。研究结果表明,多元共治、互动监察、利益补偿等对提升地方空气污染治理的有效性具有重要意义。     

问题解决中的元认知策略训练

元认知策略是指学生将正在进行的学习活动作为意识对象 ,不断实施自我监控的过程 .这个过程主要包括三方面 ;一是对自己学习活动的事先计划和安排 ;二是对自己实际学习活动的监察、评价、反馈 ;三是在此基础上对自己的学习活动进行调节、修正和控制 .可见元认知策略是应用于整个学习过程的“导航器” ,在这种策略的指导下 ,即便学习中思维受阻 ,也会及时校正思维方向 ,调整思维路径 ,形成合理的认知结构 .1　元认知策略的教学原则在元认知策略教学中 ,为了达到训练目的 ,使训练富有成效 ,需要遵循四条基本原则 .(1 )主体性原则 .发挥学生的…     

监察员背景特征对民航安全监管绩效的影响研究

为探索民航安全监察员背景特征对民航安全监管绩效的影响作用.系统分析了衡量民航安全监管绩效的维度,并构建了其与监察员性别、年龄、学历、专业背景、企事业单位工作经历和籍贯6个背景特征之间的假设关系,通过问卷调查的方式收集数据,利用单因素方差检验和独立样本T检验验证了原假设.结果表明:不同背景特征的监察员对民航安全监管绩效的影响存在显著性差异.年龄差异体现在监管效能上,性别差异体现在监管效能和监管成本方面,是否具有民航企事业单位工作经历体现在监管效率上.在民航安全监察效能方面,男性要高于女性,40~50岁的监察员对监管效能的影响最高;在民航安全监管成本控制方面,女性要优于男性;具有民航企事业单位工作经历的监察员的监管效率高于不具有类似工作经历的人员.不同年龄段、学历和籍贯的监察员对监管效率均不存在显著性差别.     

基于PT-MA理论的煤矿安全群体行为演化博弈分析

将前景理论(PT)和心理账户(MA)理论相结合引入到矿工群体、监管群体的演化博弈决策过程中,构建了效价账户和成本账户前景收益感知矩阵,得到不同情况下演化系统所达到的均衡状态,发现当实施安全行为和监管行为与实施对立行为的价值感知收益偏差呈同化正向收敛时,安全行为和监管行为的演化趋于理想状态。但在现实状况下,群体行为演化并不能达到理想的结果,原因如下:(1)安全行为成本、监管行为成本较高,安全行为效价、监管行为效价较低;(2)效价感知函数参照点高,成本感知函数参照点低;(3)矿工、监管群体面对效价收益时更倾向于风险厌恶,面对成本损失时更倾向于风险追求;(4)群体决策更倾向于低估高概率事件(事故概率、监察概率、举报概率)。最后构建Matlab算法,进行演化博弈数值模拟,验证了调节各参数对行为演化的影响作用。本文为煤矿安全监管提供了新的思路,同时对其他领域的安全监管提供了借鉴价值。     

管件无模拉伸成形力能参数数学模型研究

对不锈钢管件无模拉伸变形速度场及力能参数进行了理论及实验研究.分析了不锈钢管件无模拉伸的变形模型、速度场以及力能参数的影响因素及影响规律,采用上限法确定了不锈钢管件无模拉伸速度场及力能参数物理模型,填补了国内外关于不锈钢管件无模拉伸变形及力能参数物理模型研究的空白.为不锈钢管件无模拉伸工艺工业化应用奠定基础.     

Two trees which are self-intersecting when drawn simultaneously

A current topic in graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing for both of the sets. It has been found out that only restricted classes of planar graphs can be drawn simultaneously using straight lines and without crossings within the same edge set. In this paper, we negatively answer one of the most often posted open questions namely whether any two trees with the same vertex set can be drawn simultaneously crossing-free in a straight-line way.     

Great-circle tree thrackles

A thrackle is a graph drawing in which every pair of edges meets exactly once. Conway's Thrackle Conjecture states that the number of edges of a thrackle cannot exceed the number of its vertices. Cairns et al. (2015) [1] prove that the Thrackle Conjecture holds for great-circle thrackles drawn on the sphere. They also posit that Conway's Thrackle Conjecture can be restated to say that a graph can be drawn as a thrackle drawing in the plane if and only if it admits a great-circle thrackle drawing. We demonstrate that the class of great-circle thrackleable graphs excludes some trees. Thus the informal conjecture from Cairns et al. (2015) [1] is not equivalent to the Thrackle Conjecture.     

Visibility Drawings of Plane 3-Trees with Minimum Area

A visibility drawing of a plane graph G is a drawing of G where each vertex is drawn as a horizontal line segment and each edge is drawn as a vertical line segment such that the line segments use only grid points as their endpoints. The area of a visibility drawing is the area of the smallest rectangle on the grid which encloses the drawing. A minimum-area visibility drawing of a plane graph G is a visibility drawing of G where the area is the minimum among all possible visibility drawings of G. The area minimization for grid visibility representation of planar graphs is NP-hard. However, the problem can be solved for a fixed planar embedding of a hierarchically planar graph in quadratic time. In this paper, we give a polynomial-time algorithm to obtain minimum-area visibility drawings of plane 3-trees.     

Voronoi drawings of trees

We study the problem of characterizing sets of points whose Voronoi diagrams are trees and if so, what are the combinatorial properties of these trees. The second part of the problem can be naturally turned into the following graph drawing question: Given a tree T, can one represent T so that the resulting drawing is a Voronoi diagram of some set of points? We investigate the problem both in the Euclidean and in the Manhattan metric. The major contributions of this paper are as follows.

• We characterize those trees that can be drawn as Voronoi diagrams in the Euclidean metric.

• We characterize those sets of points whose Voronoi diagrams are trees in the Manhattan metric.

• We show that the maximum vertex degree of any tree that can be drawn as a Manhattan Voronoi diagram is at most five and prove that this bound is tight.

• We characterize those binary trees that can be drawn as Manhattan Voronoi diagrams.

Pointed drawings of planar graphs

We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater than π. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic Bézier curves (parabolic arcs), even if the positions of the vertices are predefined by a given plane straight-line drawing of the graph. Moreover, the graph can be drawn with circular arcs if the vertices can be placed arbitrarily. The topic is related to non-crossing drawings of multigraphs and vertex labeling.     

Measuring and investigating strategic knowledge about drawing to solve geometry modelling problems

We report on the construction, validation, and implementation of an instrument for measuring students’ strategic knowledge about drawing for geometry modelling problems, namely, the strategic knowledge about drawing scale. We conducted a qualitative study and a quantitative study to validate the proposed construction and interpretation of the scale and to obtain initial findings on students’ strategic knowledge about drawing. Results showed that ninth-grade students in the intermediate achievement track had less elaborated strategic knowledge about drawing than their peers in the high achievement track. Further, strategic knowledge about drawing was found to be related to drawing accuracy and modelling performance even when cognitive abilities and interest were controlled for. The current study suggests that promoting strategic knowledge about drawing might be a means to increase drawing and modelling performance—especially among non-high-achieving students.     

Some provably hard crossing number problems

This paper presents a connection between the problem of drawing a graph with the minimum number of edge crossings, and the theory of arrangements of pseudolines, a topic well-studied by combinatorialists. In particular, we show that any given arrangement can be forced to occur in every minimum crossing drawing of an appropriate graph. Using some recent results of Goodman, Pollack, and Sturmfels, this yields that there exists no polynomial-time algorithm for producing a straight-line drawing of a graph, which achieves the minimum number of crossings from among all such drawings. While this result has no bearing on the P versus NP question, it is fairly negative with regard to applications. We also study the problem of drawing a graph with polygonal edges, to achieve the (unrestricted) minimum number of crossings. Here we obtain a tight bound on the smallest number of breakpoints which are required in the polygonal lines. This work was partially supported by the Center for Telecommunications Research, Columbia University.     

The projection method in evaluating multiple integrals

Projections are fundamental to computations involving areas and volumes and are emphasized as such in all textbooks. In this note it is shown how one can work out projections in suitable planes without actually drawing the figure by using inequalities as a substitute for drawing, and their usefulness is illustrated by examples in which a drawing is either very difficult or time-consuming.