Comparing multifractal formalisms: the neighboring boxes condition
نویسندگان
چکیده
منابع مشابه
Comparing Prosody Formalisms for Machine Learning
We need to find the most suitable prosody formalism for the task of machine learning. The target application is a prosody generative module for text-to-speech synthesis. This module will learn prosody marks (parameters or symbols) from large corpora. Formalism we are looking for should be general, perceptually relevant, restorable, automatically obtained, objective and learnable. Main formalism...
متن کاملMultifractal Measures and a Weak Separation Condition
We define a new separation property on the family of contractive similitudes that allows certain overlappings. This property is weaker than the open set condition of Hutchinson. It includes the well-known class of infinite Bernoulli convolutions associated with the P.V. numbers and the solutions of the two-scale dilation equations. Our main purpose in this paper is to prove the multifractal for...
متن کاملComparing the Apgar Score Representation in HL7 and OpenEHR Formalisms
Semantic interoperability, a prerequisite to eHealth projects, relies on sharing both information and knowledge models between information systems. Two of the standards of information models are HL7 v3 and the European norm, EN13606/OpenEHR. The paper compares both standards on a fragment of the prenatal medical record, the APGAR score. Two factors are compared: the formal representation of bot...
متن کاملComparing Space Efficiency of Propositional Knowledge Representation Formalisms
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. Informally, the space efficiency of a formalism F in representing a certain piece of knowledge α, is the size of the shortest formula of F that represents α. In this paper we assume that knowledge is either a set of propositional interpretations or a set of formulae (theorems). We provide a formal w...
متن کاملComparing Space E ciency of Propositional Knowledge Representation Formalisms
We investigate the space eeciency of a Propositional Knowledge Representation (PKR) formalism. Informally, the space ef-ciency of a formalism F in representing a certain piece of knowledge , is the size of the shortest formula of F that represents. In this paper we assume that knowledge is either a set of propositional interpretations or a set of formulae (theorems). We provide a formal way of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian Journal of Mathematics
سال: 2003
ISSN: 1093-6106,1945-0036
DOI: 10.4310/ajm.2003.v7.n2.a1