Miracle-dz/UniFAR-FTUs huggingface dataset:
CAHIER DU LAMSADE 258 Juillet 2007 On the complexity of the exact weighted independent set problem

In this paper, we introduce the exact weighted independent set problem (EWIS), the problem of determining whether a given weighted graph contains an independent set of a given weight. Our motivation comes from the related exact perfect matching problem, whose computational complexity is still unknown. We determine the complexities of the EWIS problem and its restricted version EWISα (where the independent set is required to be of maximum size) for several graph classes. These problems are strongly NP-complete for cubic bipartite graphs; we also extend this result to a more general setting. On the positive side, we show that EWIS and EWISα can be solved in pseudo-polynomial time for chordal graphs, AT-free graphs, distance-hereditary graphs, circle graphs, graphs of bounded clique-width, and several subclasses of P5-free and fork-free graphs. In particular, we show how modular decomposition can be applied to the exact weighted independent set problem.
An improved technique for clearing and staining plant tissues for detection of nematodes.

Numerous procedures have been used to stain and clear nematode-infected plant tissues (7). Staining with acid fuchsin and destaining with lactophenol (4,7) has been the most widely used technique. More rap id means, of clearing and staining roots include autoclaving (1), exposure to saturated chloral hydrate (6), and root macera t ion after staining (3). However, extreme care is required for these methods. Researchers working with mycorrhizal ftmgi found potassium hydroxide (KOH), nitric acid, hydrogen peroxide (H202), or sodium hypochlorite (NaOC1) to be effective in clearing roots (2,5), depending on the type of tissue to be cleared. Alkal ine H:O. , was the best bleaching agent for pigmented roots (5). Excessive bleaching with NaOCI often resulted in poor staining of tissues. A modified acid-fuchsin staining-destaining wocedure utilizing NaOC1 as a prestaining t rea tment for nematode-infected plant tissues is described herein. Roots are washed, chopped into 1-2-cm segments, aml placed in a 150-ml beaker with 50 ml tap water. Twen t y milli l i ters of chlorine bleach (5.25,.o/.0 NaOC1) are added to give 1.5% NaOC1, and the root tissue pieces are allowed to remain in this solution for 4 ntiu with occasional a~ ta t ion . Following the NaOCI treatment, the root segments are rinsed in runn ing water (30-45 sec) and allowed to soak in tap water for 15 min to remove residual NaOC1. T h e material is then drained and t ransferred to a beaker containing 30 ml of water to which has been added 1 ml of stain (3.5 g acid fuchsin, 250 ml acetic acid, and 750 ml distilled water). Th i s solution is then heated to boil ing for about 30 sec. After cooling to room temperature , excess stain is removed by rinsing in runn ing water. T h e root, mater ia l is then placed in 20-30 ml of glycerin acidified with a few drops of 5N HC1, heated to boiling, and
Electrical Impedance Plethysmography: A Physical and Physiologic Approach to Peripheral Vascular Study

The quantity of blood measured by electrical impedance plethysmography is defined by its resistive effect in parallel to the resistance of other tissue of the segment. By substitution of this parallel resistive value, together with data relative to the resistivity of blood and the length of the segment in the formula for the volume of an electrical conductor, we are able to derive the volume of the pulse in cubic centimeters. It follows that the volume displaced from the venous reservoir and the rate of refilling of the venous reservoir of an extremity may also be determined quantitatively.
Replacement paths and k simple shortest paths in unweighted directed graphs

Let <i>G</i> = (<i>V,E</i>) be a <i>directed</i> graph and let <i>P</i> be a shortest path from <i>s</i> to <i>t</i> in <i>G</i>. In the <i>replacement paths</i> problem, we are required to find, for every edge <i>e</i> on <i>P</i>, a shortest path from <i>s</i> to <i>t</i> in <i>G</i> that avoids <i>e</i>. The only known algorithm for solving the problem, even for unweighted directed graphs, is the trivial algorithm in which each edge on the path, in its turn, is excluded from the graph and a shortest paths tree is computed from <i>s</i>. The running time is <i>O</i>(<i>mn</i> + <i>n</i><sup>2</sup> log <i>n</i>). The replacement paths problem is strongly motivated by two different applications: (1) The fastest algorithm to compute the <i>k</i> <i>simple</i> shortest paths between <i>s</i> and <i>t</i> in directed graphs [Yen 1971; Lawler 1972] computes the replacement paths between <i>s</i> and <i>t</i>. Its running time is <i>Õ</i>(<i>mnk</i>). (2) The replacement paths problem is used to compute the <i>Vickrey pricing</i> of edges in a distributed network. It was raised as an open problem by Nisan and Ronen [2001] whether it is possible to compute the Vickrey pricing faster than <i>n</i> computations of a shortest paths tree. In this article we present the first nontrivial algorithm for computing replacement paths in unweighted directed graphs (and in graphs with small integer weights). Our algorithm is Monte-Carlo and its running time is <i>Õ</i>(<i>m</i>√<i>n</i>). This result immediately improves the running time of the two applications mentioned above in a factor of √<i>n</i>. We also show how to reduce the problem of computing <i>k</i> simple shortest paths between <i>s</i> and <i>t</i> to <i>O</i>(<i>k</i>) computations of a second simple shortest path from <i>s</i> to <i>t</i> each time in a different subgraph of <i>G</i>. The importance of this result is that computing a second simple shortest path may turn out to be an easier problem than computing the replacement paths, thus, we can focus our efforts to improve the <i>k</i> simple shortest paths algorithm in obtaining a faster algorithm for the second shortest path problem.
A new generic taxonomy of malware behavioural detection and removal techniques

