In this paper, we study general linear programs in which right handsides are interval numbers. This model is relevant when uncertain and inaccurate factors make di–cult the assignment of a single value to each right handside. When objective function coe–cients are interval numbers in a linear program, it is used to determine optimal solutions according to classical criteria coming from decision...

the present paper is about an inscription from the parthian era which has been found in the town of sar-e pol-e zohab in the province of kirmanshah. this parthian bas-relief is about two people on the two sides of the bas-relief inscription. the investigation on the right-handside, due to erosion is not quite readable, but the left-handside inscription had been formerly read and believed to be ...

The various robust linear programming models investigated so far in the literature essentially appear to be based either on what is referred to as ’rowwise’ uncertainty models or on ’columnwise’ uncertainty models (these basically assume that the rows resp: the columns of the constraint matrix are subject to changes within a well specified uncertainty set). In this paper, we discuss a special c...

sourcerer is a search engine for open source code that extracts fine-grained structural information from the code. This information is used both to implement a basic notion of code rank and to enable search forms that go beyond conventional keyword-based searches. sourcerer supports two types of searches: (1) implementations, and their use; and (2) program structures. Several schemes were compa...

We present variants of the block-GMRES(m) algorithms due to Vital and the block-LGMRES(m,k) by Baker, Dennis and Jessup, obtained with replacing the standard QR factorization by a rank-revealing QR factorization in the Arnoldi process. The resulting algorithm allows for dynamic block deflation whenever there is a linear dependency between the Krylov vectors or the convergence of a right-handsid...

The “equation-free” (EF) method is often used in complex, multi-scale problems. In such cases it is necessary to know the closed form of the required evolution equations about macroscopic variables within some applied fields. Conceptually such equations exist, however, they are not available in closed form. The EF method can bypass this difficulty. This method can obtain macroscopic information...

The objective of this paper is to explain the principles of the design of a coarse space in a simplified way and by pictures. The focus is on ideas rather than on a more historically complete presentation. That can be found, e.g., in [ 28]. Also, space limitation does not allow us even to mention many important methods and papers that should be rightfully included. The coarse space facilitates ...

The classical HKR-theorem gives an isomorphism of the n-th Hochschild cohomology of a smooth algebra and the n-th exterior power of its module of Kähler differentials. Here we generalize it for simplicial, graded and anticommutative objects in “good pairs of categories”. We apply this generalization to complex spaces and noetherian schemes and deduce two decomposition theorems for their (relati...

We present AMPS, an augmented matrix approach to update the solution to a linear system of equations when the matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform N − k contingency analysis, i.e., determine the state of the system when exactly k links from N fail. Our algorithms a...

The large availability of source code on the Internet is enabling the emergence of specialized search engines that retrieve source code in response to a query. The ability to perform search at this scale amplifies some of the problems that also exist when search is performed at single-project level. Specifically, the number of hits can be several orders of magnitude higher, and the variety of c...