Synthesis and characterisation of new platinum-acetylide complexes containing diimine ligands

A new class of platinum-bipyridyl compounds has been synthesized by the dehydrohalogenative reaction of [4,4'-bis(tert-butyl)-2,2'-bipyridyl]platinum dichloride [PtCl2((t)Bu(2)bipy)] 1 with terminal alkynes HC=CR, in the presence of copper(I) iodide and diisopropylamine. The products [Pt(C=CR)(2)((t)Bu(2)bipy)] (R=C6H4NO2-p 2, C6H5 3, C6H4CH3-p 4 or SiMe3 5), have been characterised by spectroscopic and analytical methods, and a single crystal molecular structure determination has been carried out on 4. Extended Huckel molecular orbital calculations have also been carried out, and the results are used to help rationalise the voltammetric, EPR and spectroelectrochemical properties of the new compounds. These show that compounds 3, 4 and 5 undergo a one-electron bipyridyl based redox process, but that 2 has an unresolved two-electron process located on the nitro groups.

Synthesis of a tri(organoplatinum) complex via the double directed lithiation of a mono(organoplatinum) precursor

The new diarylplatinum complex Cis-[Pt(PEt(3))(2){C6H3(CH(2)NMe(2))(2)-3,5}(2)] 1, containing four free amine coordination sites, undergoes directed lithiation with Bu(t)Li and subsequent transmetallation with [PtCl2(SEt(2))(2)] to give a triplatinum species 3 which reductively eliminates the diplatinum complex[ClPt{2,6-(Me(2)NCH(2))(2)C6H2-C6H2(CH(2)NMe(2))(2)-2,6}PtCl] 4.

Cation complexation by chemically modified calixarenes. 11. Complexation and extraction of alkali cations by calix[5]- and -[6]arene ketones. Crystal and molecular structures of calix[5]arene ketones and Na+ and Rb+ complexes

A series of four calix[5]arenes and three calix[6]arenes (R-calixarene-OCH2COR1) (R = H or Bu-t) with alkyl ketone residues (R-1 = Me or Bu-t) on the lower rim have been synthesized, and their affinity for complexation of alkali cations has been assessed through phase-transfer experiments and stability constant measurements. The conformations of these ketones have been probed by H-1 NMR and X-ray diffraction analysis, and by molecular mechanics calculations. Pentamer 3 (R R-1 = Bu-t) possesses a symmetrical cone conformation in solution and a very distorted cone conformation in the solid state. Pentamer 5 (R = H, R-1 = Bu-t) exists in a distorted 1,2-alternate conformation in the solid state, but in solution two slowly interconverting conformations, one a cone and the other presumed to be 1,2-alternate, can be detected. X-ray structure analysis of the sodium and rubidium perchlorate complexes of 3 reveal the cations deeply encapsulated by the ethereal and carbonyl oxygen atoms in distorted cone conformations which can be accurately reproduced by molecular mechanics calculations. The phase-transfer and stability constant data reveal that the extent of complexation depends on calixarene size and the nature of the alkyl residues adjacent to the ketonic carbonyls with tert-butyl much more efficacious than methyl.

China’s National Security Review: a tit-for-tat response?

China is gradually taking its place as a major regulator, exercising concurrent jurisdiction of the national security review along with the US and EU over high-profile cross-border mergers and acquisitions. The National Security Review (NSR) regulatory regime of foreign acquisitions has attracted significant attention recently with the establishment of China's counterpart to the Committee on Foreign Investment in the United States (CFIUS). Due to the intensified activities of sovereign wealth funds (SWFs) that are closely linked with states, CFIUS's broad discretion to deal with China's SWF-based investment may have a far-reaching impact on China's implementation of the newly enacted NSR regime. It is essential to design a mechanism that allows SWFs to maximise their positive attributes while safeguarding the apolitical integrity of the marketplace. Any disproportionate use of the NSR regime would inevitably bring about more unintended consequences, such as tit-for-tat protectionism. This represents an imminent threat to the tenuous recovery from the recent economic crisis, largely because of the increasingly intertwined and interdependent nature of the global financial markets. It is of utmost significance to evaluate the extent to which the updated legislation strikes a reasonable balance between preserving genuine national security interests and maintaining an open environment for investment.

A Trip from a Tube to a Chip Applied Micro and Nanotechnology in Biotechnology, Veterinary and Life Sciences

More than 200 known diseases are transmitted via foods or food products. In the United States, food-borne diseases are responsible for 76 million cases of illness, 32,500 cases of hospitalisation and 5000 cases of death yearly. The ongoing increase in worldwide trade in livestock, food, and food products in combination with increase in human mobility (business- and leisure travel, emigration etc.) will increase the risk of emergence and spreading of such pathogens. There is therefore an urgent need for development of rapid, efficient and reliable methods for detection and identification of such pathogens.

Microchipfabrication has had a major impact on electronics and is expected to have an equally pronounced effect on life sciences. By combining micro-fluidics with micromechanics, micro-optics, and microelectronics, systems can be realized to perform complete chemical or biochemical analyses. These socalled ’Lab-on-a-Chip’ will completely change the face of laboratories in the future where smaller, fully automated devices will be able to perform assays faster, more accurately, and at a lower cost than equipment of today. A general introduction of food safety and applied micro-nanotechnology in life sciences will be given. In addition, examples of DNA micro arrays, micro fabricated integrated PCR chips and total integrated lab-on-achip systems from different National and EU research projects being carried out at the Laboratory of Applied Micro- Nanotechnology (LAMINATE) group at the National Veterinary Institute (DTU-Vet) Technical University of Denmark and the BioLabchip group at the Department of Micro and Nanotechnology (DTU-Nanotech), Technical University of Denmark (DTU), Ikerlan-IK4 (Spain) and other 16 partners from different European countries will be presented.

