A social interaction system based on cloud computing for mobile video telephony

As the use of smartphones become popular,people heavily depend on smartphone applications to deal with their social activities.For this reason,traditional message texting between mobile applications does not fulfill the versatile requirements of social networking.Many mobile applications use multimodality to deliver multimedia messages including sticker,voice and photo message,video call,and snap movie to enhance the communicative capability.However,without face-to-face interaction,people may fail to detect the other side’s non-verbal social behavior such as fine-grain facial expressions,body movements,or hand gesture.During social interaction,non-verbal behavior conveys information about the involved individuals and help the speakers express their social emotion in an implicit way.It is so important for real-world face-to-face interaction but is often blocked on the mobile telephony.To cope with this problem,we propose an afective computing model to assist the representation of social emotion and then help the progress of social interaction on the mobile telephony.In this model,for the purpose of real-time afective analysis,we delegate the computing loading to the cloud side service and enhance the system’s scalability and availability.The result of this experiment approves the feasibility of our system design for the applications of social intelligent.Also,the system provides a research framework of the social intelligent system on the mobile telephony.     

Perceptual image preview

Image preview is a convenient way to browse large or multiple images on small displays. However, current signal-level image resampling algorithms may remove many features of interest in the preview image. In this paper, we propose perceptual image preview which retains more perceptual features such that users can inspect features of interest by viewing the preview image only and without zooming in. This technology has two components, structure enhancement and perceptual feature visualization. Structure enhancement enhances the image structure while suppressing subtle details using a gradient modulation method, thus making the succedent perceptual features more apparent. For perceptual feature visualization, features of interest detected in the picture is visualized on the structure enhanced preview image. We demonstrate with two examples of most commonly used image quality features, image blur and noise. The effectiveness of the proposed method is validated by experimental results.     

遗传算法与文本特征选择方法相结合的研究

对文本特征选择的传统方法进行了深入分析并对各自的优缺点进行了详细的对比;其次,通过利用遗传算法自身的寻优特点,把它与传统特征选择方法相结合,并得出了算法。最后,在对各自算法进行了分析,表明了在性能上有了明显的提高。     

An improved method for voice pathology detection by means of a HMM-based feature space transformation

This paper presents new a feature transformation technique applied to improve the screening accuracy for the automatic detection of pathological voices. The statistical transformation is based on Hidden Markov Models, obtaining a transformation and classification stage simultaneously and adjusting the parameters of the model with a criterion that minimizes the classification error. The original feature vectors are built up using classic short-term noise parameters and mel-frequency cepstral coefficients. With respect to conventional approaches found in the literature of automatic detection of pathological voices, the proposed feature space transformation technique demonstrates a significant improvement of the performance with no addition of new features to the original input space. In view of the results, it is expected that this technique could provide good results in other areas such as speaker verification and/or identification.     

Structure damage diagnosis using neural network and feature fusion

A structure damage diagnosis method combining the wavelet packet decomposition, multi-sensor feature fusion theory and neural network pattern classification was presented. Firstly, vibration signals gathered from sensors were decomposed using orthogonal wavelet. Secondly, the relative energy of decomposed frequency band was calculated. Thirdly, the input feature vectors of neural network classifier were built by fusing wavelet packet relative energy distribution of these sensors. Finally, with the trained classifier, damage diagnosis and assessment was realized. The result indicates that, a much more precise and reliable diagnosis information is obtained and the diagnosis accuracy is improved as well.     

A unifying criterion for unsupervised clustering and feature selection

Exploratory data analysis methods are essential for getting insight into data. Identifying the most important variables and detecting quasi-homogenous groups of data are problems of interest in this context. Solving such problems is a difficult task, mainly due to the unsupervised nature of the underlying learning process. Unsupervised feature selection and unsupervised clustering can be successfully approached as optimization problems by means of global optimization heuristics if an appropriate objective function is considered. This paper introduces an objective function capable of efficiently guiding the search for significant features and simultaneously for the respective optimal partitions. Experiments conducted on complex synthetic data suggest that the function we propose is unbiased with respect to both the number of clusters and the number of features.     

Finite-time weighted average consensus with respect to a monotonic function and its application

The consensus state is an important and fundamental quantity for consensus problems of multi-agent systems, which indicates where all the dynamical agents reach. In this paper, weighted average consensus with respect to a monotonic function, which means that the trajectories of the monotonic function along the state of each agent reach the weighted average of their initial values, is studied for a group of kinematic agents with time-varying topology. By constructing a continuous nonlinear distributed protocol, such a consensus problem can be solved in finite time even though the time-varying topology involves unconnected graphs. Then the distributed protocol is employed to compute the maximum-likelihood estimation of unknown parameters over sensor networks. Compared with the existing results, the estimate scheme proposed here may reduce the costs of data communication, storage memory, book-keeping and computational overheads.     

Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5

We begin by showing how to faithfully encode the Classical ModalDisplay Logic (CMDL) of Wansing into the Calculus of Structures(CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination,we obtain a cut-elimination theorem for all corresponding CoScalculi. We then show how our result leads to a minimal cut-freeCoS calculus for modal logic S5. No other existing CoS calculifor S5 enjoy both these properties simultaneously.