Miracle-dz/UniFAR-FTUs huggingface dataset:
Opposing Effects of Membrane-Anchored CX3CL1 on Amyloid and Tau Pathologies via the p38 MAPK Pathway

Several Alzheimer's disease (AD) risk genes are specifically expressed by microglia within the CNS. However, the mechanisms by which microglia regulate the pathological hallmarks of AD—extracellular deposition of β-amyloid (Aβ) and intraneuronal hyperphosphorylation of microtubule-associated protein tau (MAPT)—remain to be established. Notably, deficiency for the microglial CX3CR1 receptor has opposing effects on Aβ and MAPT pathologies. CX3CL1, the neuronally derived cognate ligand for CX3CR1, signals both in membrane-anchored and soluble forms. In this study, we sought to determine the relative contribution on membrane-anchored versus soluble CX3CL1 in regulating the microglia-mediated amelioration of Aβ pathology, as well as provide insight into the potential downstream microglial-based mechanisms. As expected, CX3CL1 deficiency reduced Aβ deposition in APPPS1 animals in a similar manner to CX3CR1 deficiency. Surprisingly, however, CX3CL1-deficient APPPS1 animals exhibited enhanced neuronal MAPT phosphorylation despite reduced amyloid burden. Importantly, neither of these phenotypes was altered by transgenic expression of the soluble CX3CL1 isoform, suggesting that it is the membrane-anchored version of CX3CL1 that regulates microglial phagocytosis of Aβ and neuronal MAPT phosphorylation. Analysis of transcript levels in purified microglia isolated from APPPS1 mice with the various CX3CL1/CX3CR1 genotypes revealed increased expression of inflammatory cytokines and phagocytic markers, which was associated with activation of p38 mitogen-activated protein kinase and Aβ internalization within microglia. Together, these studies challenge the “frustrated phagocytosis” concept and suggest that neuronal–microglial communication link the two central AD pathologies.
Book Review: Jan Wouters, Antoon Braekman, Matthias Lievens, and Emilie Bécault (eds), Global Governance and Democracy: A Multidisciplinary Analysis

bullied by other countries. Foreign policy is not aggressive enough to make the world stand up and take notice of India and the diplomats are satisfied with making India dance to the tune of other great powers in the system. To take India out of this quagmire, Karnad presents a list of targeted solutions. These require India to actively engage with Central Asia, Africa, the Gulf and Southeast Asia. According to the author, to pursue ‘strategic autonomy’ as an end in itself instead of a means to an end is foolhardiness. I would categorise this book as an effort to make India act on the basis of the theory of ‘offensive realism’. The author is very convincing in his arguments and backs up his theory with hard facts. Karnad’s approach to make India a great power is steeped in pragmatism. However, one gets a feeling that his approach is not people-centric. Pursuing power for the sake of power and thereby making India a great power without being inclusive of the most marginalised people in the country is not a line of thinking many would be comfortable with.
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three

We study the model checking problem, for fixed structures A, over positive equality-free first-order logic -- a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(A). We prove a complete complexity classification for this problem when A ranges over 1. ) boolean structures and 2. ) digraphs of size (less than or equal to) three. The former class displays dichotomy between Logspace and Pspace-complete, while the latter class displays tetrachotomy between Logspace, NP-complete, co-NP-complete and Pspace-complete.
A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks

As advances in the technologies of predicting protein interactions, huge data sets portrayed as networks have been available. Identification of functional modules from such networks is crucial for understanding principles of cellular organization and functions. However, protein interaction data produced by high-throughput experiments are generally associated with high false positives, which makes it difficult to identify functional modules accurately. In this paper, we propose a fast hierarchical clustering algorithm HC-PIN based on the local metric of edge clustering value which can be used both in the unweighted network and in the weighted network. The proposed algorithm HC-PIN is applied to the yeast protein interaction network, and the identified modules are validated by all the three types of Gene Ontology (GO) Terms: Biological Process, Molecular Function, and Cellular Component. The experimental results show that HC-PIN is not only robust to false positives, but also can discover the functional modules with low density. The identified modules are statistically significant in terms of three types of GO annotations. Moreover, HC-PIN can uncover the hierarchical organization of functional modules with the variation of its parameter's value, which is approximatively corresponding to the hierarchical structure of GO annotations. Compared to other previous competing algorithms, our algorithm HC-PIN is faster and more accurate.
A Separator-Based Framework for Automated Partitioning and Mapping of Parallel Algorithms for Numeri

