甘草纤素对实验动物化学性肝损伤保护功能研究

目的:了解甘草纤素对大鼠化学性肝损伤的保护作用。方法:按照卫生部《保健食品功能学评价程序和检验方法》进行。并比较四氯化碳染毒后第48h和第5d处死动物对各项指标的影响。结果:与肝损伤模型对照组比较,染毒后第48h,甘草纤素的二个剂量组血清ALT(丙氨酸氨基转移酶)水平均有显著降低(p<0.05),中、高剂量组血清AST(天门冬氨酸氨基转移酶)水平也有显著降低(p<0.05)。受试物的高剂量组可改善肝细胞的退行性变,且高剂量组可明显减轻CCl4引起的肝细胞坏死(p<0.05)。结论:适量甘草纤素对CCl4所致动物急性肝损伤具有保护作用。     

Measured equation of invariance with linear tensor relation for three-dimensional scattering problems

The postulate of a linear tensor relation in the measured equation of invariance (MEI) is proposed for three-dimensional (3D) problems. As a result, all three components of the field vector to be solved are coupled in the MEI. Combined with the finite difference method, the present method is applied to the analysis of scattering by 3D conducting objects and results in a significant improvement in the accuracy of numerical results as compared to those obtained with an uncoupled linear relation.     

基于非锐化掩模的实时自适应图像增强算法

针对传统的非锐化掩模算法的局限性,依据图像中各像素点及以其为中心的若干相邻像素点的均方差值,提出了自适应图像增强算法的原理,并分析其硬件实现方法,然后给出了该算法与其它算法应用于图像增强的对比结果,最后在FPGA（field programmable gate array）实验板上进行验证.实验结果表明,此算法有效的增强图像的细节区域,防止图像边缘区域出现过冲现象,抑制图像平坦区域的噪声放大.因此,该算法取得了良好的视觉效果,硬件实现简单,适合于实时条件下图像的增强.     

Complex amplitude estimation in the known steering matrix and generalized waveform case

We consider a special growth-curve (SGC) model with a known steering matrix and generalized waveform in the presence of unknown interference and noise. Several estimators of the complex amplitude based on this model are derived, including the methods of approximate maximum likelihood (AML), minimum variance distortionless response (MVDR), and amplitude and phase estimation (APES). We analyze the statistical properties of these estimators and show that in the presence of temporally white but spatially correlated noise and interference, AML is asymptotically statistically efficient for a large snapshot number while MVDR and APES are asymptotically equivalent but not statistically efficient. Via several numerical examples, we also show that when the noise and interference are both spatially and temporally correlated, the APES estimator can achieve better estimation accuracy and exhibit greater robustness than the other methods.     

基于本地缓存的弹性分组环保护机制

本文提出一种基于本地缓存的弹性分组环保护倒换机制(WrapProtectionBasedOnLocalBuffers,简称WP-LB)。其主要思想是当环路上任何位于源节点和故障区域之间的中间节点接收到含有故障信息的控制信令后,就不再向下游转发数据分组,而是在本地缓存这些数据。等到保护通路建立好之后,再把缓存的数据分组经过保护通路发送给目的节点。分析计算表明,与原有的保护倒换(WrapProtection,简称WP)机制相比,WP-LB机制不仅提高带宽利用率,减少平均时延,并且还能避免数据包的丢失和失序。     

土工植草网在城防工程中的应用

文章以双辽市城防工程建设为例,介绍土工植草网新材料在护坡工程中的应用方法.     

弹性分组环技术

弹性分组环技术是一种新兴的城域网技术。作者主要讨论了弹性分组环技术的特点和优势,并且简要介绍了弹性分组环技术目前在国内城域网建设中的一些应用。弹性分组环技术集以太网的经济性、IP的智能化、光纤环网的丰富带宽和可靠性于一体,是目前宽带IP城域网运营商的最佳组网方案。     

Novel algorithms for shared segment protection

The major challenges in designing survivable schemes are how to allocate a minimal amount of spare resources (e.g., bandwidth) using fast (e.g., polynomial-time) algorithms, and, in case a failure occurs, to be able to recover quickly from it. All existing approaches invariably make tradeoffs. We propose novel shared segment protection algorithms which make little or no compromise . We develop an elegant integer linear programming (ILP) model to determine an optimal set of segments to protect a given active path. Although the ILP approach is useful for a medium-size network, it is too time consuming for large networks. Accordingly, we also design a fast heuristic algorithm based on dynamic programming to obtain a near-optimal set of segments. Although the heuristic algorithm has a polynomial time complexity, it can achieve a bandwidth efficiency as high as some best-performing shared path protection schemes and, at the same time, much faster recovery than these shared path protection schemes. The proposed scheme is also applicable to a wide range of networking technologies, including Internet Protocol and wavelength-division multiplexing networks under the generalized multiprotocol label switched framework.     

"一步建站"Web管理系统的探讨和实现

“一步建站”Web管理系统是指通过Web界面一次性提交用户资料，系统自动完成为上网建站用户开通虚拟服务器、进行域名解析、创建FTP维护账号及指定租用硬盘空间大小等一系列操作。同时，该系统还可对已开通的用户站点进行管理。     

Achieving fast and bandwidth-efficient shared-path protection

Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we propose novel integer linear programming (ILP) formulations by introducing two parameters (/spl epsi/ and /spl mu/) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible.