Miracle-dz/UniFAR-FTUs huggingface dataset:
Performance evaluation of fully adaptive routing under different workloads and constant node buffer size

In this paper, the performance of some popular direct interconnection networks, namely the mesh, torus and hypercube, are studied with adaptive wormhole routing for different traffic patterns. We investigate the effect of the number of virtual channels and depth of their buffers on the performance of such strictly orthogonal topologies under uniform, hot-spot and matrix-transpose traffic patterns for generated messages, while the total buffer size associated to each physical channel is kept constant. In addition we analyze the effect of escape channel buffer length on the performance of a fully adaptive routing algorithm. It is shown that the optimal number of virtual channels and buffer depth strongly depends on the assumed traffic pattern.
An Efficient SVM-Based Spam Filtering Algorithm

The electronic mail (e-mail) concept makes it possible to communicate with many people in an easy and cheap way. Though email brought us such huge convenience, it also caused us trouble of managing the large quantities of spam mails received everyday. Without appropriate counter-measures, the situation seems to be worsening and spare email will eventually undermine the usability of email. To efficiently solve the above problems, a spam mail filtering method using feature selection and support vector machine is proposed in this paper. The experimental results show that the proposed method outperforms other conventional spam filtering method
Finding All Allowed Edges in a Bipartite Graph

We consider the problem of finding all allowed edges in a bipartite graph $G=(V,E)$, i.e., all edges that are included in some maximum matching. We show that given any maximum matching in the graph, it is possible to perform this computation in linear time $O(n+m)$ (where $n=|V|$ and $m=|E|$). Hence, the time complexity of finding all allowed edges reduces to that of finding a single maximum matching, which is $O(n^{1/2}m)$ [Hopcroft and Karp 1973], or $O((n/\log n)^{1/2}m)$ for dense graphs with $m=\Theta(n^2)$ [Alt et al. 1991]. This time complexity improves upon that of the best known algorithms for the problem, which is $O(nm)$ ([Costa 1994] for bipartite graphs, and [Carvalho and Cheriyan 2005] for general graphs). Other algorithms for solving that problem are randomized algorithms due to [Rabin and Vazirani 1989] and [Cheriyan 1997], the runtime of which is $\tilde{O}(n^{2.376})$. Our algorithm, apart from being deterministic, improves upon that time complexity for bipartite graphs when $m=O(n^r)$ and $r<1.876$. In addition, our algorithm is elementary, conceptually simple, and easy to implement.
Generating a privacy footprint on the internet

As a follow up to characterizing traffic deemed as unwanted by Web clients such as advertisements, we examine how information related to individual users is aggregated as a result of browsing seemingly unrelated Web sites. We examine the privacy diffusion on the Internet, hidden transactions, and the potential for a few sites to be able to construct a profile of individual users. We define and generate a privacy footprint allowing us to assess and compare the diffusion of privacy information across a wide variety of sites. We examine the effectiveness of existing and new techniques to reduce this diffusion. Our results show that the size of the privacy footprint is a legitimate cause for concern across the sets of sites that we study.
Iterated Boolean Games for Rational Verification

Rational verification is the problem of understanding what temporal logic properties hold of a multi-agent system when agents are modelled as players in a game, each acting rationally in pursuit of personal preferences. More specifically, rational verification asks whether a given property, expressed as a temporal logic formula, is satisfied in a computation of the system that might be generated if agents within the system choose strategies for selecting actions that form a Nash equilibrium. We show that, when agents are modelled using the Simple Reactive Modules Language, a widely-used system modelling language for concurrent and multi-agent systems, this problem can be reduced to a simpler query: whether some iterated game---in which players have control over a finite set of Boolean variables and goals expressed as Linear Temporal Logic (LTL) formulae---has a Nash equilibrium. To better understand the complexity of solving this kind of verification problem in practice, we then study the two-player case for various types of LTL goals, present some experimental results, and describe a general technique to implement rational verification using MCMAS, a model checking tool for the verification of concurrent and multi-agent systems.
COLUMN CHROMATOGRAPHY FOR ISOLATION OF ANDROGRAPHOLIDE FROM IN VITRO GROWN MEDICINAL PLANT-ANDROGRAPHIS PANICULATA WALL. EX NEES.

