Miracle-dz/UniFAR-FTUs huggingface dataset:
Role of a Genetic Polymorphism in the Corticotropin-Releasing Factor Receptor 1 Gene in Alcohol Drinking and Seeking Behaviors of Marchigian Sardinian Alcohol-Preferring Rats

Marchigian Sardinian alcohol-preferring (msP) rats exhibit innate preference for alcohol, are highly sensitive to stress and stress-induced alcohol seeking. Genetic analysis showed that over-expression of the corticotropin-releasing factor (CRF) system of msP rats is correlated with the presence of two single nucleotide polymorphisms (SNPs) occurring in the promoter region (position −1836 and −2097) of the CRF1 receptor (CRF1-R) gene. Here we examined whether these point mutations were associated to the innate alcohol preference, stress-induced drinking, and seeking. We have recently re-derived the msP rats to obtain two distinct lines carrying the wild type (GG) and the point mutations (AA), respectively. The phenotypic characteristics of these two lines were compared with those of unselected Wistar rats. Both AA and GG rats showed similar patterns of voluntary alcohol intake and preference. Similarly, the pharmacological stressor yohimbine (0.0, 0.625, 1.25, and 2.5 mg/kg) elicited increased operant alcohol self-administration under fixed and progressive ratio reinforcement schedules in all three lines. Following extinction, yohimbine (0.0, 0.625, 1.25, and 2.5 mg/kg) significantly reinstated alcohol seeking in the three groups. However, at the highest dose this effect was no longer evident in AA rats. Treatment with the CRF1-R antagonist antalarmin (0, 5, 10, and 20 mg/kg) significantly reduced alcohol-reinforced lever pressing in the AA line (10 and 20 mg/kg) while a weaker or no effect was observed in the Wistar and the GG group, respectively. Finally, antalarmin significantly reduced yohimbine-induced increase in alcohol drinking in all three groups. In conclusion, these specific SNPs in the CRF1-R gene do not seem to play a primary role in the expression of the msP excessive drinking phenotype or stress-induced drinking but may be associated with a decreased threshold for stress-induced alcohol seeking and an increased sensitivity to the effects of pharmacological blockade of CRF1-R on alcohol drinking.
Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic

In this paper, we consider link-and-node failure recovery in dynamic multicast traffic in WDM networks. We extend the node protection concept of the p-cycle approach to achieve more efficient resource utilization. Then, we propose a novel algorithm that integrates our concept for the node protection, named node-and-link protecting p-cycle based algorithm (NPC). We also propose a second algorithm, named node-and-link protecting candidate p-cycle based algorithm (NPCC). This algorithm deploys our concept for node protection and relies on a candidate p-cycle set to speed up the computational time. We compare our proposed algorithms to the ESHN algorithm, which is reported to be the most efficient algorithm for protecting dynamic multicast sessions. Extensive simulations show that the NPC algorithm achieves the lowest blocking probability, but has the highest computational time among the NPCC and ESHN algorithms. The NPCC algorithm outperforms the ESHN algorithm in terms of resource utilization efficiency and computational time.
How Laramide-Age Hydration of North American Lithosphere by the Farallon Slab Controlled Subsequent Activity in the Western United States

Starting with the Laramide orogeny and continuing through the Cenozoic, the U.S. Cordilleran orogen is unusual for its width, nature of uplift, and style of tectonic and magmatic activity. We present teleseismic tomography evidence for a thickness of modified North America lithosphere <200 km beneath Colorado and >100 km beneath New Mexico. Existing explanations for uplift or magmatism cannot accommodate lithosphere this thick. Imaged mantle structure is low in seismic velocity roughly beneath the Rocky Mountains of Colorado and New Mexico, and high in velocity to the east and west, beneath the tectonically intact Great Plains and Colorado Plateau. Structure internal to the low-velocity volume has a NE grain suggestive of influence by inherited Precambrian sutures. We conclude that the high-velocity upper mantle is Precambrian lithosphere, and the lowvelocity volume is partially molten Precambrian North America mantle. We suggest, as others have, that the Farallon slab was in contact with the lithosphere beneath most of the western U.S. during the Laramide orogeny. We further suggest that slab de-watering under the increasingly cool conditions of slab contact with North America hydrated the base of the continental lithosphere, causing a steady regional uplift of the western U.S. during the Laramide orogeny. Imaged low-velocity upper mantle is attributed to hydration-induced lithospheric melting beneath much of the southern Rocky Mountains. Laramide-age magmatic ascent heated and weakened the lithosphere, which in turn allowed horizontal shortening to occur in the mantle beneath the region of Laramide thrusting in the southern Rocky Mountains. Subsequent Farallon slab removal resulted in additional uplift through unloading. It also triggered vigorous magmatism, especially where asthenosphere made contact with the hydrated and relatively thin and fertile lithosphere of what now is the Basin and Range. This mantle now is dry, depleted of basaltic components, hot, buoyant, and weak.
Algorithm for Prediction of Links using Sentiment Analysis in Social Networks

