An optimized encoding method for secure key distribution by swapping quantum entanglement and its extension

Song [Song D 2004 Phys. Rev. A69034301] first proposed two key distribution schemes with the symmetry feature.We find that, in the schemes, the private channels which Alice and Bob publicly announce the initial Bell state or the measurement result through are not needed in discovering keys, and Song’s encoding methods do not arrive at the optimization.Here, an optimized encoding method is given so that the efficiencies of Song’s schemes are improved by 7/3 times. Interestingly, this optimized encoding method can be extended to the key distribution scheme composed of generalized Bell states.

A highly reliable encoding and decoding communication framework based on semantic information

Increasing research has focused on semantic communication,the goal of which is to convey accurately the meaning instead of transmitting symbols from the sender to the receiver.In this paper,we design a novel encoding and decoding semantic communication framework,which adopts the semantic information and the contextual correlations between items to optimize the performance of a communication system over various channels.On the sender side,the average semantic loss caused by the wrong detection is defined,and a semantic source encoding strategy is developed to minimize the average semantic loss.To further improve communication reliability,a decoding strategy that utilizes the semantic and the context information to recover messages is proposed in the receiver.Extensive simulation results validate the superior performance of our strategies over state-of-the-art semantic coding and decoding policies on different communication channels.

Encoding of Primary Structures of Biological Macromolecules Within a Data Mining Perspective

An encoding method has a direct effect on the quality and the representationof the discovered knowledge in data mining systems. Biological macromolecules are encoded by stringsof characters, called primary structures. Knowing that data mining systems usually use relationaltables to encode data, we have then to re-encode these strings and transform them into relationaltables. In this paper, we do a comparative study of the existing static encoding methods, that arebased on the Biologist know-how, and our new dynamic encoding one, that is based on the constructionof Discriminant and Minimal Substrings (DMS). Different classification methods are used to do thisstudy. The experimental results show that our dynamic encoding method is more efficient than thestatic ones, to encode biological macromolecules within a data mining perspective.

Building Case-Based Preliminary Design Systems: A Hopfield Network Approach

This paPer addresses the issue of building a case-based preliminary design system by using Hopfield networks. one limitation of Hopfield networks is that it cannot be tralned, i.e. the weights between two neurons must be set in advance. A pattern stored in Hopfield networks cannot be recalled if the pattern is not a local minimum.Two concepts are proposed to deal with this problem. They are the multiple training encoding method and the puppet encoding method. The multiple training encoding method, which guarantees to recall a single stored pattern under appropriate initial conditions of data, is theoretica-lly analyzed, and the minimal number of times for using a pattern for training to guarantee recalling of the pattern among a set of patterns is derived. The puppet encoding method is proved to be able to guarantee recalling of all stored patterns if attaching puppet data to the stored patterns is available.An integrated software PDS (Prelindnary Design System), which is developed from two aspects, is described. One is from a case-based expert system-CPDS (Case-based Prelindnary Design System), which is based on the algorithm of the Hopfield and developed for uncertain problems in PDS; the other is RPDS (Rule-based Preliminary Design System), which attacks logic or deduced problems in PDS. Based on the results of CPDS, RPDS can search for feasible solutioll in design model. CPDS is demonstrated to be useful in the domains of preliminary designs of cable-stayed bridges in this paper.