Filters








8,037 Hits in 3.0 sec

Informational Reinterpretation of the Mechanics Notions and Laws

Edward Bormashenko
2020 Entropy  
The Szilard single-particle minimal thermal engine undergoes isobaric expansion relative to accelerated frame of references, enabling the erasure of 1 bit of information.  ...  Inertial forces may be involved in the erasure/recording of information. The analysis of the minimal Szilard thermal engine as seen from the noninertial frame of references is carried out.  ...  The author is indebted to anonymous reviewers for extremely fruitful and instructive suggestions. Conflicts of Interest: The author declares no conflict of interest.  ... 
doi:10.3390/e22060631 pmid:33286403 pmcid:PMC7517165 fatcat:fmr7cnoq75czlbpucniljrpzle

Action Theory Evolution [article]

Ivan Varzinczak
2008 arXiv   pre-print
Its contribution is threefold: first we revisit the semantics of action theory contraction that has been done in previous work, giving more robust operators that express minimal change based on a notion  ...  Finally we state postulates for action theory contraction and assess the behavior of our operators w.r.t. them.  ...  Acknowledgements The author is grateful to Arina Britz and Ken Halland for proofreading an earlier version of this article. Their comments helped very much in improving the text.  ... 
arXiv:0811.1878v1 fatcat:wbm3olbyxzekrjfknpj6tkylym

A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange [article]

Ahmed Douik, Sameh Sorour, Hamidou Tembine, Mohamed-Slim Alouini, and Tareq Y. Al-Naffouri
2014 arXiv   pre-print
Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system.  ...  In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized  ...  We assume that the packet erasure probability remains constant during a delivery period and change from iteration to iteration while keeping its mean, P of the player-player and Q for the base BS-players  ... 
arXiv:1404.3945v1 fatcat:fubkdhnwczd3nhcqit5sa5en44

On Action Theory Change

I. J. Varzinczak
2010 The Journal of Artificial Intelligence Research  
Its contribution is threefold: first we revisit the semantics of action theory contraction proposed in previous work, giving more robust operators that express minimal change based on a notion of distance  ...  As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated.  ...  Special thanks to my colleagues at the Meraka Institute Arina Britz, Ken Halland, Johannes Heidema and Tommie Meyer for their invaluable comments and suggestions on earlier versions of this article.  ... 
doi:10.1613/jair.2959 fatcat:6k4p7fm6o5flthazursuyuhlfu

Algorithmic Information Content, Church — Turing Thesis, Physical Entropy, and Maxwell's Demon [chapter]

Wojciech H. Zurek
1991 Information Dynamics  
Thus, it cannot be sufficiently "selective" about its actions to create and maintain temperature or pressure differences in a closed system.  ...  theory at the disposal of the algorithmic information theory.  ...  ACKNOWLEDGMENTS I would liketo thank CharlesBennett,Carl Caves,Stirling Colgate,Doyne Farmer,Murray Gell-Mann,James Hartle, RollLandauer,Seth Lloyd,BillUnruh, and _IohnWheeler forstimulating and enjoyable  ... 
doi:10.1007/978-1-4899-2305-9_20 fatcat:iw7gjbhhkje7xe5w3dlfy7g2qe

A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications

Ahmed Douik, Sameh Sorour, Hamidou Tembine, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini
2017 IEEE Transactions on Mobile Computing  
This paper investigates the delay minimization problem for instantly decodable network coding (IDNC) based deviceto-device (D2D) communications.  ...  Learning algorithms are proposed for systems with complete and incomplete information, and for the imperfect feedback scenario.  ...  The packet erasure probability is assumed to remains constant during a delivery period and change from iteration to iteration while keeping its mean, P of the player-player and Q for the base BS-players  ... 
doi:10.1109/tmc.2016.2586068 fatcat:bauoifthozbytmasnu7r5zv26a

A Game-Theoretic Framework for Decentralized Cooperative Data Exchange using Network Coding [article]

Ahmed Douik and Sameh Sorour and Hamidou Tembine and Tareq Y. Al-Naffouri and Mohamed-Slim Alouini
2014 arXiv   pre-print
Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system.  ...  In this paper, we introduce a game theoretic framework for studying the problem of minimizing the delay of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized  ...  We assume that the packet erasure probability remains constant during a delivery period and change from iteration to iteration while keeping its mean, P of the player-player and Q for the base BS-players  ... 
arXiv:1404.3637v1 fatcat:dbpzztl6rbe7ll3slrbyxmxetu

Improving Network Performances by Integrating Erasure Coding and Game Theory Techniques in Random Access Protocols

Mohamed Lamine Boucenna, Hadj Batatia, Malek Benslama
2013 Research Journal of Applied Sciences Engineering and Technology  
To analyze such conflicting situations where the action of one node has an impact on the other nodes' actions, we add a complementary solution, which is based on the game theory technique of acquiring  ...  The first consists of the integration of the erasure coding scheme in this protocol to recover collided packets and to reduce the rate of collision between transmitted packets.  ...  Use of our proposed solutions based on erasure coding and game theory makes the Aloha and CSMA protocols stronger and able to resist many collisions.  ... 
doi:10.19026/rjaset.6.3675 fatcat:27b4746hqvfebmh26tic6nor7q

