Bits Of Information Research Articles

基于两光子偏振-空间模超纠缠态的高容量的量子秘密共享协议

<p indent="0mm">This paper proposes a feasible high-capacity tripartite quantum secret sharing protocol based on the two-photon polarization-spatial-mode hyperentangled state. Alice, the secret owner, prepares polarization-spatial-mode hyperentangled photon pairs and distributes them to two agents, Bob and Charlie. Using nonlocal complete Bell state analysis technology assisted by spatial mode entanglement, the two agents can collaborate to distinguish Alice’s Bell state in polarization degree of freedom. Only linear optical elements are needed to construct the agents’ measuring devices, which makes the protocol more feasible in experimental implementation. Compared with the existing quantum secret sharing protocols based on two-photon entanglement, this scheme does not need two-way quantum communication and has high capacity because it can transmit two bits of information with a polarization-spatial-mode hyperentangled photon pair. The proposed quantum secret sharing protocol is secure and reliable due to error correction and privacy amplification technology.

STEGANOGRAPHIC EMBEDDING OF DATA IN HTML DOCUMENT CODE

A two-key scheme for concealed embedding of data in open source HTML pages is proposed. The first key is used to encrypt the embedded message. The second key is required to encode the hidden message. The body structure of a web page is a tag tree. The embedding algorithm uses class tags. Empty classes do not affect the display of a web page in a browser. Hidden data is encoded by adding new vertices to the tag tree. New vertices are added to the leaf vertices of the page that serves as the container. There are leaf vertices that exclude the addition of empty classes to them. Each tag encodes eight bits of hidden information. The embed key is used to form class names that include new tags. Class names are disguised as the framework used on the web page. Names are generated using a hash function and an embedding key. The message extraction algorithm is based on knowledge of embedding and encryption keys by the receiving subscriber. The algorithm for extracting data boils down to searching for tags by their names and then decoding them. The developed algorithm can be used for transmitting hidden messages on the Internet. The proposed algorithm is open. Resistance is ensured by the secrecy of encryption and embedding keys. Direct enumeration is necessary to hack the system if the tag embedding key is unknown. The algorithm for forming class names does not violate the statistical patterns of the legal class names set. Resistance is provided by the key retention policy. The average throughput of the algorithm is 0,003 bits per byte.

Generalized Landauer Bound for Information Processing: Proof and Applications.

A generalized form of Landauer's bound on the dissipative cost of classical information processing in quantum-mechanical systems is proved using a new approach. This approach sidesteps some prominent objections to standard proofs of Landauer's bound-broadly interpreted here as a nonzero lower bound on the amount of energy that is irreversibly transferred from a physical system to its environment for each bit of information that is lost from the system-while establishing a far more general result. Specializations of our generalized Landauer bound for ideal and non-ideal information processing operations, including but not limited to the simplified forms for erasure and logical operations most familiar from the literature, are presented and discussed. These bounds, taken together, enable reconsideration of the links between logical reversibility, physical reversibility, and conditioning of operations in contexts that include but are far more general than the thermodynamic model systems that are most widely invoked in discussions of Landauer's Principle. Because of the strategy used to prove the generalized bounds and these specializations, this work may help to illuminate and resolve some longstanding controversies related to dissipation in computation.

Phase-transition-like behavior in information retrieval of a quantum scrambled random circuit system

Information in a chaotic quantum system will scramble across the system, preventing any local measurement from reconstructing it. The scrambling dynamics is key to understanding a wide range of quantum many-body systems. Here we use Holevo information to quantify the scrambling dynamics, which shows a phase-transition-like behavior. When applying long random Clifford circuits to a large system, no information can be recovered from a subsystem of less than half the system size. When exceeding half the system size, the amount of stored information grows by two bits of classical information per qubit until saturation through another sharp unanalytical change. We also study critical behavior near the transition points. Finally, we use coherent information to quantify the scrambling of quantum information in the system, which shows similar phase-transition-like behavior.

