Miracle-dz/UniFAR-FTUs huggingface dataset:
Bichromatic Lines with Few Points

Given a set of n blue and n red points in the plane, not all on a line, it is shown that there exists a bichromatic line passing through at most two blue points and at most two red points. There does not necessarily exist a line passing through precisely one blue and one red point. This result is extended to the case when the number of blue and red points is not the same.
Decreased peripheral blood γδ T cells in patients with bronchial asthma

Many cell populations are thought to be involved in the etiopathogenesis of bronchial asthma. We examined by flow cytometry the relative and absolute number of CD3*, CD4*, CD8*γδ TcR* T cells. CD19* B cells; and CD56* natural killer (NK) cells in the peripheral blood of 26 adult patients with difficult‐to‐control asthma (DCA) and 22 patients with minimally symptomatic asthma (MSA). Statistically higher relative and absolute numbers of NK cells (18.39±10.67% and 0.38±0.17×109/l) in comparison with healthy controls (ll.77±8.06% and 0.25±0.19×109/l) and significantly decreased relative and absolute numbers of γδ T cells (3.02±2.16% and 0.06±0.04×109/l) in comparison with controls (5.65+2.90% and 0.13±0.08×109/l) in the DCA patient group were found. After pooling of data from both MSA and DCA patients and dividing the patients according to the presence of allergy, the relative and absolute numbers of 78 T celts were found to be diminished in both the allergy (3.77±2.98 and O.O7±0.O5 ×109/l) and nonallergy (3.06±1.78% and 0.06±0.03 ×109/l) groups in comparison with healthy controls. The reason for the low number of 78 T cells in the peripheral blood of patients suffering from bronchial asthma is under investigation.
An Empirical Investigation of Virtual Screening

Drug discovery relies much on data processing. Virtual screening (VS) is a typical method of drug discovery that exploits chemical structures (molecules) to identify those that are likely to bind to a particular drug target. VS can be turned into either a matching or a classification problem where the quality of the data matters very much. The number of features (and their properties) and data imbalance are general problems of chemical datasets used in VS. This paper investigates how to deal with these two problems to enhance the accuracy of VS and specifically to reduce the false positive rate. On one hand, we use the synthetic minority over sampling technique (SMOTE) as a technique to balance data and on the other hand we investigate different molecular descriptors and fingerprints to serve as features. A classification approach is used to assess the performance of four chosen classifiers first individually and then by combining them. As an alternative an instance-based approach is employed to observe the effect on accuracy. Results from the classification method show that a higher accuracy and a lower false positive rate can be achieved by initially balancing the datasets using SMOTE and then classifying them. The effects of descriptors and fingerprints on accuracy and false positive rates can only be discussed for each dataset separately. Combining distance matrices of different structural fingerprints does not cause active and similar compounds to appear at the top of the dissimilarity ranking.
Association Between Cytokines and Cerebral MRI Changes in the Aging Brain

The association between cytokines (IL-1β, sIL-4R, IL-6, IL-8, IL-10, IL-12, TNF-α) and subcortical white matter lesions, cortical atrophy and lacunar infarctions of the aging brain was investigated among 268 elderly community participants. Single pro- and anti-inflammatory cytokines were neither associated with WML nor with atrophy and lacunar infarction. An association between atrophy and the chemokine-cytokine factor (containing sIL-4R, IL-6, IL-8) remained significant after adjustment for age, gender, education, depressive symptoms, diabetes mellitus, cardiovascular diseases (stroke, TIA, myocardial infarction, myocardial insufficiency, arrhythmic heart), hypertension, body-mass index, smoking status and aggregation inhibitors as opposed to single cytokines. Atrophy of the parietal, temporal and occipital lobes was associated with the same cytokinechemokine factor for both the whole sample or restricted to those without history of stroke/TIA. The results indicate that a combination of chemokine-cytokines rather than single cytokines may contribute to inflammatory processes associated with cortical atrophy in the aging brain.
Multiple Left Regular Representations Generated by Alternants

