（0,1;0）-INTERPOLATION ON INFINITE INTERVAL （-∞, ＋∞）

In this paper, we study the explicit representation and convergence of （0, 1;0）-interpolation on infisite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values areprescribed at two set of points namely the zeros of Hn（x） and H′n （x） and the first derivatives at the zerosof H′n（x）.     

Synthesis and characterization of some novel cyanonitrosyl complexes of chromium(I) with Mannich bases,aromatic aldehyde oximes and syn-phenyl-2-pyridylketoxime

Some new low-spin hexacoordinated cyanonitrosyl complexes of Cr¹ of the type [Cr(NO)(CN)₂(L)₂(H₂)], where L is an aromatic aldehyde oxime or Mannich base, have been prepared by the interaction or K₃[Cr(NO)(CN)₅]· H₂O with L in aqueous AcOH, and characterized by a range of physico-chemical techniques, I.r. data suggest that all the oxime derivatives and Mannich bases act as monodentate ligands by coordinating through the aromatic nitrogen. TMC 2564     

An Efficient, One-Pot Synthesis of Carbamates from the Corresponding Alcohols Using Mitsunobu’s Reagent

A novel Mitsunobu-based protocol was developed for the synthesis of carbamates from the corresponding alcohols using carbon dioxide and amines in good to excellent yields. This protocol is mild, chemoselective, and efficient compared to other reported methods.     

Order splitting in single sourcing with scheduled-release orders

Traditional inventory models assume that a buyer places one order with a supplier in each order cycle. A large number of researchers have studied the benefits of dual sourcing such that an order quantity is split and placed simultaneously with two suppliers. We show that many of the benefits of dual sourcing are due to order splitting rather than using two suppliers. We investigate order splitting with one supplier such that the first part of the order is sent out immediately but the second part of the order is released later (scheduled-release). Through extensive computational results, we show that in many situations where dual sourcing or the use of a cheaper supplier would be cost effective, single sourcing with order splitting using scheduled-release orders is better. The paper provides a quantitative rationale to continue with one supplier. We also summarize the qualitative reasons to prefer single sourcing or multiple sourcing.     

Working group report: Flavor physics and model building

This is the report of flavor physics and model building working group at WHEPP-9. While activites in flavor physics have been mainly focused on B-physics, those in model building have been primarily devoted to neutrino physics. We present summary of working group discussions carried out during the workshop in the above fields, and also briefly review the progress made in some projects subsequently.     

Rapid and efficient removal of Hg(II) from aqueous solution by potassium hexa-titanate: A radiotracer study

The adsorption of mercury(II) on potassium titanate has been studied in chloride media at different pH values, adsorbate concentrations and temperatures. Effect of different ligands and acid concentrations on the uptake was also investigated. Desoprtion studies were also done to check the reversibility of the process. Interestingly a more or less constant and high value of adsorption has been found at different temperatures, pH values and concentrations and a decrease in the uptake with an increase in the bulk acid concentration was observed.     

Partitioning arrangements of lines II: Applications

In this paper we present efficient deterministic algorithms for various problems involving lines or segments in the plane, using the partitioning algorithm described in a companion paper [A3]. These applications include: (i) anO(m ^2/3 n ^2/3 · log^2/3 n · log^/3 (m/n)+(m+n) logn) algorithm to compute all incidences betweenm points andn lines, where is a constant <3.33; (ii) anO(m ^2/3 n ^2/3 · log^5/3 n · log^/3 (m/n)+(m+n) logn) algorithm to computem faces in an arrangement ofn lines; (iii) anO(n ^4/3 log^(+2)/3 n) algorithm to count the number of intersections in a set ofn segments; (iv) anO(n ^4/3 log^{( + 2)/3} n) algorithm to count red-blue intersections between two sets of segments, and (v) anO(n ^3/2 log^/3 n) algorithm to compute spanning trees with low stabbing number for a set ofn points. We also present an algorithm that, given set ofn points in the plane, preprocesses it, in timeO(nm log^+1/2 n), into a data structure of sizeO(m) forn lognmn ², so that the number of points ofS lying inside a query triangle can be computed inO((n/m) log^3/2 n) time.Work on this paper has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation. A preliminary version of this paper appears in theProceedings of the 5th ACM Symposium on Computational Geometry, 1989, pp. 11–22.