Andrographis paniculata which is commonly known as Kalmegh is an important medicinal plant. The Methanol extract of in vitro grown A. paniculata was used for column chromatography to isolate its active ingredient- Andrographolide. The melting point and UV detection wave length of the colourless crystal recovered after column chromatography were recorded as 235 o C and
Towards Integration of MIR and Folk Song Research

Folk song research (FSR) often deals with large collections of tunes that have various types of relations to each other. Computational methods can support the study of the contents of these collections. Music Information Retrieval (MIR) research provides such methods. Yet a fruitful cooperation of both disciplines is difficult to achieve. We present a role-model to structure this cooperation in which tasks and responsibilities are distributed among the roles of MIR, Computational Musicology (CM) and FSR.
Cell cycle-dependent specific positioning and clustering of centromeres and telomeres in fission yeast

Fluorescence in situ hybridization (FISH) shows that fission yeast centromeres and telomeres make up specific spatial arrangements in the nucleus. Their positioning and clustering are cell cycle regulated. In G2, centromeres cluster adjacent to the spindle pole body (SPB), while in mitosis, their association with each other and with the SPB is disrupted. Similarly, telomeres cluster at the nuclear periphery in G2 and their associations are disrupted in mitosis. Mitotic centromeres interact with the spindle. They remain undivided until the spindle reaches a critical length, then separate and move towards the poles. This demonstrated, for the first time, that anaphase A occurs in fission yeast. The mode of anaphase A and B is similar to that of higher eukaryotes. In nda3 and cut7 mutants defective in tubulin of a kinesin-related motor, cells are blocked in early stages of mitosis due to the absence of the spindle, and centromeres dissociate but remain close to the SPB, whereas in a metaphase-arrested nuc2 mutant, they reside at the middle of the spindle. FISH is therefore a powerful tool for analyzing mitotic chromosome movement and disjunction using various mutants. Surprisingly, in top2 defective in DNA topoisomerase II, while most chromatid DNAs remain undivided, sister centromeres are separated. Significance of this finding is discussed. In contrast, most chromatid DNAs are separated but telomeric DNAs are not in cut1 mutant. In cut1, the dependence of SPB duplication on the completion of mitosis is abolished. In crm1 mutant cells defective in higher-order chromosome organization, the interphase arrangements of centromeres and telomeres are disrupted.
Active Stitching: Beyond Batch Processing of Panoramas

There currently exist a number of excellent techniques to capture, register, and blend digital panoramas. However, the problem is treated as an automated batch process, which can take several minutes to produce a panorama. Unfortunately, many of the algorithms involved are prone to errors and/or artifacts and may require meticulous tuning to achieve high quality results. This not only requires expert knowledge, but given the complex techniques involved can also result in a tedious and time consuming trial-and-error process. Each update may influence previous corrections and take minutes to be computed. Previews are typically not available or, at best, are provided as unintuitive outputs from each batch process. As a result, the existing workflow to create a panorama can be exasperating and exploring different aesthetic choices, such as image selection, etc., is too time consuming to be feasible. In this paper, we move from the traditional inflexible and sequential batch creation to a more versatile, interactive approach. We introduce novel techniques to enable a user-driven panorama workflow that leverages quick, meaningful previews and stream processing to provide the first end-to-end, interactive creation pipeline. This new workflow provides users with online control of the acquisition, registration, and composition without any constraints on input or use of specialized hardware and allows for the first time unconstrained, in-the-field panorama creation on commodity hardware. In particular, our approach is based on: (i) a new registration acceleration scheme to provide instant feedback independent of the number or structure of images in the panorama; (ii) a new mesh data structure to support arbitrary image arrangements; and (iii) a new scheme to provide previews of and progressively stream seam calculations.
Constructing Transliteration Lexicons from Web Corpora

