A new type of high-order elements based on the mesh-free interpolations

We propose a new type of high-order elements that incorporates the mesh-free Galerkin formulations into the framework of finite element method. Traditional polynomial interpolation is replaced by mesh-free interpolations in the present high-order elements, and the strain smoothing technique is used for integration of the governing equations based on smoothing cells. The properties of high-order elements, which are influenced by the basis function of mesh-free interpolations and boundary nodes, are discussed through numerical examples. It can be found that the basis function has significant influence on the computational accuracy and upper-lower bounds of energy norm, when the strain smoothing technique retains the softening phenomenon. This new type of high-order elements shows good performance when quadratic basis functions are used in the mesh-free interpolations and present elements prove advantageous in adaptive mesh and nodes refinement schemes. Furthermore, it shows less sensitive to the quality of element because it uses the mesh-free interpolations and obeys the Weakened Weak (W2) formulation as introduced in [3, 5].

Karnaugh map analysis and synthesis of threshold functions

A unate function can easily be identified on a Karnaugh map from the well-known property that it cons ist s only ofess en ti al prime implicante which intersect at a common implicant. The additional property that the plot of a unate function F(x, ... XII) on a Karnaugh map should possess in order that F may also be Ivrealizable (n';:; 6) has been found. It has been sh own that the I- realizability of a unate function F corresponds to the ' compac tness' of the plot of F. No resort to tho inequalities is made, and no pre-processing such as positivizing and ordering of the given function is required.

Ultraspherical polynomials approach to the study of third-order non-linear systems

In this study, the Krylov-Bogoliubov-Mitropolskii-Popov asymptotic method is used to determine the transient response of third-order non-linear systems. Instead of averaging the non-linear functions over a cycle, they are expanded in ultraspherical polynomials and the constant term is retained. The resulting equations are solved to obtain the approximate solution. A numerical example is considered and the approximate solution is compared with the digital solution. The results show that there is good agreement between the two values.

Study of third-order non-linear systems- Variation of parameters approach

In this paper, the transient response of a third-order non-linear system is obtained by first reducing the given third-order equation to three first-order equations by applying the method of variation of parameters. On the assumption that the variations of amplitude and phase are small, the functions are expanded in ultraspherical polynomials. The expansion is restricted to the constant term. The resulting equations are solved to obtain the response of the given third-order system. A numerical example is considered to illustrate the method. The results show that the agreement between the approximate and digital solution is good thus vindicating the approximation.

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called View the MathML source’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of View the MathML source’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].

Constructing commutative semifields of square order

The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semi-fields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187{196]. We generalize this idea to a projection construction using two twisted semifields to construct semifields of odd characteristic. Planar functions and semifields have a strong connection so this also constructs new planar functions.

Guessing based on length functions

Close relationships between guessing functions and length functions are established. Good length functions lead to good guessing functions. In particular, guessing in the increasing order of Lempel-Ziv lengths has certain universality properties for finite-state sources. As an application, these results show that hiding the parameters of the key-stream generating source in a private key crypto-system may not enhance the privacy of the system, the privacy level being measured by the difficulty in brute-force guessing of the key stream.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

The Structure and Functions of Hantavirus Nucleocapsid Protein

