Classification of Protein Kinases on the Basis of Both Kinase and Non-Kinase Regions

Background: Protein phosphorylation is a generic way to regulate signal transduction pathways in all kingdoms of life. In many organisms, it is achieved by the large family of Ser/Thr/Tyr protein kinases which are traditionally classified into groups and subfamilies on the basis of the amino acid sequence of their catalytic domains. Many protein kinases are multidomain in nature but the diversity of the accessory domains and their organization are usually not taken into account while classifying kinases into groups or subfamilies. Methodology: Here, we present an approach which considers amino acid sequences of complete gene products, in order to suggest refinements in sets of pre-classified sequences. The strategy is based on alignment-free similarity scores and iterative Area Under the Curve (AUC) computation. Similarity scores are computed by detecting common patterns between two sequences and scoring them using a substitution matrix, with a consistent normalization scheme. This allows us to handle full-length sequences, and implicitly takes into account domain diversity and domain shuffling. We quantitatively validate our approach on a subset of 212 human protein kinases. We then employ it on the complete repertoire of human protein kinases and suggest few qualitative refinements in the subfamily assignment stored in the KinG database, which is based on catalytic domains only. Based on our new measure, we delineate 37 cases of potential hybrid kinases: sequences for which classical classification based entirely on catalytic domains is inconsistent with the full-length similarity scores computed here, which implicitly consider multi-domain nature and regions outside the catalytic kinase domain. We also provide some examples of hybrid kinases of the protozoan parasite Entamoeba histolytica. Conclusions: The implicit consideration of multi-domain architectures is a valuable inclusion to complement other classification schemes. The proposed algorithm may also be employed to classify other families of enzymes with multidomain architecture.

Applications of reverse saturable absorbers in laser science

A variety of applications exist for reverse saturable absorbers (RSAs) in the area of optical pulse processing and computing. An RSA can be used as power limiter/pulse smoother and energy limiter/pulse shortner of laser pulses. A combination of RSA and saturable absorber (SA) can be used for mode locking and pulse shaping between high power laser amplifiers in oscillator amplifier chain. Also, an RSA can be used for the construction of a molecular spatial light modulator (SLM) which acts as an input/output device in optical computers. A detailed review of the theoretical studies of these processes is presented. Current efforts to find RSAs at desired wavelength for testing these theoretical predictions are also discussed.

Silva Fennica. A quarterly journal of forest science. Contents Vol. 28, 1994.

Julkaistu Silva Fennica Vol. 28(4) -numeron liitteenä.

Bridging East and West : The Establishment of the International Institute for Applied Systems Analysis (IIASA) in the United States Foreign Policy of Bridge Building, 1964-1972.

The dissertation examines the foreign policies of the United States through the prism of science and technology. In the focal point of scrutiny is the policy establishing the International Institute for Applied Systems Analysis (IIASA) and the development of the multilateral part of bridge building in American foreign policy during the 1960s and early 1970s. After a long and arduous negotiation process, the institute was finally established by twelve national member organizations from the following countries: Bulgaria, Canada, Czechoslovakia, Federal Republic of Germany (FRG), France, German Democratic Republic (GDR), Great Britain, Italy, Japan, Poland, Soviet Union and United States; a few years later Sweden, Finland and the Netherlands also joined. It is said that the goal of the institute was to bring together researchers from East and West to solve pertinent problems caused by the modernization process experienced in industrialized world. It originates from President Lyndon B. Johnson s bridge building policies that were launched in 1964, and was set in a well-contested and crowded domain of other international organizations of environmental and social planning. Since the distinct need for yet another organization was not evident, the process of negotiations in this multinational environment enlightens the foreign policy ambitions of the United States on the road to the Cold War détente. The study places this project within its political era, and juxtaposes it with other international organizations, especially that of the OECD, ECE and NATO. Conventionally, Lyndon Johnson s bridge building policies have been seen as a means to normalize its international relations bilaterally with different East European countries, and the multilateral dimension of the policy has been ignored. This is why IIASA s establishment process in this multilateral environment brings forth new information on US foreign policy goals, the means to achieve these goals, as well as its relations to other advanced industrialized societies before the time of détente, during the 1960s and early 1970s. Furthermore, the substance of the institute applied systems analysis illuminates the differences between European and American methodological thinking in social planning. Systems analysis is closely associated with (American) science and technology policies of the 1960s, especially in its military administrative applications, thus analysis within the foreign policy environment of the United States proved particularly fruitful. In the 1960s the institutional structures of European continent with faltering, and the growing tendencies of integration were in flux. One example of this was the long, drawn-out process of British membership in the EEC, another is de Gaulle s withdrawal from NATO s military-political cooperation. On the other hand, however, economic cooperation in Europe between East and West, and especially with the Soviet Union was expanding rapidly. This American initiative to form a new institutional actor has to be seen in that structural context, showing that bridge building was needed not only to the East, but also to the West. The narrative amounts to an analysis of how the United States managed both cooperation and conflict in its hegemonic aspirations in the emerging modern world, and how it used its special relationship with the United Kingdom to achieve its goals. The research is based on the archives of the United States, Great Britain, Sweden, Finland, and IIASA. The primary sources have been complemented with both contemporary and present day research literature, periodicals, and interviews.

Modelling vacuum arcs : from plasma initiation to surface interactions

A better understanding of vacuum arcs is desirable in many of today's 'big science' projects including linear colliders, fusion devices, and satellite systems. For the Compact Linear Collider (CLIC) design, radio-frequency (RF) breakdowns occurring in accelerating cavities influence efficiency optimisation and cost reduction issues. Studying vacuum arcs both theoretically as well as experimentally under well-defined and reproducible direct-current (DC) conditions is the first step towards exploring RF breakdowns. In this thesis, we have studied Cu DC vacuum arcs with a combination of experiments, a particle-in-cell (PIC) model of the arc plasma, and molecular dynamics (MD) simulations of the subsequent surface damaging mechanism. We have also developed the 2D Arc-PIC code and the physics model incorporated in it, especially for the purpose of modelling the plasma initiation in vacuum arcs. Assuming the presence of a field emitter at the cathode initially, we have identified the conditions for plasma formation and have studied the transitions from field emission stage to a fully developed arc. The 'footing' of the plasma is the cathode spot that supplies the arc continuously with particles; the high-density core of the plasma is located above this cathode spot. Our results have shown that once an arc plasma is initiated, and as long as energy is available, the arc is self-maintaining due to the plasma sheath that ensures enhanced field emission and sputtering. The plasma model can already give an estimate on how the time-to-breakdown changes with the neutral evaporation rate, which is yet to be determined by atomistic simulations. Due to the non-linearity of the problem, we have also performed a code-to-code comparison. The reproducibility of plasma behaviour and time-to-breakdown with independent codes increased confidence in the results presented here. Our MD simulations identified high-flux, high-energy ion bombardment as a possible mechanism forming the early-stage surface damage in vacuum arcs. In this mechanism, sputtering occurs mostly in clusters, as a consequence of overlapping heat spikes. Different-sized experimental and simulated craters were found to be self-similar with a crater depth-to-width ratio of about 0.23 (sim) - 0.26 (exp). Experiments, which we carried out to investigate the energy dependence of DC breakdown properties, point at an intrinsic connection between DC and RF scaling laws and suggest the possibility of accumulative effects influencing the field enhancement factor.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.