Comparison of spherical and non-spherical particles in microchannels under dielectrophoretic force

This paper focuses on the computational and experimental study of dielectrophoretic (DEP) force based manipulation of spherical and non-spherical particles by taking into consideration of both electrokinetic effects and particle hydrodynamics. The model is first validated with conventional dipole moment theory. The movements of a spherical polystyrene particle and a rod-shape particle under a non-uniform electric field created by a pair of non-symmetrical electrodes in a microfluidic channel are studied, and a good agreement between the simulation and experimental results is obtained. Both experimental and simulation results reveal that the rod-shape particle experiences larger DEP force and moves faster than spherical particle with a similar mass. It was also interestingly found that the shape-dependent DEP force distribution on the microscale rod particle results in its unique behavior, which cannot be captured by traditional DEP theory.     

Finding logos in real-world images with point-context representation-based region search

Finding logos in the real-world images is a challenging task due to their small size, simple shape, less texture and clutter background. In this paper, through visual logo analysis with different types of features, we propose a novel framework for finding visual logos in the real-world images. First, we exploit the contextual shape and patch information around feature points, merge them into a combined feature representation (point-context). Considering the characteristics of logos, this kind of fusion is an effective enhancement for the discriminability of single point features. Second, to eliminate the interference of the complex and noisy background, we transfer the logo recognition to a region-to-image search problem by segmenting real-world images into region trees. A weak geometric constraint based on regions is encoded into an inverted file structure to accelerate the search process. Third, we apply global features to refine initial results in the re-ranking stage. Finally, we combine each region score both in max-response and accumulate-response mode to obtain the final results. Performances of the proposed approach are evaluated on both our CASIA-LOGO dataset and the standard Flickr logos 27 dataset. Experiments and comparisons show that our approach is superior to the state-of-the-art approaches.     

Nonlocal variational image segmentation models on graphs using the Split Bregman

Variational functionals such as Mumford-Shah and Chan-Vese methods have a major impact on various areas of image processing. After over 10 years of investigation, they are still in widespread use today. These formulations optimize contours by evolution through gradient descent, which is known for its overdependence on initialization and the tendency to produce undesirable local minima. In this paper, we propose an image segmentation model in a variational nonlocal means framework based on a weighted graph. The advantages of this model are twofold. First, the convexity global minimum (optimum) information is taken into account to achieve better segmentation results. Second, the proposed global convex energy functionals combine nonlocal regularization and local intensity fitting terms. The nonlocal total variational regularization term based on the graph is able to preserve the detailed structure of target objects. At the same time, the modified local binary fitting term introduced in the model as the local fitting term can efficiently deal with intensity inhomogeneity in images. Finally, we apply the Split Bregman method to minimize the proposed energy functional efficiently. The proposed model has been applied to segmentation of real medical and remote sensing images. Compared with other methods, the proposed model is superior in terms of both accuracy and efficient.     

Analytical study on cantilever resonance type magnet-integrated sensor device for micro-magnetic field detection

A beam-shaped cantilever resonance type magnetic sensor device has been proposed with a micro magnet. Two structural designs, named as design 1 and design 2, have been comparatively analyzed using ANSYS in order to obtain larger frequency shifts (higher magnetism sensitivity) due to the applied exterior magnetic field. The analytical results show that, in the range of 0–10 mT, the frequency shifts are small, while under 100 mT, a relatively larger frequency shift of about 30 Hz can be theoretically obtained. The power consumption of the proposed devices has been further theoretically studied for preliminary understanding. Using the well-known displacement equations, the estimated power consumption is around 0.21 μW, which is very lower than that of the reported magnetic field sensors. This implies that it is possible to fabricate higher sensitive magnetic field sensor with lower power consumption.     

EV-DO监测系统中R-P接口业务信令追踪的研究与实现

