Fire protection of wood by different gypsum plasterboards

Cone calorimeter tests were performed on specimens made of pieces of wood and pieces of gypsum plasterboards protecting the wood against the heat. The thermal behaviour of the gypsum plasterboards of different origin was studied by determining the time to onset of charring and the charring rate of wood. The specimens were exposed to a constant heat flux of 50 kW/m². The test results show that the time to onset of charring is more dependent on the board thickness than the area weight of the boards. The charring rate is fairly well predicted both by the board thickness and area weight, the latter being slightly better as a prediction parameter. The mechanical board properties needed in order to fully understand the fire protection from gypsum plasterboards were not studied in this investigation. Copyright © 1999 John Wiley & Sons Ltd.     

Supply chain design and multilevel planning—An industrial case

In this paper we address a case study, inspired by a real agrochemicals supply chain, with two main objectives, structured in two stages. In the first stage we redesign the global supply chain network and optimise the production and distribution plan considering a time horizon of 1 year, providing a decision support tool for long term investments and strategies. The output decisions from the first stage, mainly the supply chain configuration and allocation decisions, are the input parameters for the second stage where a short term operational model is used to test the accuracy of the derived design and plan. The outputs of this stage are detailed production and distribution plans and an assessment of the customer service level.At the operational level, failure to meet on time the demand fulfilment targets established at the planning stage is usually caused by allocation of too many products/customers to the same resource in the first stage, especially to those surrounding the system bottlenecks. This introduces idle periods in the planning of the bottleneck resources, preventing the whole system from operating at its maximum capacity. An analytical methodology was developed to use the information gathered in the second step to improve the supply chain design and plan by enforcing a more distributed allocation of products/customers to the available resources in each time period.     

Global supply chain planning for pharmaceuticals

The shortening of patent life periods, generic competition and public health policies, among other factors, have changed the operating context of the pharmaceutical industry. In this work we address a dynamic allocation/planning problem that optimises the global supply chain planning of a pharmaceutical company, from production stages at primary and secondary sites to product distribution to markets. The model explores different production and distribution costs and tax rates at different locations in order to maximise the company's net profit value (NPV).Large instances of the model are not solvable in realistic time scales, so two decomposition algorithms were developed. In the first method, the supply chain is decomposed into independent primary and secondary subproblems, and each of them is optimised separately. The second algorithm is a temporal decomposition, where the main problem is separated into several independent subproblems, one per each time period. These algorithms enable the solution of large instances of the problem in reasonable time with good quality results.     

An Overlay Smart Spaces System for Load Balancing in Wireless LANs

