论谎言的道德价值

必要的、适度的、非恶意的说谎是可以接受的；频繁的、刻意的、不必要的说谎令人反感与厌恶。恶意的、造成负面影响的说谎要予以严惩与打击；只有在力环境所迫的情况下、心怀善意且取得正面效应的谎言，才有积极的道德价值。     

Some LC experiments with capillary columns

Some experimental results of LC in capillary columns are presented. The possible effect of turbulence which has been much emphasised lately is overrated. The future of LC in capillary columns lies in extreme miniaturization.     

涉及图片造假的鉴定

通过对造假情况的分析,阐明了对虚假图片的鉴定原理,同时提供了各种造假手段的鉴定方法,并介绍了由图片鉴定引出的深层次问题,为人们进行图片编辑、刑事侦察、重构历史画面提供了理论依据.     

有趣的悖论:评霍尔顿的谎言

在20世纪50年代的美国作家J.D.赛林格的小说《麦田里的守望者》中,主人公霍尔顿.考菲尔德的口语化叙述是小说的鲜明特色,而其叙述中的一重要现象——谎言一直为评论界所忽视。霍尔顿的谎言表现出一种有趣的悖论性:作为青春期少年成长过程中一个重要特点,霍尔顿的谎言既蕴涵一定的反叛性能量,是叛逆和自卫,同时又因其自身的缺陷而只能成为一种象征性的姿态。霍尔顿谎言的悖论性特点也加深了对小说主题的表现。     

Two-batch liar games on a general bounded channel

We consider an extension of the 2-person Rényi-Ulam liar game in which lies are governed by a channel C, a set of allowable lie strings of maximum length k. Carole selects x∈[n], and Paul makes t-ary queries to uniquely determine x. In each of q rounds, Paul weakly partitions [n]=A₀∪?∪At−1 and asks for a such that x∈Aa. Carole responds with some b, and if a≠b, then x accumulates a lie (a,b). Carole's string of lies for x must be in the channel C. Paul wins if he determines x within q rounds. We further restrict Paul to ask his questions in two off-line batches. We show that for a range of sizes of the second batch, the maximum size of the search space [n] for which Paul can guarantee finding the distinguished element is as q→∞, where Ek(C) is the number of lie strings in C of maximum length k. This generalizes previous work of Dumitriu and Spencer, and of Ahlswede, Cicalese, and Deppe. We extend Paul's strategy to solve also the pathological liar variant, in a unified manner which gives the existence of asymptotically perfect two-batch adaptive codes for the channel C.     

How to play the one-lie Rényi-Ulam game

The one-lie Rényi-Ulam liar game is a two-player perfect information zero-sum game, lasting q rounds, on the set [n]?{1,…,n}. In each round Paul chooses a subset A⊆[n] and Carole either assigns one lie to each element of A or to each element of [n]?A. Paul wins the original (resp. pathological) game if after q rounds there is at most one (resp. at least one) element with one or fewer lies. We exhibit a simple, unified, optimal strategy for Paul to follow in both games, and use this to determine which player can win for all q,n and for both games.     

n—p—m—n—p—m—n—p形式的发光模型及其实验证明

显微观测表明，在交流电场激发下，ＺｎＳ：Ｃｕ单晶不是整体发光，而是呈线状的发光区，这种发光区域为交流电致发光线（ＡＣＥＬ），我们的工作证明，交流电致发光线不是连续的发光体，而是断续的发光线，也就是说，在交流电致发光线中存在着不发光区，这种现象被称为“分段发光”从而验证了Ｗ．Ａ．Ｔｈｏｒｎｔｏｎ教授根据发光的损耗发电流和电压的关系得到类正向ｐ－ｎ结的伏安曲线而提出了，ＺｎＳ中可能存在的一连串的ｐ－ｎ     

民族器乐合奏曲《春江花月夜》的主题思考

民族器乐合奏曲《春江花月夜》是中国古今艺术家集体智慧的结晶,在漫长的创作过程中,它受多种姊妹艺术的滋润．主题也在不断升华,同时,它也是中国古代“天人合一”的哲学观和“和合为美”的美学思想的完美体现。     

论言语假信息在《金粉世家》中的应用简

言语假信息是一种语用策略,可分为两类,一类是利害假信息,一类是功能假信息.言语假信息与谎言是有区别的.具体分析了长篇小说《金粉世家》中的言语假信息,以使人们对其有更深入直观的了解,并能掌握其在现实生活中的应用.     

The Rényi–Ulam pathological liar game with a fixed number of lies

The q-round Rényi–Ulam pathological liar game with k lies on the set [n]{1,…,n} is a 2-player perfect information zero sum game. In each round Paul chooses a subset A[n] and Carole either assigns 1 lie to each element of A or to each element of [n]A. Paul wins if after q rounds there is at least one element with k or fewer lies. The game is dual to the original Rényi–Ulam liar game for which the winning condition is that at most one element has k or fewer lies. Define to be the minimum n such that Paul can win the q-round pathological liar game with k lies and initial set [n]. For fixed k we prove that is within an absolute constant (depending only on k) of the sphere bound, ; this is already known to hold for the original Rényi–Ulam liar game due to a result of J. Spencer.