<p>This thesis consists of three papers on the following topics in functional analysis and probability theory: Riesz bases and frames, weakly stationary stochastic processes and analysis of set-valued stochastic processes. In the first paper we investigate Uniformly Bounded Linearly Stationary stochastic processes from the point of view of the theory of Riesz bases. By regarding these stochastic processes as generalized Riesz bases we are able to gain some new insight into there structure. Special attention is paid to regular UBLS processes as well as perturbations of weakly stationary processes. An infinite sequence of subspaces of a Hilbert space is called regular if it is decreasing and zero is the only element in its intersection. In the second paper we ask for conditions under which the regularity of a sequence of subspaces is preserved when the sequence undergoes a deformation by a linear and bounded operator. Linear, bounded and surjective operators are closely linked with frames and we also investigate when a frame is a regular sequence of vectors. A multiprocess is a stochastic process whose values are compact sets. As generalizations of the class of subharmonic processes and the class of subholomorphic processesas introduced by Thomas Ransford, in the third paper of this thesis we introduce the general notions of a gauge of processes and a multigauge of multiprocesses. Compositions of multiprocesses with multifunctions are discussed and the boundary crossing property, related to the intermediate-value property, is investigated for general multiprocesses. Time changes of multiprocesses are investigated in the environment of multigauges and we give a multiprocess version of the Dambis-Dubins-Schwarz Theorem.</p>

<p>Suppose that <b>X</b> and <b>Y</b> are Banach couples and suppose that there is a bounded linear couple map Q from <b>Y</b> to <b>X</b> which has the property that Q restricted to the endpoint spaces is injective and the images of the endpointspaces of <b>Y</b> are closed in the endpoint spaces of <b>X</b>, then we say that <b>Y</b> is a subcouple of <b>X.</b> </p><p>If F is an interpolation functor we want to know how F(<b>Y</b>) is related to F(<b>X</b>). In particular we want to know for which F it holds that Q is an injection that maps F(<b>Y</b>) onto a closed subspace of F(<b>X</b>). In recent years interest has been paid to subcouples of finite codimension and in particular to subcouples of codimension one. We will in this thesis present an interpolation theory for subcouples of codimension one and then generalize it to finite codimension. Our theory will include both a larger class of couples and a larger class of interpolation functors than earlier results.</p><p>The interpolation method that will be considered is the regular real method. Our general theory will imply older results by Kalton, Ivanov and Löfström. We will use the theory to answer questions about Hardy-type inequalities that were raised by Krugljak, Maligranda and Persson in 1999 and our new theory will also answer a question concerning interpolation of Banach algebras.</p>

