Signal Transmission in the Auditory System

Contains table of contents for Section 3, an introduction, and reports on seven research projects.National Institutes of Health Grant 5 R01 DC00194National Institutes of Health Grant P01 DC00119National Institutes of Health Grant F32 DC00073National Institutes of Health Grant 5 R01 DC00473National Institutes of Health Grant 2 R01 DC00238National Institutes of Health Grant 2 R01 DC00235National Institutes of Health Grant 5 P01 DC00361National Institutes of Health Grant T32 DC00006Whitaker Health Sciences Fun

The Spectrometer/Telescope for Imaging X-rays (STIX)

Aims. The Spectrometer Telescope for Imaging X-rays (STIX) on Solar Orbiter is a hard X-ray imaging spectrometer, which covers the energy range from 4 to 150 keV. STIX observes hard X-ray bremsstrahlung emissions from solar flares and therefore provides diagnostics of the hottest (⪆10 MK) flare plasma while quantifying the location, spectrum, and energy content of flare-accelerated nonthermal electrons. Methods. To accomplish this, STIX applies an indirect bigrid Fourier imaging technique using a set of tungsten grids (at pitches from 0.038 to 1 mm) in front of 32 coarsely pixelated CdTe detectors to provide information on angular scales from 7 to 180 arcsec with 1 keV energy resolution (at 6 keV). The imaging concept of STIX has intrinsically low telemetry and it is therefore well-suited to the limited resources available to the Solar Orbiter payload. To further reduce the downlinked data volume, STIX data are binned on board into 32 selectable energy bins and dynamically-adjusted time bins with a typical duration of 1 s during flares. Results. Through hard X-ray diagnostics, STIX provides critical information for understanding the acceleration of electrons at the Sun and their transport into interplanetary space and for determining the magnetic connection of Solar Orbiter back to the Sun. In this way, STIX serves to link Solar Orbiter’s remote and in-situ measurements

Signal Transmission in the Auditory System

Contains table of contents for Section 3 and reports on nine research projects.National Institutes of Health (Grant 5 P01 NS13126)National Institutes of Health (Grant 5 P01 NS23734)National Institutes of Health (Grant 5 R01 NS18682)National Institutes of Health (Grant 5 RO1 NS25995)National Institutes of Health (Grant 5 R01 NS20269)National Institutes of Health (Grant 5 R01 NS20322)National Institutes of Health (Grant 5 T32 NS07047)Johnson and Johnson Foundatio

Open problems on graph coloring for special graph classes.

For a given graph G and integer k, the Coloring problem is that of testing whether G has a k-coloring, that is, whether there exists a vertex mapping c:V→{1,2,…}c:V→{1,2,…} such that c(u)≠c(v)c(u)≠c(v) for every edge uv∈Euv∈E. We survey known results on the computational complexity of Coloring for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of on-line coloring

Signal Transmission in the Auditory System

Contains table of contents for Section 3, an introduction and reports on six research projects.Health Sciences FundNational Institutes of Health Grant 5 R01 DC00194National Institutes of Health Grant 8 P01 DC00119National Institutes of Health Grant 5 R01 DC00473National Institutes of Health Grant 5 R01 DC00238National Institutes of Health Grant 5 T32 DC00006National Institutes of Health Grant 5 P01 DC00361National Institutes of Health Grant 5 R01 DC00235Peoples Republic of China FellowshipUnisys Corporation Doctoral FellowshipWhitaker Health Sciences Fellowshi

On the Boolean-Width of a Graph: Structure and Applications

International audienceBoolean-width is a recently introduced graph invariant. Similar to tree-width, it measures the structural complexity of graphs. Given any graph $G$ and a decomposition of $G$ of boolean-width $k$, we give algorithms solving a large class of vertex subset and vertex partitioning problems in time $O^*(2^{O(k^2)})$. We relate the boolean-width of a graph to its branch-width and to the boolean-width of its incidence graph. For this we use a constructive proof method that also allows much simpler proofs of similar results on rank-width in [S. Oum. Rank-width is less than or equal to branch-width. \emph{Journal of Graph Theory} 57(3):239--244, 2008]. For an $n$-vertex random graph, with a uniform edge distribution, we show that almost surely its boolean-width is $\Theta(\log^2 n)$ -- setting boolean-width apart from other graph invariants -- and it is easy to find a decomposition witnessing this. Combining our results gives algorithms that on input a random graph on $n$ vertices will solve a large class of vertex subset and vertex partitioning problems in quasi-polynomial time $O^*(2^{O(\log ^4 n)})$

Communications Biophysics

Contains research objectives and reports on eight research projects split into three sections.National Institutes of Health (Grant 2 PO1 NS13126)National Institutes of Health (Grant 5 RO1 NS18682)National Institutes of Health (Grant 5 RO1 NS20322)National Institutes of Health (Grant 1 RO1 NS 20269)National Institutes of Health (Grant 5 T32 NS 07047)Symbion, Inc.National Institutes of Health (Grant 5 R01 NS10916)National Institutes of Health (Grant 1 RO NS 16917)National Science Foundation (Grant BNS83-19874)National Science Foundation (Grant BNS83-19887)National Institutes of Health (Grant 5 RO1 NS12846)National Institutes of Health (Grant 1 RO1 NS21322-01)National Institutes of Health (Grant 5 T32-NS07099-07)National Institutes of Health (Grant 1 RO1 NS14092-06)National Science Foundation (Grant BNS77-21751)National Institutes of Health (Grant 5 RO1 NS11080

Signal Transmission in the Auditory System

Contains table of contents for Section 3, an introduction and reports on nine research projects.National Institutes of Health Grant 5 T32 NS07047National Institutes of Health Grant 5 P01 NS13126National Institutes of Health Grant 8 R01 DC00194National Institutes of Health Grant 5 R01 NS25995National Institutes of Health Grant 8 R01 DC00238National Institutes of Health Grant 5 R01 NS20322National Institutes of Health Grant 5 R01 DC00235National Institutes of Health Grant 5 R01 NS20269National Institutes of Health Grant 1 P01 NS23734Johnson and Johnson FoundationUnisys Corporation Doctoral Fellowshi

Communications Biophysics

Contains reports on seven research projects split into three sections, with research objective for the final section.National Institutes of Health (Grant 2 PO1 NS 13126)National Institutes of Health (Grant 5 RO1 NS 18682)National Institutes of Health (Grant 1 RO1 NS 20322)National Institutes of Health (Grant 1 RO1 NS 20269)National Institutes of Health (Grant 5 T32 NS 07047)Symbion, Inc.National Institutes of Health (Grant 5 RO1 NS10916)National Institutes of Health (Grant 1 RO1 NS16917)National Science Foundation (Grant BNS83-19874)National Science Foundation (Grant BNS83-19887)National Institutes of Health (Grant 5 RO1 NS12846)National Institutes of Health (Grant 5 RO1 NS21322)National Institutes of Health (Grant 5 RO1 NS 11080