Miracle-dz/UniFAR-FTUs huggingface dataset:
Formal Probabilistic Timing Verification in RTL

Variations in timing can occur due to multiple sources on a chip such as process variations and variations in input patterns. It is desirable to have variation awareness at the register transfer level (RTL), and estimate block level delay distributions early in the design cycle, to evaluate design choices quickly and minimize postsynthesis simulation costs. In previous work, we introduced statistical high-level analysis and rigorous performance estimation (SHARPE), a rigorous, systematic methodology to verify design correctness in RTL in the presence of variations. We described SHARPE in the context of computing statistical delay invariants with respect to input variations. We treated the RTL source code as a program and used static program analysis techniques to compute probabilities. We modeled the probabilistic RTL modules as discrete time Markov chains that are then checked formally for probabilistic invariants using PRISM, a probabilistic model checker. In this paper, we extend SHARPE to perform timing verification in RTL in the context of process variations. We achieved this by obtaining a set of process variation-aware RTL delay models and correspondingly modifying the existing steps in SHARPE. We illustrate SHARPE on the RTL description of the datapath of OR1200, an open source embedded processor. We also apply SHARPE to other data-intensive RTL designs such as nontrivial components of communication systems and a few benchmark designs.
Static and dynamic classifications for SOA structural attributes metrics

Evaluating qualities of software based on software structural attributes such as coupling and cohesion are frequently done in practice as these attributes directly have impacts on value of higher level quality. Concerning oneself with structural attributes values early on helps developers to predict quality attributes level in the software. Service-Oriented Architecture (SOA) is an architectural concept where services are used as building blocks in developing new software. Lots of structural attributes metrics related to SOA had been proposed these recent years, which triggered an investigation to classify these metrics based on specific criteria. In this paper, we introduce classifications for SOA based structural attributes metrics, where the metrics are restricted to coupling, cohesion and complexity metrics. These metrics are classified based on software static and dynamic aspects with some brief introduction for each metric. By classifying these SOA based structural attributes metrics, it will allow user to avoid redundancy in proposing similar metrics thus increases the reusability of existing metrics.
Finite metric spaces: combinatorics, geometry and algorithms

In the last several years a number of very interesting results were proved about finite metric spaces. Some of this work is motivated by practical considerations: Large data sets (coming e.g. from computational molecular biology, brain research or data mining) can be viewed as large metric spaces that should be analyzed (e.g. correctly clustered). On the other hand, these investigations connect to some classical areas of geometry - the asymptotic theory of finite-dimensional normed spaces and differential geometry. Finally, the metric theory of finite graphs has proved very useful in the study of graphs per se and the design of approximation algorithms for hard computational problems. In this talk I will try to explain some of the results and review some of the emerging new connections and the many fascinating open problems in this area.
Outcomes of patients with advanced cancer and KRAS mutations in phase I clinical trials

Background KRAS mutation is common in human cancer. We assessed the clinical factors, including type of KRAS mutation and treatment, of patients with advanced cancer and tumor KRAS mutations and their association with treatment outcomes. Methods Patients referred to the Phase I Clinic for treatment who underwent testing for KRAS mutations were analyzed. Results Of 1,781 patients, 365 (21%) had a KRAS mutation. The G12D mutation was the most common mutation (29%). PIK3CA mutations were found in 24% and 10% of patients with and without KRAS mutations (p<0.0001). Of 223 patients with a KRAS mutation who were evaluable for response, 56 were treated with a MEK inhibitor-containing therapy and 167 with other therapies. The clinical benefit (partial response and stable disease lasting ≥ 6 months) rates were 23% and 9%, respectively, for the MEK inhibitor versus other therapies (p=0.005). The median progression-free survival (PFS) was 3.3 and 2.2 months, respectively (p=0.09). The respective median overall survival was 8.4 and 7.0 months (p=0.38). Of 66 patients with a KRAS mutation and additional alterations, higher rates of clinical benefit (p=0.04), PFS (p=0.045), and overall survival (p=0.02) were noted in patients treated with MEK inhibitor-containing therapy (n=9) compared to those treated with targeted therapy matched to the additional alterations (n=24) or other therapy (n=33). Conclusions MEK inhibitors in patients with KRAS-mutated advanced cancer were associated with higher clinical benefit rates compared to other therapies. Therapeutic strategies that include MEK inhibitors or novel agents combined with other targeted therapies or chemotherapy need further investigation.
RATES OF CONVERGENCE FOR GIBBS SAMPLING FOR VARIANCE COMPONENT MODELS

