Miracle-dz/UniFAR-FTUs huggingface dataset:
Formal Specification and Quantitative Analysis of a Constellation of Navigation Satellites

Navigation satellites are a core component of navigation satellite‐based systems such as Global Positioning System, Global Navigation Satellite System and Galileo, which provide location and timing information for a variety of uses. Such satellites are designed for operating on orbit to perform tasks and have lifetimes of 10 years or more. Reliability, availability and maintainability analysis of systems has been indispensable in the design phase of satellites in order to achieve minimum failures or to increase mean time between failures and thus to plan maintenance strategies, optimise reliability and maximise availability. In this paper, we present formal models of both a single satellite and a navigation satellite constellation and logical specification of their reliability, availability and maintainability properties, respectively. The probabilistic model checker PRISM has been used to perform automated analysis of these quantitative properties. Copyright © 2014 John Wiley & Sons, Ltd.
Black Holes Admitting Strong Resonant Phenomena

High-frequency twin peak quasiperiodic oscillations (QPOs) are observed in four microquasars, i.e., Galactic black hole binary systems, with frequency ratio very close to 3:2. In the microquasar GRS 1915+105, the structure of QPOs exhibits additional frequencies, and more than two frequencies are observed in the Galaxy nuclei Sgr A*, or in some extragalactic sources (NGC 4051, MCG-6-30-15 and NGC 5408 X-1). The observed QPOs can be explained by a variety of the orbital resonance model versions assuming resonance of oscillations with the Keplerian frequency or the vertical epicyclic frequency, and the radial epicyclic frequency, or some combinations of these frequencies. Generally, different resonances could arise at different radii of an accretion disc. However, we have shown that for special values of dimensionless black hole spin strong resonant phenomena could occur when different resonances can be excited at the same radius, as cooperative phenomena between the resonances may work in such situations. The special values of black hole spin are determined for triple frequency ratio sets \nu_{K} : \nu_{\theta} : \nu_{r} = s:t:u with s, t, u being small integers. The most promising example of such a special situation arises for black holes with extraordinary resonant spin a = 0.983 at the radius r = 2.395 M, where \nu_{K} : \nu_{\theta} : \nu_{r} = 3:2:1. We also predict that when combinations of the orbital frequencies are allowed, QPOs with four frequency ratio set 4:3:2:1 could be observed in the field of black holes with a = 0.866, 0.882 and 0.962. Assuming the extraordinary resonant spin a = 0.983 in Sgr A*, its QPOs with observed frequency ratio very close to 3:2:1 imply the black hole mass in the interval 4.3 x 10^6 M_sun < M < 5.4 x 10^6 M_sun, in agreement with estimates given by other, independent, observations.
Olfactory coding in Drosophila larvae investigated by cross-adaptation

SUMMARY In order to reveal aspects of olfactory coding, the effects of sensory adaptation on the olfactory responses of first-instar Drosophila melanogaster larvae were tested. Larvae were pre-stimulated with a homologous series of acetic esters (C3-C9), and their responses to each of these odours were then measured. The overall patterns suggested that methyl acetate has no specific pathway but was detected by all the sensory pathways studied here, that butyl and pentyl acetate tended to have similar effects to each other and that hexyl acetate was processed separately from the other odours. In a number of cases, cross-adaptation transformed a control attractive response into a repulsive response; in no case was an increase in attractiveness observed. This was investigated by studying changes in dose-response curves following pre-stimulation. These findings are discussed in light of the possible intra- and intercellular mechanisms of adaptation and the advantage of altered sensitivity for the larva.
On the feasability of feature based composition for programming in the large

Feature-based composition complements object-oriented composition by enabling the coherent extension of multiple entities (objects, classes). This paradigm enables an integral feature to be the subject of composition rather than fragments of features. The conventional object model of state-of-the-art OO programming languages does not incorporate the notion of features. Therefore, in the traditional OO context, feature based development often requires careful coding in order to add feature fragments to a working application. This state of practice is particularly limiting productivity in the development of large software systems. In this position paper, we sketch the Lasagne model for software composition and we argue that it is well-suited for organizing systems with large amounts of objects and classes. In general, we believe that features are the key concept in achieving complex composition scenarios in large software systems though challenges remain to be tackled. We have experienced and articulated some of the limitations of feature oriented programming. We introduce these elements as a basis for further discussion at the PPPL workshop.
TRIZ Future 2011 , Dublin , Ireland A Method for Facilitating Inventive Design Based on Semantic Similarity and Case-Based Reasoning

