Holographic dual of linear dilaton black hole in Einstein-Maxwell-dilaton-axion gravity

Motivated by the recently proposed Kerr/CFT correspondence, we investigate the holographic dual of the extremal and non-extremal rotating linear dilaton black hole in Einstein-Maxwell-Dilaton-Axion Gravity. For the case of extremal black hole, by imposing the appropriate boundary condition at spatial infinity of the near horizon extremal geometry, the Virasoro algebra of conserved charges associated with the asymptotic symmetry group is obtained. It is shown that the microscopic entropy of the dual conformal field given by Cardy formula exactly agrees with Bekenstein-Hawking entropy of extremal black hole. Then, by rewriting the wave equation of massless scalar field with sufficient low energy as the SLL(2, R) x SLR(2, R) Casimir operator, we find the hidden conformal symmetry of the non-extremal linear dilaton black hole, which implies that the non-extremal rotating linear dilaton black hole is holographically dual to a two dimensional conformal field theory with the non-zero left and right temperatures. Furthermore, it is shown that the entropy of non-extremal black hole can be reproduced by using Cardy formula.

几类旋转对称布尔函数的密码学性质

Sumanta Sarkar等人给出了一类具有最大代数免疫阶的旋转对称布尔函数,但对给出的旋转对称布尔函数仅研究了该函数的非线性度而对其他密码学性质未加以研究.因此,研究了上面给出的旋转对称布尔函数的其他密码学性质:代数次数、线性结构、扩散性、相关免疫性等.研究结果显示,虽然这类布尔函数的代数免疫阶达到最大,但是其他的密码学性质并不好.因此,此类布尔函数并不能直接应用在密码系统中.

寻找布尔函数的零化子

通过解方程组来研究密码系统,是代数攻击的研究内容代.对方程组降次是降低求解复杂度的一种重要方法.为了达到这个目的,引入了布尔函数零化子的概念.然而迄今为止,尚未有求解零化子的有效算法.这篇文章提出了一种计算给定布尔函数的零化子集的算法.由前两个算法,可以得到给定布尔函数的零化子集的一组基;从第三个算法,可以得到最低次数的零化子.算法的复杂度与函数的单项式个数相关.对流密码来说,在很多情况下,相比以前的算法而言,这种算法的复杂度大为降低.最后,我们将给出一个实例,说明算法是如何工作的.

a computational proof of complexity of some restricted counting problems

South Central University

THE ALGEBRAIC-METHOD ESTIMATING +/-PI/2 TYPE OF PHASES OF STRUCTURE FACTORS

The algebraic formulas of 1.5 and 2.5 rank which can be applied to estimating +/- pi/2 type of phases for P2(1)2(1)2(1) space group were derived using the method of structure factor algebra. Both types of the formulas are satisfactory for two known crystal structures in estimating their +/- pi/2 type of phases.

The cDNA cloning and mRNA expression of heat shock protein 70 gene in the haemocytes of bay scallop (Argopecten irradians, Lamarck 1819) responding to bacteria challenge and naphthalin stress

Heat shock protein 70 (HSP70) is an important member of the heat shock protein superfamily, and it plays a key role in the process of protecting cells, facilitating the folding of nascent peptides and responding to stress. The cDNA of bay scallop Argopecten irradians HSP70 (designated AIHSP70) was cloned by the techniques of homological cloning and rapid amplification of cDNA end (RACE). The full length of AIHSP70 cDNA was 2651 bp in length, having a 5' untranslated region (UTR) of 96 bp, a 3' UTR of 575 bp, and an open reading frame (ORF) of 1980 bp encoding a polypeptide of 659 amino acids with an estimated molecular mass of 71.80 kDa and an estimated isoelectric point of 5.26. BLAST analysis revealed that the AIHSP70 gene shared high identity with other known HSP70 genes. Three classical HSP signature motifs were detected in AIHSP70 by InterPro, analysis. 3-D structural prediction of AIHSP70 showed that its N terminal ATPase activity domain and,C terminal substrate-binding domain shared high similarity with that in human heat shock protein 70. The results indicated that the AIHSP70 was a member of the heat shock protein 70 family. A semi-quantitive RT-PCR method was used to analyse the expression of AIHSP70 gene after the treatment of naphthalin which is one kind of polycyclic aromatic hydrocarbon (PAH) and the challenge of bacteria. mRNA expression of AIHSP70 in scallop was up-regulated significantly after the stimulation of naphthalin and increased with increasing naphthalin concentration. A clearly time-dependent expression pattern of AIHSP70 was observed after the scallops were infected by Vibrio anguillarum, and the mRNA expression reached a maximum level at 8 h and lasted to 16 h, and then dropped progressively. The results indicated that AIHSP70 could play an important role in mediating the environmental stress and immune response in scallop. (c) 2006 Elsevier Ltd. All rights reserved.

