Comparison of AGN and Nuclear Starburst Activity in Seyfert 1 and 2 Galaxies over a Wide Luminosity Range Based on Near-infrared 2-4 micrometer Spectroscopy

We present near-infrared K- (1.9-2.5 micrometer) and L- (2.8-4.2 micrometer) band spectroscopy of 22 Seyfert nuclei. We use two methods to investigate the presence of nuclear starbursts: (1) the Polycyclic Aromatic Hydrocarbon (PAH) emission feature at lambda_rest = 3.3 micrometer in the rest frame of L-band spectrum (a starburst indicator) and (2) the CO absorption feature at lambda_rest = 2.3-2.4 micrometer in the rest frame of the K-band spectrum, originating in the CO molecule. We clearly detected the 3.3 micrometer PAH emission features in five objects and the CO absorption features in 17 objects. Seyfert 2 galaxies tend to show bluer K-L colors compared with Seyfert 1 galaxies. We interpret the discrepancy as resulting from relative strength of stellar emission because AGN emission is affected by dust extinction. The 3.3 micrometer PAH emission luminosity (L_3.3PAH) distributions for the Seyfert 1s and Seyfert 2s are very similar when normalized to the AGN power. Star-formation rates estimated from L_3.3PAH could be large enough to inflate the dusty torus by supernova explosion. We find that L_3.3PAH positively correlates with N-band luminosity with small aperture over a wide AGN luminosity range, and is independent of physical area we probed. The results suggest that nuclear region has a concentration of star formation and the star formation would control AGN activity.Comment: 21 pages, 9 figures, 3 tables, accepted for publication in PAS

Infrared 3-4 Micron Spectroscopy of Nearby PG QSOs and AGN-Nuclear Starburst Connections in High-luminosity AGN Populations

