snu-aidas/HVMap-dataset huggingface dataset:
The Pricing of Investment Grade Credit Risk during the Financial Crisis

This paper uses a structural model to investigate the pricing of investment grade credit risk during the nancial crisis. Our analysis suggests that the dramatic recent widening of credit spreads is highly consistent with the decline in the equity market, the increase in its long-term volatility, and an improved investor appreciation of the risks embedded in structured products. In contrast to the main argument in favor of using government funds to help purchase structured credit securities, we nd little evidence that suggests these markets are experiencing re sales. Preliminary and Incomplete. Coval: Harvard Business School; jcoval@hbs.edu. Jurek: Bendheim Center for Finance, Princeton University; jjurek@princeton.edu. Sta¤ord: Harvard Business School; esta¤ord@hbs.edu. We thank Stephen Blythe, Ken Froot, Bob Merton, André Perold, and David Scharfstein for valuable comments and discussions.
Identifying differentially expressed genes using false discovery rate controlling procedures

MOTIVATION
DNA microarrays have recently been used for the purpose of monitoring expression levels of thousands of genes simultaneously and identifying those genes that are differentially expressed. The probability that a false identification (type I error) is committed can increase sharply when the number of tested genes gets large. Correlation between the test statistics attributed to gene co-regulation and dependency in the measurement errors of the gene expression levels further complicates the problem. In this paper we address this very large multiplicity problem by adopting the false discovery rate (FDR) controlling approach. In order to address the dependency problem, we present three resampling-based FDR controlling procedures, that account for the test statistics distribution, and compare their performance to that of the naïve application of the linear step-up procedure in Benjamini and Hochberg (1995). The procedures are studied using simulated microarray data, and their performance is examined relative to their ease of implementation.


RESULTS
Comparative simulation analysis shows that all four FDR controlling procedures control the FDR at the desired level, and retain substantially more power then the family-wise error rate controlling procedures. In terms of power, using resampling of the marginal distribution of each test statistics substantially improves the performance over the naïve one. The highest power is achieved, at the expense of a more sophisticated algorithm, by the resampling-based procedures that resample the joint distribution of the test statistics and estimate the level of FDR control.


AVAILABILITY
An R program that adjusts p-values using FDR controlling procedures is freely available over the Internet at www.math.tau.ac.il/~ybenja.
A probabilistic theory of clustering

Data clustering is typically considered a subjective process, which makes it problematic. For instance, how does one make statistical inferences based on clustering? The matter is di0erent with pattern classi1cation, for which two fundamental characteristics can be stated: (1) the error of a classi1er can be estimated using “test data,” and (2) a classi1er can be learned using “training data.” This paper presents a probabilistic theory of clustering, including both learning (training) and error estimation (testing). The theory is based on operators on random labeled point processes. It includes an error criterion in the context of random point sets and representation of the Bayes (optimal) cluster operator for a given random labeled point process. Training is illustrated using a nearest-neighbor approach, and trained cluster operators are compared to several classical clustering algorithms. ? 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Steatocystoma simplex in penile foreskin: a case report

BACKGROUND
Steatocystoma simplex is an uncommon skin lesion with a histological pattern that is identical to that of steatocystoma multiplex. We are reporting this case of steatocystoma simplex for its uncommon location in the penile foreskin, and its occurrence in a Wapishana man.


CASE PRESENTATION
A 56-year-old man of Wapishana ethnicity presented with complaints of referred penile discomfort and pain during sexual intercourse for 5 years. A physical examination revealed a mobile, compressible subcutaneous non-tender mass of 4 cm diameter located on the left-side of his penile foreskin. There were no signs of inflammation, no grip on the penile shaft, and no urethral discharge or enlargement of lymph nodes. We found no evidence of other cysts on cutaneous examination. We performed classical excision of the lesion under local anesthesia and confirmed the diagnosis of steatocystoma with the pathological report. As there were no complications, we discharged him the same day.


