Decentralised decision-making with information sharing vs. centralised decision-making in supply chains

In recent years, implementing coordination mechanisms in decentralised supply chains to reduce the well-known negative effects of decentralisation, such as the ‘bullwhip effect’, has become a considerable challenge. Furthermore, with the dramatic developments in information and communication technologies, real-time information sharing has become increasingly easier to implement. In this work, we study a mono-product divergent supply chain composed of a supplier, a warehouse, retailers and customers in the context of decentralised and centralised decisions. The main objective of this study is to compare a decentralised supply chain combined with different scenarios of simultaneous upstream and downstream information sharing vs. a centralised supply chain. A mathematical model is developed to compare the logistics costs in the two decision contexts. The experimental results clearly show that the simultaneous sharing of customer demand and supplier-warehouse lead time information in a decentralised supply chain yields nearly equivalent logistics costs as the centralised supply chain context. However, the main beneficiary of the sharing is the warehouse, which receives approximately two-thirds of the benefit. Thus, incentives and revenue sharing contracts should be implemented to motivate and balance the benefits between supply chain partners.     

Exploring creative thinking in graphically mediated synchronous dialogues

This paper reports on an aspect of the EC funded Argunaut project which researched and developed awareness tools for moderators of online dialogues. In this study we report on an investigation into the nature of creative thinking in online dialogues and whether or not this creative thinking can be coded for and recognized automatically such that moderators can be alerted when creative thinking is occurring or when it has not occurred after a period of time. We outline a dialogic theory of creativity, as the emergence of new perspectives from the interplay of voices, and the testing of this theory using a range of methods including a coding scheme which combined coding for creative thinking with more established codes for critical thinking, artificial intelligence pattern-matching techniques to see if our codes could be read automatically from maps and ‘key event recall’ interviews to explore the experience of participants. Our findings are that: (1) the emergence of new perspectives in a graphical dialogue map can be recognized by our coding scheme supported by a machine pattern-matching algorithm in a way that can be used to provide awareness indicators for moderators; (2) that the trigger events leading to the emergence of new perspectives in the online dialogues studied were most commonly disagreements and (3) the spatial representation of messages in a graphically mediated synchronous dialogue environment such as Digalo may offer more affordance for creativity than the much more common scrolling text chat environments. All these findings support the usefulness of our new account of creativity in online dialogues based on dialogic theory and demonstrate that this account can be operationalised through machine coding in a way that can be turned into alerts for moderators.     

Scatter search technique for exam timetabling

At universities where students enjoy flexibility in selecting courses, the Registrar’s office aims to generate an appropriate exam timetable for numerous courses and large number of students. An appropriate, real-world exam timetable should show fairness towards all students, respecting the following constraints: (a) eliminating or minimizing the number of simultaneous exams; (b) minimizing the number of consecutive exams; (c) minimizing the number of students with two or three exams per day (d) eliminating the possibility of more than three exams per day (e) exams should fit in rooms with predefined capacity; and (f) the number of exam periods is limited. These constraints are conflicting, which makes exam timetabling intractable. Hence, solving this problem in realistic time requires the use of heuristic approaches. In this work, we develop an evolutionary heuristic technique based on the scatter search approach for finding good suboptimal solutions for exam timetabling. This approach is based on maintaining and evolving a population of solutions. We evaluate our suggested technique on real-world university data and compare our results with the registrar’s manual timetable in addition to the timetables of other heuristic optimization algorithms. The experimental results show that our adapted scatter search technique generates better timetables than those produced by the registrar, manually, and by other meta-heuristics.     

GSA: A Gravitational Search Algorithm

In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature. In this paper, a new optimization algorithm based on the law of gravity and mass interactions is introduced. In the proposed algorithm, the searcher agents are a collection of masses which interact with each other based on the Newtonian gravity and the laws of motion. The proposed method has been compared with some well-known heuristic search methods. The obtained results confirm the high performance of the proposed method in solving various nonlinear functions.     

Target coverage in camera networks for manufacturing workplaces

