Structure-based conformational preferences of amino acids

Proteins can be very tolerant to amino acid substitution, even within their core. Understanding the factors responsible for this behavior is of critical importance for protein engineering and design. Mutations in proteins have been quantified in terms of the changes in stability they induce. For example, guest residues in specific secondary structures have been used as probes of conformational preferences of amino acids, yielding propensity scales. Predicting these amino acid propensities would be a good test of any new potential energy functions used to mimic protein stability. We have recently developed a protein design procedure that optimizes whole sequences for a given target conformation based on the knowledge of the template backbone and on a semiempirical potential energy function. This energy function is purely physical, including steric interactions based on a Lennard-Jones potential, electrostatics based on a Coulomb potential, and hydrophobicity in the form of an environment free energy based on accessible surface area and interatomic contact areas. Sequences designed by this procedure for 10 different proteins were analyzed to extract conformational preferences for amino acids. The resulting structure-based propensity scales show significant agreements with experimental propensity scale values, both for α-helices and β-sheets. These results indicate that amino acid conformational preferences are a natural consequence of the potential energy we use. This confirms the accuracy of our potential and indicates that such preferences should not be added as a design criterion.

Gene-based approach to human gene-phenotype correlations

Elucidating the genetic basis of human phenotypes is a major goal of contemporary geneticists. Logically, two fundamental and contrasting approaches are available, one that begins with a phenotype and concludes with the identification of a responsible gene or genes; the other that begins with a gene and works toward identifying one or more phenotypes resulting from allelic variation of it. This paper provides a conceptual overview of phenotype-based vs. gene-based procedures with emphasis on gene-based methods. A key feature of a gene-based approach is that laboratory effort first is devoted to developing an assay for mutations in the gene under regard; the assay then is applied to the evaluation of large numbers of unrelated individuals with a variety of phenotypes that are deemed potentially resulting from alleles at the gene. No effort is directed toward chromosomally mapping the loci responsible for the phenotypes scanned. Example is made of my laboratory’s successful use of a gene-based approach to identify genes causing hereditary diseases of the retina such as retinitis pigmentosa. Reductions in the cost and improvements in the speed of scanning individuals for DNA sequence anomalies may make a gene-based approach an efficient alternative to phenotype-based approaches to correlating genes with phenotypes.

“Coarse” stability and bifurcation analysis using time-steppers: A reaction-diffusion example

Evolutionary, pattern forming partial differential equations (PDEs) are often derived as limiting descriptions of microscopic, kinetic theory-based models of molecular processes (e.g., reaction and diffusion). The PDE dynamic behavior can be probed through direct simulation (time integration) or, more systematically, through stability/bifurcation calculations; time-stepper-based approaches, like the Recursive Projection Method [Shroff, G. M. & Keller, H. B. (1993) SIAM J. Numer. Anal. 30, 1099–1120] provide an attractive framework for the latter. We demonstrate an adaptation of this approach that allows for a direct, effective (“coarse”) bifurcation analysis of microscopic, kinetic-based models; this is illustrated through a comparative study of the FitzHugh-Nagumo PDE and of a corresponding Lattice–Boltzmann model.

Multiple DNA and protein sequence alignment based on segment-to-segment comparison.

In this paper, a new way to think about, and to construct, pairwise as well as multiple alignments of DNA and protein sequences is proposed. Rather than forcing alignments to either align single residues or to introduce gaps by defining an alignment as a path running right from the source up to the sink in the associated dot-matrix diagram, we propose to consider alignments as consistent equivalence relations defined on the set of all positions occurring in all sequences under consideration. We also propose constructing alignments from whole segments exhibiting highly significant overall similarity rather than by aligning individual residues. Consequently, we present an alignment algorithm that (i) is based on segment-to-segment comparison instead of the commonly used residue-to-residue comparison and which (ii) avoids the well-known difficulties concerning the choice of appropriate gap penalties: gaps are not treated explicity, but remain as those parts of the sequences that do not belong to any of the aligned segments. Finally, we discuss the application of our algorithm to two test examples and compare it with commonly used alignment methods. As a first example, we aligned a set of 11 DNA sequences coding for functional helix-loop-helix proteins. Though the sequences show only low overall similarity, our program correctly aligned all of the 11 functional sites, which was a unique result among the methods tested. As a by-product, the reading frames of the sequences were identified. Next, we aligned a set of ribonuclease H proteins and compared our results with alignments produced by other programs as reported by McClure et al. [McClure, M. A., Vasi, T. K. & Fitch, W. M. (1994) Mol. Biol. Evol. 11, 571-592]. Our program was one of the best scoring programs. However, in contrast to other methods, our protein alignments are independent of user-defined parameters.