Modern malware has become a major threat to today’s Internet communications. The threat can infiltrate hosts using a variety of methods, such as attacks against known software vulnerabilities, hidden functionality in regular programs, drive-by download from unsafe web sites, and so forth. Matching a file stream against a known virus pattern is a fundamental technique for detecting viruses. With the popularity and variety of malware attack over the Internet, computer virus protection companies need to constantly update new virus signatures in their virus definition databases. However, the increasing size of the signature database can only detect known virus but cannot defend against new variants of malware. In this paper, we present an overview of the detection of modern malware focuses on suspect behavioural patterns. Contrary to classical heuristic engines which focus on the detection of encrypted malware samples, we integrate a known packer detector as well as unpacking routines to circumvent the protection techniques used by most of the modern malware. We believe that many obfuscated techniques used by malware authors are available on the Internet. More precisely, the use of known packer removals would strip out the packer protection with our dedicated decryption routines. Our apprehensive program is based on the integration of both static heuristic and emulator approaches; however, they do not necessarily have to serve as a complement for each other. Static heuristic scanner involves static extraction, which is relying on byte signature to identify a dedicated viral signature. Emulator can execute the arbitrary code from the instance and would trace the instance’s body code in a virtual environment. It can be used to combat any protection code, regardless of the complexity of the protection algorithm. Fragments of virus body could be detected while the execution is in a decrypted virus body. Lastly, we present experimental results that indicate our proposed technique can provide good performance against obfuscated malware. Through this study, we hope to help security researchers understand our defence approach and give some directions for future research.
Proof-reading guidance in cell tracking by sampling from tracking-by-assignment models

Automated cell tracking methods are still error-prone. On very large data sets, uncertainty measures are thus needed to guide the expert to the most ambiguous events so these can be corrected with minimal effort. We present two easy-to-use methods to sample multiple proposal solutions from a tracking-by-assignment graphical model and experimentally evaluate the benefits of the uncertainty measures derived. Expert time for proof-reading is reduced greatly compared to random selection of predicted events.
Disordered Systems and the Functional Renormalization Group: A Pedagogical Introduction

In this article, we review basic facts about disordered systems, especially the existence of many metastable states and and the resulting failure of dimensional reduction. Besides tech-niques based on the Gaussian variational method and replica-symmetry breaking (RSB), the functional renormalization group (FRG) is the only general method capable of attacking strongly disordered systems. We explain the basic ideas of the latter method and why it is difﬁcult to implement. We ﬁnally review current progress for elastic manifolds in disorder.
Eosinophilic meningitis caused by Angiostrongylus cantonensis: an emergent disease in Brazil

Eosinophilic meningitis (EoM) is an acute disease that affects the central nervous system. It is primarily caused by infection with the nematode Angiostrongylus cantonensis. This infection was previously restricted to certain Asian countries and the Pacific Islands, but it was first reported in Brazil in 2007. Since then, intermediate and definitive hosts infected with A. cantonensis have been identified within the urban areas of many states in Brazil, including those in the northern, northeastern, southeastern and southern regions. The goals of this review are to draw the attention of the medical community and health centres to the emergence of EoM in Brazil, to compile information about several aspects of the human infection and mode of transmission and to provide a short protocol of procedures for the diagnosis of this disease.
Screening of CYP1B1 and MYOC in Moroccan families with primary congenital glaucoma: Three novel mutations in CYP1B1

