Miracle-dz/UniFAR-FTUs huggingface dataset:
Options thérapeutiques pour les gliomes malins de degré III et IV OMS

En plus du contrôle local de la tumeur (chirurgie et radiothérapie), le principal défi est l’action sur les éléments tumoraux infiltratifs (fig. 1a, 1b). Un traitement idéal est prédictif de la réponse tumorale et non toxique pour le cerveau sain. Une première étape dans ce sens est la valeur prédictive d’un déficit génétique spécifique dans les oligodendrogliomes, qui permet de prévoir de manière assez précise la réponse à la chimiothérapie. Cairncross a montré en 1998 [1] que l’absence de l’allèle sur les chromosomes 1p et 19q dans les tumeurs oligodendrogliales implique de manière significative une chimiosensibilité et une plus longue survie sans récidive. Esteller et al. [2] pensent quant à eux que la réponse des gliomes malins aux agents alkylants dépend du status de méthylation du gène de réparation de l’ADN MGMT (O6-méthylguanine-ADN-méthyltransférase). Ces deux études sont à prendre comme les premiers pas vers un traitement antitumoral plus rationnel. Le profil génétique de ces tumeurs déterminera probablement le choix des traitements spécifiques à l’avenir.
Teaching the Same Lesson Twice: Comparing Student Evaluation Surveys to Analyze Teacher Efficacy across Classes

Many teachers may teach the same class to two or more sections of students. There is some question as to whether the students receive the same education depending on if they are in the first or second section. For example, some teachers mayfeel more fresh, energized, and attentive the first time they teach a lesson. However, theirtiming, organization, and explanations may be improved the second time around. As a specific example of changes from the first to the second class, I will occasionally cancel certain portions of a lesson that went particularly poorly during the first lesson, and this leaves me with 5 or 10 extra minutes at the end of a 95-minute lesson during the second section. Therefore, the second section gets extra activities or speaking practice that the first section does not. Do these minor adjustments add up over the course of a semester and leave a large gap between the quality of education for the students in the first section versus the second?
Induction regimens for ANCA-Associated Vasculitis.

In the 18-month follow-up report of the Rituximab in ANCA-Associated Vasculitis (RAVE) trial, Specks et al. (Aug. 1 issue) 1 reported a noninferiority of intravenous rituximab (375 mg per square meter of body-surface area administered weekly for 4 weeks) as compared with oral cyclophosphamide (taken daily) followed by azathioprine. Complete remission was maintained in 39% of the patients in the rituximab group and in 33% of the patients in the comparison group. As compared with the results of the CYCLOPS trial, the relapse rate in the control group exceeded expectations (20.8% in the CYCLOPS trial vs. 29% in the RAVE trial), although the median follow-up in the CYCLOPS trial was 4.3 years. 1,2 One explanation might be the rigorous tapering of glucocorticoids in the RAVE trial, because early discontinuation of glucocorticoids is one of the most significant risk factors for relapse. 3 These differences were not discussed thoroughly, but clinical trials should address the need to prevent relapses in order to reduce treatment-related adverse events. Repeated administration of rituximab has shown encouraging results. 4 Further trials that are now being conducted will reassess these preliminary data. Nonetheless, the results of the RAVE trial have disproved the hypothesis that prolonged immunosuppressive treatment is absolutely necessary in antineutrophil cytoplasmic antibody (ANCA)–associated vasculitis.
Proxy-Side Web Prefetching Scheme for Efficient Bandwidth Usage: A Probabilistic Method

The expansion of the World Wide Web on internet has emphasize the need for upgrading in user latency. One of the methods that are used for enhancing user latency is Web Prefetching followed by web caching. Web prefetching is one of the methods to condense user’s latencies in the World Wide Web efficiently. User’s accesses makes it possible to predict future accesses based on the previous objects and previous sites. A prefetching engine makes use of these predictions to prefetch the web objects and performed site before the user demands them on the behalf of user. Web prefetching is becoming important and demanding, even though the Web caching system has been recover because of bandwidth usage. Web prefetching is a helpful implement for upgrading the access to the World Wide Web and it also diminish the bandwidth usage at the time. Prefetching can be perform at the client side or at the server side and in this paper we are going through Proxy side web prefetching scheme. We Propose Proxy side web prefetching scheme with probabilistic method which improves cache hit rate with tiny amount of supplementary storage space. Keywords— Improvement of web caching followed by web prefetching, Probabilistic method for web prefetching, Proxy side web prefetching, Web prefetching objects,
Anatomia de raízes de videiras jovens submetidas a doses de cobre e de calcário.

