高性能混凝土配合比设计的试验研究

从对HPC组成、结构的认识出发，借鉴利用拨开系数求砂率的方法，提出了一种新的HPC配制方法，并通过试验证实该方法是完全可行的．     

无刷柴油发电机神经元双PSD控制

文中就无刷柴油发电机的两个输入量，设计了基于单个神经元的双PSD控制器，其智能控制方法简单，响应速度快，MATLAB仿真结果表明，这种控制器对于非线性被控系统具有良好的适应性和鲁棒性．     

670 t/h锅炉燃烧系统改造

针对扬州发电有限公司200Mw机组4号炉(670t／h)长期存在锅炉灰渣可燃特含量偏高、锅炉效率偏低问题，在详细试验的基础上．对4号炉三次风燃烧系统进行了改造。改造后试验结果表明，4号炉在制粉系统运行条件下，锅炉效率提高2％以上。     

SNR bounds of FSO links and its evaluation for selected beams

We formulate the signal-to-noise ratio (SNR) for free-space optical links. Upon inserting typical operating parameters, it is seen that SNR well approximates to the inverse of aperture averaged scintillation parameter. By adopting a common source beam power of 10 mW, we select three different source sizes of Gaussian, annular Gaussian (AG), and cosh-Gaussian beams. We then evaluate the SNR of these beams. Our results indicate that when fixed aperture opening is used, fully and partially coherent beams yield almost the same SNR performance. On the other hand, however, focusing and lowering wavelength of operation appear to be quite instrumental in improving the SNR performance. In this context, medium-sized AGB seems to exhibit the best performance.     

Simultaneous scheduling of football games and referees using Turkish league data

Assignment decisions of referees to football (soccer) games are highly debated in sports media. Referee assignments are typically done on a weekly basis as the league progresses. However, this practice ignores important workload constraints on referees. Moreover, referees' skill levels should also be considered in determining their assignments. In this article, we first give a mixed integer linear program formulation for the problem of simultaneously generating a game schedule and assigning main referees to games by incorporating specific rules in the Turkish league. We also approach this problem using a genetic algorithm (GA) because of the computational difficulties in solving the problem. In the GA solution pool, we suggest using templates for referee assignments that follow several referee‐related workload constraints. We explain how these templates can be obtained by solving a mixed integer linear model prior to running the GA. The usage of these templates for referee assignments is conceptually similar to using a basic match schedule for game scheduling such as the one used in the Turkish Football League. We use the Turkish Football League fixtures for 2010–2013 as a case study. Experiments with the GA using real‐world data show a rather modest performance in terms of computation time and objective function value. Our numerical results indicate that the problem is extremely hard to solve.     

Auto-tuning Similarity Search Algorithms on Multi-core Architectures

In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the nearest neighbors (NN or $k$ -NN) of a given item. Another common query is the retrieval of multiple sets of nearest neighbors, i.e., multi $k$ -NN, for different query items on the same data. With commodity multi-core CPUs becoming more and more widespread at lower costs, developing parallel algorithms for these search problems has become increasingly important. While the core nearest neighbor search problem is relatively easy to parallelize, it is challenging to tune it for optimality. This is due to the fact that the various performance-specific algorithmic parameters, or “tuning knobs”, are inter-related and also depend on the data and query workloads. In this paper, we present (1) a detailed study of the various tuning knobs and their contributions on increasing the query throughput for parallelized versions of the two most common classes of high-dimensional multi-NN search algorithms: linear scan and tree traversal, and (2) an offline auto-tuner for setting these knobs by iteratively measuring actual query execution times for a given workload and dataset. We show experimentally that our auto-tuner reaches near-optimal performance and significantly outperforms un-tuned versions of parallel multi-NN algorithms for real video repository data on a variety of multi-core platforms.     

Coarse‐to‐Fine Isometric Shape Correspondence by Tracking Symmetric Flips

We address the symmetric flip problem that is inherent to multi‐resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse‐to‐fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting dense correspondence algorithm with state‐of‐the‐art techniques over several 3D shape benchmark datasets. The experiments show that our method, which is fast and scalable, is performance‐wise better than or on a par with the best performant algorithms existing in the literature for isometric (or nearly isometric) shape correspondence. Our key idea of tracking symmetric flips can be considered as a meta‐approach that can be applied to other multi‐resolution shape matching algorithms, as we also demonstrate by experiments.     

River: an intermediate language for stream processing

This paper presents both a calculus for stream processing, named Brooklet, and its realization as an intermediate language, named River. Because River is based on Brooklet, it has a formal semantics that enables reasoning about the correctness of source translations and optimizations. River builds on Brooklet by addressing the real‐world details that the calculus elides. We evaluated our system by implementing front‐ends for three streaming languages, and three important optimizations, and a back‐end for the System S distributed streaming runtime. Overall, we significantly lower the barrier to entry for new stream‐processing languages and thus grow the ecosystem of this crucial style of programming. Copyright © 2015 John Wiley & Sons, Ltd.     

人脸检测系统的研究

人脸检测系统采用的是一种基于模板匹配的快速人脸定位算法。该算法利用积分投影法先预测出人脸可能的范围与位置,然后在限定的范围内利用模板匹配的方法定位人脸,从而实现了快速而且可靠的人脸定位。