The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized...The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized Carlson iterating function possesses more excellent properties such as self-similarity and exponential symmetry are also explained.K-index,P-index,O-index,and complexity index are introduced to contribute to performance analysis.Considering nine different operational orders and choosing an appropriate rational initial impedance for a certain operational order,these rational approximation impedance functions calculated by the iterating function meet computational rationality,positive reality,and operational validity.Then they are capable of having the operational performance of fractional operators and being physical realization.The approximation performance of the impedance function to the ideal fractional operator and the circuit network complexity are also exhibited.展开更多
Applying dynamic web services composition is one of the important schemas for solving service-oriented architecture （SOA）and service-oriented computing（SOC）.For implementing dynamic web services composition,the mu...Applying dynamic web services composition is one of the important schemas for solving service-oriented architecture （SOA）and service-oriented computing（SOC）.For implementing dynamic web services composition,the multi agent system （MAS）is applied to web services composition.First, the essentials of the MAS and web services composition are analyzed and their relationship is discussed.Secondly, an MAS-based architecture is designed for dynamic web services composition,and it is named as CSMWC.A Jade tool is used to implement the major components.The architecture can primarily implement syntactic level dynamic web services composition,and it gives a basis for semantic level dynamic web services composition.For specifying the correctness of the architecture,by using pi-calculus,the architecture of the MAS is formally described,and its dynamic properties and adaptability are reasoned.Finally,it demonstrates the idea proposed by the Pi4SOA tool.展开更多
In this paper,we consider an inference problem for an Ornstein-Uhlenbeck process driven by a general one-dimensional centered Gaussian process(G_(t))t≥0.The second order mixed partial derivative of the covariance fun...In this paper,we consider an inference problem for an Ornstein-Uhlenbeck process driven by a general one-dimensional centered Gaussian process(G_(t))t≥0.The second order mixed partial derivative of the covariance function R(t,s)=E[GtGs]can be decomposed into two parts,one of which coincides with that of fractional Brownian motion and the other of which is bounded by(ts)^(β-1)up to a constant factor.This condition is valid for a class of continuous Gaussian processes that fails to be self-similar or to have stationary increments;some examples of this include the subfractional Brownian motion and the bi-fractional Brownian motion.Under this assumption,we study the parameter estimation for a drift parameter in the Ornstein-Uhlenbeck process driven by the Gaussian noise(G_(t))t≥0.For the least squares estimator and the second moment estimator constructed from the continuous observations,we prove the strong consistency and the asympotic normality,and obtain the Berry-Esséen bounds.The proof is based on the inner product's representation of the Hilbert space(h)associated with the Gaussian noise(G_(t))t≥0,and the estimation of the inner product based on the results of the Hilbert space associated with the fractional Brownian motion.展开更多
Two-thirds simulation provides a kind of abstract description of an implementation with respect to a specification. In order to characterize the approximate two-thirds simulation, we propose the definition of a two- t...Two-thirds simulation provides a kind of abstract description of an implementation with respect to a specification. In order to characterize the approximate two-thirds simulation, we propose the definition of a two- thirds simulation index which expresses the degree to which a binary relation between processes is two-thirds simulation. 2-two-thirds simulation and its substitutivity laws are given in this paper. And, based on 2-two-thirds simulation, we present a measure model for describing the degree of approximation between processes. In particular, we give the modal logical characterization of 2-two-thirds simulation.展开更多
This paper focuses on solving the modeling issues of monitoring system service performance based on the network calculus theory.First,we formulate the service model of the smart grid monitoring system.Then,we derive t...This paper focuses on solving the modeling issues of monitoring system service performance based on the network calculus theory.First,we formulate the service model of the smart grid monitoring system.Then,we derive the flow arrival curve based on the incremental process related functions.Next,we develop flow arrival curves for the case of the incremental process being a fractional Gaussian process,and then we obtain the generalized Cauchy process.Three technical theorems related to network calculus are presented as our main results.Mathematically,the variance of arrival flow for the continuous time case is derived.Assuming that the incremental process of network flow is a Gaussian stationary process,and given the auto-correlation function of the incremental process with violation probability,the formula of the arrival curve is derived.In addition,the overall flow variance under the discrete time case is explicitly derived.The theoretical results are evaluated in smart grid applications.Simulations indicate that the generalized Cauchy process outperforms the fractional Gaussian process for our considered problem.展开更多
Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof ...Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof framework with sequences of games.We make slight modifications to Blanchet's calculus to make it easy for parsing the initial game.The main contribution of this work is that it introduces algebraic properties with observational equivalences to automatic security proofs,and thus can deal with some practical cryptographic schemes with hard problems.We illustrate the use of algebraic properties in the framework by proving the semantic security of the ElGamal encryption scheme.展开更多
文摘The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized Carlson iterating function possesses more excellent properties such as self-similarity and exponential symmetry are also explained.K-index,P-index,O-index,and complexity index are introduced to contribute to performance analysis.Considering nine different operational orders and choosing an appropriate rational initial impedance for a certain operational order,these rational approximation impedance functions calculated by the iterating function meet computational rationality,positive reality,and operational validity.Then they are capable of having the operational performance of fractional operators and being physical realization.The approximation performance of the impedance function to the ideal fractional operator and the circuit network complexity are also exhibited.
基金The National Natural Science Foundation of China(No.90612014)IBM China Research Lab Joint Project
文摘Applying dynamic web services composition is one of the important schemas for solving service-oriented architecture （SOA）and service-oriented computing（SOC）.For implementing dynamic web services composition,the multi agent system （MAS）is applied to web services composition.First, the essentials of the MAS and web services composition are analyzed and their relationship is discussed.Secondly, an MAS-based architecture is designed for dynamic web services composition,and it is named as CSMWC.A Jade tool is used to implement the major components.The architecture can primarily implement syntactic level dynamic web services composition,and it gives a basis for semantic level dynamic web services composition.For specifying the correctness of the architecture,by using pi-calculus,the architecture of the MAS is formally described,and its dynamic properties and adaptability are reasoned.Finally,it demonstrates the idea proposed by the Pi4SOA tool.
文摘In this paper,we consider an inference problem for an Ornstein-Uhlenbeck process driven by a general one-dimensional centered Gaussian process(G_(t))t≥0.The second order mixed partial derivative of the covariance function R(t,s)=E[GtGs]can be decomposed into two parts,one of which coincides with that of fractional Brownian motion and the other of which is bounded by(ts)^(β-1)up to a constant factor.This condition is valid for a class of continuous Gaussian processes that fails to be self-similar or to have stationary increments;some examples of this include the subfractional Brownian motion and the bi-fractional Brownian motion.Under this assumption,we study the parameter estimation for a drift parameter in the Ornstein-Uhlenbeck process driven by the Gaussian noise(G_(t))t≥0.For the least squares estimator and the second moment estimator constructed from the continuous observations,we prove the strong consistency and the asympotic normality,and obtain the Berry-Esséen bounds.The proof is based on the inner product's representation of the Hilbert space(h)associated with the Gaussian noise(G_(t))t≥0,and the estimation of the inner product based on the results of the Hilbert space associated with the fractional Brownian motion.
文摘Two-thirds simulation provides a kind of abstract description of an implementation with respect to a specification. In order to characterize the approximate two-thirds simulation, we propose the definition of a two- thirds simulation index which expresses the degree to which a binary relation between processes is two-thirds simulation. 2-two-thirds simulation and its substitutivity laws are given in this paper. And, based on 2-two-thirds simulation, we present a measure model for describing the degree of approximation between processes. In particular, we give the modal logical characterization of 2-two-thirds simulation.
基金This work was funded in part by the National Key Research and Development Program of China(Grant No.2017YFE0132100)Tsinghua-Toyota Joint Research Institute Cross-discipline Program,and the BNRist Program(Grant No.BNR2020TD01009).
文摘This paper focuses on solving the modeling issues of monitoring system service performance based on the network calculus theory.First,we formulate the service model of the smart grid monitoring system.Then,we derive the flow arrival curve based on the incremental process related functions.Next,we develop flow arrival curves for the case of the incremental process being a fractional Gaussian process,and then we obtain the generalized Cauchy process.Three technical theorems related to network calculus are presented as our main results.Mathematically,the variance of arrival flow for the continuous time case is derived.Assuming that the incremental process of network flow is a Gaussian stationary process,and given the auto-correlation function of the incremental process with violation probability,the formula of the arrival curve is derived.In addition,the overall flow variance under the discrete time case is explicitly derived.The theoretical results are evaluated in smart grid applications.Simulations indicate that the generalized Cauchy process outperforms the fractional Gaussian process for our considered problem.
基金National High Technical Research and Development Program of China(863 program)under Grant No. 2007AA01Z471
文摘Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof framework with sequences of games.We make slight modifications to Blanchet's calculus to make it easy for parsing the initial game.The main contribution of this work is that it introduces algebraic properties with observational equivalences to automatic security proofs,and thus can deal with some practical cryptographic schemes with hard problems.We illustrate the use of algebraic properties in the framework by proving the semantic security of the ElGamal encryption scheme.