在EV-DO网络中,信令监测系统对于用户数据业务运营的分析尤为重要。针对EV-DO网络中的重要数据接口R-P接口间A11及PPP信令CDR(Call Data Record)的合成,结合主叫和寻呼过程的业务特征,提出一系列优化及改进方案。经过EV-DO现网数据的测试以及产生的相应实验结果表明,优化信令与业务数据消息间的关联机制,缩短了数据网络寻呼与用户主叫业务信令的追踪统计时间最高可达30 s,指标的细化提升了故障定位准确性。这项改进方案对于优化网络运维的分析平台有着重要意义。     

基于Landsat 8影像和能量平衡的西安市热场格局研究!

基于2014年8月15日的Landsat 8影像,通过劈窗算法反演西安中心城区地表温度,定量测算热岛中心范围。估算多种地表能量分量,分析热环境格局与地表能量分量的关系。结果表明:(1)西安中心城区城市热岛集中分布在人口、居住、商业密集区、经济技术开发区以及植被覆盖较差的区域;(2)感热、波文比与地表温度呈正相关,人为热与温度呈不显著正相关,净辐射、潜热与地表温度呈显著负相关;(3)城市热岛的地表能量结构中感热与潜热差异是构成城市热岛差异的主要原因。     

21世纪初中国农作物与自然植被物候时空差异

利用离散小波方法对2001~2012年MODIS EVI时序数据进行平滑,基于动态阈值法提取我国植被物候信息,探讨农作物和自然植被物候的时空变化特征。结果表明:(1)我国第一季农作物开始、峰值和结束日期主要以华北平原为中心随海拔的上升而推迟,而自然植被物候更早20d左右,且随海拔的上升先推迟后提前;(2)物候在时序上有显著变化的第一季区域,43.98%开始日期、52.83%峰值日期呈现提前趋势,多在开始晚、结束早的西南区及东北与内蒙古交界处,其余区域开始、峰值日期及81.80%结束日期呈推迟趋势,发生在开始早、结束晚的黄土高原及双季农作区;农作物物候推迟幅度小于自然植被。     

面向Kinect运动数据的鲁棒足迹检测

目的 Kinect可实时获取运动数据且较传统的运动捕捉设备采集成本低廉,在运动数据捕捉方面得到了广泛应用。但Kinect获取的运动数据精度较低,现有运动数据处理算法难以适用。方法 针对运动数据处理的关键步骤足迹检测问题,提出面向Kinect运动数据的鲁棒足迹检测算法。首先使用自适应的双边滤波算法降低Kinect运动数据中的噪声;其次定义多种脚部运动特征并用于分类,优化分类效果;最后使用支持向量机(SVM)算法训练决策函数并用于足迹检测。结果 本文算法应用于多种类型运动数据后,可以有效地减少Kinect运动数据中的噪声,足迹检测的时间性能以及准确性良好,其中足迹检测的准确率比经典的基准线方法提高了10%左右,比K近邻方法提高了8%左右,检测一帧运动足迹的速度为K近邻方法的7倍左右。结论 对实验结果的分析证明算法具有良好的鲁棒性、时间性能以及准确率,可广泛应用于运动数据的处理之中。     

Think,feel, bid: the impact of environmental conditions on the role of bidders’ cognitive and affective processes in auction bidding

Environmental conditions and the interplay of cognitive and affective processes both exert influences on bidding behavior. This paper brings the above together, considering how the (external) auction environment determines the impact of (internal) cognitive and affective processes on bidding behavior, assessed in comparison to the optimal bid. Two aspects of the auction environment were considered, namely auction dynamics (low: first-price sealed-bid auction, high: Dutch auction) and value uncertainty (low, high). In a laboratory experiment, we assess bidders’ cognitive workload and emotional arousal through physiological measurements. We find that higher auction dynamics increase the impact of emotional arousal on bid deviations, but not that of cognitive workload. Higher value uncertainty, conversely, increases the impact of cognitive workload on bid deviations, but not that of emotional arousal. Taken together, the auction environment is a critical factor in understanding the nature of the underlying decision process and its impact on bids.     

Quantum commitments from complexity assumptions

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK \({\not\subseteq}\) QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP \({\not\subseteq}\) QMA (which is weaker than PSPACE \({\not\subseteq}\) PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK \({\not\subseteq}\) QMA, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time.