A study on the behaviour of steel braced barrel vaults

The computer analysis of steel braced barrel vaults is presented. This analysis is compared with the approximate method of analysis suggested by Baer. The drawbacks of Baer's method are discussed. The behaviour of these frames due to the effect of laterals, edge trusses and different types of bracing systems is predicted. Based on this parametric study an economic system of braced barrel vault is suggested for practical applications.     

A Microprocessor-Based Full Voltage Starting of Induction Motor with Switched Capacitors

ABSTRACT

Increasing concerns over the starting of induction motors with high starting torque requirements have prompted engineers to seek methods of starting with full voltage and switched capacitors. This method provides ample acceleration torque with minimum voltage disturbances on the main bus. A highly reliable microprocessor-based starter with high performance has been developed. The hardware and software architecture of this starter and its starting aspects are described. The programmable automation provided here allows a flexibility in algorithms which can be altered or expanded easily. The performance goals designed also include protection of induction motor against overload, phase loss, wrong phase sequence and severe over voltage due to self-excitation.     

Log-convexity of rate region in 802.11e WLANs

In this paper we establish the log-convexity of the rate region in 802.11 WLANs. This generalises previous results for Aloha networks and has immediate implications for optimisation based approaches to the analysis and design of 802.11 wireless networks.     

Query Optimization in Multidatabase Systems

Global query execution in a multidatabase system can be done parallelly, as all the local databases are independent. In this paper, a cost model that considers parallel execution of subqueries for a global query is developed. In order to obtain maximum parallelism in query execution, it is required to find a query execution plan that is represented in the form of a bushy tree and this query tree should be balanced to the maximal possible extent with respect to execution time. A new bottom up approach called Agglomerative Approach (AA) is proposed to construct balanced bushy trees with respect to execution time. By the deterministic nature of this approach, it generates local optimal solutions. This local minima problem will be severe in the case of graph queries, i.e., queries that are represented with a graph structure. A Simulated annealing Approach (SA) is employed to obtain a (near) optimal solution. These approaches (AA and SA) are suitable for handling on-line and off-line queries respectively. A Hybrid Approach (HA), that is an integration of AA and SA, is proposed to optimize queries for which the estimated time to be spent on optimization is known a priori. Results obtained with AA and SA on both tree and graph structured queries are presented.     

A Novel Vehicle-Based GNSS Integrity Augmentation System for Autonomous Airport Surface Operations

Autonomous vehicles equipped with integrity augmentation systems offer the potential to increase safety, efficiency and sustainability of airport ground operations. The model predictive behavior of these systems supports a timely detection of any deviations from the Required Navigation Performance (RNP), producing useful alerts for onboard mission management. Firstly, the system architecture of a Navigation and Guidance System (NGS) for autonomous airport surface vehicle operations based on Global Navigation Satellite System (GNSS) measurements is described. Subsequently, an integrity augmentation module is implemented in the NGS by modeling the key GNSS signal degradation phenomena including masking, multipath and signal attenuation. The GNSS integrity augmentation system is capable of monitoring the RNP and alerting the remote operator of the airport surface vehicle. The uniqueness of the presented system is that both caution and warning flags are produced based on prediction-avoidance and reaction-correction capabilities respectively. Additionally, the system is capable of issuing suitable steering commands to the onboard mission management system/remote ground base station operator in the event of GNSS signal degradations or losses. Multipath is modelled in detail using a ray tracing algorithm and the vehicle position error is computed as a function of relative geometry between the satellites, receiver antenna and reflectors in realistic airport operation scenarios. Additionally, the surface vehicle dynamics and reflective surfaces of buildings are modelled in order to simulate a vehicle trajectory through a typical airport airside/aprons environment. Simulation case studies are performed to validate the mathematical models developed for the integrity augmentation system and the results corroborate the suitability of the proposed system to generate useful and timely integrity flags when GNSS is used as the primary means of navigation.     

Improved bounds for large scale capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) stands among the hardest combinatorial problems to solve or to find high quality solutions. This becomes even more true when dealing with large instances. This paper investigates methods to improve on lower and upper bounds of instances on graphs with over 200 vertices and 300 edges, dimensions that, today, can be considered of large scale. On the lower bound side, we propose to explore the speed of a dual ascent heuristic to generate capacity cuts. These cuts are next improved with a new exact separation enchained to the linear program resolution that follows the dual heuristic. On the upper bound, we implement a modified Iterated Local Search procedure to Capacitated Vehicle Routing Problem (CVRP) instances obtained by applying a transformation from the CARP original instances. Computational experiments were carried out on the set of large instances generated by Brandão and Eglese and also on the regular size sets. The experiments on the latter allow for evaluating the quality of the proposed solution approaches, while those on the former present improved lower and upper bounds for all instances of the corresponding set.