Miracle-dz/UniFAR-FTUs huggingface dataset:
Regulation of adult neural progenitor cell functions by purinergic signaling

Extracellular purines are signaling molecules in the neurogenic niches of the brain and spinal cord, where they activate cell surface purinoceptors at embryonic neural stem cells (NSCs) and adult neural progenitor cells (NPCs). Although mRNA and protein are expressed at NSCs/NPCs for almost all subtypes of the nucleotide‐sensitive P2X/P2Y, and the nucleoside‐sensitive adenosine receptors, only a few of those have acquired functional significance. ATP is sequentially degraded by ecto‐nucleotidases to ADP, AMP, and adenosine with agonistic properties for distinct receptor‐classes. Nucleotides/nucleosides facilitate or inhibit NSC/NPC proliferation, migration and differentiation. The most ubiquitous effect of all agonists (especially of ATP and ADP) appears to be the facilitation of cell proliferation, usually through P2Y1Rs and sometimes through P2X7Rs. However, usually P2X7R activation causes necrosis/apoptosis of NPCs. Differentiation can be initiated by P2Y2R‐activation or P2X7R‐blockade. A key element in the transduction mechanism of either receptor is the increase of the intracellular free Ca2+ concentration, which may arise due to its release from intracellular storage sites (G protein‐coupling; P2Y) or due to its passage through the receptor‐channel itself from the extracellular space (ATP‐gated ion channel; P2X). Further research is needed to clarify how purinergic signaling controls NSC/NPC fate and how the balance between the quiescent and activated states is established with fine and dynamic regulation. GLIA 2017;65:213–230
Efficient production of bispecific IgG of different isotypes and species of origin in single mammalian cells

ABSTRACT Bispecific IgG production in single host cells has been a much sought-after goal to support the clinical development of these complex molecules. Current routes to single cell production of bispecific IgG include engineering heavy chains for heterodimerization and redesign of Fab arms for selective pairing of cognate heavy and light chains. Here, we describe novel designs to facilitate selective Fab arm assembly in conjunction with previously described knobs-into-holes mutations for preferential heavy chain heterodimerization. The top Fab designs for selective pairing, namely variants v10 and v11, support near quantitative assembly of bispecific IgG in single cells for multiple different antibody pairs as judged by high-resolution mass spectrometry. Single-cell and in vitro-assembled bispecific IgG have comparable physical, in vitro biological and in vivo pharmacokinetics properties. Efficient single-cell production of bispecific IgG was demonstrated for human IgG1, IgG2 and IgG4 thereby allowing the heavy chain isotype to be tailored for specific therapeutic applications. Additionally, a reverse chimeric bispecific IgG2a with humanized variable domains and mouse constant domains was generated for preclinical proof-of-concept studies in mice. Efficient production of a bispecific IgG in stably transfected mammalian (CHO) cells was shown. Individual clones with stable titer and bispecific IgG composition for >120 days were readily identified. Such long-term cell line stability is needed for commercial manufacture of bispecific IgG. The single-cell bispecific IgG designs developed here may be broadly applicable to biotechnology research, including screening bispecific IgG panels, and to support clinical development.
Neural decoding of visual stimuli varies with fluctuations in global network efficiency

Functional magnetic resonance imaging (fMRI) studies have shown that neural activity fluctuates spontaneously between different states of global synchronization over a timescale of several seconds. Such fluctuations generate transient states of high and low correlation across distributed cortical areas. It has been hypothesized that such fluctuations in global efficiency might alter patterns of activity in local neuronal populations elicited by changes in incoming sensory stimuli. To test this prediction, we used a linear decoder to discriminate patterns of neural activity elicited by face and motion stimuli presented periodically while participants underwent time-resolved fMRI. As predicted, decoding was reliably higher during states of high global efficiency than during states of low efficiency, and this difference was evident across both visual and non-visual cortical regions. The results indicate that slow fluctuations in global network efficiency are associated with variations in the pattern of activity across widespread cortical regions responsible for representing distinct categories of visual stimulus. More broadly, the findings highlight the importance of understanding the impact of global fluctuations in functional connectivity on specialised, stimulus driven neural processes.
Method and Analysis of Spectrally Compressed Radio Images for Mobile-Centric Indoor Localization

Large databases with Received Signal Strength (RSS) measurements are essential for various use cases in mobile wireless communications and navigation, including radio resource management algorithms and network-based localization. Because of the constantly increasing number of radio transmitters with various wireless technologies and with the advent of 5G cloud computing and Internet of Things (IoT), the required size of the RSS databases are becoming unmanageably large. Thus, the requirements for the bandwidth and data rates for accessing the memory might become too costly. Therefore, in order to reduce the size of the RSS database, while maintaining the data quality, we have previously proposed the method of spectrally compressed RSS images, which are able to achieve considerable data compression of up to 70 percent. In this paper, we deeply analyze the process of spectral compression and introduce error sources, which affect the compression performance. Based on the analysis, we propose a novel theoretical framework and methods to optimize the performance of the spectral compression. In addition, we derive the Cramér-Rao Lower Bound (CRLB) for the RSS-based localization error and compare the CRLB between separate baseline localization approaches. The theoretical analysis is justified and compared with experimental RSS measurements taken from several multi-storey buildings.
Tegra Time-evolving Graph Processing on Commodity Clusters

