494,013 research outputs found
Dynamic Subcarrier Allocation for 100 Gbps, 40 km OFDMA-PONs with SLA and CoS
This paper was published in Journal of Lightwave Technology and is made available as an electronic reprint with the permission of OSA. The paper can be found at the following URL on the OSA website: http://www.opticsinfobase.org/jlt/issue.cfm?volume=31&issue=7 Systematic or multiple reproduction or distribution to multiple locations via electronic or other means is prohibited and is subject to penalties under lawThe quality of service of 100Gbps orthogonal frequency division multiple access passive optical networks (OFDMA-PONs) performing dynamic bandwidth allocation is evaluated. New medium access control protocols and frame formats have been developed, exhibiting hybrid OFDMA/time division multiple access scheduling, for capacity enhancement and granular bandwidth allocation. The sequential dynamic subcarrier allocation algorithms allow the network optical line terminal to grant the optical network units (ONUs) bandwidth using both status and non-status based algorithm. Simulations of a 100 Gbps network with 256 ONUs, 256 subcarriers and 40 km extended-reach demonstrate best network throughputs of 87.5 Gbps and 3 ms packet delays for high priority service classes, even at maximum ONU load. In addition, high service level agreement (SLA) ONUs exhibit 1.56 Gbps maximum capacity and 48.82 kbps granularity.Peer reviewedFinal Accepted Versio
Novel Artificial Human Optimization Field Algorithms - The Beginning
New Artificial Human Optimization (AHO) Field Algorithms can be created from
scratch or by adding the concept of Artificial Humans into other existing
Optimization Algorithms. Particle Swarm Optimization (PSO) has been very
popular for solving complex optimization problems due to its simplicity. In
this work, new Artificial Human Optimization Field Algorithms are created by
modifying existing PSO algorithms with AHO Field Concepts. These Hybrid PSO
Algorithms comes under PSO Field as well as AHO Field. There are Hybrid PSO
research articles based on Human Behavior, Human Cognition and Human Thinking
etc. But there are no Hybrid PSO articles which based on concepts like Human
Disease, Human Kindness and Human Relaxation. This paper proposes new AHO Field
algorithms based on these research gaps. Some existing Hybrid PSO algorithms
are given a new name in this work so that it will be easy for future AHO
researchers to find these novel Artificial Human Optimization Field Algorithms.
A total of 6 Artificial Human Optimization Field algorithms titled "Human
Safety Particle Swarm Optimization (HuSaPSO)", "Human Kindness Particle Swarm
Optimization (HKPSO)", "Human Relaxation Particle Swarm Optimization (HRPSO)",
"Multiple Strategy Human Particle Swarm Optimization (MSHPSO)", "Human Thinking
Particle Swarm Optimization (HTPSO)" and "Human Disease Particle Swarm
Optimization (HDPSO)" are tested by applying these novel algorithms on Ackley,
Beale, Bohachevsky, Booth and Three-Hump Camel Benchmark Functions. Results
obtained are compared with PSO algorithm.Comment: 25 pages, 41 figure
Does algorithmic trading improve liquidity?
Algorithmic trading has sharply increased over the past decade. Equity market liquidity has improved as well. Are the two trends related? For a recent five-year panel of New York Stock Exchange (NYSE) stocks, we use a normalized measure of electronic message traffic (order submissions, cancellations, and executions) as a proxy for algorithmic trading, and we trace the associations between liquidity and message traffic. Based on within-stock variation, we find that algorithmic trading and liquidity are positively related. To sort out causality, we use the start of autoquoting on the NYSE as an exogenous instrument for algorithmic trading. Previously, specialists were responsible for manually disseminating the inside quote. As stocks were phased in gradually during early 2003, the manual quote was replaced by a new automated quote whenever there was a change to the NYSE limit order book. This market structure change provides quicker feedback to traders and algorithms and results in more message traffic. For large-cap stocks in particular, quoted and effective spreads narrow under autoquote and adverse selection declines, indicating that algorithmic trading does causally improve liquidity
Benchmarks for Parity Games (extended version)
We propose a benchmark suite for parity games that includes all benchmarks
that have been used in the literature, and make it available online. We give an
overview of the parity games, including a description of how they have been
generated. We also describe structural properties of parity games, and using
these properties we show that our benchmarks are representative. With this work
we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from
https://github.com/jkeiren/paritygame-generator. This is an extended version
of the paper that has been accepted for FSEN 201
A novel object tracking algorithm based on compressed sensing and entropy of information
Acknowledgments This research is supported by (1) the Ph.D. Programs Foundation of Ministry of Education of China under Grant no. 20120061110045, (2) the Science and Technology Development Projects of Jilin Province of China under Grant no. 20150204007G X, and (3) the Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry of China.Peer reviewedPublisher PD
New numerical approaches for modeling thermochemical convection in a compositionally stratified fluid
Seismic imaging of the mantle has revealed large and small scale
heterogeneities in the lower mantle; specifically structures known as large low
shear velocity provinces (LLSVP) below Africa and the South Pacific. Most
interpretations propose that the heterogeneities are compositional in nature,
differing in composition from the overlying mantle, an interpretation that
would be consistent with chemical geodynamic models. Numerical modeling of
persistent compositional interfaces presents challenges, even to
state-of-the-art numerical methodology. For example, some numerical algorithms
for advecting the compositional interface cannot maintain a sharp compositional
boundary as the fluid migrates and distorts with time dependent fingering due
to the numerical diffusion that has been added in order to maintain the upper
and lower bounds on the composition variable and the stability of the advection
method. In this work we present two new algorithms for maintaining a sharper
computational boundary than the advection methods that are currently openly
available to the computational mantle convection community; namely, a
Discontinuous Galerkin method with a Bound Preserving limiter and a
Volume-of-Fluid interface tracking algorithm. We compare these two new methods
with two approaches commonly used for modeling the advection of two distinct,
thermally driven, compositional fields in mantle convection problems; namely,
an approach based on a high-order accurate finite element method advection
algorithm that employs an artificial viscosity technique to maintain the upper
and lower bounds on the composition variable as well as the stability of the
advection algorithm and the advection of particles that carry a scalar quantity
representing the location of each compositional field. All four of these
algorithms are implemented in the open source FEM code ASPECT
Route Planning in Transportation Networks
We survey recent advances in algorithms for route planning in transportation
networks. For road networks, we show that one can compute driving directions in
milliseconds or less even at continental scale. A variety of techniques provide
different trade-offs between preprocessing effort, space requirements, and
query time. Some algorithms can answer queries in a fraction of a microsecond,
while others can deal efficiently with real-time traffic. Journey planning on
public transportation systems, although conceptually similar, is a
significantly harder problem due to its inherent time-dependent and
multicriteria nature. Although exact algorithms are fast enough for interactive
queries on metropolitan transit systems, dealing with continent-sized instances
requires simplifications or heavy preprocessing. The multimodal route planning
problem, which seeks journeys combining schedule-based transportation (buses,
trains) with unrestricted modes (walking, driving), is even harder, relying on
approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4,
previously published by Microsoft Research. This work was mostly done while
the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at
Microsoft Research Silicon Valle
- …