Hantaviruses, members of the genus Hantavirus in the Bunyaviridae family, are enveloped single-stranded RNA viruses with tri-segmented genome of negative polarity. In humans, hantaviruses cause two diseases, hemorrhagic fever with renal syndrome (HFRS) and hantavirus pulmonary syndrome (HPS), which vary in severity depending on the causative agent. Each hantavirus is carried by a specific rodent host and is transmitted to humans through excreta of infected rodents. The genome of hantaviruses encodes four structural proteins: the nucleocapsid protein (N), the glycoproteins (Gn and Gc), and the polymerase (L) and also the nonstructural protein (NSs). This thesis deals with the functional characterization of hantavirus N protein with regard to its structure. Structural studies of the N protein have progressed slowly and the crystal structure of the whole protein is still not available, therefore biochemical assays coupled with bioinformatical modeling proved essential for studying N protein structure and functions. Presumably, during RNA encapsidation, the N protein first forms intermediate trimers and then oligomers. First, we investigated the role of N-terminal domain in the N protein oligomerization. The results suggested that the N-terminal region of the N protein forms a coiled-coil, in which two antiparallel alpha helices interact via their hydrophobic seams. Hydrophobic residues L4, I11, L18, L25 and V32 in the first helix and L44, V51, L58 and L65 in the second helix were crucial for stabilizing the structure. The results were consistent with the head-to-head, tail-to-tail model for hantavirus N protein trimerization. We demonstrated that an intact coiled-coil structure of the N terminus is crucial for the oligomerization capacity of the N protein. We also added new details to the head-to-head, tail-to-tail model of trimerization by suggesting that the initial step is based on interaction(s) between intact intra-molecular coiled-coils of the monomers. We further analyzed the importance of charged aa residues located within the coiled-coil for the N protein oligomerization. To predict the interacting surfaces of the monomers we used an upgraded in silico model of the coiled-coil domain that was docked into a trimer. Next the predicted target residues were mutated. The results obtained using the mammalian two-hybrid assay suggested that conserved charged aa residues within the coiled-coil make a substantial contribution to the N protein oligomerization. This contribution probably involves the formation of interacting surfaces of the N monomers and also stabilization of the coiled-coil via intramolecular ionic bridging. We proposed that the tips of the coiled-coils are the first to come into direct contact and thus initiate tight packing of the three monomers into a compact structure. This was in agreement with the previous results showing that an increase in ionic strength abolished the interaction between N protein molecules. We also showed that residues having the strongest effect on the N protein oligomerization are not scattered randomly throughout the coiled-coil 3D model structure, but form clusters. Next we found evidence for the hantaviral N protein interaction with the cytoplasmic tail of the glycoprotein Gn. In order to study this interaction we used the GST pull-down assay in combination with mutagenesis technique. The results demonstrated that intact, properly folded zinc fingers of the Gn protein cytoplasmic tail as well as the middle domain of the N protein (that includes aa residues 80 248 and supposedly carries the RNA-binding domain) are essential for the interaction. Since hantaviruses do not have a matrix protein that mediates the packaging of the viral RNA in other negatve stranded viruses (NSRV), hantaviral RNPs should be involved in a direct interaction with the intraviral domains of the envelope-embedded glycoproteins. By showing the N-Gn interaction we provided the evidence for one of the crucial steps in the virus replication at which RNPs are directed to the site of the virus assembly. Finally we started analysis of the N protein RNA-binding region, which is supposedly located in the middle domain of the N protein molecule. We developed a model for the initial step of RNA-binding by the hantaviral N protein. We hypothesized that the hantaviral N protein possesses two secondary structure elements that initiate the RNA encapsidation. The results suggest that amino acid residues (172-176) presumably act as a hook to catch vRNA and that the positively charged interaction surface (aa residues 144-160) enhances the initial N-RNA interacation. In conclusion, we elucidated new functions of hantavirus N protein. Using in silico modeling we predicted the domain structure of the protein and using experimental techniques showed that each domain is responsible for executing certain function(s). We showed that intact N terminal coiled-coil domain is crucial for oligomerization and charged residues located on its surface form a interaction surface for the N monomers. The middle domain is essential for interaction with the cytoplasmic tail of the Gn protein and RNA binding.

Functions of Alphavirus Macrodomain-containing protein nsP3

Alphaviruses are positive strand RNA viruses that replicate in association with cellular membranes. The viral RNA replication complex consists of four non-structural proteins nsP1-nsP4 which are essential for viral replication. The functions of nsP1, nsP2 and nsP4 are well established, but the roles of nsP3 are mainly unknown. In this work I have clarified some of the functions of nsP3 in order to better understand the importance of this protein in virus replication. Semliki Forest virus (SFV) has been mostly used as a model alphavirus during this work, but some experiments have also been conducted with Sindbis and Chikungunya viruses. NsP3 is composed of three different protein domains. The N-terminus of nsP3 contains an evolutionarily conserved macrodomain, the central part of nsP3 contains a domain that is only found in alphaviruses, and the C-terminus of the protein is hypervariable and predicted to be unstructured. In this work I have analyzed the functions of nsP3 macrodomain, and shown that viral macrodomains bind poly(ADP-ribose) and that they do not resemble cellular macrodomains in their properties. Furthermore, I have shown that some macrodomains, including viral macrodomains of SFV and hepatitis E virus, also bind poly(A). Mutations in the ligand binding pocket of SFV macrodomain hamper virus replication but do not confer lethality, indicating that macrodomain function is beneficial but not mandatory for virus replication. The hypervariable C-terminus of nsP3 is heavily phosphorylated and is enriched in proline residues. In this work it is shown that this region harbors an SH3 domain binding motif (Sh3BM) PxRxPR through which cellular amphiphysin is recruited to viral replication sites and to nsP3 containing cytoplasmic aggregate structures. The function of Sh3BM was destroyed by a single point mutation, which led to impaired viral RNA replication in HeLa cells, pointing out the functional importance of amphiphysin recruitment by the Sh3BM. In addition, evidence is provided tho show that the endosomal localization of alphavirus replication is mediated by nsP3 and that the phosphorylation of hypervariable region might be important for the endosomal targeting. Together these findings demonstrate that nsP3 contains multiple important host interaction motifs and domains, which facilitate successful viral propagation in host cells.