含空值关系数据库中关系代数的实现

本文从空值的完全语义出发,依据空值环境下信息等价和信息相容的含义,全面定义了空值环境下运算结果完备的关系代数运算,并对空值环境下关系代数运算的有效性和完备性进行了讨论。

关系模型中不确定信息与可能信息的引入与处理

In this paper,the traditional relational model is extended in order to express indefinite and maybe information. On the basis of the extended relational model.,the foundamental operations in relational algebra are defined again,and the policy and algorithm for updating relational database are given.

含有空值关系数据库的查询处理

本文在深刻理解空值语义的基础上，给出一种处理占位型空值的方法。讨论了空值环境下关系数据库的查询策略，定义了含三种查询操作的关系代数最小完备集中的关系代数运算，并对查询计算的有效性和完备性进行了分析。

空值环境下含不确定及可能信息关系数据库的查询

本文以［１］中的扩展关系模型为基础在两种元组级的不完全信息──不确定及可能信息中引入属性级的不完全信息空值，使两种不同性质的不完全信息同时出现在同一关系中。为了能够查询到不同种类及不同确定程度的信息，文中制定了这种扩展关系模型上关系的查询策略，定义了能够体现这种策略的最小关系代数运算。

空值环境下关系数据库的更新 Ⅰ：扩展关系模型及基本运算

本文从空值语义及更新操作的关系出发，提出了一种新的扩展关系模型，用以组织更新操作下的含有空值的关系数据库中的信息．同时，定义了这种模型下的基本关系代数运算．为实现空值环境下关系数据库的数据更新奠定了基础。

积分偏移的计算几何与并行实现

The Second Round of Oil & Gas Exploration needs more precision imaging method, velocity vs. depth model and geometry description on Complicated Geological Mass. Prestack time migration on inhomogeneous media was the technical basic of velocity analysis, prestack time migration on Rugged surface, angle gather and multi-domain noise suppression. In order to realize this technique, several critical technical problems need to be solved, such as parallel computation, velocity algorithm on ununiform grid and visualization. The key problem is organic combination theories of migration and computational geometry. Based on technical problems of 3-D prestack time migration existing in inhomogeneous media and requirements from nonuniform grid, parallel process and visualization, the thesis was studied systematically on three aspects: Infrastructure of velocity varies laterally Green function traveltime computation on ununiform grid, parallel computational of kirchhoff integral migration and 3D visualization, by combining integral migration theory and Computational Geometry. The results will provide powerful technical support to the implement of prestack time migration and convenient compute infrastructure of wave number domain simulation in inhomogeneous media. The main results were obtained as follows: 1. Symbol of one way wave Lie algebra integral, phase and green function traveltime expressions were analyzed, and simple 2-D expression of Lie algebra integral symbol phase and green function traveltime in time domain were given in inhomogeneous media by using pseudo-differential operators’ exponential map and Lie group algorithm preserving geometry structure. Infrastructure calculation of five parts, including derivative, commutating operator, Lie algebra root tree, exponential map root tree and traveltime coefficients , was brought forward when calculating asymmetry traveltime equation containing lateral differential in 3-D by this method. 2. By studying the infrastructure calculation of asymmetry traveltime in 3-D based on lateral velocity differential and combining computational geometry, a method to build velocity library and interpolate on velocity library using triangulate was obtained, which fit traveltime calculate requirements of parallel time migration and velocity estimate. 3. Combining velocity library triangulate and computational geometry, a structure which was convenient to calculate differential in horizontal, commutating operator and integral in vertical was built. Furthermore, recursive algorithm, for calculating architecture on lie algebra integral and exponential map root tree (Magnus in Math), was build and asymmetry traveltime based on lateral differential algorithm was also realized. 4. Based on graph theory and computational geometry, a minimum cycle method to decompose area into polygon blocks, which can be used as topological representation of migration result was proposed, which provided a practical method to block representation and research to migration interpretation results. 5. Based on MPI library, a process of bringing parallel migration algorithm at arbitrary sequence traces into practical was realized by using asymmetry traveltime based on lateral differential calculation and Kirchhoff integral method. 6. Visualization of geological data and seismic data were studied by the tools of OpenGL and Open Inventor, based on computational geometry theory, and a 3D visualize system on seismic imaging data was designed.

