Miracle-dz/UniFAR-FTUs huggingface dataset:
Stem Cell Therapy in Multiple Myeloma

Multiple myeloma is a haematogical malignancy caused by abnormality of plasma cells characterized by (a) hypercalcemia, (b) renal insufficiency or failure, (c)bone pain and abnormal bone radiographs, (d) anemia and (e) a monoclonal protein in urine or serum or both. It begins in the form known as monoclonal gammopathy of undetermined significance (MGUS) and progresses to asymptomatic myeloma and then lastly to symptomatic myeloma. The three main domains in the understanding of Pathophysiology are cytokines and cell signaling, bone Marrow Microenvironment and cell Cycle. Bifunctional alkylating agents like Melphalan and cyclophosphamide are considered as standard therapy for multiple myeloma. Patients who are chosen for stem cell transplantation can be treated with Lenalidomide, an immunomodulatory agent and an aminosustituted variant of Thalidomide. It is given along with dexamethas one. In stem cell therapy, the patients receive stem cells intravenously similar to the blood transfusion and this phase takes 1-5 hours. After entering the blood stream through a process called engraftment, the stem cell produce new WBCs, RBCs and platelets. The immune rejection of donor cells by the host immune system is a major drawback of transplantation. Stem cell therapy in multiple myeloma is very effective and should be opted as one among the best for both older patients and patients younger than 65 years.
Post Emil L.. Formal reductions of the general combinatorial decision problem. American journal of mathematics, vol. 65 (1943), pp. 197–215.

theory of necessary and sufficient conditions in terms of symbolic outlined. Some theorems the interrelatedness of multiple and complex conditions (cases known from classical treatments of the subject as plurality and com plexity of "causes") are deduced. The postulate of universal causation underlying the various attempts at a logic of induction is given alternative formulations in terms of necessary and sufficient conditions. The formalism developed is then applied to an analysis of so-called induction by elimination, resulting in an extension and generalization of the inductive theories of Nicod and Keynes. Two methods, corresponding roughly to Mill's methods of Agreement and Difference respectively, are shown to be constitutive of the eliminative mechanism—the former for selection among possible necessary conditions, the latter for selection among possible sufficient conditions of a given property. On account of the equiva lence between the expressions P —> Q and ~Q —* ~ P, ~ ( Pv Q) and ~P & ~ Q, ~ (P & Q) and ~P v ~ Q, the Method of Agreement is indirectly applicable also for selection among possible sufficient conditions and the Method of Difference for selection among possible neces sary conditions. Finally, a joint use of the two methods is possible. The use of the methods and their relative value for the purpose of elimination is illustrated by examples.
C programming guide

This product or document is distributed under licenses restricting its use, copying, distribution, and decompilation. No part of this product or document may be reproduced in any form by any means without prior written authorization of Sun and its licensors, if any. Third-party software, including font technology, is copyrighted and licensed from Sun suppliers. Parts of the product may be derived from Berkeley BSD systems, licensed from the University of California. UNIX is a registered trademark in the U. for its users and licensees. Sun acknowledges the pioneering efforts of Xerox in researching and developing the concept of visual or graphical user interfaces for the computer industry. Sun holds a non-exclusive license from Xerox to the Xerox Graphical User Interface, which license also covers Sun's licensees who implement OPEN LOOK GUIs and otherwise comply with Sun's written license agreements. Sun f90/f95 is derived from Cray CF90™, a product of Silicon Graphics, Inc.
Participation in Online Problem‐based Learning: Insights from postgraduate teachers studying through open and distance education

This article reports on work undertaken within Phase 2 of a pilot study concerned with the design, development, and evaluation of online resources. Drawing on recent developments in the application of technology within open and distance education, these resources were structured around the principles of problem‐based learning (PBL) for use with postgraduate teachers. The article explores the responses of one cohort of students studying on a programme for teachers of children with visual impairment, to learning through the use of these resources. In line with recent literature in this area, the findings demonstrate that with the appropriate design and use of technology, PBL, traditionally viewed as a campus‐based approach, can be adapted for use with students in higher education studying through open and distance education. The findings highlight a number of potential barriers to learning and participation that can serve to reduce effective participation in the online PBL activities. Future planned research by the authors will explore the extent to which each of these barriers can be reduced through appropriate planning and design, and provisional recommendations are included to assist in this process.
Robust degraded face recognition with novel face representation and multiscale fusion

