A perspective of computational fluid dynamics

Computational fluid dynamics (CFD) is maturing, and is at a stage in its technological life cycle in which it is now routinely applied to some rather complicated problems; it is starting to create an impact on the design cycle of aerospace flight vehicles and their components. CFD is also being used to better understand the fluid physics of flows heretofore not understood, such as three-dimensional separation. CFD is also being used to complement and is being complemented by experiments. In this paper, the primary and secondary pacing items that govern CFD in the past are reviewed and updated. The future prospects of CFD are explored which will offer people working in the discipline challenges that should extend the technological life cycle to further increase the capabilities of a proven demonstrated technology

Performance prediction tools for low impact building design

IT systems are emerging that may be used to support decisions relating to the design of a built enviroment that has low impact in terms of energy use and environmental emissions. This paper summarises this prospect in relation to four complementary application areas: digital cities, rational planning, virtual design and Internet energy services

Addressing the challenges of implementation of high-order finite volume schemes for atmospheric dynamics of unstructured meshes

The solution of the non-hydrostatic compressible Euler equations using Weighted Essentially Non-Oscillatory (WENO) schemes in two and three-dimensional unstructured meshes, is presented. Their key characteristics are their simplicity; accuracy; robustness; non-oscillatory properties; versatility in handling any type of grid topology; computational and parallel efficiency. Their defining characteristic is a non-linear combination of a series of high-order reconstruction polynomials arising from a series of reconstruction stencils. In the present study an explicit TVD Runge-Kutta 3rd -order method is employed due to its lower computational resources requirement compared to implicit type time advancement methods. The WENO schemes (up to 5th -order) are applied to the two dimensional and three dimensional test cases: a 2D rising

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008

Applications of Soft Computing in Mobile and Wireless Communications

Soft computing is a synergistic combination of artificial intelligence methodologies to model and solve real world problems that are either impossible or too difficult to model mathematically. Furthermore, the use of conventional modeling techniques demands rigor, precision and certainty, which carry computational cost. On the other hand, soft computing utilizes computation, reasoning and inference to reduce computational cost by exploiting tolerance for imprecision, uncertainty, partial truth and approximation. In addition to computational cost savings, soft computing is an excellent platform for autonomic computing, owing to its roots in artificial intelligence. Wireless communication networks are associated with much uncertainty and imprecision due to a number of stochastic processes such as escalating number of access points, constantly changing propagation channels, sudden variations in network load and random mobility of users. This reality has fuelled numerous applications of soft computing techniques in mobile and wireless communications. This paper reviews various applications of the core soft computing methodologies in mobile and wireless communications

Energy Saving In Data Centers

Globally CO2 emissions attributable to Information Technology are on par with those resulting from aviation. Recent growth in cloud service demand has elevated energy efficiency of data centers to a critical area within green computing. Cloud computing represents a backbone of IT services and recently there has been an increase in high-definition multimedia delivery, which has placed new burdens on energy resources. Hardware innovations together with energy-efficient techniques and algorithms are key to controlling power usage in an ever-expanding IT landscape. This special issue contains a number of contributions that show that data center energy efficiency should be addressed from diverse vantage points. © 2017 by the authors. Licensee MDPI, Basel, Switzerland

Traffic-Driven Spectrum Allocation in Heterogeneous Networks

Next generation cellular networks will be heterogeneous with dense deployment of small cells in order to deliver high data rate per unit area. Traffic variations are more pronounced in a small cell, which in turn lead to more dynamic interference to other cells. It is crucial to adapt radio resource management to traffic conditions in such a heterogeneous network (HetNet). This paper studies the optimization of spectrum allocation in HetNets on a relatively slow timescale based on average traffic and channel conditions (typically over seconds or minutes). Specifically, in a cluster with $n$ base transceiver stations (BTSs), the optimal partition of the spectrum into $2^n$ segments is determined, corresponding to all possible spectrum reuse patterns in the downlink. Each BTS's traffic is modeled using a queue with Poisson arrivals, the service rate of which is a linear function of the combined bandwidth of all assigned spectrum segments. With the system average packet sojourn time as the objective, a convex optimization problem is first formulated, where it is shown that the optimal allocation divides the spectrum into at most $n$ segments. A second, refined model is then proposed to address queue interactions due to interference, where the corresponding optimal allocation problem admits an efficient suboptimal solution. Both allocation schemes attain the entire throughput region of a given network. Simulation results show the two schemes perform similarly in the heavy-traffic regime, in which case they significantly outperform both the orthogonal allocation and the full-frequency-reuse allocation. The refined allocation shows the best performance under all traffic conditions.Comment: 13 pages, 11 figures, accepted for publication by JSAC-HC