(1) Parte da dissertação de mestrado do segundo autor. Trabalho executado com recursos da Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul (FAPERGS) e do Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq). (2) Professor; Universidade Federal de Santa Maria; Santa Maria, RS; Email: brunetto.gustavo@gmail.com; (3) Estudante de mestrado; Universidade Federal de Santa Catarina; (4) Estudante de mestrado; Universidade Federal de Santa Catarina; (5) Pesquisador; Empresa Brasileira de Pesquisa Agropecuária; (6) Professor; Universidade Federal de Santa Catarina; (7) Professora; Universidade Federal de Santa Maria.
Caracterização da amplificação paramétrica no processo de mistura de quatro ondas na configuração duplo- em vapor de Rubídio

Entanglement is an intrinsically quantum property that can be used in quantum communication protocols, such as quantum cryptography and teleportation. It is a basic piece for quantum information processing, aiming at the implementation of more efficient algorithms than those currently used. These new algorithms are important to attack the so called nonsolvable problems, in which, the processing steps grow exponentially with the size of the input data. On the other hand, the Four Wave Mixing Process in the double- Λ level conﬁguration in Rubidium vapor has been shown to be a robust source of strongly entangled ﬁelds [Boyer et al., 2008b]. In the present work the parametric gain G of the Stokes and anti-Stokes ﬁelds in the 4WM process associated with the D 1 line of Rubidium is characterized. The parameters studied were the detuning ∆ and intensity I B of the pumping ﬁeld and the temperature of the Rubidium cell T Rb. Besides the gain characterization, the electromagnetically induced absorption and the intensities of the conjugated ﬁelds were also studied. Adjustable gains up to 450% were achieved via the tuning of those parameters. The high gains in atomic media allow the generation of entanglement without cavity, and permit multi-mode operation. Therefore, they can be used to carry out ultra-precise measurements and allow the possibility of exploring schemes hitherto unattainable by crystal-based Optical Parametric Oscillators (OPO) (with gains of 4 %). The OPO has been studied in situations above or below the threshold, but in the transition experimental results are rare. The results we obtained were compared with literature, and the next step is to use them in open cavities to construct an OPO that can be easily operated above or below the threshold, and to study the boundary between entangled vacuum and intense beams. In this system, it is expected to be observed non-Gaussian entangled states, and to be able to study its applications in information processing with continuous variables states of light.
A STUDY OF BLIND SOURCE SEPARATION USING NONNEGATIVE MATRIX FACTORIZATION

During the past decades, there are several methods or techniques have been proposed to improve the blind source separation (BSS) in signal processing field. One of the methods has been declared as useful technique which is nonnegative matrix factorization (NMF). Even though NMF has been applied in many fields, few studies are conducted concerning the use of NMF in BSS problems. The problem statement of the research is based on the cocktail party problem which means that the ability to focus one’s listening attention on a single talker among a cacophony of conversations and background noise. Acoustically, in order to solve the cocktail party problem, BSS by using NMF is proposed. This research is presenting a suitable model for signal mixture which accommodated the reverberations and nonlinearity of the signals. Besides that, this research sets out to overcome the estimation of the number of sources in the mixture automatically. A novel techniques using machine learning algorithm which is fast, robust and reliable will be produce in this research based on most recent BSS technology. The objectives are to investigate the useful signal analysis algorithms that has desirable properties unique to single channel blind source separation (SCBSS) problem, to define a new technique of signal separability and analysis of the blind source separation, to design and develop novel methods for SCBSS which addresses the non-stationary, spectral coherence and temporal correlation of the signals, formulation of an iterative learning process, delivery of enhanced accuracy and evidence in the form of comparisons to. This research begins with explanation of BSS, formulation of theory of mixture model and source. It followed by the evaluation of the performance of proposed algorithm. Finally, it ends up with BSS algorithm performance evaluation. The scope is concentrating on acoustic signal processing and NMF method.
Title: Scalable dynamic Web documents with content blind query caching †

