In this paper, we use an input oriented chance-constrained DEA model withrandom inputs and outputs. A super-eciency model with chance constraintsis used for ranking. However, for convenience in calculations a non-linear deterministicequivalent model is obtained to solve the models. The non-linearmodel is converted into a model with quadratic constraints to solve the nonlineardeterministic model...

In this paper, the homotopy analysis method (HAM) is considered to obtain the solution of the Schrodinger equation with a power law nonlinearity. For this purpose, a theorem is proved to show the convergence of the series solution obtained from the proposed method. Also, an example is solved to illustrate the eciency of the mentioned algorithm and the h-curve is plotted to determine the region ...

In this article, we propose and analyze a computational method for numerical solution of general two point boundary value problems. Method is tested on problems to ensure the computational eciency. We have compared numerical results with results obtained by other method in literature. We conclude that propose method is computationally ecient and eective.

In this paper, seventh-order iterative methods for the solution ofnonlinear equations are presented. The new iterative methods are developed byusing weight function method and using an approximation for the last derivative,which reduces the required number of functional evaluations per step. Severalexamples are given to illustrate the eciency and the performance of the newiterative methods.

STRAND execution model may be extended with a set of Linda-like operations and a concept of tuple space. The STRAND tuple space is orthogonal to STRAND process pool. Processes may access STS objects without setting up a shared data structure connection rst. Connection is established only for the time of the call duration. There is a wide class of problems that could be programmed more easily an...

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

This paper presents a method for revising an approximate domain theory based on noisy data. The basic idea is to avoid making changes to the theory that account for only a small amount of data. This method is implemented in the EITHER propositional Horn-clause theory revision system. The paper presents empirical results on articially corrupted data to show that this method successfully prevents...

Debugging inconsistent OWL ontologies is a tedious and time-consuming task where a combination of ontology engineers and domain experts is often required to understand whether the changes to be performed are actually dealing with formalisation errors or changing the intended meaning of the original knowledge model. Debugging services from existing ontology engineering tools and debugging strate...

In this work, we focus on modular logic languages where module composition is performed through union of clauses and where the set of denitions to be used in order to evaluate a goal can be extended during the computation through implication goals. In order to improve the implementation of these languages, we consider the application of static analysis techniques. In particular, we apply abstra...

a class of new methods based on a septic non-polynomial spline function for the numerical solution of problems in calculus of variations is presented. the local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. the inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. convergence anal...