5,815 Hits in 4.7 sec

Network-Assisted Distributed Fairness-Aware Interference Coordination for Device-to-Device Communication Underlaid Cellular Networks

Francis Boabang, Hoang-Hiep Nguyen, Quoc-Viet Pham, Won-Joo Hwang
2017 Mobile Information Systems  
The existence, uniqueness of the Nash Equilibrium (NE), and the convergence of the proposed algorithm are characterized using Variational Inequality theory.  ...  In our game formulation, reference user who is the victim of cotier interference is factored into the payoff function of each player to obtain fair and efficient outcome.  ...  Acknowledgments This work was supported by the 2016 Inje University research grant.  ... 
doi:10.1155/2017/1821084 fatcat:fzerqesc2ncwrkle2hlmm54shm

FAIR Principles: Interpretations and Implementation Considerations

Annika Jacobsen, Ricardo de Miranda Azevedo, Nick Juty, Dominique Batista, Simon Coles, Ronald Cornet, Mélanie Courtot, Mercè Crosas, Michel Dumontier, Chris T. Evelo, Carole Goble, Giancarlo Guizzardi (+32 others)
2019 Data Intelligence  
Any self-identified stakeholder community may either choose to reuse solutions from existing implementations, or when they spot a gap, accept the challenge to create the needed solution, which, ideally  ...  We introduce the concept of FAIR implementation considerations to assist accelerated global participation and convergence towards accessible, robust, widespread and consistent FAIR implementations.  ...  ACKNOWLEDGEMENTS The work of A. Jacobsen, C. Evelo, M. Thompson  ... 
doi:10.1162/dint_r_00024 fatcat:tozpcja4abg3fcu2nor7ag5q6a

Existence and uniqueness of fair rate allocations in lossy wireless networks

Vijay Subramanian, Ken Duffy, Douglas Leith
2009 IEEE Transactions on Wireless Communications  
We establish the existence and uniqueness of utility fair and max-min fair solutions and that, as loss rates decrease, fair allocations converge to the loss-less ones.  ...  Thus fundamental questions of the existence and uniqueness of fair rate allocations must be reconsidered.  ...  We relate the arguments in the solution of the optimization (2) for q ≤ 1 to the loss-less case by proving a continuity property of the optimal solutions to (2) as q approaches 1.  ... 
doi:10.1109/twc.2009.080808 fatcat:ked73ufyfnbqtgoi7xcocnepcu

Time Averaged Density Matrix as an Optimization Problem [article]

Volckmar Nebendahl
2015 arXiv   pre-print
., matrix product operators (MPO). An algorithm is explained and several results for non-integrable Ising chains are given.  ...  A new method is presented which allows time averaged density matrices of closed quantum systems to be computed via a constraint overlap maximization.  ...  This puts us into the position to reuse information won in previous optimizations of M [k] .  ... 
arXiv:1503.01658v1 fatcat:jpmkieugdndohodn5vwy3nvhnq

Resource Allocation and Performance Study for LTE Networks Integrated with Femtocells

Tian Lan, Kaustubh Sinkar, Latha Kant, Kenneth Kerpez
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
With the growing impetus for frequency reuse, the capacity of each user depends on not only the power spectral density of its own, but also on those of others in neighboring cells.  ...  The algorithm makes novel use of a class of fairness measures for determining user scheduling and is shown to be very efficient for realistic network parameters.  ...  Significant effort has been made to establish conditions which can ensure the existence and uniqueness of a Nash equilibrium solution as well as the convergence of IWFA [18] [19] .  ... 
doi:10.1109/glocom.2010.5684230 dblp:conf/globecom/LanSKK10 fatcat:b5yw65ewz5fmda4qdop7h22mgu

S3CMTF: Fast, accurate, and scalable method for incomplete coupled matrix-tensor factorization

Dongjin Choi, Jun-Gi Jang, U Kang, Junwen Wang
2019 PLoS ONE  
How can we extract hidden relations from a tensor and a matrix data simultaneously in a fast, accurate, and scalable way?  ...  S3CMTF further boosts the performance by carefully storing intermediate computation and reusing them. We theoretically and empirically show that S3CMTF is the fastest, outperforming existing methods.  ...  S 3 CMTF further boosts the performance by storing intermediate computation and reusing them. Table 1 shows the comparison of S 3 CMTF and other existing methods.  ... 
doi:10.1371/journal.pone.0217316 pmid:31251750 pmcid:PMC6599158 fatcat:xkusf6puivfwrodqn446xrzhou

Parallel matrix factorization for recommender systems

Hsiang-Fu Yu, Cho-Jui Hsieh, Si Si, Inderjit S. Dhillon
2013 Knowledge and Information Systems  
Matrix factorization, when the matrix has missing values, has become one of the leading techniques for recommender systems.  ...  On the other hand, SGD conducts efficient updates but usually suffers from slow convergence that is sensitive to the parameters.  ...  We also thank the Texas Advanced Computer Center (TACC) for providing computing resources required to conduct experiments in this work.  ... 
doi:10.1007/s10115-013-0682-2 fatcat:w52nemt7hzd4hjwu5voxv7ggqu

A Versatile Coexistence Decision-Making System for Efficient TV Whitespace Sharing among Whitespace Objects

