Minimizing the Price of Tranquility: How to Discourage Scotland's Secession from the United Kingdom

What some view as overly-generous funding of the Scottish parliament results from Scotland.s credible threat to secede from the United Kingdom. Scotland is shown to benefit from a second mover advantage in a non-cooperative sequential game over the allocation of public funds. Various reform proposals are criticized for not recognizing that reform of Scottish government finances must be consistent with Scotland.s credible threat. Fiscal autonomy -- in which the Scottish parliament finances a much greater proportion of its spending from Scottish-sourced taxes, is demonstrated to be a viable reform within the existing political context and, in some circumstances, could remove Scotland.s second mover advantage. We also use a cooperative bargaining game model to demonstrate that an Australian style grants commission would not be a viable reform in the British context.

Identifying the roles of the Escherichia coli FtsZ-associated proteins by minimizing the requirements for division

Formation of the FtsZ ring (Z ring) in Escherichia coli is the first step in assembly of the divisome, a molecular machine composed of 14 known proteins which are all required for cell division. Although the biochemical functions of most divisome proteins are unknown, several of these have overlapping roles in ensuring that the Z ring assembles at the cytoplasmic membrane and is active. ^ We identified a single amino acid change in FtsA, R286W, renamed FtsA*, that completely bypasses the requirement for ZipA in cell division. This and other data suggest that FtsA* is a hyperactive form of FtsA that can replace the multiple functions normally assumed by ZipA, which include stabilization of Z rings, recruitment of downstream cell division proteins, and anchoring the Z ring to the membrane. This is the first example of complete functional replacement of an essential prokaryotic cell division protein by another. ^ Cells expressing ftsA* with a complete deletion of ftsK are viable and divide, although many of these ftsK null cells formed multiseptate chains, suggesting a role in cell separation for FtsK. In addition, strains expressing extra ftsAZ, ftsQ, ftsB, zipA or ftsN, were also able to survive and divide in the absence of ftsK. The cytoplasmic and transmembrane domains of FtsQ were sufficient to allow viability and septum formation to ftsK deleted strains. These findings suggest that FtsK is normally involved in stabilizing the divisome and shares functional overlap with other cell division proteins. ^ As well as permitting the removal of other divisome components, the presence of FtsA* in otherwise wild-type cells accelerated Z-ring assembly, which resulted in a significant decrease in the average length of cells. In support of its role in Z-ring stability, FtsA* suppressed the cell division inhibition caused by overexpressing FtsZ. FtsA* did not affect FtsZ turnover within the Z ring as measured by fluorescence recovery after photobleaching. Turnover of FtsA* in the ring was somewhat faster than wild-type FtsA. Yeast two-hybrid data suggest that FtsA* has an increased affinity for FtsZ relative to wild-type FtsA. These results indicate that FtsA* interacts with FtsZ more strongly, and its enhancement of Z ring assembly may explain why FtsA* can permit survival of cells lacking ZipA or FtsK.^

A visual framework to accelerate knowledge discovery based on dimensionality reduction minimizing degradation of quality

