Probabilistic remote preparation of a high-dimensional equatorial multiqubit with four-party and classical communication cost

This paper presents a protocol for probabilistic remote preparation of a high-dimensional equatorial multiqubit with four-party, consisting of a sender and three receivers. The quantum channel is composed of a partial entangled high-dimensional four-particle state. We calculate the successful total probability and the total classical communication cost required for this scheme. It is shown that both the entangled resources and classical communication cost are greatly reduced.

A Partitioning Methodology That Optimizes the Communication Cost for Reconfigurable Computing Systems

This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the temporal partitioning problem. This algorithm optimizes the transfer of data required between design partitions and the reconfiguration overhead. Results show that our algorithm considerably decreases the communication cost and the latency compared with other well known algorithms.

Optimization of communication topology for persistent formation in case of communication faults

To address the optimization problem of communication topology for persistent formation in the case of communication faults such as link interruption,transmitter failure,and receiver failure a two-stage model including fast reconstruction of communication topology and re-optimization of communication topology is constructed.Then,a fast reconstruction algorithm of communication topology for persistent formation(FRA-CT-PF),based on optimally rigid graph,arc addition operation,and path reversal operation,is proposed,which can quickly generate a feasible reconstructed communication topology after communication faults,thus ensuring the safety of the agents and maintaining the formation shape of persistent formation.Furthermore,a re-optimization algorithm of communication topology for persistent formation(ROA-CTPF),based on agent position exchange,is proposed,which can further obtain a reoptimized communication topology to minimize the formation communication cost while still maintaining the formation shape of persistent formation.The time complexities of these two algorithms are also analyzed.Finally,the effectiveness of the above algorithms is verified by numerical experiments.Compared with existing algorithms,FRA-CT-PF can always obtain feasible reconstructed communication topology in much less time under all communication fault scenarios,and ROA-CT-PF can obtain a reoptimized communication topology to further reduce the formation communication cost in a shorter time.

Remote preparation of an entangled two-qubit state with three parties

We present a scheme for probabilistic remote preparation of an entangled two-qubit state with three parties from a sender to either of two receivers. The quantum channel is composed of a paxtially entangled two-qubit state and a partially entangled three-qubit state. We calculate the successful total probabilities of the scheme in general and particular cases, respectively. We also calculate total classical communication cost in a general case and two particular cases, respectively.

Energy-balanced on demand clustering improved leach protocol for wireless sensor networks

In wireless sensor networks（WSNs）,appropriate topology control（TC）could efficiently balance the load among sensor nodes and extend network lifespan.Clustering is an effective topology control technique that could reduce energy consumption and provide scalability to WSNs.However,some clustering algorithms,including the traditional low energy adaptive clustering hierarchy（LEACH）,don＇t consider the residual energy and the communication distance.The energy consumption could dramatically increase in the case of long communication distance and high rate of control message exchange.In this paper we propose an energy-balanced clustering algorithm which considers the communication distance and the residual energy.Moreover the cluster head（CH）reselection is relevant to the current CH residual energy in order to reduce overheads.The simulation results demonstrate that the proposed algorithm prolongs the lifetime of the WSN in comparison to the LEACH and a hybrid clustering approach（HCA）.

Efficient Scheduling Mapping Algorithm for Row Parallel Coarse-Grained Reconfigurable Architecture

Row Parallel Coarse-Grained Reconfigurable Architecture(RPCGRA)has the advantages of maximum parallelism and programmable flexibility.Designing an efficient algorithm to map the diverse applications onto RPCGRA is difficult due to a number of RPCGRA hardware constraints.To solve this problem,the nodes of the data flow graph must be partitioned and scheduled onto the RPCGRA.In this paper,we present a Depth-First Greedy Mapping(DFGM)algorithm that simultaneously considers the communication costs and the use times of the Reconfigurable Cell Array(RCA).Compared with level breadth mapping,the performance of DFGM is better.The percentage of maximum improvement in the use times of RCA is 33%and the percentage of maximum improvement in non-original input and output times is 64.4%(Given Discrete Cosine Transfor 8(DCT8),and the area of reconfigurable processing unit is 56).Compared with level-based depth mapping,DFGM also obtains the lowest averages of use times of RCA,non-original input and output times,and the reconfigurable time.

Probabilistic Teleportation of an Arbitrary Two-Qubit State via Positive Operator-Valued Measurement with Multi Parties

We propose a novel scheme to probabilistically transmit an arbitrary unknown two-qubit quantum state via Positive Operator-Valued Measurement with the help of two partially entangled states. In this scheme, the teleportation with two senders and two receives can be realized when the information of non-maximally entangled states is only available for the senders. Furthermore, the concrete implementation processes of this proposal are presented, meanwhile the classical communication cost and the successful probability of our scheme are calculated.

A Combinatorial Auction-Based Collaborative Cloud Services Platform

In this paper, we present a novel, dynamic collaboration cloud platform in which a Combinatorial Auction（CA）-based market model enables the platform to run effectively. The platform can facilitate expense reduction and improve the scalability of the cloud, which is divided into three layers： The user-layer receives requests from end-users, the auction-layer matches the requests with the cloud services provided by the Cloud Service Provider（CSP）, and the CSP-layer forms a coalition to improve serving ability to satisfy complex requirements of users.In fact, the aim of the coalition formation is to find suitable partners for a particular CSP. However, identifying a suitable combination of partners to form the coalition is an NP-hard problem. Hence, we propose approximation algorithms for the coalition formation. The Breadth Traversal Algorithm（BTA） and Revised Ant Colony Algorithm（RACA） are proposed to form a coalition when bidding for a single cloud service in the auction. The experimental results show that RACA outperforms the BTA in bid price. Other experiments were conducted to evaluate the impact of the communication cost on coalition formation and to assess the impact of iteration times for the optimal bidding price. In addition, the performance of the market model was compared to the existing CA-based model in terms of economic efficiency.