Purpose To investigate the contribution of cytochrome P4501B1 (CYP1B1) and myocillin (MYOC) mutations to primary congenital glaucoma (PCG) in Moroccan families. Methods This study included 90 unrelated families with PCG and 100 normal control individuals. Two previously reported CYP1B1 mutations (g.4339delG and p.G61E) were first screened by polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP). The coding exons of CYP1B1 were sequenced in g.4339delG- and p.G61E-negative or heterozygous probands. Then the coding exons of MYOC were sequenced in patients who had no mutation in CYP1B1 or carried heterozygous CYP1B1 mutation. Results Twelve CYP1B1 mutations were identified in 43 PCG pedigrees. Three of them were novel (p.R163C, p.C470Y, and g.4330–4331delTG) and associated with moderate to severe phenotypes. Two novel intronic polymorphisms in CYP1B1 were identified in addition to those previously described. The g.4339delG was the most frequent mutation detected in 31 families (34.44%), followed by the p.G61E in seven families (7.77%). The remaining mutations (p.R163C, p.E173K, g.4330–4331delTG, p.E229K, p.R390S, p.R368H, p.R469W, p.C470Y, and g.7901–7913del13bp) were infrequent. One family with the p.R390S mutation showed both PCG and primary open angle glaucoma (POAG) phenotypes. One proband was heterozygous for p.T193K mutation in MYOC. This mutation has been initially associated with POAG, but never with PCG. Conclusions Our results support that mutations in CYP1B1 are a major cause for PCG in the Moroccan population with a predominance of the g.4339delG mutation. Furthermore, these results demonstrate the diversity of CYP1B1 mutations, while suggesting a modest role of MYOC in Moroccan PCG.
5-amino-1,2,4-thiadiazole derivatives

The invention relates to organic chemistry, more specifically to novel biologically active compounds in the form of 5-amino-1,2,4-thiadiazole derivatives of general formula (I), where X may be ONO 2 or NHR 3 ; R 1 , R 2 , R 3 may be the same or different and independently represent hydrogen, alkyl, aryl, aralkyl, heteroaryl, heteroaralkyl or cycloakyl and R 1 + R 2 may represent a heterocycle (for example, optionally substituted pyrrolidine, piperidine, azepane, piperazine, morpholine, etc.) provided that when R 1 = H, R 2 is different from hydrogen or methyl. The 5-amino-1,2,4-thiadiazole derivatives are of particular interest as drugs for the prevention and treatment of neurodegenerative diseases, for example Alzheimer's disease.
Stateful paging guard devices and methods for controlling a stateful paging guard device

The invention discloses stateful paging guard devices and methods for controlling a stateful paging guard device. In an embodiment, a stateful paging guard device is provided. The stateful paging guard device may include: a state determiner configured to determine state information indicating whether a terminal device is in an operation state of reduced energy consumption; a receiver configured to receive data directed to the terminal device; and a relay determiner configured to determine whether the data is to be relayed to the terminal device based on the state information.
Development of the Blood and Muscle Oxygen Stores in Gray Seals (Halichoerus grypus): Implications for Juvenile Diving Capacity and the Necessity of a Terrestrial Postweaning Fast

To successfully transition from nursing to foraging, phocid seal pups must develop adequate diving physiology within the limited time between birth and their first independent foraging trip to sea. We studied the postpartum development of oxygen stores in gray seals (Halichoerus grypus, n = 40) to better understand the ontogeny of diving capacity in phocids. Hemoglobin (Hb), hematocrit (Hct), blood volume (BV), and myoglobin (Mb) levels in newborn (3 d postpartum [DPP]) and newly weaned (17 ± 0.4 DPP) pups were among the lowest measured across age classes. During the pups’ terrestrial postweaning fast (PWF), Hb, Hct, mass‐specific BV, and Mb increased by 28%, 21%, 13%, and 29%, respectively, resulting in a 35% increase in total body mass‐specific oxygen stores and a 23% increase in calculated aerobic dive limit (CADL). Although Hb and Hct levels at the end of the PWF were nearly identical to those of yearlings, total body mass‐specific oxygen stores and CADL of weaned pups departing for sea were only 66%–67% and 32%–62%, respectively, of those for yearlings and adult females. The PWF represents an integral component of the physiological development of diving capacity in phocids; however, newly independent phocids still appear to have limited diving capabilities at the onset of foraging.
Crosstalk-Glitch Gating: A Solution for Designing Glitch-Tolerant Asynchronous Handshake Interface Mechanisms for GALS Systems