The Interpretation of Graphical Information in Word Processing

Word processing is one of the most popular digital activities. Despite its popularity, it is haunted by false assumptions, misconceptions, and ineffective and inefficient practices leading to erroneous digital text-based documents. The focus of the present paper is automated numbering and distinguishing between manual and automated numbering. In general, one bit of information on the GUI—the position of the cursor—is enough to tell whether a numbering is manual or automated. To decide how much information must be put on the channel—the teaching–learning process—in order to reach end-users, we designed and implemented a method that includes the analysis of teaching, learning, tutorial, and testing sources, the collection and analysis of Word documents shared on the internet or in closed groups, the testing of grade 7–10 students’ knowledge in automated numbering, and calculating the entropy of automated numbering. The combination of the test results and the semantics of the automated numbering was used to measure the entropy of automated numbering. It was found that to transfer one bit of information on the GUI, at least three bits of information must be transferred during the teaching–learning process. Furthermore, it was revealed that the information connected to numbering is not the pure use of tools, but the semantics of this feature put into a real-world context.

Programmable Parallel Optical Logic Gates on a Multimode Waveguide Engine

Optical logic gates have been proposed and demonstrated on a function programmable waveguide engine constructed using buried silicon nitride waveguides in polymer and a set of thermal electrodes. The device can perform logic AND or OR operations for the input signals A and B, each containing two bits of information, in parallel. The input signals, in the form of binary current values in the electronic domain, are applied to a subset of thermal electrodes, while the computed logic states are converted to optical intensity variations at the single-mode waveguide outputs. The rest of the electrodes work as weights to define the device function, either AND or OR, by adjusting the light interference in the multimode waveguide through thermo-optic effect. Simulations were first performed to reveal the nonlinear response of the received light intensity with respect to the applied current, thus allowing complex and effective manipulation of the light field on the waveguide engine. After chip fabrication and system integration, 65,536 experiments were performed automatically. The data are fed into a sorting program to find the valid settings that satisfy the respective truth table out of the 283,852,800 possible input/weight/output combinations. Four cases of operations for the AND and OR gates are presented in the end, with different bar and contrast values. This simple, low-cost yet powerful engine may be further developed for applications in on-chip photonic computing and signal switching.

Low‐cost regional‐based congestion‐aware routing algorithm for 2D mesh NoC

SummaryGiven the advantages of network‐on‐chips (NoCs), they are rapidly improving to replace other forms of System‐on‐Chip (SoC) designs. Although various factors improve the NoC's performance, many challenges should be addressed when designing an NoC, one of which is congestion and its impacts on performance and efficiency. Hence, numerous routing algorithms have been proposed that contemplate the congestion influences to deal with its complexities. Nevertheless, given the significant impacts of overheads on performance and efficiency, it is crucial to consider them when designing an enhanced NoC. The proposed routing algorithm employs regional traffic information within multiple clusters and has a decent view of the traffic condition when choosing the path to the destination. Each node generates one bit of traffic information and propagates it only when the node is congested, thus preventing the information overhead. Finally, the path diversity parameter is utilized to identify the best route from the source to the destination. The proposed algorithm's results show that the number of received packets, average latency, average throughput, maximum latency, and energy consumption while using different traffic patterns are improved by 10.9%, 35.3%, 15.8%, 43%, and 15.3%, respectively.

Bit Error Rate Analysis of Physical Layer Network Coding Spatially Modulated Full-Duplex Nodes Based Bidirectional Wireless Relay Network

