On cluster approximations of cellular automata

In this thesis I examine one commonly used class of methods for the analytic approximation of cellular automata, the so-called local cluster approximations. This class subsumes the well known mean-field and pair approximations, as well as higher order generalizations of these. While a straightforward method known as Bayesian extension exists for constructing cluster approximations of arbitrary order on one-dimensional lattices (and certain other cases), for higher-dimensional systems the construction of approximations beyond the pair level becomes more complicated due to the presence of loops. In this thesis I describe the one-dimensional construction as well as a number of approximations suggested for higher-dimensional lattices, comparing them against a number of consistency criteria that such approximations could be expected to satisfy. I also outline a general variational principle for constructing consistent cluster approximations of arbitrary order with minimal bias, and show that the one-dimensional construction indeed satisfies this principle. Finally, I apply this variational principle to derive a novel consistent expression for symmetric three cell cluster frequencies as estimated from pair frequencies, and use this expression to construct a quantitatively improved pair approximation of the well-known lattice contact process on a hexagonal lattice.

Contributions to the Theory of Finite-State Based Grammars

This dissertation is a theoretical study of finite-state based grammars used in natural language processing. The study is concerned with certain varieties of finite-state intersection grammars (FSIG) whose parsers define regular relations between surface strings and annotated surface strings. The study focuses on the following three aspects of FSIGs: (i) Computational complexity of grammars under limiting parameters In the study, the computational complexity in practical natural language processing is approached through performance-motivated parameters on structural complexity. Each parameter splits some grammars in the Chomsky hierarchy into an infinite set of subset approximations. When the approximations are regular, they seem to fall into the logarithmic-time hierarchyand the dot-depth hierarchy of star-free regular languages. This theoretical result is important and possibly relevant to grammar induction. (ii) Linguistically applicable structural representations Related to the linguistically applicable representations of syntactic entities, the study contains new bracketing schemes that cope with dependency links, left- and right branching, crossing dependencies and spurious ambiguity. New grammar representations that resemble the Chomsky-Schützenberger representation of context-free languages are presented in the study, and they include, in particular, representations for mildly context-sensitive non-projective dependency grammars whose performance-motivated approximations are linear time parseable. (iii) Compilation and simplification of linguistic constraints Efficient compilation methods for certain regular operations such as generalized restriction are presented. These include an elegant algorithm that has already been adopted as the approach in a proprietary finite-state tool. In addition to the compilation methods, an approach to on-the-fly simplifications of finite-state representations for parse forests is sketched. These findings are tightly coupled with each other under the theme of locality. I argue that the findings help us to develop better, linguistically oriented formalisms for finite-state parsing and to develop more efficient parsers for natural language processing. Avainsanat: syntactic parsing, finite-state automata, dependency grammar, first-order logic, linguistic performance, star-free regular approximations, mildly context-sensitive grammars

Quality Assessment of a Forest Inventory Based on Airborne Laser Scanning

In this study, a quality assessment method based on sampling of primary laser inventory units (microsegments) was analysed. The accuracy of a laser inventory carried out in Kuhmo was analysed as a case study. Field sample plots were measured on the sampled microsegments in the Kuhmo inventory area. Two main questions were considered. Did the ALS based inventory meet the accuracy requirements set for the provider and how should a reliable, cost-efficient and independent quality assessment be undertaken. The agreement between control measurement and ALS based inventory was analysed in four ways: 1) The root mean squared errors (RMSEs) and bias were calculated. 2) Scatter plots with 95% confidence intervals were plotted and the placing of identity lines was checked. 3) Bland-Altman plots were drawn so that the mean difference of attributes between the control method and ALS-method was calculated and plotted against average value of attributes. 4) The tolerance limits were defined and combined with Bland-Altman plots. The RMSE values were compared to a reference study from which the accuracy requirements had been set to the service provider. The accuracy requirements in Kuhmo were achieved, however comparison of RMSE values proved to be difficult. Field control measurements are costly and time-consuming, but they are considered to be robust. However, control measurements might include errors, which are difficult to take into account. Using the Bland-Altman plots none of the compared methods are considered to be completely exact, so this offers a fair way to interpret results of assessment. The tolerance limits to be set on order combined with Bland-Altman plots were suggested to be taken in practise. In addition, bias should be calculated for total area. Some other approaches for quality control were briefly examined. No method was found to fulfil all the required demands of statistical reliability, cost-efficiency, time efficiency, simplicity and speed of implementation. Some benefits and shortcomings of the studied methods were discussed.

