5,063 research outputs found
Recommended from our members
On optimal designs for clinical trials: An updated review
Optimization of clinical trial designs can help investigators achieve higher qualityresults for the given resource constraints. The present paper gives an overviewof optimal designs for various important problems that arise in different stages ofclinical drug development, including phase I dose–toxicity studies; phase I/II studiesthat consider early efficacy and toxicity outcomes simultaneously; phase IIdose–response studies driven by multiple comparisons (MCP), modeling techniques(Mod), or their combination (MCP–Mod); phase III randomized controlled multiarmmulti-objective clinical trials to test difference among several treatment groups;and population pharmacokinetics–pharmacodynamics experiments. We find thatmodern literature is very rich with optimal design methodologies that can be utilizedby clinical researchers to improve efficiency of drug development
Sum Throughput Maximization in Multi-Tag Backscattering to Multiantenna Reader
Backscatter communication (BSC) is being realized as the core technology for
pervasive sustainable Internet-of-Things applications. However, owing to the
resource-limitations of passive tags, the efficient usage of multiple antennas
at the reader is essential for both downlink excitation and uplink detection.
This work targets at maximizing the achievable sum-backscattered-throughput by
jointly optimizing the transceiver (TRX) design at the reader and
backscattering coefficients (BC) at the tags. Since, this joint problem is
nonconvex, we first present individually-optimal designs for the TRX and BC. We
show that with precoder and {combiner} designs at the reader respectively
targeting downlink energy beamforming and uplink Wiener filtering operations,
the BC optimization at tags can be reduced to a binary power control problem.
Next, the asymptotically-optimal joint-TRX-BC designs are proposed for both low
and high signal-to-noise-ratio regimes. Based on these developments, an
iterative low-complexity algorithm is proposed to yield an efficient
jointly-suboptimal design. Thereafter, we discuss the practical utility of the
proposed designs to other application settings like wireless powered
communication networks and BSC with imperfect channel state information.
Lastly, selected numerical results, validating the analysis and shedding novel
insights, demonstrate that the proposed designs can yield significant
enhancement in the sum-backscattered throughput over existing benchmarks.Comment: 17 pages, 5 figures, accepted for publication in IEEE Transactions on
Communication
Coordinated Multicast Beamforming in Multicell Networks
We study physical layer multicasting in multicell networks where each base
station, equipped with multiple antennas, transmits a common message using a
single beamformer to multiple users in the same cell. We investigate two
coordinated beamforming designs: the quality-of-service (QoS) beamforming and
the max-min SINR (signal-to-interference-plus-noise ratio) beamforming. The
goal of the QoS beamforming is to minimize the total power consumption while
guaranteeing that received SINR at each user is above a predetermined
threshold. We present a necessary condition for the optimization problem to be
feasible. Then, based on the decomposition theory, we propose a novel
decentralized algorithm to implement the coordinated beamforming with limited
information sharing among different base stations. The algorithm is guaranteed
to converge and in most cases it converges to the optimal solution. The max-min
SINR (MMS) beamforming is to maximize the minimum received SINR among all users
under per-base station power constraints. We show that the MMS problem and a
weighted peak-power minimization (WPPM) problem are inverse problems. Based on
this inversion relationship, we then propose an efficient algorithm to solve
the MMS problem in an approximate manner. Simulation results demonstrate
significant advantages of the proposed multicast beamforming algorithms over
conventional multicasting schemes.Comment: 10pages, 9 figure
Ergodic Randomized Algorithms and Dynamics over Networks
Algorithms and dynamics over networks often involve randomization, and
randomization may result in oscillating dynamics which fail to converge in a
deterministic sense. In this paper, we observe this undesired feature in three
applications, in which the dynamics is the randomized asynchronous counterpart
of a well-behaved synchronous one. These three applications are network
localization, PageRank computation, and opinion dynamics. Motivated by their
formal similarity, we show the following general fact, under the assumptions of
independence across time and linearities of the updates: if the expected
dynamics is stable and converges to the same limit of the original synchronous
dynamics, then the oscillations are ergodic and the desired limit can be
locally recovered via time-averaging.Comment: 11 pages; submitted for publication. revised version with fixed
technical flaw and updated reference
- …