Ultrasound array transmitter architecture with high timing resolution using embedded phase-locked loops

Coarse time quantization of delay profiles within ultrasound array systems can produce undesirable sidelobes in the radiated beam profile. The severity of these sidelobes is dependent upon the magnitude of phase quantization error - the deviation from ideal delay profiles to the achievable quantized case. This paper describes a method to improve inter channel delay accuracy without increasing system clock frequency by utilising embedded Phase-Locked Loop (PLL) components within commercial Field Programmable Gate Arrays (FPGAs). Precise delays are achieved by shifting the relative phases of embedded PLL output clocks in 208 ps steps. The described architecture can achieve the necessary inter element timing resolution required for driving ultrasound arrays up to 50 MHz. The applicability of the proposed method at higher frequencies is demonstrated by means of extrapolating experimental results obtained using a 5 MHz array transducer. Results indicate an increase in Transmit Dynamic Range (TDR) when using accurate delay profiles generated by the embedded PLL method described, as opposed to using delay profiles quantized to the system clock

Reasoning about Action: An Argumentation - Theoretic Approach

We present a uniform non-monotonic solution to the problems of reasoning about action on the basis of an argumentation-theoretic approach. Our theory is provably correct relative to a sensible minimisation policy introduced on top of a temporal propositional logic. Sophisticated problem domains can be formalised in our framework. As much attention of researchers in the field has been paid to the traditional and basic problems in reasoning about actions such as the frame, the qualification and the ramification problems, approaches to these problems within our formalisation lie at heart of the expositions presented in this paper

Searching for joint gains in automated negotiations based on multi-criteria decision making theory

It is well established by conflict theorists and others that successful negotiation should incorporate "creating value" as well as "claiming value." Joint improvements that bring benefits to all parties can be realised by (i) identifying attributes that are not of direct conflict between the parties, (ii) tradeoffs on attributes that are valued differently by different parties, and (iii) searching for values within attributes that could bring more gains to one party while not incurring too much loss on the other party. In this paper we propose an approach for maximising joint gains in automated negotiations by formulating the negotiation problem as a multi-criteria decision making problem and taking advantage of several optimisation techniques introduced by operations researchers and conflict theorists. We use a mediator to protect the negotiating parties from unnecessary disclosure of information to their opponent, while also allowing an objective calculation of maximum joint gains. We separate out attributes that take a finite set of values (simple attributes) from those with continuous values, and we show that for simple attributes, the mediator can determine the Pareto-optimal values. In addition we show that if none of the simple attributes strongly dominates the other simple attributes, then truth telling is an equilibrium strategy for negotiators during the optimisation of simple attributes. We also describe an approach for improving joint gains on non-simple attributes, by moving the parties in a series of steps, towards the Pareto-optimal frontier

A component-based approach to automated web service composition

There is great promise in the idea of having Web services available on the Internet, that can be flexibly composed to achieve more complex services, which can themselves then also be used as components in other contexts. However it is challenging to realise this idea, without essentially programming the composition using some process language such as WS-BPEL or OWL-S process descriptions. This paper presents a mechanism for specifying the external interface to composite and component services, and then deriving an appropriate internal model to realise a functioning composition. We present a conversation specification language for defining interaction protocols and investigate the issue of synchronous and asynchronous communication between the composite service and the component service

Bayesian integration of audio and visual information for multi-target tracking using a CB-member filter

A new method is presented for integration of audio and visual information in multiple target tracking applications. The proposed approach uses a Bayesian filtering formulation and exploits multi-Bernoulli random finite set approximations. The work presented in this paper is the first principled Bayesian estimation approach to solve the sensor fusion problems that involve intermittent sensory data (e.g. audio data for a person who occasionally speaks.) We have examined our method with case studies from the SPEVI database. The results show nearly perfect tracking of people not only when they are silent but also when they are not visible to the camera (but speaking).Reza Hoseinnezhad, Ba-Ngu Vo, Ba-Tuong Vo, David Suterhttp://www.icassp2011.com/en/welcom

A Planarity Test via Construction Sequences

Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests. We give a simple reduction from planarity testing to the problem of computing a certain construction of a 3-connected graph. The approach is different from previous planarity tests; as key concept, we maintain a planar embedding that is 3-connected at each point in time. The algorithm runs in linear time and computes a planar embedding if the input graph is planar and a Kuratowski-subdivision otherwise

Remote Entanglement between a Single Atom and a Bose-Einstein Condensate

Entanglement between stationary systems at remote locations is a key resource for quantum networks. We report on the experimental generation of remote entanglement between a single atom inside an optical cavity and a Bose-Einstein condensate (BEC). To produce this, a single photon is created in the atom-cavity system, thereby generating atom-photon entanglement. The photon is transported to the BEC and converted into a collective excitation in the BEC, thus establishing matter-matter entanglement. After a variable delay, this entanglement is converted into photon-photon entanglement. The matter-matter entanglement lifetime of 100 $\mu$s exceeds the photon duration by two orders of magnitude. The total fidelity of all concatenated operations is 95%. This hybrid system opens up promising perspectives in the field of quantum information

Magnetism of cobalt nanoclusters on graphene on iridium

The structure and magnetic properties of Co clusters, comprising from 26 to 2700 atoms, self-organized or not on the graphene/Ir(111) moir\'e, were studied in situ with the help of scanning tunneling microscopy and X-ray magnetic circular dichroism. Surprisingly the small clusters have almost no magnetic anisotropy. We find indication for a magnetic coupling between the clusters. Experiments have to be performed carefully so as to avoid cluster damage by the soft X-rays

Vitrification of a monatomic 2D simple liquid

A monatomic simple liquid in two dimensions, where atoms interact isotropically through the Lennard-Jones-Gauss potential [M. Engel and H.-R. Trebin, Phys. Rev. Lett. 98, 225505 (2007)], is vitrified by the use of a rapid cooling technique in a molecular dynamics simulation. Transformation to a crystalline state is investigated at various temperatures and the time-temperature-transformation (TTT) curve is determined. It is found that the transformation time to a crystalline state is the shortest at a temerature 14% below the melting temperature Tm and that at temperatures below Tv = 0.6 Tm the transformation time is much longer than the available CPU time. This indicates that a long-lived glassy state is realized for T < Tv.Comment: 5pages,5figures,accepted for publication in CEJ