Turbulent passive scalar field of a small prandtl number

The statistical-mechanics theory of the passive scalar field convected by turbulence, developed in an earlier paper [Phys. Fluids 28, 1299 (1985)], is extended to the case of a small molecular Prandtl number. The set of governing integral equations is solved by the equation-error method. The resultant scalar-variance spectrum for the inertial range is F(k)~x−5/3/[1+1.21x1.67(1+0.353x2.32)], where x is the wavenumber scaled by Corrsin's dissipation wavenumber. This result reduces to the − (5)/(3) law in the inertial-convective range. It also approximately reduces to the − (17)/(3) law in the inertial-diffusive range, but the proportionality constant differs from Batchelor's by a factor of 3.6.

A Multiscale-Domain Decomposition Method for High Reynolds Number Flows

The high Reynolds number flow contains a wide range of length and time scales, and the flow domain can be divided into several sub-domains with different characteristic scales. In some sub-domains, the viscosity dissipation scale can only be considered in a certain direction; in some sub-domains, the viscosity dissipation scales need to be considered in all directions; in some sub-domains, the viscosity dissipation scales are unnecessary to be considered at all. For laminar boundary layer region, the characteristic length scales in the streamwise and normal directions are L and L Re-1/ 2 , respectively. The characteristic length scale and the velocity scale in the outer region of the boundary layer are L and U, respectively. In the neighborhood region of the separated point, the length scale l<numbers RDxi between different cells in Navier-Stokes (NS) equations computations for high Reynolds number flows, an idea of solving the conservation equations for discrete cells was proposed and named the discrete fluid dynamics (DFD) algorithm. Analysis shows that the basic conservative equations for discrete cells are the Euler equations, NS- and diffusion parabolized (DP) NS equations. In this paper, a new multiscale-domain decomposition method is developed for the high Reynolds number flow. First, the whole domain is decomposed to different sub-domains with the different characteristic scales. Then the different dominant equation of all sub-domains is defined according to the diffusion parabolized (DP) theory of viscous flow. Finally these different equations are solved simultaneously in whole computational region. For numerical tests of high Reynolds numerical flows, two-dimensional supersonic flows over rearward and frontward steps as well as an interaction flow between shock wave and boundary layer were solved numerically. The pressure distributions and local coefficients of skin friction on the wall are given. The numerical results obtained by the multiscale-domain decomposition algorithm are well agreement with those by NS equations. Comparing with the usual method of solving the Navier-Stokes equations in the whole flow, under the same numerical accuracy, the present multiscale domain decomposition method decreases CPU consuming about 20% and reflects the physical mechanism of practical flow more accurately.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

Sensor networks for geospatial event detection - theory and applications

This thesis presents theories, analyses, and algorithms for detecting and estimating parameters of geospatial events with today's large, noisy sensor networks. A geospatial event is initiated by a significant change in the state of points in a region in a 3-D space over an interval of time. After the event is initiated it may change the state of points over larger regions and longer periods of time. Networked sensing is a typical approach for geospatial event detection. In contrast to traditional sensor networks comprised of a small number of high quality (and expensive) sensors, trends in personal computing devices and consumer electronics have made it possible to build large, dense networks at a low cost. The changes in sensor capability, network composition, and system constraints call for new models and algorithms suited to the opportunities and challenges of the new generation of sensor networks. This thesis offers a single unifying model and a Bayesian framework for analyzing different types of geospatial events in such noisy sensor networks. It presents algorithms and theories for estimating the speed and accuracy of detecting geospatial events as a function of parameters from both the underlying geospatial system and the sensor network. Furthermore, the thesis addresses network scalability issues by presenting rigorous scalable algorithms for data aggregation for detection. These studies provide insights to the design of networked sensing systems for detecting geospatial events. In addition to providing an overarching framework, this thesis presents theories and experimental results for two very different geospatial problems: detecting earthquakes and hazardous radiation. The general framework is applied to these specific problems, and predictions based on the theories are validated against measurements of systems in the laboratory and in the field.

On the local Tamagawa number conjecture for Tate motives

There is a wonderful conjecture of Bloch and Kato that generalizes both the analytic Class Number Formula and the Birch and Swinnerton-Dyer conjecture. The conjecture itself was generalized by Fukaya and Kato to an equivariant formulation. In this thesis, I provide a new proof for the equivariant local Tamagawa number conjecture in the case of Tate motives for unramified fields, using Iwasawa theory and (φ,Γ)-modules, and provide some work towards extending the proof to tamely ramified fields.

A variational framework for spectral discretization of the density matrix in Kohn Sham density functional theory

