Search

Talent is the core competitive force of a hospital's development. Wuxi No. 2 People's Hospital followed the characteristics that medical talents mature slowly and their growth requires a long period. The innovated "talent tree" project, trained classified talents corresponding to "base-trunk-crown" of a tree, formed an individualized professional training plan with different levels and at different periods. We carried out a relay of the "talent tree" to bring their initiative into play. In practice, we gradually found this as a unique way of the talent construction, which conforms to our hospital's condition. This guarantees sustained development and innovative force of the hospital.

The analysis of underwater acoustic signals, especially ship-radiated noise received by passive sonar, is of great importance in theelds of defense, military, and scientic research. In this paper, we investigate multiple kernel learning graph embedding using auditory model features in the application of ship-radiated noise feature extraction. We use an auditory model to get auditory model features for each signal sample. In order to have more effective features, iterative multiple kernel learning methods are adopted to conduct dimensionality reduction. Validated by experiments, the proposed method outperforms ordinary kernel-based graph embedding methods. The experiments show that the multiple kernel learning method can automatically choose relatively appropriate kernel combinations in dimensionality reduction for ship-radiated noise using auditory model features. In addition, some worthwhile conclusions can be drawn from our experiments and analysis.

Purpose: The quality of medical services provided by competing public hospitals is the primary consideration of the public in determining the selection of a specific hospital for treatment. The main objective of strategic planning is to improve the quality of public hospital medical services. This paper provides an introduction to the history, significance, principles and practices of public hospital medical service strategy, as well as advancing the opinion that public hospital service strategy must not merely aim to produce but actually result in the highest possible level of quality, convenience, efficiency and patient satisfaction.

The existing Diffusion Maps method brings diffusion to data samples by Markov random walk. In this paper, to provide a general solution form of Diffusion Maps, first, we propose the generalized single-graph-diffusion embedding framework on the basis of graph embedding framework. Second, by designing the embedding graph of the framework, an algorithm, namely Locally Discriminant Diffusion Projection (LDDP), is proposed for speech emotion recognition. This algorithm is the projection form of the improved Diffusion Maps, which includes both discriminant information and local information. The linear or kernelized form of LDDP (i.e., LLDDP or KLDDP) is used to achieve the dimensionality reduction of original speech emotion features. We validate the proposed algorithm on two widely used speech emotion databases, EMO-DB and eNTERFACE'05. The experimental results show that the proposed LDDP methods, including LLDDP and KLDDP, outperform some other state-of-the-art dimensionality reduction methods which are based on graph embedding or discriminant analysis., Postojeće metode mapiranja difuzije u uzorke podataka primjenjuju Markovljevu slučajnu šetnju. U ovom radu, kako bismo pružili općenito rješenje za mapiranje difuzije, prvo predlažemo generalizirano okruženje za difuziju jednog grafa, zasnovano na okruženju za primjenu grafova. Drugo, konstruirajući ugrađeni graf, predlažemo algoritam lokalno diskriminantne projekcije difuzije (LDDP) za prepoznavanje emocionalnog stanja iz govornog signala. Ovaj algoritam je projekcija poboljšane difuzijske mape koja uključuje diskriminantnu i lokalnu informaciju. Linearna ili jezgrovita formulacija LDDP-a (i.e., LLDDP ili KLDDP) koristi se u svrhu redukcije dimenzionalnosti originalnog skupa značajki za prepoznavanje emocionalnog stanja iz govornog signala. Predloženi algoritam testiran je nad dvama široko korištenim bazama podataka za prepoznavanje emocionalnog stanja iz govornog signala, EMO-DB i eNTERFACE'05. Eksperimentalni rezultati pokazuju kako predložena LDDP metoda, uključujući LLDDP i KLDDP, pokazuje bolje ponašanje od nekih drugih najsuvremenijih metoda redukcije dimenzionalnosti, zasnovanim na ugrađenim grafovima ili analizi diskriminantnosti.

In the paper, synchronization of a class of complex dynamical networks with time-varying coupling delays is considered. By establishing impulsive delay differential inequalities, sufficient conditions on the asymptotical stability of complex dynamical networks are derived. Based on the analysis, two impulsive controllers are explicitly designed not only to achieve asymptotically stable for the complex networks, but also to ensure the convergence rate of complex networks. At last, some numerical examples are also given to illustrate the effectiveness of the proposed methods.

Speech emotion recognition (SER) is a powerful tool for endowing computers with the capacity to process information about the affective states of users in human–machine interactions. Recent research has shown the effectiveness of graph embedding-based subspace learning and extreme learning machine applied to SER, but there are still various drawbacks in these two techniques that limit their application. Regarding subspace learning, the change from linearity to nonlinearity is usually achieved through kernelization, whereas extreme learning machines only take label information into consideration at the output layer. In order to overcome these drawbacks, this paper leverages extreme learning machines for dimensionality reduction and proposes a novel framework to combine spectral regression-based subspace learning and extreme learning machines. The proposed framework contains three stages—data mapping, graph decomposition, and regression. At the data mapping stage, various mapping strategies provide different views of the samples. At the graph decomposition stage, specifically designed embedding graphs provide a possibility to better represent the structure of data through generating virtual coordinates. Finally, at the regression stage, dimension-reduced mappings are achieved by connecting the virtual coordinates and data mapping. Using this framework, we propose several novel dimensionality reduction algorithms, apply them to SER tasks, and compare their performance to relevant state-of-the-art methods. Our results on several paralinguistic corpora show that our proposed techniques lead to significant improvements.