Design and implementation of a windows-based parallel computing environment for large scale optimization

A parallel computing environment to support optimization of large-scale engineering systems is designed and implemented on Windows-based personal computer networks, using the master-worker model and the Parallel Virtual Machine (PVM). It is involved in decomposition of a large engineering system into a number of smaller subsystems optimized in parallel on worker nodes and coordination of subsystem optimization results on the master node. The environment consists of six functional modules, i.e. the master control, the optimization model generator, the optimizer, the data manager, the monitor, and the post processor. Object-oriented design of these modules is presented. The environment supports steps from the generation of optimization models to the solution and the visualization on networks of computers. User-friendly graphical interfaces make it easy to define the problem, and monitor and steer the optimization process. It has been verified by an example of a large space truss optimization. (C) 2004 Elsevier Ltd. All rights reserved.

A windows program for the derivation of steady-state equations in enzyme systems

Despite the number of computer-assisted methods described for the derivation of steady-state equations of enzyme systems, most of them are focused on strict steady-state conditions or are not able to solve complex reaction mechanisms. Moreover, many of them are based on computer programs that are either not readily available or have limitations. We present here a computer program called WinStes, which derives equations for both strict steady-state systems and those with the assumption of rapid equilibrium, for branched or unbranched mechanisms, containing both reversible and irreversible conversion steps. It solves reaction mechanisms involving up to 255 enzyme species, connected by up to 255 conversion steps. The program provides all the advantages of the Windows programs, such as a user-friendly graphical interface, and has a short computation time. WinStes is available free of charge on request from the authors. (c) 2006 Elsevier Inc. All rights reserved.

Space efficient quantile summary for constrained sliding windows on a data stream

In many online applications, we need to maintain quantile statistics for a sliding window on a data stream. The sliding windows in natural form are defined as the most recent N data items. In this paper, we study the problem of estimating quantiles over other types of sliding windows. We present a uniform framework to process quantile queries for time constrained and filter based sliding windows. Our algorithm makes one pass on the data stream and maintains an E-approximate summary. It uses O((1)/(epsilon2) log(2) epsilonN) space where N is the number of data items in the window. We extend this framework to further process generalized constrained sliding window queries and proved that our technique is applicable for flexible window settings. Our performance study indicates that the space required in practice is much less than the given theoretical bound and the algorithm supports high speed data streams.

Leadlight windows, Ocean View Farmhouse, Mount Mee

Detailed view of leadlight windows as seen from dining room.

30 years of retail change:where (and how) do you shop?

Purpose – The purpose of this paper is to investigate the extent of retail change in the UK grocery sector over the last 30 years. Design/methodology/approach – In 1980, a press article by Richard Milner and Patience Wheatcroft attempted to anticipate retail change by 1984. Taking that as a template, the paper examines how retail did, in fact, change over a much longer timescale: with some unanticipated innovations in place even by 1984. Reference is made to academic research on grocery retailing in progress at the time and which has recently been revisited. Findings – Although Milner and Wheatcroft tackled the modest task of looking ahead just four years, the content of their article is intriguingly reflective of the retail structure and systems of the UK at the time. Whilst some innovations were not anticipated, the broad themes of superstore power and market regulation still command attention 30 years on. Originality/value – Through reconsidering 30 years of retail change, the paper highlights that with time how do you shop has come to pose at least as interesting a question as where do you shop.

Narrow bandwidth Bragg gratings imprinted in polymer optical fibers for different spectral windows

The production and characterization of narrow bandwidth fiber Bragg gratings (FBGs) in different spectral regions using polymer optical fibers (POFs) is reported. Narrow bandwidth FBGs are increasingly important for POF transmission systems, WDM technology and sensing applications. Long FBGs with resonance wavelength around 600-nm, 850-nm and 1550-nm in several types of polymer optical fibers were inscribed using a scanning technique with a short optical path. The technique allowed the inscription in relative short periods of time. The obtained 3-dB bandwidth varies from 0.22 down to 0.045 nm considering a Bragg grating length between 10 and 25-mm, respectively.

