7,435 research outputs found
Syntactic Complexity of Circular Semi-Flower Automata
We investigate the syntactic complexity of certain types of finitely
generated submonoids of a free monoid. In fact, we consider those submonoids
which are accepted by circular semi-flower automata (CSFA). Here, we show that
the syntactic complexity of CSFA with at most one `branch point going in' (bpi)
is linear. Further, we prove that the syntactic complexity of -state CSFA
with two bpis over a binary alphabet is
Higgs boson production through annihilation at threshold in NLO QCD
We present threshold enhanced NLO QCD corrections to inclusive Higgs
production through bottom anti-bottom annihilation at hadron colliders using
threshold resummed cross section. The resummed cross section is obtained using
factorization properties and Sudakov resummation of the inclusive cross
section. We use the recent results on threshold NLO corrections in QCD for
Drell-Yan production and three loop QCD corrections to Higgs form factor with
bottom anti-bottom quark to achieve this task. This is the first step towards
the evaluation of complete NLO result. We have numerically demonstrated the
importance of such corrections at the LHC.Comment: 15 pages, 1 figur
SAFIUS - A secure and accountable filesystem over untrusted storage
We describe SAFIUS, a secure accountable file system that resides over an
untrusted storage. SAFIUS provides strong security guarantees like
confidentiality, integrity, prevention from rollback attacks, and
accountability. SAFIUS also enables read/write sharing of data and provides the
standard UNIX-like interface for applications. To achieve accountability with
good performance, it uses asynchronous signatures; to reduce the space required
for storing these signatures, a novel signature pruning mechanism is used.
SAFIUS has been implemented on a GNU/Linux based system modifying OpenGFS.
Preliminary performance studies show that SAFIUS has a tolerable overhead for
providing secure storage: while it has an overhead of about 50% of OpenGFS in
data intensive workloads (due to the overhead of performing
encryption/decryption in software), it is comparable (or better in some cases)
to OpenGFS in metadata intensive workloads.Comment: 11pt, 12 pages, 16 figure
- …