Let p1>? >pn? 0, and ? p=det? xpji? ni, j=1. Let Mp be the linear span of the partial derivatives of ? p. Then Mp is a graded Sn-module. We prove that it is the direct sum of graded left regular representations of Sn. Specifically, set ? j=pj? (n? j), and let ? (t) be the Hilbert polynomial of the span of all skew Schur functions s? /? as ? varies in ? Then the graded Frobenius characteristic of Mp is ? (t)H1n(x; q, t), a multiple of a Macdonald polynomial. Corresponding results are also given for the span of partial derivatives of an alternant over any complex reflection group. Let (i, j) denote the lattice cell in the i+1st row and j+1st column of the positive quadrant of the plane. If L is a diagram with lattice cells (p1, q1), ? , (pn, qn), we set ? L=det? xpjiyqji? ni, j=1, and let ML be the linear span of the partial derivatives of ? L. The bihomogeneity of ? L and its alternating nature under the diagonal action of Sn gives ML the structure of a bigraded Sn-module. We give a family of examples and some general conjectures about the bivariate Frobenius characteristic of ML for two dimensional diagrams.
A General Construction for Optimal Cyclic Packing Designs

Cyclic packing designs of pairs have various applications in communications. In this paper, the concept of a (g1, g2, ? , gr;u)-regular cyclic packing design is defined, and used to establish a quite general recursive construction concerning cyclic packing designs. As corollaries, we are able to unify many known constructions for cyclic designs. As an application, we obtain infinite series of new optimal cyclic packing designs which can be utilized directly to produce new optimal optical orthogonal codes.
An Intelligent Tutoring System for Case-Based E-Learning on Project Management

A survey says that the success rate of information system development project is about 30%. In order to lead a project to a successful one, many companies performed several kinds of education methods to educate more excellent project managers. One of the education methods is the case-based learning that a learner thinks problems and solutions on the practical case. The tutor that provides advice on how to think about the case plays an important role in the case-based learning. However, tutors are fewer than learners. In order to make the case-based learning available online without the tutor, we propose an intelligent tutoring system for case-based e-Learning on project management. A tutor agent instead of a human tutor provides appropriate advice according to a learner's input to the system. The proposed method compares the learner's input to the answers that the human tutor preliminary decides in order to verify the learner's input. A tutor agent chooses the advice corresponding to the content of the input from an advice list. The system repeats to provide advice to the learner until the learner finishes thinking about sufficient solutions.
Graphs with Linearly Bounded Ramsey Numbers

Abstract A graph G of order n is p -arrangeable if its vertices can be ordered as v 1 , v 2 , . , v n such that | N L i ( N Ri ( v i ))| ≤ p for each 1 ≤ i ≤ n − 1, where L i = { v 1 , v 2 , . , v i }, R i = { v i +1 , v i +2 , . , v n }, and N A ( B ) denotes the neighbors of B which lie in A . We prove that for each p ≥ 1, there is a constant c (depending only on p ) such that the Ramsey number r ( G , G ) ≤ cn for each p -arrangeable graph G of order n . Further we prove that there exists a fixed positive integer p such that all planar graphs are p -arrangeable.
Analysis of metrics for object-oriented program complexity

We present a new framework for analyzing the scope of metrics to evaluate complexity of object-oriented programs. In this framework, we examine in detail the metrics from the viewpoint of three key aspects in object-oriented paradigm: syntax complexity, inheritance complexity and interaction complexity. For each key aspect, we expand it to five attributes, which can be calculated qualitatively. Then, we apply our framework to conventional metrics for evaluating complexity of object-oriented programs. The metrics include the ones proposed by S.R. Chidamber and C.F. Kemerer (1991), R.C. Sharble and S.S. Cohen (1993), W. Li and S. Henry (1993), and E. Kim (1993). Finally, we present a new metric which satisfies almost all attributes of the proposed framework. <<ETX>>
On the Number of Edges of Quadrilateral-Free Graphs

If a graph hasq2+q+1 vertices (q>13),eedges and no 4-cycles thene? 12q(q+1)2. Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdos from the 1930's.
Strengths and Limitations of the MoCA for Assessing Cognitive Functioning