Winter feeding strategies for suckler cows in cold climatic conditions

In Finland, suckler cow production is carried out in circumstances characterized by a long winter period and a short grazing period. The traditional winter housing system for suckler cows has been insulated or uninsulated buildings, but there is a demand for developing less expensive housing systems. In addition, more information is needed on new winter feeding strategies, carried out in inexpensive winter facilities with conventional (hay, grass silage, straw) or alternative (treated straw, industrial by-product, whole-crop silage) feeds. The new feeding techniques should not have any detrimental effects on animal welfare in order to be acceptable to both farmers and consumers. Furthermore, no official feeding recommendations for suckler cows are available in Finland and, thus, recommendations for dairy cows have been used. However, this may lead to over- or underfeeding of suckler cows and, finally, to decreased economic output. In Experiment I, second-calf beef-dairy suckler cows were used to compare the effects of diets based on hay (H) or urea-treated straw (US) at two feeding levels (Moderate; M vs. Low; L) on the performance of cows and calves. Live weight (LW) gain during the indoor feeding was lower for cows on level L than on level M. Cows on diet US lost more LW indoors than those on diet H. The cows replenished the LW losses on good pasture. Calf LW gain and cow milk production were unaffected by the treatments. Conception rate was unaffected by the treatments but was only 69%. Urea-treated straw proved to be a suitable winter feed for spring-calving suckler cows. Experiment II studied the effects of feeding accuracy on the performance of first- and second-calf beef-dairy cows and calves. In II-1, the day-to-day variation in the roughage offered ranged up to ± 40%. In II-2, the same variation was used in two-week periods. Variation of the roughages offered had minor effects on cow performance. Reproduction was unaffected by the feeding accuracy. Accurate feeding is not necessary for young beef-dairy crosses, if the total amount of energy offered over a period of a few weeks fulfills the energy requirements. Effects of feeding strategies with alternative feeds on the performance of mature beef-dairy and beef cows and calves were evaluated in Experiment III. Two studies consisted of two feeding strategies (Step-up vs. Flat-rate) and two diets (Control vs. Alternative). There were no differences between treatments in the cow LW, body condition score (BCS), calf pre-weaning LW gain and cow reproduction. A flat-rate strategy can be practised in the nutrition of mature suckler cows. Oat hull based flour-mill by product can partly replace grass silage and straw in the winter diet. Whole-crop barley silage can be offered as a sole feed to suckler cows. Experiment IV evaluated during the winter feeding period the effects of replacing grass silage with whole-crop barley or oat silage on mature beef cow and calf performance. Both whole-crop silages were suitable winter feeds for suckler cows in cold outdoor winter conditions. Experiment V aimed at assessing the effects of daily feeding vs. feeding every third day on the performance of mature beef cows and calves. No differences between the treatments were observed in cow LW, BCS, milk production and calf LW. The serum concentrations of urea and long-chain fatty acids were increased on the third day after feeding in the cows fed every third day. Despite of that the feeding every third day is an acceptable feeding strategy for mature suckler cows. Experiment VI studied the effects of feeding levels and long-term cold climatic conditions on mature beef cows and calves. The cows were overwintered in outdoor facilities or in an uninsulated indoor facility. Whole-crop barley silage was offered either ad libitum or restricted. All the facilities offered adequate shelter for the cows. The restricted offering of whole-crop barley silage provided enough energy for the cows. The Finnish energy recommendations for dairy cows were too high for mature beef breed suckler cows in good body condition at housing, even in cold conditions. Therefore, there is need to determine feeding recommendations for suckler cows in Finland. The results showed that the required amount of energy can be offered to the cows using conventional or alternative feeds provided at a lower feeding level, with an inaccurate feeding, flat-rate feeding or feeding every third day strategy. The cows must have an opportunity to replenish the LW and BCS losses at pasture before the next winter. Production in cold conditions can be practised in inexpensive facilities when shelter against rain and wind, a dry resting place, adequate amounts of feed suitable for cold conditions and water are provided for the animals as was done in the present study.

A computational study of Compton profiles of water - methanol solutions

