Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As consequence, some generalizations of have been proposed, in general expressed terms $k$ graphs, by splitting the special way. recent example such an approach, classes $k$-thin introduced generalizing respectively. The complexity recognition each these still open, even fixed $k \geq 2$...

Stochastic approximation methodology is applied to the problem of estimating an optimal block replacement policy. Several improvements to minimize the asymptotic mean square error of the estimator are considered. A stopping time is then defined with the objective of a fixed-width confidence interval for the optimal policy. A nonparametric estimator is used for sequential estimation of the renew...

Two new methods of the fourth order for the simultaneous determination of multiple zeros of a polynomial are proposed. The presented methods are based on the fixed point relation of Laguerre's type and realized in ordinary complex arithmetic as well as circular complex interval arithmetic. The derived iterative formulas are suitable for the construction of modified methods with improved converg...

Let a be the topological graph shaped like the letter o . We denote by 0 the unique branching point of a , and by O and I the closures of the components of a \ {0} homeomorphics to the circle and the interval, respectively. A continuous map from a into itself satisfying that / has a fixed point in O, or / has a fixed point and /(0) € I is called a a map. These are the continuous self-maps of a ...

This study presents a dynamic model of how animals learn to regulate their behavior under time-based reinforcement schedules. The model assumes a serial activation of behavioral states during the interreinforcement interval, an associative process linking the states with the operant response, and a rule mapping the activation of the states and their associative strength onto response rate or pr...

This paper presents a general model to study the medium access control (MAC) layer performance and equilibrium of WLANs consisting of nodes with different MAC parameters (e.g., backoff window size). Our model can be used in general 802.11-based WLANs since it captures the important factors such as non-uniform backoff behavior, channel errors and unsaturated traffic. We first formalize the perfo...

We define strong regularity of a parametric interval matrix and give conditions that characterize it. The new conditions give a better estimation for regularity of a parametric matrix than the conditions used so far. Verifiable sufficient regularity conditions are also presented for parametric matrices. The new sufficient conditions motivate a generalization of Rump’s parametric fixed-point ite...

We consider a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k vertices of V (G), a k-fixed-endpoint path cover of G with respect to T is a set of vertex-disjoint paths P that covers the vertices of G such that the k vertices of T are all endpoints of the paths in P . The kPC problem is ...

Clustering is a powerful tool for data classification; however, its application has been limited to analysis of static snapshots of data which may be time-evolving. This work presents a clustering algorithm that employs a fixed time interval and a time-aggregated similarity measure to determine classification. The fixed time interval and a weighting parameter are tuned to the system’s dynamics;...