Tradicionalmente, el uso de técnicas de análisis de datos ha sido una de las principales vías para el descubrimiento de conocimiento oculto en grandes cantidades de datos, recopilados por expertos en diferentes dominios. Por otra parte, las técnicas de visualización también se han usado para mejorar y facilitar este proceso. Sin embargo, existen limitaciones serias en la obtención de conocimiento, ya que suele ser un proceso lento, tedioso y en muchas ocasiones infructífero, debido a la dificultad de las personas para comprender conjuntos de datos de grandes dimensiones. Otro gran inconveniente, pocas veces tenido en cuenta por los expertos que analizan grandes conjuntos de datos, es la degradación involuntaria a la que someten a los datos durante las tareas de análisis, previas a la obtención final de conclusiones. Por degradación quiere decirse que los datos pueden perder sus propiedades originales, y suele producirse por una reducción inapropiada de los datos, alterando así su naturaleza original y llevando en muchos casos a interpretaciones y conclusiones erróneas que podrían tener serias implicaciones. Además, este hecho adquiere una importancia trascendental cuando los datos pertenecen al dominio médico o biológico, y la vida de diferentes personas depende de esta toma final de decisiones, en algunas ocasiones llevada a cabo de forma inapropiada. Ésta es la motivación de la presente tesis, la cual propone un nuevo framework visual, llamado MedVir, que combina la potencia de técnicas avanzadas de visualización y minería de datos para tratar de dar solución a estos grandes inconvenientes existentes en el proceso de descubrimiento de información válida. El objetivo principal es hacer más fácil, comprensible, intuitivo y rápido el proceso de adquisición de conocimiento al que se enfrentan los expertos cuando trabajan con grandes conjuntos de datos en diferentes dominios. Para ello, en primer lugar, se lleva a cabo una fuerte disminución en el tamaño de los datos con el objetivo de facilitar al experto su manejo, y a la vez preservando intactas, en la medida de lo posible, sus propiedades originales. Después, se hace uso de efectivas técnicas de visualización para representar los datos obtenidos, permitiendo al experto interactuar de forma sencilla e intuitiva con los datos, llevar a cabo diferentes tareas de análisis de datos y así estimular visualmente su capacidad de comprensión. De este modo, el objetivo subyacente se basa en abstraer al experto, en la medida de lo posible, de la complejidad de sus datos originales para presentarle una versión más comprensible, que facilite y acelere la tarea final de descubrimiento de conocimiento. MedVir se ha aplicado satisfactoriamente, entre otros, al campo de la magnetoencefalografía (MEG), que consiste en la predicción en la rehabilitación de lesiones cerebrales traumáticas (Traumatic Brain Injury (TBI) rehabilitation prediction). Los resultados obtenidos demuestran la efectividad del framework a la hora de acelerar y facilitar el proceso de descubrimiento de conocimiento sobre conjuntos de datos reales. ABSTRACT Traditionally, the use of data analysis techniques has been one of the main ways of discovering knowledge hidden in large amounts of data, collected by experts in different domains. Moreover, visualization techniques have also been used to enhance and facilitate this process. However, there are serious limitations in the process of knowledge acquisition, as it is often a slow, tedious and many times fruitless process, due to the difficulty for human beings to understand large datasets. Another major drawback, rarely considered by experts that analyze large datasets, is the involuntary degradation to which they subject the data during analysis tasks, prior to obtaining the final conclusions. Degradation means that data can lose part of their original properties, and it is usually caused by improper data reduction, thereby altering their original nature and often leading to erroneous interpretations and conclusions that could have serious implications. Furthermore, this fact gains a trascendental importance when the data belong to medical or biological domain, and the lives of people depends on the final decision-making, which is sometimes conducted improperly. This is the motivation of this thesis, which proposes a new visual framework, called MedVir, which combines the power of advanced visualization techniques and data mining to try to solve these major problems existing in the process of discovery of valid information. Thus, the main objective is to facilitate and to make more understandable, intuitive and fast the process of knowledge acquisition that experts face when working with large datasets in different domains. To achieve this, first, a strong reduction in the size of the data is carried out in order to make the management of the data easier to the expert, while preserving intact, as far as possible, the original properties of the data. Then, effective visualization techniques are used to represent the obtained data, allowing the expert to interact easily and intuitively with the data, to carry out different data analysis tasks, and so visually stimulating their comprehension capacity. Therefore, the underlying objective is based on abstracting the expert, as far as possible, from the complexity of the original data to present him a more understandable version, thus facilitating and accelerating the task of knowledge discovery. MedVir has been succesfully applied to, among others, the field of magnetoencephalography (MEG), which consists in predicting the rehabilitation of Traumatic Brain Injury (TBI). The results obtained successfully demonstrate the effectiveness of the framework to accelerate and facilitate the process of knowledge discovery on real world datasets.

Minimizing a binding domain from protein A.

We present a systematic approach to minimizing the Z-domain of protein A, a three-helix bundle (59 residues total) that binds tightly (Kd = 10 nM) to the Fc portion of an immunoglobin IgG1. Despite the fact that all the contacts seen in the x-ray structure of the complex with the IgG are derived from residues in the first two helices, when helix 3 is deleted, binding affinity is reduced > 10(5)-fold (Kd > 1 mM). By using structure-based design and phage display methods, we have iteratively improved the stability and binding affinity for a two-helix derivative, 33 residues in length, such that it binds IgG1, with a Kd of 43 nM. This was accomplished by stepwise selection of random mutations from three regions of the truncated Z-peptide: the 4 hydrophobic residues from helix 1 and helix 2 that contacted helix 3 (the exoface), followed by 5 residues between helix 1 and helix 2 (the intraface), and lastly by 19 residues at or near the interface that interacts with Fc (the interface). As selected mutations from each region were compiled (12 in total), they led to progressive increases in affinity for IgG, and concomitant increases in alpha-helical content reflecting increased stabilization of the two-helix scaffold. Thus, by sequential increases in the stability of the structure and improvements in the quality of the intermolecular contacts, one can reduce larger binding domains to smaller ones. Such mini-protein binding domains are more amenable to synthetic chemistry and thus may be useful starting points for the design of smaller organic mimics. Smaller binding motifs also provide simplified and more tractable models for understanding determinants of protein function and stability.

