Miracle-dz/UniFAR-FTUs huggingface dataset:
Changes in the structure and propagation of the MJO with increasing CO2

Changes in the Madden‐Julian Oscillation (MJO) with increasing CO2 concentrations are examined using the Goddard Institute for Space Studies Global Climate Model (GCM). Four simulations performed with fixed CO2 concentrations of 0.5, 1, 2, and 4 times preindustrial levels using the GCM coupled with a mixed layer ocean model are analyzed in terms of the basic state, rainfall, moisture and zonal wind variability, and the structure and propagation of the MJO. The GCM simulates basic state changes associated with increasing CO2 that are consistent with results from earlier studies: column water vapor increases at ∼7.1% K−1, precipitation also increases but at a lower rate (∼3% K−1), and column relative humidity shows little change. Moisture and rainfall variability intensify with warming while zonal wind variability shows little change. Total moisture and rainfall variability increases at a rate this is similar to that of the mean state change. The intensification is faster in the MJO‐related anomalies than in the total anomalies, though the ratio of the MJO band variability to its westward counterpart increases at a much slower rate. On the basis of linear regression analysis and space‐time spectral analysis, it is found that the MJO exhibits faster eastward propagation, faster westward energy dispersion, a larger zonal scale, and deeper vertical structure in warmer climates.
Monolithic integrated C-band low noise amplifier using AlGaN/graded-AlGaN/GaN HEMTs

Monolithic integrated C-band low noise amplifier using 1 /spl mu/m-gate AlGaN/graded-AlGaN/GaN HEMT device was designed, fabricated and characterized. The LNA demonstrated a noise figure of 2.7 dB, an associated gain of 10.8 dB, an input return loss of -5.5 dB at 6 GHz, and an output return loss of -18 dB at 7 GHz. The IIP3 of the LNA is 12 dBm at 6 GHz. The LNA with 1 /spl mu/m /spl times/ 100 /spl mu/m device shows very high-dynamic range with decent gain and noise figure.
Lack of assembly of mitochondrial DNA‐encoded subunits of respiratory NADH dehydrogenase and loss of enzyme activity in a human cell mutant lacking the mitochondrial ND4 gene product.

In most eukaryotic cells, the respiratory chain NADH dehydrogenase (Complex I) is a multimeric enzyme under dual (nuclear and mitochondrial) genetic control. Several genes encoding subunits of this enzyme have been identified in the mitochondrial genome from various organisms, but the functions of these subunits are in most part unknown. We describe here a human cell line in which the enzyme lacks the mtDNA‐encoded subunit ND4 due to a frameshift mutation in the gene. In this cell line, the other mtDNA‐encoded subunits fail to assemble, while at least some of the nuclear‐encoded subunits involved in the redox reactions appear to be assembled normally. In fact, while there is a complete loss of NADH:Q1 oxidoreductase activity, the NADH:Fe(CN)6 oxidoreductase activity is normal. These observations provide the first clear evidence that the ND4 gene product is essential for Complex I activity and give some insights into the function and the structural relationship of this polypeptide to the rest of the enzyme. They are also significant for understanding the pathogenetic mechanism of the ND4 gene mutation associated with Leber's hereditary optic neuropathy.
A Fast and Exact Algorithm for the Median of Three Problem: A Graph Decomposition Approach

Abstract In a previous article, we have shown that adequate subgraphs can be used to decompose multiple breakpoint graphs, achieving a dramatic speedup in solving the median problem. In this article, focusing on the median of three problem, we prove more important properties about adequate subgraphs with rank 3 and discuss the algorithms inventorying simple adequate subgraphs. After finding simple adequate subgraphs of small sizes, we incorporate them into ASMedian, an algorithm to solve the median of three problem. Results on simulated data show dramatic speedup so that many instances can be solved very quickly, even ones containing hundreds or thousands of genes.
A NoC system generator for the Sea-of-Cores era

