Some regularity properties of algorithms and additive functions with respect to them

Summary The paper deals with the behaviour of the so-called algorithms with respect to interval filling sequences A connection is established between the uniquely representable points and the continuity points of the algorithms; also strong continuity properties on monotonic algorithms are proved. Finally the results are applied to additive functions. The theorems extend some former results by the authors, by I. Kátai and by A. Járai.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

An Ω(n 4/3) lower bound on the randomized complexity of graph properties

We improve King's (n ^5/4) lower bound on the randomized decision tree complexity of monotone graph properties to (n ^4/3). The proof follows Yao's approach and improves it in a different direction from King's. At the heart of the proof are a duality argument combined with a new packing lemma for bipartite graphs.The paper was written while the author was a graduate student at the University of Chicago and was completed at M.I.T. The work was supported in part by NSF under GRANT number NSF 5-27561, the Air Force under Contract OSR-86-0076 and by DIMACS (Center for Discret Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC88-09648.     

Analysis of uniform binary subdivision schemes for curve design

The paper analyses the convergence of sequences of control polygons produced by a binary subdivision scheme of the form

On the polynomial τ-functions for the KP hierarchy and the bispectral property

We show that the -functions obtained from Schur polynomials lead to wave functions w(x ₁, x ₂, ... ; k) that possess the following bispectral property: There exists a differential operator B{k,_k}, independent of x ₁ , such that B{k,_k}w = {x ₁}w, where {x ₁} is independent of k. This extends for the KP hierarchy some earlier results of J. J. Duistermaat and F. A. Grünbaum for the rational solutions of KdV and of P. Wright for certain rational solutions of the generalized KdV equations.     

On error estimates of some higher order projection and penalty-projection methods for Navier-Stokes equations

Summary This paper is a continuation of our previous work [10] on projection methods. We study first existing higher order projection schemes in the semidiscretized form for the Navier-Stokes equations. One error analysis suggests that the precision of these schemes is most likely plagued by the inconsistent Neumann boundary condition satisfied by the pressure approximations. We then propose a penalty-projection scheme for which we obtain improved error estimates.This work is partially supported by NSF grant MS-8802596.     

Convergence of multistep methods for Volterra functional differential equations

Summary This paper deals with the convergence of nonstationary quasilinear multistep methods with varying step, used for the numerical integration of Volterra functional differential equations. A Perron type condition (appearing in the differential equations theory) is imposed on the increment function. This gives a generalization of some results of Tavernini ([19–21]).     

Can a linear value function explain choices? An experimental study

We investigate in a simple bi-criteria experimental study, whether subjects are consistent with a linear value function while making binary choices. Many inconsistencies appeared in our experiment. However, the impact of inconsistencies on the linearity vs. non-linearity of the value function was minor. Moreover, a linear value function seems to predict choices for bi-criteria problems quite well. This ability to predict is independent of whether the value function is diagnosed linear or not. Inconsistencies in responses did not necessarily change the original diagnosis of the form of the value function. Our findings have implications for the design and development of decision support tools for Multiple Criteria Decision Making problems.     

Interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy

We present an approach to interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy.The approach relies on formulae for lower and upper bounds on coordinates of the outcome of an arbitrary efficient variant corresponding to preference information expressed by the Decision Maker. In contrast to earlier works on that subject, here lower and upper bounds can be calculated and their accuracy controlled entirely within evolutionary computation framework. This is made possible by exploration of not only the region of feasible variants - a standard within evolutionary optimization, but also the region of infeasible variants, the latter to our best knowledge being a novel approach within Evolutionary Multiobjective Optimization.To illustrate how this concept can be applied to interactive Multiple Criteria Decision Making, two algorithms employing evolutionary computations are proposed and their usefulness demonstrated by a numerical example.     

A new design of the elimination and choice translating reality method for multi-criteria group decision-making in an intuitionistic fuzzy environment

The purpose of this paper is to design a new extension of the ELECTRE, known as the elimination and choice translating reality method, for multi-criteria group decision-making problems based on intuitionistic fuzzy sets. This method is widely utilized when a set of alternatives should be identified and evaluated with respect to a set of conflicting criteria by reflecting decision makers’ (DMs’) preferences. However, handling the exact data and numerical measure is difficult to be precisely focused because the DMs’ judgments are often vague in real-life decision problems and applications. A more realistic and practical approach can be to use linguistic variables expressed in intuitionistic fuzzy numbers instead of numerical data to model DMs’ judgments and to describe the inputs in the ELECTRE method. The proposed intuitionsitic fuzzy ELECTRE utilizes the truth-membership function and non-truth-membership function to indicate the degrees of satisfiability and non-satisfiability of each alternative with respect to each criterion and the relative importance of each criterion, respectively. Then, a new discordance intuitionistic index is introduced, which is extended from the concept of the fuzzy distance measure. Outranking relations are defined by pairwise comparisons and a decision graph is depicted to determine which alternative is preferable, incomparable or indifferent in the intuitionistic fuzzy environment. Finally, a comprehensive sensitivity analysis is employed to further study regarding the impact of threshold values on the final evaluation, and a comparative analysis is demonstrated with an application example in flexible manufacturing systems between the proposed ELECTRE method and the existing intuitionistic fuzzy technique for order preference by similarity to ideal solution (IF-TOPSIS) method.     

Metabolic profile of glyburide in human liver microsomes using LC‐DAD‐Q‐TRAP‐MS/MS

The sulfonylurea urea drug glyburide (glibenclamide) is widely used for the treatment of diabetes milletus and gestational diabetes. In previous studies monohydroxylated metabolites were identified and characterized for glyburide in different species, but the metabolite owing to the loss of cyclohexyl ring was identified only in mouse. Glyburide upon incubation with hepatic microsomes resulted in 10 metabolites for human. The current study identifies new metabolites of glyburide along with the hydroxylated metabolites that were reported earlier. The newly identified drug metabolites are dihydroxylated metabolites, a metabolite owing to the loss of cyclohexyl ring and one owing to hydroxylation with dehydrogenation. Among the 10 identified metabolites, there were six monohydroxylated metabolites, one dihydroxylated metabolite, two metabolites owing to hydroxylation and dehydrogenation, and one metabolite owing to the loss of cyclohexyl ring. New metabolites of glyburide were identified and characterized using liquid chromatography–diode array detector–quadruple‐ion trap–mass spectrometry/mass spectrometry (LC‐DAD‐Q‐TRAP‐MS/MS). An enhanced mass scan–enhanced product ion scan with information‐dependent acquisition mode in a Q‐TRAP‐MS/MS system was used to characterize the metabolites. Liquid chromatography with diode array detection was used as a complimentary technique to confirm and identify the metabolites. Metabolites formed in higher amounts were detected in both diode array detection and mass spectrometry detection. Copyright © 2012 John Wiley & Sons, Ltd.