Reducible Diffusions with Time-Varying Transformations with Application to Short-Term Interest Rates

Reducible diffusions (RDs) are nonlinear transformations of analytically solvable Basic Diffusions (BDs). Hence, by construction RDs are analytically tractable and flexible diffusion processes. Existing literature on RDs has mostly focused on time-homogeneous transformations, which to a significant extent fail to explore the full potential of RDs from both theoretical and practical points of view. In this paper, we propose flexible and economically justifiable time variations to the transformations of RDs. Concentrating on the Constant Elasticity Variance (CEV) RDs, we consider nonlinear dynamics for our time-varying transformations with both deterministic and stochastic designs. Such time variations can greatly enhance the flexibility of RDs while maintaining sufficient tractability of the resulting models. In the meantime, our modeling approach enjoys the benefits of classical inferential techniques such as the Maximum Likelihood (ML). Our application to the UK and the US short-term interest rates suggests that from an empirical point of view time-varying transformations are highly relevant and statistically significant. We expect that the proposed models can describe more truthfully the dynamic time-varying behavior of economic and financial variables and potentially improve out-of-sample forecasts significantly.

Comparison Method for Differentiation of IEC 61850 based Substation Configuration Files

The increased construction and reconstruction of smart substations has exposed a problem with version management of substation configuration description language (SCL) files due to frequent changes. This paper proposes a comparative approach for differentiation of smart substation SCL configuration files. A comparison model for SCL configuration files is built in this method, which is based on the SCL structure and abstract model defined by IEC 61850. The proposed approach adopts the algorithms of depth-first traversal, sorting, and cross comparison in order to rapidly identify differences of changed SCL configuration files. This approach can also be utilized to detect malicious tampering or illegal manipulation tailoring for SCL files. SCL comparison software is developed using the Qt platform to validate the feasibility and effectiveness of the proposed approach.

Retrieving Regions of Interest for User Exploration

We consider an application scenario where points of interest (PoIs) each have a web presence and where a web user wants to iden- tify a region that contains relevant PoIs that are relevant to a set of keywords, e.g., in preparation for deciding where to go to conve- niently explore the PoIs. Motivated by this, we propose the length- constrained maximum-sum region (LCMSR) query that returns a spatial-network region that is located within a general region of in- terest, that does not exceed a given size constraint, and that best matches query keywords. Such a query maximizes the total weight of the PoIs in it w.r.t. the query keywords. We show that it is NP- hard to answer this query. We develop an approximation algorithm with a (5 + ǫ) approximation ratio utilizing a technique that scales node weights into integers. We also propose a more efficient heuris- tic algorithm and a greedy algorithm. Empirical studies on real data offer detailed insight into the accuracy of the proposed algorithms and show that the proposed algorithms are capable of computingresults efficiently and effectively.

Efficient Processing of Spatial Group Keyword Queries

With the proliferation of geo-positioning and geo-tagging techniques, spatio-textual objects that possess both a geographical location and a textual description are gaining in prevalence, and spatial keyword queries that exploit both location and textual description are gaining in prominence. However, the queries studied so far generally focus on finding individual objects that each satisfy a query rather than finding groups of objects where the objects in a group together satisfy a query.

We define the problem of retrieving a group of spatio-textual objects such that the group's keywords cover the query's keywords and such that the objects are nearest to the query location and have the smallest inter-object distances. Specifically, we study three instantiations of this problem, all of which are NP-hard. We devise exact solutions as well as approximate solutions with provable approximation bounds to the problems. In addition, we solve the problems of retrieving top-k groups of three instantiations, and study a weighted version of the problem that incorporates object weights. We present empirical studies that offer insight into the efficiency of the solutions, as well as the accuracy of the approximate solutions.

Efficient Algorithms for Answering the m-Closest Keywords Query

As an important type of spatial keyword query, the m-closest keywords (mCK) query finds a group of objects such that they cover all query keywords and have the smallest diameter, which is defined as the largest distance between any pair of objects in the group. The query is useful in many applications such as detecting locations of web resources. However, the existing work does not study the intractability of this problem and only provides exact algorithms, which are computationally expensive.

In this paper, we prove that the problem of answering mCK queries is NP-hard. We first devise a greedy algorithm that has an approximation ratio of 2. Then, we observe that an mCK query can be approximately answered by finding the circle with the smallest diameter that encloses a group of objects together covering all query keywords. We prove that the group enclosed in the circle can answer the mCK query with an approximation ratio of 2 over 3. Based on this, we develop an algorithm for finding such a circle exactly, which has a high time complexity. To improve efficiency, we propose another two algorithms that find such a circle approximately, with a ratio of 2 over √3 + ε. Finally, we propose an exact algorithm that utilizes the group found by the 2 over √3 + ε)-approximation algorithm to obtain the optimal group. We conduct extensive experiments using real-life datasets. The experimental results offer insights into both efficiency and accuracy of the proposed approximation algorithms, and the results also demonstrate that our exact algorithm outperforms the best known algorithm by an order of magnitude.