206743120
An Efficient Cloud Computing-Based Architecture for Freight System Application in China Railway
Cloud computing is a new network computing paradigm of distributed application environment. It utilizes the computing resource and storage resource to dynamically provide on-demand service for users. The distribution and parallel characters of cloud computing can leverage the railway freight system. We implement a cloud computing-based architecture for freight system application, which explores the Tashi and Hadoop for virtual resource management and MapReduce-based search technology. We propose the semantic model and setup configuration parameter by experiment, and develop the prototype system for freight search and tracking.
42839671
A Novel Integrated Supporting System for Mesh-Pull Based P2P IPTV
This paper presents a novel integrated supporting system for the mesh-pull based P2P IPTV. The proposed system can monitor the service quality of each overlays within the system by initiating random walks to sample key metrics of the system periodically and analyze the service quality statistically, and improve them to some extend. When the service quality is below the threshold, the system will increase its upload bandwidth adaptive to the workload of the system. The supporting system will allocate its bandwidth among multiple overlays to get the as much revenue as possible. This paper presents the design of this architecture and describes its functions and shows its adaptability to the high dynamic nature of p2p IPTV system and fitness for commercial deployment. At last we verify the feasibility of the architecture by simulation, and the results show its performance and adaptability.
13519541
WS-SLA: A Framework for Web Services Oriented Service Level Agreements
Service level agreements (SLA) becomes the prevailing business model for delivery of a large number of products and services in telecommunication and IT arenas. We presents an integrated service level agreement model applied to operating supporting system (OSS), on the basis of WfMC workflow reference model and service oriented architecture (SOA). And an application scenario instance of SLA system architecture is described by a set of operations models by Business Process Execution Language (BPEL)
41711298
Quantitative QoS Management Implement Mechanism in IP-DiffServ
In this paper, a quantitative QoS management implement mechanism in IP-DiffServ is presented. The approach has three merits: (1) it optimizes both the route selected for service class by traffic engineering in network layer and the service class selected for the user services by network plan in service layer, (2) it ensures quantitative QoS for the user service in DiffServ, (3) it achieves high resource utilization, and achieves better performance with less cost for the user service and selected route. Simulation has verified these merits.
32348366
Stabilization of switched linear systems with bounded disturbances and unobservable switchings
This paper studies the stabilization problem of switched linear systems with bounded disturbances. It is assumed that the system switches among an infinite set of uniformly controllable linear systems, and that the switching signals are not observable, but the switching duration has a lower bound. It will be shown that by combining on-line adaptive estimation and control in the controller design, a feedback control law can be constructed which makes the switched linear system globally stable.
1036059
Neighbor Relationship and Optimization in Mesh Overlay Multicast
Nodes in mesh overlay multicast system don't have fixed parent-children relationship like that in trees and form neighbors. But in data-driven mesh and based on pulling method, for each packet, it still follows a certain tree and the parent-children relationship does exist. While having the powerful peers stay closer to the source may improve the performance, we make the peers of high out bandwidth preempt the neighbor of the peers near the source. In our paper, we describe the delivery trees set and construct the main distribution tree, which carries most of the data, to construct the signaling path and relay priority preemption message to reduce the cost. We model the neighbor relationship to decide which neighbor to be preempted based on the capacity of the node and the contribution it makes to the probed nodes. Our simulations show that after a temporary reduction in performance at the beginning, which for the optimization chaos of optimization procedure, the system converges to a stable state and gains better performance, especially for playback delay, and meanwhile the control overhead is in reasonable range.
27471784
A Novel Greedy Bayesian Network Structure Learning Algorithm for Limited Data
Existing algorithms for learning Bayesian network (BN) require a lot of computation on high dimensional itemsets, which affects accuracy especially on limited datasets and takes up a large amount of time. To alleviate the above problem, we propose a novel BN learning algorithm MRMRG, Max Relevance and Min Redundancy Greedy algorithm. MRMRG algorithm is a variant of K2 algorithm for learning BNs from limited datasets. MRMRG algorithm applies Max Relevance and Min Redundancy feature selection technique and proposes Local Bayesian Increment (LBI) function according to the Bayesian Information Criterion (BIC) formula and the likelihood property of overfitting. Experimental results show that MRMRG algorithm has much better efficiency and accuracy than most of existing BN learning algorithms when learning BNs from limited datasets.
8017889
An architecture of wireless Web and dialogue system convergence for multimodal service interaction over converged networks
This paper presents the software architecture for a new paradigm of wireless Web and dialogue system convergence and its corresponding approach to deliver multimodal multimedia enterprise communication services in the wireless environment. It uses an event-triggered service delivery method that separates service interaction and wireless web-based service delivery. A customized content presentation approach is adopted to transform the content of the service into a format suitable for presentation on the target devices. The system also contains a service delivery monitoring and backup mechanism, which is capable of sending the service content using other communication channels according to the user's preference and the channel conditions. A prototype system was implemented based on the proposed approach, which demonstrates the performance advantage of our method in the enterprise service application.
27634891
Nonlinear Adaptive Blind Source Separation Based on Kernel Function
As the linear method is difficult to recover the sources from the nonlinear mixture signals, in this paper a new nonlinear adaptive blind signal separation algorithm based kernel space is proposed for general invertible nonlinearities. The received mixture signals are mapped from low dimensional space to high dimensional kernel feature space. In the feature space, the received signals form a smaller submanifold, and an orthonormal basis of the submanifold is constructed in this space, as the same time, the mixture signals are parameterized by the basis in the high dimensional kernel space. In the noiseless or noisy situation, the sources are rebuilt online processing by M-EASI and subspace tracking. The results of computer simulations are also presented.
3064561
Using Web Photos for Measuring Video Frame Interestingness
In this paper, we present a method that uses web photos for measuring frame interestingness of a travel video. Web photo collections, such as those on Flickr, tend to contain interesting images because their images are more carefully taken, composed, and selected. Because these photos have already been chosen as subjectively interesting, they serve as evidence that similar images are also interesting. Our idea is to leverage these web photos to measure the interestingness of video frames. Specifically, we measure the interestingness of each video frame according to its similarity to web photos. The similarity is defined based on the scene content and composition. We characterize the scene content using scale invariant local features, specifically SIFT keypoints. We characterize composition by feature distribution. Accordingly, we measure the similarity between a web photo and a video frame based on the co-occurrence of the SIFT features, and the similarity between their spatial distribution. Interestingness of a video frame is measured by considering how many photos it is similar to, and how similar it is to them. Our experiments on measuring frame interestingness of videos from YouTube using photos from Flickr show the initial success of our method.
5701196
An Architecture for Supporting Network Fault Recovery Management
Highly available and resilient networks play a decisive role in today's networked world. As network faults are inevitable and networks are becoming constantly intricate, finding effective fault recovery solutions in a timely manner is becoming a challenging task for administrators. Therefore, an automated mechanism to support fault resolution is essential towards efficient fault handling process. In this paper we propose an architecture to support automated fault recovery in terms of traffic engineering, recovery knowledge discovery and automated recovery planning. We base our discussion on an application scenario for recovery from border router failure to maintain optimized configuration of outbound inter-domain traffic.