寂静岭4：凶宅

作为日本Konanli公司的王牌恐怖游戏，《寂静岭》系列到目前为止已经推出了三代《凶宅》。     

寂静岭Ⅴ

2001年，《寂静岭2》的发售让这个恐怖游戏系列走向了巅峰，然而至此之后．即使是最铁杆的玩家也不得不承认该系列正在走下坡路。《寂静岭3》或许在剧情吸引力方面是最高的，但是在游戏性上却大不如前。《寂静岭4》则被人抱怨完全不像《寂静岭》。这些作品本身并不算糟糕，但销量和评价的下滑是摆在眼前的事实。因此Konami希望在第5作中．《寂静岭》能够体现新的风貌。为此，Konami将《寂静岭Ⅴ》的开发外包给了“The Collective”工作室，他们之前曾制作了“吸血鬼猎人巴菲”．《达芬奇密码》等。这次是这家小工作室接到的最大项目，他们已经倾尽全力，希望借此一炮而红。     

人人心中都有一座寂静岭

《寂静岭》（Silent Hill）系列是KONAMI公苛招牌系列作之一，以动作解谜的游戏方式，带领玩家走进迷雾重重的小镇寂静岭，来揭露心中被隐藏起来的噩梦，并被游戏流程中不同的选择引领至多种结局。     

寂静岭 记忆之书

虽然在E3上已有情报放出,但在看到科隆游戏展上的首批游戏截图和演示后相信还是“雷”到了不少玩家,“《寂静岭》系列”在走了几年的下坡路之后。这次彻底的将以往游戏方式推翻,来了个惊天动地的大变身,华尔兹看到本作的画面后也是倒吸一口凉气,这真的是《寂静岭》么？     

寂静岭 暴雨

其实在上期杂志的时候我有点冤枉这个游戏：它还是有一些水平比较高的谜题的．但是都在支线任务里。说句实话如果这些谜题能够在主线剧情中出现的话我觉得还是能够给游戏加分不少的。其实我个人认为，     

寂静岭

可以体验身临其境的恐怖感的“寂静岭”系列。虽然本作没有使用Prerender，全部的电影都是Realfime，但将电影部分和游戏部分一体化之后的效果怎样呢？这里就从概念到实际制作进行详尽的介绍。     

暴雨将至，噩梦将临

“《寂静岭》系列”的处境每况愈下，但Konami从不放弃。不断寻找欧美开发团队，希望让该系列焕发活力。最新作《寂静岭暴雨》由捷克的Vatra Games开发，他们以本地的一些神秘实景为灵感，将再次把玩家带到雾气蒙蒙的恐怖世界。本作的目标正是重返经典生存恐怖游戏之道，同时在系统上又紧跟潮流。     

重返寂静岭上部——《寂静岭5——归途》剧情小说

刺耳的警报伴随着爆炸带来的轰鸣，乱作一片。周围震颤着，嘎啦啦作响。异常的颠簸，令我睁开眼睛，忽然发现自己躺在手推床上，有人正推着我，走过一道道昏暗的走廊。     

VINT HILL FARMS STATION

Several highlights of contributions from Vint Hill Farms Station are offered as the closing of the station is reported.     

HOW TO MAKE THE HILL CIPHER SECURE

ABSTRACT

This paper presents a symmetric cipher that is actually a variation of the Hill cipher. The new scheme makes use of “random” permutations of columns and rows of a matrix to form a “different” key for each data encryption. The cipher has matrix products and permutations as the only operations which may be performed “efficiently” by primitive operators, when the system parameters are carefully chosen.     

地貌晕渲图的生成原理与实现

讨论晕渲图的特点和意义,介绍晕渲图的基本原理;给出GIS中基于DEM数据晕渲图生成的算法实现。该算法能够快速、自动地生成黑白或彩色地貌晕渲图。     

A TENSOR-THEORETIC ENHANCEMENT TO THE HILL CIPHER SYSTEM