Multi-core systems are getting bigger. The number of cores is doubling every 18 months, in corollary with the reformulated Moore's law. Soon, the number of cores that can be integrated together in a system will be so large, that it is appropriate to talk about a new SoC design paradigm, the Sea-of-Cores era. This development will not end, even when CMOS cannot be made any smaller. Instead, with the development of Through-Silicon Vias (TSVs), chips will be stacked in 3D, promising continuous scaling for a very long time ahead. As systems grow, programming and debugging of them will become harder. Methods for generating the systems from higher-level specifications will be necessary to manage design complexity. Also, there will be so many processors to be programmed, that the SW also will have to be automatically generated and distributed, much in the same way as a synthesis and place & route tool is doing today for HW. In this paper, we present a NoC generator that can generate an arbitrarily large Multi-core platform from an XML configuration file, targeted for single-chip FPGA platforms. The NoC generator also generates a device driver prototype together with a small test program that can be used as a template for creating larger programs.
Department of Mathematics and Statistics The University of Melbourne Pricing Defaultable Bonds under a Marked Point Process Model for Interest Rates

In this thesis we aim to review the framework used in the pricing of defaultable securities. We pay particular attention to reduced form treatments of default risk. Our original contribution is the extension of an existing interest rate model to include default risk. We also investigate some closed-form pricing formulae that can be derived. We propose a model where the risk-free interest rate is modeled as a marked Poisson point process. We model the default time through the use of a stochastic intensity which we allow to depend on the risk-free interest rate. We find that by imposing restrictions on the relationship between the default intensity and the risk-free interest rate, we can derive a simple expression for the no-arbitrage price of a defaultable bond. Under the same assumptions, we are also able to derive expressions for the prices of European call and put options on an underlying defaultable bond. We conclude by considering a specific case of our model and use simulation techniques to verify the expression we obtained for the defaultable bond price.
Association between vascular growth factor gene-2578 C > A , + 1612 G > A polymorphism and the risk of renal cell carcinoma : a meta-analysis

Previous studies have investigated the associations between polymorphisms of vascular growth factor (VEGF) gene and risk of renal cell carcinoma (RCC). However, the results were inconsistent. The present metaanalysis was therefore designed to clarify these controversies. The meta-analysis was performed by searching Pub Med, Web of Science and Embase databases. Odds ratio (OR) and corresponding 95% confidence interval (95% CI) as well as effect size were calculated by a fixed-effect model according to the I2 value. A total of 6 studies including 1397 cases and 2094 controls for -2578C>A of VEGF and 1184 cases and 1862 controls for +1612G>A of VEGF were combined. The pooled results showing evidence of association between VEGF gene -2578C>A polymorphism and RCC risk (for A/A vs. C/C: OR=1.69, 95% CI=1.37-2.07, P<0.00001; for C/A vs. C/C: OR=1.31, 95% CI=1.121.52, P=0.0006; for C/A+A/A vs. C/C: OR=1.39, 95% CI=1.21-1.61, P<0.00001; for A/A vs. C/A+C/C: OR=1.43, 95% CI=1.19-1.73, P=0.0002; for A allele vs. C allele: OR=1.31, 95% CI=1.19-1.45, P<0.00001). However, there was no significant association between VEGF +1612G>A polymorphism and RCC except comparing additive model (for A/A vs. G/G: OR=1.33, 95% CI=1.02,1.74, P=0.03; for G/A vs. G/G: OR=1.09, 95% CI=0.93-1.27, P=0.30; for G/A+A/A vs. G/G: OR=1.12, 95% CI=0.96-1.30, P=0.14; for A/A vs. G/A+G/G: OR=1.27, 95% CI=0.99-1.64, P=0.06; for A allele vs. G allele: OR=1.12, 95% CI=1.00-1.25, P=0.05). In conclusion, our results indicated that VEGF -2578C>A polymorphism, but not VEGF +1612G>A polymorphism was associated with the risk of RCC.
One-Year, Multicenter, Open-Label, Single-Arm Study Evaluating the Safety and Effectiveness of Etanercept for the Treatment of Moderate-to-Severe Plaque Psoriasis in a Canadian Population