CONCLUSION
Steatocystoma can be considered a differential diagnosis for cystic lesions on and around the penis.
Comparison of surgical variables and short-term postoperative complications in healthy dogs undergoing ovariohysterectomy or ovariectomy.

OBJECTIVE
To determine whether ovariohysterectomy (OVH) required more time to complete and was associated with more short-term postoperative complications than ovariectomy (OVE) in dogs.


DESIGN
Randomized prospective clinical trial.


ANIMALS
40 healthy, sexually intact female dogs.


PROCEDURES
OVH (in 20 dogs) or OVE (20 dogs) was performed by use of standardized anesthetic and surgical protocols. Physical characteristics of the dogs, surgical variables, pain scores derived from behavior-based composite pain scales, and surgical wound characteristics were analyzed.


RESULTS
Body weight, age, body condition score, and distance between the sternal manubrium and the pubic rim were comparable among dogs that underwent either surgical procedure. Body weight was positively correlated with the total duration of the procedure and with time required for closure of the surgical wound. No effect of body condition score was determined for any variable. Skin and fascia incision lengths relative to the distance from the sternal manubrium to pubic rim were significantly greater in dogs that underwent OVH, compared with those of dogs that underwent OVE, but total surgical time was not different for the 2 procedures. No other significant differences were detected between the 2 groups.


CONCLUSIONS AND CLINICAL RELEVANCE
Significant differences in total surgical time, pain scores, and wound scores were not observed between dogs that underwent OVH and dogs that underwent OVE via standardized protocols.
Column-store support for RDF data management: not all swans are white

This paper reports on the results of an independent evaluation of the techniques presented in the VLDB 2007 paper “Scalable Semantic Web Data Management Using Vertical Partitioning”, authored by D. Abadi, A. Marcus, S. R. Madden, and K. Hollenbach [1]. We revisit the proposed benchmark and examine both the data and query space coverage. The benchmark is extended to cover a larger portion of the query space in a canonical way. Repeatability of the experiments is assessed using the code base obtained from the authors. Inspired by the proposed vertically-partitioned storage solution for RDF data and the performance figures using a column-store, we conduct a complementary analysis of state-of-the-art RDF storage solutions. To this end, we employ MonetDB/SQL, a fully-functional open source column-store, and a well-known – for its performance – commercial row-store DBMS. We implement two relational RDF storage solutions – triple-store and vertically-partitioned – in both systems. This allows us to expand the scope of [1] with the performance characterization along both dimensions – triple-store vs. vertically-partitioned and row-store vs. column-store – individually, before analyzing their combined effects. A detailed report of the experimental test-bed, as well as an in-depth analysis of the parameters involved, clarify the scope of the solution originally presented and position the results in a broader context by covering more systems.
Sample size estimation in diagnostic test studies of biomedical informatics

OBJECTIVES
This review provided a conceptual framework of sample size calculations in the studies of diagnostic test accuracy in various conditions and test outcomes.


METHODS
The formulae of sample size calculations for estimation of adequate sensitivity/specificity, likelihood ratio and AUC as an overall index of accuracy and also for testing in single modality and comparing two diagnostic tasks have been presented for desired confidence interval.


RESULTS
The required sample sizes were calculated and tabulated with different levels of accuracies and marginal errors with 95% confidence level for estimating and for various effect sizes with 80% power for purpose of testing as well. The results show how sample size is varied with accuracy index and effect size of interest.


CONCLUSION
This would help the clinicians when designing diagnostic test studies that an adequate sample size is chosen based on statistical principles in order to guarantee the reliability of study.
Stochastic Video Prediction with Conditional Density Estimation