Molecular control of vertebrate iron metabolism: mRNA-based regulatory circuits operated by iron, nitric oxide, and oxidative stress.

As an essential nutrient and a potential toxin, iron poses an exquisite regulatory problem in biology and medicine. At the cellular level, the basic molecular framework for the regulation of iron uptake, storage, and utilization has been defined. Two cytoplasmic RNA-binding proteins, iron-regulatory protein-1 (IRP-1) and IRP-2, respond to changes in cellular iron availability and coordinate the expression of mRNAs that harbor IRP-binding sites, iron-responsive elements (IREs). Nitric oxide (NO) and oxidative stress in the form of H2O2 also signal to IRPs and thereby influence cellular iron metabolism. The recent discovery of two IRE-regulated mRNAs encoding enzymes of the mitochondrial citric acid cycle may represent the beginnings of elucidating regulatory coupling between iron and energy metabolism. In addition to providing insights into the regulation of iron metabolism and its connections with other cellular pathways, the IRE/IRP system has emerged as a prime example for the understanding of translational regulation and mRNA stability control. Finally, IRP-1 has highlighted an unexpected role for iron sulfur clusters as post-translational regulatory switches.

A general proposal to multilingual information access based on syntactic-semantic patterns

In the last few years, there has been a wide development in the research on textual information systems. The goal is to improve these systems in order to allow an easy localization, treatment and access to the information stored in digital format (Digital Databases, Documental Databases, and so on). There are lots of applications focused on information access (for example, Web-search systems like Google or Altavista). However, these applications have problems when they must access to cross-language information, or when they need to show information in a language different from the one of the query. This paper explores the use of syntactic-sematic patterns as a method to access to multilingual information, and revise, in the case of Information Retrieval, where it is possible and useful to employ patterns when it comes to the multilingual and interactive aspects. On the one hand, the multilingual aspects that are going to be studied are the ones related to the access to documents in different languages from the one of the query, as well as the automatic translation of the document, i.e. a machine translation system based on patterns. On the other hand, this paper is going to go deep into the interactive aspects related to the reformulation of a query based on the syntactic-semantic pattern of the request.

Nostalgic representation of reality in television fiction: an empirical study based on the analysis of the Spanish television series Cuéntame cómo pasó

The Spanish transition from dictatorship to democracy is often described as an example of negotiation or agreement between the elites (Sánchez Cuenca and Aguilar, 2009: 433). Journalistic and political elites, aware of their important historical role, agreed a consensus on certain issues (democracy, constitution, amnesty) or characters (King Juan Carlos I), in order to ensure the stability of the democratic process (Zugasti, 2007, 2008). Television, which articulates the discourse of the masses, has been one of the basic means used to illustrate the development. Among the highlights of recent major audiovisual content, Cuéntame cómo pasó (2001-present) -a TV-series designed to explain changes with a nostalgic tone in Spanish society since 1968 until today- stands out. By choosing a random sample of episodes for this research we propose to verify the validity of the representation of the political process which contextualizes the series. By analyzing many elements, such as the opinions of the main characters, their personal, political and geographical situations, we try to show the construction of a focal point that sanctifies the official version. We also stress the pacifying and nostalgic tone, which constructs stereotypes and taboos about the process and which characterizes this series as a symbolic culmination of the democratization undertaken by the elites.

