Optimal Order of Decoding for Max-Min Fairness in KK-User Memoryless Interference Channels

A $K$-user memoryless interference channel is considered where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated transmitter. Therefore, the data rate of each transmitter depends on (i) the subset of receivers which decode the data of that transmitter, (ii) the decoding order, employed at each of these receivers. In this paper, a greedy algorithm is developed to find the users which are decoded at each receiver and the corresponding decoding order such that the minimum rate of the users is maximized. It is proven that the proposed algorithm is optimal.Comment: 11 Pages, Submitted to IEEE International Symposium on Information Theory(ISIT 2007

Throughput Scaling Laws for Wireless Networks with Fading Channels

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\log n$ (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.Comment: Submitted to IEEE Transactions on Information Theory (Revised

Extracting Implicit Social Relation for Social Recommendation Techniques in User Rating Prediction

Recommendation plays an increasingly important role in our daily lives. Recommender systems automatically suggest items to users that might be interesting for them. Recent studies illustrate that incorporating social trust in Matrix Factorization methods demonstrably improves accuracy of rating prediction. Such approaches mainly use the trust scores explicitly expressed by users. However, it is often challenging to have users provide explicit trust scores of each other. There exist quite a few works, which propose Trust Metrics to compute and predict trust scores between users based on their interactions. In this paper, first we present how social relation can be extracted from users' ratings to items by describing Hellinger distance between users in recommender systems. Then, we propose to incorporate the predicted trust scores into social matrix factorization models. By analyzing social relation extraction from three well-known real-world datasets, which both: trust and recommendation data available, we conclude that using the implicit social relation in social recommendation techniques has almost the same performance compared to the actual trust scores explicitly expressed by users. Hence, we build our method, called Hell-TrustSVD, on top of the state-of-the-art social recommendation technique to incorporate both the extracted implicit social relations and ratings given by users on the prediction of items for an active user. To the best of our knowledge, this is the first work to extend TrustSVD with extracted social trust information. The experimental results support the idea of employing implicit trust into matrix factorization whenever explicit trust is not available, can perform much better than the state-of-the-art approaches in user rating prediction

BOLA360: Near-optimal View and Bitrate Adaptation for 360-degree Video Streaming

Recent advances in omnidirectional cameras and AR/VR headsets have spurred the adoption of 360-degree videos that are widely believed to be the future of online video streaming. 360-degree videos allow users to wear a head-mounted display (HMD) and experience the video as if they are physically present in the scene. Streaming high-quality 360-degree videos at scale is an unsolved problem that is more challenging than traditional (2D) video delivery. The data rate required to stream 360-degree videos is an order of magnitude more than traditional videos. Further, the penalty for rebuffering events where the video freezes or displays a blank screen is more severe as it may cause cybersickness. We propose an online adaptive bitrate (ABR) algorithm for 360-degree videos called BOLA360 that runs inside the client's video player and orchestrates the download of video segments from the server so as to maximize the quality-of-experience (QoE) of the user. BOLA360 conserves bandwidth by downloading only those video segments that are likely to fall within the field-of-view (FOV) of the user. In addition, BOLA360 continually adapts the bitrate of the downloaded video segments so as to enable a smooth playback without rebuffering. We prove that BOLA360 is near-optimal with respect to an optimal offline algorithm that maximizes QoE. Further, we evaluate BOLA360 on a wide range of network and user head movement profiles and show that it provides $13.6\%$ to $372.5\%$ more QoE than state-of-the-art algorithms. While ABR algorithms for traditional (2D) videos have been well-studied over the last decade, our work is the first ABR algorithm for 360-degree videos with both theoretical and empirical guarantees on its performance.Comment: 25 page

Fuzzy Laplace Transforms for Derivatives of Higher Orders

In this paper, we find the formula of fuzzy derivative of the third order and fourth order  and  find the fuzzy Laplace transforms for the fuzzy derivative of the above mentioned orders by using generalized H-differentiability. Keywords: Fuzzy numbers, generalized H-differentiability, Fuzzy Laplace transform

A Potential Bio-sorbent for Heavy Metals in the Remediation of Waste Water

Bay leaves are used for flavoring in cold drinks production, in bakery goods, sauces, confectionary products and liquors. The waste generated from these sources has been valorized by attempting the remediation of waste water. Hence, adsorption of toxic metals onto Bay leaves has been investigated after optimizing the experimental parameters, namely the pH, contact time, adsorbent and Zn(II) concentrations as well as the temperature of the equilibrium mixture (consisting of the metal solution in contact with the adsorbent). The participation of the constituent functional groups, of the adsorbent, was ascertained with Fourier transform spectroscopic studies. The mode of adsorption was examined by employing important isotherm models, namely Langmuir, Freundlich and Dubinin-Radushkevich models. The adsorption process was found to follow pseudo-first order kinetic model and also followed the intraparticle diffusion up to 60 minutes of contact time. The thermodynamic parameters suggest the spontaneous nature of adsorption