While TRIZ is increasingly developing both in resear ch and education, new users always encounter diffic ulties in their first attempts to practice it. In such situat ion, Altshuller’s original matrix often appears as n “easy-to-beginwith” tool. However, while not being representative of what TRIZ really is, it continues to seduce new users, teachers and trainers. Several approaches to automate the us e of the contradiction matrix have been proposed in literature, and researches on the automatic match between specific parameters of the artefact being considered and Alt shuller's generalized parameters remains a topic of interest. In this paper, we propose a way to automate the pr oposal of equivalencies between a specific parameter and a ge neric parameter from the matrix. This method calcul tes the semantic distance between short texts, and uses it to fill the semantic gap between the specific param eters of the artefact and the generalized ones. Case-based reason ing is also used to improve the whole accuracy of t he method.
Graph-Based Multi-Modality Learning for Clinical Decision Support

The task of clinical decision support (CDS) involves retrieval and ranking of medical journal articles for medical records of diagnosis, test or treatment. Previous studies on this task are based on bag-of-words representations of document texts and general retrieval models. In this paper, we propose to use the paragraph vector technique to learn the latent semantic representation of texts and treat the latent semantic representations and the original bag-of-words representations as two different modalities. We then propose to use the graph-based multi-modality learning algorithm for document re-ranking. Experimental results on two TREC-CDS benchmark datasets demonstrate the excellent performance of our proposed approach.
Detection of logical errors in decision table programs

In this paper an algorithm to detect logical errors in a limited-entry decision table and in loop-free programs with embedded decision tables is developed. All the conditions in the decision tables are assumed to be inequalities or equalities relating linear expressions. It is also assumed that actions in a decision table are linear in variables which occur in the condition stub of the decision table (or tables) to which control is transferred from the table. The algorithm is based on determining whether a set of linear inequalities has or does not have a solution. The algorithm described in the paper is implemented in Fortran IV.
A unified gradient domain method for seamless image processing

Seamless image processing concerns stitching parts of images in a visually natural manner. In this paper, we present a seamless processing method which unifies Featuring, Optimal seam method [1] and some recent gradient domain methods including Poisson image editing [2], Drag-and-drop pasting [3] and GIST [4]. To evaluate the processing quality visually, a variational energy function is proposed to compute both the similarity of the stitched image to each of the input images and the visibility of the seam between the stitched images. The minimum of the energy function gives a globally consistent composition in both geometrical and photometric structures. Based on 3 propositions, we study the energy function and compare it with other methods theoretically. The experimental results show the benefits of our stitching method.
Mega-Interpreters and Expert Systems

Meta-programming is a well-known technique widely used in logic programming and artificial intelligence. Meta-interpreters are powerful tools especially for writing expert systems in general and for writing their inference machines in particular. While the classical approach to meta-interpretation is based on the syntactic definition of a meta-interpreter, new approach presented in this paper corresponds more to the meaning of the prefix meta. We analyze the structure of expert systems (problem solvers) to specify a general description of a meta-interpreter. On that basis, we define the concept of a generalized meta-interpreter which we call a mega-interpreter. The mega-interpreter is divided into two parts – the kernel and its extension. While the kernel codes the functions that are common to most interpreters, the extension specifies the domain-specific functions of a particular interpreter.
An Improved velocity Energy-efficient and Link-aware Cluster-Tree based data collection scheme for mobile networks

Data Collection schemes fail to supply a secure reliable network in terms of quality, traffic, and end-to-end affiliation. during this paper, a Improved rate Energy-efficient and Link-aware Cluster-Tree (IVELCT) theme for knowledge assortment in WSNs is projected which might effectively mitigate the issues of coverage distance, mobility, delay, traffic, tree intensity, and end-to-end affiliation. The projected IVELCT constructs the information assortment Tree (DCT) supported the cluster head location. the information assortment node within the DCT doesn't participate in sensing on this explicit spherical, however, it merely collects the information packet from the cluster head and delivers it to the sink. The designed IVELCT theme minimizes the energy exploitation, reduces the end-to-end delay and traffic in cluster head in WSNs by effective usage of the DCT. The strength of the IVELCT algorithmic rule is to construct an easy tree structure, thereby reducing the energy consumption of the cluster head and avoids frequent cluster formation. It additionally maintains the cluster for a substantial quantity of your time. Simulation results have incontestable that IVELCT provides higher QoS in terms of energy consumption, throughput, end-to-end delay, and network time period for mobility-based WSNs.
Optimal Path Cover for Graphs of Small Treewidth

