Miracle-dz/UniFAR-FTUs huggingface dataset:
Towards the rapid network-wide deployment of new application specific network protocols, using application level active networking

In this thesis I try to show that traditional transport protocols (such as TCP) poorly match the requirements of today's applications. Firstly, I develop two new user level protocols using Application Layer Framing (ALF) [20] concepts in order to test this hypothesis. A simple remote login program and a protocol to deliver mailing lists using multicast. In both cases I am able to show that application level protocols utilise less network resources than their traditional counterparts as well as providing improved responsiveness to the user. The development and deployment of new protocols is both difficult and time consuming. I consider a new mechanism for the deployment of protocols. Rather than attempting to deploy them in the end systems, new protocols entities are dynamically deployed into the network. These protocol entities are called proxylets and are written in the programming language Java. A whole infrastructure funnelWeb, [34], has been built to allow the deployment of proxylets. A number of diverse applications are then built around proxylets to show benefits which can be derived from such a scheme. In order to make the funnelWeb infrastructure useful, when globally deployed, a routing infrastructure is designed and partially built.
A Study of Authorship Attribution in English and Tamil Emails

The aim of our study is to identify author of unknown emails of Tamil and English. The recent approaches in Authorship Attribution show that apart from lexical measures some other features of written language are considerably effective as discriminators of author style. However, there have been no attempts to compare the attribution potential of these features. The aim of the present study, then, has to examine the effectiveness of several styles-markers in authorship attribution between the following two languages, English and Tamil equally important, however, we have to compare the usefulness of the chosen style-markers across a two languages the results proved high attribution effectiveness can be achieved in both the language.
A Framework for Ranking and KNN Queries in a Probabilistic Skyline Model

Skyline computation has gained a lot of attention in recent years. According to the definition of skyline, objects that belong to skyline cannot be ranked among themselves because they are incomparable. This constraint limits the application of skyline. Fortunately, due to the recently proposed probabilistic skyline model, skyline objects which contain multiple elements, can now be compared with each others. Different from the traditional skyline model where each object can either be a skyline object or not, in the probabilistic skyline model, each object is assigned a skyline probability to denote its likelihood of being a skyline object. Under this model, two simple but important questions will naturally be asked: (1) Given an object, which of the objects are the K nearest neighbors to it based on their skyline probabilities? (2) Given an object, what is the ranking of the objects which have skyline probabilities greater than the given object? To the best of our knowledge, no existing work can effectively answer these two questions. Yet, answering them is not trivial. For a medium-size dataset (e.g. 10,000 objects), it may take more than an hour to compute the skyline probabilities of all objects. In this paper, we propose a novel framework to answering the above two questions on the fly efficiently. Our proposed work is based on the idea of bounding-pruning-refining strategy. We first compute the skyline probabilities of the target object and all its elements. For the rest of the objects, instead of computing their accurate skyline probabilities, we compute the upper bound and lower bound skyline probabilities using the elements of the target object. Based on lower bound and upper bound of their skyline probabilities, some objects, which cannot be in the result, will be pruned. For those objects, which we are unknown whether they are in the results or not, we need to refine their bounds. The refinement strategy is based on the idea of space partition. Specifically, we first partition the whole dataspace into several subspaces based on the distribution of elements in the target object. When we iteratively do the the refinement of the bounds, we will do the partitioning strategy in each subspace. In order to implement this framework, a novel tree, called Space Partition Tree (SPTree) is proposed to index the objects and their elements. We evaluate our proposed work using three synthetic datasets and one real-life dataset. We report all our findings in this paper.
Pain Patterns and a novel way of evaluation of therapy outcome in myogenous temporomandibular disorders

A within-patient change in pain score after treatment is statistically ‘reliable’ when it exceeds the smallest detectable difference (SDD). The aims of the present study were to: (i) determine SDDs for VAS-scores of pain intensity, for sufficiently long test–retest intervals to include most biological fluctuations, (ii) examine whether SDD is invariant to baseline score, and (iii) discuss the value of reliable change (RC) for detecting clinically important difference (CID) or as a possible indicator of successful treatment. SDDs were determined using duplicate data from 118 patients with myogenous Temporomandibular disorders: (1) VAS-scores of pain intensity from the masticatory system in a pre-treatment diary, and (2) VAS-scores of pain intensity from the hand (cold-pressor test). RC was determined in VAS-scores from a preand post-treatment questionnaire. The long-term SDD was 49 mm. A regression analysis on duplicate VAS-scores showed that SDD was largely invariant to the baseline level. Because RC (change > SDD) exceeded CID, it might serve as an indicator of successful treatment. However, only 17% of the patients showed RC after treatment, mainly because the baseline was smaller than SDD in 67% of the patients thus making detection of any treatment effect impossible. For patients with possible detection (33%), the frequency of RC was 51%. If the detection threshold would be avoided by provoking pain in patients with a low baseline, a long-term RC in VAS-scores might occur in about half of all myogenous TMD patients and might then serve as an indicator of cases of treatment success. 2006 European Federation of Chapters of the International Association for the Study of Pain. Published by Elsevier Ltd. All rights reserved.
Modalities of Body Experience in Illness and Health

