nils-herrmann/clean_scirepeval huggingface dataset:
Diversity Analysis of Analog Network Coding with Multi-User Interferences

Network coding can improve the bandwidth efficiency by letting multiple users share the relay channels. However, the multi-user interferences (MUI) at the intended receiver may degrade the diversity performances. So in this work, we study several diversity strategies for the multiple-access relay channel and analyze the impact of MUI on the diversity performances. Both the variable gain relaying (VGR) and the fixed gain relaying (FGR) are considered, where the relay nodes are subject to instantaneous power constraints and long-term power constraints, respectively. We first develop a Min-Max relay selection strategy and prove that full diversity can be achieved. Next, the distributed space-time block coding (DSTBC) and the diagonal distributed space-time coding (DDSTC) are studied. For DSTBC, we show that full diversity can be achieved by FGR, but the diversity of VGR is upper bounded by \min (L+1, K+1), where L and K are the number of relays and users, respectively. For single-user systems, we then develop a selective DSTBC-VGR scheme to recover the diversity loss by adaptively allocating the relay power. Finally for DDSTC, we show that both FGR and VGR can achieve full diversity, and the optimum code design criterion is to maximize the minimum product distance.
Variable rate space-time trellis codes

Emerging wireless applications have created a strong motivation to increase the throughput of wireless communication systems. Space-time coding has become a promising method to achieve high data rates. We propose a space-time trellis code construction method that can provide variable protection against the adverse effects of the radio channel. The method is based on the multiple trellis coded modulation construction: the variable data protection is realized by changing the number of output symbols per state transition. The simulation results show the achievable tradeoffs between spectral efficiency, diversity and decoding complexity.
Multi-Channel Sensing and Access Game: Bayesian Social Learning with Negative Network Externality

In a distributed cognitive radio network, due to negative network externality, rational secondary users tend to avoid accessing the same vacant primary channels with others. Moreover, they usually need to make their channel access decisions in a sequential manner to avoid collisions. The characteristic of negative network externality and the structure of sequential decision making make the multi-channel sensing and access problem challenging, which has not been well studied by the existing literatures. To solve these problems, in this paper, we propose a multi-channel sensing and access game, which not only considers the negative network externality in secondary users' decision making, but also takes into account their sequential decision making structure. We solve the multi-channel sensing problem using Bayesian learning method and design a cooperative learning rule for secondary users to accurately estimate the channel state. We study the multi-channel access problem under two scenarios: with and without resource constraint, respectively. For both scenarios, we design recursive best response algorithms for secondary users to find the subgame perfect Nash equilibria. Specifically, we analyze the homogenous case of the scenario without resource constraint and find that the Nash equilibrium profile exhibits a threshold structure. Finally, we conduct simulations to validate the effectiveness and efficiency of the proposed methods.
Discrete-cosine/sine-transform based motion estimation

A new motion estimation scheme, discrete-cosine/sine-transform based motion estimation (DXT-ME) utilizing the principle of orthogonality of cosine and sine functions to estimate, in the transform domain, displacements from the motion information contained in the pseudo-phases of the images of moving objects, is proposed. The computational complexity of this method is only O(N2)+Odct for an image of size N×N in comparison to O(N4), the complexity of the full search block matching approach, where Odct is the complexity of DCT/DST coding. Furthermore, incorporation of DXT-ME with DCT-based video standards achieves further savings of computations and makes symmetric codecs feasible. Unlike the pel-recursive algorithm, this scheme is not susceptible to noise. For complicated scenery or large moving objects, simple preprocessing is performed on images to extract the features of moving objects before applying DXT-ME. Simulation on some video sequences is presented to compare this scheme with the block matching method.
2-D mesh motion compensation with adaptive interpolation

2-D mesh motion compensation produces blocking-free prediction in contrast to block matching motion compensation by generating a smooth full motion field from the set of node motion vectors. This is clearly not appropriate across moving object boundaries where motion discontinuities exist. In this paper, we address this problem by proposing an adaptive interpolation scheme for patches that contain multiple motions (i.e. patches around motion boundaries). Simulation results show improvements over standard 2-D mesh motion compensation at a fraction of computational increase.
Systematic design of space-frequency codes with full rate and full diversity

In this paper, a general space-frequency block code structure is proposed that can guarantee full-rate and full-diversity transmission in MIMO-OFDM systems. The proposed method can be used to construct space-frequency codes for an arbitrary number of transmit antennas, any memoryless modulation and arbitrary power delay profiles. Moreover, assuming that the power delay profile is known at the transmitter, we devise an interleaving method to maximize the overall performance of the code. The simulation results show that under the simulated environment, the proposed SF codes outperform the existing SF codes from orthogonal designs by about 3-5 dB, and that the proposed interleaving method results in about 1-3 dB performance improvement compared to random interleaving.
Efficient multimedia delivery over digital subscriber line