The molecular level structure of mixtures of water and alcohols is very complicated and has been under intense research in the recent past. Both experimental and computational methods have been used in the studies. One method for studying the intra- and intermolecular bindings in the mixtures is the use of the so called difference Compton profiles, which are a way to obtain information about changes in the electron wave functions. In the process of Compton scattering a photon scatters inelastically from an electron. The Compton profile that is obtained from the electron wave functions is directly proportional to the probability of photon scattering at a given energy to a given solid angle. In this work we develop a method to compute Compton profiles numerically for mixtures of liquids. In order to obtain the electronic wave functions necessary to calculate the Compton profiles we need some statistical information about atomic coordinates. Acquiring this using ab-initio molecular dynamics is beyond our computational capabilities and therefore we use classical molecular dynamics to model the movement of atoms in the mixture. We discuss the validity of the chosen method in view of the results obtained from the simulations. There are some difficulties in using classical molecular dynamics for the quantum mechanical calculations, but these can possibly be overcome by parameter tuning. According to the calculations clear differences can be seen in the Compton profiles of different mixtures. This prediction needs to be tested in experiments in order to find out whether the approximations made are valid.

Enhanced processing of SPOT multispectral satellite imagery for environmental monitoring and modelling

The Taita Hills in southeastern Kenya form the northernmost part of Africa’s Eastern Arc Mountains, which have been identified by Conservation International as one of the top ten biodiversity hotspots on Earth. As with many areas of the developing world, over recent decades the Taita Hills have experienced significant population growth leading to associated major changes in land use and land cover (LULC), as well as escalating land degradation, particularly soil erosion. Multi-temporal medium resolution multispectral optical satellite data, such as imagery from the SPOT HRV, HRVIR, and HRG sensors, provides a valuable source of information for environmental monitoring and modelling at a landscape level at local and regional scales. However, utilization of multi-temporal SPOT data in quantitative remote sensing studies requires the removal of atmospheric effects and the derivation of surface reflectance factor. Furthermore, for areas of rugged terrain, such as the Taita Hills, topographic correction is necessary to derive comparable reflectance throughout a SPOT scene. Reliable monitoring of LULC change over time and modelling of land degradation and human population distribution and abundance are of crucial importance to sustainable development, natural resource management, biodiversity conservation, and understanding and mitigating climate change and its impacts. The main purpose of this thesis was to develop and validate enhanced processing of SPOT satellite imagery for use in environmental monitoring and modelling at a landscape level, in regions of the developing world with limited ancillary data availability. The Taita Hills formed the application study site, whilst the Helsinki metropolitan region was used as a control site for validation and assessment of the applied atmospheric correction techniques, where multiangular reflectance field measurements were taken and where horizontal visibility meteorological data concurrent with image acquisition were available. The proposed historical empirical line method (HELM) for absolute atmospheric correction was found to be the only applied technique that could derive surface reflectance factor within an RMSE of < 0.02 ps in the SPOT visible and near-infrared bands; an accuracy level identified as a benchmark for successful atmospheric correction. A multi-scale segmentation/object relationship modelling (MSS/ORM) approach was applied to map LULC in the Taita Hills from the multi-temporal SPOT imagery. This object-based procedure was shown to derive significant improvements over a uni-scale maximum-likelihood technique. The derived LULC data was used in combination with low cost GIS geospatial layers describing elevation, rainfall and soil type, to model degradation in the Taita Hills in the form of potential soil loss, utilizing the simple universal soil loss equation (USLE). Furthermore, human population distribution and abundance were modelled with satisfactory results using only SPOT and GIS derived data and non-Gaussian predictive modelling techniques. The SPOT derived LULC data was found to be unnecessary as a predictor because the first and second order image texture measurements had greater power to explain variation in dwelling unit occurrence and abundance. The ability of the procedures to be implemented locally in the developing world using low-cost or freely available data and software was considered. The techniques discussed in this thesis are considered equally applicable to other medium- and high-resolution optical satellite imagery, as well the utilized SPOT data.

Dependence Logic: Investigations into Higher-Order Semantics Defined on Teams

