Let $R$ be a commutative ring and $mathbb{A}(R)$ be the set of all ideals with non-zero annihilators. Assume that $mathbb{A}^*(R)=mathbb{A}(R)diagdown {0}$ and $mathbb{F}(R)$ denote the set of all finitely generated ideals of $R$. In this paper, we introduce and investigate the {it finitely generated subgraph} of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_F(R)$. It is the (undi...

The classical models of evolution have been developed to incorporate structured populations using evolutionary graph theory and, more recently, a new framework has been developed to allow for more flexible population structures which potentially change through time and can accommodate multiplayer games with variable group sizes. In this paper we extend this work in three key ways. Firstly by de...

Distributed blackboard is one of the popular agent communication architectures. However, in current agent systems, the distributed blackboard architecture is kept fixed after its initial setting, which may influence the system performance when network topology or agent cooperation relations are changed during operation. To solve the problem, this paper presents a novel mechanism for adjusting a...

The 3-Colouring of a graph is a classic NP-complete problem. We show that some solutions for the 3-Colouring can be built in polynomial time based on the number of basic cycles existing in the graph. For this, we design a reduction from proper 3-Colouring of a graph G to a 2-CF Boolean formula FG, where the number of clauses in FG depends on the number of basic cycles in G. Any model of FG prov...

We resolve a number of long-standing open problems in online graph coloring. More specifically, we develop tight lower bounds on the performance of online algorithms for fundamental graph classes. An important contribution is that our bounds also hold for randomized online algorithms, for which hardly any results were known. Technically, we construct lower bounds for chordal graphs. The constru...

AIMS AND BACKGROUND Human malignant melanoma is a very aggressive and highly angiogenesis-dependent tumor. Basic fibroblast growth factor and angiogenin are the potentially important angiogenic factors for melanoma progression and metastasis. Many studies have mainly focused on how they induce angiogenesis. In the present study, we investigated the effects of basic fibroblast growth factor on t...

This paper describes basic programming technology to support irregular applications on scalable concurrent hardware and shows how the technology has been applied to a variety of large-scale industrial application problems. The technology is based on the concept of a concurrent graph library that provides an adaptive collection of lightweight threads that may relocate between computers dynamical...

Consider a computation on a massive random graph: Does one need to generate the whole random graph up front, prior to performing the computation? Or, is it possible to provide an oracle to answer queries to the random graph ”on-the-fly” in a much more efficient manner overall? That is, to provide a local access generator which incrementally constructs the random graph locally, at the queried po...

Handwritten signature is being used in various applications on daily basis. The problem arises when someone decides to imitate our signature and steal our identity. Therefore, there is a need for adequate protection of signatures and a need for systems that can, with a great degree of certainty, identify who is the signatory. This paper presents previous work in the field of signature and write...