Locally linear embedding (LLE), recently proposed unsupervised procedure for mapping high-dimensional data nonlinearly to a lower-dimensional space, is shown to yield remarkable good results in exploratory analysis an...
详细信息
Locally linear embedding (LLE), recently proposed unsupervised procedure for mapping high-dimensional data nonlinearly to a lower-dimensional space, is shown to yield remarkable good results in exploratory analysis and visualization. LLE is able to learn the global structure of nonlinear manifolds, and it maps its inputs into a single global coordinate system of lower dimensionality, which takes good advantage of remaining points close to each other in the computed low-dimensional space when they are close to each other in the high-dimensional space. However, the application to the closed geometry is consequently limited. The purkinje system is a very important conduction system in the endocardial surface of the ventricle that is a semi-closed organ. Traditional construction of the purkinje system is mostly relevant to the fractal tree or something similar, which is based of supposed theory and is an approximation to the actuality. In this paper, a novel method for the construction of the purkinje system in the canine left ventricle by applying LLE algorithm is proposed. The results show that the construction of the purkinje system approaches the one in real structure of the left ventricle better than ever reconstructed.
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a new class of clustering algorithm, K-...
详细信息
In many areas of pattern recognition and machine learning, subspace selection is an essential step. Fisher's linear discriminant analysis (LDA) is one of the most well-known linear subspace selection methods. Howe...
详细信息
With the developing of pervasive computingtechnology especially the appearance of the internet of things, there will generate more tremendous real-time or OLTP information that requires the data center with high avai...
详细信息
With the developing of pervasive computingtechnology especially the appearance of the internet of things, there will generate more tremendous real-time or OLTP information that requires the data center with high availability and performability. This paper proposes a hierarchical approach to model and evaluate the availability and performability of the transaction processing data center using throughout under fault-injection as reward rate. An example is given out to illustrate the use of the approach.
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets. Different from the previous algorith...
Online video archives provide a large amount of multimedia presentation contents through the Internet. But, it takes a long time to find what they really want to watch from a lot of presentation videos. We have been d...
详细信息
The news filtering and summarization (NFAS) system can automatically recognize Web news pages, retrieve each news page's title and news content, and extract key phrases. This extraction method substantially outper...
To develop a well-designed curriculum of service engineering is a prerequisite for training students get new skills and ability to design and develop globally effective solutions in a service business environment. As ...
详细信息
ISBN:
(纸本)9781424466030;9780769540177
To develop a well-designed curriculum of service engineering is a prerequisite for training students get new skills and ability to design and develop globally effective solutions in a service business environment. As service engineering is an application-oriented discipline, sufficient practice is extremely important. In this paper, we show an experimental solution of a course "comprehensive practice on service engineering", which has been explored for three years in Harbin Institute of technology. Its objective, process, execution program, and detailed design of each phase, are elaborately presented. Lessons learned from the explorations and future improvement on this solution, are briefly discussed.
We present a pattern-oriented service design and evolution approach by transforming the high-level service value network into service choreography scenario. In this approach, “value” is considered the ultimate goal ...
详细信息
We present a pattern-oriented service design and evolution approach by transforming the high-level service value network into service choreography scenario. In this approach, “value” is considered the ultimate goal of a service, and designing an executable SOA-based service system starts from the acquisition of business-level value exchange relationships between participants in the service. Such value information is modeled as Service Value Network (SVN). Following a four-step process, SVN is gradually mapped to software-level service choreography and the corresponding interface design, thereby keeping the consistency between both levels. Especially, we present five typical service value exchange patterns to facilitate the construction and transformation of SVN with higher efficiency. A case study from ocean transportation service is shown for demonstration.
We present a service resource selection and scheduling approach capable of maximizing the resource utilization rate (RUT) and the requirement satisfaction degree (RSD) by bundling multiple customer requirements (CRs)....
详细信息
We present a service resource selection and scheduling approach capable of maximizing the resource utilization rate (RUT) and the requirement satisfaction degree (RSD) by bundling multiple customer requirements (CRs). In traditional approaches, each CR is optimally satisfied by independently selecting a set of candidate service resources. This possibly leads to a low RUT and low RSD. In our approach, multiple CRs raised within a certain time period are bundled and a virtual service resource (VSR) is constructed to satisfy these requirements simultaneously by making full use of the sharing nature of resources. Specifically, each CR is first decomposed into a set of atomic requirements, which are then re-aggregated according to their requested resources. For four types of service-resource sharing patterns, we present the corresponding greedy algorithms that construct the VSR and its scheduling. The goals of our methods are (1) maximizing the satisfaction degree of CRs and (2) maximizing the RUT of service resources. The effectiveness of our approach is demonstrated in an experiment for a typical scenario of ocean transportation service.
暂无评论