Parity-dependent State Engineering and Tomography in the ultrastrong coupling regime

Reaching the strong coupling regime of light-matter interaction has led to an impressive development in fundamental quantum physics and applications to quantum information processing. Latests advances in different quantum technologies, like superconducting circuits or semiconductor quantum wells, show that the ultrastrong coupling regime (USC) can also be achieved, where novel physical phenomena and potential computational benefits have been predicted. Nevertheless, the lack of effective decoupling mechanism in this regime has so far hindered control and measurement processes. Here, we propose a method based on parity symmetry conservation that allows for the generation and reconstruction of arbitrary states in the ultrastrong coupling regime of light-matter interactions. Our protocol requires minimal external resources by making use of the coupling between the USC system and an ancillary two-level quantum system.

Information Fusion and Hierarchical Knowledge Discovery by ARTMAP Neural Networks

Mapping novel terrain from sparse, complex data often requires the resolution of conflicting information from sensors working at different times, locations, and scales, and from experts with different goals and situations. Information fusion methods help resolve inconsistencies in order to distinguish correct from incorrect answers, as when evidence variously suggests that an object's class is car, truck, or airplane. The methods developed here consider a complementary problem, supposing that information from sensors and experts is reliable though inconsistent, as when evidence suggests that an objects class is car, vehicle, or man-made. Underlying relationships among objects are assumed to be unknown to the automated system of the human user. The ARTMAP information fusion system uses distributed code representations that exploit the neural network's capacity for one-to-many learning in order to produce self-organizing expert systems that discover hierarchial knowledge structures. The system infers multi-level relationships among groups of output classes, without any supervised labeling of these relationships. The procedure is illustrated with two image examples.

Self-Organizing Information Fusion and Hierarchical Knowledge Discovery: A New Framework Using Artmap Neural Networks

Classifying novel terrain or objects from sparse, complex data may require the resolution of conflicting information from sensors woring at different times, locations, and scales, and from sources with different goals and situations. Information fusion methods can help resolve inconsistencies, as when eveidence variously suggests that and object's class is car, truck, or airplane. The methods described her address a complementary problem, supposing that information from sensors and experts is reliable though inconsistent, as when evidence suggests that an object's class is car, vehicle, and man-made. Underlying relationships among classes are assumed to be unknown to the autonomated system or the human user. The ARTMAP information fusion system uses distributed code representations that exploit the neural network's capacity for one-to-many learning in order to produce self-organizing expert systems that discover hierachical knowlege structures. The fusion system infers multi-level relationships among groups of output classes, without any supervised labeling of these relationships. The procedure is illustrated with two image examples, but is not limited to image domain.

Information relaxations and duality in stochastic dynamic programs

We describe a general technique for determining upper bounds on maximal values (or lower bounds on minimal costs) in stochastic dynamic programs. In this approach, we relax the nonanticipativity constraints that require decisions to depend only on the information available at the time a decision is made and impose a "penalty" that punishes violations of nonanticipativity. In applications, the hope is that this relaxed version of the problem will be simpler to solve than the original dynamic program. The upper bounds provided by this dual approach complement lower bounds on values that may be found by simulating with heuristic policies. We describe the theory underlying this dual approach and establish weak duality, strong duality, and complementary slackness results that are analogous to the duality results of linear programming. We also study properties of good penalties. Finally, we demonstrate the use of this dual approach in an adaptive inventory control problem with an unknown and changing demand distribution and in valuing options with stochastic volatilities and interest rates. These are complex problems of significant practical interest that are quite difficult to solve to optimality. In these examples, our dual approach requires relatively little additional computation and leads to tight bounds on the optimal values. © 2010 INFORMS.

A Context-Dependent Algorithm for Merging Uncertain Information in Possibility Theory

The need to merge multiple sources of uncertaininformation is an important issue in many application areas,especially when there is potential for contradictions betweensources. Possibility theory offers a flexible framework to represent,and reason with, uncertain information, and there isa range of merging operators, such as the conjunctive anddisjunctive operators, for combining information. However, withthe proposals to date, the context of the information to be mergedis largely ignored during the process of selecting which mergingoperators to use. To address this shortcoming, in this paper,we propose an adaptive merging algorithm which selects largelypartially maximal consistent subsets (LPMCSs) of sources, thatcan be merged through relaxation of the conjunctive operator, byassessing the coherence of the information in each subset. In thisway, a fusion process can integrate both conjunctive and disjunctiveoperators in a more flexible manner and thereby be morecontext dependent. A comparison with related merging methodsshows how our algorithm can produce a more consensual result.

Information gathering and decision making about resource value in animal contests

Contestants are predicted to adjust the cost of a fight in line with the perceived value of the resource and this provides a way of determining whether the resource has been assessed. An assessment of resource value is predicted to alter an animal's motivational state and we note different methods of measuring that state. We provide a categorical framework in which the degree of resource assessment may be evaluated and also note limitations of various approaches. We place studies in six categories: (1) cases of no assessment, (2) cases of internal state such as hunger influencing apparent value, (3) cases of the contestants differing in assessment ability, (4) cases of mutual and equal assessment of value, (5) cases where opponents differ in resource value and (6) cases of particularly complex assessment abilities that involve a comparison of the value of two resources. We examine the extent to which these studies support game theory predictions and suggest future areas of research. (C) 2008 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Impact of operator experience on information feedback and reusability

Keeping a record of operator experience remains a challenge to operation management and a major source of inefficiency in information management. The objective is to develop a framework that enables an explicit presentation of experience based on information use. A purposive sampling method is used to select four small and medium-sized enterprises as case studies. The unit of analysis is the production process in the machine shop. Data collection is by structured interview, observation and documentation. A comparative case analysis is applied. The findings suggest experience is an accumulation of tacit information feedback, which can be made explicit in information use interoperatability matrix. The matrix is conditioned upon information use typology, which is strategic in waste reduction. The limitations include difficulty of participant anonymity where the organisation nominates a participant. Areas for further research include application of the concepts to knowledge management and shop floor resource management.

Information Gathering and Processing with Fluorescent Molecules

Molecular information gathering and processing – a young field of applied chemistry - is undergoing good growth. The progress is occurring both in terms of conceptual development and in terms of the strengthening of older concepts with new examples. This review critically surveys these two broad avenues. We consider some cases where molecules emulate one of the building blocks of electronic logic gates. We then examine molecular emulation of various Boolean logic gates carrying one, two or three inputs. Some single-input gates are popular information gathering devices. Special systems, such as ‘lab-on-a-molecule’ and molecular keypad locks, also receive attention. A situation deviating from the Boolean blueprint is also discussed. Some pointers are offered for maintaining the upward curve of the field.

Autonomous guided vehicles applied to industrial engineering and management studies

This article presents a framework to an Industrial Engineering and Management Science course from School of Management and Industrial Studies using Autonomous Ground Vehicles (AGV) to supply materials to a production line as an experimental setup for the students to acquire knowledge in the production robotics area. The students must be capable to understand and put into good use several concepts that will be of utmost importance in their professional life such as critical decisions regarding the study, development and implementation of a production line. The main focus is a production line using AGVs, where the students are required to address several topics such as: sensors actuators, controllers and an high level management and optimization software. The presented framework brings to the robotics teaching community methodologies that allow students from different backgrounds, that normally don’t experiment with the robotics concepts in practice due to the big gap between theory and practice, to go straight to ”making” robotics. Our aim was to suppress the minimum start point level thus allowing any student to fully experience robotics with little background knowledge.

Information Exchange and Fusion in Dynamic and Heterogeneous Distributed Environments

Context awareness, dynamic reconfiguration at runtime and heterogeneity are key characteristics of future distributed systems, particularly in ubiquitous and mobile computing scenarios. The main contributions of this dissertation are theoretical as well as architectural concepts facilitating information exchange and fusion in heterogeneous and dynamic distributed environments. Our main focus is on bridging the heterogeneity issues and, at the same time, considering uncertain, imprecise and unreliable sensor information in information fusion and reasoning approaches. A domain ontology is used to establish a common vocabulary for the exchanged information. We thereby explicitly support different representations for the same kind of information and provide Inter-Representation Operations that convert between them. Special account is taken of the conversion of associated meta-data that express uncertainty and impreciseness. The Unscented Transformation, for example, is applied to propagate Gaussian normal distributions across highly non-linear Inter-Representation Operations. Uncertain sensor information is fused using the Dempster-Shafer Theory of Evidence as it allows explicit modelling of partial and complete ignorance. We also show how to incorporate the Dempster-Shafer Theory of Evidence into probabilistic reasoning schemes such as Hidden Markov Models in order to be able to consider the uncertainty of sensor information when deriving high-level information from low-level data. For all these concepts we provide architectural support as a guideline for developers of innovative information exchange and fusion infrastructures that are particularly targeted at heterogeneous dynamic environments. Two case studies serve as proof of concept. The first case study focuses on heterogeneous autonomous robots that have to spontaneously form a cooperative team in order to achieve a common goal. The second case study is concerned with an approach for user activity recognition which serves as baseline for a context-aware adaptive application. Both case studies demonstrate the viability and strengths of the proposed solution and emphasize that the Dempster-Shafer Theory of Evidence should be preferred to pure probability theory in applications involving non-linear Inter-Representation Operations.

Torque in mooring chain. Part 1: Background and theory

Chain in both its forms - common (or stud-less) and stud-link - has many engineering applications. It is widely used as a component in the moorings of offshore floating systems, where its ruggedness and corrosion resistance make it an attractive choice. Chain exhibits some interesting behaviour in that when straight and subject to an axial load it does not twist or generate any torque, but if twisted or loaded when in a twisted condition it behaves in a highly non-linear manner, with the torque dependent upon the level of twist and axial load. Clearly an understanding of the way in which chains may behave and interact with other mooring components (such as wire rope, which also exhibits coupling between axial load and generated torque) when they are in service is essential. However, the sizes of chain that are in use in offshore moorings (typical bar diameters are 75 mm and greater) are too large to allow easy testing. This paper, which is in two parts, aims to address the issues and considerations relevant to torque in mooring chain. The first part introduces a frictionless theory that predicts the resultant torques and 'lift' in the links as non-dimensionalized functions of the angle of twist. Fortran code is presented in an Appendix, which allows the reader to make use of the analysis. The second part of the paper presents results from experimental work on both stud-less (41 mm) and stud-link (20.5 and 56 mm) chains. Torsional data are presented in both 'constant twist' and 'constant load' forms, as well as considering the lift between the links.