A new betweenness centrality measure based on an algorithm for ranking the nodes of a network

We propose and discuss a new centrality index for urban street patterns represented as networks in geographical space. This centrality measure, that we call ranking-betweenness centrality, combines the idea behind the random-walk betweenness centrality measure and the idea of ranking the nodes of a network produced by an adapted PageRank algorithm. We initially use a PageRank algorithm in which we are able to transform some information of the network that we want to analyze into numerical values. Numerical values summarizing the information are associated to each of the nodes by means of a data matrix. After running the adapted PageRank algorithm, a ranking of the nodes is obtained, according to their importance in the network. This classification is the starting point for applying an algorithm based on the random-walk betweenness centrality. A detailed example of a real urban street network is discussed in order to understand the process to evaluate the ranking-betweenness centrality proposed, performing some comparisons with other classical centrality measures.

Algorithm for the detection of outliers based on the theory of rough sets

Outliers are objects that show abnormal behavior with respect to their context or that have unexpected values in some of their parameters. In decision-making processes, information quality is of the utmost importance. In specific applications, an outlying data element may represent an important deviation in a production process or a damaged sensor. Therefore, the ability to detect these elements could make the difference between making a correct and an incorrect decision. This task is complicated by the large sizes of typical databases. Due to their importance in search processes in large volumes of data, researchers pay special attention to the development of efficient outlier detection techniques. This article presents a computationally efficient algorithm for the detection of outliers in large volumes of information. This proposal is based on an extension of the mathematical framework upon which the basic theory of detection of outliers, founded on Rough Set Theory, has been constructed. From this starting point, current problems are analyzed; a detection method is proposed, along with a computational algorithm that allows the performance of outlier detection tasks with an almost-linear complexity. To illustrate its viability, the results of the application of the outlier-detection algorithm to the concrete example of a large database are presented.

Flexible Framework for Real-Time Embedded Systems Based on Mobile Cloud Computing Paradigm

The development of applications as well as the services for mobile systems faces a varied range of devices with very heterogeneous capabilities whose response times are difficult to predict. The research described in this work aims to respond to this issue by developing a computational model that formalizes the problem and that defines adjusting computing methods. The described proposal combines imprecise computing strategies with cloud computing paradigms in order to provide flexible implementation frameworks for embedded or mobile devices. As a result, the imprecise computation scheduling method on the workload of the embedded system is the solution to move computing to the cloud according to the priority and response time of the tasks to be executed and hereby be able to meet productivity and quality of desired services. A technique to estimate network delays and to schedule more accurately tasks is illustrated in this paper. An application example in which this technique is experimented in running contexts with heterogeneous work loading for checking the validity of the proposed model is described.

A Cloud-based Framework for Security Analysis of Browser Extensions

In today's internet world, web browsers are an integral part of our day-to-day activities. Therefore, web browser security is a serious concern for all of us. Browsers can be breached in different ways. Because of the over privileged access, extensions are responsible for many security issues. Browser vendors try to keep safe extensions in their official extension galleries. However, their security control measures are not always effective and adequate. The distribution of unsafe extensions through different social engineering techniques is also a very common practice. Therefore, before installation, users should thoroughly analyze the security of browser extensions. Extensions are not only available for desktop browsers, but many mobile browsers, for example, Firefox for Android and UC browser for Android, are also furnished with extension features. Mobile devices have various resource constraints in terms of computational capabilities, power, network bandwidth, etc. Hence, conventional extension security analysis techniques cannot be efficiently used by end users to examine mobile browser extension security issues. To overcome the inadequacies of the existing approaches, we propose CLOUBEX, a CLOUd-based security analysis framework for both desktop and mobile Browser EXtensions. This framework uses a client-server architecture model. In this framework, compute-intensive security analysis tasks are generally executed in a high-speed computing server hosted in a cloud environment. CLOUBEX is also enriched with a number of essential features, such as client-side analysis, requirements-driven analysis, high performance, and dynamic decision making. At present, the Firefox extension ecosystem is most susceptible to different security attacks. Hence, the framework is implemented for the security analysis of the Firefox desktop and Firefox for Android mobile browser extensions. A static taint analysis is used to identify malicious information flows in the Firefox extensions. In CLOUBEX, there are three analysis modes. A dynamic decision making algorithm assists us to select the best option based on some important parameters, such as the processing speed of a client device and network connection speed. Using the best analysis mode, performance and power consumption are improved significantly. In the future, this framework can be leveraged for the security analysis of other desktop and mobile browser extensions, too.