Social network being one of the most disruptive innovation has gathered a huge amount of attention of the people within the last decade. The posts of the users on the social media are used by many companies in the world to find the mentality of the users, the current trend of the market and many more things. But still there is a latent potential in social network. One of the aspect that we were able to discover was of finding the relationship between the users (especially, the negative link) on the social network using the posts that the users make and the reaction of the other users towards it. The prediction of negative link can be applied in cyber-security field, to observe the aberrations in the network and further find the malicious nodes in the social network; say, if two nodes are are having a link between them even though there is no relation between them. It can also be used for improving the recommendation system in social media, as if there is some probability between the two nodes of being enemy or disliking each other then we can remove them from each other's recommendation list or could assign a lower weight to them in our recommendation algorithm. To achieve all this relationship between the nodes we first need to find whether the user is posting posts with positive emotion (like happy, excited, etc.) or negative emotion (like angry, sad, etc.) so that we can further analyze the mentality of the user and use it to recommend the people who we have previously classified with the similar personality. For that we have used the sentimental analysis which divides the users into five simple categories: Highly Positive, Positive, Neutral, Negative and Highly Negative. This research paper explains the methodologies that we have used to achieve the prediction of negative links between the nodes in the social network.
Diabetic Nephropathy: Mechanisms of Renal Disease Progression

Diabetic nephropathy is characterized by excessive amassing of extracellular matrix (ECM) with thickening of glomerular and tubular basement membranes and increased amount of mesangial matrix, which ultimately progress to glomerulosclerosis and tubulo-interstitial fibrosis. In view of this outcome, it would mean that all the kidney cellular elements, i.e., glomerular endothelia, mesangial cells, podocytes, and tubular epithelia, are targets of hyperglycemic injury. Conceivably, high glucose activates various pathways via similar mechanisms in different cell types of the kidney except for minor exceptions that are related to the selective expression of a given molecule in a particular renal compartment. To begin with, there is an obligatory excessive channeling of glucose intermediaries into various metabolic pathways with generation of advanced glycation products (AGEs), activation of protein kinase C (PKC), increased expression of transforming growth factor-β (TGF-β), GTP-binding proteins, and generation of reactive oxygen species (ROS). The ROS seem to be the common denominator in various pathways and are central to the pathogenesis of hyperglycemic injury. In addition, there are marked alterations in intraglomerular hemodynamics, i.e., hyperfiltration, and this along with metabolic derangements adversely compounds the hyperglycemia-induced injury. Here, the information compiled under various subtitles of this article is derived from an enormous amount of data summarized in several excellent literature reviews, and thus their further reading is suggested to gain in-depth knowledge of each of the subject matter.
Recurrent choking in Parkinson’s disease

A 77-year-old man, with a long history of idiopathic Parkinson’s disease, was reviewed in the movement disorder clinic of the James Cook University Hospital. He had first presented to the neurological services 17 years previously with an asymmetrical, progressive upper limb tremor and associated rigidity. He had an otherwise unremarkable medical history. He had had a good and sustained response to l-dopa and dopamine agonists over the years, although increasing doses were ultimately limited by the late development of dyskinesia, somnolence and visual hallucinations. No atypical features were noted at first presentation, or on subsequent follow-up. Fourteen years after the diagnosis, in 2004, he began to deteriorate with falls and worsening mobility. His swallowing also became more difficult, with subsequent aspiration, fear of eating and weight loss. A percutaneous endoscopic gastrostomy (PEG) tube was placed, without complication, and to good effect. In the 12 months prior to admission, and pre-dating PEG insertion by six months, he described “choking” episodes when asleep, about six times a night and becoming more frequent. His carer described noisy nocturnal inspiration and expiration when asleep, and paroxysms when he would “go white, then red and blue and his eyes would bulge out. ” He found these episodes very distressing. In addition, he complained of daytime somnolence and his carer described pugilistic limb movements while asleep, suggestive of REM-sleep behaviour disorder. Medication at this time consisted of l-dopa (Sinemet), amantadine, citalopram, low-dose amitriptyline, omeprazole and a buprenorphine patch for arthritic pain. There had been no exposure to atypical neuroleptics or anti-emetics. There were no symptoms of …
Largest Placements and Motion Planning of a Convex Polygon