Abstract. Recognizing degraded faces from low-resolution and blurry images is a common yet challenging task. We propose appealing solutions to this problem without any image reconstruction, without any limitation to blur type, and only using high-quality samples to design a classifier. Short-term Fourier transform (STFT) is an effective and concise transform for face recognition, yet its effectiveness depends on two important issues: one is face representation construction from STFT; the other is a scale-named window size of STFT. To deal with the first issue, we explore the increased discrimination brought by joint coding and using multiple frequency combinations. Specifically, we propose a novel local descriptor in which information of a pixel coming from two frequencies is jointly encoded and multiple two-frequency combinations are jointly utilized so as to construct a more descriptive and discriminative face representation. To deal with the second issue, we propose a multiscale fusion strategy that extracts multiple descriptors corresponding with multiple window sizes of STFT followed by equal weighted summation of outputs given by multiple scales. The experiments conducted on face databases confirm that state-of-the-art performance has been achieved by the proposed novel face representation and multiscale fusion strategy.
Improving information flow control design with security contexts

This thesis outlines a new language feature for Ruby: the security context, which enables complex information flow control schemes to be written in Ruby without modification to the virtual machine. Security contexts are Ruby objects that act as transparent proxies and can be attached to other objects, allowing them to seamlessly modify parameters and return values into and out of those objects’ methods. Security contexts are demonstrated to be simple and effective in creating two flow control applications that would otherwise pose significant challenge to build: taint tracking as a Ruby library, and data flow assertions for Ruby on Rails applications. The performance of these systems was benchmarked while running as a part of a Rails application, and reached acceptable performance: taint tracking had no impact on performance, and data flow assertions saw a 50% throughput decrease, while providing considerable protection against privacy leaks and security vulnerabilities. Thesis Supervisor: Srini Devadas Title: Professor
Ontology Evaluation – Comprising Verification and Validation

As ontologies became widely used methodology for knowledge representation, as well as foundation for Semantic Web, a question of their evaluation increased even more. Various methods and techniques for ontology evaluation have been already proposed, some concerned with their taxonomy and others with their content. In this paper several ontology evaluation methods are used together with purpose of showing how both important parts of evaluation, verification and validation, can be comprised. The usage of multiple independent evaluation methods ensures development of a consistent and usable ontology.
Scientific Opinion on the safety and efficacy of copper compounds (E4) as feed additives for all animal species: cupric sulphate pentahydrate based on a dossier submitted by Manica S.p.A.

Copper sulphate pentahydrate is safe for all animal species up to the maximum total copper content authorised in feed. No concerns for consumer safety are expected from the use of the feed additive. The maximum residue limits (MRLs) for copper in foods of animal origin established by European Union pesticides legislation are not consistent with legal practices in animal nutrition. As copper is an essential micronutrient, the FEEDAP Panel is not in favour of establishing MRLs for animal products, unless there is a clear consumer safety issue; if MRLs are to be maintained, the Panel has proposed amended values. The additive is an eye irritant and may induce allergic dermatitis in sensitive persons which might be exacerbated by the contamination with nickel. Users may be exposed to hazardous copper concentrations by inhalation. Potential risks to soil organisms have been identified after the application of piglet manure; there might be a potential concern related to sediment contamination. Drawing final conclusions would need further model validation and refinement to the assessment of copper-based additives in livestock. The use of copper compounds in aquaculture is not expected to pose a risk. The limited database available on the influence of copper to the development of antibiotic resistance in gut and soil bacteria indicates that high copper concentrations in the microbial environment increase the number of copper-resistant bacteria, and copper resistance seems to be correlated with more frequent resistance to several antibiotics in certain bacterial species. A potential copper threshold concentration could not be derived. The total pool of macrolide resistance in animals probably originates from antibiotic treatment and not from the use of high dietary copper. The extent to which copper-resistant bacteria contribute to the overall antibiotic resistance can not be quantified at present. Copper sulphate pentahydrate is efficacious in meeting animal requirements.
Recognition of handwritten Kannada characters using hybrid features

The challenging task in the field of Document Image Analysis is automatic recognition of handwritten characters present in a scanned document. The recognition of characters in a document is achieved by Optical Character Recognition (OCR) system. In this paper, a hybrid feature extraction technique is proposed for recognizing handwritten Kannada characters. The proposed technique uses the local and global features as hybrid features. These features are extracted from each input image. 3600 samples are used as training data set to obtain consistent feature values. K-nearest neighbor classifier is used to classify the characters based on the feature values. The proposed method is tested on a dataset of 1200 samples and at present it shows an overall accuracy of 87.33%.
Manufacture-in-motion by new concept of dextrous manufacturing hand

