Introduction . Keywords, reflecting the main content of article, play an extremely important role in search for scientific papers databases. Together with title and abstract, keywords provide primary information about study. Selecting extracting effective is a time-consuming process, so its optimization requires further studying. Purpose. The article aimed at acquainting authors journal methods...

Acta Academica is an accredited, open access South African journal dedicated to scholarship in the humanities. The publishes independently refereed research articles It promotes perspectives of critical social theory and engagements with postcolonial post-developmental debates special references (Southern) Africa. thereby support scholarly work that examines how humanities twenty-first century ...

We study codes with parameters of the ternary Hamming $(n=(3^m-1)/2,3^{n-m},3)$ code, i.e., $1$-perfect codes. The rank code is defined to be dimension its affine span. characterize $n-m+1$, count their number, and prove that all such can obtained from each other by a sequence two-coordinate switchings. enumerate length $13$ concatenation lengths $9$ $4$; we find there are $93241327$ equivalenc...

The complexity of distributed and decentralized systems demands new tools for designing and programming processes. An idea of autonomous agents that arises as an extension of the object and process concepts may be applied to distributed and decentralized systems development ([9],[11]). In the paper the authors have undertaken an attempt to describe formally the architecture of multiagent system...

A graph G with a perfect matching is Pfaffian if it admits an orientation D such that every central cycle C (i.e. C is of even size and G − V (C) has a perfect matching) has an odd number of edges oriented in either direction of the cycle. It is known that the number of perfect matchings of a Pfaffian graph can be computed in polynomial time. In this paper, we show that every embedding of a Pfa...

We exploit the technique of Galvin (1995) to prove that an orientation D of a line-graph G (of a multigraph) is kernel-perfect if and only if every oriented odd cycle in D has a chord (or pseudochord) and every clique has a kernel. @ 1998 Elsevier Science B.V. All rights reserved

We developed minimal perfect hash functions for a variety of datasets using the probabilistic process of simulated annealing (SA). The SA solution structure is a tree representing an annealed program (algorithm). This solution structure is similar to the structure used in genetic programming. When executed, the SA program produces multiple hash functions for the given data set. An initial hash ...

A failure detection service is perfect if it eventually detects all failures and every detection correctly identifies a failure that has already occurred. Such a perfect failure detection service serves as a basic building block for many reliable distributed systems, for example in primary/backup replication protocols and distributed lock services. In this paper, we present a comprehensive stud...