Consider the design of a multimedia transmission system to provide reliable and efficient delivery of multimedia data over a digital subscriber line. The layers associated with different bit error performances are transmitted in parallel, and the properties of the telephone line channel are utilized to achieve unequal error protection efficiently. The transmitted power for the specified error performance is significantly reduced compared to that of conventional schemes. Simulation results are provided for subband-coded images and integrated services (video, voice and data), demonstrating an excellent performance improvement, where a 0.5-2 dB average power gain is achieved.
Asymptotic Distortion Performance of Source-Channel Diversity Schemes over Relay Channels

Diversity techniques are an effective answer to the challenges presented by fading channels. This paper focuses on studying the performance of systems with diversity of three forms: source coding diversity, channel coding diversity, and user-cooperation diversity. To best reflect a focus on real-time multimedia communications, performance is measured through the distortion exponent, which measures the rate of decay of the end-to-end distortion at high SNRs. User-cooperation diversity takes the form of a relay channel implemented with amplify-and-forward processing at the relay. The results show that channel coding diversity provides the best performance, followed by source coding diversity. The results also show a tradeoff between the quality (resolution) of the source encoder and the amount of cooperation (number of relay nodes).
A cheat-proof game-theoretic framework for cooperative peer-to-peer video streaming

Cooperative peer-to-peer (P2P) streaming model, which enables cooperation among peers with large intra-group bandwidths, has been shown as a promising approach for video streaming applications. However, due to the inherent conflict between the individual peer's utility and the social optimality, designing an effective cooperative P2P streaming system becomes challenging. In this work, we first formulate the interactions among group peers as a cooperative P2P streaming game, which takes into account the unique characteristics of video. Then, a cheat-proof strategy is proposed to enforce rational group peers to achieve the optimal social welfare co-operatively. In particular, we prove theoretically that the proposed strategy can enforce truth-telling as an equilibrium, satisfy individual rationality and guarantee the budget balance of the system in an average sense. Finally, simulation results are shown to verify the effectiveness of the proposed scheme.
Lifetime maximization by cooperative sensor and relay deployment in wireless sensor networks

In this paper, cooperative sensor protocol and relay deployment in wireless sensor networks (WSNs) is proposed to improve the network lifetime. First, cooperative transmission is employed among sensor nodes. With an objective of maximizing the network lifetime under a constraint on bit-error-rate performance, we determine which sensors should cooperate and how much power to allocate for cooperation. A closed form solution is provided for a two-sensor WSN. Based on the obtained two-sensor solution, a fast suboptimal algorithm is developed for multiple sensor case. Moreover, the network lifetime is further improved by deploying cooperative relays in the network to help sensors transmit their information. The network lifetime is maximized by choosing the optimum location for each relay and optimally allocating the power that the relay helps each sensor. A suboptimal algorithm is proposed for the WSN with multiple relays. Simulation results show that the network lifetime of the proposed WSN with cooperative sensor employment improves 2.3 times compared with the non-cooperative WSN. In addition, deploying a cooperative relay in the proper location improves network lifetime up to 3 times of that for the non-cooperative WSN
Performance of detection statistics under collusion attacks on independent multimedia fingerprints

Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Collusion attack is a cost effective attack against digital fingerprinting where several copies with the same content but different fingerprints are combined to remove the original fingerprints. In this paper, we consider average attack and several nonlinear collusion attacks on independent Gaussian based fingerprints, and study the detection performance of several commonly used detection statistics in the literature under collusion attacks. Observing that these detection statistics are not specifically designed for collusion scenarios and do not take into account the characteristics of the newly generated fingerprints under collusion attacks, we propose pre-processing techniques to improve the detection performance of the detection statistics under collusion attacks.
Performance analysis for the use of adaptive beamforming in wireless packet networks

We use the interference reduction capability of smart antennas to increase the throughput and reduce the delay in wireless packet networks. We provide a theoretical framework to calculate the throughput where we use adaptive arrays in slotted ALOHA and CDMA slotted ALOHA systems. We show that by deploying adaptive arrays at base stations, we can improve the throughput both in the request access and in the traffic channels. We also consider the effect of call admission at high traffic load. Finally, we propose an adaptive beamforming architecture for multi-code CDMA (MC-CDMA) and investigate the improvement in delay and throughput in those systems.
Cooperation Stimulation for Multiuser Cooperative Communications Using Indirect Reciprocity Game

