On the basis of recent binary signal detection theory (BSDT), optimal recognition algorithms for complex images are constructed and their optimal performance are calculated. A methodology for comparing BSDT prediction...
详细信息
On the basis of recent binary signal detection theory (BSDT), optimal recognition algorithms for complex images are constructed and their optimal performance are calculated. A methodology for comparing BSDT predictions and measured human performance is developed and applied to explaining particular face recognition experiment. The BSDT makes possible computer codes with recognition performance better than that in humans, its fundamental discreteness is consistent with the experiment. Related neurobiological and behavioral effects are briefly discussed.
The paper gives a general framework which allows to study various hierarchical structures of an organisation. It provides a unified view on hierarchical algorithms, hierarchical planning, principal-agent relationships...
详细信息
The paper gives a general framework which allows to study various hierarchical structures of an organisation. It provides a unified view on hierarchical algorithms, hierarchical planning, principal-agent relationships, and hierarchical negotiations. The main idea is to describe an organisation as a superposition of interfering individual decision processes resulting in a pair of functional equations. Different specifications of these equations allow to characterize the above mentioned hierarchical phenomena. Since management can be considered as a planning and leadership activity to control the interrelationship of individual decision processes, the paper gives a contribution to a better understanding of the general structure of the management process.
In this note, a stochastic production model containing processes with different time scales is developed. It is shown that if the time scales of the processes are very different, some hierarchical algorithms that are ...
详细信息
In this note, a stochastic production model containing processes with different time scales is developed. It is shown that if the time scales of the processes are very different, some hierarchical algorithms that are much more efficient than the standard policy iteration method can be developed to find the optimal production control. Moreover, if the time scales fall far apart, the optimal control of a deterministic limiting problem depending only on the mean characteristics of the processes can be used to approximate the optimal control of the original problem. The Limiting problem has much lower dimension than its original counterpart and thus is much easier to solve. A numerical example is used to illustrate the potential of the proposed approach.
hierarchical algorithms for the dynamic optimization of non-linear systems with control bound inequality, constraints are considered. Three different computational schemes are developed, based on the costate predictio...
详细信息
hierarchical algorithms for the dynamic optimization of non-linear systems with control bound inequality, constraints are considered. Three different computational schemes are developed, based on the costate prediction co-ordination. Each scheme consists of four levels; of which the second level manipulates the control constraints in an explicit way. Digital simulation of the developed algorithms on a typical power control system is presented.
Computer vision algorithms are notorious for their computational expense. Distributed vision, the use of more than one processor, can decrease computation costs and speed up algorithms. There are various ways to do th...
详细信息
Computer vision algorithms are notorious for their computational expense. Distributed vision, the use of more than one processor, can decrease computation costs and speed up algorithms. There are various ways to do this, ranging from parallelism at the sensor level to true multiprocessor systems. This correspondence first describes a system of the latter type: a system of microprocessors on a high-speed bus. A canonical vision task, locating a number of objects and measuring certain two-dimensional features of those objects, serves as a benchmark test for the system. An algorithm for this task is presented. Performance measures are compared from implementations on the distributed system, a Vax 11/750, and a Vax 11/780. Results indicate that three microprocessors outperform a Vax 11/780 at this task. Finally, other more interesting distributed algorithms are briefly discussed.
暂无评论