Miracle-dz/UniFAR-FTUs huggingface dataset:
A Rice cis-Natural Antisense RNA Acts as a Translational Enhancer for Its Cognate mRNA and Contributes to Phosphate Homeostasis and Plant Fitness[C][W]

cis-natural antisense transcripts (cis-NAT) are widespread in plants and typically associated with transcriptional downregulation of their cognate sense gene. This works shows that a noncoding cis-NAT associated with the rice phosphate exporter gene PHO1;2 enhances translation of the sense PHO1;2 mRNA. Reduction of cis-NATPHO1;2 expression negatively impacts phosphate homeostasis and seed yield. cis-natural antisense transcripts (cis-NATs) are widespread in plants and are often associated with downregulation of their associated sense genes. We found that a cis-NAT positively regulates the level of a protein critical for phosphate homeostasis in rice (Oryza sativa). PHOSPHATE1;2 (PHO1;2), a gene involved in phosphate loading into the xylem in rice, and its associated cis-NATPHO1;2 are both controlled by promoters active in the vascular cylinder of roots and leaves. While the PHO1;2 promoter is unresponsive to the plant phosphate status, the cis-NATPHO1;2 promoter is strongly upregulated under phosphate deficiency. Expression of both cis-NATPHO1;2 and the PHO1;2 protein increased in phosphate-deficient plants, while the PHO1;2 mRNA level remained stable. Downregulation of cis-NATPHO1;2 expression by RNA interference resulted in a decrease in PHO1;2 protein, impaired the transfer of phosphate from root to shoot, and decreased seed yield. Constitutive overexpression of NATPHO1;2 in trans led to a strong increase of PHO1;2, even under phosphate-sufficient conditions. Under all conditions, no changes occurred in the level of expression, sequence, or nuclear export of PHO1;2 mRNA. However, expression of cis-NATPHO1;2 was associated with a shift of both PHO1;2 and cis-NATPHO1;2 toward the polysomes. These findings reveal an unexpected role for cis-NATPHO1;2 in promoting PHO1;2 translation and affecting phosphate homeostasis and plant fitness.
Scalable and Flexible heterogeneous multi-core system

Multi-core system has wide utility in today's applications due to less power consumption and high performance. Many researchers are aiming at improving the performance of these systems by providing flexible multi-core architecture. Flexibility in the multi-core processors system provides high throughput for uniform parallel applications as well as high performance for more general work. This flexibility in the architecture can be achieved by scalable and changeable- size window micro architecture. It uses the concept of execution locality to provide large-window capabilities. Use of high memory-level parallelism (MLP) reduces the memory wall. Micro architecture contains a set of small and fast cache processors which execute high locality code. A network of small in-order memory engines use low locality code to improve performance by using instruction level parallelism (ILP). Dynamic heterogeneous multi-core architecture is capable of reconfiguring itself to fit application requirements. Study of different scalable and flexible architectures of heterogeneous multi-core system has been carried out and has been presented.
A boosting approach for confidence scoring

In this paper we present the application of a boosting classification algorithm to confidence scoring. We derive feature vectors from speech recognition lattices and feed them into a boosting classifier . This classifier combines hundreds of very simple ‘weak learners’ and derives classification rules that can reduce the confidence error rate by up to 34%. We compare our results to those obtained using two other standard classification techniques, Support Vector Machines (SVMs) and Classification and Regression Trees (CART), and show significant improvements. Furthermore, the nature of the boosting algorithm allows us to combine the best single classifier and improve its performance. We present experimental results on real world corpora derived from the Compaq SpeechBot Web index and from the HUB4 DARPA evaluation sets. We believe these results have wide applicability to audio indexing and to acoustic and language modeling adaptation where word confide nce scores can be used in iterative adaptation schemes. In Eurospeech’2001
A Paradox of Syntactic Priming: Why Response Tendencies Show Priming for Passives, and Response Latencies Show Priming for Actives

Speakers tend to repeat syntactic structures across sentences, a phenomenon called syntactic priming. Although it has been suggested that repeating syntactic structures should result in speeded responses, previous research has focused on effects in response tendencies. We investigated syntactic priming effects simultaneously in response tendencies and response latencies for active and passive transitive sentences in a picture description task. In Experiment 1, there were priming effects in response tendencies for passives and in response latencies for actives. However, when participants' pre-existing preference for actives was altered in Experiment 2, syntactic priming occurred for both actives and passives in response tendencies as well as in response latencies. This is the first investigation of the effects of structure frequency on both response tendencies and latencies in syntactic priming. We discuss the implications of these data for current theories of syntactic processing.
Topological Schemas of Cognitive Maps and Spatial Learning