This paper analyzes the Gibbs sampler applied to a standard variance component model, and considers the question of how many iterations are required for convergence. It is proved that for K location parameters, with J observations each, the number of iterations required for convergence (for large K and J) is a constant times (1 + log K/log J). This is one of the first rigorous, a priori results about time to convergence for the Gibbs sampler. A quantitative version of the theory of Harris recurrence (for Markov chains) is developed and applied.
Evolving Static Representations for Task Transfer

An important goal for machine learning is to transfer knowledge between tasks. For example, learning to play RoboCup Keepaway should contribute to learning the full game of RoboCup soccer. Previous approaches to transfer in Keepaway have focused on transforming the original representation to fit the new task. In contrast, this paper explores the idea that transfer is most effective if the representation is designed to be the same even across different tasks. To demonstrate this point, a bird's eye view (BEV) representation is introduced that can represent different tasks on the same two-dimensional map. For example, both the 3 vs. 2 and 4 vs. 3 Keepaway tasks can be represented on the same BEV. Yet the problem is that a raw two-dimensional map is high-dimensional and unstructured. This paper shows how this problem is addressed naturally by an idea from evolutionary computation called indirect encoding, which compresses the representation by exploiting its geometry. The result is that the BEV learns a Keepaway policy that transfers without further learning or manipulation. It also facilitates transferring knowledge learned in a different domain, Knight Joust, into Keepaway. Finally, the indirect encoding of the BEV means that its geometry can be changed without altering the solution. Thus static representations facilitate several kinds of transfer.
Ca2+ Transients in Perfused Hearts Revealed by Gated 19F NMR Spectroscopy

Gated acquisition of 19 nuclear magnetic resonance spectra from perfused ferret hearts loaded with the fluorinated Ca2+ indicator 5,5'-F2-BAPTA allows direct quantitation of the cyclical changes in the intracellular free Ca2+ concentration ([Ca2+],) that underlie contraction in intact hearts. [Ca2+], increased from approximately 200 nM in diastole to ˜1 μM or higher hi early systole. Although the 19F spectra that report [Ca2+], changed dramatically and reproducibly during the cardiac cycle, no changes were detectable in gated phosphorus spectra. We exploited the ability to control the coronary arterial flow of our hearts to investigate the mechanism of the fall in contractility that results from a decrease in perfusion even when the flow suffices to sustain normal high energy phosphate concentrations. Under these conditions, the amplitude of Ca2+ transients falls markedly along with the decline in pressure. This down-regulation of Ca2+ transients constitutes a novel protective mechanism that minimizes energy demand during lowflow ischemia.
Interactive, Multiresolution Image‐Space Rendering for Dynamic Area Lighting

Area lights add tremendous realism, but rendering them interactively proves challenging. Integrating visibility is costly, even with current shadowing techniques, and existing methods frequently ignore illumination variations at unoccluded points due to changing radiance over the light's surface. We extend recent image‐space work that reduces costs by gathering illumination in a multiresolution fashion, rendering varying frequencies at corresponding resolutions. To compute visibility, we eschew shadow maps and instead rely on a coarse screen‐space voxelization, which effectively provides a cheap layered depth image for binary visibility queries via ray marching. Our technique requires no precomputation and runs at interactive rates, allowing scenes with large area lights, including dynamic content such as video screens.
Effective immunization against Bordetella pertussis respiratory infection in mice is dependent on induction of cell-mediated immunity