This paper studies the optimal path cover problem in graphs of small treewidth. Let G=(V, E) be a graph modeled by network with vertex set V and edge set E. Given a specified vertex set SVsubeV(G), a path cover is a path P of G such that SVsubeV(P). A path cover PC is optimal if the cost of PC is minimum. Optimal path cover problem is essential in the route design, especially, when the group broadcast is applied. Optimal path cover problem is NP-hard in general graphs. Since the graph representing the modern communication network has small treewidth, we restrict the problem in small treewidth graphs. Suppose the treewidth of G is k. We present an algorithm for the optimal path cover problem. Its time complexity isO(|V|2k*k! ) in the worst case.
Potential cost-effectiveness of public access defibrillation in the United States.

BACKGROUND Approximately 360,000 Americans experience sudden cardiac arrest each year; current treatments are expensive and not very effective. Public access defibrillation (PAD) is a novel treatment for out-of-hospital sudden cardiac arrest that refers to use of automated external defibrillators by the lay public or by nonmedical personnel such as police. A clinical trial has been proposed to evaluate the effectiveness of public access defibrillation, but it is unclear whether such early defibrillation will offer sufficient value for money. Our objective was to estimate the potential cost-effectiveness of public access defibrillation by use of decision analysis. METHODS AND RESULTS A decision model compared the potential cost-effectiveness of standard emergency medical services (EMS) systems with that of EMS supplemented by PAD. We considered defibrillation by lay responders or police, using an analysis with a US health-care perspective. Input data were derived from published data or fiscal databases. Future costs and effects were discounted at 3%. Monte Carlo simulation was performed to estimate the variability in the costs and effects of each program. Sensitivity analyses assessed the robustness of the results to changes in input data. A standard EMS system had a median cost of $5900 per cardiac arrest patient (interquartile range, IQR, $3200 to $10,900) and yielded a median of 0.25 quality-adjusted life years (IQR, 0.20 to 0.30). PAD by lay responders had a median incremental cost of $44,000 per additional quality-adjusted life year (IQR, $29,000 to $68,900). PAD by police had a median incremental cost of $27,200 per additional quality-adjusted life year (IQR, $15,700 to $47,800). The results were sensitive to changes in the cost and relative survival benefit of PAD. CONCLUSIONS Although more expensive than standard EMS for sudden cardiac arrest, PAD may be economically attractive. The effectiveness and cost-effectiveness of PAD should be assessed in a randomized, controlled trial.
Reverse transcription-polymerase chain reaction detection of prostate-specific antigen, prostate-specific membrane antigen, and prostate stem cell antigen in one milliliter of peripheral blood: value for the staging of prostate cancer.

PURPOSE There have been several studies on the presence of circulating tumor cells in the peripheral blood of patients with malignant tumors including prostate cancer (PCa) using reverse transcription-PCR (RT-PCR). One of the aims of these studies was to obtain high sensitivity that would enable early-stage diagnosis. However, they varied in their detection rates, and the methods were rather complicated. We have improved the RT-PCR assay combining three prostate-associated molecules, prostate specific antigen (PSA), prostate specific membrane antigen (PSMA), and prostate stem cell antigen (PSCA) to reveal patients with poor prognosis. EXPERIMENTAL DESIGN Peripheral blood samples were obtained from 129 patients including 58 cases of PCa and 71 cases of nonmalignant disorders. Total RNA was extracted from 1 ml of whole blood using a commercially available kit. RESULTS The sensitivity of PSA-, PSMA-, and PSCA-nested RT-PCR was verified with positive signals of a single LNCaP cell in 1 ml of female blood sample. PSA-, PSMA-, and PSCA-mRNA were detected in 7 (12.1%), 12 (20.7%), and 8 (13.8%) PCa, and in 1, 2, and 0 samples in nonmalignant disorders, respectively. Among 58 PCa patients, each PCR indicated the prognostic value in the hierarchy of PSCA>PSA>PSMA RT-PCR, and extraprostatic cases with positive PSCA PCR indicated lower disease-progression-free survival than those with negative PSCA PCR. CONCLUSIONS The present findings suggest that PSCA PCR would be most promising for the molecular staging of PCa. The present RT-PCR is a highly cost-effective and rapid procedure, enabling the molecular staging of PCa with RT-PCR as a diagnostic routine.
What if DRAM is a slow peripheral

The memory wall is approaching: the time when increases in processor speed will be masked by the high penalty of misses to DRAM. It would seem that the time when we must regard DRAM as a slow peripheral is some way off. But, given the possibility that the inherent latency problem of DRAM may not be solved, that possibility needs to be addressed. This paper presents some thoughts on how future DRAM may be organized, in the form of the proposed RAMnet architecture. RAMnet aims to provide alternative paths between processor and RAM, with a hierarchy of controllers with sufficient intelligence to optimize routing through the hierarchy. Key design goals include minimizing paths between components, and use of commodity components wherever possible. Keywords—memory wall, DRAM interconnect, DRAM latency, RAMnet memory architecture
Evaluation of the pressure ulcers risk scales with critically ill patients: a prospective cohort study 1