In this paper, we investigate the camera network placement problem for target coverage in manufacturing workplaces. The problem is formulated to find the minimum number of cameras of different types and their best configurations to maximise the coverage of the monitored workplace such that the given set of target points of interest are each k-covered with a predefined minimum spatial resolution. Since the problem is NP-complete, and even NP-hard to approximate, a novel method based on Simulated Annealing is presented to solve the optimisation problem. A new neighbourhood generation function is proposed to handle the discrete nature of the problem. The visual coverage is modelled using realistic and coherent assumptions of camera intrinsic and extrinsic parameters making it suitable for many real world camera based applications. Task-specific quality of coverage measure is proposed to assist selecting the best among the set of camera network placements with equal coverage. A 3D CAD of the monitored space is used to examine physical occlusions of target points. The results show the accuracy, efficiency and scalability of the presented solution method; which can be applied effectively in the design of practical camera networks.     

On the efficiency of bootstrap method into the analysis contingency table

The bootstrap method is a computer intensive statistical method that is widely used in performing nonparametric inference. Categorical data analysis, in particular the analysis of contingency tables, is commonly used in applied field. This work considers nonparametric bootstrap tests for the analysis of contingency tables. There are only a few research papers which exploit this field. The p-values of tests in contingency tables are discrete and should be uniformly distributed under the null hypothesis. The results of this article show that corresponding bootstrap versions work better than the standard tests. Properties of the proposed tests are illustrated and discussed using Monte Carlo simulations. This article concludes with an analytical example that examines the performance of the proposed tests and the confidence interval of the association coefficient.     

Problems of spatial linkage of a geo-referenced Demographic and Health Survey (DHS) dataset to a population census: A case study of Egypt

GPS coordinates are increasingly available as spatial references on population surveys in the developing world, where high-resolution address and street mapping are absent. This potentially offers opportunities to enhance national census data by spatial linkage with survey sources. The paper explores the use of GPS-referenced Demographic and Health Survey (DHS) data in combination with census data in Egypt and identifies errors in coordinate referencing. The study develops a practical approach to the measurement of spatial uncertainty in this situation and assessment of its impact on data linkage. The analysis specifically addresses the analytical implications at three different spatial scales and is internationally relevant to the handling of GPS-referenced DHS data in GIS.     

Classification of non-alcoholic beer based on aftertaste sensory evaluation by chemometric tools

Sensory evaluation is the application of knowledge and skills derived from several different scientific and technical disciplines, physiology, chemistry, mathematics and statistics, human behavior, and knowledge about product preparation practices. This research was aimed to evaluate aftertaste sensory attributes of commercial non-alcoholic beer brands (P1, P2, P3, P4, P5, P6, P7) by several chemometric tools. These attributes were bitter, sour, sweet, fruity, liquorice, artificial, body, intensity and duration. The results showed that the data are in a good consistency. Therefore, the brands were statistically classified in several categories. Linear techniques as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) were performed over the data that revealed all types of beer are well separated except a partial overlapping between zones corresponding to P4, P6 and P7. In this research, for the confirmation of the groups observed in PCA and in order to calculate the errors in calibration and in validation, PLS-DA technique was used. Based on the quantitative data of PLS-DA, the classification accuracy values were ranked within 49-86%. Moreover, it was found that the classification accuracy of LDA was much better than PCA. It shows that this trained sensory panel can discriminate among the samples except an overlapping between two types of beer. Also, two types of artificial networks were used: Probabilistic Neural Networks (PNN) with Radial Basis Functions (RBF) and FeedForward Networks with Back Propagation (BP) learning method. The highest classification success rate (correct predicted number over total number of measurements) of about 97% was obtained for RBF followed by 94% for BP. The results obtained in this study could be used as a reference for electronic nose and electronic tongue in beer quality control.     

An Experimental and Theoretical Comparison of Model Selection Methods

Machine Learning - We investigate the problem of model selection in the setting of supervised learning of boolean functions from independent random examples. More precisely, we compare methods for...     

A new second-order method for blind signal separation from dynamic mixtures

This paper presents a new approach to separate colored stationary signals mixed by convolutive channels. A cost function is proposed by employing linear constraint to the demixing vectors. The linear constraint is shown to be sufficient for avoiding trivial solution. The minimization of the cost function is performed using the Lagrangian method. Simulation results demonstrate the performance of the algorithm.