Results 1  10
of
350
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
with ambiguities regarding the processes by which individuals adapt to changing levels in stimulation. Individuals' levels of activation decrease markedly as a function of familiarity with a given stimulus situation. However, after a period of rest, representation of the same stimulus situation will once
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
, 2003
"... Convex programming involves a convex set F R and a convex function c : F ! R. The goal of convex programming is to nd a point in F which minimizes c. In this paper, we introduce online convex programming. In online convex programming, the convex set is known in advance, but in each step of some ..."
Abstract

Cited by 298 (4 self)
 Add to MetaCart
of some repeated optimization problem, one must select a point in F before seeing the cost function for that step. This can be used to model factory production, farm production, and many other industrial optimization problems where one is unaware of the value of the items produced until they have already
A Unified Framework for Hybrid Control: Model and Optimal Control Theory
 IEEE TRANSACTIONS ON AUTOMATIC CONTROL
, 1998
"... Complex natural and engineered systems typically possess a hierarchical structure, characterized by continuousvariable dynamics at the lowest level and logical decisionmaking at the highest. Virtually all control systems todayfrom flight control to the factory floorperform computercoded chec ..."
Abstract

Cited by 305 (9 self)
 Add to MetaCart
for synthesizing hybrid controllers for hybrid plants in an optimal control framework. In particular, we demonstrate the existence of optimal (relaxed) and nearoptimal (precise) controls and derive "generalized quasivariational inequalities" that the associated value function satisfies. We summarize
Non Linear Neurons in the Low Noise Limit: A Factorial Code Maximizes Information Transfer
, 1994
"... We investigate the consequences of maximizing information transfer in a simple neural network (one input layer, one output layer), focussing on the case of non linear transfer functions. We assume that both receptive fields (synaptic efficacies) and transfer functions can be adapted to the environm ..."
Abstract

Cited by 162 (18 self)
 Add to MetaCart
to the environment. The main result is that, for bounded and invertible transfer functions, in the case of a vanishing additive output noise, and no input noise, maximization of information (Linsker'sinfomax principle) leads to a factorial code  hence to the same solution as required by the redundancy
Generalized factorial functions and binomial coefficients
, 2001
"... Let S ⊆ Z. The generalized factorial function for S, denoted n!S, is introduced in accordance with theory already established by Bhargava ([4]). Along with several known theorems about these functions, a number of other issues will be explored. This Thesis is divided into 4 chapters. Chapter 1 provi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Let S ⊆ Z. The generalized factorial function for S, denoted n!S, is introduced in accordance with theory already established by Bhargava ([4]). Along with several known theorems about these functions, a number of other issues will be explored. This Thesis is divided into 4 chapters. Chapter 1
Products of factorial Schur functions
"... The product of any finite number of factorial Schur functions can be expanded as a Z[y]linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the MolevSagan rule, which in turn generalizes the classical Littl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The product of any finite number of factorial Schur functions can be expanded as a Z[y]linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the MolevSagan rule, which in turn generalizes the classical
ABSTRACT FACTORIAL FUNCTIONS AND THEIR APPLICATIONS
, 2007
"... We define the notion of an abstract factorial function on the set of natural numbers and show that, given any subset of Z, we can associate to it another set with which, if nontrivial, we can define one or more (generally independent) abstract factorial functions. These associated sets are studie ..."
Abstract
 Add to MetaCart
We define the notion of an abstract factorial function on the set of natural numbers and show that, given any subset of Z, we can associate to it another set with which, if nontrivial, we can define one or more (generally independent) abstract factorial functions. These associated sets
A LittlewoodRichardson Rule for factorial Schur functions
, 1997
"... We give a combinatorial rule for calculating the coefficients in the expansion of a product of two factorial Schur functions. It is a special case of a more general rule which also gives the coefficients in the expansion of a skew factorial Schur function. Applications to Capelli operators and quant ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
We give a combinatorial rule for calculating the coefficients in the expansion of a product of two factorial Schur functions. It is a special case of a more general rule which also gives the coefficients in the expansion of a skew factorial Schur function. Applications to Capelli operators
Generalized jFactorial Functions, Polynomials, and Applications
"... The paper generalizes the traditional single factorial function to integervalued multiple factorial (jfactorial) forms. The generalized factorial functions are defined recursively as triangles of coefficients corresponding to the polynomial expansions of a subset of degenerate falling factorial fu ..."
Abstract
 Add to MetaCart
The paper generalizes the traditional single factorial function to integervalued multiple factorial (jfactorial) forms. The generalized factorial functions are defined recursively as triangles of coefficients corresponding to the polynomial expansions of a subset of degenerate falling factorial
Results 1  10
of
350