生态校园建设中二维码树牌的应用和功能扩展研究

二维码树牌可以有效助推生态校园建设和宣传生态文明思想,将其运用于大学校园园林绿化苗木信息化管理是大势所趋。介绍了二维码树牌的制作流程和应用价值,并通过问卷调查获取二维码树牌在黔南民族师范学院的应用现状。结果显示,大学生对身边花草苗木的关注度较高,但二维码树牌的科普价值有待向更标准化和人性化开发。最后对二维码树牌的优化和功能扩展提出4点建议:采用适宜的材质及挂制方式;完善二维码数据系统;合理应用校园林木智能化养护;作为弘扬优秀文化的载体。

以“二维码”树牌为载体 弘扬国学文化

通过组织学生开展“校园木本植物二维码树牌制作”活动,将科技、生物、文学有机结合,不仅有助于学生了解植物生理学、分类学等方面的知识,还可以借此弘扬国学之美,提升师生文化修养。更重要的是,该活动对激发学生学习兴趣、点燃学生生活热情等有积极意义。最后,对高中阶段如何开展实践性活动提出建议。

一种基于最小汉明距离的卷积码译码算法研究

在讨论费诺算法的基础上，提出了一种基于汉明距离的译码算法，该算法省去了门限增量T0，而实质上，基于汉明距离的译码算法和费诺算法是一致的。最后运用EDA（电子设计自动化）开发软件进行模拟，结果表明该算法在性能上比费诺算法优越得多。

Huffman码在码元时间单位不同时的最优性研究

比较Morse码和Huffman码的编码效率,按照Morse码设计码元,用Huffman编码方法来编码.但由于Morse码的基本码元(点和划)所占的时间单位不同,所以若用0、1代表点和划,用Huffman来编码,则Huffman的基本码元0、1的时间单位也不同,这不是常规的Huffman编码.对于这种情况下的Huffman码的最优性问题,进行了一些探讨.

WCDMA下行链路中OVSF码的分配策略

宽带码分多址(WCDMA)是3G移动网络中的接入技术,文章主要讨论了WCDMA物理层无线接口的下行链路上,正交可变扩频因子(OVSF)编码的几种分配策略,对几种方案的优缺点进行了讨论,并针对RDA策略,提出了一些改进的想法。

一种非对称可逆变长码的构造算法

为了进一步提高可逆变长码的效率,提高编码后压缩视频数据的抗误码能力,提出了一种非对称可逆变长码的构造算法.用二叉树结构进行码字的构造,分析了二叉树中可逆变长码的构造条件,提出了一个代价函数,用它来决定各层中叶子节点的数量,并充分考虑到不同叶子节点位置的组合对下层可用节点数目的影响.该算法能构造出更为高效的可逆变长码,具有较强的差错复原能力.

基于植物认知的信息化实践教学平台设计与教学探究

二维码植物识别技术应用于校园植物识别和植物学野外实习,是移动智能发展的潮流,也是植物学教学改革的必然趋势。智能移动终端与植物二维码的结合,能够引导学生进行场景式教学,通过让学生扫码认知植物,自主学习,提高认知能力,增加学生的认知种类。通过设计和开发信息化实践教学平台"知植"APP,提高学生对植物认知的掌握程度,通过教学平台与实践教学相结合,整体提高植物认知的教学效果,为植物学野外实习的开展打下坚实的理论基础。

公园植物科普推广平台的建设探索--以何园为例

探讨了构建植物科普推广平台的意义和途径。通过何园植物科普推广平台的建设实践,确定了通过二维码树牌、植物电子资源库、植物导览图以及赏花游览路线4个途径全方位地构建植物科普平台,从而大大提高游览体验,为构建"智慧公园"、"智慧城市"添砖加瓦。

Bridge damage identification based on convolutional autoencoders and extreme gradient boosting trees

To enhance the accuracy and efficiency of bridge damage identification,a novel data-driven damage identification method was proposed.First,convolutional autoencoder(CAE)was used to extract key features from the acceleration signal of the bridge structure through data reconstruction.The extreme gradient boosting tree(XGBoost)was then used to perform analysis on the feature data to achieve damage detection with high accuracy and high performance.The proposed method was applied in a numerical simulation study on a three-span continuous girder and further validated experimentally on a scaled model of a cable-stayed bridge.The numerical simulation results show that the identification errors remain within 2.9%for six single-damage cases and within 3.1%for four double-damage cases.The experimental validation results demonstrate that when the tension in a single cable of the cable-stayed bridge decreases by 20%,the method accurately identifies damage at different cable locations using only sensors installed on the main girder,achieving identification accuracies above 95.8%in all cases.The proposed method shows high identification accuracy and generalization ability across various damage scenarios.

Analysis of Codon Usage Between Different Poplar Species

