Reliability Prediction for Internetware Applications:A Research Framework and Its Practical Use

The open and dynamic environment of Internet computing demands new software reliability technologies.How to efficiently and effectively build highly reliable Internet applications becomes a critical research problem.This paper proposes a research framework for predicting reliability of individual software entities as well as the whole Internet application.Characteristics of the Internet environment are comprehensively analyzed and several reliability prediction approaches are proposed.A prototype is implemented and practical use of the proposed framework is also demonstrated.

On similarity profiles predicted in the convective marine boundary layer

On the basis of the ideal of local scale similarity theory, the profile equations of wind, temperature and humidity for the eonvective marine boundary layer have been obtained. The marine boundary layer measurements were made over the western Pacific Ocean as past of the Tropical Ocean and Global Atmosphere (TOGA) Programme during Nov. 1986-Feb. 1987. The similarity profiles predicledfor wind. temperature and humidity in the MBL are in good agreement with the observational data.

Efficient Coding Unit and Prediction Unit Decision Algorithm for Multiview Video Coding

To aim at higher coding efficiency for multiview video coding, the multiview video with a modified high efficiency video coding（MV-HEVC）codec is proposed to encode the dependent views.However, the computational complexity of MV-HEVC encoder is also increased significantly since MV-HEVC inherits all computational complexity of HEVC. This paper presents an efficient algorithm for reducing the high computational complexity of MV-HEVC by fast deciding the coding unit during the encoding process. In our proposal, the depth information of the largest coding units（LCUs） from independent view and neighboring LCUs is analyzed first. Afterwards, the analyzed results are used to early determine the depth for dependent view and thus achieve computational complexity reduction. Furthermore, a prediction unit（PU） decision strategy is also proposed to maintain the video quality. Experimental results demonstrate that our algorithm can achieve 57% time saving on average,while maintaining good video quality and bit-rate performance compared with HTM8.0.

Latent Co-interests' Relationship Prediction

With the development of the social media and Internet, discovering latent information from massive information is becoming particularly relevant to improving user experience. Research efforts based on preferences and relationships between users have attracted more and more attention. Predictive problems, such as inferring friend relationship and co-author relationship between users have been explored. However, many such methods are based on analyzing either node features or the network structures separately, few have tried to tackle both of them at the same time. In this paper, in order to discover latent co-interests＇ relationship, we not only consider users＇ attributes but network information as well. In addition, we propose an Interest-based Factor Graph Model （I-FGM） to incorporate these factors. Experiments on two data sets （bookmarking and music network） demonstrate that this predictive method can achieve better results than the other three methods （ANN, NB, and SVM）.

Meta-Path-Based Search and Mining in Heterogeneous Information Networks

Information networks that can be extracted from many domains are widely studied recently. Different functions for mining these networks are proposed and developed, such as ranking, community detection, and link prediction. Most existing network studies are on homogeneous networks, where nodes and links are assumed from one single type. In reality, however, heterogeneous information networks can better model the real-world systems, which are typically semi-structured and typed, following a network schema. In order to mine these heterogeneous information networks directly, we propose to explore the meta structure of the information network, i.e., the network schema. The concepts of meta-paths are proposed to systematically capture numerous semantic relationships across multiple types of objects, which are defined as a path over the graph of network schema. Meta-paths can provide guidance for search and mining of the network and help analyze and understand the semantic meaning of the objects and relations in the network. Under this framework, similarity search and other mining tasks such as relationship prediction and clustering can be addressed by systematic exploration of the network meta structure. Moreover, with user＇s guidance or feedback, we can select the best meta-path or their weighted combination for a specific mining task.