A murine respiratory challenge model was used to examine the induction of cellular and humoral immune responses and their role in protection against Bordetella pertussis following immunization or previous infection. Spleen cells from mice convalescing from a B. pertussis infection exhibited extensive in vitro T-cell proliferation and secreted high levels of interleukin-2 (IL-2) and gamma interferon but not IL-4 or IL-5, a cytokine profile typical of CD4+ Th1 cells. Serum from these mice had low or undetectable anti-B. pertussis antibody levels. In contrast, mice immunized with an acellular pertussis vaccine had high levels of B. pertussis antibodies and spleen cells secreting IL-5 but not gamma interferon, a profile characteristic of CD4+ Th2 cells. Immunization with an inactivated whole-cell vaccine induced both CD4+ Th1 and serum antibody responses. After exposure to a B. pertussis respiratory challenge, the convalescent mice and those immunized with the whole-cell vaccine eliminated the bacterial infection significantly faster than mice immunized with the acellular vaccine. These findings show that the selection of antigens and their form of presentation are important in determining whether the subsequent immune response is cellular, mediated by Th1 cells, or humoral, mediated by Th2 cells. In the murine model, the induction of a Th1-mediated cellular immune response appears to be a key element in acquired immunity to a B. pertussis infection.
Path planning algorithms for mesh networked robots based on WiFi geo-location

Robot formation and motion planning is a challenging area in mesh networked robots (MNRs). The accuracy and speed with which two or more robots can align them so as to serve a purpose is very important. This paper reports results from our study of the characteristics of robots operating in a real world wireless network environment where robots plan their motion based on the position determined using a Wi-Fi based positioning algorithm. Further we propose and study three methods of formation planning for a leader follower system and evaluate their accuracy and efficiency. First, the followers decide their own path based on the leader's position. In the second algorithm, the motion command for the follower was decided by the leader based on the follower's position and in the third, the followers predict the leader's next position using its current position and direction of motion and moved accordingly. These methods were studied in different working environments and the effect of disturbances on the accuracy of formation was determined using a prototype MNR we built. RSSI fingerprinting was used to calculate the position of the robots and based on which, the path was planned by the leader as well as the followers. Results from the comparison of path planning algorithms are provided.
Computer Algebra Algorithms Applied to Computer Vision in a Parking Management System

From this paper, we propose a novel methodology to compute a 2D homography applying some algorithms of computer algebra. We consider the classical problem of solving (exactly) a linear system of algebraic equations, and we suggest a new algorithm for computer vision, based on homomorphism methods over Zopf, to solve a system of equations necessary to achieve a 3 times 3 matrix H which lets us to compute the projective transformation which translates coordinates between points in different planes. From this work, we want to show that it is possible to apply a symbolic approach to some crucial issues of computer vision, moreover of the numerical methodology, in order to reduce the complexity of some algorithms, and to eliminate the problems associated with loss of precision and normalization. We test our technique in a real situation: a parking management system, which creates a pseudo-top-view of a parking area to determine if there are free parking lots or not.
Asymptotic giant branch stars in the Fornax dwarf spheroidal galaxy

We report on a multi-epoch study of the Fornax dwarf spheroidal galaxy, made with the Infrared Survey Facility, over an area of about 42 × 42 arcmin 2 . The colour–magnitude diagram shows a broad well-populated giant branch with a tip that slopes downwards from red to blue, as might be expected given Fornax’s known range of age and metallicity. The extensive asymptotic giant branch (AGB) includes seven Mira variables and 10 periodic semiregular variables. Five of the seven Miras are known to be carbon rich. Their pulsation periods range from 215 to 470 d, indicating a range of initial masses. Three of the Fornax Miras are redder than typical Large Magellanic Cloud (LMC) Miras of similar period, probably indicating particularly heavy mass-loss rates. Many, but not all, of the characteristics of the AGB are reproduced by isochrones from Marigo et al. for a 2 Gyr population with a metallicity of Z = 0.0025. An application of the Mira period–luminosity relation to these stars yields a distance modulus for Fornax of 20.69 ± 0.04 (internal), ±0.08 (total) (on a scale that puts the LMC at 18.39 mag) in good agreement with other determinations. Various estimates of the distance to Fornax are reviewed.
Improving the convergence time highspeed TCP