An overlay smart spaces system, called MITOS, is proposed for managing the use of the resources in wireless local area networks (WLAN). MITOS monitors the traffic load distribution in the different WLAN segments, as well as the location of each user, and when necessary, suggests to specific users to change their location in order to improve their quality of service. Enhancements to the basic MITOS architecture are introduced to intelligently manage local congestion, and maintain an almost uniform load level across the network. The approach used for load balancing is based on game theoretic mechanisms, such as the solutions to the Santa Fe Bar Problem. Simulation results are provided showing the efficiency of the proposed system. The research of the author for his PhD studies is supported by the Alexander S. Onassis Foundation Scholarship Programme. George Alyfantis received his B.Sc. degree in Informatics and Telecommunications from the Department of Informatics and Telecommunications, University of Athens, Athens Greece, in 2002. He received his M.Sc. degree in Communication and Network Systems from the same Department, in 2003. Since 2001, he is a member of the Communication Networks Laboratory (CNL) of the University of Athens. Currently, he is working towards his Ph.D. thesis. His research interests include pervasive/mobile computing, middleware for wireless sensor networks, web caching performance and game theory. He is the author of 5 papers in the aforementioned areas. In the course of his studies he received numerous distinctions like the Alexandros Onassis Foundation Scholarship for his Ph.D. studies, the best student award of the Department of Informatics and Telecommunications for graduating first in his B.Sc./M.Sc. class and the best M.Sc. thesis Ericsson Award of Excellence in Telecommunications 2004. Stathes Hadjiefthymiades received his B.Sc. (honors) in Informatics from the Department of Informatics at the University of Athens, Greece, in 1993 and his M.Sc. (honors) in Informatics (Advanced information systems) from the same department in 1996. In 1999 he received his Ph.D. from the University of Athens (Department of Informatics and Telecommunications). In 2002 he received a joint engineering-economics M.Sc. degree from the National Technical University of Athens. In 1992 he joined the Greek consulting firm Advanced Services Group, Ltd., where he was involved in the analysis and specification of information systems and the design-implementation of telematic applications. In 1995 he became a member of the Communication Networks Laboratory (UoA-CNL) of the University of Athens. During the period September 2001–July 2002, he served as a visiting assistant professor at the University of Aegean, Department of Information and Communication Systems Engineering. On the summer of 2002 he joined the faculty of the Hellenic Open University (Department of Informatics), Patras, Greece, as an assistant professor. Since December 2003, he is in the faculty of the Department of Informatics and Telecommunications, University of Athens, where he is presently an assistant professor. He is coordinating the Pervasive Computing Research Group of the Dept. of Informatics and Telecommunications at the University of Athens. He has participated in numerous projects realized in the context of EU programs (ACTS, ORA, TAP, and IST), EURESCOM projects, as well as national initiatives. His research interests are in the areas of web engineering, wireless/mobile computing, and networked multimedia applications. He is the author of over 80 publications in the above areas. Lazaros Merakos received the Diploma in electrical and mechanical engineering from the National Technical University of Athens, Athens, Greece, in 1978, and the M.S. and Ph.D. degrees in electrical engineering from the State University of New York, Buffalo, in 1981 and 1984, respectively. From 1983 to 1986, he was in the faculty of the Electrical Engineering and Computer Science Department University of Connecticut, Storrs. From 1986 to 1994 he was in the faculty of the Electrical and Computer Engineering Department, Northeastern University, Boston, MA. During the period 1993–1994, he served as director of the Communications and Digital Processing Research Center, Northeastern University. During the summers of 1990 and 1991, he was a visiting scientist at the IBM T. J. Watson Research Center, Yorktown Heights, NY. In 1994, he joined the faculty of the University of Athens, Athens, Greece, where he is presently a professor in the Department of Informatics and Telecommunications, and director of the Communication Networks Laboratory (UoA-CNL) and the Networks Operations and Management Center. Since 1995, he is leading the research activities of UoA-CNL in the area of mobile communications, in the framework of the Advanced Communication Technologies and Services (ACTS) and Information Society Technologies (IST) programs funded by the European Union (projects RAINBOW, Magic WAND, WINE, MOBIVAS, POLOS, ANWIRE, E2R, LIAISON). His research interests are in the design and performance analysis of communication networks, and wireless/mobile communication systems and services. He has authored more than 190 papers in the above areas. Dr. Merakos is chairman of the board of the Greek Universities Network, the Greek Schools Network, and member of the board of the Greek Research Network. In 1994, he received the Guanella Award for the best paper presented at the International Zurich Seminar on Mobile Communications.     

Correlation between cone calorimeter data and time to flashover in the room fire test

Correlations based on linear regressions between data as time to ignition and heat release in the cone calorimeter and time to flashover in the room fire test have been developed. They are a further development of an earlier approach which has been modified and extended to a wider range of surface linings. The correlations apply so far only to surface linings on both walls and ceilings. When the density of the linings as a simplified measure of the thermal inertia is included, the correlations are improved significantly. The new correlations are based on data readily available from the cone calorimeter test at one heat flux level, 50 kWm^?2. The correlation coefficient for the basic relationship, including the density of the linings, is now 0.98 when applied to the 13 linings investigated earlier. This is slightly better than the previous study, in which the best correlation coefficient was 0.96. When applied to 28 linings, the correlation coefficient remains about the same (0.97). Very similar regression equations have been obtained when analysing only 13 products and all 28. This is a strong indication of the general predictive capacity of this approach. The inclusion of other data such as thickness of linings or mass loss during fire does not improve the correlation coefficients. The approach is quite straightforward and simple. However, it has provided a useful prediction which is also valid for an extended range of linings.     

