生活质量视阈下的大学生“精神贫困”测量指标研究

高校大学生＂精神贫困＂现象已引起人们重视,成为多方关注话题。本文在梳理前人研究成果基础上,对＂精神贫困＂测量指标进行研究,以获得科学的测量指标体系,为获得真实科学的一手资料打进行理论论证。     

大学教学与科研关系的探讨

大学职能的发展历经了从教学主导到教学科研并举的演变。教学与科研在大学的发展历程和具体运作过程中存在着不可避免的矛盾。二者结合是优化资源配置、发展创新教育的最佳途径,对大学进行有效的分层定位是协调二者关系的关键。具体包括在宏观战略上明确定位,同时加强组织重构、分类管理等。此外,大学文化之于教学与科研和谐也十分重要。     

加快结构调整，促进经济发展方式转变

加快结构调整、促进经济发展方式转变是关系国民经济全局紧迫而重大的战略任务。本文以严谨的逻辑和充分的事实依据的基础,对成都市加快结构调整,促进经济发展方式转变的意义,方向和路径等进行了阐述。     

“实录”与“虚构”——试论唐叙事诗的叙事手法

唐叙事诗是我国文人叙事诗发展的一个高峰,其虚实相生的叙事手法值得探究。文章从传统诗学和叙事学角度对其进行分析。     

略论英语学习环境的构建

从自主学习理论出发,结合当前高职院校学生的英语学习现状,论述了高职学生英语自主学习中的学习环境的构建。通过构建良好的师生关系、轻松的课堂氛围、与同伴的多种协作关系、丰富的课外活动来促进学生的英语自主学习能力,为学生创造良好的英语学习环境。     

建设工程项目绿色采购供应商的选择研究

针对我国目前建设工程项目绿色采购的理论研究难以满足绿色采购的实践需求的现状,基于建设工程项目绿色采购的特点和供应商信息的灰色特征,将建设工程项目绿色采购供应商选择的信息指标在分成绿色产品、绿色关系和绿色企业的基础上构建具体的可操作性指标,运用灰色关联度模型进行供应商的选择,以推动建设工程项目绿色采购的发展.     

A power-aware code-compression design for RISC/VLIW architecture

We studied the architecture of embedded computing systems from the viewpoint of power consumption in memory systems and used a selective-code-compression (SCC) approach to realize our design.Based on t...     

Lattice-based key exchange on small integer solution problem

In this paper, we propose a new hard problem, called bilateral inhomogeneous small integer solution （Bi-ISIS）, which can be seen as an extension of the small integer solution problem on lattices. The main idea is that, instead of choosing a rectangle matrix, we choose a square matrix with small rank to generate Bi-ISIS problem without affecting the hardness of the underlying SIS problem. Based on this new problem, we present two new hardness problems： computational Bi-ISIS and decisional problems. As a direct application of these problems, we construct a new lattice-based key exchange （KE） protocol, which is analogous to the classic Diffie- Hellman KE protocol. We prove the security of this protocol and show that it provides better security in case of worst-case hardness of lattice problems, relatively efficient implementations, and great simplicity.     

Derivation and analysis of a filtered backprojection algorithm for cone beam projection data

The authors address the problem of three-dimensional image reconstruction from cone beam projections. Modifying a result due to A.A. Kirillov (Soviet Math. Dokl., vol. 2, p.268-9, 1961), the authors derive an inversion formula for the case where the cone vertices form an unbounded curve. For the special case in which the cone vertices form a circle, an approximate reconstruction formula is developed and shown to be essentially equivalent to the practical cone-beam algorithm of L.A. Feldkamp et al. (1984). For this approximate inverse, the authors derive the resulting spatially varying point spread function, examine the effect of bandlimiting due to sampling, and compare the resulting image quality as a function of the radius of the circle formed by the cone vertices.