Miracle-dz/UniFAR-FTUs huggingface dataset:
Observer-based fault detection and isolation for structured systems

Fault detection and isolation (FDI) problems are here consid- ered for linear systems with faults and disturbances. We design a set of ob- server-based residuals in such a way that the transfer from the disturbances to the residuals is zero, and the transfer from the faults to the residuals al- lows fault isolation. We are interested in obtaining a transfer function from faults to residuals with either a diagonal structure (i.e., a dedicated struc- tured residuals set) or a triangular one. We deal with this problem when the system under consideration is structured. That is, the entries of the system matrices are either fixed zeros or free parameters. To a structured system, one can associate in a natural way a directed graph. We can then provide necessary and sufficient conditions under which the FDI problems have a solution for almost any value of the free parameters. These conditions are simply expressed in terms of input-output paths in the associated graph. Index Terms—Fault detection and isolation, graph theory, model-based approach, structured residuals, structured systems.
Multimedia processor-based implementation of an error-diffusion halftoning algorithm exploiting subword parallelism

Multimedia processor-based implementations of digital image processing algorithms have become important since several multimedia processors are now available and can replace special-purpose hardware-based systems because of their flexibility. Multimedia processors increase throughput by processing multiple pixels simultaneously using a subword-parallel arithmetic and logic unit architecture. The error-diffusion halftoning algorithm employs feedback of quantized output signals to faithfully convert a multi-level image to a binary image or to one with fewer levels of quantization. This makes it difficult to achieve speedup by utilizing the multimedia extension. In this study, the error-diffusion halftoning algorithm is implemented for a multimedia processor using three methods: single-pixel, single-line, and multiple-line processing. The single-pixel approach is the closest to conventional implementations, but the multimedia extension is used only in the filter kernel. The single-line approach computes multiple pixels in one scan-line simultaneously, but requires a complex algorithm transformation to remove dependencies between pixels. The multiple-line method exploits parallelism by employing a skewed data structure and processing multiple pixels in different scan-lines. The Pentium MMX instruction set is used for quantitative performance evaluation including run-time overheads and misaligned memory accesses. A speedup of more than ten times is achieved compared to the software (integer C) implementation on a conventional processor for the structurally sequential error-diffusion halftoning algorithm.
ICE matching , robust and fast featured-based scan matching for an online operation

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.
Reliability of the Modified Rankin Scale Across Multiple Raters: Benefits of a Structured Interview

Background and Purpose— The modified Rankin Scale (mRS) is widely used to assess global outcome after stroke. The aim of the study was to examine rater variability in assessing functional outcomes using the conventional mRS, and to investigate whether use of a structured interview (mRS-SI) reduced this variability. Methods— Inter-rater agreement was studied among raters from 3 stroke centers. Fifteen raters were recruited who were experienced in stroke care but came from a variety of professional backgrounds. Patients at least 6 months after stroke were first assessed using conventional mRS definitions. After completion of initial mRS assessments, raters underwent training in the use of a structured interview, and patients were re-assessed. In a separate component of the study, intrarater variability was studied using 2 raters who performed repeat assessments using the mRS and the mRS-SI. The design of the latter part of the study also allowed investigation of possible improvement in rater agreement caused by repetition of the assessments. Agreement was measured using the &kgr; statistic (unweighted and weighted using quadratic weights). Results— Inter-rater reliability: Pairs of raters assessed a total of 113 patients on the mRS and mRS-SI. For the mRS, overall agreement between raters was 43% (&kgr;=0.25, &kgr;w=0.71), and for the structured interview overall agreement was 81% (&kgr;=0.74, &kgr;w=0.91). Agreement between raters was significantly greater on the mRS-SI than the mRS (P<0.001). Intrarater reliability: Repeatability of both the mRS and mRS-SI was excellent (&kgr;=0.81, &kgr;w ≥0.94). Conclusions— Although individual raters are consistent in their use of the mRS, inter-rater variability is nonetheless substantial. Rater variability on the mRS is thus particularly problematic for studies involving multiple raters. There was no evidence that improvement in inter-rater agreement occurred simply with repetition of the assessment. Use of a structured interview improves agreement between raters in the assessment of global outcome after stroke.
Out-of-bag discriminative graph mining

