An efficient algorithm for deciding whether a given integer vector is the spectrum of some Boolean function is presented. The algorithm performs a step-by-step spectral decomposition of the input vector and checks at ...An efficient algorithm for deciding whether a given integer vector is the spectrum of some Boolean function is presented. The algorithm performs a step-by-step spectral decomposition of the input vector and checks at each step a set of necessary conditions for spectrality for the resulting vectors. The algorithm concludes that the input vector cannot lead to a valid Boolean function as soon as a vector not satisfying the conditions is found, which, as proved in the paper, for almost all cases happens after the first step of the decomposition.展开更多
Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the propo...Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the proposed scheme is not loosely related to thediscrete logarithm assumption hut tightly related to the decisional Diffie-Hellman assumption in therandom oracle model.展开更多
Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to...Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to schedule their loads. In this paper, load scheduling problem is formulated as a LCP （load commitment problem）. The load model is general and can model atomic and non-atomic loads. Furthermore, it can also take into consideration the relative discomfort caused by delay in scheduling any load. For this purpose, a single parameter ＂uric＂ is introduced in the load model which captures the relative discomfort caused by delay in scheduling a particular load. Guidelines for choosing this parameter are given. All the other parameters of the proposed load model can be easily specified by the consumer. The paper shows that the general LCP can be viewed as multi-stage decision making problem or a MDP （Markov decision problem）. RL （reinforcement learning） based algorithm is developed to solve this problem. The efficacy of the algorithm is investigated when the price of electricity is available in advance as well as for the case when it is random. The scalability of the approach is also investigated.展开更多
A method is proposed to deal with the uncertain multiple attribute group decision making problems,where 2-dimension uncertain linguistic variables(2DULVs)are used as the reliable way for the experts to express their f...A method is proposed to deal with the uncertain multiple attribute group decision making problems,where 2-dimension uncertain linguistic variables(2DULVs)are used as the reliable way for the experts to express their fuzzy subjective evaluation information.Firstly,in order to measure the 2DULVs more accurately,a new method is proposed to compare two 2DULVs,called a score function,while a new function is defined to measure the distance between two 2DULVs.Secondly,two optimization models are established to determine the weight of experts and attributes based on the new distance formula and a weighted average operator is used to determine the comprehensive evaluation value of each alternative.Then,a score function is used to determine the ranking of the alternatives.Finally,the effectiveness of the proposed method is proved by an illustrated example.展开更多
In this paper we study the decision problem of the center or focus for a class of planar polynomial fields which can be changed into Abel equation. Taking a Poincaré return map h(x) , we can calculate any orde...In this paper we study the decision problem of the center or focus for a class of planar polynomial fields which can be changed into Abel equation. Taking a Poincaré return map h(x) , we can calculate any order derivative of h(x) at x=0 and obtain the focus value of each order. The new method in this paper avoids the recurence operation and reduces the work in calculating the focus value.展开更多
Analysis on the taxonomy of decision problems is made and some fundamental views on decision problems are stated in this paper. Based upon understanding of decision problem and its structure in depth, a measure of the...Analysis on the taxonomy of decision problems is made and some fundamental views on decision problems are stated in this paper. Based upon understanding of decision problem and its structure in depth, a measure of the structured degree for decision problems is obtained by constructing a monotonic mapping. The corresponding relation between the measure value and division of the structured degree for decision problems is given in quantity and theories of decision support are enlarged.展开更多
文摘An efficient algorithm for deciding whether a given integer vector is the spectrum of some Boolean function is presented. The algorithm performs a step-by-step spectral decomposition of the input vector and checks at each step a set of necessary conditions for spectrality for the resulting vectors. The algorithm concludes that the input vector cannot lead to a valid Boolean function as soon as a vector not satisfying the conditions is found, which, as proved in the paper, for almost all cases happens after the first step of the decomposition.
文摘Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the proposed scheme is not loosely related to thediscrete logarithm assumption hut tightly related to the decisional Diffie-Hellman assumption in therandom oracle model.
文摘Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to schedule their loads. In this paper, load scheduling problem is formulated as a LCP （load commitment problem）. The load model is general and can model atomic and non-atomic loads. Furthermore, it can also take into consideration the relative discomfort caused by delay in scheduling any load. For this purpose, a single parameter ＂uric＂ is introduced in the load model which captures the relative discomfort caused by delay in scheduling a particular load. Guidelines for choosing this parameter are given. All the other parameters of the proposed load model can be easily specified by the consumer. The paper shows that the general LCP can be viewed as multi-stage decision making problem or a MDP （Markov decision problem）. RL （reinforcement learning） based algorithm is developed to solve this problem. The efficacy of the algorithm is investigated when the price of electricity is available in advance as well as for the case when it is random. The scalability of the approach is also investigated.
基金This work was supported by the Natural Science Foundation of Liaoning Province(2013020022).
文摘A method is proposed to deal with the uncertain multiple attribute group decision making problems,where 2-dimension uncertain linguistic variables(2DULVs)are used as the reliable way for the experts to express their fuzzy subjective evaluation information.Firstly,in order to measure the 2DULVs more accurately,a new method is proposed to compare two 2DULVs,called a score function,while a new function is defined to measure the distance between two 2DULVs.Secondly,two optimization models are established to determine the weight of experts and attributes based on the new distance formula and a weighted average operator is used to determine the comprehensive evaluation value of each alternative.Then,a score function is used to determine the ranking of the alternatives.Finally,the effectiveness of the proposed method is proved by an illustrated example.
文摘In this paper we study the decision problem of the center or focus for a class of planar polynomial fields which can be changed into Abel equation. Taking a Poincaré return map h(x) , we can calculate any order derivative of h(x) at x=0 and obtain the focus value of each order. The new method in this paper avoids the recurence operation and reduces the work in calculating the focus value.
文摘Analysis on the taxonomy of decision problems is made and some fundamental views on decision problems are stated in this paper. Based upon understanding of decision problem and its structure in depth, a measure of the structured degree for decision problems is obtained by constructing a monotonic mapping. The corresponding relation between the measure value and division of the structured degree for decision problems is given in quantity and theories of decision support are enlarged.
