校园无线网络安全防范浅析

无线网络已成为校园网的重要组成部分.剖析了校园无线网络存在的问题,给出了无线网络安全防护对策、安全认证方式和基础技巧.     

基于.Net的Excel和数据库数据转换——以军事理论练习系统为例

根据军事理论练习系统的需求,分析了将Excel电子表格中的试题数据导入到Access数据库中,以及将学生成绩等信息导出到Excel电子表格的原理和方法,并应用于实际解决方案,有效提高了工作效率。     

基于NS2的802.11效果异常现象仿真研究

在802.11 WLAN(Wireless Local Network)中,当一些无线节点的传输速率明显低于其他节点与AP(Access Point)间的传输速率时,将会使区域内所有节点的传输性能降低,这种现象称为效果异常(Performance Anomaly),Hyogon K等人在文献[6-7]中提出用改变封包容量和竞争窗口大小的方式来解决这个问题.文章通过在NS2网络仿真环境下,设计实验拓扑,编写性能分析脚本,对效果异常现象进行仿真并验证了上述两种方案能够有效缓解该现象并保持系统传输性能稳定.     

基于积件思想的高职计算机课程项目式教学探索——以C语言程序设计为例

基于积件思想,对五年制高职计算机课程项目式教学进行探索,以C语言程序设计为例研究分析,并组建C语言程序设计课程知识点积件库,编写高职C语言程序设计课程项目式校本教材,分析C语言程序设计课程教学项目“阶梯电价计费”.并借助开源平台Moodle实现了教学项目的应用.     

On event design in event-triggered feedback systems

This paper studies event design in event-triggered feedback systems. A novel event-triggering scheme is presented to ensure exponential stability of the resulting sampled-data system. The scheme postpones the triggering of events over previously proposed methods and therefore enlarges the intersampling period. The resulting intersampling periods and deadlines are bounded strictly away from zero when the continuous time system is input-to-state stable with respect to measurement errors.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

A transductive multi-label learning approach for video concept detection

In this paper, we address two important issues in the video concept detection problem: the insufficiency of labeled videos and the multiple labeling issue. Most existing solutions merely handle the two issues separately. We propose an integrated approach to handle them together, by presenting an effective transductive multi-label classification approach that simultaneously models the labeling consistency between the visually similar videos and the multi-label interdependence for each video. We compare the performance between the proposed approach and several representative transductive and supervised multi-label classification approaches for the video concept detection task over the widely used TRECVID data set. The comparative results demonstrate the superiority of the proposed approach.     

Evolutionary level set method for structural topology optimization

This paper proposes an evolutionary accelerated computational level set algorithm for structure topology optimization. It integrates the merits of evolutionary structure optimization (ESO) and level set method (LSM). Traditional LSM algorithm is largely dependent on the initial guess topology. The proposed method combines the merits of ESO techniques with those of LSM algorithm, while allowing new holes to be automatically generated in low strain energy within the nodal neighboring region during optimization. The validity and robustness of the new algorithm are supported by some widely used benchmark examples in topology optimization. Numerical computations show that optimization convergence is accelerated effectively.     

A Complex View of Barycentric Mappings

Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex functions has various advantages when interpolating two‐dimensional data in the plane, and in particular for holomorphic maps. We extend and generalize these results by investigating the complex representation of real‐valued barycentric coordinates, when applied to planar domains. We show how the construction for generating real‐valued barycentric coordinates from a given weight function can be applied to generating complex‐valued coordinates, thus deriving complex expressions for the classical barycentric coordinates: Wachspress, mean value, and discrete harmonic. Furthermore, we show that a complex barycentric map admits the intuitive interpretation as a complex‐weighted combination of edge‐to‐edge similarity transformations, allowing the design of “home‐made” barycentric maps with desirable properties. Thus, using the tools of complex analysis, we provide a methodology for analyzing existing barycentric mappings, as well as designing new ones.     

Collision and intersection detection of two ruled surfaces using bracket method

Collision and intersection detection of surfaces is an important problem in computer graphics and robotic engineering. A key idea of our paper is to use the bracket method to derive the necessary and sufficient conditions for the collision of two ruled surfaces. Then the numerical intersection curve can be characterized. The cases for two bounded ruled surfaces are also discussed.