Mathematical Optimization for the Train Timetabling Problem

AMS Subj. Classification: 90C57; 90C10;

An efficient, approximate path-following algorithm for elastic net based nonlinear spike enhancement

Unwanted spike noise in a digital signal is a common problem in digital filtering. However, sometimes the spikes are wanted and other, superimposed, signals are unwanted, and linear, time invariant (LTI) filtering is ineffective because the spikes are wideband - overlapping with independent noise in the frequency domain. So, no LTI filter can separate them, necessitating nonlinear filtering. However, there are applications in which the noise includes drift or smooth signals for which LTI filters are ideal. We describe a nonlinear filter formulated as the solution to an elastic net regularization problem, which attenuates band-limited signals and independent noise, while enhancing superimposed spikes. Making use of known analytic solutions a novel, approximate path-following algorithm is given that provides a good, filtered output with reduced computational effort by comparison to standard convex optimization methods. Accurate performance is shown on real, noisy electrophysiological recordings of neural spikes.

Capacity-achieving techniques in nonlinear channels

Many of the current optical transmission techniques were developed for linear communication channels and are constrained by the fibre nonlinearity. This paper discusses the potential for radically different approaches to signal transmission and processing based on using inherently nonlinear techniques.

Nonlinear signal transformations:path to capacity above the linear AWGN Shannon limit

We present a methodology for simultaneous optimization of modulation format and regenerative transformations in nonlinear communication channels. We derived analytically the maximum regenerative Shannon capacity, towards which any regenerative channel tends at high SNR and large number of regenerators.

Optimization and characterization of femtosecond laser inscribed in-fiber microchannels for liquid sensing

In-fiber microchannels were fabricated directly in standard single mode fiber using the femtosecond laser inscribe and etch technique. This method of creating in-fiber microchannels offers great versatility, since it allows complex three-dimensional structures to be inscribed and then preferentially etched with hydrofluoric acid. In addition, inscription does not require a photosensitive fiber; the modification is induced through nonlinear processes triggered by an ultrashort laser pulse. Four in-fiber microchannel designs were experimentally investigated using this technique - microhole, microslot channel along the core, microslot channel perpendicular to the core and helical channel around the core. Each device design was evaluated through monitoring the optical spectral change while inserting a range of index matching oils into each microchannel; an R.I. sensitivity up to 1.55 dB/RIU was achieved in these initial tests. Furthermore, an all femtosecond laser inscribed Fabry-Pérot-based refractometer with an R.I. sensitivity of 2.75 nm/RIU was also demonstrated. The Fabry-Pérot refractometer was formed by positioning a microchannel between two femtosecond laser inscribed point-by-point fiber Bragg gratings.

Optimization of Advertising Resources over Time: A Strategic Analysis

AMS subject classification: 90B60, 90B50, 90A80.

Efficient Control in Multistage Stochastic Optimization Problem

AMS subject classification: 90C31, 90A09, 49K15, 49L20.

Riemann-Hilbert Problems with Canonical Normalization and Families of Commuting Operators

2010 Mathematics Subject Classification: 35Q15, 31A25, 37K10, 35Q58.

Operation sequencing optimization for five-axis prismatic parts using a particle swarm optimization approach

Operation sequencing is one of the crucial tasks in process planning. However, it is an intractable process to identify an optimized operation sequence with minimal machining cost in a vast search space constrained by manufacturing conditions. Also, the information represented by current process plan models for three-axis machining is not sufficient for five-axis machining owing to the two extra degrees of freedom and the difficulty of set-up planning. In this paper, a representation of process plans for five-axis machining is proposed, and the complicated operation sequencing process is modelled as a combinatorial optimization problem. A modern evolutionary algorithm, i.e. the particle swarm optimization (PSO) algorithm, has been employed and modified to solve it effectively. Initial process plan solutions are formed and encoded into particles of the PSO algorithm. The particles 'fly' intelligently in the search space to achieve the best sequence according to the optimization strategies of the PSO algorithm. Meanwhile, to explore the search space comprehensively and to avoid being trapped into local optima, several new operators have been developed to improve the particle movements to form a modified PSO algorithm. A case study used to verify the performance of the modified PSO algorithm shows that the developed PSO can generate satisfactory results in optimizing the process planning problem. © IMechE 2009.