We study two problems involving collision-free placements of a convex m-gon P in a planar polygonal environment: (i) We rst show that the largest similar copy of P inside another convex polygon Q with n edges can be computed in O(mn 2 log n) time. We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O(mn 2), and that it can also be computed in O(mn 2 log n) time. (ii) We then consider the case where Q is an arbitrary polyg-onal environment with n edges. We give the rst (and relatively simple) algorithm that constructs the entire free connguration space (the 3-dimensional space of all free placements of P in Q) in time that is near-0 quadratic in mn, which is nearly optimal in the worst case. Previous solutions of the second problem were either incomplete, more expensive, or produced only part of the free connguration space. Combining our solution with parametric searching, we obtain an algorithm that nds the largest placement of P in Q in time that is also near-quadratic in mn. In addition, we describe an algorithm that preprocesses the computed free connguration space so that`reachability' queries can be answered in polylogarithmic time.
The Hubble operator in isotropic loop quantum cosmology

We present a construction of the Hubble operator for spatially flat isotropic loop quantum cosmology. This operator is a Dirac observable on a subspace of the space of physical solutions. This subspace gets selected dynamically, requiring that its action be invariant on the physical solution space. As a simple illustrative application of the expectation value of the operator, we find a generic phase of (super)inflation, a feature shown by Bojowald [1] from the analysis of the effective Friedmann equation of loop quantum cosmology.
Chapel : Cascade High-Productivity Language An Overview of the Chapel Parallel Programming Model ∗

Chapel, which stands for Cascade High-Productivity Language, is a new parallel programming language being developed at Cray Inc. as part of Cascade, a project at Cray funded by the DARPA High-Productivity Computing Systems (HPCS) program. This paper will overview Chapel’s parallel programming model, discuss its dataand task-parallel language abstractions, and show how the abstractions can be composed, allowing the programmer to write simple programs that, if written with today’s most popular parallel programming facilities, would be complex, difficult-to-maintain codes.
An insight into motor and battery selections for three-wheeler electric vehicle

Three-wheelers are the most common mode of public transport used for last mile commute in several countries. Three-wheeler EVs are becoming popular nowadays, but there are no guidelines or standards to arrive at the motor and battery specifications. In this paper, an attempt is made to fill this gap by simulating a three-wheeler EV with all possible parameters to calculate the torque and power requirements of the motor and also the battery capacity. Because of its high efficiency and availability, most of the three-wheeler EVs are driven by permanent magnet brushless dc (PM BLDC) motors. Lead acid and lithium-ion batteries can be used to power these EVs. A methodology to arrive at the motor and battery specifications of a typical three-wheeler EV for the selected drive cycle is given for the cases of direct drive and geared drive. Simulations have been carried out after considering for the continuous and short time loadings of the drive in conformity with the RMS and peak rating of the EV drive motor. A detailed comparison between the lead acid and lithium-ion batteries powered three-wheeler EVs has been brought out.
An avoidance strategy for mobile robot in complex environment

This paper presents an avoidance strategy for the robot to find the optimal trajectory to reach the target point in a complex environment. First, The robot's movement function is presented from the following three aspects. The first is that the robot motion must be in designated areas; the second is that the robot can reach the target location by the dynamic obstacle avoidance; and the third is the shortest movement path of the robot is guaranteed. Second, the conditions of the setting for the robot path optimization are given: they are the value of individual adaptation, re-optimization of path and mutation of movement strategy. The last, simulation results show that the proposed method is feasible.
New Training Methods for RBF Neural Networks

Radial basis function neural networks have been proposed as powerful tools in many applications. Existing training algorithms suffer from some restrictions such as slow convergence and/or encountering to bias in parameter convergence. This paper is an attempt to improve the above problems by proposing new parameter initializing, pre-training and post-training methods to reach better capabilities in learning time and desired precision compared to previous RBF networks
Quantum mechanical inspired factorization of the molecule pair propagator in theories of diffusion-influenced reactions

Building on mathematical similarities between quantum mechanics and theories of diffusion-influenced reactions, we discuss how the propagator of a reacting molecule pair can be represented as a product of three factors in the Laplace domain. This representation offers several advantages. First, the full propagator can be calculated without ever having to solve the corresponding partial differential equation or path integral. Second, the representation is quite general and capable of capturing not only the classical Smoluchowski-Collins-Kimball model, but also alternative theories, as is here exemplified by the case of a delta- and step-function potential in one and two dimensions, respectively. Third, the three factors correspond to physical quantities that feature prominently in stochastic spatially-resolved simulation algorithms and hence the interpretation of current and the design of future algorithms may benefit. Finally, the representation may serve as a suitable starting point for numerical approximations that could be employed to enhance the efficiency of stochastic simulations.
Dynamic capacity modeling with multiple re-entrant workflows in semiconductor assembly manufacturing

It is very challenging to gain competitive advantages in Flash assembly manufacturing mainly due to: widely and quickly fluctuating customer requests; with complicated workflows; and co-existence of new technology/equipment and legacy ones. In later 2003, Intel experienced capacity degradation mainly due to the introduction of multiple-chip products (MCP) with re-entrant workflows. We timely re-engineered our factory and generated new methodologies to achieve breakthrough operational excellence. We extended theory of constraints (TOC) to solve the problem of multiple bottlenecks, and developed the dynamic capacity model that captures variability of re-entrant manufacturing systems. Protective capacity (PC) and other parameters at constrained and near-constrained stations are regularly tracked and adjusted to accurately reflect line execution variability in terms of equipment, staff, and WIP. With the implementation and continuous improvement of these methodologies, we increase the factory output by 200% without major capital investment (avoiding millions of capital spending), we maintain 100% volume pass and line item pass for 41 weeks and still counting, and we achieve 30% unit cost cut and brought down subcon price by 26%, which results in over a dozen of millions of dollar cash saving for Intel.
A Unified Approach to Multiuser Detection and Space-Time Coding with Low Complexity and Nearly Optimal Performance1

Techniques using interleaving as the basic means for signal separation are introduced for both multiple access systems and multiple transmit antenna systems. For multiple access channels, the proposed interleave-division multiple-access (IDMA) scheme can achieve near capacity performance. For multiple antenna systems, the performance of the proposed interleave-division-multiplexing space-time (IDM-ST) codes is close to the socalled canonical performance, which is a theoretical measurement of full transmit diversity. Both IDMA and IDM-ST schemes are characterized by very low receiver complexity and are inherently asynchronous.
Steady States and Oscillations in the p53/Mdm2 Network

p53 is activated in response to events compromising the genetic integrity of a cell. Recent data show that p53 activity does not increase steadily with genetic damage but rather fluctuates in an oscillatory fashion (Lahav et al., Nature Genetics, 36, 147-150, 2004). Theoretical studies suggest that oscillations can arise from a combination of positive and negative feedbacks or from a long negative feedback loop alone. Both negative and positive feedbacks are present in the p53/Mdm2 network, but it is not known what roles they play in the oscillatory response to DNA damage. We developed a mathematical model of p53 oscillations based on positive and negative feedbacks in the p53/Mdm2 network. According to the model, the system reacts to DNA damage by moving from a stable steady state into a region of stable limit cycles. Oscillations in the model are born with large amplitude, which guarantees an all-or-none response to damage. As p53 oscillates, damage is repaired and the system moves back to a stable steady state with low p53 activity. The model reproduces experimental data in quantitative detail. We suggest new experiments for dissecting the contributions of negative and positive feedbacks to the generation of oscillations.
Semantic based Document Clustering: A Detailed Review

Document clustering, one of the traditional data mining techniques, is an unsupervised learning paradigm where clustering methods try to identify inherent groupings of the text documents, so that a set of clusters is produced in which clusters exhibit high intra-cluster similarity and low intercluster similarity. The importance of document clustering emerges from the massive volumes of textual documents created. Although numerous document clustering methods have been extensively studied in these years, there still exist several challenges for increasing the clustering quality. Particularly, most of the current document clustering algorithms does not consider the semantic relationships which produce unsatisfactory clustering results. Since last three-four years efforts have been seen in applying semantics to document clustering. Here, an exhaustive and detailed review of more than thirty semantic driven document clustering methods is presented. After an introduction to the document clustering and its basic requirements for improvement, traditional algorithms are overviewed. Also, semantic similarity measures are explained. The article then discusses algorithms that make semantic interpretation of documents for clustering. The semantic approach applied, datasets used, evaluation parameters applied, limitations and future work of all these approaches is presented in tabular format for easy and quick interpretation.
Design flow for embedded FPGAs based on a flexible architecture template

Modern digital signal processing applications have an increasing demand for computational power while needing to preserve low power dissipation and high flexibility. For many applications, the growth of algorithmic complexity is already faster than the growth of computational power provided by discrete general purpose processors. A typical approach to address this problem is the combination of a processor core with dedicated accelerators. Since changes in standards or algorithms can change the demands on the accelerators, an attractive alternative to highly customised VLSI- macros is the use of reconfigurable embedded FPGAs (eFPGAs). First commercial products combining a general purpose processor core and an embedded FPGA recently emerged (e.g. Stretch S6000 Menta eFPGA- augmented CPUs). For many digital signal processing applications, a significantly improved efficiency in terms of power dissipation, throughput and chip area can be achieved by tailoring both the processor core and the reconfigurable accelerator to the given application domain. In this work, a methodology to design highly customisable eFPGA-architectures starting from a high level description is presented. The design framework elaborated during this work enables a physically optimised VLSI-design of the specified eFPGA and aims to support simulation of the according eFPGA-macros both on a functional and netlist-level by providing an elementary configuration tool based on the same high level description as the eFPGA-architecture.