Codon usage is the selective and nonrandom use of synonymous codons to encode amino acids in genes for proteins. The analysis of codon usage may improve the understanding of cocion preferences between different species and allow to rebuild the codons of exogenous genes to increase the expression efficiency of exogenous genes, Here, codon DNA sequence （CDS） of four poplar species, including Populus tremuloides Michx., P. tomentosa Carr., P. deltoides Marsh., and P. trichocarpa Torr. ＆ Gray., is used to analyze the relative frequency of synonymous codon （RFSC）. High-frequency codons are selected by high-frequency （HF） codon analysis. The results indicate that the codon usage is common for all four poplar species and the codon preference is quite similar among the four poplar species. However, CCT encoding for Pro, and ACT coding for Thr are the preferred codons in P. tremuloides and P. tomentosa, whereas CCA coding for Pro, and ACA coding for Thr are preferred in P. deltoides and P. trichocarpa The codons such as TGC coding for Cys, TTC coding for Phe, and AAG coding for Lys, are preferred in the poplar species except P trichocarpa. GAG coding for Glu is preferred only in P deltoides, while the other three poplar species prefer to use GAA. The commonness of preferred codon allows exogenous gene designed by the preferred cocion of one of the different poplar species to be used in other poplar species.

Optimization design of 24bit parallel MAC unit with saturation

An efficient design method for a 24 × 24 bit ＋48 bit parallel saturating multiply-accumulate （MAC） unit is described. The augend in the MAC is merged as a partial product into Wallace tree array. The optimized saturation detection logic is proposed. The 679. 2 μm × 132. 5μm area size has been achieved in 0. 18 μm 1.8 V 1P6M CMOS technology by the full-custom circuit layout design. The simulation results show that the design way has significantly less area （about 23.52% reduction） and less delay than those of the common saturating MAC based on standard cell library.

VLSI Implementation of a Wavelet Image Coder

A modular architecture for two dimension (2 D) discrete wavelet transform (DWT) is designed.The image data can be wavelet transformed in real time,and the structure can be easily scaled up to higher levels of DWT.A fast zerotree image coding (FZIC) algorithm is proposed by using a simple sequential scan order and two flag maps.The VLSI structure for FZIC is then presented.By combining 2 D DWT and FZIC,a wavelet image coder is finally designed.The coder is programmed,simulated,synthesized,and successfully verified by ALTERA CPLD.

Efficient Quadtree based Fractal Image Coding Scheme in Wavelet Transform Domain *

This paper presents an efficient quadtree based fractal image coding scheme in wavelet transform domain based on the wavelet based theory of fractal image compression introduced by Davis. In the scheme, zerotrees of wavelet coefficients are used to reduce the number of domain blocks, which leads to lower bit cost required to represent the location information of fractal coding, and overall entropy constrained optimization is performed for the decision trees as well as for the sets of scalar quantizers and self quantizers of wavelet subtrees. Experiment results show that at the low bit rates, the proposed scheme gives about 1 dB improvement in PSNR over the reported results.

Fast Residual Quad-Tree Coding for the Emerging High Efficiency Video Coding Standard

In High Efficiency Video Coding, the Residual Quad-Yree （RQT） coding is used to encode the prediction residual for both intra and inter Coding Units （CU） and provides improved coding gains. However, this results in much higher computational complexities. To address this problem, we develop two fast RQT algorithms for intra- and inter-prediction residual coding respectively. For intra coding, the proposed algorithm selects the best prediction mode in the rate distortion mode decision process using a Prediction Unit （PU） size-dependent fast RQT depth decision on a reduced prediction mode candidates set from the rough mode decision process. For inter coding, in addition to CU size-dependent fast RQT depth decisions, we propose a discriminant analy- sis-based fast depth decision algorithm to det- ermine the best transform unit size. Experimental results show that on average, we can real- ise a 21.29% encoding time saving and 0.03% bit-rate reduction for intra coding, while 15% of the encoding time can be saved with a negligible coding performance loss for inter coding.

DNA barcoding discriminates Pampus minor(Liu et al.,1998) from Pampus species

Although Pampus minor has been classified as a new species, it still remains controversial. Was used a DNA barcoding technique based on homologous sequence analysis of the16S and CO1 genes to clarify the confusion over the identification of this species. Among 12 individuals whose genetic distance was 0.002, two haplotypes were found. According to the 16S sequences, the genetic distances ranged from 0.121 to 0.133 between P. minor and other Pampus species. Although the same the genetic distance between the two P minor haplotypes was generated using CO1 sequences, the haplotype of Pm22-23, Pm28, and Pm32-33 was the same as that of Pci EF607462 and EF607466, while the haplotype of Pm24-27 and Pm29-31 was the same as that of Pci EF607461 and EF607463-65. In addition, the genetic distance ranged only from 0.002 to 0.005 between P minor and Pa EF607460 and EF607458. Apart from this, the interspecies genetic distances varied from 0.135 to 0.143 between P minor and other t＇ampus species according to the C01 sequences. Phylogenetic trees, using combined 16S and CO1 data, strongly support the viewpoint that all the P. minor individuals form one clade that is in a sister position to Pampus sp. individuals （EU357803, FJ434342-FJ434343, and FJ652423-FJ652427）.

