净化网络游戏工作展开

由文化部、中央文明办会同信息产业部、公安部、国家工商行政管理总局在全国开展的净化网络游戏工作,已明确职责并正渐次展开。净化网络游戏工作有5个重点：一是打击含有淫秽、色情、赌博、暴力、迷信、非法交易敛财和危害国家安全等违法内容的网络游戏产品及相关经营行为;二是查处未经主管部门审查擅自上网运营的境外游戏产品;     

帮助官兵走出网络赌博的陷阱

近年来,随着智能手机、云计算、大数据的不断发展,网络给人们的工作生活带来诸多便利的同时,也带来了许多新问题。一些官兵思想麻痹、目无法纪、沉迷网络赌博,因赌而贷、因赌而偷甚至因赌而亡,教训十分惨痛,值得高度警惕。一、乱花渐欲迷人眼——网络赌博有哪些形式网络赌博与传统赌博相比,具有操作便利、隐蔽性强、诱惑性大、传播速度快等特点,令人防不胜防,必须引导官兵认清看似平常的网络行为背后隐藏的赌局。     

十劝诸君莫赌博

一劝诸君莫赌博,赌博场上是非多,宜将醒眼看醉人,哪个赌汉好结果?二劝诸君莫赌博,赌博上身难脱壳,输钱本从赢钱起,赢得少来输得多。三劝诸君莫赌博,伤神劳心     

跨境赌博问题屡禁不绝的原因及对策分析

跨境赌博活动是当前影响我国社会稳定的重要治安问题之一,虽然经过公安机关的集中打击,在一定时期内取得了一定的成效,但集中打击过后在很多地区又出现重新开业或者变化形式逃避打击的现象。从历史、认识、法律、经济利益、网络赌博以及边境管理现状等方面,对我国跨境赌博活动屡禁不绝的原因进行了分析,提出了遏制跨境赌博活动的打防对策。     

上杭县人武部警民合力打击赌博犯罪

今年以来,福建省上杭县人武部组织民兵配合公安机关重拳出击,开展了打击赌博违法犯罪活动专项行动,共查处赌博案件169起,涉案人员534人,摧毁赌博团伙45个,受到广大群众的一致赞誉。该县根据近年来赌博活动的新变化,按照“打头断线、摧毁网络、端窝查点、彻底根除”的工作方针,把工作重点放在“打庄家赌     

网络环境下帮助官兵过好“网络关”的对策思考

当前部队官兵涉网倾向性问题频发高发,是各级安全管理工作的重中之重。各级干部骨干要注重分析特点规律,研究方法对策,着力提高各级应对处置涉网倾向性问题的能力。现将几类重点问题分析如下:一、网络赌博问题。网络赌博相对于传统形式的赌博更方便,一部手机或一台电脑就能完成赌博的全部程序,不受时间和地点的限制;更隐蔽,不需要场地、不需要聚集、不使用现金,茶余饭后、休息间隙都能够完成操作;更迅速,三五分钟见胜负,动动手指出输赢.     

对战士上网问题的思考

在现代信息社会中,随着信息网络技术的发展与普及,互联网已经走进了人们工作、生活等各个角落,并且步入了军营。调查中发现,战士上网冲浪主要有以下几个方面:(1)玩网络游戏。70%的战士说,上网主要是玩网络游戏,从最初的小型游戏,如打麻将、打台球以及扑克等,发展成为《半条命》、《三国演义》、《传奇》等大型游戏,并且在玩精了之后,有一种自豪感。他们还说,自己对网络的认识就是网络游戏,用鼠标就可以灵活掌握,除此之外,其他的基本没有兴趣。(2)网上聊天和交友。25%的战士说,自己上网主要是以聊天、交朋友为主。部队管得比较严,思想、文化…     

狠刹赌博歪风

近几年来,各种“热”很多,但都没有“赌博热”热得持久,热得炽人。一些人赌博隐之大,宁可违法乱纪、家破人亡、妻离子散也要没日没夜的赌,这种现象的确令人深思。 众所周知,赌博是害己害人危害性极大的一种活动,但就其初始的危害性来说,往往被人们所忽视。不少人认为,搞娱乐活动来点真格的才有刺激,     

赌场戒赌“妙方”

安徽省濉溪县徐楼镇程楼村基干民兵王志峰,组办“信息之家”,有效地刹住了赌博风。 王志峰以前是个赌博大王,深受其害,为让别     