Name: Guillaume PierreEmail: gpierre@cs.vu. nlStudent: noIntroductionAn increasing fraction of Web documents is notdelivered from static ﬁles, but generated dynam-ically each time a request is received. Whena request is issued, the Web server invokesapplication-speciﬁc code, which generates thecontent to be delivered to the client. This appli-cation code, in turn, issues queries to a databasewhere the application state is preserved.Many different techniques have been devel-oped to host dynamic documents in a scalablefashion. Fragment caching stores (parts of) thegenerated HTML content at edge servers. How-ever, this technique works well only for applica-tions with few updates and high request locality.Edge-server computing allows each edge serverto execute the application code but maintains thedatabase centralized, which often creates a per-formance bottleneck. More recently, “content-aware” database caching techniques have beenproposed where each edge maintains a partialcopy of the database contents [1]. To make thiswork, sophisticated algorithms are necessary:containment checking to decide if a given querycan be answered from the locally-available data,query rewriting to rewrite the result of a SE-LECT query into INSERT statements to the localdatabase, consistency management to make surethat database updates are reﬂected in the cachesas well, etc.Content-blind query cachingWe defend the position that many applica-tions can beneﬁt from a much simpler cachingtechnique, which we call “content-blind querycaching. ” Unlike its content-aware counterpart,content-blind query caching does not try to builda partial copy of the underlying database. In-stead, it simply caches the results of databasequeries independently from each other. This ap-proach has a number of advantages: (i) it is notnecessary to run a database at the edge servers,as query results can be stored as regular ﬁles (orkept in memory); (ii) query containment checkscan be avoided as a simple table lookup is neces-sary to check whether a query result is already incache; (iii) standard cache replacement policiescan be applied to control the cache’s resource us-age; (iv) consistency maintenance is simpliﬁedas each cached query result is uniquely associ-ated to a particular query, and can be invalidatedwhen a conﬂicting update is issued in the system.Content-blind query caching also has a fewdrawbacks: storing query results independently
Multi-Sensor Data Fusion with MATLAB®

Using MATLAB examples wherever possible, Multi-Sensor Data Fusion with MATLAB explores the three levels of multi-sensor data fusion (MSDF): kinematic-level fusion, including the theory of DF; fuzzy logic and decision fusion; and pixel- and feature-level image fusion. The authors elucidate DF strategies, algorithms, and performance evaluation mainly for aerospace applications, although the methods can also be applied to systems in other areas, such as biomedicine, military defense, and environmental engineering. After presenting several useful strategies and algorithms for DF and tracking performance, the book evaluates DF algorithms, software, and systems. It next covers fuzzy logic, fuzzy sets and their properties, fuzzy logic operators, fuzzy propositions/rule-based systems, an inference engine, and defuzzification methods. It develops a new MATLAB graphical user interface for evaluating fuzzy implication functions, before using fuzzy logic to estimate the unknown states of a dynamic system by processing sensor data. The book then employs principal component analysis, spatial frequency, and wavelet-based image fusion algorithms for the fusion of image data from sensors. It also presents procedures for combing tracks obtained from imaging sensor and ground-based radar. The final chapters discuss how DF is applied to mobile intelligent autonomous systems and intelligent monitoring systems. Fusing sensors data can lead to numerous benefits in a systems performance. Through real-world examples and the evaluation of algorithmic results, this detailed book provides an understanding of MSDF concepts and methods from a practical point of view. Select MATLAB programs are available for download on www.crcpress. com
The Top Ten Algorithms in Data Mining

Identifying some of the most influential algorithms that are widely used in the data mining community, this volume provides a description of each algorithm, discusses the impact of the algorithms, and reviews current and future research on the algorithms. Thoroughly evaluated by independent reviewers, each chapter focuses on a particular algorithm and is written by either the original authors of the algorithm or world-class researchers who have extensively studied the respective algorithm. The book concentrates on the following important algorithms: C4.5, k-Means, SVM, Apriori, EM, PageRank, AdaBoost, kNN, Naive Bayes, and CART.
The Structures of Discourse Structure.

Abstract : This paper reports on the development of a computational theory of discourse structure. The theory is based on the thesis that discourse structure is a composite of three structures: the structure of the sequence of utterances, the structure of intentions conveyed, and the attentional state. The distinction among these components is essential to provide adequate explanations of such discourse phenomena as clue words, referring expressions and interruptions. The authors illustrate the application of this theory to such phenomena and discuss the recognition of intentions in discourse. Keywords: Natural language processing; Artificial intelligence; Linguistics; Speech. (Author)
Predicting accentedness: Acoustic measurements of chinese-accented english

Listeners perceive foreign-accented speech as different from native speech because it deviates from native speaker acoustic targets. These deviations may occur across many acoustic dimensions such as word duration, vowel duration, vowel formant values, and voice onset time. Accentedness ratings were modeled using ordinary least squares linear regression performed in R using the rms package. Prior to analysis, formant values were log transformed and plotted revealing considerable variation in vowel space. The vowel-to-word ratio was calculated by dividing the vowel duration of a word by the total duration of that word. If accentedness is a result of non-native productions approaching to varying degrees native-like acoustic targets, quantifying the distance from the native speaker norm allows examination of how variation along different variables affects perceived accentedness.
BLF: an efficient flash translation layer scheme for flash-based storage systems

