Interference aware resource allocation for hybrid hierarchical wireless networks

This paper addresses the problem of interference aware resource allocation for OFDMA based hybrid hierarchical wireless networks. We develop two resource allocation algorithms considering the impact of wireless interference constraints using a weighted SINR conflict graph to quantify the interference among the various nodes: (1) interference aware routing using maximum concurrent flow optimization; and (2) rate adaptive joint subcarrier and power allocation algorithm under interference and QoS constraints. We exploit spatial reuse to allocate subcarriers in the network and show that an intelligent reuse of resources can improve throughput while mitigating interference. We provide a sub-optimal heuristic to solve the rate adaptive resource allocation problem. We demonstrate that aggressive spatial reuse and fine tuned-interference modeling garner advantages in terms of throughput, end-to-end delay and power distribution.     

A software architecture framework for on-line option pricing

The problem of growing computational complexity in the finance industry demands manageable, high-speed and real-time solutions in solving complex mathematical problems such as option pricing. In current option trading scenarios, determining a fair price for options “any time” and “anywhere” has become vital yet difficult computational problem. In this study, we have designed, implemented, and deployed an architecture for pricing options on-line using a hand-held device that is J2ME-based Mobile computing-enabled and is assisted by web mining tools. In our architecture, the client is a MIDP user interface, and the back end servlet runs on a standalone server bound to a known port address. In addition, the server uses table-mining techniques to mine real-time data from reliable web sources upon the mobile trader’s directive. The server performs all computations required for pricing options since mobile devices have limited battery power, low bandwidth, and low memory. We have parallelized and implemented various computational techniques such as binomial lattice and finite differencing. To the best of our knowledge, this is one of the first studies that facilitate the mobile-enabled-trader to compute the price of an option in ubiquitous fashion. This architecture aims at providing the trader with various computational techniques to avail (to provide results from approximate to accurate results) while on-the-go and to make important and effective trading decisions using the results that will ensure higher returns on investments in options.

Applying a critical approach to investigate barriers to digital inclusion and online social networking among young people with disabilities

Despite the seeming ubiquity of young people's Internet use, there are still many for whom access to the Internet and online social networking remains inequitable and patterned by disadvantage. The connection between information technology and young people with disabilities is particularly under‐researched. This article contributes to the field of critical information systems research by exposing significant barriers and facilitators to Internet accessibility for young people with disabilities. It uses Bourdieu's critical theory to explore how the unequal distribution of resources shapes processes of digital inclusion for young people with disabilities. It highlights access needs and experiences that are both disability and non‐disability related. The article draws on interviews in South Australia with 18 young people aged 10–18 years with a physical disability (such as cerebral palsy) or acquired brain injury and with 17 of their family members. Interviews evaluated participants' and parents' reflections on the benefits of a home‐based, goal‐oriented intervention to increase the young person's Internet use for social participation purposes. The Bourdieuian analysis demonstrated how varying levels of accrued individual and family offline capital resources are related to digital/online resources and disability‐specific online resources. This revealed how unequal resources of capital can influence technology use and hence digital inclusion for young people with disabilities. Our study demonstrates that young people with particular types of disabilities require intensive, personalised and long‐term support from within and beyond the family to ‘get online’. We conclude that Internet studies need to more frequently adopt critical approaches to investigate the needs of users and barriers to information technology use within sub‐groups, such as young people with disabilities. © 2016 John Wiley & Sons Ltd     

Microwave tomography for breast cancer detection on Cell broadband engine processors

