Experimental non-local generation of entanglement from independent sources

We experimentally demonstrate a non-local generation of entanglement from two independent photonic sources in an ancilla-free process . Two bosons (photons) are entangled in polarization space by steering into a novel interferometer setup, in which they have never meet each other. The entangled photons are delivered to polarization analyzers in different sites, respectively, and a non-local interaction is observed. Entanglement is further verified by the way of the measured violation of a CHSH type Bell's inequality with S-values of 2.54 and 27 standard deviations. Our results will shine a new light into the understanding on how quantum mechanics works, have possible philosophic consequences on the one hand and provide an essential element for quantum information processing on the other hand. Potential applications of our results are briefly discussed.Comment: 5 pages, 4 figure

Breast metastasis from rectal carcinoma: A case report and review of the literature

BackgroundMetastasis from extramammary primary tumor to breast is extremely rare. Case SummaryA 59-year-old woman with 1-year history of rectal cancer presented with asymptomatic breast mass. At 16 months after the diagnosis of rectal mucinous adenocarcinoma, a breast mass was confirmed by ultrasonography and identified by pathology and immunohistochemistry as a metastasis from the rectal cancer. Treatments included chemotherapy (6 cycles: 300 mg irinotecan on day 1, 4.5 mg raltitrexed on day 2, 450 mg bevacizumab on day 3), radiotherapy, and surgical resection. Two years of follow-up examinations (6-months intervals) showed no evidence of recurrence or novel distant metastasis. ConclusionBreast metastasis from rectal carcinoma is a rare secondary malignancy. Final diagnosis can be established by histopathology and immunohistochemistry

Bis(2-butyl­imino­methyl-5-methoxy­phenolato-κ2 N,O 1)zinc(II)

In the centrosymmetric title compound, [Zn(C12H16NO2)2], the ZnII centre is coordinated by two O,N-bidentate Schiff base ligands, resulting in a slightly distorted trans-ZnN2O2 square-planar geometry for the metal ion. Two short intra­molecular C—H⋯O contacts occur in the mol­ecule

Towards verification of computation orchestration

Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed Web Services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of Web Services or communication and so forth. The semantics of Orc is precisely defined. However, there is no automatic verification tool available to verify critical properties against Orc programs. Our goal is to verify the orchestration programs (written in Orc language) which invoke web services to achieve certain goals. To investigate this problem and build useful tools, we explore in two directions. Firstly, we define a Timed Automata semantics for the Orc language, which we prove is semantically equivalent to the operational semantics of Orc. Consequently, Timed Automata models are systematically constructed from Orc programs. The practical implication is that existing tool supports for Timed Automata, e.g., Uppaal, can be used to simulate and model check Orc programs. An experimental tool has been implemented to automate this approach. Secondly, we start with encoding the operational semantics of Orc language in Constraint Logic Programming (CLP), which allows a systematic translation from Orc to CLP. Powerful constraint solvers like CLP(R) are then used to prove traditional safety properties and beyond, e.g., reachability, deadlock-freeness, lower or upper bound of a time interval, etc. Counterexamples are generated when properties are not satisfied. Furthermore, the stepwise execution traces can be automatically generated as the simulation steps. The two different approaches give an insight into the verification problem of Web Service orchestration. The Timed Automata approach has its merits in visualized simulation and efficient verification supported by the well developed tools. On the other hand, the CPL approach gives better expressiveness in both modeling and verification. The two approaches complement each other, which gives a complete solution for the simulation and verification of Computation Orchestration