The performance of flash memory is limited by its “erase-before-write,” and erase operations can only be performed in a much larger unit than write operations. To address these problems, we propose an efficient flash translation layer scheme called BLF: Block List Flash Translation Layer. BLF unites log blocks and physical blocks for servicing update requests. It can avoid uneven erasing and low block utilization. The address translation table of BLF can avoid storing an extra internal mapping table. BLF’s garbage collection method divides the storage zone into three levels: the active zone where hot data are stored, the inactive zone where cold data are stored, and the transitional zone where reclamation block is stored. If invalid blocks can be reclaimed properly and intensively, merging log blocks with physical blocks can be avoided and the amount of operations can be reduced. Finally, we implement an accurate flash simulator to evaluate the efficacy of BLF and compare it with other flash schemes, demonstrating that the improved performance resulting from BLF substantially outperforms other flash schemes.
Programming Language Pragmatics, Third Edition

As a textbook suitable for the classroom or self-study, Michael Scott's Programming Language Pragmatics provides a worthy tour of the theory and practice of how programming languages are run on today's computers. Clearly organized and filled with a wide-ranging perspective on over 40 different languages, this book will be appreciated for its depth and breadth of coverage on an essential topic in computer science. With references to dozens of programming languages, from Ada to Turing and everything in between (including C, C++, Java, and Perl), this book is a truly in-depth guide to how code is compiled (or interpreted) and executed on computer hardware. Early chapters tend to be slightly more theoretical (with coverage of regular expressions and context-free grammars) and will be most valuable to the computer science student, but much of this book is accessible to anyone seeking to widen their knowledge (especially since recent standards surrounding XML make use of some of the same vocabulary presented here). The book has a comprehensive discussion of compilation and linking, as well as how data types are implemented in memory. Sections on functional and logical programming (illustrated with Scheme and Prolog, which are often used in AI research) can expand your understanding of how programming languages work. Final sections on the advantages--and complexities--of concurrent processing, plus a nice treatment of code optimization techniques, round out the text here. Each chapter provides numerous exercises, so you can try out the ideas on your own. Students will benefit from the practical examples here, drawn from a wide range of languages. If you are a self-taught developer, the very approachable tutorial can give you perspective on the formal definitions of many computer languages, which can help you master new ones more effectively. --Richard Dragan Topics covered: A survey of today's programming languages, compilation vs. interpretation, the compilation process, regular expression and context-free grammars, scanners and parsers, names, scopes and bindings, scope rules, overloading, semantic analysis, introduction to computer architecture, representing data, instruction sets, 680x0 and MIPs architectures, control flow and expression evaluation, iteration and recursion, data types, type checking, records, arrays, strings, sets, pointers, lists, file I/O, subroutines, calling sequences and parameter passing, exception handling, coroutines, compile back-end processing, code generation, linking, object-oriented programming basics, encapsulation and inheritance, late binding, multiple inheritance, functional and logical languages, Scheme and Prolog, programming with concurrency, shared memory and message passing, and code optimization techniques.
Qualitative examination of satisfaction with three Expert System interventions to reduce cancer

Expert Systems are computerized population programs that can provide tailored interventions for behavior changes. These systems have been used in various population samples throughout the United States, however, no one has qualitatively examined the experiences of participants. In this research, participants had three cancer risks (i.e. poor diet, sedentary lifestyle and smoking) and were provided interventions in one of three types of Expert Systems (i.e. Telecommunications , Modular or Integrated). The experiences and satisfaction of 56 participants across the United States using these Expert Systems were examined, with special attention given to demographic differences. Qualitative methodologies were employed to design and administer structured telephone interviews. Data were transcribed and analyzed using the qualitative management program, NVivo 7 and complimentary quantitative data were analyzed using SPSS. Eight themes were drawn from the data representing participants' experiences including: Reasons to Participate , Expectations, Likes, Style, Reaction to Feedback, Trust, Satisfaction and Suggestions. While participant data revealed pros and cons of participating in each Expert System, the Integrated group displayed greater levels of behavior change and higher rates of satisfaction. This information not only provides evidence of the positive experiences of participants in the Integrated Expert System, but helpful suggestions in making the other Systems more appealing to future participants. It is hoped these data and interpretations will be valued and utilized for improving Expert systems for behavior change in the future. Acknowledgements I would to acknowledge the significant support provided for this research by the National Cancer Institutes' (NCI) Research Supplements for Underrepresented Minorities (PA-01-079). I would also like to acknowledge the support of Wayne F. Velicer, Ph.D. for providing numerous opportunities to pursue my research interests; Mark L. Robbins, Ph.D. , my major professor for his mentorship in my academic and career developments; Ginette G. Ferszt , Ph.D. for her guidance in qualitative methods and the Cancer Prevention Research Centers' Survey Center staff for their accommodations in this research. Finally , I would to acknowledge the unconditional support of my family and dedicated colleagues throughout this journey.