Graph-structured data is on the rise, in size, complexity and dynamism [1]. This growth has spurred the development of a large number of graph processing systems [5, 6, 8, 10– 12, 14, 16–18, 21, 24–27, 29] in both academia and opensource community. By leveraging specialized abstractions and careful optimizations, these systems have the ability to analyze large, static graphs, some in the order of trillion edges [9]. However, real-world graphs are seldom static. Consider, for instance, the familiar example of social network graphs such as in Facebook and Twitter. In such networks, “friends” relations, tweets with “mentions” are created continuously resulting in the graph’s constant evolution. The dynamic aspect of such graphsmakes it more difficult to answer questions like, “What are the trending topics at the moment? ”, or “Who was Bob’s most active friend in 2016? ”. In another example, cellular operators collect massive amounts of real-time data useful for network diagnostics [13]. We can also find evolving graphs in Internet of Things (IoT) applications such as connected cars [3], transaction graph in financial networks, and disease propagation graph. Mining these time-evolving graphs can be useful, from both scientific and commercial perspectives. Ideally, a system for time-evolving graph processing must be able to provide the same analysis abilities as that on static graphs, but on any arbitrary point or points in the history of the graph. Intuitively, a time-evolving graph can be seen as a series of static graphs, called snapshots. Thus, timeevolving graph processing systems must be able to support interactive ad-hoc, incremental and streaming analysis on any arbitrary snapshot, or snapshot windows. The big challenge in achieving this ability is in efficiently accessing arbitrary snapshots and performing computations on them. There are two main techniques to provide access to snapshots: (1) store each snapshot that the user might ask for, (2) log all changes to the graph (commonly referred as deltas), and then use these logs to compute the requested snapshots. Unfortunately,
Spreadsheets for business process management: Using process mining to deal with "events" rather than "numbers"?

Purpose Process mining provides a generic collection of techniques to turn event data into valuable insights, improvement ideas, predictions, and recommendations. This paper uses spreadsheets as a metaphor to introduce process mining as an essential tool for data scientists and business analysts. The purpose of this paper is to illustrate that process mining can do with events what spreadsheets can do with numbers. Design/methodology/approach The paper discusses the main concepts in both spreadsheets and process mining. Using a concrete data set as a running example, the different types of process mining are explained. Where spreadsheets work with numbers, process mining starts from event data with the aim to analyze processes. Findings Differences and commonalities between spreadsheets and process mining are described. Unlike process mining tools like ProM, spreadsheets programs cannot be used to discover processes, check compliance, analyze bottlenecks, animate event data, and provide operational process support. Pointers to existing process mining tools and their functionality are given. Practical implications Event logs and operational processes can be found everywhere and process mining techniques are not limited to specific application domains. Comparable to spreadsheet software widely used in finance, production, sales, education, and sports, process mining software can be used in a broad range of organizations. Originality/value The paper provides an original view on process mining by relating it to the spreadsheets. The value of spreadsheet-like technology tailored toward the analysis of behavior rather than numbers is illustrated by the over 20 commercial process mining tools available today and the growing adoption in a variety of application domains.
Highly Linear and Reconfigurable Three-Way Amplitude Modulation-Based Mixerless Wireless Transmitter

A novel transmitter architecture that uses only envelope modulators is proposed. The complex baseband signal is decomposed into components using a three-coordinate decomposition technique. The individual components are translated to RF using three variable gain amplifiers (VGAs), which act as envelope modulators. The outputs of the VGAs are combined to generate the complex modulated RF signal. The proposed architecture does not have any phase modulator circuit and avoids phase noise and bandwidth expansion issues associated with polar topologies. This architecture avoids the use of any mixers or quadrature up-converters for frequency up-conversion. Accordingly, spurs that are associated with mixer circuits are avoided and, hence, no filtering is needed at the RF output of the transmitter. As RF filters are absent, this architecture offers wider RF bandwidth and would improve the design reconfigurability and integration capability. The signal at the output of the amplitude modulation-based transmitter has distortion due to gain and phase nonlinearity in the VGAs. A new memory polynomial-based modeling approach is used to linearize the transmitter. The performance of the implemented transmitter is evaluated using Long Term Evolution (LTE) signals and the measured error vector magnitude (EVM) and the adjacent channel leakage-power ratio (ACLR) are used to assess the signal quality. The measured EVM of the LTE signal of 1.4 MHz bandwidth, improved from 15% to 0.5% using digital predistortion technique, while the obtained ACLR is 54 dBc.
A multi-objective multicast routing optimization based on differential evolution in MANET