How do we experience our body in illness or health? This is a question that can easily comprise a book-length study. In this article, a selection of basic distinctions is explored that may be especially appropriate for pursuing this question. Increasingly the health science professional is becoming aware that people require not only health care assistance, surgical treatment, or pharmaceutical treatment, but that the professional be much more involved in the way that people experience and live with their problems in a different, sometimes deeply personal and unique manner. It is argued that nursing especially is involved in helping the patient, the elderly, the disabled, or the person whofor reasons of circumstance is out of step with the body to recover a livable relation with his or her psycho-physical being.
Vers une taxonomie moléculaire des amphipodes du genre Niphargus : exemples d'utilisation de séquences d'ADN pour l'identification des espèces.

La taxonomie actuelle des crustaces amphipodes du genre Niphargus se base exclusivement surl'utilisation de caracteres morphologiques. Cependant, l'analyse de ces caracteres requiert une expertise difficilea acquerir, et dans de nombreux cas les seuls individus qui peuvent etre identifies avec certitude sont les mâlesadultes. L'utilisation de sequences d'ADN permet de pallier ces difficultes et de proposer une identification memepour des individus femelles, juveniles ou degrades. Deux etudes de cas sont presentees ici : dans la premiere, nousidentifions un specimen degrade en provenance de Loire-Atlantique en comparant ses sequences d'ADN avec cellesd'echantillons de reference recoltes a proximite ; dans la seconde, nous analysons une population en provenanced'une grotte allemande (Jettenhohle, dans le sud-ouest du Harz) en comparant son ADN avec les sequences deposeesdans une banque de donnees internationale (GenBank). Presently, the taxonomy of the crustacean amphipod genus Niphargus is based solely on the analysis of morphologicalcharacters. However, using these characters requires an expertise that is difficult to acquire, and in many casesthe only individuals that can be determined with a high level of certainty are adult males. Using DNA sequencesovercomes these difficulties and makes it possible to propose a determination even for female, juvenile or degradedspecimens. Two case studies are presented here: in the first one, a degraded specimen from the West of France isdetermined by comparing its DNA sequences to those of reference samples collected in the same area; in the secondone, a Niphargus population from a cave in Germany (Jettenhohle, in the Southern Harz region) is analyzed bycomparing its DNA sequences to those deposited in a public database (GenBank).
CCP 4 SOFTWARE SUITE : HISTORY , EVOLUTION , CONTENT , CHALLENGES AND FUTURE DEVELOPMENTS

Collaborative Computational Project Number 4 (CCP4) in Protein Crystallography is a public resource for producing and supporting a world-leading, integrated Suite of programs that allows researchers to determine macromolecular structures by X-ray crystallography, and other biophysical techniques. CCP4 supports the widest possible researcher community, embracing academic, not for profit, and for profit research. The primary aims of CCP4 include development and support of the development of cutting edge approaches to experimental determination and analysis of protein structure, with integration of them into the suite for worldwide dissemination. In addition, CCP4 plays an important role in the education and training of scientists in experimental structural biology. In this paper, we overview CCP4’s 35year long history and (technical) milestones of its evolution. We will also consider how a particular structure of CCP4 Suite and Collaboration has emerged, its main functionality, current state and plans for future.
Visualizing photodynamic therapy response with time-lapse OCT in an in vitro model of metastatic ovarian cancer

