59 resultados para COMPLEX INVOLVEMENT
Resumo:
Quantitative linguistics has provided us with a number of empirical laws that characterise the evolution of languages and competition amongst them. In terms of language usage, one of the most influential results is Zipf’s law of word frequencies. Zipf’s law appears to be universal, and may not even be unique to human language. However, there is ongoing controversy over whether Zipf’s law is a good indicator of complexity. Here we present an alternative approach that puts Zipf’s law in the context of critical phenomena (the cornerstone of complexity in physics) and establishes the presence of a large-scale “attraction” between successive repetitions of words. Moreover, this phenomenon is scale-invariant and universal – the pattern is independent of word frequency and is observed in texts by different authors and written in different languages. There is evidence, however, that the shape of the scaling relation changes for words that play a key role in the text, implying the existence of different “universality classes” in the repetition of words. These behaviours exhibit striking parallels with complex catastrophic phenomena.
Resumo:
Los sistemas de radio cognitivos son una solución a la deficiente distribución del espectro inalámbrico de frecuencias. Usando acceso dinámico al medio, los usuarios secundarios pueden comunicarse en canales de frecuencia disponibles, mientras los usuarios asignados no están usando dichos canales. Un buen sistema de mensajería de control es necesario para que los usuarios secundarios no interfieran con los usuarios primarios en las redes de radio cognitivas. Para redes en donde los usuarios son heterogéneos en frecuencia, es decir, no poseen los mismos canales de frecuencia para comunicarse, el grupo de canales utilizado para transmitir información de control debe elegirse cuidadosamente. Por esta razón, en esta tesis se estudian las ideas básicas de los esquemas de mensajería de control usados en las redes de radio cognitivas y se presenta un esquema adecuado para un control adecuado para usuarios heterogéneos en canales de frecuencia. Para ello, primero se presenta una nueva taxonomía para clasificar las estrategias de mensajería de control, identificando las principales características que debe cumplir un esquema de control para sistemas heterogéneos en frecuencia. Luego, se revisan diversas técnicas matemáticas para escoger el mínimo número de canales por los cuales se transmite la información de control. Después, se introduce un modelo de un esquema de mensajería de control que use el mínimo número de canales y que utilice las características de los sistemas heterogéneos en frecuencia. Por último, se comparan diversos esquemas de mensajería de control en términos de la eficiencia de transmisión.
Resumo:
We study the equidistribution of Fekete points in a compact complex manifold. These are extremal point configurations defined through sections of powers of a positive line bundle. Their equidistribution is a known result. The novelty of our approach is that we relate them to the problem of sampling and interpolation on line bundles, which allows us to estimate the equidistribution of the Fekete points quantitatively. In particular we estimate the Kantorovich-Wasserstein distance of the Fekete points to its limiting measure. The sampling and interpolation arrays on line bundles are a subject of independent interest, and we provide necessary density conditions through the classical approach of Landau, that in this context measures the local dimension of the space of sections of the line bundle. We obtain a complete geometric characterization of sampling and interpolation arrays in the case of compact manifolds of dimension one, and we prove that there are no arrays of both sampling and interpolation in the more general setting of semipositive line bundles.
Resumo:
Bimodal dispersal probability distributions with characteristic distances differing by several orders of magnitude have been derived and favorably compared to observations by Nathan [Nature (London) 418, 409 (2002)]. For such bimodal kernels, we show that two-dimensional molecular dynamics computer simulations are unable to yield accurate front speeds. Analytically, the usual continuous-space random walks (CSRWs) are applied to two dimensions. We also introduce discrete-space random walks and use them to check the CSRW results (because of the inefficiency of the numerical simulations). The physical results reported are shown to predict front speeds high enough to possibly explain Reid's paradox of rapid tree migration. We also show that, for a time-ordered evolution equation, fronts are always slower in two dimensions than in one dimension and that this difference is important both for unimodal and for bimodal kernels
Resumo:
A central feature of drugs of abuse is to induce gene expression in discrete brain structures that are critically involved in behavioral responses related to addictive processes. Although extracellular signal-regulated kinase (ERK) has been implicated in several neurobiological processes, including neuronal plasticity, its role in drug addiction remains poorly understood. This study was designed to analyze the activation of ERK by cocaine, its involvement in cocaine-induced early and long-term behavioral effects, as well as in gene expression. We show, by immunocytochemistry, that acute cocaine administration activates ERK throughout the striatum, rapidly but transiently. This activation was blocked when SCH 23390 [a specific dopamine (DA)-D1 antagonist] but not raclopride (a DA-D2 antagonist) was injected before cocaine. Glutamate receptors of NMDA subtypes also participated in ERK activation, as shown after injection of the NMDA receptor antagonist MK 801. The systemic injection of SL327, a selective inhibitor of the ERK kinase MEK, before cocaine, abolished the cocaine-induced ERK activation and decreased cocaine-induced hyperlocomotion, indicating a role of this pathway in events underlying early behavioral responses. Moreover, the rewarding effects of cocaine were abolished by SL327 in the place-conditioning paradigm. Because SL327 antagonized cocaine-induced c-fos expression and Elk-1 hyperphosphorylation, we suggest that the ERK intracellular signaling cascade is also involved in the prime burst of gene expression underlying long-term behavioral changes induced by cocaine. Altogether, these results reveal a new mechanism to explain behavioral responses of cocaine related to its addictive properties.
Resumo:
Background: Systematic approaches for identifying proteins involved in different types of cancer are needed. Experimental techniques such as microarrays are being used to characterize cancer, but validating their results can be a laborious task. Computational approaches are used to prioritize between genes putatively involved in cancer, usually based on further analyzing experimental data. Results: We implemented a systematic method using the PIANA software that predicts cancer involvement of genes by integrating heterogeneous datasets. Specifically, we produced lists of genes likely to be involved in cancer by relying on: (i) protein-protein interactions; (ii) differential expression data; and (iii) structural and functional properties of cancer genes. The integrative approach that combines multiple sources of data obtained positive predictive values ranging from 23% (on a list of 811 genes) to 73% (on a list of 22 genes), outperforming the use of any of the data sources alone. We analyze a list of 20 cancer gene predictions, finding that most of them have been recently linked to cancer in literature. Conclusion: Our approach to identifying and prioritizing candidate cancer genes can be used to produce lists of genes likely to be involved in cancer. Our results suggest that differential expression studies yielding high numbers of candidate cancer genes can be filtered using protein interaction networks.
Resumo:
The increasing volume of data describing humandisease processes and the growing complexity of understanding, managing, and sharing such data presents a huge challenge for clinicians and medical researchers. This paper presents the@neurIST system, which provides an infrastructure for biomedical research while aiding clinical care, by bringing together heterogeneous data and complex processing and computing services. Although @neurIST targets the investigation and treatment of cerebral aneurysms, the system’s architecture is generic enough that it could be adapted to the treatment of other diseases.Innovations in @neurIST include confining the patient data pertaining to aneurysms inside a single environment that offers cliniciansthe tools to analyze and interpret patient data and make use of knowledge-based guidance in planning their treatment. Medicalresearchers gain access to a critical mass of aneurysm related data due to the system’s ability to federate distributed informationsources. A semantically mediated grid infrastructure ensures that both clinicians and researchers are able to seamlessly access andwork on data that is distributed across multiple sites in a secure way in addition to providing computing resources on demand forperforming computationally intensive simulations for treatment planning and research.
Resumo:
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian signal on a block Rayleigh-faded channel without side information at the receiver. The method accommodates both scalar and MIMO (multiple-input multiple-output) settings. Operationally, this mutual information represents the highest spectral efficiency that can be attained using Gaussiancodebooks. Examples are provided that illustrate the loss in spectral efficiency caused by fast fading and how that loss is amplified when multiple transmit antennas are used. These examples are further enriched by comparisons with the channel capacity under perfect channel-state information at the receiver, and with the spectral efficiency attained by pilot-based transmission.
Resumo:
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian signal on a block Rayleigh-faded channel without side information at the receiver. The method accommodates both scalar and MIMO (multiple-input multiple-output) settings. Operationally, this mutual information represents the highest spectral efficiency that can be attained using Gaussiancodebooks. Examples are provided that illustrate the loss in spectral efficiency caused by fast fading and how that loss is amplified when multiple transmit antennas are used. These examples are further enriched by comparisons with the channel capacity under perfect channel-state information at the receiver, and with the spectral efficiency attained by pilot-based transmission.
Resumo:
Aquest article examina un aspecte de la informació gramatical que inclouen els diccionaris. En concret, analitza el tractament lexicogràfic que els noms que poden formar part d'un determinant complex han rebut en diversos diccionaris. Són noms que, segons els contextos funcionen com a nucli d'un sintagma nominal o com a nucli d'un sintagma determinant. Els resultats d'aquest estudi demostren que la informació gramatical en aquest tipus de noms en la majoria de diccionaris és molt pobre i fins i tot nul·la. Com a alternativa, el treball proposa un primer disseny d'entrada lexicogràfica prototípica per aquest tipus de noms que al costat de la informació semàntica té en compte la informació gramatical i la informació pragmàtica.
Resumo:
The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.
Resumo:
Concurs d’avantprojectes del Complex Poliesportiu de Camp Clar
Resumo:
Alzheimer"s disease and prion pathologies (e.g., Creutzfeldt-Jakob disease) display profound neural lesions associated with aberrant protein processing and extracellular amyloid deposits. For APP processing, emerging data suggest that the adaptor protein Dab1 plays a relevant role in regulating its intracellular trafficking and secretase-mediated proteolysis. Although some data have been presented, a putative relationship between human prion diseases and Dab1/APP interactions is lacking. Therefore, we have studied the putative relation between Dab1, APP processing and Aβ deposition, targets in sCJD cases. Our biochemical results categorized two groups of sCJD cases, which also correlated with PrPsc types 1 and 2 respectively. One group, with PrPsc type 1 showed increased Dab1 phosphorylation, and lower βCTF production with an absence of Aβ deposition. The second sCJD group, which carried PrPsc type 2, showed lower levels of Dab1 phosphorylation and βCTF production, similar to control cases. Relevant Aβ deposition in the second sCJD group was measured. Thus, a direct correlation between Dab1 phosphorylation, Aβ deposition and PrPsc type in human sCJD is presented for the first time.
Resumo:
We have studied the disassembly and assembly of two morphologically and functionally distinct parts of the Golgi complex, the cis/middle and trans cisterna/trans network compartments. For this purpose we have followed the redistribution of three cis/middle- (GMPc-1, GMPc-2, MG 160) and two trans- (GMPt-1 and GMPt-2) Golgi membrane proteins during and after treatment of normal rat kidney (NRK) cells with brefeldin A (BFA). BFA induced complete disassembly of the cis/middle- and trans-Golgi complex and translocation of GMPc and GMPt to the ER. Cells treated for short times (3 min) with BFA showed extensive disorganization of both cis/middle- and trans-Golgi complexes. However, complete disorganization of the trans part required much longer incubations with the drug. Upon removal of BFA the Golgi complex was reassembled by a process consisting of three steps: (a) exist of cis/middle proteins from the ER and their accumulation into vesicular structures scattered throughout the cytoplasm; (b) gradual relocation and accumulation of the trans proteins in the vesicles containing the cis/middle proteins; and (c) assembly of the cisternae, and reconstruction of the Golgi complex within an area located in the vicinity of the centrosome from which the ER was excluded. Reconstruction of the cis/middle-Golgi complex occurred under temperature conditions inhibitory of the reorganization of the trans-Golgi complex, and was dependent on microtubules. Reconstruction of the trans-Golgi complex, disrupted with nocodazole after selective fusion of the cis/middle-Golgi complex with the ER, occurred after the release of cis/middle-Golgi proteins from the ER and the assembly of the cis/middle cisternae.