The new design of manufacturing hand has layout of fingers different from conventional robotic hands reported in literature. After an overview of different robot assisted manufacturing cell layouts, this paper compares them based on cycle time of production. The computations are conducted on a case study involving automation of wire harnessing process. It is found that the new concept of dextrous manufacturing hand yields minimum cycle time through minimum critical path of motion, and manufacture-in-motion by partial overlap of processing operations over material transfer motions.
Relevance-based language models: new estimations and applications

Relevance-Based Language Models introduced in the Language Modelling framework the concept of relevance, which is explicit in other retrieval models such as the Probabilistic models. Relevance Models have been mainly used for a specific task within Information Retrieval called Pseudo-Relevance Feedback, a kind of local query expansion technique where relevance is assumed over a top of documents from the initial retrieval and where those documents are used to select expansion terms for the original query and produce a, hopefully more effective, second retrieval. In this thesis we investigate some new estimations for Relevance Models for both Pseudo-Relevance Feedback and other tasks beyond retrieval, particularly, constrained text clustering and item recommendation in Recommender Systems. We study the benefits of our proposals for those tasks in comparison with existing estimations. This new modellings are able not only to improve the effectiveness of the existing estimations and methods but also to outperform their robustness, a critical factor when dealing with Pseudo-Relevance Feedback methods. These objectives are pursued by different means: promoting divergent terms in the estimation of the Relevance Models, presenting new cluster-based retrieval models, introducing new methods for automatically determine the size of the pseudo-relevant set on a query-basis, and originally producing new modellings under the Relevance-Based Language Modelling framework for the constrained text clustering and the item recommendation problems.
Interactive Visualizations of Natural Language

While linguistic skill is a hallmark of humanity, the increasing volume of linguistic data each of us faces is causing individual and societal problems — ‘information overload’ is a commonly discussed condition. Tasks such as finding the most appropriate information online, understanding the contents of a personal email repository, and translating documents from another language are now commonplace. These tasks need not cause stress and feelings of overload: the human intellectual capacity is not the problem. Rather, the computational interfaces to linguistic data are problematic — there exists a Linguistic Visualization Divide in the current state-of-the-art. Through five design studies, this dissertation combines sophisticated natural language processing algorithms with information visualization techniques grounded in evidence of human visuospatial capabilities. The first design study, Uncertainty Lattices, augments real-time computer-mediated communication, such as cross-language instant messaging chat and automatic speech recognition. By providing explicit indications of algorithmic confidence, the visualization enables informed decisions about the quality of computational outputs. Two design studies explore the space of content analysis. DocuBurst is an interactive visualization of document content, which spatially organizes words using an expert-created ontology. Broadening from single documents to document collections, Parallel Tag Clouds combine keyword extraction and coordinated visualizations to provide comparative overviews across subsets of a faceted text corpus. Finally, two studies address visualization for natural language processing research. The Bubble Sets visualization draws secondary set relations around arbitrary collections of items, such as a linguistic parse tree. From this design study we propose a theory of spatial rights to consider when assigning visual encodings to data. Expanding considerations of spatial rights, we present a formalism to organize the variety of approaches to coordinated and linked visualization, and introduce VisLink, a new method to relate and explore multiple 2d visualizations in 3d space. Inter-visualization connections allow for cross-visualization queries and support high level comparison between visualizations. From the design studies we distill challenges common to visualizing language data, including maintaining legibility, supporting detailed reading, addressing data scale challenges, and managing problems arising from semantic ambiguity.
On Refactoring for Open Source Java Program

Software maintenance is the most expensive activity in software development process. It have been reported that many software companies spent a large amount of cost to maintain the existing systems. Refactoring is an effective technique to conduct the perfective maintenance. It is defined as “the process of changing a software system in such a way that it does not alter the external behavior of the code yet improves its internal structure. ” Code clone makes software maintenance difficult and so is called a typical ‘badsmell’. A code clone is a code fragment in a source code that is identical or similar to another. In an actual software development process, code clones are introduced because of various reasons such as reusing code by ‘copyand-paste’ and so on. This paper describes the application of the refactoring to an open source Java program, ANTLR, using a code clone analysis. First, we extract some code clones from the source code with a code clone detection tool. Second, we identify some code clones that some refactoring patterns could be applied to. Finally, we apply the refactoring patterns to the code clones and rewrite the code. The result shows that the applied two refactoring patterns “Extract Method” and “Pull Up Method” reduce the code size by 1000LOC. Also we confirm that the behavior of the ANTLR after the refactoring is the same as before.
Steady-state analysis of nonlinear circuits with periodic inputs