Microwave tomography (MT) is a safe screening modality that can be used for breast cancer detection. The technique uses the dielectric property contrasts between different breast tissues at microwave frequencies to determine the existence of abnormalities. Our proposed MT approach is an iterative process that involves two algorithms: Finite-Difference Time-Domain (FDTD) and Genetic Algorithm (GA). It is a compute intensive problem: (i) the number of iterations can be quite large to detect small tumors; (ii) many fine-grained computations and discretizations of the object under screening are required for accuracy. In our earlier work, we developed a parallel algorithm for microwave tomography on CPU-based homogeneous, multi-core, distributed memory machines. The performance improvement was limited due to communication and synchronization latencies inherent in the algorithm. In this paper, we exploit the parallelism of microwave tomography on the Cell BE processor. Since FDTD is a numerical technique with regular memory accesses, intensive floating point operations and SIMD type operations, the algorithm can be efficiently mapped on the Cell processor achieving significant performance. The initial implementation of FDTD on Cell BE with 8 SPEs is 2.9 times faster than an eight node shared memory machine and 1.45 times faster than an eight node distributed memory machine. In this work, we modify the FDTD algorithm by overlapping computations with communications during asynchronous DMA transfers. The modified algorithm also orchestrates the computations to fully use data between DMA transfers to increase the computation-to-communication ratio. We see 54% improvement on 8 SPEs (27.9% on 1 SPE) for the modified FDTD in comparison to our original FDTD algorithm on Cell BE. We further reduce the synchronization latency between GA and FDTD by using mechanisms such as double buffering. We also propose a performance prediction model based on DMA transfers, number of instructions and operations, the processor frequency and DMA bandwidth. We show that the execution time from our prediction model is comparable (within 0.5 s difference) with the execution time of the experimental results on one SPE.     

Finding a Path Subject to Many Additive QoS Constraints

A fundamental problem in quality-of-service (QoS) routing is to find a path between a source-destination node pair that satisfies two or more end-to-end QoS constraints. We model this problem using a graph with n vertices and m edges with K additive QoS parameters associated with each edge, for any constant Kges2. This problem is known to be NP-hard. Fully polynomial time approximation schemes (FPTAS) for the case of K=2 have been reported in the literature. We concentrate on the general case and make the following contributions. 1) We present a very simple (Km+nlogn) time K-approximation algorithm that can be used in hop-by-hop routing protocols. 2) We present an FPTAS for one optimization version of the QoS routing problem with a time complexity of O(m(n/epsi)^K-1). 3) We present an FPTAS for another optimization version of the QoS routing problem with a time complexity of O(nlogn+m(H/epsi)^K-1) when there exists an H-hop path satisfying all QoS constraints. When K is reduced to 2, our results compare favorably with existing algorithms. The results of this paper hold for both directed and undirected graphs. For ease of presentation, undirected graph is used     

Enhancing performance of failure-prone clusters by adaptive provisioning of cloud resources

In this paper, we investigate Cloud computing resource provisioning to extend the computing capacity of local clusters in the presence of failures. We consider three steps in the resource provisioning including resource brokering, dispatch sequences, and scheduling. The proposed brokering strategy is based on the stochastic analysis of routing in distributed parallel queues and takes into account the response time of the Cloud provider and the local cluster while considering computing cost of both sides. Moreover, we propose dispatching with probabilistic and deterministic sequences to redirect requests to the resource providers. We also incorporate checkpointing in some well-known scheduling algorithms to provide a fault-tolerant environment. We propose two cost-aware and failure-aware provisioning policies that can be utilized by an organization that operates a cluster managed by virtual machine technology, and seeks to use resources from a public Cloud provider. Simulation results demonstrate that the proposed policies improve the response time of users’ requests by a factor of 4.10 under a moderate load with a limited cost on a public Cloud.     

Synthesis and characterization of chlorinated soy oil based epoxy resin/glass fiber composites

Composites with good toughness properties were prepared from chemically modified soy epoxy resin and glass fiber without additional petroleum based toughening agent. Chlorinated soy epoxy (CSE) resin was prepared from soybean oil. The CSE was characterised by spectral, and titration method. The prepared CSE was blended with commercial epoxy resin in different ratios and cured at 85°C for 3 h, and post cured at 225°C for 2 h using m‐phenylene diamine (MPDA) as curing agent. The cure temperatures of epoxy/CSE/MPDA with different compositions were found to be in the range of (151.2–187.5°C). The composite laminates were fabricated using epoxy /CSE/MPDA‐glass fiber at different compositions. The mechanical properties such as tensile strength (248–299 MPa), tensile modulus (2.4–3.4 GPa), flexural strength (346–379 MPa), flexural modulus (6.3–7.8 GPa) and impact strength (29.7–34.2) were determined. The impact strength increased with the increase in the CSE content. The interlaminor fracture toughness (G_IC) values also increased from 0.6953 KJ/m² for neat epoxy resin to 0.9514 KJ/m² for 15%CSE epoxy‐modified system. Thermogravimetric studies reveal that the thermal stability of the neat epoxy resin was decreased by incorporation of CSE. POLYM. COMPOS., 2009. © 2008 Society of Plastics Engineers