Kohn-Sham density functional theory (KSDFT) is currently the main work-horse of quantum mechanical calculations in physics, chemistry, and materials science. From a mechanical engineering perspective, we are interested in studying the role of defects in the mechanical properties in materials. In real materials, defects are typically found at very small concentrations e.g., vacancies occur at parts per million, dislocation density in metals ranges from $10^{10} m^{-2}$ to $10^{15} m^{-2}$, and grain sizes vary from nanometers to micrometers in polycrystalline materials, etc. In order to model materials at realistic defect concentrations using DFT, we would need to work with system sizes beyond millions of atoms. Due to the cubic-scaling computational cost with respect to the number of atoms in conventional DFT implementations, such system sizes are unreachable. Since the early 1990s, there has been a huge interest in developing DFT implementations that have linear-scaling computational cost. A promising approach to achieving linear-scaling cost is to approximate the density matrix in KSDFT. The focus of this thesis is to provide a firm mathematical framework to study the convergence of these approximations. We reformulate the Kohn-Sham density functional theory as a nested variational problem in the density matrix, the electrostatic potential, and a field dual to the electron density. The corresponding functional is linear in the density matrix and thus amenable to spectral representation. Based on this reformulation, we introduce a new approximation scheme, called spectral binning, which does not require smoothing of the occupancy function and thus applies at arbitrarily low temperatures. We proof convergence of the approximate solutions with respect to spectral binning and with respect to an additional spatial discretization of the domain. For a standard one-dimensional benchmark problem, we present numerical experiments for which spectral binning exhibits excellent convergence characteristics and outperforms other linear-scaling methods.

Logarithmic Potential Theory on Riemann Surfaces

We develop a logarithmic potential theory on Riemann surfaces which generalizes logarithmic potential theory on the complex plane. We show the existence of an equilibrium measure and examine its structure. This leads to a formula for the structure of the equilibrium measure which is new even in the plane. We then use our results to study quadrature domains, Laplacian growth, and Coulomb gas ensembles on Riemann surfaces. We prove that the complement of the support of the equilibrium measure satisfies a quadrature identity. Furthermore, our setup allows us to naturally realize weak solutions of Laplacian growth (for a general time-dependent source) as an evolution of the support of equilibrium measures. When applied to the Riemann sphere this approach unifies the known methods for generating interior and exterior Laplacian growth. We later narrow our focus to a special class of quadrature domains which we call Algebraic Quadrature Domains. We show that many of the properties of quadrature domains generalize to this setting. In particular, the boundary of an Algebraic Quadrature Domain is the inverse image of a planar algebraic curve under a meromorphic function. This makes the study of the topology of Algebraic Quadrature Domains an interesting problem. We briefly investigate this problem and then narrow our focus to the study of the topology of classical quadrature domains. We extend the results of Lee and Makarov and prove (for n ≥ 3) c ≤ 5n-5, where c and n denote the connectivity and degree of a (classical) quadrature domain. At the same time we obtain a new upper bound on the number of isolated points of the algebraic curve corresponding to the boundary and thus a new upper bound on the number of special points. In the final chapter we study Coulomb gas ensembles on Riemann surfaces.

Number of Players and Relative Pitch Area per Player: Comparing Their Influence on Heart Rate and Physical Demands in Under-12 and Under-13 Football Players

The aim of the present study is to analyse the influence of different large-sided games (LSGs) on the physical and physiological variables in under-12s (U12) and -13s (U13) soccer players. The effects of the combination of different number of players per team, 7, 9, and 11 (P7, P9, and P11, respectively) with three relative pitch areas, 100, 200, and 300 m(2) (A100, A200, and A300, respectively), were analysed in this study. The variables analysed were: 1) global indicator such as total distance (TD); work:rest ratio (W:R); player-load (PL) and maximal speed (V-max); 2) heart rate (HR) mean and time spent in different intensity zones of HR (<75%, 75-84%, 84-90% and >90%), and; 3) five absolute (<8, 8-13, 13-16 and >16 Km h(-1)) and three relative speed categories (<40%, 40-60% and >60% V-max). The results support the theory that a change in format (player number and pitch dimensions) affects no similarly in the two players categories. Although it can seem that U13 players are more demanded in this kind of LSG, when the work load is assessed from a relative point of view, great pitch dimensions and/or high number of player per team are involved in the training task to the U12 players. The results of this study could alert to the coaches to avoid some types of LSGs for the U12 players such as:P11 played in A100, A200 or A300, P9 played in A200 or A300 and P7 played in A300 due to that U13>U12 in several physical and physiological variables (W:R, time spent in 84-90% HRmax, distance in 8-13 and 13-16 Km h(-1) and time spent in 40-60% V-max). These results may help youth soccer coaches to plan the progressive introduction of LSGs so that task demands are adapted to the physiological and physical development of participants.

