Tea time! Gold nanoparticles (GNPs) could be readily prepared by a general strategy involving the reduction of aqueous HAuCl4 in the presence of traditional Chinese medicines (TCMs). Spheroidal and triangular gold nanoparticles were observed depending on the TCM used. The strategy exemplified the universal application of plant bioresources for the synthesis of GNPs and catalytic purposes.
In this article,the authors obtain an inequality of homogeneous expansion for f,where f is a quasi-convex mapping(including quasi-convex mapping of type A and quasi-convex mapping of type B)defined on the open unit polydisk in C n .Meanwhile,the authors also investigate its application. 相似文献
The aim of this paper is to discuss the no-arbitrage condition in option implied trees based on forward induction and to propose a no-arbitrage test that rules out the negative probabilities problem and hence enhances the pricing performance. The no-arbitrage condition takes into account two main features: the position of the node in the tree and the relation between the dividend yield and the risk-free rate. The proposed methodology is tested in and out of sample with Italian index options data and findings support a good pricing performance. 相似文献
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a perfect ball whenever it can be, provided the initial rotor configuration is acyclic (that is, no two neighboring vertices have rotors pointing to one another). This is proved by defining the rotor-router group of a graph, which we show is isomorphic to the sandpile group. We also address the question of recurrence and transience: We give two rotor configurations on the infinite ternary tree, one for which chips exactly alternate escaping to infinity with returning to the origin, and one for which every chip returns to the origin. Further, we characterize the possible “escape sequences” for the ternary tree, that is, binary words a1…an for which there exists a rotor configuration so that the kth chip escapes to infinity if and only if ak=1. 相似文献
We study the complexity of the problem of deciding the existence of a spanning subgraph of a given graph, and of that of finding a maximum (weight) such subgraph. We establish some general relations between these problems, and we use these relations to obtain new NP-completeness results for maximum (weight) spanning subgraph problems from analogous results for existence problems and from results in extremal graph theory. On the positive side, we provide a decomposition method for the maximum (weight) spanning chordal subgraph problem that can be used, e.g., to obtain a linear (or O(nlogn)) time algorithm for such problems in graphs with vertex degree bounded by 3. 相似文献
A Hamming space Λn consists of all sequences of length n over an alphabet Λ and is endowed with the Hamming distance. In particular, any set of aligned DNA sequences of fixed length constitutes a subspace of a Hamming space with respect to mismatch distance. The quasi-median operation returns for any three sequences u,v,w the sequence which in each coordinate attains either the majority coordinate from u,v,w or else (in the case of a tie) the coordinate of the first entry, u; for a subset of Λn the iterative application of this operation stabilizes in its quasi-median hull. We show that for every finite tree interconnecting a given subset X of Λn there exists a shortest realization within Λn for which all interior nodes belong to the quasi-median hull of X. Hence the quasi-median hull serves as a Steiner hull for the Steiner problem in Hamming space. 相似文献
We present a new representation of a chordal graph called the clique-separator graph, whose nodes are the maximal cliques and minimal vertex separators of the graph. We present structural properties of the clique-separator graph and additional properties when the chordal graph is an interval graph, proper interval graph, or split graph. We also characterize proper interval graphs and split graphs in terms of the clique-separator graph. We present an algorithm that constructs the clique-separator graph of a chordal graph in O(n3) time and of an interval graph in O(n2) time, where n is the number of vertices in the graph. 相似文献