In the computer-aided analysis of nonlinear circuits with periodic inputs and a stable periodic response the steady-state periodic response is found for a given initial state by simply integrating the system equations until the response becomes periodic. In lightly damped systems this integration could extend over many periods making the computation costly. In this paper a Newton algorithm is defined which converges to the steady-state response rapidly. The algorithm is applied to several nonlinear circuits. The results show a considerable reduction in the amount of time necessary to compute the steady-state response. In addition, the initial iterates give information on the transient response of the system.
Automatic gender identification optimised for language independence

In this paper 63 automatic gender identification (AGI) systems based on the fusion of multiple knowledge sources using a linear classifier (LC) are tested on speakers of 11 languages present in the OGI speech corpus. It is found that training the LC with multiple languages can improve the accuracy of the AGI system.
Investigation of Tumor Necrosis Factor-Alpha (TNF A) Gene Polymorphism in Patients with Hypertension in Al-Diwaniyah City, Iraq

A study was conducted on 100 in the outpatient whom consulted Al-Diwaniyah Teaching Hospital in Al-Diwaniyah City in the period between October 2017 to April 2018.One hundred blood samples (50 experimental and 50 controls) were collected under the supervision of the treating physician . TNF-α, which is an abbreviation of “tumor necrosis factor alpha”, is one of the key distinctive pro-inflammatory cytokines emerging evidence have confirmed the vital role of TNF-α in the progress of hypertension. The genotyping regarding (TNF a) were carried out through utilizing polymerase chain reaction, commonly denoted as (PCR), along with (RFLP), which is an abbreviation of “restriction fragment length polymorphism”. We aimed at determined vital variations within the genotype frequencies of (TNF a) among control and experimental sample groups. Keywords: Hypertension, RFLP, TNF A, SNPs. Polymorphisms, Diwaniyah, Iraq
Quantum computing Hamiltonian cycles

An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths initiating from a chosen vertex, and furthermore to subsequently project out all states not corresponding to Hamiltonian cycles.
Automated Absolute Phase Retrieval in Across-Track Interferometry

Discussed is a key element in the processing of topographic radar maps acquired by the NASA/JPL airborne synthetic aperture radar configured as an across-track interferometer (TOPSAR). TOPSAR utilizes a single transmit and two receive antennas; the three-dimensional target location is determined by triangulation based on a known baseline and two measured slant ranges. The slant range difference is determined very accurately from the phase difference between the signals received by the two antennas. This phase is measured modulo 2pi, whereas it is the absolute phase which relates directly to the difference in slant range. It is shown that splitting the range bandwidth into two subbands in the processor and processing each individually allows for the absolute phase. The underlying principles and system errors which must be considered are discussed, together with the implementation and results from processing data acquired during the summer of 1991.
Accounting for Stability of Retrieval Algorithms using Risk-Reward Curves

Past evaluation of information retrieval algorithms has focused largely on achieving good average performance, without much regard for the stability or variance of retrieval results across queries. In fact, two algorithms that superficially appear to have equally desirable average precision performance can have very different stability or risk profiles. A prime example comes from query expansion, where current techniques typically give good average improvements in mean average precision, but are also unstable and have high variance across individual queries [3]. We propose the use of risk-reward curves and related statistics to characterize the tradeoff an algorithm exhibits between a reward property such as mean average precision and a risk property such as the variance of the algorithm – particularly the downside variance, when the algorithm fails or makes performance worse. Such evaluation methods are broadly applicable beyond query expansion to other retrieval operations that must balance risk and reward, such as personalization, document ranking, resource selection, and others.
Exploring 3D Shortest Distance using A * algorithm in Unity3D

In a 3D game environment, pathfinding or graph traversal is performed using the A * algorithm with 2D layers. However, in a 3D virtual environment or space, A * Algorithm that uses 2D layers is limited. Therefore, it is necessary to use an algorithm that uses 3D layers in a 3D game environment. This study shows that a 3D A * Algorithm may configure the path between two nodes faster than an A * Algorithm that uses 2D layers in a 3D game environment.