The effect of the aspect ratio on the hydrophobicity of microstructured polydimethylsiloxane (PDMS) robust surfaces

In this study, we have designed and fabricated robust hydrophobic surfaces that are composed of various micropillar arrays and investigated the effect of the aspect ratio (feature height/feature size) of the micropillar on the wettability of the fabricated surfaces. The robust, micropillar-arrayed surfaces were designed to yield the same Wenzel and Cassie water contact angles (CAs). According to our design rule, one can achieve an enhanced hydrophobic surface by increasing the height of the micropillars. The designed hydrophobic surfaces were fabricated by polydimethylsiloxane (PDMS) replica molding with photolithographically micropatterned SU-8 masters. The hydrophobicity properties of the fabricated PDMS surfaces were fully characterized theoretically and experimentally. From the theoretical and experimental results, it was found that the micropillars of an intrinsically hydrophobic material with a high aspect ratio enhance the hydrophobicity of the surface by increasing the surface roughness (in view of the Wenzel state) and the opportunities for the entrapment of air beneath a water droplet (the Cassie state).     

Optimization of optical lens-controlled scanning electron microscopic resolution using generalized regression neural network and genetic algorithm

A scanning electron microscope (SEM) is a sophisticated equipment employed for fine imaging of a variety of surfaces. In this study, prediction models of SEM were constructed by using a generalized regression neural network (GRNN) and genetic algorithm (GA). The SEM components examined include condenser lens 1 and 2 and objective lens (coarse and fine) referred to as CL1, CL2, OL-Coarse, and OL-Fine. For a systematic modeling of SEM resolution (R), a face-centered Box–Wilson experiment was conducted. Two sets of data were collected with or without the adjustment of magnification. Root-mean-squared prediction error of optimized GRNN models are GA 0.481 and 1.96×10^-12 for non-adjusted and adjusted data, respectively. The optimized models demonstrated a much improved prediction over statistical regression models. The optimized models were used to optimize parameters particularly under best tuned SEM environment. For the variations in CL2 and OL-Coarse, the highest R could be achieved at all conditions except a larger CL2 either at smaller or larger OL-Coarse. For the variations in CL1 and CL2, the highest R was obtained at all conditions but larger CL2 and smaller CL1.     

齐次等式约束线性回归模型条件根方估计的效率

对齐次等式约束线性回归模型回归系数的约束最小二乘估计提出改进,引入一种估计的相对效率,证明在一定条件下,狭义条件根方估计、广义条件根方估计的效率均高于约束最小二乘估计的效率．     

支持普适服务的新一代网络传输层构架

新一代网络没有准确定义,但普遍共识是提供全分组网络和普适服务.其中分组网络一般认为采用IP分组,但普适服务仍不清晰.3G、4G中称"泛在服务";NGI、NGN中强调无缝融合电信网和互联网服务;计算机界类似的概念是"普适计算";IEEE普适服务会议汇聚各种思想,首次提出了"普适服务"的模糊概念.虽然上述研究对普适服务的定义并不统一,但普遍共识是:多样化的服务种类、多样化的网络接入.文中分析传输层在新一代网络设计中的重要地位,以提供普适服务为目标,通过多连接抽象表示服务多样化、多路径抽象表示接入多样化,给出符合新一代网络要求的传输层构架.基于这一构架,可以提高网络的QoS支持、安全可靠性、移动性、可控可管性.文中通过理论分析和原型实现证明了新构架的正确性和可行性.     

Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori

Generalized honeycomb torus (GHT) is recognized as an attractive alternative to existing torus interconnection networks in parallel computing systems. Assume that m and d are integers with m ? 2 and d ? 8. This paper addresses the fault-tolerant hamiltonicity of GHT(m, 2d, d) with fault set F = {(w, y), (x, y)}, where w < x, w + y is even and x + y is odd. We show that such a faulty GHT is hamiltonian by presenting a systematic method for constructing a fault-free hamiltonian cycle. This result reveals another appealing feature of GHTs.     

Sliding mode control for multi-agent systems under a time-varying topology

This paper addresses the tracking problem of a class of multi-agent systems under uncertain communication environments which has been modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sliding mode control method is applied to solve this nonlinear tracking problem under a time-varying topology. The controller of each tracking agent has been designed by using only its own and neighbours’ information. Sufficient conditions for the existence of a sliding mode control tracking strategy have been provided by the solvability of linear matrix inequalities. At the end of this work, numerical simulations are employed to demonstrate the effectiveness of the proposed sliding mode control tracking strategy.     

分布式光纤振动传感系统的多级零频点定位研究

为了减少直线结构Sagnac分布式光纤传感系统的定位误差,提出一种多级零频点的优化方法,通过分析直线结构Sagnac分布式光纤传感定位原理,确定固定的采样速率下离散化是造成定位误差大的原因.并分析得出振动信号频域曲线会周期出现多个零频点,进而对振动定位的多级零频点优化方法进行了理论推导,阐明高倍零频点下的定位误差会有效减小.通过实验验证表明,在总长为11.769 km的传感光纤上,优化后的定位方法在不改变采样速率下可保证定位误差提升到±20 m范围内,可以基本满足系统对外界振动信号进行精确定位的要求.     

人群运动中的视觉显著性研究

在公共场所中人们都倾向于以分组的形式进行运动,本文把这种以分组形式运动的若干个行人称为运动群组,具有视觉显著性的人群运动群组是场景理解的重点,其对人群的整体运动也影响最大。本文对运动群组的视觉显著性展开了研究,分别从规模、速度、组内紧致度和变化度４个方面来对运动群组的视觉显著性进行度量,并基于该度量给出了视觉显著性运动群组检测方法。首先,利用光流法对运动人群进行分析得到光流向量;然后通过层次聚类算法对运动人群进行分组;最后,基于本文所给出的度量计算每个群组的视觉显著性,以检测出视觉显著性最高的运动群组。实验表明该方法能够有效地对视觉显 著性运动群组进行检测,该研究成果可应用于人群场景理解、人群运动分析和人群场景分类等计算机视觉研究领域。     

一种家庭异构网络系统终端设计

针对目前家庭通信网络日益复杂化和多样化问题,提出了一种新型的基于Wire-lessHART和PLC的无线自组织网络系统智能终端结构。通过兼容电力线通信、WirelessHART协议以及以太网的方法,实现了异构型网络通信、智能化控制家电等功能。     

Testbed results of an opportunistic routing for multi-robot wireless networks

Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.