Thermodynamic consistency of the ternary functions

A ternary thermodynamic function has been developed based on statistico-thermodynamic considerations, with a particular emphasis on the higher-order terms indicating the effects of truncation at the various stages of the treatment. Although the truncation of a series involved in the equation introduces inconsistency, the latter may be removed by imposing various thermodynamic boundary conditions. These conditions are discussed in the paper. The present equation with higher-order terms shows that the α function of a component reduces to a quadratic function of composition at constant compositional paths involving the other two components in the system. The form of the function has been found to be representative of various experimental observations.

Second order cone programming approaches for handling missing and uncertain data

We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived for designing regression functions which are robust to uncertainties in the regression setting. The proposed formulations are independent of the underlying distribution, requiring only the existence of second order moments. These formulations are then specialized to the case of missing values in observations for both classification and regression problems. Experiments show that the proposed formulations outperform imputation.

A New Structure Preserving Energy Function Incorporating Transmission Line Resistances

A novel method to account for the transmission line resistances in structure preserving energy functions (SPEF) is presented in this paper. The method exploits the equivalence of a lossy network having the same conductance to susceptance ratio for all its elements to a lossless network with a new set of power injections. The system equations and the energy function are developed using centre of inertia (COI) variables and the loads are modelled as arbitrary functions of respective bus voltages. The application of SPEF to direct transient stability evaluation is presented considering a realistic power system example.

Estimation of variables at ungaged locations by empirical orthogonal functions

A technique based on empirical orthogonal functions is used to estimate hydrologic time-series variables at ungaged locations. The technique is applied to estimate daily and monthly rainfall, temperature and runoff values. The accuracy of the method is tested by application to locations where data are available. The second-order characteristics of the estimated data are compared with those of the observed data. The results indicate that the method is quick and accurate.

A maximal operator, Carleson's embedding, and tent spaces for vector-valued functions

This thesis is concerned with the area of vector-valued Harmonic Analysis, where the central theme is to determine how results from classical Harmonic Analysis generalize to functions with values in an infinite dimensional Banach space. The work consists of three articles and an introduction. The first article studies the Rademacher maximal function that was originally defined by T. Hytönen, A. McIntosh and P. Portal in 2008 in order to prove a vector-valued version of Carleson's embedding theorem. The boundedness of the corresponding maximal operator on Lebesgue-(Bochner) -spaces defines the RMF-property of the range space. It is shown that the RMF-property is equivalent to a weak type inequality, which does not depend for instance on the integrability exponent, hence providing more flexibility for the RMF-property. The second article, which is written in collaboration with T. Hytönen, studies a vector-valued Carleson's embedding theorem with respect to filtrations. An earlier proof of the dyadic version assumed that the range space satisfies a certain geometric type condition, which this article shows to be also necessary. The third article deals with a vector-valued generalizations of tent spaces, originally defined by R. R. Coifman, Y. Meyer and E. M. Stein in the 80's, and concerns especially the ones related to square functions. A natural assumption on the range space is then the UMD-property. The main result is an atomic decomposition for tent spaces with integrability exponent one. In order to suit the stochastic integrals appearing in the vector-valued formulation, the proof is based on a geometric lemma for cones and differs essentially from the classical proof. Vector-valued tent spaces have also found applications in functional calculi for bisectorial operators. In the introduction these three themes come together when studying paraproduct operators for vector-valued functions. The Rademacher maximal function and Carleson's embedding theorem were applied already by Hytönen, McIntosh and Portal in order to prove boundedness for the dyadic paraproduct operator on Lebesgue-Bochner -spaces assuming that the range space satisfies both UMD- and RMF-properties. Whether UMD implies RMF is thus an interesting question. Tent spaces, on the other hand, provide a method to study continuous time paraproduct operators, although the RMF-property is not yet understood in the framework of tent spaces.