Search results for "FC"
showing 10 items of 1442 documents
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.
Joy of Mathematical Modelling: A Forgotten Perspective?
2020
We argue the relevance of including an affective perspective in the mathematical modelling education research and emphasise its importance for the teaching and learning of mathematical modelling at all levels, especially at the university. Our argument is supported by a recent survey of mathematics lecturers’ views on mathematical modelling, several follow-up interviews, and a review of literature on mathematical modelling that relates to enjoyment, pleasure, and appreciation. Findings from the survey and the follow-up interviews indicate that there is a group of practitioners who hold strong views on the importance of enjoyment in doing and teaching mathematical modelling.
Optimal Guard Placement Problem Under L-Visibility
2006
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
A methodological protocol for Annex I Habitats monitoring: the contribution of Vegetation science.
2016
The methodological foundations of the recently published Manual for Annex I Habitats monitoring in Italy, edited by the Italian Institute for Environmental Protection and Research (ISPRA) with the scientific support of the Italian Society for Vegetation Science (SISV), are here presented, discussed and related to the most consolidated and acknowledged scientific advances in the field of Vegetation science. The proposed methodologies aim at offering simple, yet effective, protocols and procedures towards a harmonized data collection, by way of standardized and shared technical tools, resulting in comparable evaluations of the conservation status of Annex I Habitats. The methodological framew…
Structural Health Monitoring Procedure for Composite Structures through the use of Artifcial Neural Networks
2015
In this paper different architectures of Artifcial Neural Networks (ANNs) for structural damage detection are studied. The main objective is to investigate an ANN able to detect and localize damage without any prior knowledge on its characteristics so as to serve as a real-time data processor for Structural Health Monitoring (SHM) systems. Two different architectures are studied: the standard feed-forward Multi Layer Perceptron (MLP) and the Radial Basis Function (RBF) ANNs. The training data are given, in terms of a Damage Index =D, properly defined using a piezoelectric sensor signal output to obtain suitable information on the damage position and dimensions. The electromechanical respons…
Preamble Transmission Prediction for mMTC Bursty Traffic : A Machine Learning based Approach
2020
The evolution of Internet of things (IoT) towards massive IoT in recent years has stimulated a surge of traffic volume among which a huge amount of traffic is generated in the form of massive machine type communications. Consequently, existing network infrastructure is facing challenges when handling rapidly growing traffic load, especially under bursty traffic conditions which may more often lead to congestion. By proactively predicting the occurrence of congestion, we can implement necessary means and conceivably avoid congestion. In this paper, we propose a machine learning (ML) based model for predicting successful preamble transmissions at a base station and subsequently forecasting th…
A new method for optimal synthesis of wavelet-based neural networks suitable for identification purposes
1999
Abstract This paper deals with a new method for optimal synthesis of Wavelet-Based Neural Networks (WBNN) suitable for identification purposes. The method uses a genetic algorithm (GA) combined with a steepest descent technique and least square techniques for both optimal selection of the structure of the WBNN and its training. The method is applied for designing a predictor for a chaotic temporal series
Regularized RBF Networks for Hyperspectral Data Classification
2004
In this paper, we analyze several regularized types of Radial Basis Function (RBF) Networks for crop classification using hyperspectral images. We compare the regularized RBF neural network with Support Vector Machines (SVM) using the RBF kernel, and AdaBoost Regularized (ABR) algorithm using RBF bases, in terms of accuracy and robustness. Several scenarios of increasing input space dimensionality are tested for six images containing six crop classes. Also, regularization, sparseness, and knowledge extraction are paid attention.
The clustering of galaxies in the SDSS-III Baryon Oscillation Spectroscopic Survey: Baryon Acoustic Oscillations in the Data Release 10 and 11 galaxy…
2014
We present a one per cent measurement of the cosmic distance scale from the detections of the baryon acoustic oscillations in the clustering of galaxies from the Baryon Oscillation Spectroscopic Survey (BOSS), which is part of the Sloan Digital Sky Survey III (SDSS-III). Our results come from the Data Release 11 (DR11) sample, containing nearly one million galaxies and covering approximately $8\,500$ square degrees and the redshift range $0.2<z<0.7$. We also compare these results with those from the publicly released DR9 and DR10 samples. Assuming a concordance $\Lambda$CDM cosmological model, the DR11 sample covers a volume of 13\,Gpc${}^3$ and is the largest region of the Universe ever su…
GWTC-1: A Gravitational-Wave Transient Catalog of Compact Binary Mergers Observed by LIGO and Virgo during the First and Second Observing Runs
2019
We present the results from three gravitational-wave searches for coalescing compact binaries with component masses above 1$\mathrm{M}_\odot$ during the first and second observing runs of the Advanced gravitational-wave detector network. During the first observing run (O1), from September $12^\mathrm{th}$, 2015 to January $19^\mathrm{th}$, 2016, gravitational waves from three binary black hole mergers were detected. The second observing run (O2), which ran from November $30^\mathrm{th}$, 2016 to August $25^\mathrm{th}$, 2017, saw the first detection of gravitational waves from a binary neutron star inspiral, in addition to the observation of gravitational waves from a total of seven binary …