This thesis is a study of a rather new logic called dependence logic and its closure under classical negation, team logic. In this thesis, dependence logic is investigated from several aspects. Some rules are presented for quantifier swapping in dependence logic and team logic. Such rules are among the basic tools one must be familiar with in order to gain the required intuition for using the logic for practical purposes. The thesis compares Ehrenfeucht-Fraïssé (EF) games of first order logic and dependence logic and defines a third EF game that characterises a mixed case where first order formulas are measured in the formula rank of dependence logic. The thesis contains detailed proofs of several translations between dependence logic, team logic, second order logic and its existential fragment. Translations are useful for showing relationships between the expressive powers of logics. Also, by inspecting the form of the translated formulas, one can see how an aspect of one logic can be expressed in the other logic. The thesis makes preliminary investigations into proof theory of dependence logic. Attempts focus on finding a complete proof system for a modest yet nontrivial fragment of dependence logic. A key problem is identified and addressed in adapting a known proof system of classical propositional logic to become a proof system for the fragment, namely that the rule of contraction is needed but is unsound in its unrestricted form. A proof system is suggested for the fragment and its completeness conjectured. Finally, the thesis investigates the very foundation of dependence logic. An alternative semantics called 1-semantics is suggested for the syntax of dependence logic. There are several key differences between 1-semantics and other semantics of dependence logic. 1-semantics is derived from first order semantics by a natural type shift. Therefore 1-semantics reflects an established semantics in a coherent manner. Negation in 1-semantics is a semantic operation and satisfies the law of excluded middle. A translation is provided from unrestricted formulas of existential second order logic into 1-semantics. Also game theoretic semantics are considerd in the light of 1-semantics.

Renormalization methods in KAM theory

It is well known that an integrable (in the sense of Arnold-Jost) Hamiltonian system gives rise to quasi-periodic motion with trajectories running on invariant tori. These tori foliate the whole phase space. If we perturb an integrable system, the Kolmogorow-Arnold-Moser (KAM) theorem states that, provided some non-degeneracy condition and that the perturbation is sufficiently small, most of the invariant tori carrying quasi-periodic motion persist, getting only slightly deformed. The measure of the persisting invariant tori is large together with the inverse of the size of the perturbation. In the first part of the thesis we shall use a Renormalization Group (RG) scheme in order to prove the classical KAM result in the case of a non analytic perturbation (the latter will only be assumed to have continuous derivatives up to a sufficiently large order). We shall proceed by solving a sequence of problems in which theperturbations are analytic approximations of the original one. We will finally show that the approximate solutions will converge to a differentiable solution of our original problem. In the second part we will use an RG scheme using continuous scales, so that instead of solving an iterative equation as in the classical RG KAM, we will end up solving a partial differential equation. This will allow us to reduce the complications of treating a sequence of iterative equations to the use of the Banach fixed point theorem in a suitable Banach space.

On linear order and computation : The expressiveness of interactive computations on linear orders and computations indexed by ordinals

We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a normal form for quantifier-rank equivalence classes of linear orders in first-order logic, infinitary logic, and generalized-infinitary logics with linearly ordered clocks. We show that Scott Sentences can be manipulated quickly, classified into local information, and consistency can be decided effectively in the length of the Scott Sentence. We describe a finite set of linked automata moving continuously on a linear order. Running them on ordinals, we compute the ordinal truth predicate and compute truth in the constructible universe of set-theory. Among the corollaries are a study of semi-models as efficient database of both model-theoretic and formulaic information, and a new proof of the atomicity of the Boolean algebra of sentences consistent with the theory of linear order -- i.e., that the finitely axiomatized theories of linear order are dense.

Locality and order-invariant logics

