1,668 research outputs found
Ensuring Trust in One Time Exchanges: Solving the QoS Problem
We describe a pricing structure for the provision of IT services that ensures
trust without requiring repeated interactions between service providers and
users. It does so by offering a pricing structure that elicits truthful
reporting of quality of service (QoS) by providers while making them
profitable. This mechanism also induces truth-telling on the part of users
reserving the service
Novel Si(1-x)Ge(x)/Si heterojunction internal photoemission long wavelength infrared detectors
There is a major need for long-wavelength-infrared (LWIR) detector arrays in the range of 8 to 16 microns which operate with close-cycle cryocoolers above 65 K. In addition, it would be very attractive to have Si-based infrared (IR) detectors that can be easily integrated with Si readout circuitry and have good pixel-to-pixel uniformity, which is critical for focal plane array (FPA) applications. Here, researchers report a novel Si(1-x)Ge(x)/Si heterojunction internal photoemission (HIP) detector approach with a tailorable long wavelength infrared cutoff wavelength, based on internal photoemission over the Si(1-x)Ge(x)/Si heterojunction. The HIP detectors were grown by molecular beam epitaxy (MBE), which allows one to optimize the device structure with precise control of doping profiles, layer thickness and composition. The feasibility of a novel Si(1-x)Ge(x)/Si HIP detector has been demonstrated with tailorable cutoff wavelength in the LWIR region. Photoresponse at wavelengths 2 to 10 microns are obtained with quantum efficiency (QE) above approx. 1 percent in these non-optimized device structures. It should be possible to significantly improve the QE of the HIP detectors by optimizing the thickness, composition, and doping concentration of the Si(1-x)Ge(x) layers and by configuring the detector for maximum absorption such as the use of a cavity structure. With optimization of the QE and by matching the barrier energy to the desired wavelength cutoff to minimize the thermionic current, researchers predict near background limited performance in the LWIR region with operating temperatures above 65K. Finally, with mature Si processing, the relatively simple device structure offers potential for low-cost producible arrays with excellent uniformity
Properties of weighted complex networks
We study two kinds of weighted networks, weighted small-world (WSW) and
weighted scale-free (WSF). The weight of a link between nodes and
in the network is defined as the product of endpoint node degrees; that is
. In contrast to adding weights to links during
networks being constructed, we only consider weights depending on the ``
popularity\rq\rq of the nodes represented by their connectivity. It was found
that the both weighted networks have broad distributions on characterization
the link weight, vertex strength, and average shortest path length.
Furthermore, as a survey of the model, the epidemic spreading process in both
weighted networks was studied based on the standard \emph{susceptible-infected}
(SI) model. The spreading velocity reaches a peak very quickly after the
infection outbreaks and an exponential decay was found in the long time
propagation.Comment: 14 pages, 5 figure
Log-Networks
We introduce a growing network model in which a new node attaches to a
randomly-selected node, as well as to all ancestors of the target node. This
mechanism produces a sparse, ultra-small network where the average node degree
grows logarithmically with network size while the network diameter equals 2. We
determine basic geometrical network properties, such as the size dependence of
the number of links and the in- and out-degree distributions. We also compare
our predictions with real networks where the node degree also grows slowly with
time -- the Internet and the citation network of all Physical Review papers.Comment: 7 pages, 6 figures, 2-column revtex4 format. Version 2: minor changes
in response to referee comments and to another proofreading; final version
for PR
Effect of the accelerating growth of communications networks on their structure
Motivated by data on the evolution of the Internet and World Wide Web we
consider scenarios of self-organization of the nonlinearly growing networks
into free-scale structures. We find that the accelerating growth of the
networks establishes their structure. For the growing networks with
preferential linking and increasing density of links, two scenarios are
possible. In one of them, the value of the exponent of the
connectivity distribution is between 3/2 and 2. In the other, and
the distribution is necessarily non-stationary.Comment: 4 pages revtex, 3 figure
Scaling Behaviour of Developing and Decaying Networks
We find that a wide class of developing and decaying networks has scaling
properties similar to those that were recently observed by Barab\'{a}si and
Albert in the particular case of growing networks. The networks considered here
evolve according to the following rules: (i) Each instant a new site is added,
the probability of its connection to old sites is proportional to their
connectivities. (ii) In addition, (a) new links between some old sites appear
with probability proportional to the product of their connectivities or (b)
some links between old sites are removed with equal probability.Comment: 7 pages (revtex
Effects of aging and links removal on epidemic dynamics in scale-free networks
We study the combined effects of aging and links removal on epidemic dynamics
in the Barab\'{a}si-Albert scale-free networks. The epidemic is described by a
susceptible-infected-refractory (SIR) model. The aging effect of a node
introduced at time is described by an aging factor of the form
in the probability of being connected to newly added nodes
in a growing network under the preferential attachment scheme based on
popularity of the existing nodes. SIR dynamics is studied in networks with a
fraction of the links removed. Extensive numerical simulations reveal
that there exists a threshold such that for , epidemic
breaks out in the network. For , only a local spread results. The
dependence of on is studied in detail. The function
separates the space formed by and into regions
corresponding to local and global spreads, respectively.Comment: 8 pages, 3 figures, revtex, corrected Ref.[11
Maximum flow and topological structure of complex networks
The problem of sending the maximum amount of flow between two arbitrary
nodes and of complex networks along links with unit capacity is
studied, which is equivalent to determining the number of link-disjoint paths
between and . The average of over all node pairs with smaller degree
is for large with a constant implying that the statistics of is related to the
degree distribution of the network. The disjoint paths between hub nodes are
found to be distributed among the links belonging to the same edge-biconnected
component, and can be estimated by the number of pairs of edge-biconnected
links incident to the start and terminal node. The relative size of the giant
edge-biconnected component of a network approximates to the coefficient .
The applicability of our results to real world networks is tested for the
Internet at the autonomous system level.Comment: 7 pages, 4 figure
Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
We generalize the Barab\'{a}si--Albert's model of growing networks accounting
for initial properties of sites and find exactly the distribution of
connectivities of the network and the averaged connectivity
of a site in the instant (one site is added per unit of
time). At long times at and
at , where the exponent
varies from 2 to depending on the initial attractiveness of sites. We
show that the relation between the exponents is universal.Comment: 4 pages revtex (twocolumn, psfig), 1 figur
- …