一封浸满悔恨泪水的遗书

这是一封令人深思的遗书。他从一支香烟开始,逐步滑入了赌博这座死亡的坟墓。家庭是社会的细胞,赌博是旧社会遗留下来的恶习。一个美满幸福的家庭竞被赌博这一恶习给毁灭了,多么令人痛心和惋惜。广大民兵,特别是已经沾染上这一恶习的民兵同志,应该认真地读一读此文,从中得到教益和告诫。编者     

全球信息网格节点移动性及路由特性

全球信息网格和因特网的一个主要差别表现在节点移动性及路由特性上,深入研究全球信息罔格节点移动性及路由特性是完善信息网格体系结构的基础.首先,给出了基于节点移动性的动态拓扑对全球信息网格BGP的影响分析.其中重点分析了其影响的两个层次:路由器层次拓扑连接图和AS层次拓扑连接图;然后简单分析了节点移动性对路由安全的影响;最后,在前面分析的基础上深入研究了全球信息网格的路由特性.     

A rent‐seeking model of international competition and alliances∗

This paper presents an alternative approach for analyzing international competition and alliances as rent‐seeking contests that are able to capture the impure public good nature of defense spending. Two‐country Cournot and Stackelberg games are considered and comparative static results derived. A three‐country model is investigated, and alliance behavior is explored in the context of this rent‐seeking model. The conjecture that an alliance may become less effective if the allies’ interests become more closely aligned is verified. Finally, the model is generalized, and a Nash‐Cournot equilibrium is computed.     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A family of games on 1,∞)2 with payoff a function of y/x

A two-parameter class of games on 1,∞)² is studied. The games may be regarded as analogs of Silverman games, having continuous payoff function in place of a step function of y/x. This change is motivated by a desire to move toward a model for competitive situations where the penalty for overspending increases with the amount of overspending. There are some similarities to games with bell-shaped kernel. For most of the region considered in the plane of the two parameters there are solutions of finite type, which are obtained explicitly. There are, however, pockets in this plane where no optimal strategies have been found and possibly where none of finite type exist.     

不同游戏方式下的暴力网络游戏对大学生攻击性的影响

目的:探讨不同游戏方式下的暴力网络游戏对不同攻击性特质大学生攻击性的影响。方法:采用攻击性特质问卷、词汇决策任务和竞争反应时任务对60名大学生进行问卷和实验研究。结果:在不同游戏方式下,被试表现出的攻击性认知和行为存在显著差异(F(2,52)=4.41,P<0.05;F(1,52)=50.06,P<0.001)。高、低攻击性特质者在游戏后的攻击性认知和行为上存在显著差异(F(1,52)=15.25,P<0.001;F(1,52)=82.35,P<0.001)。结论:不同游戏方式下的暴力网络游戏对大学生的攻击性存在不同的影响,相比竞争游戏和单人游戏,合作游戏是一种较好的游戏方式,可以在一定程度减少大学生,特别是高攻击性特质大学生的攻击性认知和行为。此外,暴力网络游戏对大学生攻击性认知和攻击性行为的影响存在一致性。     

On a class of nash-solvable bimatrix games and some related nash subsets

This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory.     

Multilinear extensions and the banzhaf value

It is shown that the Banzhaf value can be obtained by differentiating the multilinear extension of a game at the midpoint of the unit cube. This gives us a composition theorem for the value of compound games. As an example, the values of the electoral college and presidential election “games” are approximated by the method of extensions.     

灰色矩阵对策

本文结合灰色系统与对策论的知识,给出了以区间型灰数为元素的灰矩阵对策的定义,讨论了灰矩阵对策在纯策略与混合策略意义下的最优策略及灰解的存在性。     

A saddle-point theorem for a class of infinite games

In this paper, the existence of a saddle point for two-person zero-sum infinite games of a special type is proved. The games have continuous bilinear payoff functions and strategy sets which are convex, noncompact subsets of an infinite-dimensional vector space. The closures of the strategy sets are, however, compact. The payoff functions satisfy conditions which allow the use of dominance arguments to show that points in the closure of a strategy set are dominated by or are strategically equivalent to points in the strategy set itself. Combining the dominance arguments with a well-known existence theorem produces the main result of the paper. The class of games treated is an extension of a class studied by J. D. Matheson, who obtained explicit solutions for the saddle points by using necessary conditions.