This paper proposes a novel approach to automating the construction of transliterated-term lexicons. A simple syllable alignment algorithm is used to construct confusion matrices for cross-language syllable-phoneme conversion. Each row in the confusion matrix consists of a set of syllables in the source language that are (correctly or erroneously) matched phonetically and statistically to a syllable in the target language. Two conversions using phoneme-to-phoneme and text-to-phoneme syllabification algorithms are automatically deduced from a training corpus of paired terms and are used to calculate the degree of similarity between phonemes for transliterated-term extraction. In a large-scale experiment using this automated learning process for conversions, more than 200,000 transliterated-term pairs were successfully extracted by analyzing query results from Internet search engines. Experimental results indicate the proposed approach shows promise in transliterated-term extraction.
Designing a Doherty power amplifier

The aim of this paper is to present an easy and rigorous way to design a Doherty power amplifier (DPA) starting from the requirements of the wireless system, in which it has to be integrated. In particular, accounting for the value of the pick to average power ratio (PAPR) of the system, design guidelines will be given to correctly address each design step. The presented design flow will be validated through the realisation of a DPA in GaN technology at 2.14 GHz.
Spanish / English Cross-Lingual Categorization

This article deals with the problem of Cross-Lingual Text Categorization (CLTC), which arises when documents in different languages must be classified according to the same classification tree. We describe practical and cost-effective solutions for automatic Cross-Lingual Text Categorization, both in case a sufficient number of training examples is available for each new language and in the case that for some language no training examples are available. Experimental results of the bi-lingual classification of the ILO corpus (with documents in English and Spanish) are obtained using bi-lingual training, terminology translation and profile-based translation. The results are compared to the respective mono-lingual baselines for three different document representations (unlemmatized, lemmatized and normalized keywords).
Learning Conventions in Multiagent Stochastic Domains using Likelihood Estimates

Fully cooperative multiagent systems--those in which agents share a joint utility model--is of special interest in AI. A key problem is that of ensuring that the actions of individual agents are coordinated, especially in settings where the agents are autonomous decision makers. We investigate approaches to learning coordinated strategies in stochastic domains where an agent's actions are not directly observable by others. Much recent work in game theory has adopted a Bayesian learning perspective to the more general problem of equilibrium selection, but tends to assume that actions can be observed. We discuss the special problems that arise when actions are not observable, including effects on rates of convergence, and the effect of action failure probabilities and asymmetries. We also use likelihood estimates as a means of generalizing fictitious play learning models in our setting. Finally, we propose the use of maximum likelihood as a means of removing strategies from consideration, with the aim of convergence to a conventional equilibrium, at which point learning and deliberation can cease.
Dexamethasone Is a Novel Potent Inducer of Connective Tissue Growth Factor Expression

Due to its potent effect on fibroblast proliferation and extracellular matrix deposition, connective tissue growth factor (CTGF) seems to play an important role in the pathogenesis of fibrotic disease. Since glucocorticoids are frequently used for the therapy of these disorders, we determined a potential effect of these steroids on CTGF expression. In cultured fibroblasts, a striking induction of CTGF expression was observed after dexamethasone treatment and occurred in a time- and dose-dependent manner. This effect was obviously not mediated by the CTGF inducer transforming growth factor-β1, since expression of this factor was down-regulated by the glucocorticoid. Most importantly, CTGF expression levels also increased substantially in various tissues and organs by systemic glucocorticoid treatment of mice. After cutaneous injury, a strong induction of CTGF expression was seen in the wounds of nontreated mice. However, no further increase in the levels of CTGF mRNA occurred in wounded skin compared with unwounded skin of glucocorticoid-treated animals, suggesting the presence of other factors in the wound that might compensate for the effect of the steroids. Tumor necrosis factor-α was identified as a possible mediator of this effect because this factor suppressed CTGF expression in cultured fibroblasts and also blocked the glucocorticoid-induced CTGF production by these cells. These findings indicate that glucocorticoids stimulate CTGF expression in normal tissues and organs but not in highly inflamed areas.
Interaction of Chemokine Receptor CCR5 with its Ligands: Multiple Domains for HIV-1 gp120 Binding and a Single Domain for Chemokine Binding

