民间艺术中“脸”的形态表现

“脸”作为一个视觉语言，是人类始终关注的话题，自然形态中的脸只是作为个体存在的符号，是一种个体标记，人类为了满足宗教、战争和美化身心的种种需要，以符号为手段的脸的艺术造型形式是原始先民对人自身的存在形式不满足而进行的改造，新的形式从此就应运而生。脸作为一种符号，其最初的呈现状态是以纹样的方式展现出来的，被赋予了神秘的色彩，是人类实践经验、情感以及文化的交流与发展的延续。     

水文系统预算编制工作的实践及建议

阐述了水文系统部门预算的具体编制方法,针对部门预算编制工作中存在的问题提出了相应的建议。     

Enhanced logical stochastic resonance under periodic forcing

It was demonstrated recently that noise in an optimal window allows a bistable system to operate reliably as reconfigurable logic gates (Murali et al., 2009) [1], as well as a memory device (Kohar and Sinha, 2012) [11]. Namely, in a range of moderate noise, the system can operate flexibly, both as a NAND/AND/OR/NOR gate and a Set Reset latch. Here we demonstrate how the width of the optimal noise window can be increased by utilizing the constructive interplay of noise and periodic forcing, namely noise in conjunction with a periodic drive yields consistent logic outputs for all noise strengths below a certain threshold. Thus we establish that in scenarios where noise level is below the minimum threshold required for logical stochastic resonance (or stochastic resonance in general), we can add a periodic forcing to obtain the desired effects. Lastly, we also show how periodic forcing reduces the switching time, leading to faster operation of devices and lower latency effects.     

Resolving Multiple Protein–Peptide Binding Events: Implication for HLA-DQ2 Mediated Antigen Presentation in Celiac Disease

Techniques that can effectively separate protein–peptide complexes from free peptides have shown great value in major histocompatibility complex (MHC)–peptide binding studies. However, most of the available techniques are limited to measuring the binding of a single peptide to an MHC molecule. As antigen presentation in vivo involves both endogenous ligands and exogenous antigens, the deconvolution of multiple binding events necessitates the implementation of a more powerful technique. Here we show that capillary electrophoresis coupled to fluorescence detection (CE–FL) can resolve multiple MHC–peptide binding events owing to its superior resolution and the ability to simultaneously monitor multiple emission channels. We utilized CE–FL to investigate competition and displacement of endogenous peptides by an immunogenic gluten peptide for binding to HLA-DQ2. Remarkably, this immunogenic peptide could displace CLIP peptides from the DQ2 binding site at neutral but not acidic pH. This unusual ability of the gluten peptide supports a direct loading mechanism of antigen presentation in extracellular environment, a property that could explain the antigenicity of dietary gluten in celiac disease.     

用CCD分析光源的辐射光谱

本文介绍了利用光电图象技术对光源光谱进行分析的工作。利用ＣＣＤ线阵器件和计算机，我们获得了黑体、灰体及单色光源的光谱特性以及有关数据。     

比较法视域内立法提案权的民主化

以民主的理念和原则为衡量标准,审视我国中央立法机关各提案主体的提案权,指出其中的一些问题和不足,并在和国外比较的基础上提出了相应的措施和建议。     

Approximation of the Quadratic Set Covering problem

We study in this article the polynomial approximation properties of the Quadratic Set Covering problem. This problem, which arises in many applications, is a natural generalization of the usual Set Covering problem. We show that this problem is very hard to approximate in the general case, and even in classical subcases (when the size of each set or when the frequency of each element is bounded by a constant). Then we focus on the convex case and give both positive and negative approximation results. Finally, we tackle the unweighted version of this problem.     

用MSI实现任意逻辑函数的设计方法

本文介绍并提出几种使用 MSI 的逻辑设计方法.这些方法具有普遍性和适用性,应用这些方法不论是组合逻辑问题还是时序逻辑问题均可使用最少的 MSI 实现任意给定的逻辑函数.     

Symplectic spread-based generalized Kerdock codes

Kerdock codes (Kerdock, Inform Control 20:182–187, 1972) are a well-known family of non-linear binary codes with good parameters admitting a linear presentation in terms of codes over the ring (see Nechaev, Diskret Mat 1:123–139, 1989; Hammons et al., IEEE Trans Inform Theory 40:301–319, 1994). These codes have been generalized in different directions: in Calderbank et al. (Proc Lond Math Soc 75:436–480, 1997) a symplectic construction of non-linear binary codes with the same parameters of the Kerdock codes has been given. Such codes are not necessarily equivalent. On the other hand, in Kuzmin and Nechaev (Russ Math Surv 49(5), 1994) the authors give a family of non-linear codes over the finite field F of q = 2 ^l elements, all of them admitting a linear presentation over the Galois Ring R of cardinality q ² and characteristic 2². The aim of this article is to merge both approaches, obtaining in this way new families of non-linear codes over F that can be presented as linear codes over the Galois Ring R. The construction uses symplectic spreads.      

基于正则化协同表示的鲁棒PCA人脸识别

针对人脸图像复杂环境变化,提出了一种基于正则化协同表示的鲁棒PCA人脸识别算法。算法首先通过协同表示计算重构样本与测试样本之间的残差,根据残差选取与测试样本临近的训练样本组成新的字典;然后在该字典上通过鲁棒PCA依次进行低秩误差分解,并计算误差矩阵的平滑性、稀疏性;最后联合协同表示的残差以及低秩分解中的平滑性和稀疏性构建判别准则进行人脸图像的分类识别;在ORL、AR等人脸库的实验表明:基于正则化协同表示的鲁棒PCA人脸识别算法不仅能够在复杂环境变化下取得良好的识别性能,而且保持了协同表示的优势,大大减少运行时间。