snu-aidas/HVMap-dataset huggingface dataset:
The TNF and TNF Receptor Superfamilies Integrating Mammalian Biology

The receptors and ligands in this superfamily have unique structural attributes that couple them directly to signaling pathways for cell proliferation, survival, and differentiation. Thus, they have assumed prominent roles in the generation of tissues and transient microen-capabilities are crucial in coordinating the proliferation and protective functions of pathogen-reactive cells. Here, we review the organization of the TNF/TNFR SF and how these proteins have been adapted for pro-Bethesda, Maryland 20892 cesses as seemingly disparate as host defense and or-ganogenesis. In interpreting this large and highly active area of research, we have focused on common themes Introduction that unite the actions of these genes in different tissues. We also discuss the evolutionary success of this super-Three decades ago, lymphotoxin (LT) and tumor necro-sis factor (TNF) were identified as products of lympho-family—success that we infer from its expansion across the mammalian genome and from its many indispens-cytes and macrophages that caused the lysis of certain types of cells, especially tumor cells (Granger et al., able roles in mammalian biology.The normal functions of TNF/TNFR SFPs, as well as ally, it became clear that they were members of a gene certain diseases involving them, depend on the obliga-superfamily. Not surprisingly, the receptors for these tory 3-fold symmetry that defines the essential signaling proteins also constitute a TNF receptor (TNFR)-related stoichiometry and structure (Figure 1). The ligands are gene superfamily. Large-scale sequencing of " ex-type 2 proteins that can have both membrane-embed-pressed sequence tags " (ESTs) identified many related ded " pro " as well as cleaved, soluble " mature " forms proteins, collectively referred to here as TNF-and TNFR-(for review, see Idriss and Naismith, 2000). Both forms related superfamily proteins (TNF/TNFR SFPs; reviewed are active as self-assembling noncovalent trimers, whose individual chains fold as compact " jellyroll " ␤ sandwiches and interact at hydrophobic interfaces (Fesik, UCL.ac.uk/users/hester/tnfinfo.html). The familiar as 2000) (Figure 1A). The 25%–30% amino acid similarity well as standardized names of these proteins are listed between TNF-like ligands is largely confined to internal in Table 1, together with their gene locations, pheno-aromatic residues responsible for trimer assembly. The types caused by mutations in these genes, and identified external surfaces of ligand trimers show little sequence functions. similarity, which accounts for receptor selectivity (Figure The discovery that cachectin, a protein known to 2). The ligand shape is that of an inverted bell that is cause fever and wasting, was identical to TNF provided …
A Study of Big Data in Cloud Environment with their Related Challenges

Big Data , it is a word which is used for the huge amount of data sets which have the big, extra various and difficu lt structure facing some difficult ies in storing the data then analyzing and visualizing the data for the final outcome [1] . Big data analytics is the procedure of probing huge amounts of data. Here we use cloud computing technology so firstly acquaint the general environment of big data and some associated technology like Hadoop. This powerful technology is used to execute the huge s cale and complicated data computing. It eradicates the requirements of hardware computing which is costly dedicated space and software’s [3]. It is a resolution for analyzing Big Data by deploying Big Data softwares like Hadoop on cloud background which gives users an innovative pattern of service called as Analytics as a Service [7]. Hadoop uses the map-reduce paradigm .We also talk about various advantages, challenges, and issues associated with Big Data.
La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs

I. INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 ~I. ]:~.ECONSTRUCTION PAR LES Cubi termes sp . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 I . La r e c o n s t r u c t i o n p r o p r e m e n t dire, p. 43. 2. Le c o m p o r t e m e n t en fonc t ion du groupe , p. 46. 3. Les condui tes individuel les , p. 49. 4. Les ac t iv i t4s au t r e s que la r econs t ruc t i on , p. 51. I I [ . RECONSTRUCTION PAR Bell icosi termes natalensis . . . . . . . . . . . . . . . . . . . . . 53 I V . ~V[]~CANISME DE LA CORRELATION DES TACIIES INDIVIDUELLES ET DE LA PRETENDUE REGULATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 I . L a phase d ' incoordinat ion, p. 57. A. La s i tua t ion s t i m u l a n t e , p. 57 ; B. Les act iv i t~s incoordonn~es , p. 59 ; C. La local isa t ion des d~p6ts de t e r re , p. 60. 2. L a phase de coordinat ion, p. 61. A. La densi t6 cr i t ique des bou le t t e s de te r re et l ' o r i en ta t ion du c o m p o r t e m e n t , p. 61 ; B. La s t i g m e r g i e et les s t i m u l a t i o n s s imul tan6es , p. 62 ; C. N a t u r e des s t imu l i a g i s s a n t s u r les c o n s t r u c t e u r s : les odeurs fo rmes , p. 66 ; D. La t endance l ' un i t4 , p. 67 ; E, R61e de la m~moi re d a n s ia cons t ruc t ion , p. 67 ; F. Essa i de s y n t h ~ s e , p. 68. V. COMPORTEMENT DES TERMITES COMPARE A CELUI D'ANIMAUX SOLITAIRES. 73 VI . CARACTERISTIQUES FONDAMENTALES DU COMPORTEMENT DES INSECTES SOCIAUX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 V I I . AUTEURS CIT#.S . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 L~.CENDES ~)ES PLANC~ES I A V I I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8'1
OFDM : Basic Concepts , Scope & its Applications

Orthogonal frequency division multiplexing (OFDM) is a special case of multicarrier transmission where a single DataStream is transmitted over a number of lower rate subcarriers. In July 1998, the IEEE standardization group decided to select OFDM as the basis for their new 5-GHz standard aiming a range of data stream from 6 up to 54 Mbps. This new standard is the first one to use OFDM in packetbased communications. In wireless communication, concept of parallel transmission of symbols is used to achieve high throughput and better transmission quality. Orthogonal Frequency Division Multiplexing (OFDM) is one of the techniques for parallel transmission. The idea of OFDM is to split the total transmission bandwidth into a number of orthogonal subcarriers in order to transmit the symbols using these subcarriers in parallel. In this paper we will discuss the basics of OFDM techniques, role of OFDM in this era, its benefits and losses and also some of its application. Keywords— Orthogonal frequency division multiplexing(OFDM); BER; ISI; PAPR; DVB; DAB.
A Better Comparison Summary of Credit Scoring Classification

The credit scoring aim is to classify the customer credit as defaulter or non-defaulter. The credit risk analysis is more effective with further boosting and smoothing of the parameters of models. The objective of this paper is to explore the credit score classification models with an imputation technique and without imputation technique. However, data availability is low in case of without imputation because of missing values depletion from the large dataset. On the other hand, imputation based dataset classification accuracy with linear method of ANN is better than other models. The comparison of models with boosting and smoothing shows that error rate is better metric than area under curve (AUC) ratio. It is concluded that artificial neural network (ANN) is better alternative than decision tree and logistic regression when data availability is high in dataset. Keywords—Credit score data mining; classification; artifical neural network; imputation
A RFID case-based logistics resource management system for managing order-picking operations in warehouses

In the supply chain, a warehouse is an essential component for linking the chain partners. It is necessary to allocate warehouse resources efficiently and effectively to enhance the productivity and reduce the operation costs of the warehouse. Therefore, warehouse management systems (WMSs) have been developed for handling warehouse resources and monitoring warehouse operations. However, it is difficult to update daily operations of inventory level, locations of forklifts and stock keeping units (SKUs) in realtime by using the bar-code-based or manual-based warehouse management systems. In this paper, RFID technology is adopted to facilitate the collection and sharing of data in a warehouse. Tests are performed for evaluating the reading performance of both the active and passive RFID apparatus. With the help of the testing results, the efficient radio frequency cover ranges of the readers are examined for formulating a radio frequency identification case-based logistics resource management system (R-LRMS). The capabilities of R-LRMS are demonstrated in GSL Limited. Three objectives are achieved: (i) a simplification of RFID adoption procedure, (ii) an improvement in the visibility of warehouse operations and (iii) an enhancement of the productivity of the warehouse. The successful case example proved the feasibility of R-LRMS in real working practice. 2008 Elsevier Ltd. All rights reserved.
Dietary energy density is associated with obesity and the metabolic syndrome in U.S. adults.

OBJECTIVE
Rising obesity rates have been linked to the consumption of energy-dense diets. We examined whether dietary energy density was associated with obesity and related disorders including insulin resistance and the metabolic syndrome.


RESEARCH DESIGN AND METHODS
We conducted a cross-sectional study using nationally representative data of U.S. adults > or =20 years of age from the 1999-2002 National Health and Nutrition Examination Survey (n = 9,688). Dietary energy density was calculated based on foods only. We used a series of multivariate linear regression models to determine the independent association between dietary energy density, obesity measures (BMI [in kilograms per meters squared] and waist circumference [in centimeters]), glycemia, or insulinemia. We used multivariate Poisson regression models to determine the independent association between dietary energy density and the metabolic syndrome as defined by the National Cholesterol and Education Program (Adult Treatment Panel III).


RESULTS
Dietary energy density was independently and significantly associated with higher BMI in women (beta = 0.44 [95% CI 0.14-0.73]) and trended toward a significant association in men (beta = 0.37 [-0.007 to 0.74], P = 0.054). Dietary energy density was associated with higher waist circumference in women (beta = 1.11 [0.42-1.80]) and men (beta = 1.33 [0.46-2.19]). Dietary energy density was also independently associated with elevated fasting insulin (beta = 0.65 [0.18-1.12]) and the metabolic syndrome (prevalence ratio = 1.10 [95% CI 1.03-1.17]).


CONCLUSIONS
Dietary energy density is an independent predictor of obesity, elevated fasting insulin levels, and the metabolic syndrome in U.S. adults. Intervention studies to reduce dietary energy density are warranted.
How Much Attention Do You Need? A Granular Analysis of Neural Machine Translation Architectures

ACL 2018 • Baseline: 6 layer Transformer, 512 hidden units • Data sets: IWSLT'16, WMT'17 • Metrics: BLEU (and METEOR in the paper) • 3 runs, reporting mean and standard deviation Encoder/Decoder Combinations • Architecture Definition Language • Allows easy experimentation of Neural Machine Translation (NMT) architecture variations • Detailed analysis of NMT architecture combinations • Multiple source attention layers and residual feedforward layer are key • Self-attention more important on the source side Introduction
Colour image segmentation using the self-organizing map and adaptive resonance theory

We propose a new competitive-learning neural network model for colour image segmentation. The model, which is based on the adaptive resonance theory (ART) of Carpenter and Grossberg and on the self-organizing map (SOM) of Kohonen, overcomes the limitations of (i) the stability–plasticity trade-offs in neural architectures that employ ART; and (ii) the lack of on-line learning property in the SOM. In order to explore the generation of a growing feature map using ART and to motivate the main contribution, we first present a preliminary experimental model, SOMART, based on Fuzzy ART. Then we propose the new model, SmART, that utilizes a novel lateral control of plasticity to resolve the stability–plasticity problem. SmART has been experimentally found to perform well in RGB colour space, and is believed to be more coherent than Fuzzy ART. q 2005 Elsevier Ltd. All rights reserved.
Sustaining iterative game playing processes in DGBL: The relationship between motivational processing and outcome processing

Digital game-based learning (DGBL) has become a viable instructional option in recent years due to its support of learning motivation. Recent studies have mostly focused on identifying motivational factors in digital games (e.g., curiosity, rules, control) that support intrinsic motivation. These findings, however, are limited in two fronts. First, they did not depict the interactive nature of the motivational processing in DGBL. Second, they excluded the outcome processing (learners’ final effort versus performance evaluation) as a possible motivation component to sustain the iterative game playing cycle. To address these problems, situated in the integrative theory of Motivation, Volition, and Performance (MVP), this study examined the relationship between motivational processing and outcome processing in an online instructional game. The study surveyed 264 undergraduate students after playing the Trade Ruler online game. Based on the data collected by ARCS-based Instructional Materials Motivational Survey (IMMS), a regression analysis revealed a significant model between motivational processing (attention, relevance, and confidence) and the outcome processing (satisfaction). The finding preliminarily suggests that both motivational processing and outcome processing need to be considered when designing DGBL. Furthermore, the finding implies a potential relationship between intrinsic motives and extrinsic rewards in DGBL. Published by Elsevier Ltd.
Improved Neural Machine Translation with a Syntax-Aware Encoder and Decoder

Most neural machine translation (NMT) models are based on the sequential encoder-decoder framework, which makes no use of syntactic information. In this paper, we improve this model by explicitly incorporating source-side syntactic trees. More specifically, we propose (1) a bidirectional tree encoder which learns both sequential and tree structured representations; (2) a tree-coverage model that lets the attention depend on the source-side syntax. Experiments on Chinese-English translation demonstrate that our proposed models outperform the sequential attentional model as well as a stronger baseline with a bottom-up tree encoder and word coverage.1
Performance evaluation of local colour invariants

In this paper, we compare local colour descriptors to grey-value descriptors. We adopt the evaluation framework of Mikolayzcyk and Schmid. We modify the framework in several ways. We decompose the evaluation framework to the level of local grey-value invariants on which common region descriptors are based. We compare the discriminative power and invariance of grey-value invariants to that of colour invariants. In addition, we evaluate the invariance of colour descriptors to photometric events such as shadow and highlights. We measure the performance over an extended range of common recording conditions including significant photometric variation. We demonstrate the intensity-normalized colour invariants and the shadow invariants to be highly distinctive, while the shadow invariants are more robust to both changes of the illumination colour, and to changes of the shading and shadows. Overall, the shadow invariants perform best: they are most robust to various imaging conditions while maintaining discriminative power. When plugged into the SIFT descriptor, they show to outperform other methods that have combined colour information and SIFT. The usefulness of C-colour-SIFT for realistic computer vision applications is illustrated for the classification of object categories from the VOC challenge, for which a significant improvement is reported. 2008 Elsevier Inc. All rights reserved.
Can Personality Be Changed ? The Role of Beliefs in Personality and Change

Using recent research, I argue that beliefs lie at the heart of personality and adaptive functioning and that they give us unique insight into how personality and functioning can be changed. I focus on two classes of beliefs—beliefs about the malleability of self-attributes and expectations of social acceptance versus rejection—and show how modest interventions have brought about important real-world changes. I conclude by suggesting that beliefs are central to the way in which people package their experiences and carry them forward, and that beliefs should play a more central role in the study of personality. KEYWORDS—personality; personality theories; change; self-beliefs; interventions
Chat Speed OP : Practices of Coherence in Massive Twitch Chat

Paste the appropriate copyright statement here. ACM now supports three different copyright statements: • ACM copyright: ACM holds the copyright on the work. This is the historical approach. • License: The author(s) retain copyright, but ACM receives an exclusive publication license. • Open Access: The author(s) wish to pay for the work to be open access. The additional fee must be paid to ACM. This text field is large enough to hold the appropriate release statement assuming it is single spaced in a sans-serif 7 point font. Every submission will be assigned their own unique DOI string to be included here. Abstract Twitch.tv, a streaming platform known for video game content, has grown tremendously since its inception in 2011. We examine communication practices in Twitch chats for the popular game Hearthstone, comparing massive chats with at least 10,000 concurrent viewers and small chats with fewer than 2,000 concurrent viewers. Due to the large scale and fast pace of massive chats, communication patterns no longer follow models developed in previous studies of computer-mediated communication. Rather than what other studies have described as communication breakdowns and information overload, participants in massive chats communicate in what we call “crowdspeak.”
Birds of a ‘ ‘ bad ’ ’ feather flock together : The Dark Triad and mate choice

Previous research on the Dark Triad traits (i.e., Machiavellianism, psychopathy, and narcissism) has focused solely on the role the Dark Triad traits played in mate choice of actors. The current study (N = 336) extends this by manipulating the apparent levels of Dark Triad traits in targets and correlating mate choice in these targets with individual differences in the Dark Triad traits in actors. As expected, both sexes preferred partners low in the Dark Triad traits for long-term mating, while those high in these traits were preferred for one-night stands. However, women high in psychopathy considered the Dark Triad traits in potential male partners more physically attractive and desirable for an one-night stand, as well as a potential husband. Men who were high on psychopathy were likewise attracted to psychopathy in potential mothers. Our findings are discussed from an evolutionary personality paradigm. 2015 Elsevier Ltd. All rights reserved.
Bayesian Classification (AutoClass): Theory and Results

We describe AutoClass, an approach to unsupervised classiication based upon the classical mixture model, supplemented by a Bayesian method for determining the optimal classes. We include a moderately detailed exposition of the mathematics behind the AutoClass system. We emphasize that no current unsupervised classiication system can produce maximally useful results when operated alone. It is the interaction between domain experts and the machine searching over the model space, that generates new knowledge. Both bring unique information and abilities to the database analysis task, and each enhances the others' eeectiveness. We illustrate this point with several applications of AutoClass to complex real world databases, and describe the resulting successes and failures. 6.1 Introduction This chapter is a summary of our experience in using an automatic classiication program (AutoClass) to extract useful information from databases. It also gives an outline of the principles that underlie automatic classiication in general, and AutoClass in particular. We are concerned with the problem of automatic discovery of classes in data (sometimes called clustering, or unsupervised learning), rather than the generation of class descriptions from labeled examples (called supervised learning). In some sense, automatic classiication aims at discovering the \natural" classes in the data. These classes reeect basic causal mechanisms that makes some cases look more like each other than the rest of the cases. The causal mechanisms may be as boring as sample biases in the data, or could reeect some major new discovery in the domain. Sometimes, these classes were well known to experts in the eld, but unknown to AutoClass, and other times
A theory of reasoned action: some applications and implications.
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality

The nearest neighbor problem is the follolving: Given a set of n points P = (PI, . . . ,p,} in some metric space X, preprocess P so as to efficiently answer queries which require finding bhe point in P closest to a query point q E X. We focus on the particularly interesting case of the d-dimensional Euclidean space where X = Wd under some Zp norm. Despite decades of effort, t,he current solutions are far from saabisfactory; in fact, for large d, in theory or in practice, they provide litt,le improvement over the brute-force algorithm which compares the query point to each data point. Of late, t,here has been some interest in the approximate newest neighbors problem, which is: Find a point p E P that is an c-approximate nearest neighbor of the query q in t,hat for all p’ E P, d(p, q) < (1 + e)d(p’, q). We present two algorithmic results for the approximate version t,hat significantly improve the known bounds: (a) preprocessing cost polynomial in n and d, and a truly sublinear query t.ime (for 6 > 1); and, (b) query time polynomial in log-n and d, and only a mildly exponential preprocessing cost* O(n) x 0(1/~)~. Furt.her, applying a classical geometric lemma on random projections (for which we give a simpler proof), we obtain t.he first known algorithm with polynomial preprocessing and query t.ime polynomial in d and log n. Unfortunately, for small E, the latter is a purely theoretical result since bhe e?rponent depends on l/e. Experimental resuits indicate that our tit algori&m offers orders of magnitude improvement on running times over real data sets. Its key ingredient is the notion of locality-sensitive hashing which may be of independent interest; here, we give applications to information ret,rieval, pattern recognition, dynamic closest-pairs, and fast clustering algorithms. *Supported by a Stanford Graduate Fellowship and NSF