Background: Although etanercept is well tolerated and effective in moderate-to-severe plaque psoriasis, data are limited in Canadian practice settings. Objective: To assess the effectiveness and safety of etanercept in Canadian patients with moderate-to-severe plaque psoriasis (Physician Global Assessment [PGA] ≥ 3) in routine practice. Methods: A 1-year, multicenter, open-label trial of 246 patients enrolled from March 2006 to July 2009 was conducted. Patients received etanercept 50 mg subcutaneously twice weekly for 3 months and then 50 mg once weekly for 9 months. The primary end point was the proportion of patients achieving a PGA score ≤ 2 at month 12. Secondary end points included the proportion of patients achieving PGA score ≤ 2 at months 3, 6, and 9 and change from baseline at month 12 for Patient Global Assessment (PtGA), body surface area, and Dermatology Life Quality Index (DLQI). Adverse events were reported. Results: At month 12, 73.5% (95% CI 67.2–79.1) achieved a PGA score ≤ 2. The response was similar regardless of the previous response to systemic or phototherapy. The proportion of patients achieving this score improved from 2.2% (95% CI 0.3–4.2) at baseline to 73.5% (95% CI 67.2–79.1) at 12 months. At 12 months, patients with a DLQI score of 0 or ≥ 5-point improvement was 28.8% (95% CI 22.9–34.7) and 47.3% (95% CI 40.8–53.9), respectively. No new safety signals were reported. Conclusion: The majority of this Canadian population demonstrated a meaningful improvement in PGA and DLQI scores over 1 year.
International Journal of Intelligent Computing and Cybernetics Improved biclustering on expression data through overlapping control

Purpose – The purpose of this paper is to present a novel control mechanism for avoiding overlapping among biclusters in expression data. Design/methodology/approach – Biclustering is a technique used in analysis of microarray data. One of the most popular biclustering algorithms is introduced by Cheng and Church (2000) (Ch&Ch). Even if this heuristic is successful at finding interesting biclusters, it presents several drawbacks. The main shortcoming is that it introduces random values in the expression matrix to control the overlapping. The overlapping control method presented in this paper is based on a matrix of weights, that is used to estimate the overlapping of a bicluster with already found ones. In this way, the algorithm is always working on real data and so the biclusters it discovers contain only original data. Findings – The paper shows that the original algorithm wrongly estimates the quality of the biclusters after some iterations, due to random values that it introduces. The empirical results show that the proposed approach is effective in order to improve the heuristic. It is also important to highlight that many interesting biclusters found by using our approach would have not been obtained using the original algorithm. Originality/value – The original algorithm proposed by Ch&Ch is one of the most successful algorithms for discovering biclusters in microarray data. However, it presents some limitations, the most relevant being the substitution phase adopted in order to avoid overlapping among biclusters. The modified version of the algorithm proposed in this paper improves the original one, as proven in the experimentation.
Littératures numériques : tendances, perspectives, outils d’analyse

Depuis quelques annees, les sites Web personnels, les blogues, journaux intimes, les sites de poesie, les chroniques personnelles proliferent en ligne : le succes des Skyblogs, supports de publication destines aux adolescents, n’est que l’indicateur le plus mediatise d’un phenomene qui touche toutes les couches de la population. Le statut d’auteur semble desormais accessible a tout le monde. La possibilite de toucher plusieurs millions d’internautes, l’espoir de se faire « reperer » un jour par un editeur papier, motivent un grand nombre d’auteurs a mettre leurs productions textuelles sur le Web. L’on peut cependant constater que beaucoup de blogues, journaux intimes et romans-feuilletons « en reseau » se presentent sous des formats assez traditionnels : le lien hypertexte, outil syntaxique revolutionnaire, n’est utilise qu’a l’interieur d’un sommaire facilitant le « feuilletage » du materiel textuel ; l’animation textuelle, outil semantique renouvelant profondement l’aspect graphique de l’ecrit, est quasiment absente de ces creations, ou bien elle se trouve reduite a une fonction de gadget. Les codes de programmation informatiques, presents sous la surface lisse de l’ecran, ne jouent qu’un role de langage secondaire. A cote de cette premiere forme de litterature en reseau s’est developpee une deuxieme, encore peu connue du grand public, et qui donne lieu a des trouvailles beaucoup plus surprenantes. Depuis une dizaine d’annees, loin des circuits de publication et de diffusion des litteratures papier, des cercles, des communautes d’ecrivains se sont formees autour de l’idee d’une litterature numerique exploitant pleinement les potentialites du medium « ordinateur ». L’animation, l’interactivite et une programmation creative caracterisent ces nouvelles creations litteraires sur support numerique. C’est ainsi dans les calligrammes et metaphores animes et dans l’animation syntaxique, dans les relations intersemiotiques entre le texte anime et l’image fixe, entre le texte fixe et l’image animee que se dessine une premiere particularite de la litterature numerique. Deuxiemement, c’est la dynamisation de l’ecrit par le lien hypertexte (que le lecteur active par clic) qui incite un nombre grandissant d’auteurs a experimenter avec le support numerique. Un troisieme « genre » de la nouvelle litterature numerique se fonde sur la reflexion concernant le role du programme. Le premier but de cet article est de presenter les convergences et les differences entre les trois principaux genres de la litterature numerique. A partir d’un certain nombre d’exemples representatifs, je propose ensuite des outils d’analyse adaptes a ces nouvelles formes de creation litteraire.
Infl uence of translation effi ciency of homologous viral proteins on the endogenous presentation of CD 8 + T cell epitopes