M. Asif Raza, Zafar Iqbal, Sang-Seon Byun, Hyunduk Kang, Heung-No Lee
2017 Wireless Communications and Mobile Computing  
Simulation results show the superiority of the proposed algorithm over existing TVWS sharing algorithms.  ...  The proposed system is considered versatile in functionality as it jointly takes care of three distinct channel allocation features: (a) optimizing system quality of service (QoS) performance metrics,  ...  For example, both consider optimizing throughput under minimum fairness in allocation. However, there exist some fundamental differences as well.  ... 
doi:10.1155/2017/8498217 fatcat:qybgqkqv7bhljcuykkyjpd5w3i

OverSketch: Approximate Matrix Multiplication for the Cloud

Vipul Gupta, Shusen Wang, Thomas Courtade, Kannan Ramchandran
2018 2018 IEEE International Conference on Big Data (Big Data)  
We establish statistical guarantees on the accuracy of OverSketch and empirically validate our results by solving a large-scale linear program using interior-point methods and demonstrate a 34% reduction  ...  We propose OverSketch, an approximate algorithm for distributed matrix multiplication in serverless computing.  ...  Solving Optimization Problems with Sketched Matrix multiplication Matrix multiplication is the bottleneck of many optimization problems.  ... 
doi:10.1109/bigdata.2018.8622139 dblp:conf/bigdataconf/GuptaWCR18 fatcat:n7da25nglfgz5huaeavtzfnnue

ENVRI-FAIR D7.1: Design documents describing FAIR data services provided by selected RIs (V1)

Markus Stocker, Barbara Magagna, Keith Jeffery, Markus Fiebig, Peter Thijsse, Daniele Bailo, Xiaofeng Liao
2020 Zenodo  
(ENVRIs) in order to ensure the production of FAIR (meta)data across the community.  ...  We present the ENVRI-FAIR approach to consultancy by ICT experts with research infrastructure managers and developers, aimed at technology convergence across the community of environmental research infrastructures  ...  Clearly, the task of cluster-level technology convergence for effective and efficient FAIR principles implementation is enormous and ultimately relies on the RIs, within ENVRI-FAIR and beyond.  ... 
doi:10.5281/zenodo.4061712 fatcat:qp3dvicujzagtiffwyci3kox3u

A Novel Algorithm for Distributed Dynamic Interference Coordination in Cellular Networks

Marc C. Necker
2011 PIK - Praxis der Informationsverarbeitung und Kommunikation  
The proposed scheme achieves an increase of more than 100% with respect to the cell edge throughput, and a gain of about 30% in the aggregate spectral efficiency compared to a reuse 3 system.  ...  This information is the basis for a local inner optimization in every basestation.  ...  Hence, the 5% quantile is a very good fairness indicator. Convergence and Complexity of genetic algorithm The convergence behavior is shown in Fig. 4 .  ... 
doi:10.1515/piko.2011.017 fatcat:j4ro2mqpizd2xirvvdeoa4sdbe

Resource Allocation for D2D Underlay Communications with Proportional Fairness using Iterative-based Approach

Miaomiao Liu, Li Zhang
2020 IEEE Access  
Since the evaluation of the system fairness is different for t = 1 and t ≥ 2, where t is the scheduling period, we divide our joint optimization problem into two cases: t = 1 and t ≥ 2.  ...  Moreover, comparing with existing schemes, our proposed scheme can not only enhance the system fairness but also improve the overall throughput.  ...  The optimal power allocation for one D2D link and one cellular link which reuse the a certain channel resource can be obtained by comparing at most 4 potential solutions. • When t ≥ 2, the system fairness  ... 
doi:10.1109/access.2020.3010091 fatcat:2hr3f2loyvcn7hxhxgy4x6kbty

Noncooperative power-control game and throughput game over wireless networks

Zhu Han, K.J. Ray Liu
2005 IEEE Transactions on Communications  
Observing the bilinear matrix inequality nature of resource allocation, we construct two interrelated games: a power-control game at the user level, and a throughput game at the system level, respectively  ...  An optimal complex centralized algorithm is developed as a performance bound. The simulations show that the proposed games have near-optimal system performance.  ...  Fig. 1 . 1 Nash equilibriums of NCPCG. Fig. 3 . 3 Tradeoff between rejection and throughput loss for . Fig. 4 . 4 Fairness and average transmitted power versus reuse distance.  ... 
doi:10.1109/tcomm.2005.857136 fatcat:kpwath3tjrendkt5j7xtdy7doe

Spatial Resources Optimization in Distributed MIMO Networks with Limited Data Sharing [article]

Antonis G. Gotsis, Angeliki Alexiou
2013 arXiv   pre-print
In this paper, we investigate efficient strategies towards optimizing the pairing of access nodes with users as well as linear precoding designs for providing fair QoS experience across the whole network  ...  In such a complex network, distributed MIMO resources optimization is of paramount importance, in order to achieve capacity scaling.  ...  As in UFR where the reuse of frequency resources may be limited due to interference issues [13] , in USR space reuse may also be limited due to complexity and overhead issues.  ... 
arXiv:1304.1020v1 fatcat:35pj3g5oi5hkdpzkzskivp3aem

Price-Based Resource Allocation in Wireless Ad Hoc Networks [chapter]

Yuan Xue, Baochun Li, Klara Nahrstedt
2003 Lecture Notes in Computer Science  
and spatial reuse of the shared wireless channel.  ...  The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize the aggregated utility of flows, while  ...  reuse of the shared wireless channel.  ... 
doi:10.1007/3-540-44884-5_5 fatcat:fp7lefkpbnfrhfpyjhe5376jou
« Previous Showing results 1 — 15 out of 5,815 results