Illinois Phosphorus Effluent Limits: Minimizing the Impacts Through the Use of Non-point Controls at the Springbrook Water Reclamation Center in Naperville, Illinois

Phosphorus pollution is a major concern in Illinois. Excessive amounts of phosphorus can be detrimental to water bodies. To help control phosphorus, the Illinois Pollution Control Board has proposed phosphorus limits on wastewater treatment facility discharges. If enacted, these limits will have negative impacts on the Springbrook Water Reclamation Center in Naperville, Illinois. To minimize these impacts, Naperville can utilize various non-point controls recommended in this paper to decrease the amount of phosphorus entering into the DuPage River and the Springbrook Water Reclamation Center. While these controls will not reduce levels low enough to totally satisfy limits on phosphorus discharges, they will significantly reduce the treatment costs Naperville will need to expend to meet them and be more environmentally effective.

Minimizing the IOL Power Error Induced by Keratometric Power

Purpose. To evaluate theoretically in normal eyes the influence on IOL power (PIOL) calculation of the use of a keratometric index (nk) and to analyze and validate preliminarily the use of an adjusted keratometric index (nkadj) in the IOL power calculation (PIOLadj). Methods. A model of variable keratometric index (nkadj) for corneal power calculation (Pc) was used for IOL power calculation (named PIOLadj). Theoretical differences ($PIOL) between the new proposed formula (PIOLadj) and which is obtained through Gaussian optics (PIOL Gauss) were determined using Gullstrand and Le Grand eye models. The proposed new formula for IOL power calculation (PIOLadj) was prevalidated clinically in 81 eyes of 81 candidates for corneal refractive surgery and compared with Haigis, HofferQ, Holladay, and SRK/T formulas. Results. A theoretical PIOL underestimation greater than 0.5 diopters was present in most of the cases when nk = 1.3375 was used. If nkadj was used for Pc calculation, a maximal calculated error in $PIOL of T0.5 diopters at corneal vertex in most cases was observed independently from the eye model, r1c, and the desired postoperative refraction. The use of nkadj in IOL power calculation (PIOLadj) could be valid with effective lens position optimization nondependent of the corneal power. Conclusions. The use of a single value of nk for Pc calculation can lead to significant errors in PIOL calculation that may explain some IOL power overestimations with conventional formulas. These inaccuracies can be minimized by using the new PIOLadj based on the algorithm of nkadj.

Minimizing salt in return flow through irrigation management : interim report /

Mode of access: Internet.

Tentative pavement and geometric design criteria for minimizing hydroplaning. Phase I. Final report.

Federal Highway Administration, Office of Research and Development, Washington, D.C.

Concepts and approaches for minimizing excessive exposure to electromagnetic radiation from RF sealers /

Mode of access: Internet.

Quadratic algorithms for minimizing joins in restricted relational expressions /

"October 1979."

Minimizing taxes ...

pt. I. Selections of business methods, places of incorporation, personal domicile, investments, etc. --pt. II. Synopses of the tax systems of each of the states and of the United States.

Regularity and relaxed problems of minimizing biharmonic maps into spheres

For n >= 5 and k >= 4, we show that any minimizing biharmonic map from Omega subset of R-n to S-k is smooth off a closed set whose Hausdorff dimension is at most n - 5. When n = 5 and k = 4, for a parameter lambda is an element of [0, 1] we introduce lambda-relaxed energy H-lambda of the Hessian energy for maps in W-2,W-2 (Omega; S-4) so that each minimizer u(lambda) of H-lambda is also a biharmonic map. We also establish the existence and partial regularity of a minimizer of H-lambda for lambda is an element of [0, 1).

A gradient descent algorithm for minimizing amino acid coupling reactions when synthesizing cyclic-peptide libraries

Combinatorial chemistry has become an invaluable tool in medicinal chemistry for the identification of new drug leads. For example, libraries of predetermined sequences and head-to-tail cyclized peptides are routinely synthesized in our laboratory using the IRORI approach. Such libraries are used as molecular toolkits that enable the development of pharmacophores that define activity and specificity at receptor targets. These libraries can be quite large and difficult to handle, due to physical and chemical constraints imposed by their size. Therefore, smaller sub-libraries are often targeted for synthesis. The number of coupling reactions required can be greatly reduced if the peptides having common amino acids are grouped into the same sub-library (batching). This paper describes a schedule optimizer to minimize the number of coupling reactions by rotating and aligning sequences while simultaneously batching. The gradient descent method thereby reduces the number of coupling reactions required for synthesizing cyclic peptide libraries. We show that the algorithm results in a 75% reduction in the number of coupling reactions for a typical cyclic peptide library.