Frame-to-frame stochasticity is a major challenge in video prediction. The use of standard feedforward and recurrent networks for video prediction leads to averaging of future states, which can in part be attributed to the networks’ limited ability to model stochasticity. We propose the use of conditional variational autoencoders (CVAE) for video prediction. To model multi-modal densities in frame-to-frame transitions, we extend the CVAE framework by modeling the latent variable with a mixture of Gaussians in the generative network. We tested our proposed Gaussian mixture CVAE (GM-CVAE) on a simple video-prediction task involving a stochastically moving object. Our architecture demonstrates improved performance, achieving noticeably lower rates of blurring/averaging compared to a feedforward network and a Gaussian CVAE. We also describe how the CVAE framework can be applied to improve existing deterministic video prediction models.1
Quality evaluation of product reviews using an information quality framework

Available online 27 August 2010
Parental stress, family quality of life, and family-teacher partnerships: Families of children with autism spectrum disorder.

BACKGROUND
Reducing parental stress and improving family quality of Life (FQOL) are continuing concerns for families of children with autism spectrum disorder (ASD). Family-teacher partnerships have been identified as a positive factor to help parents reduce their stress and improve their FQOL. However, the interrelations among parental stress, FQOL, and family-teacher partnerships need to be further examined so as to identify the possible paths to help parents reduce their stress and improve their FQOL. The purpose of this study was to examine the interrelations among these three variables.


METHOD
A total of 236 parents of school children with ASD completed questionnaires, which included three measures: (a) the Beach Center Family Quality of Life Scale, (b) the Parental Stress Scale, and (c) the Beach Center Family-Professional Partnerships Scale. The structural equation modeling was used to analyze the interrelations among these three variables.


RESULTS
Perceived parental stress had a direct effect on parental satisfaction concerning FQOL and vice versa. Perceived family-teacher partnerships had a direct effect on FQOL, but did not have a direct effect on parental stress. However, family-teacher partnerships had an indirect effect on parental stress through FQOL.


CONCLUSIONS AND IMPLICATIONS
Reducing parental stress could improve FQOL for families of children with ASD and vice versa. Strong family-teacher partnerships could help parents of children with ASD improve their FQOL and indirectly reduce their stress.
Event Correlation: Language and Semantics

300.twolf 3000 102 2945 102 2945 Hardware CPU: Intel(R) Xeon(R) CPU 5150 @ 2.66GHz CPU MHz: 2660 FPU: Integrated CPU(s) enabled: 4 cores, 2 chips, 2 cores/chip CPU(s) orderable: 1,2 chip(s) Parallel: No Primary Cache: 32KB(I) + 32KB(D) on chip, per core Secondary Cache: 4096KB(I+D) on chip, per chip, shared L3 Cache: N/A Other Cache: N/A Memory: 4 x 1024MB ECC FB-DIMM DDR2-667MHz Disk Subsystem: 1 x 250GB SATA HDD Other Hardware: Software Operating System: Red Hat Enterprise Linux 4 Update 3 EM64T Compiler: Intel C++ Compiler 9.1.042 for EM64T File System: ext3 System State: Runlevel 3
Drug Treatment of Sleep Disorders