In this paper, Physical Layer Network coding (PLNC)-Spatially Modulated Full-Duplex (SMFD) nodes based two-way/bidirectional cooperative wireless relay network is proposed. The PLNC-SMFD-based system is a viable technology in the field of next-generation wireless networks to enhance spectral efficiency. In the proposed system model, both the source nodes and relay nodes are employed with 2 × 2 antenna configurations where 2 bits of information are exchanged between the source nodes through a relay node. Transmit antenna selection at the source nodes is based on the incoming bitstreams. For instance, the transmit antenna is selected at PLNC-SMFD nodes based on the data symbols of the Most Significant Bit (MSB). Whereas the selected transmit antenna sends the Least Significant Bit (LSB) bit of data symbol at any time instance. Further, the self-interference at the transmitting and receiving nodes is modeled as Gaussian with the thermal noise power as a variance. The Bit Error Rate (BER) analytical expressions for both the upper and lower bound are derived in a Rayleigh Fading channel background. It has been graphically shown that the BER performance of the proposed system analyzes the effect of self-interference.

Encrypting security for virtualized environments in big data storage with generalized anonymization strategies

Big data security has grown in importance as a result of its strong correlation to users. Because big data contains individually identifying information, it poses a considerable safety issue. To protect personal information, data confidentiality is commonly employed in non-interactive information sharing and transmission settings. This entails hiding identifiable and confidential material from the owners of acquired data.Anonymization is a computational technology that eliminates or alters personal identifying details, resulting in anonymous data which cannot be linked to every single citizen. The anonymization method enables the release of knowledge, allowing for study and assurance. Privacy protection protects sensitive data from a range of threats. Utilizing data encryption and data anonymization is indeed the method of making modifications to the information to be utilised or used in a method which will avoid pertinent data from being identified. Several organisations make data available anonymously to the general public. Employing data anonymization, important bits of private information are masked in order to protect private information.Anonymous data may be stored and accessed in the cloud without fear of being intercepted by others. Anonymization protects against data abuse and insider exploit hazards that lead to regulatory compliance loss.

Succinct Permutation Graphs

