5,293 research outputs found
On the framing of patent citations and academic paper citations in refl ecting knowledge linkage: A discussion of the discrepancy of their divergent value-orientations
It has been widely recognized that academic paper citations will reflect scientific knowledge linkage. Patent citations are similar to academic paper citations in many aspects: Citation frequency distribution is often skewed; citation frequency varies from one subject field to another and authors’/inventors’preference for citing relevant literature is usually confined to their own native language. However, regardless of these seemingly similarities, the patent citation is unique and special. It is constructed by incorporating information providers from multiple sources, such as from examiners, inventors, attorneys and/or the public. It is driven by a value-orientation for the monopolization of market production under regulations of Patent Laws. It is also practiced under the sway of an industrial culture embedded with a notion of “creative destruction”. In view of the contextual complexities of patent citations, simply applying the data criteria and citation behavior analysis of academic paper citations to that of patentbibliometrics for the purpose of reflecting knowledge linkage is both conceptually and technically illogical and unreasonable. This paper attempts to delve into the issue of the currently misconceived assertions and practice about "transplanting” the methodology of academic paper citations en masse indiscriminately into the practice of patent citations. It is hoped that such a study would yield improved result stemming from the practice of patent citations for reflecting knowledge linkage in the future.</p
Secrecy Wireless Information and Power Transfer in OFDMA Systems
In this paper, we consider simultaneous wireless information and power
transfer (SWIPT) in orthogonal frequency division multiple access (OFDMA)
systems with the coexistence of information receivers (IRs) and energy
receivers (ERs). The IRs are served with best-effort secrecy data and the ERs
harvest energy with minimum required harvested power. To enhance physical-layer
security and yet satisfy energy harvesting requirements, we introduce a new
frequency-domain artificial noise based approach. We study the optimal resource
allocation for the weighted sum secrecy rate maximization via transmit power
and subcarrier allocation. The considered problem is non-convex, while we
propose an efficient algorithm for solving it based on Lagrange duality method.
Simulation results illustrate the effectiveness of the proposed algorithm as
compared against other heuristic schemes.Comment: To appear in Globecom 201
Outage Capacity and Optimal Transmission for Dying Channels
In wireless networks, communication links may be subject to random fatal
impacts: for example, sensor networks under sudden power losses or cognitive
radio networks with unpredictable primary user spectrum occupancy. Under such
circumstances, it is critical to quantify how fast and reliably the information
can be collected over attacked links. For a single point-to-point channel
subject to a random attack, named as a \emph{dying channel}, we model it as a
block-fading (BF) channel with a finite and random delay constraint. First, we
define the outage capacity as the performance measure, followed by studying the
optimal coding length such that the outage probability is minimized when
uniform power allocation is assumed. For a given rate target and a coding
length , we then minimize the outage probability over the power allocation
vector \mv{P}_{K}, and show that this optimization problem can be cast into a
convex optimization problem under some conditions. The optimal solutions for
several special cases are discussed.
Furthermore, we extend the single point-to-point dying channel result to the
parallel multi-channel case where each sub-channel is a dying channel, and
investigate the corresponding asymptotic behavior of the overall outage
probability with two different attack models: the independent-attack case and
the -dependent-attack case. It can be shown that the overall outage
probability diminishes to zero for both cases as the number of sub-channels
increases if the \emph{rate per unit cost} is less than a certain threshold.
The outage exponents are also studied to reveal how fast the outage probability
improves over the number of sub-channels.Comment: 31 pages, 9 figures, submitted to IEEE Transactions on Information
Theor
On Design of Collaborative Beamforming for Two-Way Relay Networks
We consider a two-way relay network, where two source nodes, S1 and S2,
exchange information through a cluster of relay nodes. The relay nodes receive
the sum signal from S1 and S2 in the first time slot. In the second time slot,
each relay node multiplies its received signal by a complex coefficient and
retransmits the signal to the two source nodes, which leads to a collaborative
two-way beamforming system. By applying the principle of analog network coding,
each receiver at S1 and S2 cancels the "self-interference" in the received
signal from the relay cluster and decodes the message. This paper studies the
2-dimensional achievable rate region for such a two-way relay network with
collaborative beamforming. With different assumptions of channel reciprocity
between the source-relay and relay-source channels, the achievable rate region
is characterized under two setups. First, with reciprocal channels, we
investigate the achievable rate regions when the relay cluster is subject to a
sum-power constraint or individual-power constraints. We show that the optimal
beamforming vectors obtained from solving the weighted sum inverse-SNR
minimization (WSISMin) problems are sufficient to characterize the
corresponding achievable rate region. Furthermore, we derive the closed form
solutions for those optimal beamforming vectors and consequently propose the
partially distributed algorithms to implement the optimal beamforming, where
each relay node only needs the local channel information and one global
parameter. Second, with the non-reciprocal channels, the achievable rate
regions are also characterized for both the sum-power constraint case and the
individual-power constraint case. Although no closed-form solutions are
available under this setup, we present efficient numerical algorithms.Comment: new version of the previously posted, single column double spacing,
24 page
- …