General bounds for identifying codes in some infinite regular graphs.
Parikh matrices have become a useful tool for investigation of subword structure of words. Several generalizations of this concept have been considered. Based on the concept of formal power series, we describe a general framework covering most of these generalizations. In addition, we provide a new characterization of binary amiable words – words having a common Parikh matrix.
In this paper, we generalize the noisy-or model. The generalizations are three-fold. First, we allow parents to be multivalued ordinal variables. Second, parents can have both positive and negative influences on their common child. Third, we describe how the suggested generalization can be extended to multivalued child variables. The major advantage of our generalizations is that they require only one parameter per parent. We suggest a model learning method and report results of experiments on the...
Expansions in noninteger bases often appear in number theory and probability theory, and they are closely connected to ergodic theory, measure theory and topology. For two-letter alphabets the golden ratio plays a special role: in smaller bases only trivial expansions are unique, whereas in greater bases there exist nontrivial unique expansions. In this paper we determine the corresponding critical bases for all three-letter alphabets and we establish the fractal nature of these bases in dependence...
Möbius transformation is an important tool for establishing weights of compositional expert systems rules from conditional weights. In this paper, an applicability of Möbius transformation of rule bases is also extended to knowledge bases with elementary disjunctions in antecedents of rules. This paper contains an existence theorem, an algorithm of the transformation and some open problems which tend to maximal generality as well.
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshko ff and Lubomir Tschakaloff , Sofi a, July, 2006.Component-based software engineering and software architecture are tightly connected areas in computer science. Software architecture presents the functionality of the system as decomposition into components, the properties of these components and the connectors between them. This paper illustrates a methodology for application...
Let be a closed algebraic subvariety of the -dimensional projective space over the complex or real numbers and suppose that is non-empty and equidimensional. In this paper we generalize the classic notion of polar variety of associated with a given linear subvariety of the ambient space of . As particular instances of this new notion of generalized polar variety we reobtain the classic ones and two new types of polar varieties, called dual and (in case that is affine) conic. We show that...