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...

The satellite scheduling community has provided several algorithms for allocating interaction windows between ground stations and satellites, from simple greedy approaches to more complex hybrid-genetic or Lagrangian-relaxation techniques. Single-location ground station problems, where requests have fixed time intervals and no priorities, are known to be solvable in polynomial time. To the best...

In this paper, using α—admissibility and the concept of simulation functions, some near-fixed point results in setting metric interval normed spaces are established. The have been proved Z-contractions.

Abstract : Let be a 2nd order ODE. By Cartan equivalence method, we will study the local equivalence problem under the transformations group of time-fixed coordinates. We are going to solve this problem by an applicable method which has been recognized by R. Gardner, and classify them.   

In real-time (RT) computing systems, a service function execution including an output action is typically subject to a deadline. Scheduling algorithms play a significant role in the design of such systems. They are the major factor in determining the execution safety, i.e., the possibility of always executing control service functions without missing deadlines in a given execution engine posses...