We present a succinct data structure for permutation graphs, and their superclass of circular permutation graphs, i.e., data structures using optimal space up to lower order terms. Unlike concurrent work on circle graphs (Acan et al. in Theor Comput Sci, https://doi.org/10.1016/j.tcs.2022.06.022, 2022), our data structure also supports distance and shortest-path queries, as well as adjacency and neighborhood queries, all in optimal time. We present in particular the first succinct exact distance oracle for (circular) permutation graphs. A second succinct data structure also supports degree queries in time independent of the neighborhood’s size at the expense of an O(log n/log log n)-factor overhead in all running times. Furthermore, we develop a succinct data structure for the class of bipartite permutation graphs. We demonstrate how to run algorithms directly over our succinct representations for several problems on permutation graphs: Clique, Coloring, Independent Set, Hamiltonian Cycle, All-Pair Shortest Paths, and others. Finally, we initiate the study of semi-distributed graph representations; a concept that smoothly interpolates between distributed (labeling schemes) and centralized (standard data structures). We show how to turn some of our data structures into semi-distributed representations by storing only O(n) bits of additional global information, circumventing the lower bound on distance labeling schemes for permutation graphs.

Two-digit Quantum-dot Cells Multiplier

The arrival of the era of nanotechnology was stimulated to the greatest extent by the high rate of development of CMOS-microelectronics. Currently, complementary metal–oxide–semiconductor components have reached quantum-technological limits. In digital nanoelectronics, one bit of information is given by one electron. In the work, computer design using computer-aided design QCADisigner of single-electron arithmetic-logic nanocircuits based on quantum cellular automata is performed. Fragments of three- and five-inputs universal majority elements are used as the basis. It has been proven that the defining property of this class of nanodevices is the group behavior of cells, which is reproduced by the logic of majority functions. The development single-electron full nanoadder and double-bits multiplier have the smallest possible technological nanosizes, ultra-high speed and minimum switching energy consumption.

Design of digital image encryption based on elliptic curve cryptography (ECC) algorithm and Radix-64 conversion

The billions of bits of information are transferred each second through the internet every day. The information may be text, image, audio or video etc, accordingly, we need some protection mechanism while sharing confidential data. Generally, RSA algorithm is used for encrypting the Secret images. However, the security provided by Elliptic Curve Cryptography (ECC) is higher with lower sized key than the RSA algorithm. So, this article proposes an extended Elliptic Curve encryption approach for encrypting the secret images. In this system, the secret image is partitioned into three color image planes such as Red, Green and Blue. By applying Radix-64 encoding and Mapping table, these planes are converted into elliptic curve points and then these points are encrypted using ECC algorithm. Again, these points are applied to the Radix-64 decoding and the mapping table to get ciphered-image. At last, the key parameters such as a, b, p and Generator point (G) are embedded in the last four pixel positions of the ciphered-image. In order to get the original secret image, the recipient must extract these key parameters from the encrypted image and then apply the remaining processes to the encrypted image in the opposite order. Experimental results tested using MATLAB R2021b and it shows that the NPCR and UACI values are 99.54% and 28.73 % and better quality feature is attained since the entropy value is almost closer to eight. So, the proposed image encryption has robust capacity to fight against the differential attack.

Speed Limit for a Highly Irreversible Process and Tight Finite-Time Landauer's Bound.

Landauer's bound is the minimum thermodynamic cost for erasing one bit of information. As this bound is achievable only for quasistatic processes, finite-time operation incurs additional energetic costs. We find a tight finite-time Landauer's bound by establishing a general form of the classical speed limit. This tight bound well captures the divergent behavior associated with the additional cost of a highly irreversible process, which scales differently from a nearly irreversible process. We also find an optimal dynamics which saturates the equality of the bound. We demonstrate the validity of this bound via discrete one-bit and coarse-grained bit systems. Our Letter implies that more heat dissipation than expected occurs during high-speed irreversible computation.

Shakespeare’s Sonnets: on the translations new and newly found. W. Shakespeare, Sonnets 75–86 translated by M. Kuzmin

In various publications on the history of the first Soviet academic Shakespeare (1936–1949) there flashed bits of information that Mikhail Kuzmin’s translation of the Sonnets was coming. He must have made considerable progress because by 1932 more than half of the job was rumoured to have been done. After Kuzmin’s death in 1936 and a pause in the work on the edition during the war years, his translations were lost, and for the final volume (1949) S. Marshak had translated the whole sequence. Recently 89 sonnets translated by Kuzmin have been found in a private collection. Now we publish Sonnets 75–86, a group known as connected with the ‘rival poet.’ In the preface to the publication, Kuzmin’s work is being analysed. Though unfinished and unedited (the process of editing translations in the academic collected works of Shakespeare was famous for its expert and hypercritical attention), Kuzmin’s translation presents the process of a stylistic search with its evident losses alongside the achievements that even 90 years since might claim to be among the best Shakespeare’s sonnets in Russian.

A one-bit, comparison-based gradient estimator

We study zeroth-order optimization for convex functions where we further assume that function evaluations are unavailable. Instead, one only has access to a $\textit{comparison oracle}$, which given two points $x$ and $y$ returns a single bit of information indicating which point has larger function value, $f(x)$ or $f(y)$. By treating the gradient as an unknown signal to be recovered, we show how one can use tools from one-bit compressed sensing to construct a robust and reliable estimator of the normalized gradient. We then propose an algorithm, coined SCOBO, that uses this estimator within a gradient descent scheme. We show that when $f(x)$ has some low dimensional structure that can be exploited, SCOBO outperforms the state-of-the-art in terms of query complexity. Our theoretical claims are verified by extensive numerical experiments.

Reflector Antennas Characterization and Diagnostics Using a Single Set of Far-Field Phaseless Data and Crosswords-Like Processing

We introduce and discuss a new approach to the phase retrieval of fields radiated by continuous aperture sources having a circular support, which is of interest in many applications including the detection of shape deformations on reflector antennas. The approach is based on a decomposition of the actual 2-D problem into a number of 1-D phase retrieval problems along diameters and concentric rings of the visible part of the spectrum. In particular, the 1-D problems are effectively solved by using the spectral factorization method, while discrimination arguments at the crossing points allows to complete the retrieval of the 2-D complex field. The proposed procedure, which just requires a single set of far field amplitudes, takes advantage from up to now unexplored field properties and it is assessed in terms of reflector aperture fields.

Evaluation of multi-bit domain wall motion by low current density to obtain ultrafast data rate in a compensated ferrimagnetic wire

Architectures based on multi-bit magnetic domain walls (DWs) take advantage of the fast speed, high density, nonvolatility, and flexible design of DWs to process and store data bits. However, controlling multi-bit DWs driven by electric current at an ideal position remains a significant challenge for developing integrated spintronic applications with high reliability and low power consumption. We exhibit the possibility of driving fast and stable multi-bit DWs at low current density without an in-plane external magnetic field in Fe-rich GdFeCo magnetic wires. When an in-plane magnetic field is applied in the wire direction, the front edge accelerates, although the rear edge decelerates, and the recorded data are destroyed. Hence, this method is not practical. Here, the DW speed of the multi-bit DWs is 1500 m/s under a low current density of 29 × 1010 (A/m2). A straight DW shape is required to accurately read the bits of information by the tunneling magnetoresistance head in real DW memory devices. Moreover, we demonstrate that the DW position is related to the DW shape after injecting a pulse current into the magnetic wire. A straight DW shape is exhibited for 3 ns pulse duration width, while the DW shape became rounded for 30 and 50 ns pulse duration widths. Our finding provides a practical concept for multiple-bit-per-cell memory and presents a viable platform for DW memory applications.

Dana H by Lucas Hnath, and: Is This a Room by Tina Satter

Reviewed by: Dana H by Lucas Hnath, and: Is This a Room by Tina Satter Barbara Fuchs DANA H. By Lucas Hnath. Directed by Les Waters. The Vineyard Theatre, New York City. October 27, 2021. IS THIS A ROOM. Conceived and directed by Tina Satter. The Vineyard Theatre, New York City. October 27, 2021. In a piece written early in the Trump era, Rob Weinert-Kendt argued that documentary theatre should not be constrained by its commitment to the real or prevented from rendering “a truer reflection than a mere document might.” But what if the “merely” documentary actually complicates our understanding of how narrative is constructed and relayed? What if “reflection” fails to capture the complexity of what must be conveyed? These are some of the questions powerfully raised by Is This a Room, constructed entirely out of the transcript of an FBI interrogation, and Dana H., collated from interviews with the playwright’s mother. The Vineyard Theatre’s juxtaposition of the two pieces at the Lyceum on Broadway in October and November 2021 provided the opportunity to consider how verbatim theatre, as a particular subset of the documentary, complicates our conceptions of theatrical authenticity and verisimilitude. Although the pieces were not presented as a double bill, their conjunction posed rich questions about what truth and reality might mean on the documentary stage. Is This a Room, created and directed by Tina Satter, with the extraordinary Emily Davis in the lead, was first presented at The Kitchen in January 2019 and moved to Broadway in October 2021. The piece reenacts the FBI interrogation on June 3, 2017 of intelligence [End Page 383] contractor Reality Winner (yes, her actual name). Winner, who was subsequently convicted of espionage and served five years in prison for leaking proof of Russian interference in the 2016 US presidential election, was “visited” at her home in Augusta, Georgia, by three agents. As the program notes, “Is This a Room stages this visit word for word from the official transcript recorded that day.” Click for larger view View full resolution Becca Blackwell, Will Cobbs, Pete Simpson, and Emily Davis in the 2021 Broadway production of Is This a Room. (Photo: Chad Batka.) The play gives no sense of Winner’s eventual fate, yet the audience is well-aware of it. While we might share in the disorientation of the protagonist as the aggression ebbs and flows and the conversation distracts, we inevitably bring our knowledge of the aftermath to what becomes a chronicle of an arrest foretold. Rather than concern ourselves with the resolution, we are thus thrown back onto the process: How can this series of inane exchanges add up to such a serious outcome? Where exactly, in this bewildering conversation, does power lie? Winner shares with the men who come for her a background in compliance: she fully perceives the violence that remains implicit and therefore offers little overt defiance. Yet the tension in the theatre, sustained by the strong design of the minimalist production, was almost unbearable. Where the FBI had redacted bits of sensitive information, the lights blinked pink; when more substantial censorship was at work, the lights faded ominously to black in effective lighting design by Thomas Dunn. The light and sound design (the latter by Lee Kinney and Sanae Yamada) felt especially significant as they gestured to what lay ahead. Beyond these sound and lighting cues, Is This a Room explored how verbatim transcription obscures even as it reveals. From Winner’s visible discomfort and isolation, to her almost plaintive refrain of concern for her pets, to the awkwardness of chit-chat amid a terrifying search, Room confronted the audience with the mismatch between official records and lived experience. Much was left between the lines, expressed in the dissonance between what we saw and heard and what we knew was going on. For the most part our eyes could not be trusted: how could the slight presence of Davis, in her Converse high-tops and shorts, convey her moral courage? What to make of the avuncular Pete Simpson, who played the good cop Agent Garrick without ever breaking character? The unspoken menace of the gender imbalance in the scene was...

Impacts of three‐dimensional array over channel estimation for cell‐free massive MIMO considering spatially correlated channels

AbstractRecently, a promising technology known as the cell‐free (CF) massive multiple‐input multiple‐output (M‐MIMO) network has emerged as an alternative wireless communication network that offers numerous advantages to wireless communication systems. During this work, we address the uplink (UL) pilot‐based channel estimation (CE) and spectral efficiency (SE) for a CF M‐MIMO network considering spatially correlated channels. The CE and SE are computed respectively, using the Bayesian minimum mean square error (MMSE) estimator and MMSE combining vector. Moreover, we investigate the SE metric and CE procedure for correlated and uncorrelated channels, where in the correlated case, we employ the Gaussian local multi‐scattering (GLMS) model to describe the spatial correlation (SC). Furthermore, since the array geometry influence the SC, we deal with a CF M‐MIMO network wherein each access point (AP) is outfitted either with a uniform linear array (ULA), a uniform circular array (UCA), or a uniform cylindrical array (UCLA). Inspired by the GLMS for the ULA arrangement, we propose the GLMS model for a CF M‐MIMO network where each AP is equipped with a UCA arrangement. In other words, we propose and compute the expression of the channel co‐variance matrix (CM) that describes the SC in a CF M‐MIMO network where each AP is equipped with the UCA arrangement. Additionally, using the Kronecker product of the CM generated through the UCA arrangement and the CM generated through the ULA arrangement, we propose the GLMS model for a CF M‐MIMO network generated through the UCLA arrangement. Our theoretical expressions are validated and reinforced using numerical results, where we evaluate the system performance using the normalized mean square error metric and bits of information per second per hertz (i.e., ).

Local binary pattern‐based reversible data hiding

A novel local binary pattern-based reversible data hiding (LBP-RDH) technique has been suggested to maintain a fair symmetry between the perceptual transparency and hiding capacity. During embedding, the image is divided into various 3×3 blocks. Then, using the LBP-based image descriptor, the LBP codes for each block are computed. Next, the obtained LBP codes are XORed with the embedding bits and are concealed in the respective blocks using the proposed pixel readjustment process. Further, each cover image (CI) pixel produces two different stego-image pixels. Likewise, during extraction, the CI pixels are restored without the loss of a single bit of information. The outcome of the proposed technique with respect to perceptual transparency measures, such as peak signal-to-noise ratio and structural similarity index, is found to be superior to that of some of the recent and state-of-the-art techniques. In addition, the proposed technique has shown excellent resilience to various stego-attacks, such as pixel difference histogram as well as regular and singular analysis. Besides, the out-off boundary pixel problem, which endures in most of the contemporary data hiding techniques, has been successfully addressed.