JEM © The Rockefeller University Press $15.00 Vol. 204, No. 3, March 19, 2007 525–532 www.jem. org/cgi/doi/10.1084/jem.20062508 525 The interaction of an MHC–peptide complex with a TCR on CD8+ CTL is a crucial step toward the activation of virus-specifi c T cell responses (for review see references 1, 2). Peptide epitopes bound to MHC molecules are derived from viral proteins synthesized within the infected cells, which determine the specifi city of the interaction between the TCR and MHC molecules (3). It is now fi rmly established that CTL recognition of virus-infected cells is dependent on the intracellular degradation of virally encoded proteins so that suffi cient MHC–peptide complexes can be generated (4–6). In addition to intracellular degradation, the steady-state concentration of viral proteins and effi ciency of endogenous processing also determine epitope production (7). Indeed, the importance of these crucial steps in the generation of MHC–peptide complexes is highlighted by the fact that pretreatment of virus-infected cells with proteasome inhibitors (e.g., lactacystin) blocks the endogenous processing of peptide epitopes resulting in inhibition of T cell recognition (8–10). A major caveat of the above concept is that the majority of antigenic peptides are derived from viral proteins, which are extremely stable. A classic example of one such protein is the EBV-encoded nuclear antigen 1 (EBNA1), which not only inhibits its self-synthesis but also blocks its proteasomal degradation (11, 12). Recent studies from our laboratory and others have shown that in spite of the highly stable nature of this protein in B cells, immunodominant epitopes can be effi ciently generated (13–15). An extensive analysis of the endogenous processing Infl uence of translation effi ciency of homologous viral proteins on the endogenous presentation of CD8+ T cell epitopes
Spectral characteristics of background error covariance and multiscale data assimilation

The spatial resolutions of numerical atmospheric and oceanic circulation models have steadily increased over the past decades. Horizontal grid spacing down to the order of 1 km is now often used to resolve cloud systems in the atmosphere and sub‐mesoscale circulation systems in the ocean. These fine resolution models encompass a wide range of temporal and spatial scales, across which dynamical and statistical properties vary. In particular, dynamic flow systems at small scales can be spatially localized and temporarily intermittent. Difficulties of current data assimilation algorithms for such fine resolution models are numerically and theoretically examined. An analysis shows that the background error correlation length scale is larger than 75 km for streamfunctions and is larger than 25 km for water vapor mixing ratios, even for a 2‐km resolution model. A theoretical analysis suggests that such correlation length scales prevent the currently used data assimilation schemes from constraining spatial scales smaller than 150 km for streamfunctions and 50 km for water vapor mixing ratios. These results highlight the need to fundamentally modify currently used data assimilation algorithms for assimilating high‐resolution observations into the aforementioned fine resolution models. Within the framework of four‐dimensional variational data assimilation, a multiscale methodology based on scale decomposition is suggested and challenges are discussed. Copyright © 2016 John Wiley & Sons, Ltd.
Learning strategies for local model networks with higher degree polynomials