Purpose The purpose of this paper is to propose a multi-objective differential evolution algorithm named as MOMR-DE to resolve multicast routing problem. In mobile ad hoc network (MANET), multicast routing is a non-deterministic polynomial -complete problem that deals with the various objectives and constraints. Quality of service (QoS) in the multicast routing problem mainly depends on cost, delay, jitter and bandwidth. So the cost, delay, jitter and bandwidth are always considered as multi-objective for designing multicast routing protocols. However, mobile node battery energy is finite and the network lifetime depends on node battery energy. If the battery power consumption is high in any one of the nodes, the chances of network’s life reduction due to path breaks are also more. On the other hand, node’s battery energy had to be consumed to guarantee high-level QoS in multicast routing to transmit correct data anywhere and at any time. Hence, the network lifetime should be considered as one objective of the multi-objective in the multicast routing problem. Design/methodology/approach Recently, many metaheuristic algorithms formulate the multicast routing problem as a single-objective problem, although it obviously is a multi-objective optimization problem. In the MOMR-DE, the network lifetime, cost, delay, jitter and bandwidth are considered as five objectives. Furthermore, three QoS constraints which are maximum allowed delay, maximum allowed jitter and minimum requested bandwidth are included. In addition, we modify the crossover and mutation operators to build the shortest-path multicast tree to maximize network lifetime and bandwidth, minimize cost, delay and jitter. Findings Two sets of experiments are conducted and compared with other algorithms for these problems. The simulation results show that our proposed method is capable of achieving faster convergence and is more preferable for multicast routing in MANET. Originality/value In MANET, most metaheuristic algorithms formulate the multicast routing problem as a single-objective problem. However, this paper proposes a multi-objective differential evolution algorithm to resolve multicast routing problem, and the proposed algorithm is capable of achieving faster convergence and more preferable for multicast routing.
Traffic congestion detection by use of satellites view

Traffic congestion in major cities is very common problem. Every modern city wants to handle this problem. Being stuck in traffic jam wastes so much time and money of citizens. Traffic congestion can be minimized by timely inform about its happening to the concerned department and also to incoming traffic. For this we proposed an approach in which we use satellites to detect cities traffic congestion on real time. This approach not only informs about congestion but also provides a broader view of cities traffic. Plenty of satellites are available around earth. High resolution video is taken from a specific point in space with satellites cameras. This video is further processed by using images processing techniques, and congestion is detected in real time. In result section we proved this idea successfully.
A General Analytical Formulation for the Motional Parameters of Piezoelectric MEMS Resonators

This paper reports on a general analytical expression for the motional resistance (<inline-formula> <tex-math notation="LaTeX">$R_{m}$ </tex-math></inline-formula>) of an arbitrary mode in a piezoelectric microelectromechanical system resonator with parallel plate electrode geometry. After applying simplifying assumptions and using analytical modes shapes, expressions for the <inline-formula> <tex-math notation="LaTeX">$R_{m}$ </tex-math></inline-formula> of modes with out-of-plane flexure as the primary displacement are presented. These modes include free–free transverse beam flexure (TBF), unclamped disk flexure resonators (DFRs), and antisymmetric <inline-formula> <tex-math notation="LaTeX">$A_{0}$ </tex-math></inline-formula> Lamb modes. For verification, <inline-formula> <tex-math notation="LaTeX">$R_{m}$ </tex-math></inline-formula> is extracted from resonators fabricated in a lead zirconate titanate on silicon process. Predicted <inline-formula> <tex-math notation="LaTeX">$R_{m}$ </tex-math></inline-formula> of TBF and DFR modes is validated using on-wafer extracted <inline-formula> <tex-math notation="LaTeX">$e_{31}$ </tex-math></inline-formula> constants, analytical modal properties, and independently measured material properties.
Motor cortex synchronization influences the rhythm of motor performance in premanifest huntington's disease

Background: In Huntington's disease there is evidence of structural damage in the motor system, but it is still unclear how to link this to the behavioral disorder of movement. One feature of choreic movement is variable timing and coordination between sequences of actions. We postulate this results from desynchronization of neural activity in cortical motor areas.
Moth-flame algorithm and loss sensitivity factor for optimal allocation of shunt capacitor banks in radial distribution systems

This paper presents an efficient hybrid method to solve the allocation problem of capacitor banks in radial distribution system (RDS). The presented method is based on two-stages. In the first stage, the most candidate locations for incorporating of shunt capacitors are determined using a loss sensitivity factor (LSF) and in second stage, the moth-flame optimization (MFO) algorithm is employed to determine the optimal sizes and locations of capacitors for to minimizing the energy cost. The presented method is validated using the standard 69-bus RDS under light, nominal and peak load levels. The obtained results using the proposed hybrid method are compared with those obtained from different reported optimization techniques in literature. Numerical results show the superiority of the proposed method over the other reported techniques for minimizing the cost in radial distribution system.
Systems Analysis of Adverse Drug Events

