نتایج جستجو برای: poly o

تعداد نتایج: 629561  

2009
Jun Dai Juan Yang Xiaobing An

The reaction of lead(II) acetate and 3-methyl-benzoic acid (MBA) in aqueous solution yielded the title polymer, [Pb(C(8)H(7)O(2))(2)(H(2)O)](n). The asymmetric unit contains two Pb(II) atoms, four MBA ligands and two water mol-ecules. Each Pb(II) cation is hepta-coordinated and chelated by four carboxyl-ate O atoms from two MBA ligands. The Pb atoms are bridged through the carboxyl-ate O atoms ...

2011
Shan Gao Seik Weng Ng

In the crystal structure of the polymeric title compound, {[Sr(C(10)H(6)O(6)S(2))(H(2)O)(4)]·H(2)O}(n), the naphthalene-1,6-disulfonate dianion uses one -SO(3) unit to O,O'-chelate to an Sr(II) cation and its third O atom to bind to another Sr(II) cation. The other -SO(3) unit binds to yet another Sr(II) atom. The four coordinated water mol-ecules are monodentate but one is disordered over two ...

2011
Yu-Kun Lu Jian Liu Cheng-Lin Diao Ren-Qing Lü Yun-Qi Liu

In the title compound, {[Zn(C(4)H(4)O(5))(C(10)H(8)N(2))]·2H(2)O}(n), the Zn(II) ion displays a distorted tetra-gonal-pyramidal coordination environment with one hy-droxy O and three carboxyl-ate O atoms from three malate anions, and the one remaining position occupied by an N atom from a 4,4'-bipyridine ligand. The pyridine rings of the 4,4'-bipyridine ligand are twisted with respect to each o...

2008
Ying Fan Wei You Jian-Lan Liu Hui-Fen Qian Wei Huang

In the title compound, [Cu(C(7)H(3)Cl(2)O(2))(2)](n), the Cu(II) atom lies on a centre of inversion and adopts a [4+2] coordination mode, with two long axial Cu-Cl coordinative bonds complementing four Cu-O bonds from two 2,4-dichloro-6-formyl-phenolate ligands in a distorted square plane. π-π stacking inter-actions are also formed between neighbouring aromatic rings, with a centroid-centroid s...

2011
Moazzam H. Bhatti Uzma Yunus Sohail Saeed Syed Raza Shah Wing-Tak Wong

In the title complex, [Ca(C(10)H(6)NO(4))(2)(H(2)O)(2)](n), the Ca(II) atom lies on a twofold rotation axis and adopts a dodeca-hedral geometry. The Ca(II) atom is octa-coordinated by two O atoms from two water mol-ecules and six O atoms from four acetate ligands. Each acetate acts as a tridentate ligand bridging two Ca(II) atoms, resulting in a chain running along the c axis. O-H⋯O and C-H⋯O h...

2012
Ya-Feng Li Yue Gao Yue Xu Xiao-lin Qin Wen-Yuan Gao

In the title compound, [Cu(C(6)H(2)O(5))(H(2)O)(3)](n), an infinite chain is formed along [001] by linking of the Cu(OH(2))(3)O(4) cluster with one carboxyl-ate group of the furan-2,5-dicarboxyl-ate ligand. Adjacent chains are linked by O(water)-H⋯O hydrogen-bonding inter-actions. The Cu(OH(2))(3)O(4) cluster displays a penta-gonal bipyrimadal geometry with two weak coordinations [Cu-O(furan) =...

Journal: :Math. Program. 2005
Carlo Filippi Alessandro Agnetis

The bin packing problem consists of finding the minimum number of bins, of given capacity D, required to pack a set of objects, each having a certain weight. We consider the high-multiplicity version of the problem, in which there are only C different weight values. We show that when C = 2 the problem can be solved in time O(logD). For the general case, we give an algorithm which provides a sol...

Journal: :CoRR 2010
Vladimir Braverman Rafail Ostrovsky

In a ground-breaking paper, Indyk and Woodruff (STOC 05) showed how to compute Fk (for k > 2) in space complexity O(poly-log(n,m) · n 2 k ), which is optimal up to (large) poly-logarithmic factors in n and m, where m is the length of the stream and n is the upper bound on the number of distinct elements in a stream. The best known lower bound for large moments is Ω(log(n)n 2 k ). A follow-up wo...

Journal: :Journal of Machine Learning Research 2005
Dana Angluin Jiang Chen

We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergraph or not. We show that an r-uniform hypergraph with m edges and n vertices is learnable with O(24rm · poly(r, logn)) queries with high probability. The queries can be made in O(min(2r(logm + r)2, (logm + r)3)) rounds...

Journal: :SIAM J. Comput. 2000
Martin E. Dyer Sandeep Sen

We describe a deterministic parallel algorithm for linear programming in fixed dimension d that takes poly(log log n) time in the common concurrent read concurrent write (CRCW) PRAM model and does optimal O(n) work. In the exclusive read exclusive write (EREW) model, the algorithm runs in O(logn · log logd−1 n) time. Our algorithm is based on multidimensional search and effective use of approxi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید