1,630 research outputs found
Simple extractors via constructions of cryptographic pseudo-random generators
Trevisan has shown that constructions of pseudo-random generators from hard
functions (the Nisan-Wigderson approach) also produce extractors. We show that
constructions of pseudo-random generators from one-way permutations (the
Blum-Micali-Yao approach) can be used for building extractors as well. Using
this new technique we build extractors that do not use designs and
polynomial-based error-correcting codes and that are very simple and efficient.
For example, one extractor produces each output bit separately in
time. These extractors work for weak sources with min entropy , for
arbitrary constant , have seed length , and their
output length is .Comment: 21 pages, an extended abstract will appear in Proc. ICALP 2005; small
corrections, some comments and references adde
Pasta-making properties of the new durum wheat variety biensur suitable for the northern mediterranean environment
Industrial pasta is commonly made from mixtures of semolina from different durum wheat varieties, and there is a very low market presence of mono-varietal pasta from local, short supply chains. In this work, dough rheological properties and pasta quality traits of the new durum wheat cv. Biensur, which has a high HMW/LMW-GS ratio, were evaluated with a view to developing short-chain, mono-varietal pasta production in NE Italy. Chemical and sensory analyses on short-cut pasta, viz. tubetti, made with semolina from cv. Biensur at two drying temperatures revealed that it has good technological characteristics and stability, excellent cooking and sensory properties, and is comparable to the high-quality commercial reference cv. Aureo. We conclude that Biensur provides farmers and traders with new market opportunities and offers improvements to the environmental and economic sustainability of the durum wheat chain
Deep Chandra Observations of HCG 16 - I. Active Nuclei, Star formation and Galactic Winds
We present new, deep Chandra X-ray and Giant Metrewave Radio Telescope
610~MHz observations of the spiral-galaxy-rich compact group HCG 16, which we
use to examine nuclear activity, star formation and the high luminosity X-ray
binary populations in the major galaxies. We confirm the presence of obscured
active nuclei in NGC 833 and NGC 835, and identify a previously unrecognized
nuclear source in NGC 838. All three nuclei are variable on timescales of
months to years, and for NGC 833 and NGC 835 this is most likely caused by
changes in accretion rate. The deep Chandra observations allow us to detect for
the first time an Fe-K emission line in the spectrum of the Seyfert 2
nucleus of NGC 835. We find that NGC 838 and NGC 839 are both
starburst-dominated systems, with only weak nuclear activity, in agreement with
previous optical studies. We estimate the star formation rates in the two
galaxies from their X-ray and radio emission, and compare these results with
estimates from the infra-red and ultra-violet bands to confirm that star
formation in both galaxies is probably declining after galaxy-wide starbursts
were triggered ~400-500 Myr ago. We examine the physical properties of their
galactic superwinds, and find that both have temperatures of ~0.8 keV. We also
examine the X-ray and radio properties of NGC 848, the fifth largest galaxy in
the group, and show that it is dominated by emission from its starburst.Comment: 18 pages, 11 figures, 11 tables, accepted for publication in ApJ;
updated references and fixed typos identified at proof stag
On Upward Drawings of Trees on a Given Grid
Computing a minimum-area planar straight-line drawing of a graph is known to
be NP-hard for planar graphs, even when restricted to outerplanar graphs.
However, the complexity question is open for trees. Only a few hardness results
are known for straight-line drawings of trees under various restrictions such
as edge length or slope constraints. On the other hand, there exist
polynomial-time algorithms for computing minimum-width (resp., minimum-height)
upward drawings of trees, where the height (resp., width) is unbounded.
In this paper we take a major step in understanding the complexity of the
area minimization problem for strictly-upward drawings of trees, which is one
of the most common styles for drawing rooted trees. We prove that given a
rooted tree and a grid, it is NP-hard to decide whether
admits a strictly-upward (unordered) drawing in the given grid.Comment: Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
Uncertainty inequalities on groups and homogeneous spaces via isoperimetric inequalities
We prove a family of uncertainty inequalities on fairly general groups
and homogeneous spaces, both in the smooth and in the discrete setting. The
crucial point is the proof of the endpoint, which is derived from a
general weak isoperimetric inequality.Comment: 17 page
- …