Modern quantitative finance and portfolio-based investment hinge on the dependence structure among financial instruments (like stocks) for return prediction, risk management, and hedging. Several attempts have been ma...
详细信息
Recent advances in various fields such as telecommunications, biomedicine and economics, among others, have created enormous amount of data that are often characterized by their huge size and high dimensionality. It h...
详细信息
Recent advances in various fields such as telecommunications, biomedicine and economics, among others, have created enormous amount of data that are often characterized by their huge size and high dimensionality. It has become evident, from research in the past couple of decades, that sparsity is a flexible and powerful notion when dealing with these data, both from empirical and theoretical viewpoints. In this survey, we review some of the most popular techniques to exploit sparsity, for analyzing high-dimensional vectors, matrices and higher-order tensors.
This paper proposes a protocol for multi-party quantum secret sharing utilizing four non-orthogonal two-particle entangled states following some ideas in the schemes proposed by Liu et al. (2006 Chin. Phys. Lett. 23 ...
详细信息
This paper proposes a protocol for multi-party quantum secret sharing utilizing four non-orthogonal two-particle entangled states following some ideas in the schemes proposed by Liu et al. (2006 Chin. Phys. Lett. 23 3148) and Zhang et al. (2009 Chin. Phys. B 18 2149) respectively. The theoretical efficiency for qubits of the new protocol is improved from 50% to approaching 100%. All the entangled states can be used for generating the private key except those used for the eavesdropping check. The validity of a probable attack called opaque cheat attack to this kind of protocols is considered in the paper for the first time.
This paper proposes a novel approach for the modeling of semantic correlation between web images and texts. Our approach contains two processes of semantic correlation computing. One is to find the local media objects...
详细信息
Instead of developing single-server software system for the powerful computers, the software is turning from large single-server to multi-server system such as distributed system. This change introduces a new challeng...
详细信息
Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and Page ...
详细信息
ISBN:
(纸本)9781467374439
Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and Page Rank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, too many replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition framework for random walks implemented by parallel computing in big graph. The framework is based on two optimization functions to reduce the bandwidth, memory and storage cost in the condition that the load balance is guaranteed. In this framework, several greedy graph partition algorithms are proposed. We also use five metrics from different perspectives to evaluate the performance of these algorithms. By running the algorithms on the big graph data set of real world, the experimental results show that these algorithms in the framework are capable of solving the problem of graph partition for random walks for different needs, e.g. the best result is improved more than 70 times in reducing the times of communication.
Numerous devices in smart grids are deployed at millions of buildings and streets, connected with wireless network and applied the uniform public protocols and standards. It indicates high-risk threats on the privacy ...
详细信息
With more wind power permeating into the power grid, one of the issues caused by its random output is the fluctuation of locational marginal price(LMP) which is also affected by the fluctuation of system load. However...
详细信息
ISBN:
(纸本)9781509009107
With more wind power permeating into the power grid, one of the issues caused by its random output is the fluctuation of locational marginal price(LMP) which is also affected by the fluctuation of system load. However, the fluctuation of electricity price will affect many aspects of the national economy. In order to cope with this issue, a demand response(DR) allocation mechanism is presented in this paper to hedge the LMP variability which is equal to keep the optimal basis invariant. Whether DR is available to keep the optimal basis optimal when wind power and load fluctuate within certain ranges is estimated from the perspective of sensitivity analysis of linear programming. Finally, the scheme is applied to test case IEEE 31 bus system and its feasibility is proved by the simulation results.
The complexity and uncertainty in power systems cause great challenges to controlling power *** a popular data-driven technique,deep reinforcement learning(DRL)attracts attention in the control of power ***,DRL has so...
详细信息
The complexity and uncertainty in power systems cause great challenges to controlling power *** a popular data-driven technique,deep reinforcement learning(DRL)attracts attention in the control of power ***,DRL has some inherent drawbacks in terms of data efficiency and *** paper presents a novel hierarchical task planning(HTP)approach,bridging planning and DRL,to the task of power line flow ***,we introduce a threelevel task hierarchy to model the task and model the sequence of task units on each level as a task planning-Markov decision processes(TP-MDPs).Second,we model the task as a sequential decision-making problem and introduce a higher planner and a lower planner in HTP to handle different levels of task *** addition,we introduce a two-layer knowledge graph that can update dynamically during the planning procedure to assist *** results conducted on the IEEE 118-bus and IEEE 300-bus systems demonstrate our HTP approach outperforms proximal policy optimization,a state-of-the-art deep reinforcement learning(DRL)approach,improving efficiency by 26.16%and 6.86%on both systems.
Range estimation with multifrequency phases is a common practice in localization *** challenge of this method is the phase *** Chinese remainder theorem(CRT)based phase unwrapping algorithms have been proposed to solv...
详细信息
Range estimation with multifrequency phases is a common practice in localization *** challenge of this method is the phase *** Chinese remainder theorem(CRT)based phase unwrapping algorithms have been proposed to solve the problem,where the wavelengths of the multifrequency signals need to be pair-wisely co-prime after they are divided by their greatest common divisor(gcd).This condition may limit the application in *** this paper,a novel way based on a dual-band robust CRT is presented to reconstruct the distance from dual-band wrapped phases,where the pair-wisely co-prime condition is not necessarily *** more wrapped phases are involved to reconstruct the distance,the method can significantly enlarge the reconstruction range compared to the single band solution.
暂无评论