In class-labeled graph databases, each graph is associated with one from a finite set of classes, which induces associations between classes and subgraphs occurring in the database graphs. The subgraphs with strong class associations are called discriminative subgraphs. In this work, discriminative subgraphs are repeatedly mined on bootstrap samples of a graph database in order to improve on estimation of subgraph associations. The number of times a subgraph occurs in a graph associated with each class (support values) is recorded over the out-of-bag instances of the bootstrap process. We investigate sample mean and maximum likelihood estimation for the approximation of the true underlying support from these empirical values. It is shown that both significantly improve on the process, compared to single runs of discriminative graph mining, by applying the methods to publicly available toxicological databases, and validating support values, class bias, and class significance. In toxicology, the detection of subgraphs (fragments of chemical structure) that induce toxicity is a major goal. Apart from the subgraph associations being statistically validated, the number of subgraphs created by the proposed methods are much lower than for ordinary discriminative graph mining, which is often a bottleneck in the application of computational models to such databases, and hinders interpretation of the results.
Alcohols, ethers, carbohydrates, and related compounds. I. The MM4 force field for simple compounds

Simple alcohols and ethers have been studied with the MM4 force field. The structures of 13 molecules have been well fit using the MM4 force field. Moments of inertia have been fit with rms percentage errors as indicated: 18 moments for ethers, 0.28%; 21 moments for alcohols, 0.22%. Rotational barriers and conformational equilibria have also been examined, and the experimental and ab initio results are reproduced substantially better with MM4 than they were with MM3. Much of the improvement comes from the use of additional interaction terms in the force constant matrix, of which the torsion–bend and torsion–torsion are particularly important. Induced dipoles are included in the calculation, and dipole moments are reasonably well fit. It has been possible for the first time to fit conformational energetic data for both open chain and cyclic alcohols (e.g., propanol and cyclohexanol) with the same parameter set. For vibrational spectra, over a total of 82 frequencies, the rms error is 27 cm−1, as opposed to 38 cm−1 with MM3. Both the α and β bond shortening resulting from the presence of the electronegative oxygen atom in the molecule are well reproduced. The electronegativity of the oxygen is sufficient that one must also include not only the α and β electronegativity effects on bond lengths, but also on angle distortions, if structures are to be well reproduced. The heats of formation of 32 alcohols and ethers were fit overall to within experimental error (weighted standard deviation error 0.26 kcal/mol). © 2003 Wiley Periodicals, Inc. J Comput Chem 24: 1447–1472, 2003
SIZE EFFECT IN BLUNT FRACTURE: CONCRETE,