Conditional Action and Imperfect Erasure of Qubits

Heinz-Jürgen Schmidt
2021 Entropy  
We consider state changes in quantum theory due to "conditional action" and relate these to the discussion of entropy decrease due to interventions of "intelligent beings" and the principles of Szilard  ...  The mathematical theory of conditional actions is a special case of the theory of "instruments", which describes changes of state due to general measurements and will therefore be briefly outlined in the  ...  If memory erasure itself were taken as a conditional action, we would seem to enter an infinite circle of creating and erasing new memory contents.  ... 
doi:10.3390/e23030289 pmid:33652928 fatcat:ceyvdsmbqvgvxgv623on2l763y

Work extraction and fully entangled fraction

Chung-Yun Hsieh, Ray-Kuang Lee
2017 Physical Review A  
For a bipartite state with equal local dimension d, we prove that one can obtain work gain under Landauer's erasure process on one party in identically and independently distributed (iid) limit when the  ...  As a step to link quantum thermodynamics and quantum nonlocality, we also provide a simple picture to approximate the optimal work extraction and suggest a potential thermodynamic interpretation of fully  ...  Hence, we assume no energy change of the observer in this action. We use A T to denote the set of all actions of this type with temperature T . (c) Unitary operations.  ... 
doi:10.1103/physreva.96.012107 fatcat:3l5mvvtvfbcefmdu54f46kuqyu

Physical Cost of Erasing Quantum Correlation [article]

Arun Kumar Pati
2012 arXiv   pre-print
Here, we show that change in quantum correlation is never larger than the total entropy change of the system and the environment.  ...  Erasure of information stored in a quantum state requires energy cost and is inherently an irreversible operation.  ...  Sen De and U. Sen for useful discussions.  ... 
arXiv:1208.4804v1 fatcat:zl6w5k6s2ngzbddx3cfylsvfxu

Completion Delay Minimization for Instantly Decodable Network Codes [article]

Sameh Sorour, Shahrokh Valaee
2012 arXiv   pre-print
In this paper, we consider the problem of minimizing the completion delay for instantly decodable network coding (IDNC), in wireless multicast and broadcast scenarios.  ...  We are interested in this class of network coding due to its numerous benefits, such as low decoding delay, low coding and decoding complexities and simple receiver requirements.  ...  , that change from frame to frame while keeping the average erasure probability (p) and average demand ratio (µ) constant.  ... 
arXiv:1201.4768v1 fatcat:g2lpu7ooj5c5lnretqa234qhqm

Variations on a Demonic Theme: Szilard's Other Engines [article]

Kyle J. Ray, James P. Crutchfield
2020 arXiv   pre-print
bounds and so it is a minimal, optimal implementation.  ...  maps that implement the thermodynamic transformations of measurement, control, and erasure; (ii) its transitory functioning as an engine that converts disorganized heat energy to work is governed by the  ...  This material is based upon work supported by, or in part by, FQXi Grants FQXi-RFP-1609 and FQXi-RFP-IPW-1902, the John Templeton Foundation grant 52095, and U.S. Army Research Laboratory and the U.  ... 
arXiv:2003.09990v1 fatcat:f7ekh7yygnabbowjyb3kn3vgki

BLACK HOLE AS AN INFORMATION ERASER

HYEONG-CHAN KIM, JAE-WEON LEE, JUNGJAI LEE
2010 Modern Physics Letters A  
The term "most efficient" implies that minimal energy is required to erase a given amount of information.  ...  We calculate the discrete mass spectra and the entropy of a Schwarzschild black hole assuming that the black hole processes information in unit of bits.  ...  [11] , it is conjectured, on the base of the relation between the entropy and the action, that in a fundamental theory the ground state entanglement entropy per unit area equals k B c 3 /(4G ).  ... 
doi:10.1142/s0217732310033347 fatcat:jt2kva2qlfhtvlbvwpbmy4ya54

Can memory erasure contribute to a virtuous tempering of emotions?

Aleksandar Fatic
2019 Filozofija i Društvo  
Thomas Aquinas), where excessive suffering and inability to forgive oneself for one's actions is an impediment to the achivement of tranquility of mind and spiritual redemption, rather than a prerequisite  ...  Its central question is whether a safe and reliable technology of memory erasure, once it is available, would be acceptable from a Christian ethics point of view.  ...  arrive at an emotional stage where they can change their ways, while achieving at least a minimally functional emotional equilibrium.  ... 
doi:10.2298/fid1902257f fatcat:leq2qxndcjev5bvkbtmwlmx52y
« Previous Showing results 1 — 15 out of 8,037 results