Sleep is a complex behavior that cyclically alternates with wakefulness and is fundamental for both mental and physical wellness. During normal sleep the body acquires a specific posture; any active behavior is absent and mental activity typically oscillates between a state of “loss of consciousness” and the experience of dreaming. Sleep is, by itself, a cyclical process characterized by the alternation of two phases, non-REM (NREM) sleep and “rapid eye movement” (REM) sleep, during which the typical synchronized electroencephalographic (EEG) pattern of NREM sleep is substituted by a “paradoxical” EEG desynchronization. NREM sleep is a state of minimal energy expenditure and motor activity, during which cardiorespiratory and thermoregulatory variables are driven by the autonomic nervous system at a lower and more stable level compared to wakefulness. During REM sleep, beyond the occurrence of REMs, posture control is lost and dreams become more vivid. Furthermore, autonomic activity is highly unstable leading to centrally driven surges in heart rate and blood pressure, breathing becomes irregular, and thermoregulation is suspended or depressed, suggesting a derangement of the integrative regulation of physiological functions. Overall sleep quality is one of the most important parameters considered for the subjective assessment of quality of life and general health status. However, although sleep function(s) is intuitively associated with some kind of rest that seems to be mostly required by the central nervous system, and many theories on sleep function have been proposed, a full comprehension of sleep function has not yet been achieved and is probably not imminent. C. Berteotti • M. Cerri • M. Luppi • A. Silvani • R. Amici (*) Department of Biomedical and Neuromotor Sciences—Physiology, Alma Mater Studiorum-University of Bologna, Piazza P.ta S. Donato, 2, 40126 Bologna, Italy e-mail: chiara.berteotti@unibo.it; matteo.cerri@unibo.it; marco.luppi@unibo.it; alessandro.silvani3@unibo.it; roberto.amici@unibo.it; http://www.unibo.it/Faculty/default. aspx?UPN1⁄4roberto.amici%40unibo.it © Springer International Publishing Switzerland 2015 A. Guglietta (ed.), Drug Treatment of Sleep Disorders, Milestones in Drug Therapy, DOI 10.1007/978-3-319-11514-6_1 3 1 Neurophysiology and Neurobiology of Sleep
Boosting Optical Character Recognition: A Super-Resolution Approach

Text image super-resolution is a challenging yet open research problem in the computer vision community. In particular, low-resolution images hamper the performance of typical optical character recognition (OCR) systems. In this article, we summarize our entry to the ICDAR2015 Competition on Text Image Super-Resolution. Experiments are based on the provided ICDAR2015 TextSR dataset [3] and the released Tesseract-OCR 3.02 system [1]. We report that our winning entry of text image super-resolution framework has largely improved the OCR performance with low-resolution images used as input, reaching an OCR accuracy score of 77.19%, which is comparable with that of using the original high-resolution images (78.80%).
Strengths and Weaknesses of Quantum Computing

Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor’s result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random, with probability 1, the class NP cannot be solved on a quantum Turing machine in time o(2n/2). We also show that relative to a permutation oracle chosen uniformly at random, with probability 1, the class NP ∩ co–NP cannot be solved on a quantum Turing machine in time o(2n/3). The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O(2n/2). To appear in SIAM Journal on Computing (special issue on quantum computing) ∗ IBM T. J. Watson Research Laboratory, Yorktown Heights, New York, NY 10598, USA. email: bennetc@watson.ibm.com. † 1 Microsoft Way, Redmond, WA 98052 – 6399, USA. email: ethanb@microsoft.com. ‡ Supported in part by Canada’s nserc and Québec’s fcar. §Département IRO, Université de Montréal, C.P. 6128, succursale centre-ville, Montréal (Québec), Canada H3C 3J7. email: brassard@iro.umontreal.ca. ¶ Supported by NSF Grant No. CCR-9310214. Computer Science Division, University of California, Berkeley, CA 94720, USA. email: vazirani@cs.berkeley.edu.
Algorithms for Quantum Computation: Discrete Logarithms and Factoring

A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored. These two problems are generally considered hard on a classical computer and have been used as the basis of several proposed cryptosystems. (We thus give the first examples of quantum cryptanulysis.)
ASPEC: Asian Scientific Paper Excerpt Corpus

In this paper, we describe the details of the ASPEC (Asian Scientific Paper Excerpt Corpus), which is the first large-size parallel corpus of scientific paper domain. ASPEC was constructed in the Japanese-Chinese machine translation project conducted between 2006 and 2010 using the Special Coordination Funds for Promoting Science and Technology. It consists of a Japanese-English scientific paper abstract corpus of approximately 3 million parallel sentences (ASPEC-JE) and a Chinese-Japanese scientific paper excerpt corpus of approximately 0.68 million parallel sentences (ASPEC-JC). ASPEC is used as the official dataset for the machine translation evaluation workshop WAT (Workshop on Asian Translation).
Optimizing Paxos with batching and pipelining