Spatial navigation in mammals is based on building a mental representation of their environment—a cognitive map. However, both the nature of this cognitive map and its underpinning in neural structures and activity remains vague. A key difficulty is that these maps are collective, emergent phenomena that cannot be reduced to a simple combination of inputs provided by individual neurons. In this paper we suggest computational frameworks for integrating the spiking signals of individual cells into a spatial map, which we call schemas. We provide examples of four schemas defined by different types of topological relations that may be neurophysiologically encoded in the brain and demonstrate that each schema provides its own large-scale characteristics of the environment—the schema integrals. Moreover, we find that, in all cases, these integrals are learned at a rate which is faster than the rate of complete training of neural networks. Thus, the proposed schema framework differentiates between the cognitive aspect of spatial learning and the physiological aspect at the neural network level.
Bidirectionally-Secure Cryptosystems

Protecting private keys is perhaps the most basic requirement of any cryptographic scheme. On the other hand, cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be trusted to maintain secrecy of the private key. We propose and investigate the notion of bidirectional security whose goal is to minimize the damage caused by secret-key exposure. In our model, the secret key(s) stored on the insecure device are refreshed at discrete time periods via interaction with a physically-secure — but computationally-limited — device which stores a “master key”. All cryptographic computations are still done on the insecure device, and the public key remains unchanged. In a -bidirectionally-secure scheme, an adversary who compromises the insecure device and obtains secret keys for up to periods of his choice is unable to violate the security of the cryptosystem for any of the remaining periods. Furthermore, the scheme remains secure (for all time periods) against an adversary who compromises only the physically-secure device. Bidirectionally-secure schemes significantly improve the security guarantee of forward-secure schemes [3, 5], in which exposure of the secret key at even a single time period (necessarily) compromises the security of the system for all future time periods. This improvement is achieved with minimal cost: infrequent key updates with a (possibly untrusted) secure device. We focus primarily on bidirectionally-secure public-key encryption. We construct a -bidirectionally-secure encryption scheme based on any (standard) public-key encryption scheme, and also give a more efficient construction based on the DDH assumption. Our second construction can be improved to achieve chosen-ciphertext security as well. dodis@cs.nyu. edu. Department of Computer Science, NYU. jkatz@cs.columbia. edu. Department of Computer Science, Columbia University. This work was done while the author was at Telcordia Technologies. shouhuai@yahoo.com. Department of Computer Science, George Mason University. moti@cs.columbia. edu. CertCo, Inc.
MAGMATISMO PÓS-PALEOZÓICO NO NORDESTE ORIENTAL DO BRASIL

Since the Jurassic, the area of Northeastern Brazil was affected by several magmatic events, both intrusive and effusive ones. The ages of the igneous bodies are not perfectly known, but it can be stated that some sedimentary basins accomodated prominent part of the geologic record from the igneous activity. The area north to the 8°S parallel was more intenselly affected, comprising deposits in the Parnaiba, Potiguar, and Lavras da Mangabeira basins. The occurrences are relatively scattered on Precambrian areas, restricted to zones very far from the Sao Francisco Craton. There are three main age groups. The Jure-Cretaceous bodies (pre-Aptian) are composed of tholeiitic basalts normally without olivine. The Albian and Tertiary ones usually exhibit modal olivine and alkaline composition. It seems that a quiet phase occurred comprising the Neocretaceous and the Paleocen. Based on aeromagnetic and geologic maps at a regional scale,it has been possible to show that some areas were strongly affected by igneous activity. Part of them can be followed along hundreds of kilometers, in a shape of igneous allignements. The most expressive are the Rio Ceara-Mirim, the Mecejana-Fernando de Noronha, both trending E-W, and Macau-Queimadas, trending NNW. The former is related to Neocomian, and the others belong to the Tertiary. There are no Quaternary igneous activity in the continental area, but some oceanic islands were evolved until the end of the tertiary.
Development of novel biosensors to study receptor-mediated activation of the G-protein α subunits Gs and Golf