Malli on logiikassa käytetty abstraktio monille matemaattisille objekteille. Esimerkiksi verkot, ryhmät ja metriset avaruudet ovat malleja. Äärellisten mallien teoria on logiikan osa-alue, jossa tarkastellaan logiikkojen, formaalien kielten, ilmaisuvoimaa malleissa, joiden alkioiden lukumäärä on äärellinen. Rajoittuminen äärellisiin malleihin mahdollistaa tulosten soveltamisen teoreettisessa tietojenkäsittelytieteessä, jonka näkökulmasta logiikan kaavoja voidaan ajatella ohjelmina ja äärellisiä malleja niiden syötteinä. Lokaalisuus tarkoittaa logiikan kyvyttömyyttä erottaa toisistaan malleja, joiden paikalliset piirteet vastaavat toisiaan. Väitöskirjassa tarkastellaan useita lokaalisuuden muotoja ja niiden säilymistä logiikkoja yhdistellessä. Kehitettyjä työkaluja apuna käyttäen osoitetaan, että Gaifman- ja Hanf-lokaalisuudeksi kutsuttujen varianttien välissä on lokaalisuuskäsitteiden hierarkia, jonka eri tasot voidaan erottaa toisistaan kasvavaa dimensiota olevissa hiloissa. Toisaalta osoitetaan, että lokaalisuuskäsitteet eivät eroa toisistaan, kun rajoitutaan tarkastelemaan äärellisiä puita. Järjestysinvariantit logiikat ovat kieliä, joissa on käytössä sisäänrakennettu järjestysrelaatio, mutta sitä on käytettävä siten, etteivät kaavojen ilmaisemat asiat riipu valitusta järjestyksestä. Määritelmää voi motivoida tietojenkäsittelyn näkökulmasta: vaikka ohjelman syötteen tietojen järjestyksellä ei olisi odotetun tuloksen kannalta merkitystä, on syöte tietokoneen muistissa aina jossakin järjestyksessä, jota ohjelma voi laskennassaan hyödyntää. Väitöskirjassa tutkitaan minkälaisia lokaalisuuden muotoja järjestysinvariantit ensimmäisen kertaluvun predikaattilogiikan laajennukset yksipaikkaisilla kvanttoreilla voivat toteuttaa. Tuloksia sovelletaan tarkastelemalla, milloin sisäänrakennettu järjestys lisää logiikan ilmaisuvoimaa äärellisissä puissa.

Middleware for Mobile Sensing Applications in Urban Environments

Sensor networks represent an attractive tool to observe the physical world. Networks of tiny sensors can be used to detect a fire in a forest, to monitor the level of pollution in a river, or to check on the structural integrity of a bridge. Application-specific deployments of static-sensor networks have been widely investigated. Commonly, these networks involve a centralized data-collection point and no sharing of data outside the organization that owns it. Although this approach can accommodate many application scenarios, it significantly deviates from the pervasive computing vision of ubiquitous sensing where user applications seamlessly access anytime, anywhere data produced by sensors embedded in the surroundings. With the ubiquity and ever-increasing capabilities of mobile devices, urban environments can help give substance to the ubiquitous sensing vision through Urbanets, spontaneously created urban networks. Urbanets consist of mobile multi-sensor devices, such as smart phones and vehicular systems, public sensor networks deployed by municipalities, and individual sensors incorporated in buildings, roads, or daily artifacts. My thesis is that "multi-sensor mobile devices can be successfully programmed to become the underpinning elements of an open, infrastructure-less, distributed sensing platform that can bring sensor data out of their traditional close-loop networks into everyday urban applications". Urbanets can support a variety of services ranging from emergency and surveillance to tourist guidance and entertainment. For instance, cars can be used to provide traffic information services to alert drivers to upcoming traffic jams, and phones to provide shopping recommender services to inform users of special offers at the mall. Urbanets cannot be programmed using traditional distributed computing models, which assume underlying networks with functionally homogeneous nodes, stable configurations, and known delays. Conversely, Urbanets have functionally heterogeneous nodes, volatile configurations, and unknown delays. Instead, solutions developed for sensor networks and mobile ad hoc networks can be leveraged to provide novel architectures that address Urbanet-specific requirements, while providing useful abstractions that hide the network complexity from the programmer. This dissertation presents two middleware architectures that can support mobile sensing applications in Urbanets. Contory offers a declarative programming model that views Urbanets as a distributed sensor database and exposes an SQL-like interface to developers. Context-aware Migratory Services provides a client-server paradigm, where services are capable of migrating to different nodes in the network in order to maintain a continuous and semantically correct interaction with clients. Compared to previous approaches to supporting mobile sensing urban applications, our architectures are entirely distributed and do not assume constant availability of Internet connectivity. In addition, they allow on-demand collection of sensor data with the accuracy and at the frequency required by every application. These architectures have been implemented in Java and tested on smart phones. They have proved successful in supporting several prototype applications and experimental results obtained in ad hoc networks of phones have demonstrated their feasibility with reasonable performance in terms of latency, memory, and energy consumption.

State Agent, Identity and the "New World Order" : Reconstructing Polish Defence Identity after the Cold War Era

