Research on secure buyer-seller watermarking protocol

A new buyer-seller watermarking protocol is proposed by applying a double encryption method and a novel mechanism of embedding a buyer＇s watermark. The protocol can effectively prevent against collusion attacks and the man in the middle attack if the third party is not trusted. Also, based on the proposed scheme for the first-hand transaction, a new buyer-reseller watermarking protocol and a formal multi-party watermarking protocol are also proposed. The proposed buyer-resell watermarking protocol only needs the original seller to provide transfer certificate and encryption-decryption service to support the second-hand transaction, and the multi-party watermarking protocol with distributed certificate authorities can overcome the difficulty in the combination of multicast mechanism with multiple unique watermarks and allow a seller to multicast the watermarked digital contents and key transaction information to n buyers. Furthermore, the idea of zero knowledge proof is also applied into the proposed scheme to allow the seller to take an effective control on the task performed by the third party.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.     

Compressed sensing based channel estimation for fast fading OFDM systems

A compressed sensing (CS) based channel estimation algorithm is proposed by using the delay-Doppler sparsity of the fast fading channel. A compressive basis expansion channel model with sparsity in both time and frequency domains is given. The pilots in accordance with a novel random pilot matrix in both time and frequency domains are sent to measure the delay-Doppler sparsity channel. The relatively nonzero channel coefficients are tracked by random pilots at a sampling rate significantly below the Nyquist rate. The sparsity channels are estimated from a very limited number of channel measurements by the basis pursuit algorithm. The proposed algorithm can effectively improve the channel estimation performance when the number of pilot symbols is reduced with improvement of throughput efficiency.     

Application of improved equivalent edge currents in synthetic aperture radar imaging

Target modeling and scattering function calculating are important prerequisites and groundwork for the synthetic aperture radar (SAR) imaging simulation. According to the difficult problems that normal methods cannot calculate the scattering function of electrically large object under the condition to wideband, an effective method of improved equivalent edge currents is presented and applied to SAR imaging simulation for the first time. This method improves calculating velocity and has relatively high precision. The concrete steps of applying the method are given. By way of the simulation experiment, the effectiveness of the method is verified.     

Fast motion estimation algorithm for H.264/AVC based on centered prediction

H.264/AVC video coding standard can achieve roughly half of the bit-savings over MPEG2 and MPEG4 for a given quality. However, this comes at a cost in considerably increased complexity at the encoder and thus increases the difficulty in hardware implementation. The high redundancy that exists between the successive frames of a video sequence makes it possible to achieve a high data compression ratio. Motion estimation (ME) plays an important role in motion compensated video coding. A fast motion estimation algorithm for H.264/AVC is proposed based on centered prediction, called centered prediction based fast mixed search algorithm (CPFMS). It makes use of the spatial and temporal correlation in motion vector (MV) fields and feature of all-zero blocks to accelerate the searching process. With the initialized searching point prediction, adaptive search window changing and searching direction decision, CPFMS is provided to reduce computation in block-matching process. The experimental results show that the speed of CPFMS is nearly 12 times of FS with a negligible peak signal-noise ratio (PSNR) loss. Also, the efficiency of CPFMS outperforms some popular fast algorithms such as hybrid unsymmetrical cross multi-hexagongrid search and a novel multidirectional gradient descent search evidently.     

Coordinating production and recycling decisions with stochastic demand and return

In this paper, the joint production and recycling problem is investigated for a hybrid manufacturing and remanufacturing system where brand-new products are produced in the manufacturing plant and recycled products are remanufactured into as-new products in the remanufacturing facility. Both the brand-new products and remanufactured products are used to satisfy customer demands. Returns of used products that are recycled from customers are assumed to be stochastic and nonlinearly price-dependent. A mathematical model is proposed to maximize the overall profit of the system through simultaneously optimizing the production and recycling decisions, subject to two capacity constraints — the manufacturing capacity and the remanufacturing capacity. Based on Lagrangian relaxation method, subgradient algorithm and heuristic algorithm, a solution approach is developed to solve the problem. A representative example is presented to illustrate the system, and managerial analysis indicates that the uncertainties in demand and return have much influence on the production and recycling policy. In addition, twenty randomly produced examples are solved, and computational results show that the solution approach can obtain very good solutions for all examples in reasonable time.     

Coordinating pricing and inventory decisions in a bounded production system with uncertain yield

Most inventory researches assume that production level can fluctuate arbitrarily. However, large fluctuation of the production level in many firms may be much costly. This paper addresses the coordinating pricing and inventory control problem in a bounded production system with uncertain yield, in which the production level is constrained between a maximum and minimum level in each period and the price can be adjusted dynamically. We show that the optimal policy is the interval base-stock-list-price policy. Also, we study the impact of the production bounds and uncertainty of the yield on the production system. Numerical experiments are also performed to study the impact of parameters on the system.     

The M/PH/1 queue with working vacations and vacation interruption

We study an M/PH/1 queue with phase type working vacation and vacation interruption where the vacation time follows a phase type distribution. The server serves the customers at a lower rate in a vacation period. The server comes back to the regular busy period at a service completion without completing the vacation. Such policy is called vacation interruption. In terms of quasi birth and death process and matrix-geometric solution method, we obtain the stationary queue length distribution. Moreover we obtain the conditional stochastic decomposition structures of queue length and waiting time when the service time distribution in the regular busy period is exponential.     

Two-scale finite element Green’s function approximations with applications to electrostatic potential computation

<正> In this paper,a two-scale finite element approach is proposed and analyzed for approximationsof Green's function in three-dimensions.This approach is based on a two-scale finite elementspace defined,respectively,on the whole domain with size H and on some subdomain containing singularpoints with size h (h H).It is shown that this two-scale discretization approach is very efficient.In particular,the two-scale discretization approach is applied to solve Poisson-Boltzmann equationssuccessfully.     

Removable ears of 1-extendable graphs

<正> Carvalho,Lucchesi and Murty proved that any 1-extendable graph G different from K_2and C_(2n)has at least Δ(G)edge-disjoint removable ears,and any brick G distinct from K_4 and■hasat least Δ(G)-2 removable edges,where Δ(G)denotes the maximum degree of G.In this paper,weimprove the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs.It is proved that any 1-extendable graph G different from K_2 and C_(2n)has at least χ′(G)edge-disjointremovable ears,and any brick G distinct from K_4 and■has at least χ′(G)-2 removable edges,whereχ′(G)denotes the edge-chromatic number of G.