Background: The Montreal Cognitive Assessment (MoCA) is a very widely used test for mild cognitive impairment. Differing recommendations have been made regarding its utility in providing a profile of performance across several cognitive domains. Objectives: To examine the factor structure of the MoCA in a nationally representative population study of older Irish adults and evaluate its utility in providing domain-specific information. Methods: A cross-sectional analysis of wave 1 data from the Irish Longitudinal Study on Ageing was undertaken. Data from a subset of 2342 participants assessed using the MoCA were analyzed using both confirmatory factor analytic (CFA) and exploratory factor analytic (EFA) methods. Results: Mean age was 72.64 (range 65 to 98), 53% female. The CFA provided evidence of adequate overall model fit for a previously proposed 6-factor model. In contrast, EFA yielded a 3-factor solution and test items cross-loaded onto a number of factors with no clear pattern of underlying cognitive domains. Using EFA to explore the 6-factor model yielded good fit, but again test items cross-loaded onto a number of factors with no clear pattern evident. Conclusion: Lack of concordance between the CFA and EFA findings demonstrates that the correspondence between individual tests and their assumed cognitive domains is not robust, reflecting at least in part a current lack of consensus on how core cognitive constructs are defined and on what subcomponents can be subsumed under different cognitive domains. The MoCA should not be viewed as a substitute for more in-depth neuropsychological assessment when domain-specific information is required.
Citalopram for the Treatment of Agitation in Alzheimer Dementia

Objective: To assess potential genetic influences on citalopram treatment efficacy for agitation in individuals with Alzheimer dementia (AD). Six functional genetic variants were studied in the following genes: serotonin receptor 2A (HTR2A-T102C), serotonin receptor 2C (HTR2C-Cys23Ser), serotonin transporter (5HTT-LPR), brain-derived neurotropic factor (BDNF-Val66Met), apolipoprotein E (ε2, ε3, ε4 variants), and cytochrome P450 (CYP2C19). Treatment response by genotype was measured by (1) the agitation domain of the Neurobehavioral Rating Scale, (2) the modified Alzheimer Disease Cooperative Study—Clinical Global Impression of Change scale (mADCS-CGIC), (3) the agitation domain of the Neuropsychiatric Inventory (NPI), and (4) the Cohen-Mansfield Agitation Inventory. Method: We utilized data from the Citalopram for Agitation in Alzheimer’s Disease (CitAD) database. CitAD was a 9-week randomized, double-blind, placebo-controlled multicenter clinical trial showing significant improvement in agitation and caregiver distress in patients treated with citalopram. Proportional odds logistic regression and mixed effects models were used to examine the above-mentioned outcome measures. Results: Significant interactions were noted on the NPI agitation domain for HTR2A (likelihood ratio [LR] = 6.19, df = 2, P = .04) and the mADCS-CGIC for HTR2C (LR = 4.33, df = 2, P = .02) over 9 weeks. Discussion: Treatment outcomes in CitAD showed modest, although statistically significant, influence of genetic variation at HTR2A and HTR2C loci. Future studies should continue to examine the interaction of known genetic variants with antidepressant treatment in patients with AD having agitation.
The Game Coloring Number of Planar Graphs

This paper discusses a variation of the game chromatic number of a graph: the game coloring number. This parameter provides an upper bound for the game chromatic number of a graph. We show that the game coloring number of a planar graph is at most 19. This implies that the game chromatic number of a planar graph is at most 19, which improves the previous known upper bound for the game chromatic number of planar graphs.
Orbital fine needle aspiration biopsy: The results of its use in 50 patients

Fine needle aspiration biopsy of orbital lesions from 50 patients have been diagnosed with an accuracy of 92%. The technique has been complicated by six orbital hemorrhages, which have been mild and which resolved spontaneously without ill effect. Needle aspiration is associated with minimal discomfort and does not preclude a standard biopsy in case of failure to identify the lesion satisfactorily.
HEALWA: A Unique Information Resource for Washington State Health Professionals: A 5-Year Review

