Integrated Personal Mobility Architecture: A Complete Personal Mobility Solution

The high expectations and demand for users to access the Internet from anywhere at anytime has made user mobility an important part of the design and development of the next generation mobile communications and computing. Traditionally user mobility has been divided into two areas: Terminal Mobility and Personal Mobility. In recent years terminal mobility has focused on the movement of the terminal and developed extensions to IP protocols such as Mobile IP. In contrast, personal mobility has only received limited attention, and is somewhat lagging behind. This research has either focussed on personal mobility in communications or personalisation of operating environments. As a result, to date no framework for providing true personal mobility has emerged. In this paper, we introduce a new personal mobility framework called IPMoA (Integrated Personal Mobility Architecture), which integrates both aspects of personal mobility to provide a complete personal mobility solution, and illustrate the viability of this approach through a proof-of-concept implementation.     

Partial permutation decoding for MacDonald codes

We show how to find s-PD-sets of the minimal size \(s+1\) for the \(\left[ \frac{q^n-q^u}{q-1},n,q^{n-1}-q^{u-1}\right] _q \) MacDonald q-ary codes \(C_{n,u}(q)\) where \(n \ge 3\) and \(1 \le u \le n-1\). The construction of [6] can be used and gives s-PD-sets for s up to the bound \(\lfloor \frac{q^{n-u}-1}{(n-u)(q-1)} \rfloor -1\), of effective use for u small; for \(u \ge \lfloor \frac{n}{2} \rfloor \) an alternative construction is given that applies up to a bound that depends on the maximum size of a set of vectors in \(V_u(\mathbb {F}_q)\) with each pair of vectors distance at least 3 apart.     

Additive Manufacturing of Porous Structures for Unmanned Aerial Vehicles Applications

Unmanned aerial vehicles (UAVs) have shown promising benefits in many applications. This has been enabled by the emergence of additive manufacturing (AM), which give the designers a large amount of geometrical freedom. In this paper, a novel design process of fused deposition modeling (FDM) combining both topology and infill optimization is introduced for AM of high performance porous structures. Tensile testing of FDM printed samples is first carried out to study the effect of the build orientation on the mechanical properties of acrylonitrile butadiene styrene (ABS) samples. It is found that samples built perpendicular to the load axis are the weakest with a tensile strength of 29 MPa and Young's modulus of 1960 MPa. The materials properties are fed to the finite elements analysis (FEA) for geometrical topology optimization, aiming to maximize stiffness and reduce weight of those parts. Afterwards, an infill optimization is carried out on the topology optimized parts using different mesostructures such as honeycomb, triangular, and rectangular to achieve high structural performance. The results showed that triangular pattern with 50% infill density had the lowest developed stresses, less mass, and strain energy when compared to other structures. Optimum UAVs parts of a quadcopter are successfully manufactured, assembled, and tested.

     

Adaptive transport service for high speed networks

It has been shown that protocol processing represents a severe bottle-neck for high speed computer networks. The disadvantages of currently proposed solutions are their incompatibility with existing standardised protocol implementations, their complexity and/or their inflexibility. One method of alleviating these limitation is to have an adaptable protocol stack, as proposed in the paper. Preliminary results are presented which show that significant gains in throughput can be achieved while creating a framework suitable for future applications.     

Investment Risk Analysis in Airport Parking Facility Development

Although parking revenue is a principal source of income, supply of parking infrastructure at airports is based largely on expected needs. Although that is a rational basis, high investment costs and management fees are requiring developers and financiers to carefully analyze investment risks. This paper focuses on sources of investment risk in airport parking infrastructure development and discusses the application of Monte Carlo simulation to estimate and understand the impacts of cash flow uncertainties on project feasibility. It is shown that cost overruns, which are common in construction project development, have the most significant impact on return risk.     

Cost profile prediction for grid computing

The accurate prediction of cost profiles of future job tasks on the nodes of clusters or grids helps users to select the cost performance profile that best suits their budgets. The current software designed to deploy job tasks uses forecasts of the target computers' future load profiles. Once the job task's future load profile is known, converting it to its cost profile needs further analysis as the cost depends on other factors such as its delays and variable background loads. This paper introduces a new charging mechanism for charging future job tasks, called the Cost Profiling Model. The model has been implemented in a Software Framework and evaluated for its prediction accuracy. Copyright © 2009 John Wiley & Sons, Ltd.     

New line-based thinning algorithm

Thinning algorithms can be classified into two general types: sequential and parallel. Most of them peel off the boundaries until the objects have been reduced to thin lines. The process is performed iteratively, the number of iterations being approximately equal to half the maximum line width of the object. Several sequential boundary based algorithms have been proposed, but they have limitations. A new line-base algorithm is presented. the thinning element of the algorithm is a line and not, as more common, a point. The algorithm is based on a new line thinning model and is applicable to objects of general shape. The line-based thinning algorithm gives the freedom of choosing the deletion width at each iteration, and thus significantly reduces the number of iterations. The selection of the deletion width is a trade-off between speed and quality of skeletons. Experimental results are used to compare this new algorithm to other sequential algorithms and their relative performances are assessed. The new algorithm is shown to be computationally more efficient