Randomized Parallelization – a New Method for Solving Hard Combinatorial Problems

A new method for solving some hard combinatorial optimization problems is suggested, admitting a certain reformulation. Considering such a problem, several different similar problems are prepared which have the same set of solutions. They are solved on computer in parallel until one of them will be solved, and that solution is accepted. Notwithstanding the evident overhead, the whole run-time could be significantly reduced due to dispersion of velocities of combinatorial search in regarded cases. The efficiency of this approach is investigated on the concrete problem of finding short solutions of non-deterministic system of linear logical equations.

Do educators need educating?

Actual text: I was recently at the Spanish College of Optometry biennial conference and attended a meeting of contact lens lecturers from around Spain and Portugal. We discussed various ideas, mainly about how to share good practice and improve standards. What came to my mind was ‘is there a blueprint for training trainers?’ Well probably not but there are many things that we need to acknowledge such as the way students learn for example. Many educators themselves were taught by lecturers who would write on a blackboard or use acetate on an overhead projector, then came the 35 mm slide era followed by the Powerpoint era. More recently there is a move towards a much more integrated approach of various teaching methods. At my university our contact lens and anterior eye lectures generally follow a format where a narrated Powerpoint lecture is uploaded onto our internal virtual learning environment. This narrated version of the slides is designed to give the didactic element of the topic. The students listen to that before attending an interactive seminar on that topic. The seminar is also recorded so that students can listen to that afterwards. The seminar is designed to give additional information, such as case reports, or to clarify key points or for live demonstrations. It is a good way of doubling the contact time with the students without imposing further on an already packed formal timetable as the students can work in their own time. One problem that we noticed with this approach was that attendance can vary. If the students feel that they will gain something from the interactive seminar then they are more likely to attend – exam tips usually win them over! At the Spanish meeting the educators decided that they wanted to have regular meetings. The industry colleagues in attendance said that they were happy to help but could not necessarily give money, but they could offer meeting rooms, pay for lunch and evening meals. They even said that that they were happy to host meetings and invite other companies too (except to manufacturing plants). In the UK the British Committee of Contact Lens Educators (BUCCLE) meets for one day on three occasions in the year. The American Optometric Contact Lens Educators (AOCLE) meets annually at a three day event. Both these organisations get some help from industry. BUCCLE usually has one of its meetings at a university, one at a company training centre/manufacturing plant/national headquarters and one meeting the day before the BCLA annual conference. BUCCLE usually has its pre-BCLA meeting in conjunction with the International Association of Contact Lens Educators (IACLE). So when educators meet what would they discuss; well probably the focus should be on education rather than actual contact lens knowledge. For example sharing ideas on how to teach toric lens fitting would be better than discussing the actual topic of toric lenses itself. Most universities will have an education department with an expert who could share ideas on how to use the internet in teaching or how to structure lectures or assessments etc. In the past I have helped with similar training programmes in other countries and sharing good practice in pedagogy is always a popular topic. Anyone who is involved in education in the field of contact lenses should look at the IACLE web page and look out for the IACLE World Congress in 2015 in the days preceding the BCLA. Finally, IACLE, AOCLE and BUCCLE all exist as a result of generous educational grants from contact lens companies and anyone interested in finding out more about should refer to their respective web pages.

Cramer-Rao bound analysis of location estimation in multi-hop wireless sensor networks

Location estimation is important for wireless sensor network (WSN) applications. In this paper we propose a Cramer-Rao Bound (CRB) based analytical approach for two centralized multi-hop localization algorithms to get insights into the error performance and its sensitivity to the distance measurement error, anchor node density and placement. The location estimation performance is compared with four distributed multi-hop localization algorithms by simulation to evaluate the efficiency of the proposed analytical approach. The numerical results demonstrate the complex tradeoff between the centralized and distributed localization algorithms on accuracy, complexity and communication overhead. Based on this analysis, an efficient and scalable performance evaluation tool can be designed for localization algorithms in large scale WSNs, where simulation-based evaluation approaches are impractical. © 2013 IEEE.

73.7 Tb/s (96 x 3 x 256-Gb/s) mode-divisionmultiplexed DP-16QAM transmission with inline MM-EDFA

Transmission of a 73.7 Tb/s (96x3x256-Gb/s) DP-16QAM mode-division- multiplexed signal over 119km of few-mode fiber transmission line incorporating an inline multi mode EDFA and a phase plate based mode (de-)multiplexer is demonstrated. Data-aided 6x6 MIMO digital signal processing was used to demodulate the signal. The total demonstrated net capacity, taking into account 20% of FEC-overhead and 7.5% additional overhead (Ethernet and training sequences), is 57.6 Tb/s, corresponding to a spectral efficiency of 12 bits/s/Hz. © 2012 Optical Society of America.

Optimal Resource Deployment in an Infostation-Based Network

This paper considers the problem of finding an optimal deployment of information resources on an InfoStation network in order to minimize the overhead and reduce the time needed to satisfy user requests for resources. The RG-Optimization problem and an approach for its solving are presented as well.

