In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

History matching is used to constrain flow simulations and reduce uncertainty in forecasts. In this work, we revisited some fundamental engineering tools for predicting waterflooding behavior to better understand the flaws in our simulation and thus find some models which are more accurate with better matching. The Craig-Geffen-Morse (CGM) analytical method was used to predict recovery performa...

The matching preclusion problem, introduced by Brigham et al. [Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185-192], studies how to effectively make a graph have neither perfect matchings nor almost perfect matchings by deleting as small a number of edges as possible. Extending this concept, we consider a more general matching preclusion problem, called the strong matching pr...

The problem of Compressed Pattern Matching , introduced by Amir and Benson [1], is of performing pattern matching directly in a compressed text without any decompressing. More formally, for a given text T , pattern P and complementary encoding and decoding functions E and D, respectively, our aim is to search for E(P ) in E(T ), rather than the usual approach which searches for the pattern P in...

a neural network is developed for the determination of leaky confined aquifer parameters. leakage into the aquifer takes place from the storage in the confining aquitard. the network is trained for the well function of leaky confined aquifers by the back propagation technique and adopting the levenberg–marquardt optimization algorithm. by applying the principal component analysis (pca) on the a...

this study examines the factors influencing women’s quest of divorce in tehran. the research framework is based on the theory of order (within the family), social capital theory, and matching partnership. research method was survey and the instrument of the study was questionnaires. 239 seeking divorce women and the same number of non-seeking divorce women were given the questionnaires. they we...

Image denoising by block matching and threedimensionaltransform filtering (BM3D) is a two steps state-ofthe-art algorithm that uses the redundancy of similar blocks innoisy image for removing noise. Similar blocks which can havesome overlap are found by a block matching method and groupedto make 3-D blocks for 3-D transform filtering. In this paper wepropose a new block grouping algorithm in th...

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

in this research, to considering the theoretical background of the research andmodel of organizational justice, ten items were designed; then, thirty-two variableswere extracted. finally, the matching variables with model of organizational justicewere performed. the proposed model was designed according to the extractionvariables and their matching. to structural and conceptual validation, the ...

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...