Legal Requirements for Admission to Public Schools

Advanced driver assistance systems for heavy duty vehicles, such as lookahead cruise and gearshift controllers, rely on high quality map data. Current digital maps do not offer the required level of road grade information. This contribution presents an algorithm for on-board road grade estimation based on fusion of GPS and vehicle sensor data with measurements from previous runs over the same road segment. An incremental update scheme is utilized to ensure that data storage requirements are independent of the number of measurement runs. Results of the implemented system based on six traversals of a known road with three different vehicles are presented.QC 20120216</p

Model reduction of networked passive systems through clustering

In this paper, a model reduction procedure for a network of interconnected identical passive subsystems is presented. Here, rather than performing model reduction on the subsystems, adjacent subsystems are clustered, leading to a reduced-order networked system that allows for a convenient physical interpretation. The identification of the subsystems to be clustered is performed through controllability and observability analysis of an associated edge system and it is shown that the property of synchronization (i.e., the convergence of trajectories of the subsystems to each other) is preserved during reduction. The results are illustrated by means of an example.Comment: 7 pages, 2 figures; minor changes in the final version, as accepted for publication at the 13th European Control Conference, Strasbourg, Franc

Construction of totally reflexive modules from an exact pair of zero divisors

Let A be a local ring which admits an exact pair x,y of zero divisors as defined by Henriques and Sega. Assuming that this pair is regular and that there exists a regular element on the A-module A/(x,y), we explicitly construct an infinite family of non-isomorphic indecomposable totally reflexive A-modules. In this setting, our construction provides an answer to a question raised by Christensen, Piepmeyer, Striuli, and Takahashi. Furthermore, we compute the module of homomorphisms between any two given modules from the infinite family mentioned above.Comment: 15 page

Tube domains and restrictions of minimal representations

In this paper we study the restrictions of the minimal representation in the analytic continuation of the scalar holomorphic discrete series from $Sp(n,\mathbb{R})$ to $GL(n,\mathbb{R})$, and from SU(n,n) to $GL(n,\mathbb{C})$ respectively. We work with the realisations of the representation spaces as $L^2$-spaces on the boundary orbits of rank one of the corresponding cones, and give explicit integral operators that play the role of the intertwining operators for the decomposition. We prove inversion formulas for dense subspaces and use them to prove the Plancherel theorem for the respective decomposition. The Plancherel measure turns out to be absolutely continuous with respect to the Lebesgue measure in both cases

Traffic measurement and analysis

Measurement and analysis of real traffic is important to gain knowledge about the characteristics of the traffic. Without measurement, it is impossible to build realistic traffic models. It is recent that data traffic was found to have self-similar properties. In this thesis work traffic captured on the network at SICS and on the Supernet, is shown to have this fractal-like behaviour. The traffic is also examined with respect to which protocols and packet sizes are present and in what proportions. In the SICS trace most packets are small, TCP is shown to be the predominant transport protocol and NNTP the most common application. In contrast to this, large UDP packets sent between not well-known ports dominates the Supernet traffic. Finally, characteristics of the client side of the WWW traffic are examined more closely. In order to extract useful information from the packet trace, web browsers use of TCP and HTTP is investigated including new features in HTTP/1.1 such as persistent connections and pipelining. Empirical probability distributions are derived describing session lengths, time between user clicks and the amount of data transferred due to a single user click. These probability distributions make up a simple model of WWW-sessions

A Closed-Form Solution to the Arbitrary Order Cauchy Problem with Propagators

The general abstract arbitrary order (N) Cauchy problem was solved in a closed form as a sum of exponential propagator functions. The infinite sparse exponential series was solved with the aid of a homogeneous differential equation. It generated a linear combination of exponential functions. The Cauchy problem solution was formed with N linear combinations of N exponential propagators.Comment: 6 page