相同知识背景下技能之间迁移机制的研究

Since the middle of 1980's, the mechanisms of transfer of training between cognitive subskills rest on the same body of declarative knowledge has been highly concerned. The dominant theory is theory of common element (Singley & Anderson, 1989) which predict that there will be little or no transfer between subskills within the same domain when knowledge is used in different ways, even though the subskills might rest on a common body of declarative knowledge. This idea is termed as "principle of use specificity of knowledge" (Anderson, 1987). Although this principle has gained some empirical evidence from different domains such as elementary geometry (Neves & Anderson, 1981) and computer programming (McKendree & Anderson, 1987), it is challenged by some research (Pennington et al., 1991; 1995) in which substantially larger amounts of transfer of training was found between substills that rest on a shared declarative knowledge but share little procedures (production rules). Pennington et al. (1995) provided evidence that this larger amounts of transfer are due to the elaboration of declarative knowledge. Our research provide a test of these two different explanation, by considering transfer between two subskills within the domain of elementary geometry and elementary algebra respectively, and the inference of learning method ("learning from examples" and "learning from declarative-text") and subject ability (high, middle, low) on the amounts of transfer. Within the domain of elementary geometry, the two subskills of generating proofs" (GP) and "explaining proofs" (EP) which are rest on the declarative knowledge of "theorems on the characters of parallelogram" share little procedures. Within the domain of elementary algebra, the two subskills of "calculation" (C) and "simplification" (S) which are rest on the declarative knowledge of "multiplication of radical" share some more procedures. The results demonstrate that: 1. Within the domain of elementary geometry, although little transfer was found between the two subskills of GP and EP within the total subjects, different results occurred when considering the factor of subject's ability. Within the high level subjects, significant positive transfer was found from EP to GP, while little transfer was found on the opposite direction (i. e. from GP to EP). Within the low level subjects, significant positive transfer was found from EP to GP, while significant negative transfer was found on the opposite direction. For the middle level subject, little transfer was found between the two subskills. 2. Within the domain of elementary algebra, significant positive transfer was found from S to C, while significant negative transfer was found on the opposite direction (i. e. from C to S), when considering the total subjects. The same pattern of transfer occurred within the middle level subjects and low level subject. Within the high level subjects, no transfer was found between the two subskills. 3. Within theses two domains, different learning methods yield little influence on transfer of training between subskills. Apparently, these results can not be attributed to either common procedures or elaboration of declarative knowledge. A kind of synthetic inspection is essential to construct a reasonable explanation of these results which should take into account the following three elements: (1) relations between the procedures of subskills; (2) elaboration of declarative knowledge; (3) elaboration of procedural knowledge. 排Excluding the factor of subject, transfer of training between subskills can be predicted and explained by analyzing the relations between the procedures of two subskills. However, when considering some certain subjects, the explanation of transfer of training between subskills must include subjects' elaboration of declarative knowledge and procedural knowledge, especially the influence of the elaboration on performing the other subskill. The fact that different learning methods yield little influence on transfer of training between subskills can be explained by the fact that these two methods did not effect the level of declarative knowledge. Protocol analysis provided evidence to support these hypothesis. From this research, we conclude that in order to expound the mechanisms of transfer of training between cognitive subskills rest on the same body of declarative knowledge, three elements must be considered synthetically which include: (1) relations between the procedures of subskills; (2) elaboration of declarative knowledge; (3) elaboration of procedural knowledge.

The Bifurcation Interpreter: A Step Towards the Automatic Analysis of Dynamical Systems

The Bifurcation Interpreter is a computer program that autonomously explores the steady-state orbits of one-parameter families of periodically- driven oscillators. To report its findings, the Interpreter generates schematic diagrams and English text descriptions similar to those appearing in the science and engineering research literature. Given a system of equations as input, the Interpreter uses symbolic algebra to automatically generate numerical procedures that simulate the system. The Interpreter incorporates knowledge about dynamical systems theory, which it uses to guide the simulations, to interpret the results, and to minimize the effects of numerical error.