On the Zeros of the Solutions to Nonlinear Hyperbolic Equations with Delays

2002 Mathematics Subject Classification: Primary 35В05; Secondary 35L15

Remarks on blow up time for solutions of a nonlinear diffusion system with time dependent coefficients

2000 Mathematics Subject Classification: 35K55, 35K60.

Multi-threaded parallel simulation of non-local non-linear problems in ultrashort laser pulse propagation in the presence of plasma

We describe a parallel multi-threaded approach for high performance modelling of wide class of phenomena in ultrafast nonlinear optics. Specific implementation has been performed using the highly parallel capabilities of a programmable graphics processor. © 2011 SPIE.

Stable optical vortices in nonlinear multicore fibers

The multicore fiber (MCF) is a physical system of high practical importance. In addition to standard exploitation, MCFs may support discrete vortices that carry orbital angular momentum suitable for spatial-division multiplexing in high-capacity fiber-optic communication systems. These discrete vortices may also be attractive for high-power laser applications. We present the conditions of existence, stability, and coherent propagation of such optical vortices for two practical MCF designs. Through optimization, we found stable discrete vortices that were capable of transferring high coherent power through the MCF.

Mode-locking intracavity dynamics:modeling nonlinear power and energy fluctuations

Modern high-power, pulsed lasers are driven by strong intracavity fluctuations. Critical in driving the intracavity dynamics is the nontrivial phase profiles generated and their periodic modification from either nonlinear mode-coupling, spectral filtering or dispersion management. Understanding the theoretical origins of the intracavity fluctuations helps guide the design, optimization and construction of efficient, high-power and high-energy pulsed laser cavities. Three specific mode-locking component are presented for enhancing laser energy: waveguide arrays, spectral filtering and dispersion management. Each component drives a strong intracavity dynamics that is captured through various modeling and analytic techniques.

Optimization of pavement maintenance and rehabilitation programming using shuffled complex evolution algorithm

The major barrier to practical optimization of pavement preservation programming has always been that for formulations where the identity of individual projects is preserved, the solution space grows exponentially with the problem size to an extent where it can become unmanageable by the traditional analytical optimization techniques within reasonable limit. This has been attributed to the problem of combinatorial explosion that is, exponential growth of the number of combinations. The relatively large number of constraints often presents in a real-life pavement preservation programming problems and the trade-off considerations required between preventive maintenance, rehabilitation and reconstruction, present yet another factor that contributes to the solution complexity. In this research study, a new integrated multi-year optimization procedure was developed to solve network level pavement preservation programming problems, through cost-effectiveness based evolutionary programming analysis, using the Shuffled Complex Evolution (SCE) algorithm.^ A case study problem was analyzed to illustrate the robustness and consistency of the SCE technique in solving network level pavement preservation problems. The output from this program is a list of maintenance and rehabilitation treatment (M&R) strategies for each identified segment of the network in each programming year, and the impact on the overall performance of the network, in terms of the performance levels of the recommended optimal M&R strategy. ^ The results show that the SCE is very efficient and consistent in the simultaneous consideration of the trade-off between various pavement preservation strategies, while preserving the identity of the individual network segments. The flexibility of the technique is also demonstrated, in the sense that, by suitably coding the problem parameters, it can be used to solve several forms of pavement management programming problems. It is recommended that for large networks, some sort of decomposition technique should be applied to aggregate sections, which exhibit similar performance characteristics into links, such that whatever M&R alternative is recommended for a link can be applied to all the sections connected to it. In this way the problem size, and hence the solution time, can be greatly reduced to a more manageable solution space. ^ The study concludes that the robust search characteristics of SCE are well suited for solving the combinatorial problems in long-term network level pavement M&R programming and provides a rich area for future research. ^