Reynolds number influence on turbulent blocking effects of a rigid plane boundary (2nd report, direct numerical simulation using townsend's eddy forcing)

The Reynolds number influence on turbulent blocking effects by a rigid plane boundary is studied using direct numerical simulation (DNS). A new forcing method using 'simple model eddies' (Townsend 1976) for DNS of stationary homogeneous isotropic turbulence is proposed. A force field is obtained in real space by sprinkling many space-filling 'simple model eddies' whose centers are randomly but uniformly distributed in space and whose axes of rotation are random. The method is applied to a shear-free turbulent boundary layer over a rigid plane boundary and the blocking effects are investigated. The results show that stationary homogeneous isotropic turbulence is generated in real space using the present method. By using different model eddies with different sizes and rotation speeds, we could change the turbulence properties such as the integral and micro scales, the turbulent Reynolds number and the isotropy of turbulence. Turbulence intensities near the wall showed good agreements with the previous measurement and the linear analysis based on a rapid distortion theory (RDT). The splat effect (i.e., turbulence intensities of the components parallel to the boundary are amplified) occurs near the boundary and the viscous effect prohibits the splat effect at the quasi steady state at low Reynolds number.

Reynolds number influence on turbulent blocking effects of a rigid plane boundary (3rd report, direct numerical simulation on wall blocking effects for anisotropic turbulence)

The Reynolds number influence on turbulent blocking effects by a rigid plane boundary is studied using direct numerical simulation (DNS). A new forcing method proposed in the second report using Townsend's "simple model eddies" for DNS was extended to generate axisymmetric anisotropic turbulence. A force field is obtained in real space by sprinkling many space-filling "simple model eddies" whose centers are randomly but uniformly distributed in space. The axes of rotation are controlled in this study to generate axisymmetric anisotropic turbulence. The method is applied to a shear-free turbulent boundary layer over a rigid plane boundary and the blocking effects for anisotropic turbulence are investigated. The results show that stationary axisymmetric anisotropic turbulence is generated using the present method. Turbulence intensities near the wall showed good agreements with the rapid distortion theory (RDT) for small t (t ≪ TL), where TL. is the eddy turnover time. The splat effect (i. e. turbulence intensities of the components parallel to the surface are amplified) occurs near the boundary and the viscous effect attenuates the splat effect at the quasi steady state at low Reynolds number as for Isotropic turbulence. Prandtl's secondary flow of the second kind does not occur for low Reynolds number flows, which qualitatively agrees with previous observetion in a mixing-box.

An analysis of factors improving technology roadmap credibility: A communications theory assessment of roadmapping processes

In recent years, many industrial firms have been able to use roadmapping as an effective process methodology for projecting future technology and for coordinating technology planning and strategy. Firms potentially realize a number of benefits in deploying technology roadmapping (TRM) processes. Roadmaps provide information identifying which new technologies will meet firms' future product demands, allowing companies to leverage R&D investments through choosing appropriately out of a range of alternative technologies. Moreover, the roadmapping process serves an important communication tool helping to bring about consensus among roadmap developers, as well as between participants brought in during the development process, who may communicate their understanding of shared corporate goals through the roadmap. However, there are few conceptual accounts or case studies have made the argument that roadmapping processes may be used effectively as communication tools. This paper, therefore, seeks to elaborate a theoretical foundation for identifying the factors that must be considered in setting up a roadmap and for analyzing the effect of these factors on technology roadmap credibility as perceived by its users. Based on the survey results of 120 different R&D units, this empirical study found that firms need to explore further how they can enable frequent interactions between the TRM development team and TRM participants. A high level of interaction will improve the credibility of a TRM, with communication channels selected by the organization also positively affecting TRM credibility. © 2011 Elsevier Inc.

Product intelligence: Theory and practice

Are there any benefits in allowing orders and products to be able to manage their own progress through a supply chain? The notion of associating (and even embedding) information management and reasoning capabilities with a physical product has been discussed for over ten years now. This talk will review the notions of product intelligence and examine the rationales for these models and the practicality of their implementation. Both theoretical and practical issues associated with product intelligence will be examined referencing a number of trial deployments in manufacturing, logistics and aerospace equipment servicing. © 2012 IFAC.

Lyapunov theory for zeno stability

Zeno behavior is a dynamic phenomenon unique to hybrid systems in which an infinite number of discrete transitions occurs in a finite amount of time. This behavior commonly arises in mechanical systems undergoing impacts and optimal control problems, but its characterization for general hybrid systems is not completely understood. The goal of this paper is to develop a stability theory for Zeno hybrid systems that parallels classical Lyapunov theory; that is, we present Lyapunov-like sufficient conditions for Zeno behavior obtained by mapping solutions of complex hybrid systems to solutions of simpler Zeno hybrid systems defined on the first quadrant of the plane. These conditions are applied to Lagrangian hybrid systems, which model mechanical systems undergoing impacts, yielding simple sufficient conditions for Zeno behavior. Finally, the results are applied to robotic bipedal walking. © 2012 IEEE.