Objective. \p=m-\To identify and evaluate the systems failures that underlie errors causing adverse drug events (ADEs) and potential ADEs. Design. \p=m-\Systemsanalysis of events from a prospective cohort study. Participants. \p=m-\Alladmissions to 11 medical and surgical units in two tertiary care hospitals over a 6-month period. Main Outcome Measures. \p=m-\Errors,proximal causes, and systems failures. Methods. \p=m-\Errorswere detected by interviews of those involved. Errors were classified according to proximal cause and underlying systems failure by multidisciplinary teams of physicians, nurses, pharmacists, and systems analysts. Results. \p=m-\Duringthis period, 334 errors were detected as the causes of 264 preventable ADEs and potential ADEs. Sixteen major systems failures were identified as the underlying causes of the errors. The most common systems failure was in the dissemination of drug knowledge, particularly to physicians, accounting for 29% of the 334 errors. Inadequate availability of patient information, such as the results of laboratory tests, was associated with 18% of errors. Seven systems failures accounted for 78% of the errors; all could be improved by better information systems. Conclusions. \p=m-\Hospitalpersonnel willingly participated in the detection and investigation of drug use errors and were able to identify underlying systems failures. The most common defects were in systems to disseminate knowledge about drugs and to make drug and patient information readily accessible at the time it is needed. Systems changes to improve dissemination and display of drug and patient data should make errors in the use of drugs less likely. (JAMA. 1995;274:35-43)
Analyzing the LncRNA, miRNA, and mRNA Regulatory Network in Prostate Cancer with Bioinformatics Software

Information processing tools and bioinformatics software have significantly advanced researchers' ability to process and analyze biological data. Molecular data from human and model organism genomes help researchers identify topics for study, which, in turn, improves predictive accuracy, facilitates the identification of relevant genes, and simplifies the validation of laboratory data. The objective of this study was to explore the regulatory network constituted by long noncoding RNA (lncRNA), miRNA, and mRNA in prostate cancer (PCa). Microarray data of PCa were downloaded from The Cancer Genome Atlas database and DESeq package in R language were used to identify the differentially expressed genes (DEGs) between PCa and normal samples. Gene ontology enrichment analysis of DEGs was conducted using the Database for Annotation, Visualization, and Integrated Discovery. TargetScan, microcosm, miRanda, miRDB, and PicTar were used to predict target genes. LncRNA associated with PCa was exploited in the lncRNASNP database, and the LncRNA-miRNA-mRNA regulatory network was visualized using Cytoscape. Our study identified 57 differentially expressed miRNAs and 1252 differentially expressed mRNAs; of these, 691 were downregulated genes primarily involved in focal adhesion, vascular smooth muscle contraction, calcium signaling pathway, and so on. The remaining 561 were upregulated genes principally involved in systemic lupus erythematosus, progesterone-mediated oocyte maturation, oocyte meiosis, and so on. Through the integrated analysis of correlation and target gene prediction, our studies identified 1214 miRNA:mRNA pairs, including 52 miRNAs and 395 mRNAs, and screened out 455 lncRNA-miRNA pairs containing 52 miRNAs. Therefore, owing to the interrelationship of lncRNAs and miRNAs with mRNAs, our study screened out 19,075 regulatory relationships. Our data provide a comprehensive bioinformatics analysis of genes, functions, and pathways that may be involved in the pathogenesis of PCa.
Interactive Hesitation Synthesis: Modelling and Evaluation

Conversational spoken dialogue systems that interact with the user rather than merely reading the text can be equipped with hesitations to manage dialogue flow and user attention. Based on a series of empirical studies, we elaborated a hesitation synthesis strategy for dialogue systems, which inserts hesitations of a scalable extent wherever needed in the ongoing utterance. Previously, evaluations of hesitation systems have shown that synthesis quality is affected negatively by hesitations, but that they result in improvements of interaction quality. We argue that due to its conversational nature, hesitation synthesis needs interactive evaluation rather than traditional mean opinion score (MOS)-based questionnaires. To validate this claim, we dually evaluate our system’s speech synthesis component, on the one hand, linked to the dialogue system evaluation, and on the other hand, in a traditional MOS way. We are thus able to analyze and discuss differences that arise due to the evaluation methodology. Our results suggest that MOS scales are not sufficient to assess speech synthesis quality, leading to implications for future research that are discussed in this paper. Furthermore, our results indicate that synthetic hesitations are able to increase task performance and that an elaborated hesitation strategy is necessary to avoid likability issues.