Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

An Improved Composite Multiscale Fuzzy Entropy for Feature Extraction of MI-EEG

Motor Imagery Electroencephalography (MI-EEG) has shown good prospects in neurorehabilitation, and the entropy-based nonlinear dynamic methods have been successfully applied to feature extraction of MI-EEG. Especially based on Multiscale Fuzzy Entropy (MFE), the fuzzy entropies of the τ coarse-grained sequences in τ scale are calculated and averaged to develop the Composite MFE (CMFE) with more feature information. However, the coarse-grained process fails to match the nonstationary characteristic of MI-EEG by a mean filtering algorithm. In this paper, CMFE is improved by assigning the different weight factors to the different sample points in the coarse-grained process, i.e., using the weighted mean filters instead of the original mean filters, which is conductive to signal filtering and feature extraction, and the resulting personalized Weighted CMFE (WCMFE) is more suitable to represent the nonstationary MI-EEG for different subjects. All the WCMFEs of multi-channel MI-EEG are fused in serial to construct the feature vector, which is evaluated by a back-propagation neural network. Based on a public dataset, extensive experiments are conducted, yielding a relatively higher classification accuracy by WCMFE, and the statistical significance is examined by two-sample t-test. The results suggest that WCMFE is superior to the other entropy-based and traditional feature extraction methods.     

o-Trityl phenoxy-imino vanadium (III) complexes: synthesis,characterization, and catalysis on ethylene (co)polymerization

Several phenoxy-imine ligands bearing o-trityl group in phenoxy moiety RN=CHArOH (Ar = C₆H₂(CPh₃)^tBu, R = 2,6-Me₂C₆H₃ ( L ₁ H ); 2,6-ⁱPr₂C₆H₃ ( L ₂ H ); 3,5-(CF₃)₂C₆H₃ ( L ₃ H ); 3,5-(OMe)₂C₆H₃ ( L ₄ H ); CHPh₂ ( L ₅ H ); CPh₃ ( L ₆ H )) were synthesized and characterized by¹H NMR and ¹³C NMR spectroscopy. The vanadium complexes based on these ligands LVCl₂(THF)₂ ( 1–6 ) were synthesized via conventional transmetalation reaction in moderate to high yields. Complexes 1–6 were fully characterized by FT-IR, elemental analyses and the molecular structures of 1 , 2 ·H₂O, (2 ·H₂O ) ₂ (μ-Cl) ₂ , 4 , and 5 were confirmed by X-ray crystallographic analysis in which the six-coordinated vanadium centers are in a typical octahedral geometry. Upon activation with Et₂AlCl in toluene, complexes 1–6 showed high activities in ethylene polymerization affording polymers with moderate molecular weight (5.9–11.8 × 10⁴ Da). Moreover, in hexane or CH₂Cl₂, 1–6 /Et₂AlCl exhibited enhanced activities. When activated with MAO or MMAO in toluene, these complexes showed relatively low activities but afforded polymers with ultra-high molecular weight (up to 3.30 × 10⁶ Da). 1–6 /Et₂AlCl also showed high activities in ethylene/1-hexene copolymerization at room temperature giving moderate molecular-weight polymers (6.5–11.4 × 10⁴ Da) with co-monomer incorporation being of 6.0 ~ 7.8%.     

Zk线性码的对称形式的MacWilliams恒等式

该文定义了Zk线性码的码字的对称重量计数公式，利用离散的Hadamard变换，建立了线性码与其对偶码之间的对称形式的MacWilliams恒等式．     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

分类挖掘技术在高校人事管理中的应用

探讨分类挖掘技术在高校实际工作中的应用方式与应用领域。以高校人事管理为模型，应用数据挖掘中决策树算法，对高校人力资源数据源中的信息进行分析，发现其中有价值的数据模式，寻找其中存在的关系和规则，对高校人才规划提供比较客观的决策支持。     

在线multicast数据传输网络中的一个优化问题

首先建立了数据传输网络选择的最小成本模型，给出了有效支撑树代表集的概念，并给出了一个时间复杂性为D(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题，分别给出了一个时间复杂性为D(mlogen)和O(m^2 mlogen)的多项式时间的算法。     

小波变换在光谱特征提取方面的应用

人们在处理高光谱图像时一般要对一些典型地物进行光谱分析、特征波段的提取,以便提取出最大量的有效信息,剔除无用或冗余的信息,然后再进行分类识别.采用小波变换的分析方法,选用合适的小波进行分解,根据分解后的高频分量中包含的重要信息,利用局部相邻的正负极值点找出对应于原始光谱曲线上每个吸收带的左右边界;利用局部过零点,即可比较精确的提取出各个吸收带的中心波长.该方法比传统的光谱特征提取方法更简洁、有效,实验证明为一种比较理想的光谱特征提取方法.     

连续波雷达测距中的解模糊技术

研究连续波雷达测距中的距离模糊问题，分析几种常用解模糊方法的性能，并讨论参差比的选取对测距范围的影响。     

MRC分集接收的MQAM在Nakagami信道上的性能分析

Nakagami信道是一种适应性较强的信道模型，MQAM(M-ary quadrature amplitude modulation)是一种频谱利用率较高的调制方式。在存在多径影响的无线通信环境中，最大比合并(maximum ratio combining)方式的分集接收是克服衰落的有效方法。本文利用适用范围更广的Nakagami信道模型，在多径衰落的情况下对最大比合并分集接收的MQAM系统误符号率性能作了分析。仿真结果对分析实际信道下具体系统的性能具有一定的参考价值。