The relationship of the colonial morphology of Pasteurella pestis to its virulence has been controversial. Gotschlich (1900), Markl (1914), Petrie (1929), Burgess (1930), Otten (1936), Bhatnagar (1940) and Jawetz and Meyer (1943) described numerous colonial types for which interchangeable descriptions are lacking. Most agreed upon an inconstant hereditary transmission of colonial characteristic...

in this study, we considered some competitive learning methods which include hard competitive learning (hcl) and soft competitive learning (scl) with/ without fixed network dimensionality for reliability analysis in microarrays. in order to have a more extensive view, and keeping in mind that competitive learning methods aim at error minimization or entropy maximization (different kinds of func...

Although the colonial ideology often masks the fact, diplomacy has been a major part of the colonial encounter. In Canada, diplomacy in its many guises has been carried out between the colonizing Europeans and EuroCanadians since first contact between them. This diplomacy can be immediately broken up into at least two distinct periods: pre-colonial and colonial diplomacy. The first is marked by...

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

This paper presents and discusses some competitive learning algorithms for data clustering. A new competitive learning algorithm, named the dynamically penalized rival competitive learning algorithm (DPRCL), is introduced and studied. It is a variant of the rival penalized competitive algorithm [1] and it performs appropriate clustering without knowing the clusters number, by automatically driv...

Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...

We consider the problem of scheduling resource allocation where a change in allocation results in a changeover penalty of one time slot. We assume that we are sending packets over a wireless channel of uncertain and varying capacity. In each time slot, a bandwidth of at most the current capacity can be allocated, but changing the capacity has a cost, which is modeled as an empty time slot. Only...

We study the advice complexity of online buffer management. Advice complexity measures the amount of information about the future that an online algorithm needs to achieve optimality or a good competitive ratio. We study the 2-valued buffer management problem in both preemptive and nonpreemptive models and prove lower and upper bounds on the number of bits required by an optimal online algorith...

We are given an unknown binary matrix, where the entries correspond to preferences of users on items. We want to find at least one 1-entry in each row with a minimum number of queries. The number of queries needed heavily depends on the input matrix and a straightforward competitive analysis yields bad results for any online algorithm. Therefore, we analyze our algorithm against a weaker offlin...

Only recently progress has been made in obtaining o(log(rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a O( √ log(rank))-competitive procedure, and Lachish (2014) later presented a O(log log(rank))competitive algorithm. Both these algorithms and their analyses are very involved, which is also reflected in the extremely h...