Adaptive time synchronization and frequency offset estimation for CO-OFDM

We propose a robust adaptive time synchronization and frequency offset estimation method for coherent optical orthogonal frequency division multiplexing (CO-OFDM) systems by applying electrical dispersion pre-compensation (pre-EDC) to the pilot symbol. This technique effectively eliminates the timing error due to the fiber chromatic dispersion, thus increasing significantly the accuracy of the frequency offset estimation process and improving the overall system performance. In addition, a simple design of the pilot symbol is proposed for full-range frequency offset estimation. This pilot symbol can also be used to carry useful data to effectively reduce the overhead due to time synchronization by a factor of 2.

Novel BCH code design for mitigation of phase noise induced cycle slips in DQPSK systems

We show that by proper code design, phase noise induced cycle slips causing an error floor can be mitigated for 28 Gbaud DQPSK systems. Performance of BCH codes are investigated in terms of required overhead. © 2014 OSA.

Phase-conjugated pilots for fibre nonlinearity compensation in CO-OFDM transmission

In this paper, we demonstrate a novel fiber nonlinearity compensation technique for coherent optical orthogonal frequency-division multiplexing (CO-OFDM) systems based on the transmission of phase-conjugated pilots (PCPs). In this scheme, a portion of OFDM subcarriers (up to 50%) is transmitted with its phase conjugates, which is used at the receiver to estimate the nonlinear distortions in the respective subcarriers and other subcarriers, which are not accompanied by PCPs. Simulation and experimental results show that by varying the PCP overhead, a performance improvement up to 4 dB can be achieved. In addition, the proposed technique can be effectively applied in both single polarization and polarization-division multiplexed systems, in both single channel and wavelength-division multiplexing systems, thus, offering highest flexibility in implementations.

Fiber nonlinearity-induced penalty reduction in CO-OFDM by ANN-based nonlinear equalization

We experimentally demonstrate ∼2 dB quality (Q)-factor enhancement in terms of fiber nonlinearity compensation of 40 Gb/s 16 quadrature amplitude modulation coherent optical orthogonal frequency-division multiplexing at 2000 km, using a nonlinear equalizer (NLE) based on artificial neural networks (ANN). Nonlinearity alleviation depends on escalation of the ANN training overhead and the signal bit rate, reporting ∼4 dB Q-factor enhancement at 70 Gb/s, whereas a reduction of the number of ANN neurons annihilates the NLE performance. An enhanced performance by up to ∼2 dB in Q-factor compared to the inverse Volterra-series transfer function NLE leads to a breakthrough in the efficiency of ANN.

Application of automatic load transfer on feeder utilisation balance

This paper looks at how automatic load transfer may be used as a possible planning tool to help deliver faster connections for customers. A trial on an area of overhead line Network is presented to show how improvements in % feeder utilisation may be realised by changing the location of the open point. The reported Network data is compared to calculated data under two different configurations over a two week trial period. The results show that ALT open point determination in the presence of generation is different from a load only circuit and that the open points may not be fixed with time. Looking at improvements in Network headroom may not be conducive to other improvements in the network such as loss reduction or improving voltage profiles.

HYBRID TCP/UDP video transport for H.264/AVC content delivery in burst loss networks

In this paper we propose a hybrid TCP/UDP transport, specifically for H.264/AVC encoded video, as a compromise between the delay-prone TCP and the loss-prone UDP. When implementing the hybrid approach, we argue that the playback at the receiver often need not be 100% perfect, provided that a certain level of quality is assured. Reliable TCP is used to transmit and guarantee delivery of the most important packets. This allows use of additional features in the H.264/AVC standard which simultaneously provide an enhanced playback quality, in addition to a reduction in throughput. These benefits are demonstrated through experimental results using a test-bed to emulate the hybrid proposal. We compare the proposed system with other protection methods, such as FEC, and in one case show that for the same bandwidth overhead, FEC is unable to match the performance of the hybrid system in terms of playback quality. Furthermore, we measure the delay associated with our approach, and examine its potential for use as an alternative to the conventional methods of transporting video by either TCP or UDP alone. © 2011 IEEE.

Benchmarking of distributed computing engines spark and GraphLab for big data analytics

In this paper we evaluate and compare two representativeand popular distributed processing engines for large scalebig data analytics, Spark and graph based engine GraphLab. Wedesign a benchmark suite including representative algorithmsand datasets to compare the performances of the computingengines, from performance aspects of running time, memory andCPU usage, network and I/O overhead. The benchmark suite istested on both local computer cluster and virtual machines oncloud. By varying the number of computers and memory weexamine the scalability of the computing engines with increasingcomputing resources (such as CPU and memory). We also runcross-evaluation of generic and graph based analytic algorithmsover graph processing and generic platforms to identify thepotential performance degradation if only one processing engineis available. It is observed that both computing engines showgood scalability with increase of computing resources. WhileGraphLab largely outperforms Spark for graph algorithms, ithas close running time performance as Spark for non-graphalgorithms. Additionally the running time with Spark for graphalgorithms over cloud virtual machines is observed to increaseby almost 100% compared to over local computer clusters.

