Substrate-reagent complexation ability in enantioselective 1,4 addition reactions

Hydrogen-aarbonyl chelation and magnesium-arene π coordination are proposed to aooount for enhanced enantioselectivïty in 1,4-addition reactions of chiral cuprates.     

Weitere Vereinfachung der Mikrobestimmung von Jod in organischen Verbindungen

Zusammenfassung Die Mikromethode zur Jodbestimmung in organischen Substanzen durch Verbrennen nachSchöniger und nachfolgende Titration mit 0,005-n Quecksilberperchlorat wird dahingehend vereinfacht, daß die Jodabsorption nach der Verbrennung anstatt mit Natronlauge direkt mit Quecksilberperchlorat erfolgt.

---

Summary The micro method for determining iodine in organic materials through combustion afterSchöniger and subsequent titration with 0.005N mercuric perchlorate is modified to the extent that after the combustion the iodine is absorbed directly in mercuric perchlorate rather than in sodium hydroxide.

---

Résumé On a simplifié la microméthode pour le dosage de l'iode dans les substances organiques avec combustion suivantSchöniger et titrage consécutif par le perchlorate de mercure 0,005N. L'absorption de l'iode après la combustion s'effectue directement par le perchlorate de mercure à la place de la lessive de soude.

---

Riassunto La microdeterminazione dello iodio nelle sostanze organiche per combustione secondoSchöniger e successiva titolazione con perclorato di mercurio 0,005-n, è stata semplificata riprendendo direttamente il prodotto di combustione in una soluzione di perclorato di mercurio invece di una soluzione di idrato sodico.

     

Etude des métastannates de cadmium par spectrographie d'absorption infrarouge entre 5 et 40μ. Solutions solides entre l'oxyde d'étain et Poxyde de cadmium

Résumé Par chauffage à 1000° de mélanges d'oxyde stannique et d'oxyde de cadmium en proportions diverses, comme par déshydratation de précipités mixtes des hydroxydes correspondants, il se forme une série de solutions solides de l'oxyde de cadmium dans l'oxyde d'étain. Elles sont solubles dans l'acide chlorhydrique et présentent un spectre d'absorption infrarouge caractéristique que l'on a comparé avec celui des 2 métastannates de cadmium CdSnO₃, l'un de type ilménite, l'autre de type perovskite.

---

Summary By heating various mixture of stannic oxide and cadmium oxide to 1000° C, a series of solid solutions of cadmium oxide in stannic oxide results as is the case when mixed precipitates of the corresponding hydroxides are dehydrated. They are soluble in hydrochloric acid and yield a characteristic infrared absorption spectrum that was compared with that of the two cadmium métastannates CdSnO₃, one of the ilmenite type, the other of the perovskite type.

---

Zusammenfassung Erhitzt man verschieden zusammengesetzte Gemische von Zinnoxid und Cadmiumoxid auf 1000° C oder werden Mischfällungen der entsprechenden Hydroxide dehydratisiert, so entsteht eine Reihe fester Lösungen von Cadmiumoxid in Zinnoxid. Sie sind in Salzsäure löslich und zeigen ein charakteristisches Absorptionsspektrum im IR. Dieses wurde mit dem Spektrum zweier Cadmium-Metastannate (CdSnO₃) vom Typus des Ilmenits bzw. Perovskits verglichen.

     

Independence versus indetermination: basis of two canonical clustering criteria

Advances in Data Analysis and Classification - This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very...     

A note on packing paths in planar graphs

Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271.     

Optimal Control of an <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>/1 Queueing System with a Removable Service Station

This paper studies the optimal operation of an M/E _k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E _k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E _k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.     

An Algorithm for the Economic Design of <Emphasis Type="Italic">np</Emphasis> Charts for a Multiplicity of Assignable Causes

Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good.     

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.     

Spectra of graphs and fractal dimensions II

This paper continues the study of exponentsd(x), d (x), d _R (x) andd (x) for graphG; and the nearest neighbor random walk {X _n } _nN onG, if the starting pointX ₀=x is fixed. These exponents are responsible for the geometric, resistance, diffusion and spectral properties of the graph. The main concern of this paper is the relation of these exponents to the spectral density of the transition matrix. A series of new exponentse, e ,e _R ,e are introduced by allowingx to vary along the vertices. The results suggest that the geometric and resistance properties of the graph are responsible for the diffusion speed on the graph.