Training linear ranking SVMs in linearithmic time using red-black trees

We introduce an efficient method for training the linear ranking support vector machine. The method combines cutting plane optimization with red-black tree based approach to subgradient calculations, and has O(ms + mlog (m)) time complexity, where m is the number of training examples, and s the average number of non-zero features per example. Best previously known training algorithms achieve the same efficiency only for restricted special cases, whereas the proposed approach allows any real valued utility scores in the training data. Experiments demonstrate the superior scalability of the proposed approach, when compared to the fastest existing RankSVM implementations.     

基于无线射频通信的多功能瓦斯报警矿灯的研制

针对目前瓦斯报警矿灯的报警信号不能被监控中心获取及井下固定瓦斯探头检测范围小、移动性差的问题,文章提出了一种具有瓦斯超限信号无线传输功能的多功能瓦斯报警矿灯的设计方案,详细介绍了该矿灯的硬件与软件设计,给出了无线射频通信方案及其关键技术。现场试验表明,该矿灯在井下环境的无线通信距离可达160 m,弥补了定点瓦斯监测的不足,确保了煤矿安全生产。     

台达PLC在液压码坯机电气控制中的应用

本文介绍了台达DVP—PLC—ES系列PLC在液压码坯机电气控制系统中的应用。使用PLC,不但成功代替了原继电器控制系统的控制和维护功能,而且还增加了节能功能,优化了系统,降低了人工维护成本,具有广阔的市场前景。     

切削过程的虚拟现实系统

介绍虚拟现实的基本特性和系统构成,利用WTK、VC＋＋、OpenGL等软件设计了切削过程的虚拟现实系统,实现了车床的虚拟加工过程的仿真。     

对表首HG排版语言的一个简化

华光 (HG)或方正 (BD)排版系统在社会上己广泛的应用到印刷行业和企事业的办公自动化 ,以其功能强、字体优美、字号齐全、排版规范、输出精度高等突出特点 ,赢得了人们的赞誉。但是与其它一些电子排版系统的形象化、直观性相比 ,HG(BD)排版语言的抽象性 ,也令一些初学者感到烦琐 ,难记忆 ,有些命令在还没有深入学习的情况下是很难接受的 ,表格中表首的排版语言就是一个例子 ,本文给出表首排版语言的一个简化 ,使其达到预期的效果 ,让人感到简单易懂 ,如表首 :项目年 份 1991年 1992年 1993年排版小样文件 (a)为 :【BG(!】【BHDFG3,FK…     

超声振动切削加工速度系数的研究

用速度系数K对振动切削的动态切削过程进行了分析,由试验研究得出:加工硬脆材料时,关键是振动切削中的冲击作用,当K=0.308时,冲击作用最强,切削效果最好,试验结果与理论分析基本一致。     

乌江沙沱水电站水轮机选型分析

沙沱水电站水头运行范围50～74.9 m.电站受阻出力多为汛期季节性电能,在综合考虑减少受阻出力及水轮机稳定运行的情况下,对61、62.5、64、65.5、67m五个额定水头方案进行了比较分析,最终确定了经济、合理的水轮机参数.     

Multiple human tracking in high-density crowds

In this paper, we introduce a fully automatic algorithm to detect and track multiple humans in high-density crowds in the presence of extreme occlusion. Typical approaches such as background modeling and body part-based pedestrian detection fail when most of the scene is in motion and most body parts of most of the pedestrians are occluded. To overcome this problem, we integrate human detection and tracking into a single framework and introduce a confirmation-by-classification method for tracking that associates detections with tracks, tracks humans through occlusions, and eliminates false positive tracks. We use a Viola and Jones AdaBoost detection cascade, a particle filter for tracking, and color histograms for appearance modeling. To further reduce false detections due to dense features and shadows, we introduce a method for estimation and utilization of a 3D head plane that reduces false positives while preserving high detection rates. The algorithm learns the head plane from observations of human heads incrementally, without any a priori extrinsic camera calibration information, and only begins to utilize the head plane once confidence in the parameter estimates is sufficiently high. In an experimental evaluation, we show that confirmation-by-classification and head plane estimation together enable the construction of an excellent pedestrian tracker for dense crowds.     

Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

This paper deals with the two-dimensional bin packing problem with conflicts (BPC-2D). Given a finite set of rectangular items, an unlimited number of rectangular bins and a conflict graph, the goal is to find a conflict-free packing of the items minimizing the number of bins used. In this paper, we propose a new framework based on a tree-decomposition for solving this problem. It proceeds by decomposing a BPC-2D instance into subproblems to be solved independently. Applying this decomposition method is not straightforward, since merging partial solutions is hard. Several heuristic strategies are proposed to make an effective use of the decomposition. Computational experiments show the practical effectiveness of our approach.     

Computing near-optimal solutions for the dominating subset with minimal weight problem

In this work, we consider a combinatorial “dominating subset with minimal weight” problem, which is an associative problem for solving global optimization problem. This problem can be expressed as a kind of assignment problem. The mathematical model and the economical interpretations of the problem are given and its properties are described. Then, we propose a new algorithm which has a ratio bound in polynomial time, by using above properties for solving the problem and present the results of numerical experiments.