Evolutionary Computation for Realizing Distillation Separation Sequence Optimization Synthesis

Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequence, and it is directly applied as the coding method. Genetic operators, which ensure to prohibit illegal filial generations completely, are designed by using the method of graph theory. The crossover operator based on a single parent or two parents is designed successfully. The example shows that the average ratio of search space from evolutionary algorithm with two-parent genetic operation is lower, whereas the rate of successful minimizations from evolutionary algorithm with single parent genetic operation is higher.

HUFFMAN-BASED GROUP KEY ESTABLISHMENT SCHEME WITH LOCATION-AWARE

Time efficiency of key establishment and update is one of the major problems contributory key managements strive to address.To achieve better time efficiency in key establishment,we propose a Location-based Huffman(L-Huffman) scheme.First,users are separated into several small groups to minimize communication cost when they are distributed over large networks.Second,both user's computation difference and message transmission delay are taken into consideration when Huffman coding is employed to forming the optimal key tree.Third,the combined weights in Huffman tree are located in a higher place of the key tree to reduce the variance of the average key generation time and minimize the longest key generation time.Simulations demonstrate that L-Huffman has much better performance in wide area networks and is a little better in local area network than Huffman scheme.

Blind and readable image watermarking using wavelet tree quantization

A blind and readable image watermarking scheme using wavelet tree quantization is proposed. In order to increase the algorithm robustness and ensure the watermark integrity,error correction coding techniques are used to encode the embedded watermark. In the watermark embedding process, the wavelet coefficients of the host image are grouped into wavelet trees and each watermark bit is embedded by using two trees. The trees are so quantized that they exhibit a large enough statistical difference, which will later be used for watermark extraction. The experimental results show that the proposed algorithm is effective and robust to common image processing operations and some geometric operations such as JPEG compression, JPEG2000 compression, filtering, Gaussian noise attack, and row-column removal. It is demonstrated that the proposed technique is practical.

Dendritic cells engineered to secrete anti-Dc R3 antibody augment cytotoxic T lymphocyte response against pancreatic cancer in vitro

AIM To investigate the enhanced cytotoxic T lymphocyte responses against pancreatic cancer (PC) in vitro induced by dendritic cells (DCs) engineered to secrete anti-DcR3 monoclonal antibody (mAb). METHODS DCs, T lymphocytes and primary PC cells were obtained from PC patients. DCs were transfected with a designed humanized anti-DcR3 monoclonal antibody heavy and light chain mRNA and/or total tumor RNA (DC-tumor-anti-DcR3 RNA or DC-total tumor RNA) by using electroporation technology. The identification, concentration and function of anti-DcR3 mAb secreted by DC-tumor-anti-DcR3 RNA were determined by western blotting and enzyme-linked immunosorbent assay. After co-culturing of autologous isolated PC cells with target DCs, the effects of secreting anti-DcR3 mAb on RNA-DCs' viability and apoptosis were assessed by MTT assay and flow cytometry. Analysis of enhanced antigen-specific immune response against PC induced by anti-DcR3 mAb secreting DCs was performed using a Cr-51 releasing test. T cell responses induced by RNAloaded DCs were analyzed by measuring cytokine levels, including IFN-gamma, IL-10, IL4, TNF-alpha and IL-12. RESULTS The anti-DcR3 mAb secreted by DCs reacted with recombinant human DcR3 protein and generated a band with 35 kDa molecular weight. The secreting mAb was transient, peaking at 24 h and becoming undetectable after 72 h. After co-incubation with DCtumor- anti-DcR3 RNA for designated times, the DcR3 level in the supernatant of autologous PC cells was significantly down-regulated (P < 0.05). DCs secreting anti-DcR3 mAb could improve cell viability and slow down the apoptosis of RNA-loaded DCs, compared with DC-total tumor RNA (P < 0.01). The anti-DcR3 mAb secreted by DC-tumor-anti-DcR3 RNA could enhance the induction of cytotoxic T lymphocytes (CTLs) activity toward RNA-transfected DCs, primary tumor cells, and PC cell lines, compared with CTLs stimulated by DC-total tumor RNA or control group (P < 0.05). Meanwhile, the antigen-specific CTL responses were MHC class I-restricted. The CD4+ T cells and CD8+ T cells incubated with anti-DcR3 mAb secreting DCs could produce extremely higher level IFN-gamma and lower level IL4 than those incubated with DC-total tumor RNA or controls (P < 0.01). CONCLUSION DCs engineered to secrete anti-DcR3 antibody can augment CTL responses against PC in vitro, and the immune-enhancing effects may be partly due to their capability of down-regulating DC apoptosis and adjusting the Th1/Th2 cytokine network.

Tree-Structured Parallel Regeneration for Multiple Data Losses in Distributed Storage Systems Based on Erasure Codes

To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured Parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.