Performance optimisation of the MAC protocol with multiple contention slots in MIMO ad hoc networks

The multiple-input multiple-output (MIMO) technique can be used to improve the performance of ad hoc networks. Various medium access control (MAC) protocols with multiple contention slots have been proposed to exploit spatial multiplexing for increasing the transport throughput of MIMO ad hoc networks. However, the existence of multiple request-to-send/clear-to-send (RTS/CTS) contention slots represents a severe overhead that limits the improvement on transport throughput achieved by spatial multiplexing. In addition, when the number of contention slots is fixed, the efficiency of RTS/CTS contention is affected by the transmitting power of network nodes. In this study, a joint optimisation scheme on both transmitting power and contention slots number for maximising the transport throughput is presented. This includes the establishment of an analytical model of a simplified MAC protocol with multiple contention slots, the derivation of transport throughput as a function of both transmitting power and the number of contention slots, and the optimisation process based on the transport throughput formula derived. The analytical results obtained, verified by simulation, show that much higher transport throughput can be achieved using the joint optimisation scheme proposed, compared with the non-optimised cases and the results previously reported.

3D TerraFly: Quality of service management for online interactive 3D geographic information system

3D geographic information system (GIS) is data and computation intensive in nature. Internet users are usually equipped with low-end personal computers and network connections of limited bandwidth. Data reduction and performance optimization techniques are of critical importance in quality of service (QoS) management for online 3D GIS. In this research, QoS management issues regarding distributed 3D GIS presentation were studied to develop 3D TerraFly, an interactive 3D GIS that supports high quality online terrain visualization and navigation. ^ To tackle the QoS management challenges, multi-resolution rendering model, adaptive level of detail (LOD) control and mesh simplification algorithms were proposed to effectively reduce the terrain model complexity. The rendering model is adaptively decomposed into sub-regions of up-to-three detail levels according to viewing distance and other dynamic quality measurements. The mesh simplification algorithm was designed as a hybrid algorithm that combines edge straightening and quad-tree compression to reduce the mesh complexity by removing geometrically redundant vertices. The main advantage of this mesh simplification algorithm is that grid mesh can be directly processed in parallel without triangulation overhead. Algorithms facilitating remote accessing and distributed processing of volumetric GIS data, such as data replication, directory service, request scheduling, predictive data retrieving and caching were also proposed. ^ A prototype of the proposed 3D TerraFly implemented in this research demonstrates the effectiveness of our proposed QoS management framework in handling interactive online 3D GIS. The system implementation details and future directions of this research are also addressed in this thesis. ^

Directionality based preventive link maintenance scheme for mobile ad hoc networks

The purpose of this study was to design a preventive scheme using directional antennas to improve the performance of mobile ad hoc networks. In this dissertation, a novel Directionality based Preventive Link Maintenance (DPLM) Scheme is proposed to characterize the performance gain [JaY06a, JaY06b, JCY06] by extending the life of link. In order to maintain the link and take preventive action, signal strength of data packets is measured. Moreover, location information or angle of arrival information is collected during communication and saved in the table. When measured signal strength is below orientation threshold , an orientation warning is generated towards the previous hop node. Once orientation warning is received by previous hop (adjacent) node, it verifies the correctness of orientation warning with few hello pings and initiates high quality directional link (a link above the threshold) and immediately switches to it, avoiding a link break altogether. The location information is utilized to create a directional link by orienting neighboring nodes antennas towards each other. We call this operation an orientation handoff, which is similar to soft-handoff in cellular networks. ^ Signal strength is the indicating factor, which represents the health of the link and helps to predict the link failure. In other words, link breakage happens due to node movement and subsequently reducing signal strength of receiving packets. DPLM scheme helps ad hoc networks to avoid or postpone costly operation of route rediscovery in on-demand routing protocols by taking above-mentioned preventive action. ^ This dissertation advocates close but simple collaboration between the routing, medium access control and physical layers. In order to extend the link, the Dynamic Source Routing (DSR) and IEEE 802.11 MAC protocols were modified to use the ability of directional antennas to transmit over longer distance. A directional antenna module is implemented in OPNET simulator with two separate modes of operations: omnidirectional and directional. The antenna module has been incorporated in wireless node model and simulations are performed to characterize the performance improvement of mobile ad hoc networks. Extensive simulations have shown that without affecting the behavior of the routing protocol noticeably, aggregate throughput, packet delivery ratio, end-to-end delay (latency), routing overhead, number of data packets dropped, and number of path breaks are improved considerably. We have done the analysis of the results in different scenarios to evaluate that the use of directional antennas with proposed DPLM scheme has been found promising to improve the performance of mobile ad hoc networks. ^