AIMS: to evaluate the accuracy of the Braden and Waterlow risk assessment scales in critically ill inpatients. METHOD: this prospective cohort study, with 55 patients in intensive care units, was performed through evaluation of sociodemographic and clinical variables, through the application of the scales (Braden and Waterlow) upon admission and every 48 hours; and through the evaluation and classification of the ulcers into categories. RESULTS: the pressure ulcer incidence was 30.9%, with the Braden and Waterlow scales presenting high sensitivity (41% and 71%) and low specificity (21% and 47%) respectively in the three evaluations. The cut off scores found in the first, second and third evaluations were 12, 12 and 11 in the Braden scale, and 16, 15 and 14 in the Waterlow scale. CONCLUSION: the Braden scale was shown to be a good screening instrument, and the Waterlow scale proved to have better predictive power.
Registers in Singing. Empirical and Systematic Studies in the Theory of the Singing Voice

Despite the general availability in the last two decades of both the spectrum analyzer and prominent pedagogical theories concerning the conscious tun­ ing of vowel formants to enhance the singing voice, there has been little reported use of spectrum analysis to track formant frequencies in singing. An important exception is Sundberg's ( 1973) work on the soprano voice. The rea­ sons for this neglect are considered: in the singing range where information on formant tuning would be most helpful, the wide spacing of the harmonics renders the formants difficult to locate by spectrum analysis. Methods are described for obtaining continuous spectrograms with the vocal tract in the varied articulations of singing by using sweep tones and non-harmonic voice sources, and thus locating quickly and accurately the frequencies of the first five formants. Spectrum Analysis and Singing
Methods for lean , precision-oriented , and targeted coreference resolution

This thesis presents the work of evaluating and improving an existing module for lean and targeted coreference resolution in a system for multilingual and dynamic, social media text analytics. In order to evaluate the current method a mimicking module was developed and an evaluation corpus in three languages was compiled including three public persons as targets. With focus on maintaining precision while increasing recall, the evaluation revealed some weak and strong points within the system concerning the use of certain categories of strings, referred to as expansions, assumed to be coreferential with a target and used for retrieval of sentences. In particular, the system is most vulnerable when epithets for the target are used. Two methods for improving the system were proposed and evaluated. The first makes use of simple sentence distances in order to filter out sentences containing non-coreferential expansions and in the second a named entity recognizer is applied for the same purpose. Results showed that both methods and especially a combination of them had a positive effect on the overall result but that the first is only beneficial for certain kinds of expansion types while the implementation of the second is impractical given the demands of speed and multilinguality on the system.
Unitarizable representations of the deformed para-Bose superalgebra Uq[osp(1/2)] at roots of 1

The unitarizable irreps of the deformed para-Bose superalgebra pBq, which is isomorphic to Uq[osp(1/2)], are classified at q being root of 1. New finite-dimensional irreps of Uq[osp(1/2)] are found. Explicit expressions for the matrix elements are written down.
Face Image Feature Selection Based on Gabor Feature and Recursive Feature Elimination

Face recognition is a research hotspot in recent years. In order to improve recognition accuracy of face recognition, a feature selection method for face image based on Gabor feature and recursive feature elimination was proposed in this paper. Firstly, Gabor features were extracted from face image. Then, face image was divided into pieces and Gabor feature statistics of these pieces were linked in series to compose the original face image feature. Finally, recursive feature elimination based feature selection method was used to construct a low dimensional face image feature for face recognition. The proposed method was verified on ORL face database and the extended Yale face database B, and got high recognition accuracies. The experimental results show that this method can accomplish face recognition satisfactorily and is not sensitive to the inconsistency of details, such as facial expressions, poses and illuminations.
Interventional Algorithms for the Control of Coagulopathic Bleeding in Surgical, Trauma, and Postpartum Settings

Several clinical settings are associated with specific coagulopathies that predispose to uncontrolled bleeding. With the growing concern about the need for optimizing transfusion practices and improving treatment of the bleeding patient, a group of 9 Portuguese specialists (Share Network Group) was created to discuss and develop algorithms for the clinical evaluation and control of coagulopathic bleeding in the following perioperative clinical settings: surgery, trauma, and postpartum hemorrhage. The 3 algorithms developed by the group were presented at the VIII National Congress of the Associação Portuguesa de Imuno-hemoterapia in October 2013. They aim to provide a structured approach for clinicians to rapidly diagnose the status of coagulopathy in order to achieve an earlier and more effective bleeding control, reduce transfusion requirements, and improve patient outcomes. The group highlights the importance of communication between different specialties involved in the care of bleeding patients in order to achieve better results.