activity vector
Recently Published Documents


TOTAL DOCUMENTS

37
(FIVE YEARS 1)

H-INDEX

6
(FIVE YEARS 0)

PLoS ONE ◽  
2017 ◽  
Vol 12 (3) ◽  
pp. e0173105 ◽  
Author(s):  
Cheryl S. Toi ◽  
Cameron E. Webb ◽  
John Haniotis ◽  
John Clancy ◽  
Stephen L. Doggett

Author(s):  
Yves Balasko

This chapter examines the net supply correspondence of a constant returns to scale firms under suitable convexity and smoothness assumptions. These assumptions are comparable to those used in the previous chapters for consumers and production with decreasing returns to scale. The chapter starts by formulating constant returns to scale production by way of production sets with arbitrary numbers of inputs and outputs. It then addresses the profit maximization problem of a constant returns to scale firm. That problem does not always have a solution. More accurately, if some feasible activity yields a strictly positive profit at some given prices, then it suffices to consider an arbitrarily large multiple of that activity vector to get a feasible activity that yields an arbitrarily large profit at the same prices. The firm can then make an arbitrarily large profit.


2007 ◽  
Vol 72 (619) ◽  
pp. 55-60
Author(s):  
Yasuaki ONODA ◽  
Kohji NISHIDA ◽  
Nozomu ONODERA ◽  
Shigeyuki UJIHARA

1993 ◽  
Vol 72 (1) ◽  
pp. 66-66 ◽  
Author(s):  
Peter F. Merenda

Preliminary analysis of Goldberg's clustered adjectives and data from Activity Vector Analysis suggest five factors but some differences.


1988 ◽  
Vol 20 (4) ◽  
pp. 695-705 ◽  
Author(s):  
William G. Faris ◽  
Robert S. Maier

A learning matrix is defined by a set of input and output pattern vectors. The entries in these vectors are zeros and ones. The matrix is the maximum of the outer products of the input and output pattern vectors. The entries in the matrix are also zeros and ones. The product of this matrix with a selected input pattern vector defines an activity vector. It is shown that when the patterns are taken to be random, then there are central limit and large deviation theorems for the activity vector. They give conditions for when the activity vector may be used to reconstruct the output pattern vector corresponding to the selected input pattern vector.


1988 ◽  
Vol 20 (04) ◽  
pp. 695-705 ◽  
Author(s):  
William G. Faris ◽  
Robert S. Maier

A learning matrix is defined by a set of input and output pattern vectors. The entries in these vectors are zeros and ones. The matrix is the maximum of the outer products of the input and output pattern vectors. The entries in the matrix are also zeros and ones. The product of this matrix with a selected input pattern vector defines an activity vector. It is shown that when the patterns are taken to be random, then there are central limit and large deviation theorems for the activity vector. They give conditions for when the activity vector may be used to reconstruct the output pattern vector corresponding to the selected input pattern vector.


Sign in / Sign up

Export Citation Format

Share Document