National identity signifies and makes state s defence- and foreign policy behaviour meaningful. National consciousness is narrated into existence by narratives upon one s own exceptionalism and Otherness of the other nations. While national identity may be understood merely as a self-image of a nation, defence identity refers to the borders of Otherness and issues that have been considered as worth defending for. As national identities and all the world order models are human constructions, they may be changed by the human efforts as well; states and nations may deliberately promote communitarian or even cosmopolitan equality and tolerance without borders of Otherness. The main research question of the thesis is: How does Poland constitute herself as a nation and a state agent in the current world order and to what extent have contextual foreign and defence policy interactions changed the Polish defence identity during the post-Cold War era? The main empirical argument of the thesis is: Poland is a narrated idea of a Christian Catholic nation-state, which the Polish State, the Catholic Church of Poland, the Armed Forces of Poland as well as a majority of the Polish nation share. Polish defence identity has been almost impenetrable to contextual foreign and defence policy interactions during the post-Cold War era. While Christian religious ontology binds corporate Poland together, allowing her to survive any number of military and political catastrophes, it simultaneously brings her closer to the USA, raises tensions in the infidel EU-context, and restrains corporate Poland s pursuit of communitarian, or even cosmopolitan, global equality and tolerance. It is not the case that corporate Poland s foreign and defence policy orientation is instinctively Atlanticist by nature, as has been argued. Rather, it has been the State s rational project to overcome a habituated and reified fear of becoming geopolitically sandwiched between Russian and German Others by leaning on the USA; among the Polish nation, support for the USA has been declining since 2004. It is not corporate Poland either that has turned into a constructive European , as has been argued, but rather the Polish nation that has, at least partly, managed to emancipate itself from its habituation to a betrayal by Europe narrative, since it favours the EU as much as it favours NATO. It seems that in the Polish case a truly common European CFSP vis-à-vis Russia may offer a solution that will emancipate the Polish State from its habituated EU-sceptic role identity and corporate Poland from its narrated borders of Otherness towards Russia and Germany, but even then one cannot be sure whether any other perspective than the Polish one on a common stand towards Russia would satisfy the Poles themselves.

Mu in vitro transposition applications in protein engineering

Transposons, mobile genetic elements that are ubiquitous in all living organisms have been used as tools in molecular biology for decades. They have the ability to move into discrete DNA locations with no apparent homology to the target site. The utility of transposons as molecular tools is based on their ability to integrate into various DNA sequences efficiently, producing extensive mutant clone libraries that can be used in various molecular biology applications. Bacteriophage Mu is one of the most useful transposons due to its well-characterized and simple in vitro transposition reaction. This study establishes the properties of the Mu in vitro transposition system as a versatile multipurpose tool in molecular biology. In addition, this study describes Mu-based applications for engineering proteins by random insertional transposon mutagenesis in order to study structure-function relationships in proteins. We initially characterized the properties of the minimal Mu in vitro transposition system. We showed that the Mu transposition system works efficiently and accurately and produces insertions into a wide spectrum of target sites in different DNA molecules. Then, we developed a pentapeptide insertion mutagenesis strategy for inserting random five amino acid cassettes into proteins. These protein variants can be used especially for screening important sites for protein-protein interactions. Also, the system may produce temperature-sensitive variants of the protein of interest. Furthermore, we developed an efficient screening system for high-resolution mapping of protein-protein interfaces with the pentapeptide insertion mutagenesis. This was accomplished by combining the mutagenesis with subsequent yeast two-hybrid screening and PCR-based genetic footprinting. This combination allows the analysis of the whole mutant library en masse, without the need for producing or isolating separate mutant clones, and the protein-protein interfaces can be determined at amino acid accuracy. The system was validated by analysing the interacting region of JFC1 with Rab8A, and we show that the interaction is mediated via the JFC1 Slp homology domain. In addition, we developed a procedure for the production of nested sets of N- and C-terminal deletion variants of proteins with the Mu system. These variants are useful in many functional studies of proteins, especially in mapping regions involved in protein-protein interactions. This methodology was validated by analysing the region in yeast Mso1 involved in an interaction with Sec1. The results of this study show that the Mu in vitro transposition system is versatile for various applicational purposes and can efficiently be adapted to random protein engineering applications for functional studies of proteins.