Ovarian epithelial cancer has a high morbidity due to its propensity to metastasize onto surfaces in the abdomen. In order to effectively treat these metastatic lesions with photodynamic therapy (PDT), it is critical to understand the detailed dynamics of the PDT response. 3D in vitro models of ovarian cancer are a promising system for studying the response to PDT of these lesions, as they replicate the size, appearance, and characteristics of metastatic disease observed in the clinic. An ideal approach capable of non-purturbative, 3D imaging of this model is optical coherence tomography (OCT). An ultrahigh resolution time-lapse OCT (TL-OCT) system was used to visualize the photodynamic therapeutic response in the hours and days following treatment. Tumor nodules were observed to experience rapid cell death within the first 24 hours post-treatment using benzophorphyrin derivative monoacid A (BPD), characterized by structural breakdown of the model nodules. Highly scattering bodies were observed with OCT contrast to form at the periphery of the tumor nodules. These highly scattering moieties were identified as apoptotic bodies, indicating that OCT is capable of tracking the PDT-induced apoptosis in real-time without the need for labels.
A fuzzy stop criterion for genetic algorithms using performance estimation

This article presents a new approach for analyzing the solution performance of genetic algorithms (GAs). An adaptive filtering algorithm is combined with a predicting algorithm and memory data from previous GA iterations to estimate the value of the GA's "optimal" solution. If the current GA iteration value is above a certain user-defined acceptance level, the iteration process is stopped and the GA calculates a belief and uncertainty estimations of the found solution. Results indicate this new approach is preferable to the traditional GA iteration approach, in terms of cost/performance and in decreasing the amount of time the GA searches for acceptable solutions. <<ETX>>
ESTABLISHMENT OF SEROLOGICAL REFERENCE RANGES FOR ELK IN KENTUCKY AND EFFECTS OF QUARANTINE AND TRANSLOCATION ON ELK

OF THESIS ESTABLISHMENT OF SEROLOGICAL REFERENCE RANGES FOR ELK IN KENTUCKY AND EFFECTS OF QUARANTINE AND TRANSLOCATION ON ELK Establishing blood serum profiles is important for understanding animal disease ecology and nutrition, the effects of capture and immobilization, and general physiological variation among individuals and populations. Elk (Cervus elaphus nelsoni) have been successfully translocated to several states for reintroduction or population augmentation, including most recently in Kentucky, where over the course of three years (2011-13) wild elk were captured, temporarily quarantined, and subsequently moved to Missouri and Virginia to establish populations in those states. I used this opportunity to collect a variety of biological samples, including blood from which I present and compare serological profiles for a variety of elk age and sex classes. Additionally, I took the opportunity to investigate the effects of the translocation process on some morphological and physiological parameters of elk. Quarantine and processing of elk can be stressful for animals and lead to injury or death. I characterized how elk respond to this process by measuring biochemical serum values along with various physiological parameters at 5 handling events from the time of capture until final transport to recipient states. Changes observed in parameters between paired workups were indicative of the physical exertion and stress associated with handling activities.
Reducing the Risks of the Wildlife Trade by K .

Like Broken Screens, the first half of Smith et al. is an anecdotal narrative based on data chosen to support a foregone conclusion --it is a review of import data with comments based on selectively chosen negatives. The authors use the Law Enforcement Management Information System (LEMIS) with no mention of criticism (e.g., Reaser and Waugh, 2007) that data from LEMIS may be inadequate for this type of report.
Data Mining to Identify Learning Groups with Difficulties in Programming Education

The difficulties encountered by students in the teaching and learning of programming has been the focus of much research. Among the proposals discussed to improve this situation called for the use of differentiated instruction, personalized, since it is considered that the classrooms are composed of heterogeneous students with different ways of learning and who have needs and learning preferences private. However, the customization of teaching in classroom mode is difficult to be made by the teacher. But the personalized attention to homogeneous groups of learners is a possibility to be considered. From this perspective, this article aims to describe an experience with the use of techniques of data mining along with a taxonomy of educational objectives, Bloom's Taxonomy, to identify similar groups of learners with learning difficulties in programming teaching with data obtained through assessments. With this, we hope to contribute to the construction of appropriate teaching strategies to student groups with the purpose of improving the learning process on the part of these students.
Théorie d'un muscle artificiel pneumatique et application à la modélisation du muscle artificiel de McKibben

La theorie d'un muscle artificiel cylindrique pneumatique ideal generant une force de contraction axiale est exposee, et appliquee a l'explication du fonctionnement du muscle artificiel de McKibben, actionneur pneumatique original capable de produire une force de contraction presentant une analogie avec celle produite par un muscle du squelette et dont la valeur par rapport au poids propre de l'actionneur est tris elevee en comparaison avec les actionneurs classiques
The Marginal Sealing of Class II Composite Resin Restoration Located in Cementum – in Vitro Evaluation

