The purpose of this paper is to introduce a new pivot rule of the simplex algorithm. The simplex algorithm first presented by George B. Dantzig, is a widely used method for solving a linear programming problem (LP). One of the important steps of the simplex algorithm is applying an appropriate pivot rule to select the basis-entering variable corresponding to the maximum reduced cost. Unfortunat...

We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead of the complete class association rule set we can avoid redundant computation that would otherwise be required for mining predictive association rules and hence improve the efficiency of the mining process significantly...

Using New Keynesian models, we compare Friedman’s k-percent money supply rule to optimal interest rate setting, with respect to determinacy, stability under learning and optimality. First we review the recent literature: open-loop interest rate rules are subject to indeterminacy and instability problems, but a properly chosen expectations-based rule yields determinacy and stability under learni...

in this paper, by using a model of the new keynesians, we investigated the role of the central bank's accountability to shocks that causes deviations in the performance of the monetary policymakers. for this purpose, we used quarterly data for 69: 1 to 93: 3, and estimated the basic equations of the new keynesians model. then, by calculating the optimal values for the central bank's a...

In this paper we study a sequential type-based detection scheme with the suboptimal detection rule for wireless sensor networks. First, we propose the approximation of the optimal detection rule and derive the suboptimal detection rule. Then we compare the performances of the optimal and the suboptimal detection rules and show that the approximated detection rule provides the similar results as...

This article studies an optimal stopping problem with an endogenous constraint on the set of admissible stopping times. The constraint stipulates that continuation is permitted, at any given date t, only if the endogenous reward achieved exceeds a prespecified threshold. Characterizations of the value function and the optimal stopping time are presented. An application to the pricing of corpora...

In the house-hunting problem, i.i.d. random variables, X1,X2, . . . are observed sequentially at a cost of c > 0 per observation. The problem is to choose a stopping rule, N , to maximize E(XN − Nc). If the X’s have a finite second moment, the optimal stopping rule is N∗ = min{n ≥ 1 : Xn > V ∗}, where V ∗ satisfies E(X − V ∗)+ = c. The statement of the problem and its solution requires only the...

Experimental economics represents a strong growth industry. In the past several decades the method has expanded beyond intellectual curiosity, now meriting consideration alongside the other more traditional empirical approaches used in economics. Accompanying this growth is an influx of new experimenters who are in need of straightforward direction to make their designs more powerful. This stud...

'Rules-of-thumb', some of which were originally intended for arc furnaces, play a significant role in the design process for slag containing furnaces. Lack of fundamental understanding of the physics driving the performance of these furnaces sometimes results in either overly conservative, or poorly performing designs. This paper will explore some key technical issues related to the correct des...

We present a method for determining the globally optimal on-line learning rule for a soft committee machine under a statistical mechanics framework. This work complements previous results on locally optimal rules, where only the rate of change in generalization error was considered. We maximize the total reduction in generalization error over the whole learning process and show how the resultin...