In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

in this paper various arch models and relevant news impact curves including a partially nonparametric (pnp) one are compared and estimated with daily iran stock return data. diagnostic tests imply the asymmetry of the volatility response to news. the egarch model, which passes all the tests and appears relatively matching with the asymmetry in the data, seems to be the most adequate characteriz...

This paper considers a decentralized process in many-to-many matching problems. We show that if agents on one side of the market have substitutable preferences and those on the other side have responsive preferences, then, from an arbitrary matching, there exists a finite path of matchings such that each matching on the path is formed by satisfying a blocking individual or a blocking pair for t...

Process model matching provides the basis for many process analysis techniques such as inconsistency detection and process querying. The matching task refers to the automatic identification of correspondences between activities in two process models. Numerous techniques have been developed for this purpose, all share a focus on process-level information. In this paper we introduce instance-base...

In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...