The fracture front in concrete, as well as rock, is blunted by a zone of microcracking, and in ductile metals by a zone of yielding. This blunting causes deviations from the structural size effect known from linear elastic fracture mechanics (LEFM). The size effect is studied first for concrete or rock structures, using dimensional analysis and illustrative examples. Fracture is considered to be caused by propagation of a crack band that has a fixed width at its front relative to the aggregate size. The analysis rests on the hypothesis that the energy release caused by fracture depends on both the length and the area of the crack band. The size effect is shown to consist in a smooth transition from the strength criterion for small sizes to LEFM for large sizes, and the nominal stress (IN at failure is found to decline as (1 + 1./1. 0)-112 in which 1.0 = constant and A = relative structure size. This function is verified by Walsh's test data. If reinforcement is present at the fracture front and behaves elastically, the decline of (J N is of the same type but is shifted to larger sizes; however, if the reinforcement yields, the decline of (J N stops. It is also noted that some known size effects which have been attributed to random strength variations within the structure should be explained by fracture mechanics, which gives a very different extrapolation to large structures. Finally, exploiting the fact that in metals the size of the yielding zone at the fracture front is approximately constant, it is shown by dimensional analYSis that elastic-plastic fracture causes a similar size effect.
Optimal allocation of test resources for software reliability growth modeling in software development

A component-based software development approach has become a trend in integrating modern software systems. To ensure the overall reliability of an integrated software system, its software components have to meet certain reliability requirements, subject to some testing schedule and resource constraints. Efficiency improvement of the system-testing can be formulated as a combinatorial optimization problem with known cost, reliability, effort and other attributes of the system components. This paper considers "software component testing resource allocation" for a system with single or multiple applications, each with a pre-specified reliability requirement. The relation between failure rates of components and "cost to decrease this rate" is modeled by various types of reliability-growth curves. Closed-form solutions to the problem for systems with one single application are developed, and then "how to solve the multiple application problem using nonlinear programming techniques" are described. Also examined are the interactions between the system components, and inter-component failure dependencies are included in the modeling formula. In addition to regular systems, the technique is extended to address fault-tolerant systems. A procedure for a systematic approach to the testing resource allocation problem is developed, and its application in a case study of a telecommunications software system is described. This procedure is automated in a reliability allocation tool for an easy specification of the problem and an automatic application of the technique. This methodology gives the basic approach to optimization of testing schedules, subject to reliability constraints. This adds "interesting new optimization opportunities in the software testing phase" to the existing optimization literature that is concerned with structural optimization of the software architecture. Merging these two approaches improves the reliability planning accuracy in component-based software development.
The Microenvironment of Human Implantation: Determinant of Reproductive Success

Successful implantation requires synchronous development of embryo and endometrium. Endometrial receptivity results from progesterone‐induced differentiation of endometrial cells, generally achieved during the mid‐secretory phase of the cycle. Failure to properly develop receptivity results in failed or inadequate implantation and hence no ongoing pregnancy. The blastocyst undergoes final development, apposition, attachment and initiates invasion of the endometrial epithelium within the uterine cavity. Thus, the microenvironment provided by uterine fluid, particularly glandular secretions, is essential for implantation. Analysis of endometrial fluid has identified cytokines, chemokines, proteases, antiproteases and other factors that modulate blastocyst functions relevant to implantation. Exosomes/microvesicular bodies released from the endometrium (and likely also the embryo) are present in uterine fluid. These can transfer miRNA, proteins and lipids between cells, thus providing endometrial–embryo communication in the peri‐implantation period. Understanding the uterine microenvironment, and its effects on endometrial–embryo interactions, will provide opportunities to modify current infertility treatments to improve success rates.
Genomic HIV RNA Induces Innate Immune Responses through RIG-I-Dependent Sensing of Secondary-Structured RNA

Background Innate immune responses have recently been appreciated to play an important role in the pathogenesis of HIV infection. Whereas inadequate innate immune sensing of HIV during acute infection may contribute to failure to control and eradicate infection, persistent inflammatory responses later during infection contribute in driving chronic immune activation and development of immunodeficiency. However, knowledge on specific HIV PAMPs and cellular PRRs responsible for inducing innate immune responses remains sparse. Methods/Principal Findings Here we demonstrate a major role for RIG-I and the adaptor protein MAVS in induction of innate immune responses to HIV genomic RNA. We found that secondary structured HIV-derived RNAs induced a response similar to genomic RNA. In primary human peripheral blood mononuclear cells and primary human macrophages, HIV RNA induced expression of IFN-stimulated genes, whereas only low levels of type I IFN and tumor necrosis factor α were produced. Furthermore, secondary structured HIV-derived RNA activated pathways to NF-κB, MAP kinases, and IRF3 and co-localized with peroxisomes, suggesting a role for this organelle in RIG-I-mediated innate immune sensing of HIV RNA. Conclusions/Significance These results establish RIG-I as an innate immune sensor of cytosolic HIV genomic RNA with secondary structure, thereby expanding current knowledge on HIV molecules capable of stimulating the innate immune system.
Virtual team awareness and groupware support: an evaluation of the TeamSCOPE system

This paper overviews a Web-based collaborative system called TeamSCOPE that has been designed to support awareness needs of globally distributed teams. Four types of awareness needs of virtual teams are defined and the awareness support features of TeamSCOPE are described. The usage patterns of eight globally distributed engineering design teams are outlined, and evaluation results are provided. Findings illustrate how group process interacts with technology to create design challenges in the support of virtual team awareness needs.
Ivermectin toxicosis in three adult horses.

CASE DESCRIPTION 3 adult Quarter Horses were evaluated for acute, progressive neurologic signs 18 hours after oral administration of 1 dose of 1.87% ivermectin paste. CLINICAL FINDINGS Clinical signs included depression, forelimb and hind limb ataxia, drooping of the superior and inferior lips, and muscle fasciculations. Bilateral mydriasis, decreased pupillary light reflexes, and absent menace reflexes were evident. Clinical signs progressed in severity for 36 hours after administration of the ivermectin. TREATMENT AND OUTCOME All horses were treated supportively with IV administration of fluids and anti-inflammatory medications. Two horses survived with no apparent long-term sequelae. One horse was euthanized, and a high concentration of ivermectin was detected in its brain tissue at postmortem examination. Analysis of the ivermectin concentration in the paste product revealed that the concentration was approximately that indicated on the packaging. CLINICAL RELEVANCE Ivermectin toxicosis is an uncommonly reported condition in equids that should be considered when acute neurologic impairment develops after ivermectin administration. Recovery is possible with supportive care and time.
Diagnosis and management of miliary tuberculosis: current state and future perspectives

Tuberculosis (TB) remains one of the most important causes of death from an infectious disease, and it poses formidable challenges to global health at the public health, scientific, and political level. Miliary TB is a potentially fatal form of TB that results from massive lymphohematogenous dissemination of Mycobacterium tuberculosis bacilli. The epidemiology of miliary TB has been altered by the emergence of the human immunodeficiency virus (HIV) infection and widespread use of immunosuppressive drugs. Diagnosis of miliary TB is a challenge that can perplex even the most experienced clinicians. There are nonspecific clinical symptoms, and the chest radiographs do not always reveal classical miliary changes. Atypical presentations like cryptic miliary TB and acute respiratory distress syndrome often lead to delayed diagnosis. High-resolution computed tomography (HRCT) is relatively more sensitive and shows randomly distributed miliary nodules. In extrapulmonary locations, ultrasonography, CT, and magnetic resonance imaging are useful in discerning the extent of organ involvement by lesions of miliary TB. Recently, positron-emission tomographic CT has been investigated as a promising tool for evaluation of suspected TB. Fundus examination for choroid tubercles, histopathological examination of tissue biopsy specimens, and rapid culture methods for isolation of M. tuberculosis in sputum, body fluids, and other body tissues aid in confirming the diagnosis. Several novel diagnostic tests have recently become available for detecting active TB disease, screening for latent M. tuberculosis infection, and identifying drug-resistant strains of M. tuberculosis. However, progress toward a robust point-of-care test has been limited, and novel biomarker discovery remains challenging. A high index of clinical suspicion and early diagnosis and timely institution of antituberculosis treatment can be lifesaving. Response to first-line antituberculosis drugs is good, but drug-induced hepatotoxicity and drug–drug interactions in HIV/TB coinfected patients create significant problems during treatment. Data available from randomized controlled trials are insufficient to define the optimum regimen and duration of treatment in patients with drug-sensitive as well as drug-resistant miliary TB, including those with HIV/AIDS, and the role of adjunctive corticosteroid treatment has not been properly studied. Research is going on worldwide in an attempt to provide a more effective vaccine than bacille Calmette–Guérin. This review highlights the epidemiology and clinical manifestation of miliary TB, challenges, recent advances, needs, and opportunities related to TB diagnostics and treatment.
Creating motives for cooperation to achieve high throughput in wireless ad hoc networks

In wireless ad hoc networks, nodes that are not within the same transmission range communicate using intermediate nodes as relays. Due to their limited battery life, wireless nodes can decide to deny incoming relay requests, in which case the network's connectivity and aggregate throughput decreases. In this paper, we describe two algorithms that create motives for cooperation among node in an ad hoc network. The first algorithm, called neighbor GTFT (N-GTFT) is an extension of the GTFT (generous tit-for-tat) algorithm presented in V. Srinivasan et al. (2003), according to which a node relays packets for a particular neighbor based on the amount of given help it has received from that neighbor. The second algorithm maintains the difference between the amount of received and the amount of given help within bounds defined by a token bucket, and yields higher throughput in the case of bursty traffic. Both algorithms can be extended to a weighted version, which inappropriate when the destinations are not uniformly distributed, as in the case where most nodes send traffic to an access point.
Fast Hausdorff Trajectory Similarity on Spatial Networks using Virtual Nodes

Given a set of trajectories on a spatial network, the goal of the Network Hausdorff Distance Trajectory Similarity Matrix (NHDTSM) problem is to quickly calculate the commonly used network Hausdorff distance between all pairs of input trajectories. This problem is important to a variety of domains using trajectories, such as transportation services interested in finding primary corridors for public transportation or greener travel (e.g., bicycling) by leveraging emerging GPS trajectory datasets. Related work in trajectory similarity on networks uses heuristics to quickly approximate the network Hausdorff distance between trajectories, potentially missing interesting patterns due to a lack of correctness. The NHD-TSM problem is challenging due to the computational cost of computing pairwise shortest distance values required for the network Hausdorff distance between trajectories in large datasets. To reduce the computational cost of creating this track similarity matrix, we propose a novel algorithm for computing the network Hausdorff distance directly by modifying the underlying graph, creating virtual trajectories. We prove this approach retains correctness while remaining significantly faster than related approaches.