Search results for "Data type"
showing 10 items of 1183 documents
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
2021
The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour …
A Data-Based Approach for Modeling and Analysis of Vehicle Collision by LPV-ARMAX Models
2013
Published version of an article in the journal: Journal of Applied Mathematics. Also available from the publisher at: http://dx.doi.org/10.1155/2013/452391 Open Access Vehicle crash test is considered to be the most direct and common approach to assess the vehicle crashworthiness. However, it suffers from the drawbacks of high experiment cost and huge time consumption. Therefore, the establishment of a mathematical model of vehicle crash which can simplify the analysis process is significantly attractive. In this paper, we present the application of LPV-ARMAX model to simulate the car-to-pole collision with different initial impact velocities. The parameters of the LPV-ARMAX are assumed to …
Delay-Probability-Distribution-Dependent FIR Filtering Design with Envelope Constraints
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/930927 Open Access This paper studies the problem of H∞ finite-impulse response (FIR) filtering design of time-delay system. The time-delay considered here is time-varying meanwhile with a certain stochastic characteristic, and the probability of delay distribution is assumed to be known. Furthermore, the requirement of pulse-shape is also considered in filter design. Employing the information about the size and probability distribution of delay, a delay-probability-distribution-dependent criterion is proposed for the filtering error syst…
Discovering representative models in large time series databases
2004
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical observations could allow to perform diagnosis and/or prognosis. Moreover, the efficient discovery of frequent patterns may play an important role in several data mining tasks such as association rule discovery, clustering and classification. However, in order to identify interesting repetitions, it is necessary to allow errors in the matching patterns; in this context, it is difficult to select one pattern particularly suited to represent the set of similar ones, whereas modelling this set with a single model could…
Distributed Consensus in Networks of Dynamic Agents
2006
Stationary and distributed consensus protocols for a network of n dynamic agents under local information is considered. Consensus must be reached on a group decision value returned by a function of the agents' initial state values. As a main contribution we show that the agents can reach consensus if the value of such a function computed over the agents' state trajectories is time invariant. We use this basic result to introduce a protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents' initial states. We demonstrate that the asymptotical consensus is reached via a Lyapunov approach. Finally we perfor…
The ASHRAE clear sky model. An evaluation in the Mediterranean Zone
1988
Abstract The ASHRAE clear sky model in the version proposed by G. L. Powell is here applied to a yearly set of data for Palermo with small scale time intervals. The model is shown to yield computed values generally higher than the measured ones. New values for the atmospheric extinction coefficient are derived and proposed for the application to the Mediterranean atmosphere. A successful verification is performed using hourly data of Genoa, a location belonging to the same meteoclimatic area.
Evaluation and comparison of satellite precipitation estimates with reference to a local area in the Mediterranean Sea
2014
Precipitation measurement is a key activity for the analysis of storm processes as well as every hydrological process. Satellite retrieval systems, rain-gauge network and radar systems are complement to each other in terms of their coverage and capability of monitoring precipitation. Satellite rainfall estimates systems produce data with global coverage that can provide information in areas for which data from other sources are unavailable. Without referring to ground measurement, satellite-based estimates can be bias. Although some gauged adjusted satellite precipitation products are developed, an effective way of integrating multi-sources of precipitation information is still a challenge.…
2017
Abstract. We present a Monte Carlo genetic algorithm (MCGA) for efficient, automated, and unbiased global optimization of model input parameters by simultaneous fitting to multiple experimental data sets. The algorithm was developed to address the inverse modelling problems associated with fitting large sets of model input parameters encountered in state-of-the-art kinetic models for heterogeneous and multiphase atmospheric chemistry. The MCGA approach utilizes a sequence of optimization methods to find and characterize the solution of an optimization problem. It addresses an issue inherent to complex models whose extensive input parameter sets may not be uniquely determined from limited in…
A matlab toolbox for music information retrieval
2008
We present MIRToolbox, an integrated set of functions written in Matlab, dedicated to the extraction from audio files of musical features related, among others, to timbre, tonality, rhythm or form. The objective is to offer a state of the art of computational approaches in the area of Music Information Retrieval (MIR). The design is based on a modular framework: the different algorithms are decomposed into stages, formalized using a minimal set of elementary mechanisms, and integrating different variants proposed by alternative approaches — including new strategies we have developed —, that users can select and parametrize. These functions can adapt to a large area of objects as input.
Learning-Graph-Based Quantum Algorithm for k-distinctness
2012
We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler. Additionally, we introduce an $O(\sqrt{n}\alpha^{1/6})$ algorithm for the graph collision problem where $\alpha$ is the independence number of the graph.