复合材料深度方向超声C扫描检测技术

介绍一种基于超声传播时域特性的深度方向超声C扫描成象检测技术,一次扫描可以同时获取被测材料内部若干层的扫描检测图象。     

First-level Dulkyn gravitational wave detector

The functional-block diagram of the Dulkyn gravitational wave detector is described.     

Purification of an Inducible DNase from a Thermophilic Fungus

The ability to induce an extracellular DNase from a novel thermophilic fungus was studied and the DNAse purified using both traditional and innovative purification techniques. The isolate produced sterile hyphae under all attempted growing conditions, with an average diameter of 2 μm and was found to have an optimal temperature of 45 °C and a maximum of 65 °C. Sequencing of the internal transcribed region resulted in a 91% match with Chaetomium sp., suggesting a new species, but further clarification on this point is needed. The optimal temperature for DNase production was found to be 55 °C and was induced by the presence of DNA and/or deoxyribose. Static growth of the organism resulted in significantly higher DNase production than agitated growth. The DNase was purified 145-fold using a novel affinity membrane purification system with 25% of the initial enzyme activity remaining. Electrophoresis of the purified enzyme resulted in a single protein band, indicating DNase homogeneity.     

Calculation method for the unsteady air supply in mine ventilation networks

The problem on one-dimensional unsteady compressed air flow in an arbitrary topology mine is solved using a mathematical model, including one-dimensional equations and pressure-velocity continuity condition, the method of characteristics, difference scheme and the AEROSET software.     

Simulation of scattering processes of optical radiation by nanodimensional structures

Mathematical simulation of the process of scattering of an optical wave by micro- or nano-scale structure on the basis of the vector equations of the electromagnetic field is performed. A rigorous analytic solution is obtained and the scattering problem solved by means of the method of finite elements.     

Identification of components of protein complexes using a fluorescent photo-cross-linker and mass spectrometry

This study describes a novel method for improving the specific recognition, detection, and identification of proteins involved in multiprotein complexes. The method is based on a combination of coimmunoprecipitation, chemical cross-linking, and specific fluorescent tagging of protein components in close association with one another. Specific fluorescent tagging of the protein complex components was achieved using the cleavable, fluorescent cross-linker sulfosuccinimidyl 2-(7-azido-4-methylcoumarin-3-acetamido) ethyl-1,3'-dithiopropionate (SAED). Following dissociation and separation by SDS-PAGE, the fluorescently tagged proteins are then visualized by UV illumination, excised, and, following in-gel digestion, identified by mass spectrometry. In this study, a complex of the HIV-envelope protein gp120 and its cellular receptor CD4 was used as a model system. The sensitivity of detection of fluorescent SAED-labeled proteins in SDS gels, and the sensitivity of the mass spectrometric identification of fluorescent proteins after in-gel digestion, is in the range of a few hundred femtomoles of protein. This sensitivity is comparable to that achieved with silver-staining techniques, but fluorescence detection is protein independent and no background interference occurs. Furthermore, fluorescence labeling is significantly more compatible with mass spectrometric identification of proteins than is silver staining. The first application of this strategy was in the investigation of the mechanism of spermiation, the process by which mature spermatids separate from Sertoli cells. For the coimmunoprecipitation experiment, an antibody against paxillin, a protein involved in spermatid-Sertoli cell junctional complexes, was used. More components of the paxillin protein complex were visible by fluorescence detection of SAED-labeled proteins than were visible on comparable silver-stained gels. Mass spectrometric analysis of the fluorescently labeled proteins identified integrin alpha6 precursor as a protein associated in a complex with paxillin. The identification of integrin alpha6 precursor was confirmed by Western blot analysis and verifies the applicability of this novel approach for identifying proteins involved in protein complexes.     

Perceived trustworthiness of knowledge sources: The moderating impact of relationship length.

Prior meta-analytic evidence has indicated no association between relationship length and perceived trustworthiness. Viewing trustors as information processors, the authors propose a model in which relationship length, although having no direct effect on perceived trustworthiness, moderates the association between perceived trustworthiness and the basis on which people decide to trust each other. Specifically, as trustors learn about others, they base their trust on different kinds of information (demographic similarity, trustworthy behavior, and shared perspective). Hierarchical multiple regression analyses of a field survey of supervisors and subordinates from 3 companies (N = 88) provide evidence consistent with this prediction: Perceived trustworthiness is associated with demographic similarity in newer relationships, with trustworthy behavior in relationships that are neither brand new nor old but in-between, and with shared perspective in older relationships. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Approximation Algorithms for Quickest Spanning Tree Problems

Let $G=(V,E)$ be an undirected multigraph with a special vertex ${\it root} \in V$, and where each edge $e \in E$ is endowed with a length $l(e) \geq 0$ and a capacity $c(e) > 0$. For a path $P$ that connects $u$ and $v$, the {\it transmission time} of $P$ is defined as $t(P)=\mbox{\large$\Sigma$}_{e \in P} l(e) + \max_{e \in P}\!{(1 / c(e))}$. For a spanning tree $T$, let $P_{u,v}^T$ be the unique $u$--$v$ path in $T$. The {\sc quickest radius spanning tree problem} is to find a spanning tree $T$ of $G$ such that $\max _{v \in V} t(P^T_{root,v})$ is minimized. In this paper we present a 2-approximation algorithm for this problem, and show that unless $P =NP$, there is no approximation algorithm with a performance guarantee of $2 - \epsilon$ for any $\epsilon >0$. The {\sc quickest diameter spanning tree problem} is to find a spanning tree $T$ of $G$ such that $\max_{u,v \in V} t(P^T_{u,v})$ is minimized. We present a ${3 \over 2}$-approximation to this problem, and prove that unless $P=NP$ there is no approximation algorithm with a performance guarantee of ${3 \over 2}-\epsilon$ for any $\epsilon >0$.