Gαs (Gs) and Gαolf (Golf) are highly homologous G-protein α subunits that activate adenylate cyclase, thereby serving as crucial mediators of intracellular signaling. Because of their dramatically different brain expression patterns, we studied similarities and differences between their activation processes with the aim of comparing their receptor coupling mechanisms. We engineered novel luciferase- and Venus-fused Gα constructs that can be used in bioluminescence resonance energy transfer assays. In conjunction with molecular simulations, these novel biosensors were used to determine receptor activation–induced changes in conformation. Relative movements in Gs were consistent with the crystal structure of β2 adrenergic receptor in complex with Gs. Conformational changes in Golf activation are shown to be similar to those in Gs. Overall the current study reveals general similarities between Gs and Golf activation at the molecular level and provides a novel set of tools to search for Gs- and Golf-specific receptor pharmacology. In view of the wide functional and pharmacological roles of Gs- and Golf-coupled dopamine D1 receptor and adenosine A2A receptor in the brain and other organs, elucidating their differential structure–function relationships with Gs and Golf might provide new approaches for the treatment of a variety of neuropsychiatric disorders. In particular, these novel biosensors can be used to reveal potentially therapeutic dopamine D1 receptor and adenosine A2A receptor ligands with functionally selective properties between Gs and Golf signaling.
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}

In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a security reduction from LWE over general lattices. General lattices (as opposed to ideal lattices) do not have an inherent multiplicative structure but, using a tensorial product, Aguilar et al. managed to obtain a scheme allowing to compute products with a polylogarithmic amount of operands. In this paper we present an alternative construction allowing to compute products with polynomiallymany operands while preserving the security reductions of the initial scheme. Unfortunately, despite this improvement our construction seems to be incompatible with Gentry’s seminal transformation allowing to obtain fully-homomorphic encryption schemes. Recently, Brakerski et al. used the tensorial product approach introduced by Aguilar et al. in a new alternative way which allows to radically improve the performance of the obtained scheme. Based on this approach, and using two nice optimizations, their scheme is able to evaluate products with exponentially-many operands and can be transformed into an efficient fully-homomorphic encryption scheme while being based on general lattice problems. However, even if these results outperform the construction presented here, we believe the modifications we suggest for Aguilar et al.’s schemes are of independent interest.
Obstructive Sleep Apnea and Serious Adverse Outcomes in Patients with Cardiovascular or Cerebrovascular Disease

AbstractObstructive sleep apnea (OSA) is seen in approximately 60% to 70% of patients with stroke or ischemic heart disease (IHD). The relationship between OSA and recurrent vascular events and all-cause mortality remains inconclusive. We aimed to systematically evaluate the associations between OSA and serious adverse outcomes following stroke or IHD by a meta-analysis of prospective cohort studies.We searched MEDLINE and EMBASE in August 2014 for studies that evaluated the prospective associations between OSA and the risk of stroke, IHD, and death among stroke or IHD patients. Outcome data were pooled using random effects meta-analysis. Subgroup, heterogeneity, and sensitivity analyses and publication bias were performed.Of 13 hospital-based cohort studies included, 5 reported results on stroke (n = 860), 6 reported on IHD (n = 1083), and 11 reported on all-cause death or cardiovascular death (n = 1930). OSA was significantly associated with the risk of stroke, IHD, and all-cause mortality after stroke or IHD. The pooled relative risks were 1.94 (95% confidence interval [CI], 1.29–2.92) for stroke, 1.83 (95% CI, 1.15–2.93) for IHD, and 1.59 (95% CI, 1.33–1.89) for all-cause mortality. There was no evidence of significant between-study heterogeneity. The results did not materially change in the sensitivity analyses for the outcomes of stroke and all-cause mortality.OSA may be a significant predictor of serious adverse outcomes following stroke or IHD. More high-quality studies are needed to determine if better treatment of OSA leads to fewer recurrent vascular events, especially a large-scale, multicenter randomized-controlled trial.
Q-value functions for decentralized POMDPs

Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by dynamic programming, and then a policy is extracted from this value function. In this paper we study whether similar Q-value functions can be defined in decentralized POMDP models (Dec-POMDPs), what the cost of computing such value functions is, and how policies can be extracted from such value functions. Using the framework of Bayesian games, we argue that searching for the optimal Q-value function may be as costly as exhaustive policy search. Then we analyze various approximate Q-value functions that allow efficient computation. Finally, we describe a family of algorithms for extracting policies from such Q-value functions.
Human Motion Tracking by Registering an Articulated Surface to 3D Points and Normals