The Israeli lobby for Research and Innovation in the European Union. An example of efficient cooperation in the European Neighbourhood? Bruges Political Research Papers 49/2015.

Israel figures among the world-leaders in R&D expenditure and has a high-performing scientific community. Since the 1990s it has been associated with the Scientific Policy of the European Union via the European Research Framework Programmes (FP). The cooperation between Israel and the EU in this domain has gradually increased and benefits the scientific communities on both sides. In 2014 the association of Israel to the latest and biggest European FP ever adopted (Horizon 2020) was renewed for the fourth time. Based on all the scientific evidence provided, the elaboration of a European Research Policy can be identified as a highly regulated domain, offering relevant ‘channels of influence’. These channels offer Israel the opportunity to act within the Research Policy system. Being a member of several formal EU bodies in charge of implementing EU Research Policy, Israel is able to introduce its positions effectively. This is accompanied by an outstanding level of activity by Israel in linking concrete EU Research Policy measures to the Israeli Scientific Community at the national level. To carry out this task, Israel relies on an effective organization, which remodels the provided EU structures: European ‘National Contact Points’ (NCPs) are concentrated within the ‘Europe Israel R&D Directorate’ (ISERD). ISERD connects efficiently all the relevant actors, forums and phases of EU-Israeli Research Policy. ISERD can be recognized as being at the heart of Israel's research cooperation with the EU, and its structure may be a source of in

The Digital Market for Local Services: A one-night stand for workers? An example from the on-demand economy. CEPS Special Report, No. 133/April 2016

This case study provides a snapshot of the dynamics in the digital market for locally provided personal services. Based on a case study for a Belgium platform with 14,113 identified workers and 9,459 posted tasks, the findings suggest that the current intermediation is inefficient. Only a limited share of the tasks posted on the platform are being completed, whereas the characteristics of the not-completed tasks are fairly limited. Moreover, just a small share of the workers participating in the platform is actually performing the completed tasks. Their average earnings per hour are in most cases above the minimum wage and even above the median wage in the offline market. At the present time, however, the limited earnings for individual workers prevent this mode of working from becoming an alternative to a conventional job. In addition to the standard determinants of workers’ earnings (e.g. gender, age, occupation, etc.), the characteristics and evaluation mechanism of the platform have a large influence on the distribution of tasks and earnings.

Field-based models for low speed switched reluctance machine designs

Trabalho apresentado na Conferência CPE-POWERENG 2016, 29 junho a 01 de julho 2016, Bydgoszcz, Polónia

Optimized CUDA-Based PDE Solver for Reaction Diffusion Systems on Arbitrary Surfaces

Partial differential equation (PDE) solvers are commonly employed to study and characterize the parameter space for reaction-diffusion (RD) systems while investigating biological pattern formation. Increasingly, biologists wish to perform such studies with arbitrary surfaces representing ‘real’ 3D geometries for better insights. In this paper, we present a highly optimized CUDA-based solver for RD equations on triangulated meshes in 3D. We demonstrate our solver using a chemotactic model that can be used to study snakeskin pigmentation, for example. We employ a finite element based approach to perform explicit Euler time integrations. We compare our approach to a naive GPU implementation and provide an in-depth performance analysis, demonstrating the significant speedup afforded by our optimizations. The optimization strategies that we exploit could be generalized to other mesh based processing applications with PDE simulations.