Synthesis, structure and reactivity of homobimetallic Rh(I) and Ir(I) complexes of s- and as-indacene-diide

The Rh(COD) and Ir(COD) homobimetallic complexes of s-indacene-diide, 2,6-dimethyl-s-indacene-diide, as-indacene-diide, and 2,7-dimethyl-as-indacene-diide have been synthesized from the di-lithium salts of the dianions and metal dimers [M(μ-Cl)L₂]₂ (M = Rh, Ir; L₂ = COD, NBD, (ethylene)₂, (CO)₂ as mixtures of syn and anti isomers. The syn/anti ratio depends on the nature of the ancillary ligands at the metal and on the s or as geometry of the bridging ligand. In the reaction of the 2,7-dimethyl-as-indacene-diide-[M(COD)]₂ species with CO, the higher reactivity of the syn isomers has been justified on the basis of a greater instability of the ground state due to steric interactions between the COD groups. Bis-η¹ metal-bonded intermediates have been identified in the carbonylation of iridium derivatives; on the other hand, the formation of the bis-η⁵ mixed complexes syn and anti-{2,7-dimethyl-as-indacene-diide-[Rh(COD)][Rh(CO)₂]} and their reactivity strongly support the existence of metal---metal interaction in the rhodium derivatives.     

一种有效提取弱信号的新方法

随机共振 ( Stochastic Resonance,简称 SR)最初由 Benzi[1] 于 1 981年提出 ,并在气象学领域中得到了成功的应用 .根据随机共振理论 ,通过加噪声可在某一“共振”点处大幅度提高信号的信噪比 .这种方法也已成功地应用于方波脉冲信号的恢复 [2 ] ,但在化学信号中的应用尚属空白 .我们首次将这种方法用于化学弱信号的检测 ,并在简单喇曼谱图的解析中获得成功 [3 ] .但是 ,加噪声的方法作为一种有效的信号分析手段还显得很不成熟 .具体表现为处理过程较繁 ,分析信号的峰位偏移明显 ,而且结果在一定程度上要依赖人为判断来决定 [3 ] .　　在…     

多种资本投入的一般增长模型

本文在Solow模型的基础上,讨论了多种资本投入这种更一般的情况,运用单调动力系统原理论让了此模型的全局稳定性,并得出了这种经济的收敛速度。     

超图结构上合作博弈的赋权Position值

在合作博弈的一般模型中总是假设所有联盟都能形成。不过,在实际中由于受到一些因素的制约,有些联盟是不能形成的。基于此,Myerson提出了具有图通讯结构的合作博弈。Myerson值和Position值是超图博弈上的两个重要分配规则。2005年,Slikker给出了在图博弈上Position值的公理化刻画。但超图博弈上Position值的公理化刻画一直悬而未决。本文通过引入“赋权平衡超边贡献公理”,并结合经典的“分支有效性”,提出了超图博弈上赋权Position值的公理化刻画。作为推论,解决了超图博弈上Position值的公理化刻画问题。     

The nucleolus is well-posed

The lexicographic order is not representable by a real-valued function, contrary to many other orders or preorders. So, standard tools and results for well-posed minimum problems cannot be used. We prove that under suitable hypotheses it is however possible to guarantee the well-posedness of a lexicographic minimum over a compact or convex set. This result allows us to prove that some game theoretical solution concepts, based on lexicographic order are well-posed: in particular, this is true for the nucleolus.     

A generalized linear production model: A unifying model

We introduce a generalized linear production model whose attractive feature being that the resources held by any subset of producersS is not restricted to be the vector sum of the resources held by the members ofS. We provide sufficient conditions for the non-emptiness of the core of the associated generalized linear production game, and show that if the core of the game is not empty then a solution in it can be produced from a dual optimal solution to the associated linear programming problem. Our generalized linear production model is a proper generalization of the linear production model introduced by Owen, and it can be used to analyze cooperative games which cannot be studied in the ordinary linear production model framework. We use the generalized model to show that the cooperative game induced by a network optimization problem in which players are the nodes of the network has a non-empty core. We further employ our model to prove the non-emptiness of the core of two other classes of cooperative games, which were not previously studied in the literature, and we also use our generalized model to provide an alternative proof for the non-emptiness of the core of the class of minimum cost spanning tree games. Thus, it appears that the generalized linear production model is a unifying model which can be used to explain the non-emptiness of the core of cooperative games generated by various, seemingly different, optimization models.This research was partially done while the author was visiting the Graduate School of Business Administration at Tel-Aviv University. The research was partially supported by Natural Sciences and Engineering Research Council Canada Grant A4181 and by SSHRC leave fellowship 451-83-0030.Dedicated to George B. Dantzig.     

ON ASPIRATION SOLUTIONS IN PREDICTING COALITION FORMATION IN COOPERATIVE GAMES

This paper consists of two parts. The first part introduces the strict aspiration as a new aspiration solution concept, which is proved to be existent for any cooperative game. The second part deals with the unsolved problem put forward by Bennett [1] by showing that there is at least one payoff which is balanced, partnered and equal gains aspiration. The proof is algebraic and constructive, thus providing an algorithm for finding such aspirations.     

A test of the core solution in finite strategy non-sidepayment games

This paper reports a test of the core solution in cooperative non-sidepayment games where players have finite strategy sets. Two laboratory experiments were conducted with three-person and four-person games; in both experiments, the core solution was tested competitively against the von Neumann-Morgenstern stable set and the imputation set. Predictions from these solution concepts were computed under parameters of α-effectiveness and strict preference. Results show that the frequency of outcomes falling in core is substantially higher than that observed in previous experiments (most of which involve sidepayment games). In addition, goodness-of-fit tests show that the core solution predicts the observed outcomes more accurately than do the stable set or the imputation set.     

A composite run-to-the-bank rule for multi-issue allocation situations

In this paper, we propose a new extension of the run-to-the-bank rule for bankruptcy situations to the class of multi-issue allocation situations. We show that this rule always yields a core element and that it satisfies self-duality. We characterise our rule by means of a new consistency property, issue-consistency.     

Exploring the effects of cooperative interactions on affinity using a pinwheel sensor system

A series of three pinwheel sensors were constructed with 1, 2, and 3 binding sites. Binding of Zn⁺² and Cd⁺² was monitored by fluorescence over a range of temperatures. The data demonstrate that cooperative interactions generally increase the effective affinity of the sensor. This effect is more pronounced in systems which have lower inherent affinity for the analyte.