Revisiting the Cosmic Star Formation History: Caution on the Uncertainties in Dust Correction and Star Formation Rate Conversion

The cosmic star formation rate density (CSFRD) has been observationally investigated out to redshift z~10. However, most of theoretical models for galaxy formation underpredict the CSFRD at z>1. Since the theoretical models reproduce the observed luminosity functions (LFs), luminosity densities (LDs), and stellar mass density at each redshift, this inconsistency does not simply imply that theoretical models should incorporate some missing unknown physical processes in galaxy formation. Here, we examine the cause of this inconsistency in UV wavelengths by using a mock catalog of galaxies generated by a semi-analytic model of galaxy formation. We find that this inconsistency is due to two observational uncertainties: dust obscuration correction and conversion from UV luminosity to star formation rate (SFR). The methods for correction of obscuration and SFR conversion used in observational studies result in the overestimation of CSFRD by ~ 0.1-0.3 dex and ~ 0.1-0.2 dex, respectively, compared to the results obtained directly from our mock catalog. We present new empirical calibrations for dust attenuation and conversion from observed UV LFs and LDs into CSFRD.Comment: 12 pages including 11 figures. matches the published version (ApJ 2013 Jan. 20 issue

Studies on Hypoplastic Anemia (panmyelopathy); (Mainly depending on our departmental experiences)

In Japan, hypoplastic anemia has ever been presenting one of the most important problems among today's anemic diseases, it having proved as great frequency as that of pernicious anemia found both in Europe and America; besides, no fit therapeutic method been discovered as yet. Generally speaking, this disease shows a decrease of entire corpuscles, the bleeding tendency becoming prevalent in most cases; yet as to signs in concern to bone marrow, the number of nuclear cell is not fixed, as it has proved 16, 200 at the lowset, while, 263, 000 at the highest. Consequently, it has been classified into 5 types in our department, in view to obstructions of bone marrow. 1. Type of bloodcell-arrest. 2. Type of maturation-arrest. 3. Type of disturbanced regeneration. 4. Mixed type. 5. Panmyelophthisis. When we took record about 23 cases of hypoplastic patients, results were as follows; 1st type 7, 2nd type 2, 3rd type 3, 4th type 8, and 3 cases of 5th type. In all serum iron value proved an increase; in view to intravenous iron tolerance test, the degree of iron disappearance proved a marked delay, while hematopoetic function indicated an extreme decline. In tissue culture of bone marrow invented by our department. it has been recognized that there exists certain factor to inhibit any hyperplasia of parencyma of bone marrow in this anemic serum. As for method in therapy, several have been nominated through in vain, so that more or less effect have been achieved only by our inventions, i.e., imbedding of bone marrow as well as use of substances of polysaccharide extracted from bone marrow

Infantile Pain Episodes Associated with Novel Nav1.9 Mutations in Familial Episodic Pain Syndrome in Japanese Families

Painful peripheral neuropathy has been correlated with various voltage-gated sodium channel mutations in sensory neurons. Recently Nav1.9, a voltage-gated sodium channel subtype, has been established as a genetic influence for certain peripheral pain syndromes. In this study, we performed a genetic study in six unrelated multigenerational Japanese families with episodic pain syndrome. Affected participants (n = 23) were characterized by infantile recurrent pain episodes with spontaneous mitigation around adolescence. This unique phenotype was inherited in an autosomal-dominant mode. Linkage analysis was performed for two families with 12 affected and nine unaffected members, and a single locus was identified on 3p22 (LOD score 4.32). Exome analysis (n = 14) was performed for affected and unaffected members in these two families and an additional family. Two missense variants were identified: R222H and R222S in SCN11A. Next, we generated a knock-in mouse model harboring one of the mutations (R222S). Behavioral tests (Hargreaves test and cold plate test) using R222S and wild-type C57BL/6 (WT) mice, young (8-9 weeks old; n = 10-12 for each group) and mature (36-38 weeks old; n = 5-6 for each group), showed that R222S mice were significantly (p < 0.05) more hypersensitive to hot and cold stimuli than WT mice. Electrophysiological studies using dorsal root ganglion neurons from 8-9-week-old mice showed no significant difference in resting membrane potential, but input impedance and firing frequency of evoked action potentials were significantly increased in R222S mice compared with WT mice. However, there was no significant difference among Nav1.9 (WT, R222S, and R222H)-overexpressing ND7/23 cell lines. These results suggest that our novel mutation is a gain-of-function mutation that causes infantile familial episodic pain. The mouse model developed here will be useful for drug screening for familial episodic pain syndrome associated with SCN11A mutations

The Hyper Suprime-Cam SSP survey: Overview and survey design

Hyper Suprime-Cam (HSC) is a wide-field imaging camera on the prime focus of the 8.2-m Subaru telescope on the summit of Mauna Kea in Hawaii. A team of scientists from Japan, Taiwan, and Princeton University is using HSC to carry out a 300-night multi-band imaging survey of the high-latitude sky. The survey includes three layers: the Wide layer will cover 1400 deg2 in five broad bands (grizy), with a 5 σ point-source depth of r ≈ 26. The Deep layer covers a total of 26 deg2 in four fields, going roughly a magnitude fainter, while the UltraDeep layer goes almost a magnitude fainter still in two pointings of HSC (a total of 3.5 deg2). Here we describe the instrument, the science goals of the survey, and the survey strategy and data processing. This paper serves as an introduction to a special issue of the Publications of the Astronomical Society of Japan, which includes a large number of technical and scientific papers describing results from the early phases of this survey

Ukkonen\'s tree: combinatorial characterization and applications

A árvore de sufixos é uma estrutura dados, que representa em espaço linear todos os fatores de uma palavra, com diversos exemplos de aplicações práticas. Neste trabalho, definimos uma estrutura mais geral: a árvore de Ukkonen. Provamos para ela diversas propriedades combinatórias, dentre quais, a minimalidade em um sentido preciso. Acreditamos que a apresentação aqui oferecida, além de mais geral que as árvores de sufixo, tem a vantagem de oferecer uma descrição explícita da topologia da árvore, de seus vértices, arestas e rótulos, o que não vimos em nenhum outro trabalho. Como aplicações, apresentamos também a árvore esparsa de sufixos (que armazena apenas um subconjunto dos sufixos) e a árvore de k-fatores (que armazena apenas os segmentos de comprimento k, ao invés dos sufixos) definidas como casos particulares das árvores de Ukkonen. Propomos para as árvores esparsas um novo algoritmo de construção com tempo O(n) e espaço O(m), onde n é tamanho da palavra e m é número de sufixos. Para as árvores de k-fatores, propomos um novo algoritmo online com tempo e espaço O(n), onde n é o tamanho da palavra.The suffix tree is a data structure that represents, in linear space, all factors of a given word, with several examples of practical applications. In this work, we define a more general structure: the Ukkonen\'s tree. We prove many properties for it, among them, its minimality in a precise sense. We believe that this presentation, besides being more general than the suffix trees, has the advantage of offering an explicit description of the tree topology, its vertices, edges and labels, which was not seen in any other work. As applications, we also presents the sparse suffix tree (which stores only a subset of the suffixes) and the k-factor tree (which stores only the substrings of length k, instead of the suffixes), both defined as Ukkonen\'s tree special cases. We propose a new construction algorithm for the sparse suffix trees with time O(n) and space O(m), where n is the size of the word and m is the number of suffixes. For the k-factor trees, we propose a new online algorithm with time and space O(n), where n is the size of the word

Algorithmes efficaces pour l’assemblage de novo d’événements d’épissage alternatif dans des données de RNA-seq

Dans cette thèse, nous abordons le problème de l'identification et de la quantification de variants (épissage alternatif et polymorphisme génomique) dans des données de RNA-seq sans génome de référence, et sans faire un assemblage complet des transcripts. Basé sur l'idée que chaque variant correspond à un motif reconnaissable, qu'on appelle une bulle, dans un graphe de Bruijn construit à partir des lectures de RNA-seq, nous proposons un modèle pour les variants dans de tels graphes. Nous introduisons ensuite une méthode, appelé KisSplice, pour extraire les événements d'épissage alternatif, et nous montrons qu'il trouve plus d'événements corrects que les assembleurs de transcriptome traditionnels. Afin d'améliorer son temps d'exécution, nous proposons un nouvel algorithme polynomial pour énumérer les bulles. On montre qu'il est plusieurs ordres de grandeur plus rapide que les approches précédentes. Afin de réduire sa consommation en mémoire, nous proposons une nouvelle façon de représenter un graphe de Bruijn. Nous montrons que notre approche utilise 30% à 40% moins de mémoire que l'état de l'art. Nous appliquons les techniques développées pour énumérer les bulles à deux problémes classiques. Nous donnons le premier algorithme optimal pour énumérer les cycles dans des graphes non orientés. Il s'agit de la première amélioration à ce probléme en près de 40 ans. Nous considérons ensuite une variante du problème des K chemins plus courts: au lieu de limiter le nombre des chemins, nous limitons leurs poids. Nous présentons de nouveaux algorithmes qui utilisent exponentiellement moins mémoire que les approches précédentesIn this thesis, we address the problem of identifying and quantifying variants (alternative splicing and genomic polymorphism) in RNA-seq data when no reference genome is available, without assembling the full transcripts. Based on the idea that each variant corresponds to a recognizable pattern, a bubble, in a de Bruijn graph constructed from the RNA-seq reads, we propose a general model for all variants in such graphs. We then introduce an exact method, called KisSplice, to extract alternative splicing events and show that it outperforms general purpose transcriptome assemblers. We put an extra effort to make KisSplice as scalable as possible. In order to improve the running time, we propose a new polynomial delay algorithm to enumerate bubbles. We show that it is several orders of magnitude faster than previous approaches. In order to reduce its memory consumption, we propose a new compact way to build and represent a de Bruijn graph. We show that our approach uses 30% to 40% less memory than the state of the art, with an insignificant impact on the construction time. Additionally, we apply the techniques developed to list bubbles in two classical problems: cycle enumeration and the K-shortest paths problem. We give the first optimal algorithm to list cycles in undirected graphs, improving over Johnson’s algorithm. This is the first improvement to this problem in almost 40 years. We then consider a different parameterization of the K-shortest (simple) paths problem: instead of bounding the number of st-paths, we bound the weight of the st-paths. We present new algorithms using exponentially less memory than previous approache