It is reported that TCP does not perform well in highspeed and long-distance networks. This problem led to the proposal of highspeed TCP (HS-TCP). HS-TCP is designed to achieve a steady-state throughput of 10 Gbps with a packet loss rate of 10/sup -7/ when the packet size is 1500 bytes and the round trip time is 100 ms. However, HS-TCP has a problem in terms of convergence times. That is, it takes a long time for a new HS-TCP flow to achieve fair bandwidth allocation if the existing HS-TCP flows have large congestion windows. This paper proposes a new mechanism to improve the convergence time of HS-TCP. The basic idea of our mechanism is that if a flow has larger window than is fair its window is decreased more aggressively than usual. Simulations show that our mechanism significantly improves the convergence time of HS-TCP.
A General Software Readability Model

We present a generalizable formal model of software readability based on a human study of 5000 participants. Readability is fundamental to maintenance, but remains poorly understood. Previous models focused on symbol counts of small code snippets. By contrast, we approach code as read on screens by humans and propose to analyze visual, spatial and linguistic features, including structural patterns, sizes of code blocks, and verbal identifier content. We construct a readability metric based on these notions and show that it agrees with human judgments as well as they agree with each other and better than previous work. We identify universal features of readability and languageor experience-specific ones. Our metric also correlates with an external notion of defect density. We address multiple programming languages and different length samples, and evaluate using an order of magnitude more participants than previous work, all suggesting our model is more likely to generalize.
Heterogeneous conversion of NO 2 on secondary organic aerosol surfaces: A possible source of nitrous acid (HONO) in the atmosphere?

Abstract. The heterogeneous conversion of NO 2 on different secondary organic aerosols (SOA) was investigated with the focus on a possible formation of nitrous acid (HONO). In one set of experiments different organic aerosols were produced in the reactions of O 3 with alpha-pinene, limonene or catechol and OH radicals with toluene or limonene, respectively. The aerosols were sampled on filters and exposed to humidified NO 2 mixtures under atmospheric conditions. The estimated upper limits for the uptake coefficients of NO 2 and the reactive uptake coefficients NO 2 -> HONO are in the range of 10 -6 and 10 -7 , respectively. The integrated HONO formation for 1 h reaction time was 13 cm -2 geometrical surface and 17 g -1 particle mass. In a second set of experiments the conversion of NO 2 into HONO in the presence of organic particles was carried out in an aerosol flow tube under atmospheric conditions. In this case the aerosols were produced in the reaction of O 3 with beta-pinene, limonene or catechol, respectively. The upper limits for the reactive uptake coefficients NO 2 -> HONO were in the range of 7 x 10 -7 - 9 x 10 -6 . The results from the present study show that heterogeneous formation of nitrous acid on secondary organic aerosols (SOA) is unimportant for the atmosphere.
Assessment of glottal inverse filtering by using aeroelastic modelling of phonation and FE modelling of vocal tract

evaluated in this paper by using speech material produced with computational modelling of voice production represented by an aeroelastic model of vocal folds and a Finite Element (FE) model of the vocal tract. An inverse filtering algorithm was used in order to estimate the glottal flow from the speech pressure signal generated by the model. Comparison between the estimated glottal flow and the original flow generated by computational modelling shows that the IF method is able to yield an accurate estimate for the glottal flow.
INCONCO: interpretable clustering of numerical and categorical objects