Narrow bandwidth Bragg gratings imprinted in polymer optical fibers for different spectral windows

The production and characterization of narrow bandwidth fiber Bragg gratings (FBGs) in different spectral regions using polymer optical fibers (POFs) is reported. Narrow bandwidth FBGs are increasingly important for POF transmission systems, WDM technology and sensing applications. Long FBGs with resonance wavelength around 600-nm, 850-nm and 1550-nm in several types of polymer optical fibers were inscribed using a scanning technique with a short optical path. The technique allowed the inscription in relative short periods of time. The obtained 3-dB bandwidth varies from 0.22 down to 0.045 nm considering a Bragg grating length between 10 and 25-mm, respectively.

Narrow bandwidth Bragg gratings imprinted in polymer optical fibers for different spectral windows

The production and characterization of narrow bandwidth fiber Bragg gratings (FBGs) in different spectral regions using polymer optical fibers (POFs) is reported. Narrow bandwidth FBGs are increasingly important for POF transmission systems, WDM technology and sensing applications. Long FBGs with resonance wavelength around 600-nm, 850-nm and 1550-nm in several types of polymer optical fibers were inscribed using a scanning technique with a short optical path. The technique allowed the inscription in relative short periods of time. The obtained 3-dB bandwidth varies from 0.22 down to 0.045 nm considering a Bragg grating length between 10 and 25-mm, respectively. © 2013 Elsevier B.V.

Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs

This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with re-entrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are required to reenter to the flow shop. The tardiness weight is adjusted once the jobs reenter to the shop. The performance of the proposed GA model is verified by a number of numerical experiments where the data come from the case company. The results show the proposed method has a higher order satisfaction rate than the current industrial practices.

Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop

The re-entrant flow shop scheduling problem (RFSP) is regarded as a NP-hard problem and attracted the attention of both researchers and industry. Current approach attempts to minimize the makespan of RFSP without considering the interdependency between the resource constraints and the re-entrant probability. This paper proposed Multi-level genetic algorithm (GA) by including the co-related re-entrant possibility and production mode in multi-level chromosome encoding. Repair operator is incorporated in the Multi-level genetic algorithm so as to revise the infeasible solution by resolving the resource conflict. With the objective of minimizing the makespan, Multi-level genetic algorithm (GA) is proposed and ANOVA is used to fine tune the parameter setting of GA. The experiment shows that the proposed approach is more effective to find the near-optimal schedule than the simulated annealing algorithm for both small-size problem and large-size problem. © 2013 Published by Elsevier Ltd.

Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times

Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.

The Technology of Programming for a Cluster Computer by the Remote Terminal with OS Windows

The problem of preparation of a program to perform it on multiprocessor system of a cluster type is considered. When developing programs for a cluster computer the technology based on use of the remote terminal is applied. The situation when such remote terminal is the computer with operational system Windows is considered. The set of the tool means, allowing carrying out of editing program texts, compiling and starting programs on a cluster computer, is suggested. Advantage of an offered way of preparation of programs to execution is that it allows as much as possible to use practical experience of programmers used to working in OS Windows environment.

Stability of an Optimal Schedule for a Job-Shop Problem with Two Jobs

The usual assumption that the processing times of the operations are known in advance is the strictest one in scheduling theory. This assumption essentially restricts practical aspects of deterministic scheduling theory since it is not valid for the most processes arising in practice. The paper is devoted to a stability analysis of an optimal schedule, which may help to extend the significance of scheduling theory for decision-making in the real-world applications. The term stability is generally used for the phase of an algorithm, at which an optimal solution of a problem has already been found, and additional calculations are performed in order to study how solution optimality depends on variation of the numerical input data.

Реализиране на стандартни Windows приложения, съдържащи менюта чрез средата Visual C# при изучаване на събитийно програмиране в средното училище

Доклад, поместен в сборника на Националната конференция "Образованието в информационното общество", Пловдив, май, 2011 г.