Generalized Selective Decryption (GSD), introduced by Panjwani [TCC’07], is a game for a symmetric encryption scheme Enc that captures the difficulty of proving adaptive security of certain protocols, most notably the Logical Key Hierarchy (LKH) multicast encryption protocol. In the GSD game there are n keys k1, . . . , kn, which the adversary may adaptively corrupt (learn); moreover, it can as...

We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...

In this paper we introduce a class of trees, called generalized compressed trees. Generalized compressed trees can be derived from complete binary trees by performing certain `contraction' operations. A generalized compressed tree CT of height h has approximately 25% fewer nodes than a complete binary tree T of height h. We show that these trees have smaller (up to a 74% reduction) 2-dimensiona...

We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a technique for deciding the satisfiability problem. In the case of words this gives a new proof of ExpSpace upper bound, and in the case of trees it gives a ...

one of important resources for recognizing iranian islamic garden and gardening is the book of abu nasr heravi, ershād al-zerā’a. the author, qasim-ibn yusuf abu nasr, lived in the city of herat and the book is related to the late period of timurid (about 921/1515). this book is a valuable resource in the subject of agriculture and gardenin. the purpose of gardening and agriculture, planting me...

The speech enhancement techniques are often employed to improve the quality and intelligibility of the noisy speech signals. This paper discusses a novel technique for speech enhancement which is based on Singular Value Decomposition. This implementation utilizes a Genetic Algorithm based optimization method for reducing the effects of environmental noises from the singular vectors as well as t...

This paper highlights the two machine learning approaches, viz. Rough Sets and Decision Trees (DT), for the prediction of Learning Disabilities (LD) in school-age children, with an emphasis on applications of data mining. Learning disability prediction is a very complicated task. By using these two approaches, we can easily and accurately predict LD in any child and also we can determine the be...

In this paper we continue the theoretical study of the possible applications of the ∆-tree data structure for multiple-valued logics, specifically, to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfi...

The study of limits of graphs led to elegant limit structures for sparse and dense graphs. This has been unified and generalized by the authors in a more general setting combining analytic tools and model theory to FO-limits (and X-limits) and to the notion of modeling. The existence of modeling limits was established for sequences in a bounded degree class and, in addition, to the case of clas...

The statistical analysis of tree structured data is a new topic in statistics with wide application areas. Some Principal Component Analysis (PCA) ideas were previously developed for binary tree spaces. In this study, we extend these ideas to the more general space of rooted and labeled trees. We re-define concepts such as tree-line and forward principal component tree-line for this more genera...