Five years ago, in January 2009, HEALWA (Health Evidence Resource for Washington State) began operation as the only evidence-based, statewide health information portal in the country. Based at the University of Washington’s Health Sciences Library, HEALWA’s mission is to provide evidence-based health information to licensed health care providers across Washington State. In 2007, former Washington State Governor, Christine Gregoire, named a Blue Ribbon Commission on Health Care Costs and Access that listed 16 recommendations, one of which was to improve health professionals’ access to information statewide (1). Funding for HEALWA resources comes from an add-on to license fees of eligible health care practitioners. Several new health professions groups have been added to the list of those eligible to access HEALWA since its inception. Medical librarians initially played essential roles in the implementation of HEALWA and continue to do so now and going into the future.
Net Primary Productivity in Coral Reef Sponges

Nine of the ten most common sponge species on the fore-reef slope of Davies Reef(Great Barrier Reef) contain symbiotic cyanobacteria. Six of the ten are net primary producers, with three times more oxygen produced by photosynthesis than is consumed during respiration. Light interception is enhanced by morphological flattening, thereby increasing the potential for phototrophic nutrition, a factor crucial in the ecology of most sessile coral reef invertebrates.
Bounded Contractions of Full Trees

Let G be a simple finite connected undirected graph. A contraction φ of G is a mapping from G = G(V, E) toG′ = G′(V′, E′), where G′ is also a simple connected undirected graph, such that if u, ν ∈ V are connected by an edge (adjacent) in G then either φ(u) = φ(ν), or φ(u) and φ(ν) are adjacent in G′. In this paper we are interested in a family of contractions, called bounded contractions, in which ∀ν′ ∈ V′, the degree of ν′ in G′, DegG′(ν′), satisfies DegG′(ν′) ≤ |φ−1(ν′)|, where φ−1(ν′) denotes the set of vertices in G mapped to ν′ under φ. These types of contractions are useful in the assignment (mapping) of parallel programs to a network of interconnected processors, where the number of communication channels of each processor is small. The main results of this paper are that there exists a partitioning of full m-ary trees that yields a bounded contraction of degree m + 1, i.e., a mapping for which ∀ν′ ∈ V′, |φ−1(ν′)| ≤ m + 1, and that this degree is a lower bound, i.e., there is no mapping of a full m-ary tree such that ∀ν′ ∈ V′, |φ−1(ν′)| ≤ m
A Quantitative Analysis of Dataflow Program Execution - Preliminaries to a Hybrid Design

Abstract While the dataflow execution model can potentially uncover all forms and levels of parallelism in a program, in its traditional fine grain form it does not exploit any form of locality . Recent evidence indicates that the exploitation of locality in dataflow programs could have a dramatic impact on performance. The current trend in the design of dataflow processors suggests a synthesis of traditional nonstrict fine grain instruction execution and strict coarse grain execution in order to exploit locality. While an increase in instruction granularity favors the exploitation of locality within a single execution thread, the resulting grain size may increase latency among execution threads. We define fine grain intrathread locality as a dynamic measure of instruction level locality and quantify it using a set of numeric and nonnumeric benchmarks. The results point to a very large degree of intrathread locality and a remarkable uniformity and consistency of the distribution of thread locality across a wide variety of benchmarks. As the execution is moved to a coarser granularity it can result in an increase of the input latency of operands that would have a detrimental effect on performance. We evaluate the resulting latency incurred through the partitioning of fine grain instructions into coarser grain threads. We define the concept of a cluster of fine grain instructions to quantify coarse grain input and output latencies. The results of our experiments offer compelling evidence that a coarse grain execution outperforms a fine grain grain one on a significant number of numeric codes. These results suggest that the effects of increased instruction granularity on latency is minimal for a high percentage of the measured codes, and in large part is offset by available intrathread locality. Furthermore, simulation results indicate that strict or nonstrict data structure access does not change the basic cluster characteristics.
The Effect of Memory Capacity on Time Warp Performance

