Shuo-Yen Robert Li

Learn More
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize(More)
Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing(More)
Store-and-forward had been the predominant technique for transmitting information through a network until its optimality was refuted by network coding theory. Network coding offers a new paradigm for network communications and has generated abundant research interest in information and coding theory, networking, switching, wireless communications,(More)
Kernel learning is a powerful framework for nonlinear data modeling. Using the kernel trick, a number of problems have been formulated as semidefinite programs (SDPs). These include Maximum Variance Unfolding (MVU) (Weinberger et al., 2004) in nonlinear dimensionality reduction, and Pairwise Constraint Propagation (PCP) (Li et al., 2008) in constrained(More)
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.(More)
We study the profit maximization problem of a cognitive virtual network operator in a dynamic network environment. We consider a downlink OFDM communication system with various network dynamics, including dynamic user demands, uncertain sensing spectrum resources, dynamic spectrum prices, and time-varying channel conditions. In addition, heterogeneous users(More)
It is possible to view the combinatorial structures known as (integral) t-designs as Z-modules in a natural way. In this note we introduce a polynomial associated to each such Z-module. Using this association, we quickly derive explicit bases for the important class of submodules which correspond to the so-called null-designs. Introduction. Among the most(More)
This article investigates the generators of certain homogeneous ideals which are associated with graphs with bounded independence numbers. These ideals first appeared in the theory of tdesigns. The main theorem suggests a new approach to the Clique Problem which is .A/'~-com plete. This theorem has a more general form in commutative algebra dealing with(More)
We study the optimal usage-based pricing problem in a resource-bounded network with one profit-maximizing service provider and multiple groups of surplus-maximizing users. We first analytically derive the optimal pricing mechanism that the service provider maximizes the service provider’s revenue under complete network information. Then we consider the(More)