We present the results of infrared L-band (3-4 micron) slit spectroscopy of 30 PG QSOs at z < 0.17, the representative sample of local high-luminosity, optically selected AGNs. The 3.3 micron polycyclic aromatic hydrocarbon (PAH) emission feature is used to probe nuclear (< a few kpc) starburst activity and to investigate the connections between AGNs and nuclear starbursts in PG QSOs. The 3.3 micron PAH emission is detected in the individual spectra of 5/30 of the observed PG QSOs. We construct a composite spectrum of PAH-undetected PG QSOs and discern the presence of the 3.3 micron PAH emission therein. We estimate the nuclear-starburst and AGN luminosities from the observed 3.3 micron PAH emission and 3.35 micron continuum luminosities, respectively, and find that the nuclear-starburst-to-AGN luminosity ratios in PG QSOs are similar to those of previously studied AGN populations with lower luminosities, suggesting that AGN-nuclear starburst connections are valid over the wide luminosity range of AGNs in the local universe. The observed nuclear-starburst-to-AGN luminosity ratios in PG QSOs with available supermassive black hole masses are comparable to a theoretical prediction based on the assumption that the growth of a supermassive black hole is controlled by starburst-induced turbulence.Comment: 10 pages, 5 figures, accepted for publication in PASJ (No. 63, 2011 March, Subaru special issue

Dynamic Steiner Tree Problem

This paper proposes a new problem, which we call the Dynamic Steiner Tree Problem. This is related to multipoint connection routing in communications networks, where the set of nodes to be connected changes over time. This problem can be divided into two cases, one in which rearrangement of existing routes is not allowed and a second in which rearrangement is allowed. In the first case, we show that there is no algorithm whose worst error ratio is less than 1/2 log n where n is the number of nodes to be connected. In the second case, we present an algorithm whose error rate is bounded by a constant and rearrangement is relatively small

On chip interconnects for multiprocessor turbo decoding architectures

International audienc

Comparison of AGN and Nuclear Starburst Activity in Seyfert 1 and 2 Galaxies over a Wide Luminosity Range Based on Near-infrared 2-4 micrometer Spectroscopy

We present near-infrared K- (1.9-2.5 micrometer) and L- (2.8-4.2 micrometer) band spectroscopy of 22 Seyfert nuclei. We use two methods to investigate the presence of nuclear starbursts: (1) the Polycyclic Aromatic Hydrocarbon (PAH) emission feature at lambda_rest = 3.3 micrometer in the rest frame of L-band spectrum (a starburst indicator) and (2) the CO absorption feature at lambda_rest = 2.3-2.4 micrometer in the rest frame of the K-band spectrum, originating in the CO molecule. We clearly detected the 3.3 micrometer PAH emission features in five objects and the CO absorption features in 17 objects. Seyfert 2 galaxies tend to show bluer K-L colors compared with Seyfert 1 galaxies. We interpret the discrepancy as resulting from relative strength of stellar emission because AGN emission is affected by dust extinction. The 3.3 micrometer PAH emission luminosity (L_3.3PAH) distributions for the Seyfert 1s and Seyfert 2s are very similar when normalized to the AGN power. Star-formation rates estimated from L_3.3PAH could be large enough to inflate the dusty torus by supernova explosion. We find that L_3.3PAH positively correlates with N-band luminosity with small aperture over a wide AGN luminosity range, and is independent of physical area we probed. The results suggest that nuclear region has a concentration of star formation and the star formation would control AGN activity.Comment: 21 pages, 9 figures, 3 tables, accepted for publication in PAS

Quantifying the Economic Benefits of the Non-profit Organization in Japan - Setting the Non-profit Performance to the I-O Table

As social needs become more diversified and the market economy makes further inroads, peoples'expectations for non-profit organizations (NPOs) have grown. In the past few years Japan has experienced a significant surge of various nonprofit activities led by the civil sector, in fields where services by the government and business have not been sufficient, such as community building, recycling, and welfare services. These activities have gathered momentum since the Great Hanshin-Awaji Earthquake in 1995 and the enactment of the NPO law in 1998. Although media, books and reports introduced these NPO activities, there are quite a few which now provide us with macro-based and quantitative information. In this paper, we quantified the non-profit economic activities in Japan by resetting the non-profit performance to the Input-output Table.

Analysis of Performance of Dynamic Multicast Routing Algorithms

In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of the algorithms, in which a comparison is made with the greedy and core based tree techniques. The effects of the tree source location on dynamic membership change are also examined. The simulations demonstrate that the Source Optimised Tree algorithm achieves a significant improvement in terms of delay and link usage when compared to the Core Based Tree, and greedy algorithm

A Superstabilizing log⁡(n)\log(n)-Approximation Algorithm for Dynamic Steiner Trees

In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\log |S|$ times the cost of an optimal solution, where $S$ is the group of members. Our algorithm improves over existing solutions in several ways. First, it tolerates the dynamism of both the group members and the network. Next, our algorithm is self-stabilizing, that is, it copes with nodes memory corruption. Last but not least, our algorithm is \emph{superstabilizing}. That is, while converging to a correct configuration (i.e., a Steiner tree) after a modification of the network, it keeps offering the Steiner tree service during the stabilization time to all members that have not been affected by this modification

Relaxing the Irrevocability Requirement for Online Graph Algorithms

Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request can be accepted at a later point, but any acceptance is irrevocable. Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption). Finally, we consider the Late Accept/Reject model, where late accepts and rejects are both allowed, but any late reject is irrevocable. For Independent Set, the Late Accept/Reject model is necessary to obtain a constant competitive ratio, but for Vertex Cover the Late Accept model is sufficient and for Minimum Spanning Forest the Late Reject model is sufficient. The Matching problem has a competitive ratio of 2, but in the Late Accept/Reject model, its competitive ratio is 3/2

Pushing the online matrix-vector conjecture off-line and identifying its easy cases

© Springer Nature Switzerland AG 2019. Henzinger et al. posed the so called Online Boolean Matrix-vector Multiplication (OMv) conjecture and showed that it implies tight hardness results for several basic partially dynamic or dynamic problems [STOC’15]. We show that the OMv conjecture is implied by a simple off-line conjecture. If a not uniform (i.e., it might be different for different matrices) polynomial-time preprocessing of the matrix in the OMv conjecture is allowed then we can show such a variant of the OMv conjecture to be equivalent to our off-line conjecture. On the other hand, we show that the OMV conjecture does not hold in the restricted cases when the rows of the matrix or the input vectors are clustered