Search results for "General Computer Science"
showing 10 items of 895 documents
An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
2001
International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.
On identification of separable kernel systems
1979
An identification procedure for special separable kernel systems is presented. The suitable definition of adequateness of a signal leads to a systematic treatment of the choice of inputs for identification.
Identification and validation of quasispecies models for biological systems
2009
An identification procedure for biological systems cast as quasi-species models is proposed. Their identification is a challenging problem because of the bilinear dependence on the parameters and their physical constraints. The proposed solution is within the framework of set-membership identification. %The bilinear dependence on parameters of the model and their physical constraints make the present issue challenging. We determine an estimate of the model parameters together with their interval of variability (Uncertainty Intervals), taking into account all the physical constraints. Invalidation/validation is performed on the basis of the predictive capability of the estimated models. The …
Model Identification of a Network as Compressing Sensing
2013
In many applications, it is important to derive information about the topology and the internal connections of dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology, and unveiling an unknown structure as the estimate of a "sparse Wiener filter". A geometric interpretation of the problem in a pre-Hilbert space for wide-sense stochastic processes is provided. We cast the problem as the optimization of a cost function where a set of parameters are used t…
Statistical Properties of Double Hoyt Fading With Applications to the Performance Analysis of Wireless Communication Systems
2018
In this paper, we investigate the statistical properties of double Hoyt fading channels, where the overall received signal is determined by the product of two statistically independent but not necessarily identically distributed single Hoyt processes. Finite-range integral expressions are first derived for the probability density function (PDF), cumulative distribution function (CDF), level-crossing rate (LCR), and average duration of fades of the envelope fading process. A closed-form approximate solution is also deduced for the LCR by making use of the Laplace approximation theorem. Applying the derived PDF of the double Hoyt channel, we then provide analytical expressions for the average…
Supplier switching decisions
2007
Abstract In order to maximize profit, a buying firm should continuously search for and access sources which offer more favorable prices. While the literature is replete with works on the formation and development of buyer–supplier relationships, there is surprisingly only scarce research on the termination of such relationships and supplier switching. Using the concept of switching costs in a principal-agent framework, we at first analyze whether a firm switches the entire or a partial quantity to an alternative supplier when there is either symmetric or asymmetric information about the alternative supplier’s cost structure. Information asymmetry results in inert supplier switching decision…
A branch and bound algorithm for the matrix bandwidth minimization
2008
In this article, we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is as close as possible to the main diagonal. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the non-zero elements of the corresponding symmetrical matrix. We propose a new branch and bound algorithm and new expressions for known lower bounds for this problem. Empirical results with a collection of previously reported instances indicate that the propose…
Asset and Liability Modelling for Participating Policies with Guarantee
2008
We study the problem of asset and liability management of participating insurance policies with guarantees. We develop a scenario optimization model for integrative asset and liability management, analyze the tradeoffs in structuring such policies, and study alternative choices in funding them. The nonlinearly constrained optimization model can be linearized through closed form solutions of the dynamic equations. Thus large-scale problems are solved with standard methods. We report on an empirical analysis of policies offered by Italian insurers. The optimized model results are in general agreement with current industry practices. However, some inefficiencies are identified and potential im…
Using PageRank for non-personalized default rankings in dynamic markets
2017
Abstract Default ranking algorithms are used to generate non-personalized product rankings for standard consumers, for example, on landing pages of online stores. Default rankings are created without any information about the consumers’ preferences. This paper proposes using the product centrality ranking algorithm (PCRA), which solves some problems of existing default ranking algorithms: Existing approaches either have low accuracy, because they rely on only one product attribute, or they are unable to estimate ranks for new or updated products, because they use past consumer behavior, such as previous sales or ratings. The PCRA uses the PageRank centrality of products in a product dominat…
Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
2021
Abstract The multi-compartment vehicle routing problem with flexible compartment sizes is a variant of the classical vehicle routing problem in which customers demand different product types and the vehicle capacity can be separated into different compartments each dedicated to a specific product type. The size of each compartment is not fixed beforehand but the number of compartments is limited. We consider two variants for dividing the vehicle capacity: On the one hand the vehicle capacity can be discretely divided into compartments and on the other hand compartment sizes can be divided continuously. The objective is to minimize the total distance of all vehicle routes such that all custo…