This thesis treats inequalities of Carlson type, i.e. inequalities of the form &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;∥f∥&lt;/mml:mi&gt;&lt;mml:mi&gt;x&lt;/mml:mi&gt;&lt;/mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;≤&lt;/mml:mo&gt;&lt;mml:mi&gt;K&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:munderover&gt;&lt;mml:mo mml:stretchy="false"&gt;∏&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;i&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;mml:mi&gt;m&lt;/mml:mi&gt;&lt;/mml:munderover&gt;&lt;mml:msubsup&gt;&lt;mml:mi&gt;∥f∥&lt;/mml:mi&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;A&lt;/mml:mi&gt;&lt;mml:mi&gt;i&lt;/mml:mi&gt;&lt;/mml:msub&gt;&lt;mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;θ&lt;/mml:mo&gt;&lt;mml:mi&gt;i&lt;/mml:mi&gt;&lt;/mml:msub&gt;&lt;/mml:msubsup&gt;&lt;/mml:mrow&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt; where &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:munderover&gt;&lt;mml:mo mml:stretchy="false"&gt;∑&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;i&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;mml:mi&gt;m&lt;/mml:mi&gt;&lt;/mml:munderover&gt;&lt;mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;θ&lt;/mml:mo&gt;&lt;mml:mn&gt;i &lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;/mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt; and K is some constant, independent of the function f. X and &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;A&lt;/mml:mi&gt;&lt;mml:mi&gt;i&lt;/mml:mi&gt;&lt;/mml:msub&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt; are normed spaces, embedded in some Hausdorff topological vector space. In most cases, we have &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;m&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:mn&gt;2&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt;, and the spaces involved are weighted Lebesgue spaces on some measure space. For example, the inequality &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:munderover&gt;&lt;mml:mo mml:stretchy="false"&gt;∫&lt;/mml:mo&gt;&lt;mml:mn&gt;0&lt;/mml:mn&gt;&lt;mml:mo mml:stretchy="false"&gt;∞&lt;/mml:mo&gt;&lt;/mml:munderover&gt;&lt;mml:mi&gt;f&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;(&lt;/mml:mo&gt;&lt;mml:mi&gt;x&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mi mml:fontstyle="italic"&gt;dx&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;≤&lt;/mml:mo&gt;&lt;mml:msqrt&gt;&lt;mml:mo mml:stretchy="false"&gt;π&lt;/mml:mo&gt;&lt;/mml:msqrt&gt;&lt;/mml:mrow&gt;&lt;mml:msup&gt;&lt;mml:mfenced mml:open="(" mml:close=")"&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:munderover&gt;&lt;mml:mo mml:stretchy="false"&gt;∫&lt;/mml:mo&gt;&lt;mml:mn&gt;0&lt;/mml:mn&gt;&lt;mml:mo mml:stretchy="false"&gt;∞&lt;/mml:mo&gt;&lt;/mml:munderover&gt;&lt;mml:msup&gt;&lt;mml:mi&gt;f&lt;/mml:mi&gt;&lt;mml:mn&gt;2&lt;/mml:mn&gt;&lt;/mml:msup&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;(&lt;/mml:mo&gt;&lt;mml:mi&gt;x&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;mml:mi mml:fontstyle="italic"&gt;dx&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:mfenced&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;mml:mo mml:stretchy="false"&gt;/&lt;/mml:mo&gt;&lt;mml:mn&gt;4&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;mml:msup&gt;&lt;mml:mfenced mml:open="(" mml:close=")"&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:munderover&gt;&lt;mml:mo mml:stretchy="false"&gt;∫&lt;/mml:mo&gt;&lt;mml:mn&gt;0&lt;/mml:mn&gt;&lt;mml:mo mml:stretchy="false"&gt;∞&lt;/mml:mo&gt;&lt;/mml:munderover&gt;&lt;mml:msup&gt;&lt;mml:mi&gt;x&lt;/mml:mi&gt;&lt;mml:mn&gt;2 &lt;/mml:mn&gt;&lt;/mml:msup&gt;&lt;/mml:mrow&gt;&lt;mml:msup&gt;&lt;mml:mi&gt;f&lt;/mml:mi&gt;&lt;mml:mn&gt;2 &lt;/mml:mn&gt;&lt;/mml:msup&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;(&lt;/mml:mo&gt;&lt;mml:mi&gt;x&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;mml:mi mml:fontstyle="italic"&gt;dx&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:mfenced&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;mml:mo mml:stretchy="false"&gt;/&lt;/mml:mo&gt;&lt;mml:mn&gt;4&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt; first proved by F. Carlson, is the above inequality with &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;m&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:mn&gt;2&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt;, &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;θ&lt;/mml:mo&gt;&lt;mml:mn&gt;1 &lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;θ&lt;/mml:mo&gt;&lt;mml:mn&gt;2 &lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;/mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:mfrac&gt;&lt;mml:mn&gt;1 &lt;/mml:mn&gt;&lt;mml:mn&gt;2&lt;/mml:mn&gt;&lt;/mml:mfrac&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt;, &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;X&lt;/mml:mi&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;L&lt;/mml:mi&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;(&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;ℝ&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;+&lt;/mml:mo&gt;&lt;mml:mn&gt;, &lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msub&gt;&lt;mml:mi mml:fontstyle="italic"&gt;dx&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;mml:mn&gt;, &lt;/mml:mn&gt;&lt;mml:mrow&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;A&lt;/mml:mi&gt;&lt;mml:mn&gt;1 &lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;L&lt;/mml:mi&gt;&lt;mml:mn&gt;2 &lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;(&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;ℝ&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;+&lt;/mml:mo&gt;&lt;mml:mn&gt;, &lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msub&gt;&lt;mml:mi mml:fontstyle="italic"&gt;dx&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt; and &lt;mml:math&gt;&lt;mml:semantics&gt;&lt;mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;A&lt;/mml:mi&gt;&lt;mml:mn&gt;2 &lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;=&lt;/mml:mo&gt;&lt;mml:msub&gt;&lt;mml:mi&gt;L&lt;/mml:mi&gt;&lt;mml:mn&gt;2 &lt;/mml:mn&gt;&lt;/mml:msub&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;(&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:msub&gt;&lt;mml:mo mml:stretchy="false"&gt;ℝ&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;+&lt;/mml:mo&gt;&lt;mml:mn&gt;, &lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msub&gt;&lt;mml:msup&gt;&lt;mml:mi&gt;x&lt;/mml:mi&gt;&lt;mml:mn&gt;2 &lt;/mml:mn&gt;&lt;/mml:msup&gt;&lt;mml:mi mml:fontstyle="italic"&gt;dx&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mo mml:stretchy="false"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;/mml:mrow&gt;&lt;/mml:semantics&gt;&lt;/mml:math&gt;. In different situations, suffcient, and sometimes necessary, conditions are given on the weights in order for a Carlson type inequality to hold for some constant K. Carlson type inequalities have applications to e.g. moment problems, Fourier analysis, optimal sampling, and interpolation theory.

This thesis consists of three papers on the following topics in functional analysis and probability theory: Riesz bases and frames, weakly stationary stochastic processes and analysis of set-valued stochastic processes. In the first paper we investigate Uniformly Bounded Linearly Stationary stochastic processes from the point of view of the theory of Riesz bases. By regarding these stochastic processes as generalized Riesz bases we are able to gain some new insight into there structure. Special attention is paid to regular UBLS processes as well as perturbations of weakly stationary processes. An infinite sequence of subspaces of a Hilbert space is called regular if it is decreasing and zero is the only element in its intersection. In the second paper we ask for conditions under which the regularity of a sequence of subspaces is preserved when the sequence undergoes a deformation by a linear and bounded operator. Linear, bounded and surjective operators are closely linked with frames and we also investigate when a frame is a regular sequence of vectors. A multiprocess is a stochastic process whose values are compact sets. As generalizations of the class of subharmonic processes and the class of subholomorphic processesas introduced by Thomas Ransford, in the third paper of this thesis we introduce the general notions of a gauge of processes and a multigauge of multiprocesses. Compositions of multiprocesses with multifunctions are discussed and the boundary crossing property, related to the intermediate-value property, is investigated for general multiprocesses. Time changes of multiprocesses are investigated in the environment of multigauges and we give a multiprocess version of the Dambis-Dubins-Schwarz Theorem.

Suppose that <b>X</b> and <b>Y</b> are Banach couples and suppose that there is a bounded linear couple map Q from <b>Y</b> to <b>X</b> which has the property that Q restricted to the endpoint spaces is injective and the images of the endpointspaces of <b>Y</b> are closed in the endpoint spaces of <b>X</b>, then we say that <b>Y</b> is a subcouple of <b>X.</b> If F is an interpolation functor we want to know how F(<b>Y</b>) is related to F(<b>X</b>). In particular we want to know for which F it holds that Q is an injection that maps F(<b>Y</b>) onto a closed subspace of F(<b>X</b>). In recent years interest has been paid to subcouples of finite codimension and in particular to subcouples of codimension one. We will in this thesis present an interpolation theory for subcouples of codimension one and then generalize it to finite codimension. Our theory will include both a larger class of couples and a larger class of interpolation functors than earlier results. The interpolation method that will be considered is the regular real method. Our general theory will imply older results by Kalton, Ivanov and Löfström. We will use the theory to answer questions about Hardy-type inequalities that were raised by Krugljak, Maligranda and Persson in 1999 and our new theory will also answer a question concerning interpolation of Banach algebras.

We give some background information about the Cauchy-Schwarz inequality including its history. We then continue by providing a number of proofs for the inequality in its classical form using various proof techniques, including proofs without words. Next we build up the theory of inner product spaces from metric and normed spaces and show applications of the Cauchy-Schwarz inequality in each content, including the triangle inequality, Minkowski's inequality and Hölder's inequality. In the final part we present a few problems with solutions, some proved by the author and some by others.

In this thesis we examine different types of convergence for sequences of functions and how these are related. The functions considered are real valued Lebesgue measurablefunctions defined on a subset of R. We also devote a chapter to explore when continuity of a sequence of functions is preserved under pointwise convergence, and see that this happens precisely when the convergence is quasi uniform. / I denna uppsats utforskar vi olika typer av konvergens för funktionsföljder för att se hur de är besläktade. Funktionerna i fråga är reellvärda Lebesguemätbara funktioner definierade på delmängder av R. Vi ägnar också ett kapitel åt att undersöka när kontinuitet hos en följd av funktioner bevaras under punktvis konvergens och ser att detta händer precis då konvergensen är kvasilikformig.

The focus of this thesis is the assessment of telematic systems for road freight transport from a planning perspective. The aim is to support strategic decisions related to architectural choices for such systems, with the possibility to achieve synergies by supporting multiple telematic services. The past decade has witnessed enormous growth in cargo volumes resulting in increasing demand for transport capacity. To match this increasing demand only with expansion of infrastructure, e.g. road and vehicles, does not seem to be a sustainable strategy. One of the few approaches with the potential to improve the use of current transport capacity is the integrated use of modern information and communication technology, otherwise known as telematic systems for road transport, an important component within Intelligent Transport Systems (ITS). This type of systems can deliver multiple services that can be used to improve the efficiency and safety of road freight transport. However, attempts to unleash the potential of telematic systems and make maximum possible use of the available transport capacity have been hindered by several challenges ranging from planning and design to development and deployment. Considering the large scope of possible telematic services that can potentially be deployed in road freight transport, this thesis suggests a framework in order to enable structured assessment of telematic systems. Based on the suggested framework, a set of potential transport telematic services are identified and a method for quantifying the value of the services to society is developed. The suggested method takes into account the expected impact on different transportation challenges, such as accidents, fuel consumption, and infrastructure maintenance. Quantitative methods are provided for studying the value of services sharing a common infrastructure. Using quantified benefits of services and costs of various functionalities required by telematic services, the concept of a multi-service architecture is investigated using optimization methods, which handles the multi-dimensional relations between different services that are otherwise difficult to analyze with traditional cost-benefit analysis. The analyses show which telematic services can be achieved with different approaches, such as vehicle-to-vehicle communication, vehicle-to-infrastructure communication, etc. Although multi-service architectures are promising, several challenges need to be overcome, including security, service quality, privacy, and business models. The knowledge gained from the work presented in this thesis can be valuable for different stakeholders, such as governments, service providers, and transport service users, in fostering the planning, design, development, and deployment of telematic systems in transport.

Association rules are one of the most popular methods of data mining. This technique allows to discover interesting dependences between objects. The thesis concerns on association rules for hierarchy of objects. As a multi–level structure is used DBLP database, which contains bibliographic descriptions of scientific papers conferences and journals in computer science. The main goal of thesis is investigation of interesting patterns of co-authorship with respect to different levels of hierarchy. To reach this goal own extracting method is proposed. / p.pietruszewski@op.pl

Web browsing posses a major share among the activities on the Internet. Heavy usage of web browsing makes the Web Quality of Experience (QoE) one of the critical factor in deciding the overall success of network services. Amongst others, Web QoE can be effected by the delays in network that can result in higher application download times. In this thesis work, an effort has been made to map applications level download times to Quality of Experience. A subjective analysis on how the user takes into account the domain of web browsing has been carried out. For this purpose a testbed was developed at Blekinge Institute of Technology on which different users were tested. Specific sequences of delays were introduced on the network which resulted in desired application download times. Regression analysis was performed and a mapping between user QoE and application download times was carried out. Based on the results conclusions were made which are presented in this thesis report. / maxi_aks@hotmail.com Skype: ashfaq84 LinkedIn: www.linkedin.com/in/ashfaqahmadshinwary