Abstract Abstract In this paper a new algorithm for nonlinear system identification with local models of higher polynomial degree is proposed. Usually the local models are linearly parameterized and those parameters are typically estimated by some least squares approach. For the utilization of higher degree polynomials this procedure is no longer feasible due to the exponentially increasing number of parameters depending on a cumulative number of physical inputs. Thus a new learning strategy with the aid of stepwise regression is developed to estimate only the most significant parameters. The included partitioning algorithm decides in each step between increasing the number of parameters of the worst local model and splitting this model to create two new ones. Its advantages are illustrated by a demonstration example.
Wahhabi Islam: From Revival and Reform to Global Jihad

Before 9/11, few Westerners had heard of Wahhabism. But what were the origins of the movement often touted as the intellectual and spiritual inspiration for Osama Bin Laden and al-Qaeda? In the first study ever undertaken of the writings of Wahhabism's founder, Muhammad Ibn Abd al-Wahhab (1702-1791), Natana DeLong-Bas shatters the stereotypes and misconceptions. Using original research, Wahhabi Islam presents the potentially controversial argument that the modern notion of Wahhabism (as ascetic, puritanical and narrow-minded) distorts M I A Wahhab's teachings, which were far more modernist, tolerant and broadminded. But, as the author demonstrates, his ideas were distorted by his followers into the movement that still carries his name today. Contemporary extremists like Osama bin Laden do not have their origins in Wahhabism. This groundbreaking book fills an enormous gap in the literature on the Middle East by returning to the original writing of Wahhabism's founder.
The cachexia assessment scale: development and psychometric properties.

PURPOSE/OBJECTIVES To develop a tool to identify patients with cancer who suffer from cachexia throughout all stages of the disease. DESIGN Tool development study. SETTING Oncology day care, follow-up clinics, radiotherapy, and hospice home care. SAMPLE 90 patients with cancer (25 men and 65 women). METHODS The Cachexia Assessment Scale (CAS) was created based on a thorough review of the literature and was tested for its psychometric properties. MAIN RESEARCH VARIABLES Presence of cachexia. FINDINGS Measures of reliability were determined by inter-rater, test-retest, and internal consistency reliability. Measures of validity were content validity, criterion validity, sensitivity, and specificity. CONCLUSIONS The CAS possesses adequate levels of reliability and validity and can be used to evaluate cachexia at all stages of cancer. IMPLICATIONS FOR NURSING The CAS can be used as an assessment tool for cachexia in various treatment settings.
Offline Face Recognition System Based on Gabor- Fisher Descriptors and Hidden Markov Models

This paper presents a new offline face recognition system. The proposed system is built on one dimensional left-to- right Hidden Markov Models (1D-HMMs). Facial image features are extracted using Gabor wavelets. The dimensionality of these features is reduced using the Fisher’s Discriminant Analysis method to keep only the most relevant information. Unlike existing techniques using 1D-HMMs, in classification step, the proposed system employs 1D-HMMs to find the relationship between reduced features components directly without any additional segmentation step of interest regions in the face image. The performance evaluation of the proposed method was performed with AR database and the proposed method showed a high recognition rate for this database.
Integrated biophysical approach to fragment screening and validation for fragment-based lead discovery

In fragment-based drug discovery, the weak affinities exhibited by fragments pose significant challenges for screening. Biophysical techniques are used to address this challenge, but there is no clear consensus on which cascade of methods is best suited to identify fragment hits that ultimately translate into bound X-ray structures and provide bona fide starting points for synthesis. We have benchmarked an integrated biophysical approach for fragment screening and validation against Mycobacterium tuberculosis pantothenate synthetase. A primary screen of 1,250 fragments library was performed by thermal shift, followed by secondary screen using one-dimensional NMR spectroscopy (water ligand observed gradient spectroscopy and saturation transfer difference binding experiments) and ultimate hit validation by isothermal titration calorimetry and X-ray crystallography. Our multibiophysical approach identified three distinct binding sites for fragments and laid a solid foundation for successful structure-based elaboration into potent inhibitors.
The purification of chemically synthesized graphene

Numerous techniques for the purification of chemically synthesized graphene have been investigated, exploiting the relative aqueous solubilities of the impurities and carbon sheets. This demonstrates that simple aqueous washing provides a reliable platform for the purification of graphene, without the need for harsh chemical treatments. The presence of cavities or pores in the as-obtained graphene structure are believed to inhibit small particles, that are interspersed throughout the material, from undergoing hydrolysis reactions.