Interval Oscillation for Second Order Nonlinear Differential Equations with a Damping Term

2000 Mathematics Subject Classification: 34C10, 34C15.

Interval Prediction Based on Experts’ Statements

In the work [1] we proposed an approach of forming a consensus of experts’ statements in pattern recognition. In this paper, we present a method of aggregating sets of individual statements into a collective one for the case of forecasting of quantitative variable.

Computing and Visualizing Solution Sets of Interval Linear Systems

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

The Interval [0,1] Admits no Functorial Embedding into a Finite-Dimensional or Metrizable Topological Group

An embedding X ⊂ G of a topological space X into a topological group G is called functorial if every homeomorphism of X extends to a continuous group homomorphism of G. It is shown that the interval [0, 1] admits no functorial embedding into a finite-dimensional or metrizable topological group.

Oscillation Theorems for Perturbed Second Order Nonlinear Differential Equations with Damping

Some oscillation criteria for solutions of a general perturbed second order ordinary differential equation with damping (r(t)x′ (t))′ + h(t)f (x)x′ (t) + ψ(t, x) = H(t, x(t), x′ (t)) with alternating coefficients are given. The results obtained improve and extend some existing results in the literature.

Oscillation Theorems for Second Order Sublinear Ordinary Differential Equations

Oscillation criteria are given for the second order sublinear non-autonomous differential equation. (r(t) (x)x′(t))′ + q(t)g(x(t)) = (t). These criteria extends and improves earlier oscillation criteria of Kamenev, Kura, Philos and Wong. Oscillation criteria are also given for second order sublinear damped non-autonomous differential equations.

Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times

Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.

Managing Interval Resources in Automated Planning

In this paper RDPPLan, a model for planning with quantitative resources specified as numerical intervals, is presented. Nearly all existing models of planning with resources require to specify exact values for updating resources modified by actions execution. In other words these models cannot deal with more realistic situations in which the resources quantities are not completely known but are bounded by intervals. The RDPPlan model allow to manage domains more tailored to real world, where preconditions and effects over quantitative resources can be specified by intervals of values, in addition mixed logical/quantitative and pure numerical goals can be posed. RDPPlan is based on non directional search over a planning graph, like DPPlan, from which it derives, it uses propagation rules which have been appropriately extended to the management of resource intervals. The propagation rules extended with resources must verify invariant properties over the planning graph which have been proven by the authors and guarantee the correctness of the approach. An implementation of the RDPPlan model is described with search strategies specifically developed for interval resources.

A Mathematical Basis for an Interval Arithmetic Standard

Basic concepts for an interval arithmetic standard are discussed in the paper. Interval arithmetic deals with closed and connected sets of real numbers. Unlike floating-point arithmetic it is free of exceptions. A complete set of formulas to approximate real interval arithmetic on the computer is displayed in section 3 of the paper. The essential comparison relations and lattice operations are discussed in section 6. Evaluation of functions for interval arguments is studied in section 7. The desirability of variable length interval arithmetic is also discussed in the paper. The requirement to adapt the digital computer to the needs of interval arithmetic is as old as interval arithmetic. An obvious, simple possible solution is shown in section 8.

Conditional Confidence Interval for the Scale Parameter of a Weibull Distribution

2000 Mathematics Subject Classification: 62F25, 62F03.

Oscillation Criteria for First Order Delay Differential Equations

2000 Mathematics Subject Classification: 34K15.

Oscillation Properties of Some Functional Fourth Order Ordinary Differential Equations

2010 Mathematics Subject Classification: 34A30, 34A40, 34C10.

Some Coefficient Estimates for Polynomials on the Unit Interval

2000 Mathematics Subject Classification: 26C05, 26C10, 30A12, 30D15, 42A05, 42C05.

Oscillation Criteria for Nonlinear Differential Equations of Second Order with Damping Term

2000 Mathematics Subject Classification: 34C10, 34C15.

Oscillation of Nonlinear Neutral Delay Differential Equations

2000 Mathematics Subject Classification: 34K15, 34C10.