The Hill matrix algorithm[3], published in 1929, is known for being the first purely algebraic cryptographic system and for starting the entire field of algebraic cryptology. In this paper, an operator derived from ring isomorphism theory is adapted for use in the Hill system which greatly increases the block size that a matrix can encrypt; specifically, a k×k invertible matrix over Z _n represents an invertible matrix of order k ³, which produces ciphertext blocks k ²-times as long as the original matrix could. This enhancement increases the Hill system's security considerably.     

A counterexample to the chain rule for conditional HILL entropy

Most entropy notions \({H(.)}\) like Shannon or min-entropy satisfy a chain rule stating that for random variables \({X,Z,}\) and \({A}\) we have \({H(X|Z,A)\ge H(X|Z)-|A|}\). That is, by conditioning on \({A}\) the entropy of \({X}\) can decrease by at most the bitlength \({|A|}\) of \({A}\). Such chain rules are known to hold for some computational entropy notions like Yao’s and unpredictability-entropy. For HILL entropy, the computational analogue of min-entropy, the chain rule is of special interest and has found many applications, including leakage-resilient cryptography, deterministic encryption, and memory delegation. These applications rely on restricted special cases of the chain rule. Whether the chain rule for conditional HILL entropy holds in general was an open problem for which we give a strong negative answer: we construct joint distributions \({(X,Z,A)}\), where \({A}\) is a distribution over a single bit, such that the HILL entropy H ^HILL \({(X|Z)}\) is large but H ^HILL \({(X|Z,A)}\) is basically zero.Our counterexample just makes the minimal assumption that \({{\mathbf{NP}} \nsubseteq{\mathbf{P/poly}}}\). Under the stronger assumption that injective one-way function exist, we can make all the distributions efficiently samplable.Finally, we show that some more sophisticated cryptographic objects like lossy functions can be used to sample a distribution constituting a counterexample to the chain rule making only a single invocation to the underlying object.     

互信息与爬山法相结合的贝叶斯网络结构学习

针对爬山法容易陷入局部最优,而随机重复爬山法时间开销过大的问题,将互信息与爬山法相结合,提出了MI&HC贝叶斯网络结构学习算法。首先利用互信息构建初始网络结构,再从该网络结构开始利用爬山法进行贝叶斯网络结构学习。仿真结果表明:MI&HC算法,对小型稀疏网络结构的学习效果非常好,对较大型的网络结构的学习也能得到令人满意的结果;该算法不需要节点顺序这一先验信息,却能获得与K2算法相当的学习效果。     

AN EXTENSION OF HILL CIPHER USING GENERALISED INVERSES AND mth RESIDUE MODULO n

Hill Cipher is a symmetric polyalphabetic block cipher that enciphers a string of letters into another string of the same length using the linear transformation y=xK. In deciphering, the determinant value must be less than 26 and relatively prime to 26 so that the matrix K of the linear transformation is invertible in modulo 26. The Affine Hill cipher extends the concept of Hill cipher by using the non-linear transformation y=xK+b. In this paper, we extend this concept to encrypt a plaintext of blocksize m to a ciphertext of blocksize n≥m using (a) affine transformation and (b) polynomial transformation to make this cipher more secure. Here the matrix K of the transformation need not be a square matrix. To enable decryption, we state the conditions to be satisfied by K which are as follows. Case (a): (i) For affine transformation, the generalised inverse K ⁺ of the matrix K corresponding to the transformation should satisfy the equation KK ⁺=I in modulo p where p is a chosen prime p>26. For m=n, K ⁺ is the usual inverse of the matrix K. Case(b): (i) For polynomial transformation, the generalised inverse K ⁺ should satisfy the above condition, (ii) If r is the degree of the polynomial, then choose those values of s≤r such that the sth root of modulo p exists for all elements in Z _p . In other words, choose those values of s that are relatively prime to Φ(p).     

中点偏移算法构建分形山的病态值分析及解决

本文在对大量数据进行检验的基础上,对建分形山的中点偏移算法及其参数进行了分析,并发现病态值的出现,经分析后,提出解决方案。