Search results for "Algorithm"
showing 10 items of 4887 documents
Optimal Usage of Multiple Network Connections
2008
In the future mobile networks, a mobile terminal is able to select the best suitable network for each data transmission. The selection of a network connection to be used has been under a lot of study. In this paper, we consider a more extensive case in which we do not select a network connection but use several network connections simultaneously to transfer data. When data is transferred using multiple network connections, a network connection has to be selected for each component of the data. We have modelled this problem as a multiobjective optimization problem and developed a heuristic to solve the problem fast in a static network environment. In this paper, we discuss solving the proble…
Inferring slowly-changing dynamic gene-regulatory networks
2015
Dynamic gene-regulatory networks are complex since the interaction patterns between their components mean that it is impossible to study parts of the network in separation. This holistic character of gene-regulatory networks poses a real challenge to any type of modelling. Graphical models are a class of models that connect the network with a conditional independence relationships between random variables. By interpreting these random variables as gene activities and the conditional independence relationships as functional non-relatedness, graphical models have been used to describe gene-regulatory networks. Whereas the literature has been focused on static networks, most time-course experi…
Hub-Centered Gene Network Reconstruction Using Automatic Relevance Determination
2012
Network inference deals with the reconstruction of biological networks from experimental data. A variety of different reverse engineering techniques are available; they differ in the underlying assumptions and mathematical models used. One common problem for all approaches stems from the complexity of the task, due to the combinatorial explosion of different network topologies for increasing network size. To handle this problem, constraints are frequently used, for example on the node degree, number of edges, or constraints on regulation functions between network components. We propose to exploit topological considerations in the inference of gene regulatory networks. Such systems are often…
Parameter Matching Analysis of Hydraulic Hybrid Excavators Based on Dynamic Programming Algorithm
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/615608 Open Access In order to meet the energy saving requirement of the excavator, hybrid excavators are becoming the hot spot for researchers. The initial problem is to match the parameter of each component, because the system is tending to be more complicated due to the introduction of the accumulator. In this paper, firstly, a new architecture is presented which is hydraulic hybrid excavator based on common pressure rail combined switched function (HHES). Secondly, the general principle of dynamic programming algorithm (DPA) is explained. T…
Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem
2014
Finding differentially regulated subgraphs in a biochemical network is an important problem in bioinformatics. We present a new model for finding such subgraphs which takes the polarity of the edges (activating or inhibiting) into account, leading to the problem of finding a connected subgraph induced by \(k\) vertices with maximum weight. We present several algorithms for this problem, including dynamic programming on tree decompositions and integer linear programming. We compare the strength of our integer linear program to previous formulations of the \(k\)-cardinality tree problem. Finally, we compare the performance of the algorithms and the quality of the results to a previous approac…
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
2002
In this paper we develop and compare several heuristic methods for solving the general two-dimensional cutting stock problem. We follow the Gilmore-Gomory column generation scheme in which at each iteration a new cutting pattern is obtained as the solution of a subproblem on one stock sheet. For solving this subproblem, in addition to classical dynamic programming, we have developed three heuristic procedures of increasing complexity, based on GRASP and Tabu Search techniques, producing solutions differing in quality and in time requirements. In order to obtain integer solutions from the fractional solutions of the Gilmore-Gomory process, we compare three rounding procedures, rounding up, t…
The Capacitated Arc Routing Problem: Lower bounds
1992
In this paper, we consider the Capacitated Arc Routing Problem (CARP), in which a fleet of vehicles, based on a specified vertex (the depot) and with a known capacity Q, must service a subset of the edges of a graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. New lower bounds are developed for this problem, producing at least as good results as the already existing ones. Three of the proposed lower bounds are obtained from the resolution of a minimum cost perfect matching problem. The fourth one takes into account the vehicle capacity and is computed using a dynamic programming algorithm. Computational results, in which these bounds…
A perturbation approach for the response of dynamically modified structural systems
1998
The problem of the structural analysis under changes of dynamical parameters is of particular interest. This is due to the fact that often the real structures are different from the predicted ones. In this paper, an unconditionally stable step-by-step procedure, able to evaluate the deterministic response of linear structures with modifications, is presented. The proposed procedure requires the evaluation of the transition matrix, which is the fundamental operator of the step-by-step solution, by means of a perturbation approach. This technique overcomes the difficulties connected with the evaluation of the eigenproperties of the modified structures usually required to obtain the transition…
On the Non-Intrusive Load Monitoring in dwellings: a feasibility perspective
2021
The oncoming modernization process of the power grids, driven above all by decarbonisation objectives and the continuous improvement of digital technologies, is encouraging active participation in the electricity market by consumers through the Demand-Response mechanism. From this perspective, the introduction of smart meters and energy consumption monitoring devices plays a fundamental role, being able to give benefits to consumers, suppliers and the electricity grid itself. This paper proposes a supervised method of non-intrusive load monitoring (NILM) based on the recognition of patterns in the time domain with the Dynamic Time Warping algorithm which is suitable for low-cost smart meter…
An Online Time Warping based Map Matching for Vulnerable Road Users’ Safety
2018
International audience; High penetration rate of Smartphones and their increased capabilities to sense, compute, store and communicate have made the devices vital components of intelligent transportation systems. However, their GPS positions accuracy remains insufficient for a lot of location-based applications especially traffic safety ones. In this paper, we developed a new algorithm which is able to improve smartphones GPS accuracy for vulnerable road users' traffic safety. It is a two-stage algorithm: in the first stage GPS readings obtained from smartphones are passed through Kalman filter to smooth deviated reading. Then an adaptive online time warping based map matching is applied to…