15,234 research outputs found
A Cyclic Douglas-Rachford Iteration Scheme
In this paper we present two Douglas-Rachford inspired iteration schemes
which can be applied directly to N-set convex feasibility problems in Hilbert
space. Our main results are weak convergence of the methods to a point whose
nearest point projections onto each of the N sets coincide. For affine
subspaces, convergence is in norm. Initial results from numerical experiments,
comparing our methods to the classical (product-space) Douglas-Rachford scheme,
are promising.Comment: 22 pages, 7 figures, 4 table
The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
We analyse the behaviour of the newly introduced cyclic Douglas-Rachford
algorithm for finding a point in the intersection of a finite number of closed
convex sets. This work considers the case in which the target intersection set
is possibly empty.Comment: 13 pages, 2 figures; references updated, figure 2 correcte
Representation of perfectly reconstructed octave decomposition filter banks with set of decimators {2,4,4} via tree structure
In this letter, we prove that a filter bank with set of decimators {2,4,4} achieves perfect reconstruction if and only if it can be represented via a tree structure and each branch of the tree structure achieves perfect reconstruction
Recommended from our members
Smart Computer Security Audit: Reinforcement Learning with a Deep Neural Network Approximator
A significant challenge in modern computer security is the growing skill gap as intruder capabilities increase, making it necessary to begin automating elements of penetration testing so analysts can contend with the growing number of cyber threats. In this paper, we attempt to assist human analysts by automating a single host penetration attack. To do so, a smart agent performs different attack sequences to find vulnerabilities in a target system. As it does so, it accumulates knowledge, learns new attack sequences and improves its own internal penetration testing logic. As a result, this agent (AgentPen for simplicity) is able to successfully penetrate hosts it has never interacted with before. A computer security administrator using this tool would receive a comprehensive, automated sequence of actions leading to a security breach, highlighting potential vulnerabilities, and reducing the amount of menial tasks a typical penetration tester would need to execute. To achieve autonomy, we apply an unsupervised machine learning algorithm, Q-learning, with an approximator that incorporates a deep neural network architecture. The security audit itself is modelled as a Markov Decision Process in order to test a number of decisionmaking strategies and compare their convergence to optimality. A series of experimental results is presented to show how this approach can be effectively used to automate penetration testing using a scalable, i.e. not exhaustive, and adaptive approach
The probability density function of a hardware performance parameter
Probability density function of hardware performance parameter and incentive contractin
- …