The behavior of n interacting processes synchronized by the "Time Warp" rollback mechanism is analyzed under the constraint that the total amount of memory to execute the program is limited. In Time Warp, a protocol called "cancelback" has been proposed to reclaim storage when the system runs out of memory. A discrete state, continuous time Markov chain model for Time Warp augmented with the cancelback protocol is developed for a shared memory system with n homogeneous processors and homogeneous workload with constant message population. The model allows one to predict speedup as the amount of available memory is varied. The performance predicted by the model is validated through performance measurements on an operational Time Warp system executing on a shared-memory multiprocessor using a workload similar to that in the model. It is observed that if the sequential simulation requires m message buffers, Time Warp with a small fraction of message buffers beyond m performs almost as well as Time Warp with unlimited memory.
FaceMore: A Face Beautification Platform on the Cloud

Face More, a cloud-based face beautification platform for intelligent face manipulation, is developed in this work. It provides flexible and efficient cloud API to develop automatic or interactive face retouching applications. A web-site, www.facemore. net, is built on Face More, where user can upload images and obtain various online face beautification services. To obtain automatic inhomogeneous editing effects in a natural and efficient manner, we analyze the novel tool, called region-aware mask, from semi-supervised learning perspective. We reformulate the optimized-based model of region-aware mask using label propagation, and propose a fast approximate algorithm for mask generation, which leads to about 40% speed improvement while maintain high visual quality for face beatification. Qualitative and quantitative evaluations were performed for mask generation and face beatification. Comparisons with five representative commercial systems, including PicTreat, Portraiture, Portrait+, Meitu and Baidu Motu, illustrate the effectiveness of our system for image enhancement of facial lighting, smoothness and color.
Renaming and dispersing: Techniques for Fast Load Balancing

Consider the following situation: n processors of a PRAM are given n independent tasks. Each task can be executed in constant time by a single processor. The distribution of tasks among the processors is unknown; each processor has information only about its set of tasks. The batch execution problem is to reschedule the tasks so that the quickest execution of all tasks is achieved. This problem captures some basic cooperation obstacles of the PRAM model since, without rescheduling overhead, all the tasks can be completed in O(1) time. The solution presented in this paper is an O(lg lg n) time load balancing algorithm which achieves, with overwhelming probability, an almost flat distribution, i.e., O(1) tasks for each processor. We introduce two novel techniques which are of an independent interest: renaming-a randomized scheme for an approximate compaction, and dispersing-a gather-scatter paradigm for distribution smoothing. The model of computation used in the CRCW PRAM. The concurrent-write submodel is ROBUST; i.e., if two or more processors write into the same cell at the same time then no prediction can be made about the cell contents.
Exposure to Animal Feces and Human Health: A Systematic Review and Proposed Research Priorities

Humans can be exposed to pathogens from poorly managed animal feces, particularly in communities where animals live in close proximity to humans. This systematic review of peer-reviewed and gray literature examines the human health impacts of exposure to poorly managed animal feces transmitted via water, sanitation, and hygiene (WASH)-related pathways in low- and middle-income countries, where household livestock, small-scale animal operations, and free-roaming animals are common. We identify routes of contamination by animal feces, control measures to reduce human exposure, and propose research priorities for further inquiry. Exposure to animal feces has been associated with diarrhea, soil-transmitted helminth infection, trachoma, environmental enteric dysfunction, and growth faltering. Few studies have evaluated control measures, but interventions include reducing cohabitation with animals, provision of animal feces scoops, controlling animal movement, creating safe child spaces, improving veterinary care, and hygiene promotion. Future research should evaluate: behaviors related to points of contact with animal feces; animal fecal contamination of food; cultural behaviors of animal fecal management; acute and chronic health risks associated with exposure to animal feces; and factors influencing concentrations and shedding rates of pathogens originating from animal feces.
Flight of Winter Moths Near 0�C

Some noctuid winter moths fly at near 0�C by maintaining an elevated(30� to 35�C) thoracic muscle temperature. Geometrid winter moths sustain themselves in free flight at subzero muscle temperatures. However, the temperature characteristics of citrate synthase and pyruvate kinase from both of these different kinds of moths and from a sphinx moth that flies with a muscles temperature of 40�C are nearly identical. Furthermore, mass-specific rates of energy expenditure of both kinds of winter moths are also similar at given thoracic temperature (near 0�C). The geometrids that are able to fly with a thoracic temperature near 0�C do so largely because of unusually low wing-loading, which permits a low energetic cost of flight.