A template-based baseball video scene classification using efficient playfield segmentation

In this paper, we present an effective and efficient framework for baseball video scene classification. The results of scene classification can be able to provide the ground for baseball video abstraction and high-level event extraction. In general, most conventional approaches are shot-based, which shot change detection and key-frame extraction are necessary prerequisite procedures. On the contrary, we propose a frame-based approach. In our scene classification framework, an efficient playfield segmentation technique is proposed, and then the reduced field maps are utilized as scene templates. Because the shot change detection and the key-frame extraction are not required in proposed method, the new framework is very simple and efficient. The experimental results have demonstrated that the effectiveness of our proposed framework for baseball videos scene classification, and it can be easily extended the template-based approach to other kinds of sports videos.     

High-capacity reversible data hiding by maximum-span pairing

In this paper, we propose a reversible data hiding method for ordered dithered halftone images. To achieve reversibility and high capacity, the proposed method decomposes an ordered dithered halftone into a maximal number of subimage pairs with the same characteristic, and then hides data with a subimage-swapping operation, which converts a subimage pair into a subimage pair with opposite characteristic. Besides, this method maintains good visual quality by exchanging neighboring pixels instead of flipping individual pixels. Experimental results show that this method has the highest capacity among the existing reversible data hiding methods. A reversible authentication watermarking system is also proposed using this reversible watermarking method and it shows better visual quality compared to an existing method.     

Side-effect localization for lazy, purely functional languages via aspects

Many side-effecting programming activities, such as profiling and tracing, can be formulated as crosscutting concerns and be framed as side-effecting aspects in the aspect-oriented programming paradigm. The benefit gained from this separation of concerns is particularly evident in purely functional programming, as adding such aspects using techniques such as monadification will generally lead to crosscutting changes. This paper presents an approach to provide side-effecting aspects for lazy purely functional languages in a user transparent fashion. We propose a simple yet direct state manipulation construct for developing side-effecting aspects and devise a systematic monadification scheme to translate the woven code to monadic style purely functional code. Furthermore, we present a static and dynamic semantics of the aspect programs and reason about the correctness of our monadification scheme with respect to them.     

Chaos-based multi-objective immune algorithm with a fine-grained selection mechanism

In this paper, we propose a chaos-based multi-objective immune algorithm (CMIA) with a fine-grained selection mechanism based on the clonal selection principle. Taking advantage of the ergodic and stochastic properties of chaotic sequence, a novel mutation operator, named as chaos-based mutation (CM) operator, is proposed. Moreover, the information of diversity estimation is also adopted in the CM operator for nondominated solutions to adjust mutation steps adaptively, which encourages searching less-crowded regions with relative large step sizes. When comparing with polynomial mutation operator that is used in many state-of-the-art multi-objective optimization evolutionary algorithms, simulations show that it is effective to enhance the search performance. On the other hand, in order to increase the population diversity, a fine-grained selection mechanism is proposed in this paper, which seems to be remarkably effective in two-objective benchmark functions. When comparing with two state-of-the-art multi-objective evolutionary algorithms (NSGA-II and SPEA-2) and a new multi-objective immune algorithm (NNIA), simulation results of CMIA indicate the effectiveness of the fine-grained selection mechanism and the remarkable performance in finding the true Pareto-optimal front, especially on some benchmark functions with many local Pareto-optimal fronts.     

Simulation of solid thermal explosion and liquid thermal explosion of dicumyl peroxide using calorimetric technique

Dicumyl peroxide (DCPO), is produced by cumene hydroperoxide (CHP) process, is utilized as an initiator for polymerization, a prevailing source of free radicals, a hardener, and a linking agent. DCPO has caused several thermal explosion and runaway reaction accidents in reaction and storage zone in Taiwan because of its unstable reactive property. Differential scanning calorimetry (DSC) was used to determine thermokinetic parameters including 700 J g^–1 of heat of decomposition (ΔH_d), 110 °C of exothermic onset temperature (T₀), 130 kJ mol^–1 of activation energy (E_a), etc., and to analyze the runaway behavior of DCPO in a reaction and storage zone. To evaluate thermal explosion of DCPO with storage equipment, solid thermal explosion (STE) and liquid thermal explosion (LTE) of thermal safety software (TSS) were applied to simulate storage tank under various environmental temperatures (T_e). T_e exceeding the T₀ of DCPO can be discovered as a liquid thermal explosion situation. DCPO was stored under room temperature without sunshine and was prohibited exceeding 67 °C of self-accelerating decomposition temperature (SADT) for a tank (radius = 1 m and height = 2 m). SADT of DCPO in a box (width, length and height = 1 m, respectively) was determined to be 60 °C. The TSS was employed to simulate the fundamental thermal explosion behavior in a large tank or a drum. Results from curve fitting demonstrated that, even at the earlier stage of the reaction in the experiments, ambient temperature could elicit exothermic reactions of DCPO. To curtail the extent of the risk, relevant hazard information is quite significant and must be provided in the manufacturing process.     