This paper is a report on ongoing work in developing automated systems for the partitioning, placement, and routing of data that is necessary for the e cient parallel solution of large problems in scienti c computing, speci cally the numerical solution of partial di erential equations. Many of these problems have as an iterated inner loop the formation of the product of a large sparse matrix and a vector of variables. This problem of sparse matrixvector multiplication has an underlying combinatorial graph structure that can be exploited. Using geometric information from the original problem, we can partition this combinatorial graph using provably good twoor three-dimensional graph sepThis research was supported in part by the Defense Advanced Research Projects Agency (DOD) monitored by DARPA/CMO under Contract MDA972{90{C{0035, the Air Force O ce of Scienti c Research under Contract F49620{92{J{0131, the Natural Sciences and Engineering Research Council of Canada under a 1967 Science and Engineering Scholarship, and the National Science Foundation under Grants CCR{8713489, CCR{9016641, DDM-9009597, and DDM-9114678. arators (depending on the dimension of the problem). The resulting partitions into subproblems have good load balancing properties and a relatively small amount of communication between subproblems. In order to develop e ective heuristics for the placement of these subproblems on the available processors and the routing of messages between them, we must also carefully consider the characteristics of the target architectures. The rst parallel machine we are considering is the iWarp system. The novel communication mechanism of the iWarp system allows us to draw an analogy between our placement and routing problem and certain area minimization problems in the eld of VLSI circuit layout, giving us an additional collection of insights and heuristics which can be brought to bear on our problem.
Social norms and physical activity in American and Canadian contexts: a scoping review

ABSTRACT Social norms are unwritten rules about how to behave in a group, and have been shown to impact health behaviour change. There are equivocal findings regarding social norms in the context of physical activity, which may be attributed to inconsistencies in their conceptualization and measurement. This scoping review explored the literature examining social norms as they relate to physical activity, with an emphasis on how researchers have conceptualized and measured social norms. A total of 137 articles were reviewed. The majority (n = 125, 91%) were grounded within the theory of planned behaviour (TPB) and varied considerably in their conceptualization and measurement of subjective norms. Studies not grounded within the TPB either measured (n = 5, 4%) or manipulated (n = 7, 5%) injunctive and descriptive norms. These results also allowed for the identification of future research considerations, including potential covariates (e.g. social support) and moderators (e.g. personality characteristics) that may help explain the equivocal findings regarding the role of subjective norms in promoting physical activity. Overall, the current review highlights several aspects that future researchers may consider when examining social norms and/or designing interventions for physical activity based on normative influences.
A New Allocation Scheme for Parallel Applications with Deadline and Security Constraints on Clusters

Parallel applications with deadline and security constraints are emerging in various areas like education, information technology, and business. However, conventional job schedulers for clusters generally do not take security requirements of realtime parallel applications into account when making allocation decisions. In this paper, we address the issue of allocating tasks of parallel applications on clusters subject to timing and security constraints in addition to precedence relationships. A task allocation scheme, or TAPADS (task allocation for parallel applications with deadline and security constraints), is developed to find an optimal allocation that maximizes quality of security and the probability of meeting deadlines for parallel applications. In addition, we proposed mathematical models to describe a system framework, parallel applications with deadline and security constraints, and security overheads. Experimental results show that TAPADS significantly improves the performance of clusters in terms of quality of security and schedulability over three existing allocation schemes
Source code plagiarism detection and performance analysis using fingerprint based distance measure method

In today's world, technological trends facilitate faster and easier communication between people any where in the world. Data search and exchange is one mouse click away from every people and this causes an exponential increase in the magnitude of plagiarism. Researches show that this is a serious problem in many academic institutions and research institutes. In this paper, we have developed an algorithm based on fingerprinting approach to identify the reuse of source codes in direct and indirect way. The results show that the proposed method is efficient in computation and resources and, provides effective measures to detect plagiarized programs. Effectiveness of the features used in the proposed methods is tested using a large database, including programs of different programming languages.
Bounds on the size of balls over permutations with the infinity metric

We study the size (or volume) of balls in the metric space of permutations, Sn, under the infinity metric. We focus on the regime of balls with radius r = ρ · (n-1), ρ ∈ [0, 1], i.e., a radius that is a constant fraction of the maximum possible distance. We provide new bounds on the size of such balls. These bounds reduce the asymptotic gap between the upper and lower bound to at most 0.06 bits per symbol.
Ambiguity Packing in Constraint-based Parsing Practical Results

We describe a novel approach to 'packing' of local ambiguity in parsing with a wide-coverage HPSG grammar, and provide an empirical assessment of the interaction between various packing and parsing strategies. We present a linear-time, bidirectional subsumption test for typed feature structures and demonstrate that (a) subsumption- and equivalence-based packing is applicable to large HPSG grammars and (b) average parse complexity can be greatly reduced in bottom-up chart parsing with comprehensive HPSG implementations.
Chaotic Desynchronization as the Therapeutic Mechanism of Deep Brain Stimulation

High frequency deep-brain stimulation of the subthalamic nucleus (deep brain stimulation, DBS) relieves many of the symptoms of Parkinson's disease in humans and animal models. Although the treatment has seen widespread use, its therapeutic mechanism remains paradoxical. The subthalamic nucleus is excitatory, so its stimulation at rates higher than its normal firing rate should worsen the disease by increasing subthalamic excitation of the globus pallidus. The therapeutic effectiveness of DBS is also frequency and intensity sensitive, and the stimulation must be periodic; aperiodic stimulation at the same mean rate is ineffective. These requirements are not adequately explained by existing models, whether based on firing rate changes or on reduced bursting. Here we report modeling studies suggesting that high frequency periodic excitation of the subthalamic nucleus may act by desynchronizing the firing of neurons in the globus pallidus, rather than by changing the firing rate or pattern of individual cells. Globus pallidus neurons are normally desynchronized, but their activity becomes correlated in Parkinson's disease. Periodic stimulation may induce chaotic desynchronization by interacting with the intrinsic oscillatory mechanism of globus pallidus neurons. Our modeling results suggest a mechanism of action of DBS and a pathophysiology of Parkinsonism in which synchrony, rather than firing rate, is the critical pathological feature.
Enhanced Negotiation-Based Routing In Wireless Sensor Networks

Wireless Sensor Networks are a collection of small sensor nodes which has the ability to sense, compute and communicate data through a wireless medium with the aim of providing human sensible information to man about his environment. This provision is subjected to different types of challenges overtime. SPIN family of protocols which was proposed to overcome major challenges of communication by negotiation and resource adaptation has being found inadequate in the handling of these problems. This paper proposes looked examined the SPIN family of protocols to reveal its incompleteness and proposed an enhancement based on the Negotiation-based protocols by modifying the procedures involved in negotiation.
An Update on Coronary Artery Disease and Chronic Kidney Disease

Despite the improvements in diagnostic tools and medical applications, cardiovascular diseases (CVD), especially coronary artery disease (CAD), remain the most common cause of morbidity and mortality in patients with chronic kidney disease (CKD). The main factors for the heightened risk in this population, beside advanced age and a high proportion of diabetes and hypertension, are malnutrition, chronic inflammation, accelerated atherosclerosis, endothelial dysfunction, coronary artery calcification, left ventricular structural and functional abnormalities, and bone mineral disorders. Chronic kidney disease is now recognized as an independent risk factor for CAD. In community-based studies, decreased glomerular filtration rate (GFR) and proteinuria were both found to be independently associated with CAD. This paper will discuss classical and recent epidemiologic, pathophysiologic, and clinical aspects of CAD in CKD patients.
Language and experience in the cognitive study of mysticism. Commentary on Forman

Formans theory outlined in Mysticism, language and the via negativa reacts against an earlier account of mysticism which he calls constructivism. Constructivism grew from a book of collected papers, Mysticism and philosophical analysis (1978), contributed to and edited by Steven Katz. According to Forman, the constructivist approach is, roughly, that of the historian [of ideas] (p. 39). But this characterization is much too generous. Katz himself thought he was using philosophy although, as anyone who looks at Katzs book can see, it goes no further than applying the most standard, narrow and lifeless forms of analytic/linguistic philosophy to mystic utterances. Whatever value analytic philosophy may have elsewhere, it would be difficult to find a tradition more inherently alien to the problems raised by mysticism. Mystic experience may or may not be totally beyond words, but virtually all mystics agree that language is especially resistant to capturing mystic insights; yet nothing could be more language-bound than the method Katz adopts. Relative to Katz & Co., Forman makes a great leap forward. Forman wants to get the experience back into the analysis of mysticism; he tries to make experience primary and linguistic aspects secondary  in this respect he makes a figure/ground reversal of Katzs position. Unfortunately, Formans theory pays a high price for having constructivism as its foil. Too much has rubbed off, and Formans concern with language is still, I think, obsessive. In Katz, mystic experience is the consequence of a pre-existing linguistic system: Katzs direction of analysis moves from concepts to experience, and Formans analysis moves in the same direction. In both cases, language-encoded concepts power the system, and mystic experience occurs as a kind of output. The difference lies in Formans notion of how the linguistic engine is supposed to work: Via negativa language serves a negative performative function: it seems designed to push the subject outside the limits of his or her linguistic system.  (p. 45) So while both theories focus on the linguistic activity supposedly preceding mystic experience, the via negativa model treats certain concepts as if they were like a computer virus: concepts relevant to mysticism can be introduced into the system, but they then work to disable the system which contains them. In general, via negativa language cannot be said to lend content to perception. Rather these utterances only serve to stop us from supplying content.  (p. 44, Formans emphasis) The language of the mystic:
Contributions of the Central Extended Amygdala to Fear and Anxiety

It is widely thought that phasic and sustained responses to threat reflect dissociable circuits centered on the central nucleus of the amygdala (Ce) and the bed nucleus of the stria terminalis (BST), the two major subdivisions of the central extended amygdala. Early versions of this hypothesis remain highly influential and have been incorporated into the National Institute of Mental Health Research Research Domain Criteria framework. However, new observations encourage a different perspective. Anatomical studies show that the Ce and BST form a tightly interconnected unit, where different kinds of threat-relevant information can be integrated and used to assemble states of fear and anxiety. Imaging studies in humans and monkeys show that the Ce and BST exhibit similar functional profiles. Both regions are sensitive to a range of aversive challenges, including uncertain or temporally remote threat; both covary with concurrent signs and symptoms of fear and anxiety; both show phasic responses to short-lived threat; and both show heightened activity during sustained exposure to diffusely threatening contexts. Mechanistic studies demonstrate that both regions can control the expression of fear and anxiety during sustained exposure to diffuse threat. These observations compel a reconsideration of the central extended amygdala's contributions to fear and anxiety and its role in neuropsychiatric disease.
OpenCCG Workbench and Visualization Tool

Combinatorial Category Grammar is (CCG) a lexicalized grammar formalism which is expressed by syntactic category, a logical form representation. There are difficulties in representing CCG without any visualization tools. This paper presents a design framework of OpenCCG workbench and visualization tool which enables linguists to develop CCG based lexicons more easily. Our research is aimed to resolve these gaps by developing a user-friendly tool. OpenCCG Workbench, an open source web-based environment, was developed to enable multiple users to visually create and update grammars for using with the OpenCCG library. It was designed to streamline and speed-up the lexicon building process, and to free the linguists from writing XML files which is both cumbersome and error-prone. The system consists of three sub-systems: grammar management system, grammar validator system, and concordance retrieval system. In this paper we will mainly discuss the most important parts, grammar management and validation systems, which are directly related to a CCG lexicon construction. We support users in three levels; Expert linguists who play a role as lexical entry designer, normal linguists who adds or edits lexicons, and guests who requires an acquisition to the lexicon into their applications.
Modeling and Evaluation of Dynamic Partial Reconfigurable Datapaths for FPGA-Based Systems Using Stochastic Networks

The dynamic partial reconfiguration of FPGAs is a method which modifies parts of FPGA configuration memory at run-time. The hardware resources and time overhead needed to perform a partial reconfiguration (PR) can significantly impact overall system cost and performance and must be considered early in the design cycle. Unfortunately, predicting reconfiguration overhead is difficult especially in the presence of non-deterministic factors such as the sharing of resources with traffic not related to the PR process. Thus, current design practices include the measurement of overhead but only after the system has been built thus limiting the number of candidates that can be evaluated. We propose a flexible approach for modeling the PR datapath based on Queueing Theory such that we can estimate performance trends and bottlenecks of the PR process while considering the impact of shared resources. Performance trends are provided for an example system to demonstrate the effectiveness of the approach.
GeoScale: Providing Geo-Elasticity in Distributed Clouds

Distributed cloud platforms are well suited for serving a geographically diverse user base. However traditional cloud provisioning mechanisms that make local scaling decisions are not well suited for temporal and spatial workload fluctuations seen by modern web applications. In this paper, we argue the need of geo-elasticity and present GeoScale, a system to provide geo-elasticity in distributed clouds. We describe GeoScale's model-driven proactive provisioning approach and conduct an initial evaluation of GeoScale on Amazon's distributed EC2 cloud. Our results show up to 31% improvement in the 95th percentile response time when compared to traditional elasticity techniques.
Reconstruction-Based Super-Resolution Using Self-Congruency around Image Edges

テレビやパソコンにおける表示,プリンタによる印 刷などの画素密度が増加し,画像の解像度感が画質を 決めるポイントの一つになっている. これら出力機器 に対して画像データの画素が少ない場合,事前に信号 処理により画素を増やす高解像度化技術が必要となる. 従来の高解像度化技術としては,双一次内挿法,あ るいは三次畳込み内挿法 [1]~[3]など標本化定理に基 づく補間フィルタを用いることが多かった. しかし, これらの手法では画素が増えた画像で表現が可能にな る高い周波数成分は生成されず,出力画像はぼやけた ものになってしまう. そこで,補間フィルタの改良が 検討され [4], [5],例えば,Kim らは,Winscale とい う面積画素モデルに基づく手法を提案した [6]. 簡単な 処理で最近傍内挿と双一次内挿の性質を併せもつ拡大 を行うが,高い解像度感は得られない. また,エッジ 適応型内挿法として,Liらは,高解像度化前後の画像 の局所共分散の双対性を利用した手法 [7]を,Battiato らは,画像の局所構造に応じて内挿に用いる画素を選 択する LAZAという手法 [8]を提案しているが,基本
Routing Overhead Reduction in MANETs

—Routing is one of the challenging issues in Mobile Ad hoc NETw orks (MANETs). Broadcasting is the fundamental and efficient data dissemination mechanism for route discovery in reactive routing protocols of Mobile Ad hoc NETw ork (MANET). This causes the problem called the broadcast storm problem w hich results in redundant retransmission and adds to routing overhead. There are many approaches proposed to solve the problem; but none of them addresses the problem effectively. This paper proposes a new mechanism that has probabilistic rebroadcast based on neighbor coverage for the routing overhead reduction. This proposed mechanism w ill reduces the packet retransmission and thus reduce the routing overhead. This approach combines the advantages of probabilistic mechanism and neighbor area coverage based approach. This new mechanism can improve the performance of broadcasting in various network scenarios. This approach is simple and can be implemented in NS-2.