CCR5 is a chemokine receptor expressed by T cells and macrophages, which also functions as the principal coreceptor for macrophage (M)-tropic strains of HIV-1. To understand the molecular basis of the binding of chemokines and HIV-1 to CCR5, we developed a number of mAbs that inhibit the various interactions of CCR5, and mapped the binding sites of these mAbs using a panel of CCR5/CCR2b chimeras. One mAb termed 2D7 completely blocked the binding and chemotaxis of the three natural chemokine ligands of CCR5, RANTES (regulated on activation normal T cell expressed and secreted), macrophage inflammatory protein (MIP)-1α, and MIP-1β, to CCR5 transfectants. This mAb was a genuine antagonist of CCR5, since it failed to stimulate an increase in intracellular calcium concentration in the CCR5 transfectants, but blocked calcium responses elicited by RANTES, MIP-1α, or MIP-1β. This mAb inhibited most of the RANTES and MIP-1α chemotactic responses of activated T cells, but not of monocytes, suggesting differential usage of chemokine receptors by these two cell types. The 2D7 binding site mapped to the second extracellular loop of CCR5, whereas a group of mAbs that failed to block chemokine binding all mapped to the NH2-terminal region of CCR5. Efficient inhibition of an M-tropic HIV-1–derived envelope glycoprotein gp120 binding to CCR5 could be achieved with mAbs recognizing either the second extracellular loop or the NH2-terminal region, although the former showed superior inhibition. Additionally, 2D7 efficiently blocked the infectivity of several M-tropic and dual-tropic HIV-1 strains in vitro. These results suggest a complicated pattern of HIV-1 gp120 binding to different regions of CCR5, but a relatively simple pattern for chemokine binding. We conclude that the second extracellular loop of CCR5 is an ideal target site for the development of inhibitors of either chemokine or HIV-1 binding to CCR5.
To be or Not to be Ridded? – That is the Question Addressed by the Associative Antigen Recognition Model *†

The reasons that germline‐encoded recognitive sites cannot sort the immune system's large and random somatically generated repertoire into anti‐Not‐to‐be‐ridded (‘self ’) and anti‐To‐be‐ridded (‘nonself ’) specificities are analysed. The immune system cannot use ‘nonself ’‐markers of To‐be‐ridded antigens (‘Danger’, toll receptors, pathogenicity, localization, etc.) to sort the repertoire; it may, however, use them to determine the magnitude and class of the effector response.
Epstein-Barr Virus (EBV) DNA in Sera of Patients with Primary EBV Infection

ABSTRACT Detection of Epstein-Barr Virus (EBV) DNA by PCR in serum had a sensitivity of 80%, a specificity of 94%, and positive and negative predictive values of 95 and 79%, respectively, for the diagnosis of primary EBV infection. We suggest that this is a useful addition to the panel of tests used for this purpose.
Admissible Model Matching Fault Tolerant Control based on LPV Fault Representation

In this paper, an approach to design an Admissible Model Matching (AMM) Fault Tolerant Control (FTC) based on Linear Parameter Varying (LPV) fault representation is proposed. The main contribution of this approach is to consider parametric faults as a scheduling variable in the LPV fault representation of the system that allows the controller reconfiguration on-line. The proposed strategy is an active technique that requires the fault to be detected, isolated and estimated by a FDI scheme. In case the fault estimation is not available, a passive strategy based on a single AMM FTC controller could be designed. The formulation of AMM is based on the set of admissible behaviors that are characterized by means of Linear Matrix Inequalities (LMIs). The LMIs allow to locate the poles of the close-loop system inside a region of the unit circle and the fault accommodation can be formulated in terms of several LMIs. The effectiveness and performance of proposed approach have been illustrated in simulation considering a thermal hydraulic system.
Accelerating the data shuffle operations for FFT algorithms on SIMD DSPs