We address the problem of human motion tracking by registering a surface to 3-D data. We propose a method that iteratively computes two things: Maximum likelihood estimates for both the kinematic and free-motion parameters of an articulated object, as well as probabilities that the data are assigned either to an object part, or to an outlier cluster. We introduce a new metric between observed points and normals on one side, and a parameterized surface on the other side, the latter being defined as a blending over a set of ellipsoids. We claim that this metric is well suited when one deals with either visual-hull or visual-shape observations. We illustrate the method by tracking human motions using sparse visual-shape data (3-D surface points and normals) gathered from imperfect silhouettes.
A systematic writing program as a tool in the grief process: part 1

Objective: The basic aim of this paper is to suggest a flexible and individualized writing program as a tool for use during the grief process of bereaved adults. Methods: An open, qualitative approach following distinct steps was taken to gain a broad perspective on the grief and writing processes, as a platform for the writing program. Results: Following several systematic methodological steps, we arrived at suggestions for the initiation of a writing program and its structure and substance, with appropriate guidelines. Discussion: We believe that open and expressive writing, including free writing and focused writing, may have beneficial effects on a person experiencing grief. These writing forms may be undertaken and systematized through a writing program, with participation in a grief writing group and with diary writing, to achieve optimal results. Conclusion: A structured writing program might be helpful in promoting thought activities and as a tool to increase the coherence and understanding of individuals in the grief process. Our suggested program may also be a valuable guide to future program development and research.
Systems with selective overflow and change of bandwidth

We consider a loss system with n channels and a finite or infinite overflow group, which is offered N different services, all having Poisson arrival processes. All calls have same bandwidth demand and mean service time, but the mean service time may be different on the primary group and the overflow group, corresponding to data traffic with different bandwidth allocation on primary (micro-cell = femto-cell) and overflow group (macro-cell = LTE-cell). Then using a result of Wallström we can calculate the Binomial moments of the total overflow traffic. Given a certain number of busy channels on the overflow group, we show by balance equations that the number of calls of each service will be Multinomial distributed with probabilities proportional with the arrival rates. Using a recent result of Newcomer & al, we then find moments (done up to fourth order) of individual overflow streams or any combinations of overflow streams. Thus we can find the correlation between services and for example the moments of some traffic streams which may overflow to one system, whereas other traffic streams may be blocked or overflow to another system.
Detector generation algorithm for self-nonself detection in Artificial Immune System

In this paper a new algorithm for detector generation for self-nonself detection in Artificial Immune System is presented. The algorithm is inspired from the Negative Selection process of T cell maturation process in Biological Immune System. This algorithm is applicable where data are represented in the form of strings. R-chunk matching rule is used while checking two strings whether match or not. The algorithm is analyzed and compared with other relevant existing algorithms for detector generation.
Characterizing task-oriented dialog using a simulated ASR chanel

We describe a data collection consisting of task-oriented human-human conversations in a simulated ASR channel in which the WER is systematically varied. We find that users infrequently give a direct indication of having been misunderstood; levels of expert “initiative” increase with WER primarily due to increased grounding activity; and asking task-related questions appears to be a more successful repair strategy at moderate WER levels. A PARADISE analysis finds task completion most predictive of user satisfaction; efficiency is also important at lower WERs.
Hierarchical Solution of Markov Decision Processes using Macro-actions

We investigate the use of temporally abstract actions, or macro-actions, in the solution of Markov decision processes. Unlike current models that combine both primitive actions and macro-actions and leave the state space unchanged, we propose a hierarchical model (using an abstract MDP) that works with macro-actions only, and that significantly reduces the size of the state space. This is achieved by treating macroactions as local policies that act in certain regions of state space, and by restricting states in the abstract MDP to those at the boundaries of regions. The abstract MDP approximates the original and can be solved more efficiently. We discuss several ways in which macro-actions can be generated to ensure good solution quality. Finally, we consider ways in which macro-actions can be reused to solve multiple, related MDPs; and we show that this can justify the computational overhead of macro-action generation.
Test on the Validity of Futures Market's High Frequency Volume and Price on Forecast

Trading via a high-frequency data is becoming one of the hottest researches field at home and abroad. There are many factors that influence price movements, including price, volume and positions, etc. Using high-frequency data of Share Price Index Futures (SPIF) to construct different variables, and then using decision tree model to forecast price movement and the prediction accuracy can reach 70%. The study has found that moving average price movements has considerable importance in the forecast, and trading volumes and position changes on the price forecasting plays limited role.