This paper proposes a novel solution to make asynchronous handshake interfaces tolerant to crosstalk-glitch propagation (GP). This study leverages our recently proposed crosstalk-glitch modeling technique for asynchronous systems, which models the crosstalk GP in asynchronous interfaces. In this paper, a novel set of solutions to quench the GP is proposed. This set of solutions is called crosstalk-glitch gating, as the quenching is obtained by using carefully generated control signals. A step-by-step method is recommended to apply crosstalk-glitch gating to conventional asynchronous handshake interfaces. Transistor-level electrical simulations demonstrate that our method effectively generates crosstalk-glitch gate-controlling signals. In comparison with contemporary signal-integrity management techniques, our gating methodology can be applied to fewer nodes and earlier in the design cycle.
The Effects of High-Intensity Aerobic Exercise on Cognitive Performance After Stroke: A Pilot Randomised Controlled Trial

Background: Aerobic exercise is an effective treatment to improve aerobic capacity following stroke and might also improve cognitive impairments in sub-acute stroke survivors. The aim of the study was to assess the effect of high-intensity aerobic exercise on cognitive impairments in sub-acute stroke survivors. Methods: A pilot, randomised controlled trial on the effects of aerobic exercise on cognitive impairments of stroke patients in the sub-acute (1-3 months) phase was conducted. Thirty patients with moderate cognitive impairments (maximum score of 5 on at least two items on the cognitive subscales of the Functional Independence Measure [FIM]) were included in the study and randomly assigned to either the intervention group – performing high-intensity aerobic exercise (above 70% of maximum heart rate), or the control group – performing low-intensity aerobic exercise (below 60%). Patients in both groups exercised for 50 min twice a week for 4 weeks. Primary neuropsychological outcome: Trail Making Test B. Results: Thirty stroke patients completed the interventions. The results showed that the high-intensity group, compared with the low-intensity group, achieved significant improvements on Trail Making Test B, which assesses processing speed and divided attention (P = .04 after training and P = .01 at follow-up). However, the significant improvements on Trail Making Test B might relate to a ceiling effect in the control group. Conclusions: This study does not provide evidence to support that aerobic exercise can improve cognition in stroke survivors, even though significant improvement was revealed on the primary outcome in sub-acute stroke survivors following high-intensity aerobic exercise compared with low-intensity general exercise.
New pharmacological targets in the treatment of heart failure: inhibition of free fatty oxidation by trimetazidine

Heart failure may promote alterations of cardiac metabolism, resulting in the depletion of myocardial ATP, phosphocreatine and creatine kinase with decreased efficiency of mechanical work. A direct approach to manipulate cardiac energy metabolism consists in modifying substrate utilization by the failing heart. To date, the most effective metabolic treatments include pharmacological agents that directly inhibit fatty acid oxidation. Trimetazidine (Vastarel® MR) appears to be the most investigated agent in this setting. The results of current research support the concept that shifting the energy substrate preference away from fatty acid metabolism and towards glucose metabolism could be an effective adjunctive treatment in patients with heart failure. More specifically, very recent meta-analyses have confirmed that the additional use of trimetazidine in heart failure patients may yield a significant protective effect for all-cause mortality, cardiovascular events and hospitalization for cardiac causes, improve clinical symptoms and cardiac function, and simultaneously ameliorate left ventricular remodeling. Certainly, in order to clarify the exact therapeutic role of metabolic therapy in heart failure, a large multicenter randomized controlled trial should be performed.
The On‐line Diagnosis of Time Petri Nets Based on Partial Orders

In this paper we propose an on-line diagnosis algorithm for Time Petri Nets (TPN). The plant observation is given by a subset of transitions and the faults are modeled by a subset of unobservable transitions. The plant behavior is derived on-line and the diagnosis is obtained checking whether or not some or all of the traces in the behavior that obey the plant observation contain fault events. We calculate the legal plant behavior as a set of configurations in the net unfolding. We calculate the set of legal traces in the TPN deriving for each configuration the solution set of a system of (max,+)-linear inequalities called the characteristic system of the configuration. We present two methods to derive the entire set of solutions of a characteristic system: the first method is based on Extended Linear Complementarity Problem while the second method is based on constraint propagation.
Developing an Adaptive Digital Talking Book Player with FAME

This article presents the development of an adaptive multimodal Digital Talking Book player using FAME. FAME is a conceptual framework for the development of adaptive multimodal applications. FAME's adaptation is based on context changes. The context is defined by three entities: User, Platform and Environment. The adaptation can impact multimodal operations, as well as interaction and presentation aspects. FAME introduces the notion of Behavioral Matrix. This is used to represent adaptation rules, store their activation count, and provide a mechanism for changing active rules in response to changes in the context. Usability and accessibility flaws have been identified in current Digital Talking Book players. The developed player proved the feasibility of FAME for developing adaptive multimodal applications, while also demonstrating that the introduction of multimodal input and outputs and of adaptive features helps overcome the limitations of current players.