FFT is a key kernel of OFDM in the 3GPP-LTE system. Many researchers employ SIMD DSPs to accelerate FFT algorithms by the feature that there is about 75% SIMD workloads in them. This paper makes a detailed analysis on how to accelerate FFT algorithms on SIMD DSPs. We propose an EXC instruction for SIMD DSPs. The EXC instruction can exchange the specified elements between two vector registers in one cycle. It can achieve performance benefits ranging from 1.18× to 1.37× and reduce the dynamic code size by up to 15% compared with the vhalfup and vhalfdn instructions which are implemented in VIRAM processor. Moreover, two useful suggestions are presented in this paper for designing the architecture oriented to the 3G/4G wireless communication systems.
A Proposal for a Description Logic Interface

Most description logic (DL) systems present the application programmer with a functional interface, often dened using a Lisp-like syntax. Such interfaces may be more or less complex, depending on the sophistication of the implemented system, and may be more or less compliant with the KRSS description logic speci cation [8]. The Lisp style of the KRSS syntax re ects the fact that Lisp is still the most common implementation language for DLs. This can create considerable barriers to the use of DL systems by application developers, who often prefer other languages (in particular the currently ubiquitous Java), and who are becoming more accustomed to component based software development environments. In such an environment, a DL might naturally be viewed as a self contained component, the details of whose implementation, and even the precise location in which its code is being executed, is hidden from the application [2]. This approach has several advantages: the issue of implementation language is nessed; the API can be de ned in some standard formalism intended for the purpose; a mechanism is provided for applications to communicate with the DL system, either locally or remotely; and alternative DL components can be substituted without a ecting the application.
National Survey of Reading Programs for Incarcerated Juvenile Offenders.

A survey was undertaken to provide a profile of current reading programs in juvenile correctional facilities. Data were gathered to determine whether "illiterates" exist in the juvenile correctional facilities; if oral comprehension is better than reading comprehension; what approaches and strategies are used for teaching word recognition skills; what concepts reading teachers consider valid; if their beliefs and strategies are supported by experimental research; and whether teachers are using contradictory instructional strategies. Questionnaires were sent to reading teachers working in 260 correctional facilities; 145 teachers responded. Results indicated that: (1) 89.6% of the teachers were working with some wards, 13 to 18 years of age, who cannot decode fluently and accurately what they can talk about and understand; and (2) tests used to determine if students can comprehend orally at higher levels than when reading did not compare oral versus reading comprehension. Results also indicated a great variance between teacher's beliefs and their instructional strategies--though experimental research supports the use of systematic phonics as the best approach for those who cannot decode accurately and fluently, many teachers are teaching "sight words" as "wholes," using a visual approach with those having difficulty recognizing speech sounds, and encouraging students to identify unknown words by using context clues. (Contains 47 references, 15 notes, and 2 numbered and 23 unnumbered tables of data; definitions of terms, a description of the alphabetic code and how it works, an appendix of data, and the questionnaire are attached.) (RS) *********************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. *********************************************************************** U.S. Department of Justice Office of Justice Programs Office of Juvenile Justice and Delinquency Prevention 11111111111111MINEWM. ,,, i-:::::IREIRA:M=1111111111111111111111111111111111/ r" National Survey of Reading Programs for Incarcerated Juvenile Offenders U.S. DEPARTMENT OF EDUCATION Once of Educatronal Rsearch and Improvornont EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) This document hos been 'produced as received from tee persOn or otganttatron originating it CI Minor chanots haw boon made to improve reproduction Quality Pirents of umet or opinions stated in this document do not necessarily represent official OEM D. :motion or Policy