2247575
Towards dynamic process with variable structure by reflection
Advancing information technologies are increasing the evolution and variation of software resources. Applications that cannot adapt to dynamic environments will decrease their usefulness, particularly to business process systems that face requirements changed frequently. After surveying related work, we propose a new formalism for modeling dynamic process in which the state space and transition function are enriched so that one model can transit to another model at runtime by the computational reflection that aims to represent and modify its own design. Such goal necessitates an appropriate runtime environment. We introduce the service cooperation middleware (SCM) because it is service-oriented, into which the reflection mechanism is easily attached to support structural and behavioural changes on processes at runtime.
38303932
Fuzzy inference based on fuzzy concept lattice
In this paper, a fuzzy inference method based on the notion of fuzzy concept lattice is studied. We first propose a new form of fuzzy concept lattice, and then based on three kinds of known fuzzy concept lattices and our new fuzzy concept lattice, two coherent fuzzy inference methods, the lower approximate fuzzy inference and the upper approximate fuzzy inference, are proposed, and the combined use of the two methods will make the fuzzy inference more precise.
17485840
A framework for application server based Web services management
Web services are considered as solution for solving the interoperability problem and the challenge of integration. How to manage Web services more efficiently is a key problem to the applications based on Web services at present. This paper presents a framework for application server based Web services management named FASWSM. The main contribution of FASWSM is Web service adaptation, so that a Web service can be plugged into the application server (AS) as a Web service adapter which enables a Web service to be managed by the application server. Therefore, the Web services management efforts are greatly reduced by leveraging various services provided by the AS. The FASWSM also provides mechanisms for dynamical reconfiguration which improve the extensibility and flexibility of Web services management. The FASWSM has been applied to OnceAS 2.0 application server, and the experiments data show that FASWSM outperforms JAX-RPC in terms of Web service invocation.
17469824
Extending OBDD graphs for composite event matching in content-based pub/sub systems
Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Its core problem is how to match events by predicates on the content of events. In this paper, we propose three matching models, extend the simple matching to the multi-semantic matching and introduce the temporal constraint variable. The multi-semantic matching allows using different operations in accordance with different semantics; the temporal constraint variable supports processing the discrete events in the temporal sequence. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. At last, based on OBDD graphs the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
46077798
A Component-Based Analytical Performance Model of IP-Based SAN
In this paper we propose a component-based analytical performance model for IP-based SAN. This model evaluates and analyzes the behavior of IP network, cache, RAID and disks under multiple synchronous I/O workloads by using closed queueing networks. The theoretical results are compared with the results from a real IP-based SAN using a variety of synthetic workloads. These experiments prove that the component-based method is an appropriate way to build performance model for a complex storage system. Using the model, we can find out that the bottleneck of SAN performance is network or storage node under different workloads or applications. We also identify areas for future research in the performance analysis of real IP-based SAN.
2507502
An Analytical Performance Model of IP-SAN
In this paper we propose a component-based analytical performance model for IP-SAN. We model four key components within IP-SAN individually and they are IP network, cache, RAID and disks. We validate these component models and compose them to give an entire IP-SAN performance model. The entire IP-SAN model analyzes the performance of an IP-SAN configuration under multiple synchronous workloads by using closed queueing network model and under asynchronous workload by using open queueing network model. We also validate the entire IP-SAN performance model against a real IP-SAN system. The theoretical results are compared with the results from a real IP-SAN using a variety of synthetic workloads. These experiments prove that the component-based method is an appropriate way to build performance model for a complex storage system. To our knowledge, this is the first exploration into building analytical performance model for entire IP-SAN system and validating against a real system. We also identify areas for future research in the performance analysis of real IP-SAN.
8551994
Soft Edge Smoothness Prior for Alpha Channel Super Resolution
Effective image prior is necessary for image super resolution, due to its severely under-determined nature. Although the edge smoothness prior can be effective, it is generally difficult to have analytical forms to evaluate the edge smoothness, especially for soft edges that exhibit gradual intensity transitions. This paper finds the connection between the soft edge smoothness and a soft cut metric on an image grid by generalizing the Geocuts method (Y. Boykov and V. Kolmogorov, 2003), and proves that the soft edge smoothness measure approximates the average length of all level lines in an intensity image. This new finding not only leads to an analytical characterization of the soft edge smoothness prior, but also gives an intuitive geometric explanation. Regularizing the super resolution problem by this new form of prior can simultaneously minimize the length of all level lines, and thus resulting in visually appealing results. In addition, this paper presents a novel combination of this soft edge smoothness prior and the alpha matting technique for color image super resolution, by normalizing edge segments with their alpha channel description, to achieve a unified treatment of edges with different contrast and scale.
9372724
Provably Correct Runtime Enforcement of Non-interference Properties
Non-interference has become the standard criterion for ensuring confidentiality of sensitive data in the information flow literature. However, application of non-interference to practical software systems has been limited. This is partly due to the imprecision that is inherent in static analyses that have formed the basis of previous non-interference based techniques. Runtime approaches can be significantly more accurate than static analysis, and have often been more successful in practice. However, they can only reason about explicit information flows that take place via assignments in a program. Implicit flows that take place without involving assignments, and can be inferred from the structure and/or semantics of the program, are missed by runtime techniques. This paper seeks to bridge the gap between the accuracy provided by runtime techniques and the completeness provided by static analysis techniques. In particular, we develop a hybrid technique that relies primarily on runtime information-flow tracking, but augments it with static analysis to reason about implicit flows that arise due to unexecuted paths in a program. We prove that the resulting technique preserves non-interference, while providing some of the traditional benefits of dynamic analysis such as improved accuracy.
20174343
An operator splitting method for variational inequalities with partially unknown mappings
In this paper, we propose a new operator splitting method for solving a class of variational inequality problems in which part of the underlying mappings are unknown. This class of problems arises frequently from engineering, economics and transportation equilibrium problems. At each iteration, by using the information observed from the system, the method solves a system of nonlinear equations, which is well-defined. Under mild assumptions, the global convergence of the method is proved, and its efficiency is demonstrated with numerical examples.
8310892
Numerical meshfree path integration method for non-linear dynamic systems
Abstract We present a new numerical meshfree path integration (MPI) method for non-linear dynamic systems. The obtained MPI method can be performed in the irregular computational domain and the probability density values of the random nodes in the domain can be calculated via the MPI method and the ordinary differential equations for the first and second-order moments on the basis of Gaussian closure method. The piecewise linear interpolation based on adaptive least squares is utilized as a post processor to approximate the probability density values on arbitrary positions. The good performance of the resulting method is finally shown in the numerical examples by using three specific non-linear dynamic systems: Duffing oscillator subjected to both harmonic and stochastic excitations, Duffing–Rayleigh oscillator subjected to both harmonic and stochastic excitations, and CHEN system driven by three different Gaussian white noises.
2644615
3D finite element mesh generation of complicated tooth model based on CT slices
An interactive three-dimensional finite element generation method is presented for modelling a multi-connected teeth and mandible structure. The tetrahedron is chosen as the basic element type due to its rigorous adaptability to structures with geometric complexities. The mesh generation is implemented by allocating two quadrangles in adjacent CT image slices to form a set of tetrahedrons. By examining all the possible allocations and their degradations, an algorithm is developed for interactive mesh generation, resulting in a series of tetrahedrons consistent with all the others without overlapping and spacing. The developed system was applied to a tooth-mandibular structure, generating a complicated 3D FEM model consisting of 4762 nodes and 18,534 tetrahedral elements with nine different materials. This 3D model was successfully used to evaluate different tooth restoration strategies, which proved the viability and effectiveness of the proposed method.