15246145
A comprehensive semantic-based resource allocation framework for workflow management systems
Resource allocation that targets to assign the appropriate resource to the dynamically generated work item has always been a critical issue in the workflow management system research. However, today's workflow systems almost still depend on the static literal-based matchmaking mechanism to support the resource allocation, which would suffer greatly from the diversity and mutability of resources in current open and dynamic network environment. In this paper, we propose a comprehensive semantic-based resource allocation framework to enhance the matchmaking process. The essential contributions of this framework are: firstly, an OWL ontology is provided to describe available resources based on their semantic information. Secondly, based on the ontology, effective semantic reasoning techniques are used to select the eligible resource candidates. Thirdly, a bidding approach is adopted to further optimize the resource selection according to runtime conditions such as duration, cost and etc., which would typically overcome the inaccurate assignment based on pure static information in previous study.
8395605
FLTL-MC: Online High Level Program Analysis for Web Services
Although Java- or .NET- centric technologies are the most commonly used in Web services, they are by no means the only ones in practice. This paper proposes an online finite model checking tool FLTL-MC to check the high level safety and liveness properties in complex distributed web service systems, which can offer both a richer and more natural way to search errors. Liveness properties can specify desirable system behaviors which must be satisfied eventually, but are not always satisfied. Existing software model checkers cannot verify liveness in real code because doing so requires finding an infinite execution that does not satisfy aliveness property. In our proposed model, we adopt the finite linear temporal logic to specify the semantics of the online model checking, use binary instrumentation to obtain the distribute states and apply the FLTL-MC engine to dynamically verify the finite linear temporal logic properties in Web service systems. At last, we investigate the well-known distributed protocol WS-Reliable Messaging to demonstrate its applications and detect some hidden bugs with our prototype system.
12111515
Algorithm of integrating QFD and TRIZ for the innovative design process
TRIZ, the Russian acronym of the Theory of Inventive Problem Solving, is a useful tool that can solve the problem of "how to do" effectively in the innovative design process, while QFD (Quality Function Deployment) is able to settle the problem of "what to do". Although the potential of using both QFD and TRIZ in the product design process is huge, there are little tools to integrate these two methods effectively. In this research, we describe an algorithm that can integrate QFD and TRIZ effectively for the purpose of the innovative design process. The core of the algorithm is to identify the contradictions in TRIZ by defining rules based on HOQ (House of Quality) in QFD. A software tool called TRIZmatrix is developed based on this algorithm. Application of the algorithm to the case of the airbag problem is studied in detail. The software application and the case study show the advantage of this algorithm for CAI (computer aided innovation) software development.
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.
13862518
Low Cost Mechanism for QoS-Aware Re-Planning of Composite Service
To meet the business and user requirements, it is crucial to manage the Quality of Service (QoS) of composite web service. Due to the dynamics nature of the web services, the runtime behavior of web services is likely to differ from the initial estimated one. Therefore, a re-planning to adapt the composite service to the QoS violated services, ensuring the global constraints and preferences will be needed. In this paper, we propose a low cost mechanism for re-planning. Such mechanism is supported by an offline re-planning execution environment and a performance prediction based low cost policy.The experimentations show better performance of the mechanism.
10702245
A wireless LAN-based indoor positioning technology
Context-aware computing is an emerging computing paradigm that can provide new or improved services by exploiting user context information. In this paper, we present a wireless-local-area-network-based (WLAN-based) indoor positioning technology. The wireless device deploys a position-determination model to gather location information from collected WLAN signals. A model-based signal distribution training scheme is proposed to trade off the accuracy of signal distribution and training workload. A tracking-assistant positioning algorithm is presented to employ knowledge of the area topology to assist the procedure of position determination. We have set up a positioning system at the IBM China Research Laboratory. Our experimental results indicate an accuracy of 2 m with a 90% probability for static devices and, for moving (walking) devices, an accuracy of 5 m with a 90% probability. Moreover, the complexity of the training procedure is greatly reduced compared with other positioning algorithms.
6929789
WSN02-2: Adaptive Network Resource Management in IEEE 802.11 Wireless Random Access MAC
Effective and efficient management of wireless network resources is attracting more and more research attention, due to the rapid growing deployment of wireless mesh and ad hoc networks and to the increasing demand for Quality of Service (QoS) support in these networks. This paper proposes an adaptive network resource management scheme in the popular IEEE 802.11 random access MAC by adaptively adjusting the minimum contention window sizes of traffic flows. First, a novel generalized processor sharing (GPS) model is presented for the IEEE 802.11 random access MAC revealing the relationship between the minimum contention window size of a traffic flow and the amount of network resource this flow can receive. Using this GPS MAC model, a feedback control system model for the proposed adaptive network resource management system is developed, by directly extending our previous work in wireline GPS networks. Based on the feedback control system model, adaptive P and adaptive PI controllers are designed, and their performances are studied in simulations. Simulation results show that by using the designed controllers, the proposed adaptive network resource management approach is able to provide guaranteed distinct QoS support to traffic flows.
20063786
Implementation of a graphics design framework on the Web
We propose a client-server graphics design framework and implement a room design system using CORBA. We have integrated technologies used in distributed computation (Java and CORBA) and computer graphics (VRML). To support multiuser collaborative design, we propose a supplier-consumer communication approach and implement it using the event service in CORBA. Our system can be applied in electronic commerce to improve the existing systems by allowing customers to select furniture and to visualize the whole furnished room in 3D.
11313688
Existence of Classes and Value Specification of Variables
In mathematics, when we want to introduce classes which fulfill certain conditions, we usually prove beforehand that classes fulfilling such conditions do exist, and that such classes are uniquely determined by the conditions. The statements which state such unicity and existence of classes are in mathematical logic consequences of the principles of extensionality and class existence. In order to illustrate how these principles enable us to introduce classes into systems of mathematical logic, let us consider the manner in which Godel introduces classes in his book on set theory. For instance, before introducing the definition of the non-ordered pair of two classes Godel puts down as its justification the following two axioms: By A4, for every two classes y and z there exists at least one non-ordered pair w of them; and by A3, w is uniquely determined in A4.
32406655
A Parallel Algorithm for Learning Bayesian Networks
Computing the expected statistics is the main bottleneck in learning Bayesian networks in large-scale problem domains. This paper presents a parallel learning algorithm, PL-SEM, for learning Bayesian networks, based on an existing structural EM algorithm (SEM). Since the computation of the expected statistics is in the parametric learning part of the SEM algorithm, PLSEM exploits a parallel EM algorithm to compute the expected statistics. The parallel EM algorithm parallelizes the E-step and M-step. At the E-step, PLSEM parallel computes the expected statistics of each sample; and at the M-step, with the conditional independence of Bayesian networks and the expected statistics computed at the E-step, PL-SEM exploits the decomposition property of the likelihood function under the completed data to parallel estimate each local likelihood function. PL-SEM effectively computes the expected statistics, and greatly reduces the time complexity of learning Bayesian networks.
9363924
RNA pseudoknot prediction using term rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction method based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The method we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions.