2,817,081 research outputs found
Reference frames, superselection rules, and quantum information
Recently, there has been much interest in a new kind of ``unspeakable''
quantum information that stands to regular quantum information in the same way
that a direction in space or a moment in time stands to a classical bit string:
the former can only be encoded using particular degrees of freedom while the
latter are indifferent to the physical nature of the information carriers. The
problem of correlating distant reference frames, of which aligning Cartesian
axes and synchronizing clocks are important instances, is an example of a task
that requires the exchange of unspeakable information and for which it is
interesting to determine the fundamental quantum limit of efficiency. There
have also been many investigations into the information theory that is
appropriate for parties that lack reference frames or that lack correlation
between their reference frames, restrictions that result in global and local
superselection rules. In the presence of these, quantum unspeakable information
becomes a new kind of resource that can be manipulated, depleted, quantified,
etcetera. Methods have also been developed to contend with these restrictions
using relational encodings, particularly in the context of computation,
cryptography, communication, and the manipulation of entanglement. This article
reviews the role of reference frames and superselection rules in the theory of
quantum information processing.Comment: 55 pages, published versio
Decision rules and information provision: monitoring versus manipulation
The paper focuses on the organization of institutions designed to
resolve disputes between two parties, when some information is not
veri…able and decision makers may have vested preferences. It shows
that the choice of how much discretional power to grant to the decision
maker and who provides the information are intrinsically related. Direct
involvement of the interested parties in the supply of information
enhances monitoring over the decision maker, although at the cost of
higher manipulation. Thus, it is desirable when the decision maker is
granted high discretion. On the contrary, when the decision maker has
limited discretional power, information provision is better assigned to
an agent with no direct stake. The analysis helps to rationalize some
organizational arrangements that are commonly observed in the context
of judicial and antitrust decision-makin
Lex Informatica: The Formulation of Information Policy Rules through Technology
Historically, law and government regulation have established default rules for information policy, including constitutional rules on freedom of expression and statutory rights of ownership of information. This Article will show that for network environments and the Information Society, however, law and government regulation are not the only source of rule-making. Technological capabilities and system design choices impose rules on participants. The creation and implementation of information policy are embedded in network designs and standards as well as in system configurations. Even user preferences and technical choices create overarching, local default rules. This Article argues, in essence, that the set of rules for information flows imposed by technology and communication networks form a “Lex Informatica” that policymakers must understand, consciously recognize, and encourage
Avoiding Unnecessary Information Loss: Correct and Efficient Model Synchronization Based on Triple Graph Grammars
Model synchronization, i.e., the task of restoring consistency between two
interrelated models after a model change, is a challenging task. Triple Graph
Grammars (TGGs) specify model consistency by means of rules that describe how
to create consistent pairs of models. These rules can be used to automatically
derive further rules, which describe how to propagate changes from one model to
the other or how to change one model in such a way that propagation is
guaranteed to be possible. Restricting model synchronization to these derived
rules, however, may lead to unnecessary deletion and recreation of model
elements during change propagation. This is inefficient and may cause
unnecessary information loss, i.e., when deleted elements contain information
that is not represented in the second model, this information cannot be
recovered easily. Short-cut rules have recently been developed to avoid
unnecessary information loss by reusing existing model elements. In this paper,
we show how to automatically derive (short-cut) repair rules from short-cut
rules to propagate changes such that information loss is avoided and model
synchronization is accelerated. The key ingredients of our rule-based model
synchronization process are these repair rules and an incremental pattern
matcher informing about suitable applications of them. We prove the termination
and the correctness of this synchronization process and discuss its
completeness. As a proof of concept, we have implemented this synchronization
process in eMoflon, a state-of-the-art model transformation tool with inherent
support of bidirectionality. Our evaluation shows that repair processes based
on (short-cut) repair rules have considerably decreased information loss and
improved performance compared to former model synchronization processes based
on TGGs.Comment: 33 pages, 20 figures, 3 table
Temporal fuzzy association rule mining with 2-tuple linguistic representation
This paper reports on an approach that contributes towards the problem of discovering fuzzy association rules that exhibit a temporal pattern. The novel application of the 2-tuple linguistic representation identifies fuzzy association rules in a temporal context, whilst maintaining the interpretability of linguistic terms. Iterative Rule Learning (IRL) with a Genetic Algorithm (GA) simultaneously induces rules and tunes the membership functions. The discovered rules were compared with those from a traditional method of discovering fuzzy association rules and results demonstrate how the traditional method can loose information because rules occur at the intersection of membership function boundaries. New information can be mined from the proposed approach by improving upon rules discovered with the traditional method and by discovering new rules
- …