巢湖兆河分洪闸泄流特性试验研究

受周边地形条件及环境限制,巢湖兆河分洪闸与河道呈垂直布置,进流条件不利。针对分洪闸与河道垂直布置这一特征,分别对开敞式和涵洞式分洪闸进行了水工模型进口流态试验分析,结果表明涵洞式分洪闸进流流态优于开敞式分洪闸,能更好地保证各闸孔的均匀进流。针对涵洞式分洪闸方案,研究了分洪闸敞泄和控泄的泄流能力,指出敞泄状态下进口行近流速对流量计算影响明显,在水闸规划设计中,应计入行近流速影响。为改善消能效果及出口水流与下游的衔接,进行了多方案消能防冲改进试验,结果表明尾坎作为一种冲击式消能工布置在挖深式消力池末端,可使出口水流流速分布更加均匀并与下游水流衔接更为平顺,明显增强消能防冲效果。     

表面活性剂对气液两相螺旋管流流动特性的影响

为了考察阴离子型表面活性剂十二烷基硫酸钠(SDS)对气液两相螺旋管流流动特性的影响,该文用实验研究了不同浓度的SDS溶液体系气液两相螺旋管流的流型转变及压降规律。实验装置为由有机玻璃圆管制成的长2 m内径23 mm的实验段,以SDS水溶液和空气为实验介质,气液相折算流速均为0―2.5 m/s,SDS溶液质量浓度10―90 mg/kg,螺旋流由5种不同型号的金属螺旋叶轮诱导产生。利用直接观察和高速摄像相结合的方法观测流型的变化,并用液柱式压差计测量实验管段上下游间压差,实验在常温常压条件下进行。实验共得到螺旋线状流、螺旋波状分层流、螺旋轴状流、螺旋弥散流4种流型,与未添加表面活性剂体系相比较,并未得到螺旋泡状流和螺旋团状流这两种流型。同时,随着SDS溶液浓度的增大,气液两相螺旋流逐渐向螺旋弥散流流型转变,这是因为低浓度的SDS溶液随着其浓度的增大,气液界面张力逐渐减小,而气液掺混程度则会不断增大。此外,与未添加表面活性剂体系相比较,添加了SDS体系的气液两相螺旋管流压降梯度将会减小。最后,阐述了气液两相螺旋管流强化天然气水合物生成的研究及应用现状,并针对多相流研究现状,提出了气液两相流相间传热特性应成为今后研究热点等建议。     

A metamodeling approach for pattern specification and management

The formal specification of design patterns is central to pattern research and is the foundation of solving various pattern-related problems.In this paper,we propose a metamodeling approach for pattern specification,in which a pattern is modeled as a meta-level class and its participants are meta-level references.Instead of defining a new metamodel,we reuse the Unified Modeling Language(UML)metamodel and incorporate the concepts of Variable and Set into our approach,which are unavailable in the UML but essential for pattern specification.Our approach provides straightforward solutions for pattern-related problems,such as pattern instantiation,evolution,and implementation.By integrating the solutions into a single framework,we can construct a pattern management system,in which patterns can be instantiated,evolved,and implemented in a correct and manageable way.     

Observer模式在．NET多线程并行计算中的应用

对观察者（Observer）设计模式进行了分析,并利用．NET框架对其进行了改进;基于．NET Framework4．0,将改进后的模型应用到多线程并行程序的设计中,从而简化了开发过程,并且使系统结构更清晰,便于扩展和维护。     

将局部二进制模式应用于动态纹理识别的新方法

动态纹理的处理、描述与识别是纹理分析的热门领域。动态纹理是对普通纹理在时间域方面的扩展,包括动态特征和静态特征。基于LBP算法的扩展提出的VLBP算法较好的描述了动态纹理特征,但是计算量过大,模板过多。本文提出了一种由VLBP算法改进的基于局部二进制运动模式的特征提取方法用以动态纹理的描述和识别,它包括提取动态特征和提取静态特征两部分。将LBP算子做为块匹配准则提取局部二进制运动模式柱状图做为动态特征的描述,提取LBP柱状图做为静态特征的描述,并将二者连接得出描述动态纹理特征的联合的局部二进制运动模式柱状图。通过对DynTex集实验的结果表明,本文提出的方法在性能和识别率方面均要优于VLBP。     

Mining partial periodic correlations in time series

Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University. X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing. Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University. Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.     

Test frame updating in CPM testing of Prolog programs

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

Using a style-based ant colony system for adaptive learning

Adaptive learning provides an alternative to the traditional “one size fits all” approach and has driven the development of teaching and learning towards a dynamic learning process for learning. Therefore, exploring the adaptive paths to suit learners personalized needs is an interesting issue. This paper proposes an extended approach of ant colony optimization, which is based on a recent metaheuristic method for discovering group patterns that is designed to help learners advance their on-line learning along an adaptive learning path. The investigation emphasizes the relationship of learning content to the learning style of each participant in adaptive learning. An adaptive learning rule was developed to identify how learners of different learning styles may associate those contents which have the higher probability of being useful to form an optimal learning path. A style-based ant colony system is implemented and its algorithm parameters are optimized to conform to the actual pedagogical process. A survey was also conducted to evaluate the validity and efficiency of the system in producing adaptive paths to different learners. The results reveal that both the learners and the lecturers agree that the style-based ant colony system is able to provide useful supplementary learning paths.     

基于属性相关和时间约束的PrefixSpan算法

针对计算机入侵检测中网络安全审计数据的特点,提出一个改进的PrefixSpan算法,引入时间约束和属性相关的特征指导挖掘,应用M矩阵和Apriori特性减少投影数据库的数量,并缩减投影数据库规模,提高了序列模式挖掘的效率和有用性。通过检测一个网络审计记录的实验,进行结果分析。