长引水系统水电站压力管道直径优化

本文基于某长引水式水电站水力过渡过程的数值模拟,针对蜗壳末端压力受涌浪压力控制的情况,进行压力管道直径的优化。结论表明,减小压力管道直径将导致蜗壳末端水锤压力增加,控制其最大值不超过涌浪压力控制值,可在一定范围内缩小压力管道直径,减少工程投资,对类似工程具有一定的参考意义。     

On type-reduction of type-2 fuzzy sets: A review

As an undetachable module of type-2 (T2) fuzzy computations and reasoning, type-reduction methods play an important role in various fuzzy disciplines including fuzzy logic systems and fuzzy clustering. Importance of type-reduction techniques lies in the fact that they are the main tools for collecting the entire inherent vagueness of the data. Therefore, type-reduction methods form the output of type-2 fuzzy sets (T2 FSs) as the representative of the entire uncertainty in a given space. Hence, their accuracy, precision, and performance speed is of much interest. This paper, presents a comprehensive review on various type-reduction and defuzzification strategies for general and interval type-2 fuzzy sets and systems. It is tried to analyze the existing approaches from different point of views accompanied by extensive comparisons on different features of type-reduction methods to facilitate further research studies by the fuzzy community.     

绒线漂染综合控制系统研究应用

介绍了一种集中管理,分散控制的计算机温度自动控制系统,该系统控制精度高,控制方法先进,测量手段简单实用,抗下扰能力强,性能价格比好。在天水宏大绒线厂的试运行中取得了良好的绒线染色效果,并取得了显著的经济效益。     

面向最终用户编程的服务虚拟化模型

为了解决面向最终用户编程问题,提出了一种基于动态语义的服务虚拟化模型。该模型以SOA思想理论为基础,采用面向服务计算和Web服务技术,结合本体服务描述语言和描述逻辑,建立服务虚拟化模型,从而实现面向最终用户编程。该模型有效地提高了模型的查全率和查准率,能够在一定程度上解决软件危机。     

通用自定义分页的实现

Web系统在应用过程中经常会遇到大量数据的查询,设计时如何在数据服务控件中进行分页显示,这是常碰到的问题,介绍通用自定义分页的设计思路,并对代码的设计进行了详细的分析。     

The weak aggregating algorithm and weak mixability

This paper resolves the problem of predicting as well as the best expert up to an additive term of the order o(n), where n is the length of a sequence of letters from a finite alphabet. We call the games that permit this weakly mixable and give a geometrical characterisation of the class of weakly mixable games. Weak mixability turns out to be equivalent to convexity of the finite part of the set of superpredictions. For bounded games we introduce the Weak Aggregating Algorithm that allows us to obtain additive terms of the form .     

New insights on survivability in multi-domain optical networks

With the development of intelligent optical networks and the general multi-protocol label switching (GMPLS) technique, the seamless convergence between IP network and optical network is no longer be a dream but a practical reality. Similar to the Internet, current optical networks have been divided into multiple domains each of which has its own network provider and management policy. Therefore, the development of multi-domain optical networks will be the trend of new-generation intelligent optical networks, and GMPLS-based survivability for multi-domain optical networks will become a hot topic of research in the future. This paper provides a comprehensive review of the existing survivable schemes in multi-domain optical networks and analyzes the shortcomings of current research. Based on previous studies, we present possible challenges and propose new ideas to design efficient survivable schemes to guide the future work of researchers in multi-domain optical networks.     

Interference Shaders of Thin Films

This paper presents a systematic study of light interferences at single thin films. Based on Fresnel's law, we have derived generic expressions of reflectance and transmittance for film interference, as well as specific expressions for free thin films and films coated on transparent or opaque objects. By combining film interference and volume absorption, we have obtained the reflectances and transmittances of film‐coated thin objects such as ribbons. Illumination models for all interference cases of single thin films are presented, and they have been implemented and tested for various structures and materials.     

Density Displays for Data Stream Monitoring

In many business applications, large data workloads such as sales figures or process performance measures need to be monitored in real‐time. The data analysts want to catch problems in flight to reveal the root cause of anomalies. Immediate actions need to be taken before the problems become too expensive or consume too many resources. In the meantime, analysts need to have the “big picture” of what the information is about. In this paper, we derive and analyze two real‐time visualization techniques for managing density displays: (1) circular overlay d isplays which visualize large volumes of data without data shift movements after the display is full, thus freeing the analyst from adjusting the mental picture of the data after each data shift; and (2) variable resolution density displays which allow users to get the entire view without cluttering. We evaluate these techniques with respect to a number of evaluation measures, such as constancy of the display and usage of display space, and compare them to conventional d isplays with periodic shifts. Our real time data monitoring system also provides advanced interactions such as a local root cause analysis for further exploration. The applications using a number of real‐world data sets show the wide applicability and usefulness of our ideas.     

Measuring ranked list robustness for query performance prediction

We introduce the notion of ranking robustness, which refers to a property of a ranked list of documents that indicates how stable the ranking is in the presence of uncertainty in the ranked documents. We propose a statistical measure called the robustness score to quantify this notion. Our initial motivation for measuring ranking robustness is to predict topic difficulty for content-based queries in the ad-hoc retrieval task. Our results demonstrate that the robustness score is positively and consistently correlation with average precision of content-based queries across a variety of TREC test collections. Though our focus is on prediction under the ad-hoc retrieval task, we observe an interesting negative correlation with query performance when our technique is applied to named-page finding queries, which are a fundamentally different kind of queries. A side effect of this different behavior of the robustness score between the two types of queries is that the robustness score is also found to be a good feature for query classification.