Flexible and robust networks

We consider networks with two types of nodes. The v-nodes, called centers, are hyper- connected and interact one to another via many u-nodes, called satellites. This central- ized architecture, widespread in gene networks, possesses two fundamental properties. Namely, this organization creates feedback loops that are capable to generate practically any prescribed patterning dynamics, chaotic or periodic, or having a number of equilib- rium states. Moreover, this organization is robust with respect to random perturbations of the system.Comment: Journal of Bioinformatics and Computational Biology, in pres

Intracellular insulin in human tumors: examples and implications

Insulin is one of the major metabolic hormones regulating glucose homeostasis in the organism and a key growth factor for normal and neoplastic cells. Work conducted primarily over the past 3 decades has unravelled the presence of insulin in human breast cancer tissues and, more recently, in human non-small cell lung carcinomas (NSCLC). These findings have suggested that intracellular insulin is involved in the development of these highly prevalent human tumors. A potential mechanism for such involvement is insulin's binding and inactivation of the retinoblastoma tumor suppressor protein (RB) which in turn is likely controlled by insulin-degrading enzyme (IDE). This model and its supporting data are collectively covered in this survey in order to provide further insight into insulin-driven oncogenesis and its reversal through future anticancer therapeutics

A unified approach to mapping and routing on a network-on-chip for both best-effort and guaranteed service traffic

One of the key steps in Network-on-Chip-based design is spatial mapping of cores and routing of the communication between those cores. Known solutions to the mapping and routing problems first map cores onto a topology and then route communication, using separate and possibly conflicting objective functions. In this paper, we present a unified single-objective algorithm, called Unified MApping, Routing, and Slot allocation (UMARS+). As the main contribution, we show how to couple path selection, mapping of cores, and channel time-slot allocation to minimize the network required to meet the constraints of the application. The time-complexity of UMARS+ is low and experimental results indicate a run-time only 20% higher than that of path selection alone. We apply the algorithm to an MPEG decoder System-on-Chip, reducing area by 33%, power dissipation by 35%, and worst-case latency by a factor four over a traditional waterfall approach. U7 - Cited By (since 1996): 6 U7 - Export Date: 5 February 2010 U7 - Source: Scopus U7 - Art. No.: 6843

Diffuse Neutron Scattering Study of Magnetic Correlations in half-doped La0.5Ca0.5-xSrxMnO3 (x = 0.1, 0.3 and 0.4) Manganites

The short range ordered magnetic correlations have been studied in half doped La0.5Ca0.5-xSrxMnO3 (x = 0.1, 0.3 and 0.4) compounds by polarized neutron scattering technique. On doping Sr2+ for Ca2+ ion, these compounds with x = 0.1, 0.3, and 0.4 exhibit CE-type, mixture of CE-type and A-type, and A-type antiferromagnetic ordering, respectively. Magnetic diffuse scattering is observed in all the compounds above and below their respective magnetic ordering temperatures and is attributed to magnetic polarons. The correlations are primarily ferromagnetic in nature above T\_N, although a small antiferromagnetic contribution is also evident. Additionally, in samples x = 0.1 and 0.3 with CE-type antiferromagnetic ordering, superlattice diffuse reflections are observed indicating correlations between magnetic polarons. On lowering temperature below T\_N the diffuse scattering corresponding to ferromagnetic correlations is suppressed and the long range ordered antiferromagnetic state is established. However, the short range ordered correlations indicated by enhanced spin flip scattering at low Q coexist with long range ordered state down to 3K. In x = 0.4 sample with A-type antiferromagnetic ordering, superlattice diffuse reflections are absent. Additionally, in comparison to x = 0.1 and 0.3 sample, the enhanced spin flip scattering at low Q is reduced at 310K, and as temperature is reduced below 200K, it becomes negligibly low. The variation of radial correlation function, g(r) with temperature indicates rapid suppression of ferromagnetic correlations at the first nearest neighbor on approaching TN. Sample x = 0.4 exhibits growth of ferromagnetic phase at intermediate temperatures (~ 200K). This has been further explored using SANS and neutron depolarization techniques.Comment: 13 pages, 12 figures, To appear in Physical Review

Statistical Computations Underlying the Dynamics of Memory Updating

Psychophysical and neurophysiological studies have suggested that memory is not simply a carbon copy of our experience: Memories are modified or new memories are formed depending on the dynamic structure of our experience, and specifically, on how gradually or abruptly the world changes. We present a statistical theory of memory formation in a dynamic environment, based on a nonparametric generalization of the switching Kalman filter. We show that this theory can qualitatively account for several psychophysical and neural phenomena, and present results of a new visual memory experiment aimed at testing the theory directly. Our experimental findings suggest that humans can use temporal discontinuities in the structure of the environment to determine when to form new memory traces. The statistical perspective we offer provides a coherent account of the conditions under which new experience is integrated into an old memory versus forming a new memory, and shows that memory formation depends on inferences about the underlying structure of our experience.Templeton FoundationAlfred P. Sloan Foundation (Fellowship)National Science Foundation (U.S.) (NSF Graduate Research Fellowship)National Institute of Mental Health (U.S.) (NIH Award Number R01MH098861

Fast But Not Furious. When Sped Up Bit Rate of Information Drives Rule Induction

The language abilities of young and adult learners range from memorizing specific items to finding statistical regularities between them (item-bound generalization) and generalizing rules to novel instances (category-based generalization). Both external factors, such as input variability, and internal factors, such as cognitive limitations, have been shown to drive these abilities. However, the exact dynamics between these factors and circumstances under which rule induction emerges remain largely underspecified. Here, we extend our information-theoretic model (Radulescu et al., 2019), based on Shannon’s noisy-channel coding theory, which adds into the “formula” for rule induction the crucial dimension of time: the rate of encoding information by a time-sensitive mechanism. The goal of this study is to test the channel capacity-based hypothesis of our model: if the input entropy per second is higher than the maximum rate of information transmission (bits/second), which is determined by the channel capacity, the encoding method moves gradually from item-bound generalization to a more efficient category-based generalization, so as to avoid exceeding the channel capacity. We ran two artificial grammar experiments with adults, in which we sped up the bit rate of information transmission, crucially not by an arbitrary amount but by a factor calculated using the channel capacity formula on previous data. We found that increased bit rate of information transmission in a repetition-based XXY grammar drove the tendency of learners toward category-based generalization, as predicted by our model. Conversely, we found that increased bit rate of information transmission in complex non-adjacent dependency aXb grammar impeded the item-bound generalization of the specific a_b frames, and led to poorer learning, at least judging by our accuracy assessment method. This finding could show that, since increasing the bit rate of information precipitates a change from item-bound to category-based generalization, it impedes the item-bound generalization of the specific a_b frames, and that it facilitates category-based generalization both for the intervening Xs and possibly for a/b categories. Thus, sped up bit rate does not mean that an unrestrainedly increasing bit rate drives rule induction in any context, or grammar. Rather, it is the specific dynamics between the input entropy and the maximum rate of information transmission