Background. a learning style or learning preference is the complex manner in which learners most efficiently gain the knowledge, process and store and recall what they learn. Many questionnaires estimating the learning styles have been worked out, and among them VarK questionnaire is often applied. Objectives. The aim of the study was to evaluate the learning styles of dental students. Material and Methods. 78 dental students were involved in the study. all students filled in the polish version of VarK questionnaire anonymously and the data were evaluated with use of available on-line the VarK questionnaire. Results. less than half of the subjects showed the unimodal learning style (36/78, 46.2%) and the remaining ones pointed at multimodal, out of which the most often tri-modal (17/78, 21.8%) and next quad-modal (14/78, 17.9% and bi-modal (11/78, 14.1%). among the unimodal learning styles the most often (14/78, 18.0%) and the most seldom was the read/write (1/78, 1.3%) type. There were not statistically significant differences between frequency of unimodal and multimodal learning styles, kinesthetic way as well as between the particular types of multimodal ones. Conclusion. evaluation of learning styles with use of the VarK questionnaire is the useful tool for the analysis of knowledge gathered by the students and the obtained data can be used by academic teacher in education process (Dent. Med. Probl. 2010, 47, 2, 193–198).
Bounds on the Entropy of a Binary System with Known Mean and Pairwise Constraints

Author(s): Albanna, Badr Faisal | Advisor(s): DeWeese, Michael R | Abstract: Maximum entropy models are increasingly being used to describe the collective activity of neural populations with measured mean neural activities and pairwise correlations, but the full space of probability distributions consistent with these constraints has not been explored. In this dissertation, I provide lower and upper bounds on the entropy for both the minimum and maximum entropy distributions over binary units with any fixed set of mean values and pairwise correlations, and we construct distributions for several relevant cases. Surprisingly, the minimum entropy solution has entropy scaling logarithmically with system size, unlike the possible linear behavior of the maximum entropy solution, for any set of first- and second-order statistics consistent with arbitrarily large systems.I find the following bounds on the maximum and minimum entropies for fixed values of $\{\mu_i\}$ and $\{\nu_{ij}\}$. For the \emph{maximum entropy}: \begin{equation*} x N - \mathcal{O}(\log_2{N}) \leq S_2 \leq N. \end{equation*} In the case of uniform constraints, $x = 4(\mu - \nu)$ if $\nu \geq \nicefrac{1}{2}\,\mu$ and $\nu \geq \nicefrac{3}{2}\, \mu - \nicefrac{1}{2}$; otherwise $x = \frac{\nu - \mu^2}{\nicefrac{1}{4} - (\mu - \nu)}$. For the \emph{minimum entropy}: \begin{equation*} \log_2 \left( \frac{N}{1 + (N-1) \bar\alpha } \right) \leq \tilde{S}_2 \leq \log_2 \left( 1+\frac{N(N+1)}{2} \right), \end{equation*} where $\bar\alpha$ is the average of $\alpha_{ij} = (4\nu_{ij} - 2\mu_i - 2\mu_j + 1)^2$ over all $i,j \in \{1,\dots,N\}$, $i \neq j$. Perhaps surprisingly, the scaling behavior of the minimum entropy does not depend on the details of the sets of constraint values --- for large systems the entropy floor does not contain tall peaks or deep valleys comparable to the scale of the maximum entropy. I also demonstrate that some sets of low-order statistics can only be realized by small systems. My results show how only small amounts of randomness are needed to mimic low-order statistical properties of highly entropic distributions, and I discuss some applications for engineered and biological information transmission systems.
Breast cancer detection using image enhancement and segmentation algorithms

Enhancement of mammography images considers as powerful methods in categorization of breast normal tissues and pathologies. The digital image software gives chance to improve the mammographs and increasing their illustration value. The image processing methods in this paper were using contrast improvement, noise lessening, texture scrutiny and portioning algorithm. The mammography images kept in high quality to conserve the quality. Those methods aim to augment and hone the image intensity and eliminate noise from the images. The assortment factor of augmentation depends on the backdrop tissues and type of the breast lesions; hence, some lesions gave better improvement than the rest due to their density. The computation speed examined used correspondence and matching ratio. The results were 96.3 ± 8.5 (p>0.05). The results showed that the breast lesions could be improved by using the proposed image improvement and segmentation methods.