The viability of cooperative communications largely depends on the willingness of users to help. However, in future wireless networks where users are rational and pursue different objectives, they will not help relay information for others unless this can improve their own utilities. Therefore, it is very important to study the incentive issues when designing cooperative communication systems. In this paper, we propose a cooperation stimulation scheme for multiuser cooperative communications using indirect reciprocity game. By introducing the notion of reputation and social norm, rational users who care about their future utilities get the incentive to cooperate with others. Different from existing works on reputation based schemes that mainly rely on experimental verifications, we theoretically demonstrate the effectiveness of the proposed scheme in two steps. First, we conduct steady state analysis of the game and show that cooperating with users having good reputation can be sustained as an equilibrium when the cost-to-gain ratio is below a certain threshold. Then, by modeling the action spreading at transient states as an evolutionary game, we show that the equilibria we found in the steady state analysis are stable and can be reached with proper initial conditions. Moreover, we introduce energy detection to handle possible cheating behaviors of users and study its impact to the proposed indirect reciprocity game. Finally, simulation results are shown to verify the effectiveness of the proposed scheme.
Game theoretic Markov decision processes for optimal decision making in social systems

One key problem in social systems is to understand how users learn and make decision. Since the values of social systems are created by user participation while the user-generated data is the outcome of users' decisions, actions and their social-economic interactions, it is very important to take into account users' local behaviors and interests when analyzing a social system. In this paper, we propose a game-theoretic Markov decision process (GTMDP) framework to study how users make optimal decisions in a social system. By explicitly considering users' local interactions and interests, we show that the proposed GTMDP can correctly derive the optimal decision and thus achieve much better expected long-term utility compared with the traditional MDP. We also discuss how to design mechanism to steer users' behavior under the proposed GTMDP framework.
Membership [President's Message]

Membership S ome argue our Society does not need a large quantity of members , but that it does need quality membership. Some argue that size does matter. We are the fourth largest IEEE Society with more than 16,000 members; however, we are the largest Society without our own division director (IEEE Board of Directors). Perhaps both are equally right—we need quantity and quality! The number of IEEE Signal Processing Society (SPS) members peaked at more than 20,000 in 1995, after which membership began to decline steadily. The reason was not because the field of signal processing became less active. On the contrary, the number of pages in publications has grown from 2,200 pages in 1990 to over 19,300 pages in 2012. And the number of submissions to and attendance at SPS conferences continued to increase significantly as well. It was the introduction of IEEE Xplore that changed the paradigm of membership and the notion of individual members. One no longer needed to join a Society to receive a copy of a journal thanks to institutional memberships, which cover the costs of journal subscriptions. Many individuals thus chose not to join a Society. During the Society's major bylaws revision in 2009, the Society decided to seriously face the daunting membership challenges by introducing the Membership Board, with John Treichler as the first Vice President chairing it, and which now consists of four elected regional directors representing the United States, Asia-Pacific region, Europe and Mediter-ranean area, and Latin America and Can-ada. These regional directors are also nonvoting members of the Board of Governors (BoG). Their job is to bring the regional voices to the attention of the leadership as well as channel the messages back to their Regions. We have a Director–Membership Services whose job is to oversee value and benefit issues that concern our members. We learned from past studies that one of the top reasons a member decided to leave SPS was the lack of continuing education learning programs. Frankly, that dissatisfaction was right on, for we have paid too much attention to original research publications in journals and conferences. Therefore, one key project of the Direc-tor–Membership Services is to establish summer and winter schools on various emerging topics. As Membership Services Director, Shuvra Bhattacharyya was in charge of developing such a program. Just last summer, three summer schools were offered in Europe, the Middle East, and Asia, which …
Spatial smoothing for arrays with arbitrary geometry

The spatial smoothing (SS) technique has been proved to be effective in decorrelating coherent signals thus making MUSIC algorithm operative in a coherent interference environment. However, such scheme can only be applied to uniformly spaced linear arrays which are known to be very sensitive to the directions of arrivals (DOAs) and can be used to estimate azimuth angles only. To significantly improve the robustness of DOA estimation, to estimate both azimuth and elevation angles, we developed techniques for applying SS on arrays with arbitrary geometry. We also study the cause of ambiguities in a multiple signal environment and find the necessary and sufficient conditions of an ambiguity free three-sensor array manifold. We evaluated the forward/backward spatial smoothing on a nonlinear array with central symmetry and found that this technique outperform regular SS in terms of improved efficiency and estimation resolution. Finally, we expand the application of our technique to ESPRIT. All the predicted results are verified by simulations.<<ETX>>
An evolutionary game-theoretic modeling for heterogeneous information diffusion

In this paper, we model and analyze the information diffusion in heterogeneous social networks from an evolutionary game perspective. Users interact with each other according to their individual fitness, which are heterogeneous among different user types. We first study a model where in each social interaction the payoff of a user is independent of the type of the interacted user. In such a case, we derive the information diffusion dynamics of each type of users as well as that of the overall network. The evolutionarily stable states (ESSs) of the dynamics are determined accordingly. Afterwards, we investigate a more general model where in each interaction the payoff of a user depends on the type of the interacted user. We show that the local influence dynamics change much more quickly than the global strategy population dynamics and the former keeps track of the latter throughout the information diffusion process. Based on this observation, the global strategy population dynamics are derived. Finally, simulations are conducted to verify the theoretical results.
Fair collusion attacks on scalable video fingerprinting systems

Digital fingerprinting inserts identification information in the content to track the usage of digital data and protect content security. To trace traitors for multimedia over heterogeneous networks, this paper studies scalable multimedia fingerprinting systems in which users receive fingerprinted multimedia of different quality. We investigate the cost-effective multi-user collusion on fingerprinting systems and focus on fair collusion attacks in which colluders share the same risk of being captured. In this paper, we examine the fairness constraints on collusion when attackers receive copies of different quality and analyze the performance of scalable fingerprinting systems under fair collusion attacks.
Waveforming: An Overview With Beamforming

By leveraging the natural multipath propagation of electromagnetic waves, waveforming is proposed as a promising paradigm that treats each multipath component in a wireless channel as a virtual antenna to exploit the spatial diversity. As the most commonly known waveforming technique for wideband systems, the time-reversal (TR) signal transmission produces a TR resonance by coherently combining multipath energy distributed on virtual antennas, and thus boosts the received signal strength while reducing interference. The wideband waveforming is, in many ways, similar to the multiple-input multiple-output (MIMO) beamforming, where multiple antennas are deployed to imitate a multipath transmission when the bandwidth is limited. In this paper, we provide an overview of recent advances on the wideband waveforming, including massive multipath effect, optimal resource allocation, wireless power transfer and secrecy enhancement for secured communications, and compare with the corresponding counterparts of traditional MIMO beamforming.
Localized wavelet based computerized tomography

We develop an algorithm to reconstruct the wavelet coefficients of an image from the Radon transform data. The proposed method uses the properties of wavelets to localize the Radon transform and can be used to reconstruct a local region of the cross section of a body, using almost completely local data which significantly reduces the amount of exposure and computations in X-ray tomography. For example, for a local region of radius 20 pixels in a 256/spl times/256 image the proposed method can reduce the exposure to 12.5% of the conventional filtered backprojection method. Compared to the existing schemes, which can only reduce to 40%.
Parametric estimation of NMR spectroscopy using matrix pencil

To determine protein structure by means of NMR spectroscopy, the parameters of NMR spectroscopy have to be estimated. This paper proposes a novel parameter estimation algorithm for NMR spectroscopy. The new algorithm is based on the matrix pencil consisting of the NMR data. Compared with the Kumaresan-Tufts (KT) algorithm, the new algorithm improves the noise threshold by about 6 dB. Its effectiveness is demonstrated by computer simulation.
Multi-source cooperative transmission with network coding

A new cooperative transmission protocol with network coding scheme for synchronized multi-source system are proposed. The users are organized into two groups. The users in different groups transmit in distinct time slots, while the users in the same group transmit with orthogonal waveforms. In each transmission, the user transmits his own information and relays other users' information at the same time. The proposed protocol is able to mimic the full-duplex transmission with half-duplex mode to achieve high data rate. The network code for this protocol can be designed using classical linear block codes, whose minimum Hamming distance of the network code determines the system diversity order. Hence, with well-designed network code, the proposed protocol can achieve high diversity order. Simulation results show that the proposed scheme outperforms previous work.
Collaborative Multiple-Access Protocols for Wireless Networks

In this paper, a new multiple access approach is proposed that takes into account the broadcast nature of the wireless channel. The new approach employs a relay to boost the system throughput. This approach is based on a new idea in which the relay utilizes the empty time slots available in a TDMA frame. The relay stores the packets that failed transmissions previous time slots. At each time slot, the relay listens to the channel and retransmits the packet at the head of its queue if the channel is free. This will better utilize the channel resources and will introduce on-demand spatial diversity into the network. Two different protocols are proposed to implement this new multiple-access scheme. The stability criteria of the associated queueing systems are studied and analytical expressions for the maximum stable throughput are provided for the symmetrical users case. Numerical results indicate a significant increase in the maximum stable throughput by using the new multiple-access protocol over pure TDMA.