Three dimensional numerical simulations of long-span bridge aerodynamics, using block-iterative coupling and DES

The design of long-span bridges often depends on wind tunnel testing of sectional or full aeroelastic models. Some progress has been made to find a computational alternative to replace these physical tests. In this paper, an innovative computational fluid dynamics (CFD) method is presented, where the fluid-structure interaction (FSI) is solved through a self-developed code combined with an ANSYS-CFX solver. Then an improved CFD method based on block-iterative coupling is also proposed. This method can be readily used for two dimensional (2D) and three dimensional (3D) structure modelling. Detached-Eddy simulation for 3D viscous turbulent incompressible flow is applied to the 3D numerical analysis of bridge deck sections. Firstly, 2D numerical simulations of a thin airfoil demonstrate the accuracy of the present CFD method. Secondly, numerical simulations of a U-shape beam with both 2D and 3D modelling are conducted. The comparisons of aerodynamic force coefficients thus obtained with wind tunnel test results well meet the prediction that 3D CFD simulations are more accurate than 2D CFD simulations. Thirdly, 2D and 3D CFD simulations are performed for two generic bridge deck sections to produce their aerodynamic force coefficients and flutter derivatives. The computed values agree well with the available computational and wind tunnel test results. Once again, this demonstrates the accuracy of the proposed 3D CFD simulations. Finally, the 3D based wake flow vision is captured, which shows another advantage of 3D CFD simulations. All the simulation results demonstrate that the proposed 3D CFD method has good accuracy and significant benefits for aerodynamic analysis and computational FSI studies of long-span bridges and other slender structures.     

基于矩形NAM和偏微分方程的灰度图像压缩方法

借助矩形NAM图像表示方法和偏微分方程技术,提出一种新的灰度图像压缩方法.该方法在编码端把原始图像逆布局为若干矩形子块,并采用坐标压缩方法存储每个子块的位置、大小.在解码端,采用偏微分方程进行图像修复,有效消除解码图像中的方块效应.该方法的时间复杂度为 ,其中n为灰度图像像素数.实验表明:在保持图像质量的前提下,该方法具有更高的压缩比和更少的块数,具有较高实用价值.     

M2+-树:一种支持医学病例多度量空间检索的高效索引

由于从病例库中进行病例的相似性检索关系到能否提供给医生充分且正确的候选病例,因此如何高效、准确地实现影像病例的相似性检索是学术界和医学界的研究热点之一.迄今为止,很多文献提出了用于提高查询精度的检索策略,但涉及检索效率的文章还为之甚少.基于此,提出了一种融多种度量空间相似性计算于一体的M2+-树高维索引技术.该索引将病例中的文本和影像合成一个高维多特征向量,该向量在度量空间上将数据空间划分成若干子空间,并借助关键向量对划分后的数据子空间再进行向量空间上的二次划分.关键向量的无重叠划分和三角不等式过滤原理可以加快病例的检索速度.总之,在度量和向量空间上的两次数据划分使得M2+-索引树大大减少了待查询病例与数据库病例间的不必要相似性计算的次数,从而加快了相似性病例的检索速度.实验结果表明,M2+-树的性能优于典型的度量空间多特征索引代表M2-树的性能.     

LILT:一个基于"乐纹"技术的音乐分享系统

随着Web2. 0的推广,音乐分享平台纷纷出现.目前的音乐分享平台在用户上传时没有进行检查,导致音乐库里常有大量的冗余.提出了一个基于乐纹的音乐分享平台系统LILT,该系统包含一个含有音乐乐纹的数据库,并通过提取音乐片段的乐纹进行查找判重.建立了6万余首歌的乐纹库,并且在这个库上做了大量测试.测试结果显示,该系统对用户上传的音乐能够有效地识别并判重.在系统识别率、识别速度、指纹鲁棒性测试中均得到了较满意的结果.     

采用职责链模式实现多语言系统的程序设计

国际通用的应用程序需要不同语言的软件界面.介绍一种采用职责链设计模式实现多语言系统程序设计的解决方案,并结合具体实例说明了实现该解决方案的过程.实践结果表明,这种方法开发周期短,应用程序所有的语言版本可以同时发布,减少了软件的升级和维护的工作量.