Paxos is probably the most popular state machine replication protocol. Two optimizations that can greatly improve its performance are batching and pipelining. However, tuning these two optimizations to achieve high-throughput can be challenging, as their effectiveness depends on many parameters like the network latency and bandwidth, the speed of the nodes, and the properties of the application. We address this question by presenting an analytical model of the performance of Paxos, and showing how it can be used to determine configuration values for the batching and pipelining optimizations that result in high-throughput. We then validate the model, by presenting the results of experiments where we investigate the interaction of these two optimizations both in LAN and WAN environments, and comparing these resultswith the prediction from themodel. The results confirm the accuracy of the model, with the predicted values being usually very close to the ones that provide the highest performance in the experiments. Furthermore, both the model and the experiments give useful insights into the relative effectiveness of batching and pipelining. They show that although batching by itself provides the largest gains in all scenarios, in most cases combining it with pipelining provides a very significant additional increase in throughput, with this being true not only on high-latencyWANbut also inmany LAN scenarios. © 2012 Elsevier B.V. All rights reserved.
Automatic semantic classification of scientific literature according to the hallmarks of cancer

MOTIVATION
The hallmarks of cancer have become highly influential in cancer research. They reduce the complexity of cancer into 10 principles (e.g. resisting cell death and sustaining proliferative signaling) that explain the biological capabilities acquired during the development of human tumors. Since new research depends crucially on existing knowledge, technology for semantic classification of scientific literature according to the hallmarks of cancer could greatly support literature review, knowledge discovery and applications in cancer research.


RESULTS
We present the first step toward the development of such technology. We introduce a corpus of 1499 PubMed abstracts annotated according to the scientific evidence they provide for the 10 currently known hallmarks of cancer. We use this corpus to train a system that classifies PubMed literature according to the hallmarks. The system uses supervised machine learning and rich features largely based on biomedical text mining. We report good performance in both intrinsic and extrinsic evaluations, demonstrating both the accuracy of the methodology and its potential in supporting practical cancer research. We discuss how this approach could be developed and applied further in the future.


AVAILABILITY AND IMPLEMENTATION
The corpus of hallmark-annotated PubMed abstracts and the software for classification are available at: http://www.cl.cam.ac.uk/∼sb895/HoC.html.


CONTACT
simon.baker@cl.cam.ac.uk.
An open-label study to evaluate sildenafil for the treatment of lymphatic malformations.

BACKGROUND
Lymphatic malformations can be challenging to treat. Mainstay interventions including surgery and sclerotherapy are invasive and can result in local recurrence and complications.


OBJECTIVE
We sought to assess the effect of 20 weeks of oral sildenafil on reducing lymphatic malformation volume and symptoms in children.


METHODS
Seven children (4 boys, 3 girls; ages 13-85 months) with lymphatic malformations were given oral sildenafil for 20 weeks in this open-label study. The volume of the lymphatic malformation was calculated blindly using magnetic resonance imaging performed before and after 20 weeks of sildenafil. Lymphatic malformations were assessed clinically on weeks 4, 12, 20, and 32. Both the physician and parents evaluated the lymphatic malformation in comparison with baseline.


RESULTS
Four subjects had a lymphatic malformation volume decrease (1.0%-31.7%). In 2 subjects, despite a lymphatic malformation volume increase (1.1%-3.7%), clinical improvement was noted while on sildenafil. One subject had a 29.6% increase in lymphatic malformation volume and no therapeutic response. Lymphatic malformations of all 6 subjects who experienced a therapeutic response on sildenafil softened and became easily compressible. Adverse events were minimal.


LIMITATIONS
A randomized controlled trial will be necessary to verify the effects of sildenafil on lymphatic malformations.


CONCLUSIONS
Sildenafil can reduce lymphatic malformation volume and symptoms in some children.
High Power Outphasing Modulation