The integrative mining of heterogeneous data and the interpretability of the data mining result are two of the most important challenges of today's data mining. It is commonly agreed in the community that, particularly in the research area of clustering, both challenges have not yet received the due attention. Only few approaches for clustering of objects with mixed-type attributes exist and those few approaches do not consider cluster-specific dependencies between numerical and categorical attributes. Likewise, only a few clustering papers address the problem of interpretability: to explain why a certain set of objects have been grouped into a cluster and what a particular cluster distinguishes from another. In this paper, we approach both challenges by constructing a relationship to the concept of data compression using the Minimum Description Length principle: a detected cluster structure is the better the more efficient it can be exploited for data compression. Following this idea, we can learn, during the run of a clustering algorithm, the optimal trade-off for attribute weights and distinguish relevant attribute dependencies from coincidental ones. We extend the efficient Cholesky decomposition to model dependencies in heterogeneous data and to ensure interpretability. Our proposed algorithm, INCONCO, successfully finds clusters in mixed type data sets, identifies the relevant attribute dependencies, and explains them using linear models and case-by-case analysis. Thereby, it outperforms existing approaches in effectiveness, as our extensive experimental evaluation demonstrates.
Nerve Growth Factor and Vascular Endothelial Growth Factor: Retrospective Analysis of 63 Patients with Salivary Adenoid Cystic Carcinoma

AimTo detect the expression of nerve growth factor (NGF) and vascular endothelial growth factor (VEGF) in salivary adenoid cystic carcinoma (SACC) tissues, as well as to determine the correlation between growth factor expression and prognosis in SACC.MethodologyMedical records of 63 patients surgically treated for SACC between January 1988 and October 2005 were reviewed. Immunohistochemistry was performed to examine the expression of NGF and VEGF in tumor tissues. Kaplan‐Meier analysis and Cox's proportional hazard regression model were applied to assess predictors of survival.ResultsNGF and VEGF were overexpressed in SACC tissues, compared with those in normal salivary tissues (P<0.05), and the staining intensity of these two factors was stronger in groups of solid subtype, advanced TNM stage, perineural invasion and recurrence. Patients with high‐expression of NGF and VEGF, solid subtype, advanced stage, perineural invasion, recurrence and extended resection alone had worse survival rates (P<0.05). ConclusionNGF and VEGF are expressed increasingly in the tissues of SACC cases with invasion and metastasis. NGF expression and VEGF expression are independent prognosis factors for survival.
Low density MDS codes and factors of complete graphs

We reveal an equivalence relation between the construction of a new class of low density MDS array codes, that we call the B-code, and a combinatorial problem known as perfect one-factorization of complete graphs. We use known perfect one-factors of complete graphs to create constructions and decoding algorithms for both the B-code and its dual code. The B-code and its dual are optimal in the sense that (i) they are MDS, (ii) they have an optimal encoding property, i.e., the number of the parity bits that are affected by the change of a single information bit is minimal and (iii) they have optimal length. The existence of perfect one-factorizations for every complete graph with an even number of nodes is a 35 year long conjecture in graph theory. The construction of B-codes of arbitrary odd length provides an affirmative answer to the conjecture.
Successful ageing in South Africa: opportunity structures and subjective wellbeing

South Africa's seniors number over 1 ,5 million and they age in a variety of social circumstances. The 1990-91 multidimensional survey is the first comprehensive socio-economic study of South Africans of all population groups over 60 years of age. The questionnaire survey, which was conducted among a representative sample of 4 400 urban and rural dwellers, covers aspects of financial security, health, living arrangements and lifestyles, social support and perceived quality of life. The article gives an overview of preliminary research findings. Successful ageing is indicated by measures of subjective wellbeing. The paper describes the social circumstances of the different elderly population groups and explores their relationship to perceived wellbeing. It is concluded that lifestyle advantages do not offset socio-economic disadvantages among the less privileged elderly. Redressing social inequalities affecting seniors in a youthful society is a challenge for post-apartheid society.