This paper investigates the issue of an economic manufacturing quantity model for defective products involving imperfect production processes and rework. We consider that the demand is sensitive to promotional efforts/sales teams’ initiatives as well as the setup cost can be reduced through further investment. It also assumes that fixed quantity multiple installments of the finished batch are d...

Tolerance to effects of cocaine can be modulated by schedules of reinforcement. With multiple ratio schedules, research has shown an inverse relationship between ratio requirement and amount of tolerance that resulted from daily administration of the drug. In contrast, tolerance to the effects of cocaine on behavior under multiple interval schedules generally has developed regardless of interva...

This paper considers estimation of a fixed-effects model with an interval-censored dependent variable. In each time period, the researcher observes the interval (with known endpoints) in which the dependent variable lies but not the value of the dependent variable itself. Two versions of the model are considered, a parametric model with logistic errors and a semiparametric model with errors hav...

This paper newly proposes the recursive least-squares (RLS) fixed-interval smoother and filter, based on the innovation theory, in linear continuous-time stochastic systems. It is assumed that the signal is observed with additive white noise and the signal process is uncorrelated with the observation noise. It is a characteristic that the estimators use the covariance function of the signal, in...

We present an algorithm with runtime O(knm) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem ha...

Given a graph G and integers k1, k2, and k3, the unit interval editing problem asks whether G can be transformed into a unit interval graph by at most k1 vertex deletions, k2 edge deletions, and k3 edge additions. We give an algorithm solving this problem in time 2 logk) · (n+m), where k := k1 +k2 +k3, and n,m denote respectively the numbers of vertices and edges of G. Therefore, it is fixed-pa...