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.
15004157
A Semantic QoS-Aware Discovery Framework for Web Services
Augmenting web services with explicit semantics forms the foundation of Service Oriented Architectures (SOAs) automation. As more and more Semantic Web Services (SWSs) are deployed, similar SWSs could have quite different quality-of-service (QoS) levels. The QoS-aware discovery becomes an important challenge. While some efforts try to solve it via Constraint Programming (CP), they suffer from the purely syntactic matchmaking method. Furthermore, the construction of constraints and the selection of services are completely dependent on the literal translation from QoS descriptions, which increase obstacles to actually apply CP. In this paper, we propose a semantic QoS-aware framework for SWSs discovery by combining the semantic matchmaking and CP. Initially, a QoS ontology is presented to define QoS data into service descriptions. Then the ontology reasoning is adopted to change previous syntactic matchmaking into a semantic way. Through confirming the compatibility of concepts, complex QoS conditions are solved as constraints and a selection algorithm is proposed to obtain the optimal offer. Finally, the prototype implementation of our framework is discussed and a SWSs discovery case is used to illustrate the comprehensive discovery process.
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.
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)
41927172
A Wavelets Network Interpolation Algorithm for OFDM Channel Estimation Systems
For the performance deficiency of the pilot symbol aided channel estimation in orthogonal frequency division multiplexing (OFDM) systems, the wavelets network interpolation channel estimator is proposed. By contrast with conventional methods, wavelets network interpolation channel estimator can guarantee the high transmission rate and lower Bit error rates (BER). Computer simulation results demonstrate that the proposed channel estimation method exhibit an improved performance compared to the conventional linear channel estimation methods and is robust to fading rate, especially in fast fading channels.
31126370
Transform BPEL Workflow into Hierarchical CP-Nets to Make Tool Support for Verification
Availability of a wide variety of Web services over the Internet offers opportunities of providing new value added services by composing existing ones. Service composition poses a number of challenges. A composite service can be very complex in structure, containing many temporal and data-flow dependencies between the component services. It is highly desirable therefore to be able to validate that a given composite service is well formed: proving that it will not deadlock or livelock and that it respects the sequencing constraints of the constituent services. In this paper, we propose an approach of composition analysis and verification based on Colored Petri nets (CP-nets), which is an extended version of Petri Nets, which have a sound mathematical semantics and a number of existing analysis tools. We provide translation rules of web composition language into CP-nets and a technique to analyze and verify effectively the net to investigate several behavioral properties. Our translation technique is essentially independent of which language we describe composition. As an example, to show the effectiveness of our technique, we pick up BPEL and translate the BPEL specification into CP-nets in a constructive way. These nets are analyzed and verified as prototypes of the specification.
21928964
Energy-aware optimal workload allocation among the battery-powered devices to maximize the co-operation life time
Traditional low power design minimizes the total power consumption. However for systems that want to maximize co-operation life time among the battery-powered devices, the total power minimization strategy may not be the best. The workload allocation among these devices has a dramatic impact on the co-operation life time. In this paper, we address this problem by formulating it as a linear programming (LP) problem. A simplified energy-aware algorithm is proposed to provide the optimal solution according to the energy capacity ratio of the devices. This algorithm is simple enough to be embedded into real-time system and we illustrate this by an example using a configurable transmitter-receiver pair. Experimental results show that the proposed algorithm significantly outperforms the other workload allocation strategies by 400.66% in the randomly-generated systems and 23.20% in a point-to-point (P2P) communication system, respectively
40832727
Interactive Semisupervised Learning for Microarray Analysis
118699197
Intentionally and unintentionally: on both, A and non-A, in neutrosophy
The paper presents a fresh new start on the neutrality of neutrosophy in that "both A and Non-A" as an alternative to describe Neuter-A in that we conceptualize things in both intentional and unintentional background. This unity of opposites constitutes both objective world and subjective world. The whole induction of such argument is based on the intensive study on Buddhism and Daoism including I-ching. In addition, a framework of contradiction oriented learning philosophy inspired from the Later Trigrams of King Wen in I-ching is meanwhile presented. It is shown that although A and Non-A are logically inconsistent, but they are philosophically consistent in the sense that Non-A can be the unintentionally instead of negation that leads to confusion. It is also shown that Buddhism and Daoism play an important role in neutrosophy, and should be extended in the way of neutrosophy to all sciences according to the original intention of neutrosophy.