Thirty one-year durability of a Starr-Edwards aortic prosthesis

BACKGROUND: Endoscopic diagnosis of short segments of Barrett's epithelium (SSBE)' is difficult and its meaning in terms of the presence of specialised columnar epithelium (SCE) has not been prospectively evaluated. AIMS: To evaluate the prevalence of SCE in patients with an endoscopic diagnosis of SSBE and in individuals with normal appearing oesophagogastric junctions, and to compare the clinical characteristics of these two groups. PATIENTS: Thirty one patients with an endoscopic diagnosis of short Barrett's oesophagus, less than 3 cm in length (group A), and 44 consecutive patients with normal appearing oesophagogastric junctions (group B). METHODS: Multiple biopsies were performed in suspicious epithelium and at the oesophagogastric junction in groups A and B, respectively. RESULTS: Age and sex distribution were similar in both groups. Reflux symptoms were more frequent in group A (p < 0.001), as were endoscopic and histological signs of oesophagitis (p < 0.001 and p = 0.001, respectively). SCE was found in 61.3% of group A patients compared with 25% in group B (p < 0.002), with men predominating in group A while women were more frequent in group B (p = 0.02). The differences in reflux symptoms and endoscopic/histological oesophagitis remained significant. CONCLUSIONS: These results show that endoscopic diagnosis of SSBE is associated with a high prevalence of SCE, significantly higher than that found in normal appearing oesophagogastric junctions. Differences between patients with SCE in the two groups suggest they may represent two different entities.     

Multi‐parametric linear programming under global uncertainty

Multi‐parametric programming has proven to be an invaluable tool for optimisation under uncertainty. Despite the theoretical developments in this area, the ability to handle uncertain parameters on the left‐hand side remains limited and as a result, hybrid, or approximate solution strategies have been proposed in the literature. In this work, a new algorithm is introduced for the exact solution of multi‐parametric linear programming problems with simultaneous variations in the objective function's coefficients, the right‐hand side and the left‐hand side of the constraints. The proposed methodology is based on the analytical solution of the system of equations derived from the first order Karush–Kuhn–Tucker conditions for general linear programming problems using symbolic manipulation. Emphasis is given on the ability of the proposed methodology to handle efficiently the LHS uncertainty by computing exactly the corresponding nonconvex critical regions while numerical studies underline further the advantages of the proposed methodology, when compared to existing algorithms. © 2017 The Authors AIChE Journal published by Wiley Periodicals, Inc. on behalf of American Institute of Chemical Engineers AIChE J, 63: 3871–3895, 2017     

Optimal design of an electrodialysis brackish water desalination plant

This paper considers the optimal design and operation of electrodialysis (ED) desalination plants. In general an ED plant aims to produce potable water from a high salinity source, like brackish water or high salinity water. The system is modelled mathematically as mixed-integer non-linear programming (MINLP) optimization problem, determining the number of desalination stages, the membrane area, the total required energy so as to minimise the total annualised cost of the investment accounting for both infrastructure and operating costs. Two examples from the literature illustrate the applicability of the proposed approach and evaluate the quality of the results obtained.     

A MILP model for N-dimensional allocation

This paper presents a Mixed Integer Linear Programming (MILP) model for the solution of N-dimensional allocation problems. The applicability of the model is presented and demonstrated through some illustrative examples with different numbers of dimensions. Several problems, previously presented in the literature, are solved using the proposed model, such as, one-dimensional scheduling problems, two-dimensional cutting problems, as well as plant layout problems and three-dimensional packing problems. Additionally, some problems in four dimensions are presented and solved using the considered model. The presented model is applicable to a wide variety of allocation problems as it offers a general framework for modelling allocation problems with any given number of continuous or discrete dimensions. The presented problems are formulated as MILP problems where the first four dimensions usually are continuous spatial and time dimensions. Additional dimensions are often of a discrete nature.     

Transform-based graph topology similarity metrics

Neural Computing and Applications - Graph signal processing has recently emerged as a field with applications across a broad spectrum of fields including brain connectivity networks, logistics and...