Extended Rees algebras and mixed multiplicities

Partially supported by the general research fund at the University of Kansas     

Bessel functions and singular BVPs arising in physiology in the presence of upper and lower solutions in reverse order

In this paper, we consider the genic mutation on an impulsive population system in polluted environment. All solutions of the investigated system are proved to be uniformly bounded. Using mathematical analysis methods, the conditions of the globally asymptotically stable population-extinction solution of the investigated system are obtained. The permanent condition of the investigated system is also obtained. Finally, numerical analysis is carried out illustrate our results. Our results provide reliable tactic basis for the practical biological resource management in polluted environment.     

COTS selection using fuzzy interactive approach

In this paper, we introduce fuzzy mathematical programming (FMP) for decision-making related to software creation by selecting optimal commercial-off-the-shelf (COTS) products in a modular software system. Each module in such software systems have different alternatives with variations in their properties, for example, quality, reliability, execution time, size and cost. Due to these variations, component-based software developers generally deals with the problem of selecting appropriate COTS products. The development of COTS-based systems largely depends on the success of the selection process. Various crisp optimization models of COTS products selection have been proposed in literature. However, in real COTS products selection problem, it is difficult to estimate precisely the values of various model parameters due to lack of sufficient data and also because of measurement errors. Hence, instead of crisp optimization model, if we use flexible optimization model then we might obtain results which are more preferred by the decision maker. In this study, we use multiple methodologies such as quality model, analytical hierarchy process and FMP to develop fuzzy multiobjective optimization model of the COTS products selection. To determine a preferred compromise solution for the multiobjective optimization problem, an interactive fuzzy approach is used.     

A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization

We propose a new framework for the application of preconditioned conjugate gradients in the solution of large-scale linear equality constrained minimization problems. This framework allows for the exploitation of structure and sparsity in the context of solving the reduced Newton system (despite the fact that the reduced system may be dense). Numerical experiments performed on a variety of test problems from the Netlib LP collection indicate computational promise.     

Analysis of certain mixtures ofα-Amino acids

Summary -Amino acids are determined by reaction with perinaphthindan-2,3,4-trione hydrate to form dihydroxyperinaphthindenone which is titrated with chloramine-T in the presence of acidified bromide and methyl red. The thiol group of cysteine is blocked by cyano-ethylation before determination. Some amino acids can be directly titrated with chloramine-T in the presence of bromide and methyl red, e. g., cysteine (after cyanoethylation), methionine and lanthionine, or in the presence of iodide and starch, e. g., cysteine (after tetrathionate reaction) when concomitant amino acids do not interfere. These methods are used to analyze model mixtures of cysteine with serine, methionine with glycine and cysteine with methionine.

---

Analyse bestimmter Gemische von -Aminosäuren

Zusammenfassung -Aminosäuren werden mit Peri-Naphthindan-2,3,4-trion-hydrat umgesetzt, wobei sich Dihydroxyperinaphthindenon bildet, das mit Chloramin T in der Gegenwart von angesäuertem Bromid und Methylrot titriert wird. Die Thiolgruppe des Cysteins wird vor der Bestimmung durch Cyanoäthylierung blockiert. Manche Aminosäuren können unmittelbar mit Chloramin T in der Gegenwart von Bromid und Methylrot titriert werden, z. B. Cystein (nach Cyanoäthylierung), Methionin und Lanthionin, oder in Gegenwart von Jodid und Stärke Cystein (nach Umsetzung mit Tetrathionat), wenn die begleitende Aminosäure nicht stört. Diese Verfahren wurden benutzt, um Modellgemische von Cystein mit Serin, Methionin mit Glycin und Cystein mit Methionin zu analysieren.

     

New operations over hesitant fuzzy sets

Hesitant fuzzy sets are considered to be the way to characterize vague phenomenon. Their study has opened a new area of research and applications. Set operations on them lead to a number of properties of these sets which are not evident in classical (crisp) sets make the area mathematically also very productive. Since these sets are defined in terms of functions and set of functions, which is not the case when the sets are crisp, it is possible to define several set operations. Such a study enriches the use of these sets. In this paper, four new operations are envisaged, defined and taken up to study a score of new identities on hesitant fuzzy sets.     

The generalized relaxed proximal point algorithm involving -maximal-relaxed accretive mappings with applications to Banach spaces

A general design for the relaxed proximal point algorithm using the notion of A-maximal-relaxed accretiveness is developed, and then the convergence analysis for this algorithm in the context of solving a general class of nonlinear inclusion problems is examined along with some other results of interest involving A-maximal-relaxed accretive mappings in a real Banach space setting.     

A characterization of domains in <Emphasis Type="Bold">C</Emphasis><Superscript>2</Superscript> with noncompact automorphism group

Let D be a bounded domain in C ² with a non-compact group of holomorphic automorphisms. Model domains for D are obtained under the hypotheses that at least one orbit accumulates at a boundary point near which the boundary is smooth, real analytic and of finite type. The author was supported by DST (India) Grant No.: SR/S4/MS-283/05 and in part by a grant from UGC under DSA-SAP, Phase IV.     

Deciding confluence of certain term rewriting systems in polynomial time

We present a characterization of confluence for term rewriting systems, which is then refined for special classes of rewriting systems. The refined characterization is used to obtain a polynomial time algorithm for deciding the confluence of ground term rewrite systems. The same approach also shows the decidability of confluence for shallow and linear term rewriting systems. The decision procedure has a polynomial time complexity under the assumption that the maximum arity of a function symbol in the signature is a constant.     

Bounds for the Steklov eigenvalues

Let \(\Omega \) be a star-shaped bounded domain in \((\mathbb {S}^{n}, ds^{2})\) with smooth boundary. In this article, we give a sharp lower bound for the first non-zero eigenvalue of the Steklov eigenvalue problem in \(\Omega .\) This result extends a result given by Kuttler and Sigillito (SIAM Rev 10:368–370, 1968) for a star-shaped bounded domain in \(\mathbb {R}^2\). Further we also obtain a two sided bound for the eigenvalues of the Steklov problem on a ball in \(\mathbb {R}^n\) with rotationally invariant metric and with bounded radial curvature.